./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/combinations/pals_lcr.3.ufo.BOUNDED-6.pals+Problem12_label04.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 3289d67d 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.BOUNDED-6.pals+Problem12_label04.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 70f2952113e7c5d0a919874ec9c1eb9d51aba80929eec498cecad1707afba9bd --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-3289d67-m [2024-11-16 09:33:48,166 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-16 09:33:48,241 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-16 09:33:48,248 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-16 09:33:48,248 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-16 09:33:48,276 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-16 09:33:48,277 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-16 09:33:48,277 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-16 09:33:48,278 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-16 09:33:48,278 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-16 09:33:48,278 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-16 09:33:48,279 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-16 09:33:48,279 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-16 09:33:48,280 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-16 09:33:48,280 INFO L153 SettingsManager]: * Use SBE=true [2024-11-16 09:33:48,280 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-16 09:33:48,283 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-16 09:33:48,284 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-16 09:33:48,284 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-16 09:33:48,284 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-16 09:33:48,284 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-16 09:33:48,285 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-16 09:33:48,285 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-16 09:33:48,286 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-16 09:33:48,286 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-16 09:33:48,286 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-16 09:33:48,286 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-16 09:33:48,287 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-16 09:33:48,287 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-16 09:33:48,287 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-16 09:33:48,288 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-16 09:33:48,288 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-16 09:33:48,288 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 09:33:48,288 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-16 09:33:48,289 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-16 09:33:48,289 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-16 09:33:48,289 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-16 09:33:48,289 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-16 09:33:48,290 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-16 09:33:48,290 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-16 09:33:48,290 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-16 09:33:48,291 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-16 09:33:48,291 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 -> 70f2952113e7c5d0a919874ec9c1eb9d51aba80929eec498cecad1707afba9bd [2024-11-16 09:33:48,536 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-16 09:33:48,564 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-16 09:33:48,568 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-16 09:33:48,570 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-16 09:33:48,570 INFO L274 PluginConnector]: CDTParser initialized [2024-11-16 09:33:48,571 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/combinations/pals_lcr.3.ufo.BOUNDED-6.pals+Problem12_label04.c [2024-11-16 09:33:50,079 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-16 09:33:50,494 INFO L384 CDTParser]: Found 1 translation units. [2024-11-16 09:33:50,496 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pals_lcr.3.ufo.BOUNDED-6.pals+Problem12_label04.c [2024-11-16 09:33:50,531 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/07ad488ae/8e7db07404984a47808d55cb30894d99/FLAG3cf1473c0 [2024-11-16 09:33:50,550 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/07ad488ae/8e7db07404984a47808d55cb30894d99 [2024-11-16 09:33:50,554 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-16 09:33:50,555 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-16 09:33:50,557 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-16 09:33:50,557 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-16 09:33:50,563 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-16 09:33:50,564 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 09:33:50" (1/1) ... [2024-11-16 09:33:50,565 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2fb3eb83 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 09:33:50, skipping insertion in model container [2024-11-16 09:33:50,565 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 09:33:50" (1/1) ... [2024-11-16 09:33:50,692 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-16 09:33:51,042 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.BOUNDED-6.pals+Problem12_label04.c[6354,6367] [2024-11-16 09:33:51,107 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.BOUNDED-6.pals+Problem12_label04.c[13415,13428] [2024-11-16 09:33:51,730 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 09:33:51,744 INFO L200 MainTranslator]: Completed pre-run [2024-11-16 09:33:51,780 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.BOUNDED-6.pals+Problem12_label04.c[6354,6367] [2024-11-16 09:33:51,799 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.BOUNDED-6.pals+Problem12_label04.c[13415,13428] [2024-11-16 09:33:52,168 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 09:33:52,237 INFO L204 MainTranslator]: Completed translation [2024-11-16 09:33:52,238 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 09:33:52 WrapperNode [2024-11-16 09:33:52,238 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-16 09:33:52,240 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-16 09:33:52,240 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-16 09:33:52,240 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-16 09:33:52,252 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 09:33:52" (1/1) ... [2024-11-16 09:33:52,317 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 09:33:52" (1/1) ... [2024-11-16 09:33:52,661 INFO L138 Inliner]: procedures = 33, calls = 19, calls flagged for inlining = 14, calls inlined = 14, statements flattened = 4981 [2024-11-16 09:33:52,662 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-16 09:33:52,662 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-16 09:33:52,663 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-16 09:33:52,663 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-16 09:33:52,687 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 09:33:52" (1/1) ... [2024-11-16 09:33:52,690 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 09:33:52" (1/1) ... [2024-11-16 09:33:52,834 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 09:33:52" (1/1) ... [2024-11-16 09:33:52,985 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-16 09:33:52,986 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 09:33:52" (1/1) ... [2024-11-16 09:33:52,986 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 09:33:52" (1/1) ... [2024-11-16 09:33:53,172 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 09:33:52" (1/1) ... [2024-11-16 09:33:53,190 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 09:33:52" (1/1) ... [2024-11-16 09:33:53,215 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 09:33:52" (1/1) ... [2024-11-16 09:33:53,232 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 09:33:52" (1/1) ... [2024-11-16 09:33:53,274 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-16 09:33:53,275 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-16 09:33:53,275 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-16 09:33:53,275 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-16 09:33:53,276 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 09:33:52" (1/1) ... [2024-11-16 09:33:53,282 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 09:33:53,295 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 09:33:53,314 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-16 09:33:53,317 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-16 09:33:53,360 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-16 09:33:53,360 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-16 09:33:53,360 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-16 09:33:53,360 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-16 09:33:53,444 INFO L256 CfgBuilder]: Building ICFG [2024-11-16 09:33:53,446 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-16 09:33:57,912 INFO L1250 $ProcedureCfgBuilder]: dead code at ProgramPoint L1982: havoc calculate_output_#t~ret30#1; [2024-11-16 09:33:57,913 INFO L1250 $ProcedureCfgBuilder]: dead code at ProgramPoint L3461: havoc calculate_output2_#t~ret31#1; [2024-11-16 09:33:57,913 INFO L1250 $ProcedureCfgBuilder]: dead code at ProgramPoint L4951: havoc calculate_output3_#t~ret32#1; [2024-11-16 09:33:58,112 INFO L? ?]: Removed 732 outVars from TransFormulas that were not future-live. [2024-11-16 09:33:58,113 INFO L307 CfgBuilder]: Performing block encoding [2024-11-16 09:33:58,155 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-16 09:33:58,155 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-16 09:33:58,155 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 09:33:58 BoogieIcfgContainer [2024-11-16 09:33:58,155 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-16 09:33:58,158 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-16 09:33:58,158 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-16 09:33:58,162 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-16 09:33:58,162 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.11 09:33:50" (1/3) ... [2024-11-16 09:33:58,163 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6f16135b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 09:33:58, skipping insertion in model container [2024-11-16 09:33:58,163 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 09:33:52" (2/3) ... [2024-11-16 09:33:58,163 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6f16135b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 09:33:58, skipping insertion in model container [2024-11-16 09:33:58,163 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 09:33:58" (3/3) ... [2024-11-16 09:33:58,165 INFO L112 eAbstractionObserver]: Analyzing ICFG pals_lcr.3.ufo.BOUNDED-6.pals+Problem12_label04.c [2024-11-16 09:33:58,183 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-16 09:33:58,183 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-11-16 09:33:58,270 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-16 09:33:58,277 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;@13b43770, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-16 09:33:58,278 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-11-16 09:33:58,286 INFO L276 IsEmpty]: Start isEmpty. Operand has 879 states, 876 states have (on average 1.8995433789954337) internal successors, (1664), 878 states have internal predecessors, (1664), 0 states have call successors, (0), 0 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-16 09:33:58,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-11-16 09:33:58,294 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 09:33:58,295 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-16 09:33:58,295 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 09:33:58,299 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 09:33:58,300 INFO L85 PathProgramCache]: Analyzing trace with hash 159669486, now seen corresponding path program 1 times [2024-11-16 09:33:58,308 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 09:33:58,308 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [272544618] [2024-11-16 09:33:58,308 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 09:33:58,309 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 09:33:58,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 09:33:58,561 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-16 09:33:58,562 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 09:33:58,562 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [272544618] [2024-11-16 09:33:58,563 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [272544618] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 09:33:58,563 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 09:33:58,564 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-16 09:33:58,565 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1705448219] [2024-11-16 09:33:58,566 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 09:33:58,571 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-16 09:33:58,572 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 09:33:58,599 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-16 09:33:58,600 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-16 09:33:58,605 INFO L87 Difference]: Start difference. First operand has 879 states, 876 states have (on average 1.8995433789954337) internal successors, (1664), 878 states have internal predecessors, (1664), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 11.0) 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-16 09:33:58,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 09:33:58,708 INFO L93 Difference]: Finished difference Result 1734 states and 3286 transitions. [2024-11-16 09:33:58,709 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-16 09:33:58,710 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 11.0) 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-16 09:33:58,711 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 09:33:58,731 INFO L225 Difference]: With dead ends: 1734 [2024-11-16 09:33:58,731 INFO L226 Difference]: Without dead ends: 811 [2024-11-16 09:33:58,738 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-16 09:33:58,741 INFO L432 NwaCegarLoop]: 1596 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1596 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-16 09:33:58,742 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1596 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-16 09:33:58,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 811 states. [2024-11-16 09:33:58,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 811 to 811. [2024-11-16 09:33:58,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 811 states, 809 states have (on average 1.8899876390605685) internal successors, (1529), 810 states have internal predecessors, (1529), 0 states have call successors, (0), 0 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-16 09:33:58,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 811 states to 811 states and 1529 transitions. [2024-11-16 09:33:58,829 INFO L78 Accepts]: Start accepts. Automaton has 811 states and 1529 transitions. Word has length 22 [2024-11-16 09:33:58,830 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 09:33:58,830 INFO L471 AbstractCegarLoop]: Abstraction has 811 states and 1529 transitions. [2024-11-16 09:33:58,830 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 11.0) 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-16 09:33:58,830 INFO L276 IsEmpty]: Start isEmpty. Operand 811 states and 1529 transitions. [2024-11-16 09:33:58,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-11-16 09:33:58,831 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 09:33:58,832 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-16 09:33:58,832 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-16 09:33:58,833 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 09:33:58,833 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 09:33:58,834 INFO L85 PathProgramCache]: Analyzing trace with hash -350864691, now seen corresponding path program 1 times [2024-11-16 09:33:58,834 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 09:33:58,834 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1730067457] [2024-11-16 09:33:58,834 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 09:33:58,834 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 09:33:58,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 09:33:59,034 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-16 09:33:59,035 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 09:33:59,035 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1730067457] [2024-11-16 09:33:59,035 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1730067457] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 09:33:59,035 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 09:33:59,035 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-16 09:33:59,036 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1403368102] [2024-11-16 09:33:59,036 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 09:33:59,039 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-16 09:33:59,039 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 09:33:59,040 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-16 09:33:59,042 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-16 09:33:59,044 INFO L87 Difference]: Start difference. First operand 811 states and 1529 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-16 09:33:59,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 09:33:59,166 INFO L93 Difference]: Finished difference Result 881 states and 1633 transitions. [2024-11-16 09:33:59,167 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-16 09:33:59,167 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-16 09:33:59,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 09:33:59,172 INFO L225 Difference]: With dead ends: 881 [2024-11-16 09:33:59,173 INFO L226 Difference]: Without dead ends: 844 [2024-11-16 09:33:59,174 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-16 09:33:59,175 INFO L432 NwaCegarLoop]: 1525 mSDtfsCounter, 49 mSDsluCounter, 4553 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 6078 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-16 09:33:59,176 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 6078 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-16 09:33:59,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 844 states. [2024-11-16 09:33:59,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 844 to 811. [2024-11-16 09:33:59,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 811 states, 809 states have (on average 1.8702101359703338) internal successors, (1513), 810 states have internal predecessors, (1513), 0 states have call successors, (0), 0 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-16 09:33:59,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 811 states to 811 states and 1513 transitions. [2024-11-16 09:33:59,213 INFO L78 Accepts]: Start accepts. Automaton has 811 states and 1513 transitions. Word has length 22 [2024-11-16 09:33:59,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 09:33:59,213 INFO L471 AbstractCegarLoop]: Abstraction has 811 states and 1513 transitions. [2024-11-16 09:33:59,214 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-16 09:33:59,215 INFO L276 IsEmpty]: Start isEmpty. Operand 811 states and 1513 transitions. [2024-11-16 09:33:59,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-11-16 09:33:59,218 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 09:33:59,218 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-16 09:33:59,218 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-16 09:33:59,219 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 09:33:59,219 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 09:33:59,219 INFO L85 PathProgramCache]: Analyzing trace with hash 644860677, now seen corresponding path program 1 times [2024-11-16 09:33:59,219 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 09:33:59,220 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1879910266] [2024-11-16 09:33:59,220 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 09:33:59,221 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 09:33:59,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 09:33:59,439 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-16 09:33:59,440 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 09:33:59,440 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1879910266] [2024-11-16 09:33:59,440 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1879910266] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 09:33:59,441 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 09:33:59,441 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-16 09:33:59,441 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1129086323] [2024-11-16 09:33:59,442 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 09:33:59,442 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-16 09:33:59,443 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 09:33:59,443 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-16 09:33:59,444 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-16 09:33:59,444 INFO L87 Difference]: Start difference. First operand 811 states and 1513 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-16 09:33:59,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 09:33:59,586 INFO L93 Difference]: Finished difference Result 1009 states and 1813 transitions. [2024-11-16 09:33:59,587 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-16 09:33:59,588 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-16 09:33:59,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 09:33:59,593 INFO L225 Difference]: With dead ends: 1009 [2024-11-16 09:33:59,593 INFO L226 Difference]: Without dead ends: 976 [2024-11-16 09:33:59,595 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-16 09:33:59,596 INFO L432 NwaCegarLoop]: 1509 mSDtfsCounter, 4611 mSDsluCounter, 388 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4611 SdHoareTripleChecker+Valid, 1897 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-16 09:33:59,597 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4611 Valid, 1897 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-16 09:33:59,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 976 states. [2024-11-16 09:33:59,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 976 to 841. [2024-11-16 09:33:59,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 841 states, 839 states have (on average 1.8581644815256257) internal successors, (1559), 840 states have internal predecessors, (1559), 0 states have call successors, (0), 0 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-16 09:33:59,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 841 states to 841 states and 1559 transitions. [2024-11-16 09:33:59,623 INFO L78 Accepts]: Start accepts. Automaton has 841 states and 1559 transitions. Word has length 37 [2024-11-16 09:33:59,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 09:33:59,623 INFO L471 AbstractCegarLoop]: Abstraction has 841 states and 1559 transitions. [2024-11-16 09:33:59,624 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-16 09:33:59,624 INFO L276 IsEmpty]: Start isEmpty. Operand 841 states and 1559 transitions. [2024-11-16 09:33:59,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-11-16 09:33:59,626 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 09:33:59,626 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-16 09:33:59,626 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-16 09:33:59,627 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 09:33:59,627 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 09:33:59,628 INFO L85 PathProgramCache]: Analyzing trace with hash -769786777, now seen corresponding path program 1 times [2024-11-16 09:33:59,628 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 09:33:59,628 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1301562936] [2024-11-16 09:33:59,628 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 09:33:59,628 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 09:33:59,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 09:33:59,860 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-16 09:33:59,861 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 09:33:59,861 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1301562936] [2024-11-16 09:33:59,861 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1301562936] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 09:33:59,861 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 09:33:59,861 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-16 09:33:59,862 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [293095253] [2024-11-16 09:33:59,862 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 09:33:59,862 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-16 09:33:59,862 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 09:33:59,863 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-16 09:33:59,863 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-16 09:33:59,863 INFO L87 Difference]: Start difference. First operand 841 states and 1559 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-16 09:33:59,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 09:33:59,931 INFO L93 Difference]: Finished difference Result 907 states and 1657 transitions. [2024-11-16 09:33:59,931 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-16 09:33:59,932 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-16 09:33:59,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 09:33:59,935 INFO L225 Difference]: With dead ends: 907 [2024-11-16 09:33:59,936 INFO L226 Difference]: Without dead ends: 844 [2024-11-16 09:33:59,936 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2024-11-16 09:33:59,937 INFO L432 NwaCegarLoop]: 1508 mSDtfsCounter, 2954 mSDsluCounter, 95 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2954 SdHoareTripleChecker+Valid, 1603 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-16 09:33:59,938 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2954 Valid, 1603 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-16 09:33:59,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 844 states. [2024-11-16 09:33:59,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 844 to 841. [2024-11-16 09:33:59,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 841 states, 839 states have (on average 1.8569725864123956) internal successors, (1558), 840 states have internal predecessors, (1558), 0 states have call successors, (0), 0 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-16 09:33:59,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 841 states to 841 states and 1558 transitions. [2024-11-16 09:33:59,955 INFO L78 Accepts]: Start accepts. Automaton has 841 states and 1558 transitions. Word has length 39 [2024-11-16 09:33:59,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 09:33:59,955 INFO L471 AbstractCegarLoop]: Abstraction has 841 states and 1558 transitions. [2024-11-16 09:33:59,956 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-16 09:33:59,956 INFO L276 IsEmpty]: Start isEmpty. Operand 841 states and 1558 transitions. [2024-11-16 09:33:59,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-11-16 09:33:59,957 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 09:33:59,957 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-16 09:33:59,957 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-16 09:33:59,957 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 09:33:59,958 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 09:33:59,958 INFO L85 PathProgramCache]: Analyzing trace with hash -664734402, now seen corresponding path program 1 times [2024-11-16 09:33:59,958 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 09:33:59,958 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1540344158] [2024-11-16 09:33:59,959 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 09:33:59,959 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 09:33:59,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 09:34:00,012 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-16 09:34:00,013 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 09:34:00,013 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1540344158] [2024-11-16 09:34:00,013 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1540344158] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 09:34:00,013 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 09:34:00,014 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-16 09:34:00,014 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [800686085] [2024-11-16 09:34:00,014 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 09:34:00,014 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 09:34:00,014 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 09:34:00,015 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 09:34:00,015 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 09:34:00,015 INFO L87 Difference]: Start difference. First operand 841 states and 1558 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-16 09:34:00,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 09:34:00,043 INFO L93 Difference]: Finished difference Result 955 states and 1728 transitions. [2024-11-16 09:34:00,043 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 09:34:00,043 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-16 09:34:00,044 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 09:34:00,047 INFO L225 Difference]: With dead ends: 955 [2024-11-16 09:34:00,047 INFO L226 Difference]: Without dead ends: 892 [2024-11-16 09:34:00,048 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-16 09:34:00,049 INFO L432 NwaCegarLoop]: 1519 mSDtfsCounter, 1470 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1470 SdHoareTripleChecker+Valid, 1564 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-16 09:34:00,049 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1470 Valid, 1564 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-16 09:34:00,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 892 states. [2024-11-16 09:34:00,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 892 to 889. [2024-11-16 09:34:00,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 889 states, 887 states have (on average 1.8354002254791433) internal successors, (1628), 888 states have internal predecessors, (1628), 0 states have call successors, (0), 0 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-16 09:34:00,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 889 states to 889 states and 1628 transitions. [2024-11-16 09:34:00,072 INFO L78 Accepts]: Start accepts. Automaton has 889 states and 1628 transitions. Word has length 40 [2024-11-16 09:34:00,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 09:34:00,073 INFO L471 AbstractCegarLoop]: Abstraction has 889 states and 1628 transitions. [2024-11-16 09:34:00,074 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-16 09:34:00,074 INFO L276 IsEmpty]: Start isEmpty. Operand 889 states and 1628 transitions. [2024-11-16 09:34:00,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2024-11-16 09:34:00,075 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 09:34:00,075 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-16 09:34:00,075 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-16 09:34:00,076 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 09:34:00,076 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 09:34:00,076 INFO L85 PathProgramCache]: Analyzing trace with hash 307573737, now seen corresponding path program 1 times [2024-11-16 09:34:00,076 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 09:34:00,076 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1519063935] [2024-11-16 09:34:00,077 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 09:34:00,077 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 09:34:00,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 09:34:00,124 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-16 09:34:00,124 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 09:34:00,124 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1519063935] [2024-11-16 09:34:00,125 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1519063935] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 09:34:00,125 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 09:34:00,125 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-16 09:34:00,125 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1322750450] [2024-11-16 09:34:00,125 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 09:34:00,126 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 09:34:00,126 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 09:34:00,126 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 09:34:00,127 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 09:34:00,127 INFO L87 Difference]: Start difference. First operand 889 states and 1628 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-16 09:34:00,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 09:34:00,160 INFO L93 Difference]: Finished difference Result 1010 states and 1808 transitions. [2024-11-16 09:34:00,160 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 09:34:00,161 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-16 09:34:00,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 09:34:00,164 INFO L225 Difference]: With dead ends: 1010 [2024-11-16 09:34:00,164 INFO L226 Difference]: Without dead ends: 947 [2024-11-16 09:34:00,165 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-16 09:34:00,167 INFO L432 NwaCegarLoop]: 1547 mSDtfsCounter, 1480 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1480 SdHoareTripleChecker+Valid, 1598 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-16 09:34:00,167 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1480 Valid, 1598 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-16 09:34:00,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 947 states. [2024-11-16 09:34:00,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 947 to 944. [2024-11-16 09:34:00,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 944 states, 942 states have (on average 1.813163481953291) internal successors, (1708), 943 states have internal predecessors, (1708), 0 states have call successors, (0), 0 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-16 09:34:00,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 944 states to 944 states and 1708 transitions. [2024-11-16 09:34:00,192 INFO L78 Accepts]: Start accepts. Automaton has 944 states and 1708 transitions. Word has length 41 [2024-11-16 09:34:00,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 09:34:00,193 INFO L471 AbstractCegarLoop]: Abstraction has 944 states and 1708 transitions. [2024-11-16 09:34:00,193 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-16 09:34:00,193 INFO L276 IsEmpty]: Start isEmpty. Operand 944 states and 1708 transitions. [2024-11-16 09:34:00,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2024-11-16 09:34:00,195 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 09:34:00,195 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-16 09:34:00,196 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-16 09:34:00,196 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 09:34:00,196 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 09:34:00,196 INFO L85 PathProgramCache]: Analyzing trace with hash 293123881, now seen corresponding path program 1 times [2024-11-16 09:34:00,196 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 09:34:00,197 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [621475436] [2024-11-16 09:34:00,197 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 09:34:00,197 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 09:34:00,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 09:34:00,239 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-16 09:34:00,239 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 09:34:00,239 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [621475436] [2024-11-16 09:34:00,240 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [621475436] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 09:34:00,240 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 09:34:00,240 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-16 09:34:00,240 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [942111974] [2024-11-16 09:34:00,240 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 09:34:00,240 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 09:34:00,241 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 09:34:00,241 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 09:34:00,241 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 09:34:00,241 INFO L87 Difference]: Start difference. First operand 944 states and 1708 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-16 09:34:00,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 09:34:00,269 INFO L93 Difference]: Finished difference Result 1246 states and 2150 transitions. [2024-11-16 09:34:00,269 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 09:34:00,270 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-16 09:34:00,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 09:34:00,274 INFO L225 Difference]: With dead ends: 1246 [2024-11-16 09:34:00,274 INFO L226 Difference]: Without dead ends: 1083 [2024-11-16 09:34:00,274 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-16 09:34:00,277 INFO L432 NwaCegarLoop]: 1549 mSDtfsCounter, 1478 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1478 SdHoareTripleChecker+Valid, 1604 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-16 09:34:00,277 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1478 Valid, 1604 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-16 09:34:00,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1083 states. [2024-11-16 09:34:00,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1083 to 1080. [2024-11-16 09:34:00,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1080 states, 1078 states have (on average 1.7625231910946197) internal successors, (1900), 1079 states have internal predecessors, (1900), 0 states have call successors, (0), 0 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-16 09:34:00,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1080 states to 1080 states and 1900 transitions. [2024-11-16 09:34:00,301 INFO L78 Accepts]: Start accepts. Automaton has 1080 states and 1900 transitions. Word has length 41 [2024-11-16 09:34:00,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 09:34:00,302 INFO L471 AbstractCegarLoop]: Abstraction has 1080 states and 1900 transitions. [2024-11-16 09:34:00,302 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-16 09:34:00,302 INFO L276 IsEmpty]: Start isEmpty. Operand 1080 states and 1900 transitions. [2024-11-16 09:34:00,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2024-11-16 09:34:00,303 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 09:34:00,304 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-16 09:34:00,304 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-16 09:34:00,304 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 09:34:00,304 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 09:34:00,304 INFO L85 PathProgramCache]: Analyzing trace with hash -1910240663, now seen corresponding path program 1 times [2024-11-16 09:34:00,304 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 09:34:00,305 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1978213294] [2024-11-16 09:34:00,305 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 09:34:00,305 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 09:34:00,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 09:34:00,360 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-16 09:34:00,362 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 09:34:00,362 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1978213294] [2024-11-16 09:34:00,362 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1978213294] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 09:34:00,362 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 09:34:00,362 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-16 09:34:00,362 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1971357336] [2024-11-16 09:34:00,363 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 09:34:00,363 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 09:34:00,363 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 09:34:00,363 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 09:34:00,364 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 09:34:00,364 INFO L87 Difference]: Start difference. First operand 1080 states and 1900 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-16 09:34:00,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 09:34:00,395 INFO L93 Difference]: Finished difference Result 1630 states and 2684 transitions. [2024-11-16 09:34:00,396 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 09:34:00,396 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-16 09:34:00,398 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 09:34:00,403 INFO L225 Difference]: With dead ends: 1630 [2024-11-16 09:34:00,404 INFO L226 Difference]: Without dead ends: 1331 [2024-11-16 09:34:00,404 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-16 09:34:00,406 INFO L432 NwaCegarLoop]: 1547 mSDtfsCounter, 1476 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1476 SdHoareTripleChecker+Valid, 1606 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-16 09:34:00,406 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1476 Valid, 1606 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-16 09:34:00,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1331 states. [2024-11-16 09:34:00,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1331 to 1328. [2024-11-16 09:34:00,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1328 states, 1326 states have (on average 1.6862745098039216) internal successors, (2236), 1327 states have internal predecessors, (2236), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 09:34:00,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1328 states to 1328 states and 2236 transitions. [2024-11-16 09:34:00,438 INFO L78 Accepts]: Start accepts. Automaton has 1328 states and 2236 transitions. Word has length 41 [2024-11-16 09:34:00,438 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 09:34:00,438 INFO L471 AbstractCegarLoop]: Abstraction has 1328 states and 2236 transitions. [2024-11-16 09:34:00,439 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-16 09:34:00,439 INFO L276 IsEmpty]: Start isEmpty. Operand 1328 states and 2236 transitions. [2024-11-16 09:34:00,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2024-11-16 09:34:00,439 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 09:34:00,439 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-16 09:34:00,440 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-16 09:34:00,440 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 09:34:00,440 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 09:34:00,440 INFO L85 PathProgramCache]: Analyzing trace with hash 1860449578, now seen corresponding path program 1 times [2024-11-16 09:34:00,441 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 09:34:00,441 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [430342610] [2024-11-16 09:34:00,441 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 09:34:00,441 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 09:34:00,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 09:34:00,662 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-16 09:34:00,662 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 09:34:00,662 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [430342610] [2024-11-16 09:34:00,662 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [430342610] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 09:34:00,663 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 09:34:00,663 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-16 09:34:00,663 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [282988320] [2024-11-16 09:34:00,663 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 09:34:00,663 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-16 09:34:00,663 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 09:34:00,664 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-16 09:34:00,664 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-16 09:34:00,664 INFO L87 Difference]: Start difference. First operand 1328 states and 2236 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-16 09:34:00,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 09:34:00,745 INFO L93 Difference]: Finished difference Result 1379 states and 2302 transitions. [2024-11-16 09:34:00,746 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-16 09:34:00,746 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-16 09:34:00,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 09:34:00,751 INFO L225 Difference]: With dead ends: 1379 [2024-11-16 09:34:00,751 INFO L226 Difference]: Without dead ends: 1376 [2024-11-16 09:34:00,752 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-16 09:34:00,753 INFO L432 NwaCegarLoop]: 1507 mSDtfsCounter, 0 mSDsluCounter, 9026 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 10533 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-16 09:34:00,753 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 10533 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-16 09:34:00,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1376 states. [2024-11-16 09:34:00,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1376 to 1376. [2024-11-16 09:34:00,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1376 states, 1374 states have (on average 1.6593886462882097) internal successors, (2280), 1375 states have internal predecessors, (2280), 0 states have call successors, (0), 0 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-16 09:34:00,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1376 states to 1376 states and 2280 transitions. [2024-11-16 09:34:00,781 INFO L78 Accepts]: Start accepts. Automaton has 1376 states and 2280 transitions. Word has length 41 [2024-11-16 09:34:00,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 09:34:00,781 INFO L471 AbstractCegarLoop]: Abstraction has 1376 states and 2280 transitions. [2024-11-16 09:34:00,782 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-16 09:34:00,782 INFO L276 IsEmpty]: Start isEmpty. Operand 1376 states and 2280 transitions. [2024-11-16 09:34:00,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2024-11-16 09:34:00,783 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 09:34:00,783 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-16 09:34:00,783 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-16 09:34:00,784 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 09:34:00,784 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 09:34:00,784 INFO L85 PathProgramCache]: Analyzing trace with hash -636110161, now seen corresponding path program 1 times [2024-11-16 09:34:00,784 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 09:34:00,784 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [562526607] [2024-11-16 09:34:00,785 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 09:34:00,785 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 09:34:00,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 09:34:00,922 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-16 09:34:00,922 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 09:34:00,922 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [562526607] [2024-11-16 09:34:00,922 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [562526607] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 09:34:00,922 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 09:34:00,923 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-16 09:34:00,923 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [79862684] [2024-11-16 09:34:00,923 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 09:34:00,923 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-16 09:34:00,923 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 09:34:00,924 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-16 09:34:00,924 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-16 09:34:00,924 INFO L87 Difference]: Start difference. First operand 1376 states and 2280 transitions. Second operand has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 0 states have call successors, (0), 0 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-16 09:34:01,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 09:34:01,015 INFO L93 Difference]: Finished difference Result 3144 states and 4692 transitions. [2024-11-16 09:34:01,016 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-16 09:34:01,016 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 0 states have call successors, (0), 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-16 09:34:01,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 09:34:01,025 INFO L225 Difference]: With dead ends: 3144 [2024-11-16 09:34:01,025 INFO L226 Difference]: Without dead ends: 2709 [2024-11-16 09:34:01,026 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-16 09:34:01,027 INFO L432 NwaCegarLoop]: 1555 mSDtfsCounter, 3055 mSDsluCounter, 1626 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3055 SdHoareTripleChecker+Valid, 3181 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-16 09:34:01,027 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3055 Valid, 3181 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-16 09:34:01,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2709 states. [2024-11-16 09:34:01,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2709 to 1892. [2024-11-16 09:34:01,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1892 states, 1890 states have (on average 1.5746031746031746) internal successors, (2976), 1891 states have internal predecessors, (2976), 0 states have call successors, (0), 0 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-16 09:34:01,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1892 states to 1892 states and 2976 transitions. [2024-11-16 09:34:01,071 INFO L78 Accepts]: Start accepts. Automaton has 1892 states and 2976 transitions. Word has length 58 [2024-11-16 09:34:01,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 09:34:01,072 INFO L471 AbstractCegarLoop]: Abstraction has 1892 states and 2976 transitions. [2024-11-16 09:34:01,073 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 0 states have call successors, (0), 0 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-16 09:34:01,073 INFO L276 IsEmpty]: Start isEmpty. Operand 1892 states and 2976 transitions. [2024-11-16 09:34:01,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2024-11-16 09:34:01,074 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 09:34:01,074 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-16 09:34:01,075 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-16 09:34:01,075 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 09:34:01,075 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 09:34:01,076 INFO L85 PathProgramCache]: Analyzing trace with hash -650560017, now seen corresponding path program 1 times [2024-11-16 09:34:01,076 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 09:34:01,076 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1880261963] [2024-11-16 09:34:01,076 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 09:34:01,076 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 09:34:01,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 09:34:01,193 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-16 09:34:01,194 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 09:34:01,194 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1880261963] [2024-11-16 09:34:01,194 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1880261963] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 09:34:01,194 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 09:34:01,194 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-16 09:34:01,194 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1245534338] [2024-11-16 09:34:01,195 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 09:34:01,195 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-16 09:34:01,195 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 09:34:01,196 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-16 09:34:01,196 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-16 09:34:01,196 INFO L87 Difference]: Start difference. First operand 1892 states and 2976 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-16 09:34:01,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 09:34:01,312 INFO L93 Difference]: Finished difference Result 3736 states and 5496 transitions. [2024-11-16 09:34:01,313 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-16 09:34:01,313 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-16 09:34:01,313 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 09:34:01,323 INFO L225 Difference]: With dead ends: 3736 [2024-11-16 09:34:01,324 INFO L226 Difference]: Without dead ends: 3141 [2024-11-16 09:34:01,326 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-16 09:34:01,326 INFO L432 NwaCegarLoop]: 1556 mSDtfsCounter, 3052 mSDsluCounter, 1623 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3052 SdHoareTripleChecker+Valid, 3179 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-16 09:34:01,327 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3052 Valid, 3179 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-16 09:34:01,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3141 states. [2024-11-16 09:34:01,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3141 to 2700. [2024-11-16 09:34:01,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2700 states, 2698 states have (on average 1.5063009636767977) internal successors, (4064), 2699 states have internal predecessors, (4064), 0 states have call successors, (0), 0 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-16 09:34:01,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2700 states to 2700 states and 4064 transitions. [2024-11-16 09:34:01,393 INFO L78 Accepts]: Start accepts. Automaton has 2700 states and 4064 transitions. Word has length 58 [2024-11-16 09:34:01,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 09:34:01,393 INFO L471 AbstractCegarLoop]: Abstraction has 2700 states and 4064 transitions. [2024-11-16 09:34:01,394 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-16 09:34:01,394 INFO L276 IsEmpty]: Start isEmpty. Operand 2700 states and 4064 transitions. [2024-11-16 09:34:01,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2024-11-16 09:34:01,395 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 09:34:01,395 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-16 09:34:01,395 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-16 09:34:01,396 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 09:34:01,396 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 09:34:01,396 INFO L85 PathProgramCache]: Analyzing trace with hash 1441042735, now seen corresponding path program 1 times [2024-11-16 09:34:01,396 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 09:34:01,396 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1884667359] [2024-11-16 09:34:01,397 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 09:34:01,397 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 09:34:01,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 09:34:01,489 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-16 09:34:01,490 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 09:34:01,490 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1884667359] [2024-11-16 09:34:01,490 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1884667359] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 09:34:01,490 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 09:34:01,490 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-16 09:34:01,491 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [168097299] [2024-11-16 09:34:01,491 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 09:34:01,491 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-16 09:34:01,491 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 09:34:01,492 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-16 09:34:01,492 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-16 09:34:01,492 INFO L87 Difference]: Start difference. First operand 2700 states and 4064 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-16 09:34:01,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 09:34:01,596 INFO L93 Difference]: Finished difference Result 4328 states and 6296 transitions. [2024-11-16 09:34:01,597 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-16 09:34:01,597 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-16 09:34:01,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 09:34:01,609 INFO L225 Difference]: With dead ends: 4328 [2024-11-16 09:34:01,610 INFO L226 Difference]: Without dead ends: 3733 [2024-11-16 09:34:01,611 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-16 09:34:01,612 INFO L432 NwaCegarLoop]: 1557 mSDtfsCounter, 3061 mSDsluCounter, 1621 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3061 SdHoareTripleChecker+Valid, 3178 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-16 09:34:01,612 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3061 Valid, 3178 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-16 09:34:01,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3733 states. [2024-11-16 09:34:01,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3733 to 3292. [2024-11-16 09:34:01,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3292 states, 3290 states have (on average 1.478419452887538) internal successors, (4864), 3291 states have internal predecessors, (4864), 0 states have call successors, (0), 0 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-16 09:34:01,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3292 states to 3292 states and 4864 transitions. [2024-11-16 09:34:01,692 INFO L78 Accepts]: Start accepts. Automaton has 3292 states and 4864 transitions. Word has length 58 [2024-11-16 09:34:01,693 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 09:34:01,693 INFO L471 AbstractCegarLoop]: Abstraction has 3292 states and 4864 transitions. [2024-11-16 09:34:01,693 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-16 09:34:01,693 INFO L276 IsEmpty]: Start isEmpty. Operand 3292 states and 4864 transitions. [2024-11-16 09:34:01,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2024-11-16 09:34:01,694 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 09:34:01,694 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-16 09:34:01,695 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-16 09:34:01,695 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 09:34:01,695 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 09:34:01,695 INFO L85 PathProgramCache]: Analyzing trace with hash 872851857, now seen corresponding path program 1 times [2024-11-16 09:34:01,695 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 09:34:01,696 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [92890010] [2024-11-16 09:34:01,696 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 09:34:01,696 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 09:34:01,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 09:34:01,767 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-16 09:34:01,767 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 09:34:01,767 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [92890010] [2024-11-16 09:34:01,768 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [92890010] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 09:34:01,768 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 09:34:01,768 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-16 09:34:01,768 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [637019565] [2024-11-16 09:34:01,768 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 09:34:01,768 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 09:34:01,768 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 09:34:01,769 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 09:34:01,769 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 09:34:01,769 INFO L87 Difference]: Start difference. First operand 3292 states and 4864 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-16 09:34:01,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 09:34:01,821 INFO L93 Difference]: Finished difference Result 5806 states and 8264 transitions. [2024-11-16 09:34:01,821 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 09:34:01,822 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-16 09:34:01,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 09:34:01,832 INFO L225 Difference]: With dead ends: 5806 [2024-11-16 09:34:01,832 INFO L226 Difference]: Without dead ends: 3295 [2024-11-16 09:34:01,835 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-16 09:34:01,836 INFO L432 NwaCegarLoop]: 1533 mSDtfsCounter, 28 mSDsluCounter, 1501 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 3034 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-16 09:34:01,904 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 3034 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-16 09:34:01,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3295 states. [2024-11-16 09:34:01,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3295 to 3292. [2024-11-16 09:34:01,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3292 states, 3290 states have (on average 1.4632218844984803) internal successors, (4814), 3291 states have internal predecessors, (4814), 0 states have call successors, (0), 0 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-16 09:34:01,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3292 states to 3292 states and 4814 transitions. [2024-11-16 09:34:01,974 INFO L78 Accepts]: Start accepts. Automaton has 3292 states and 4814 transitions. Word has length 60 [2024-11-16 09:34:01,974 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 09:34:01,974 INFO L471 AbstractCegarLoop]: Abstraction has 3292 states and 4814 transitions. [2024-11-16 09:34:01,974 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-16 09:34:01,974 INFO L276 IsEmpty]: Start isEmpty. Operand 3292 states and 4814 transitions. [2024-11-16 09:34:01,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2024-11-16 09:34:01,975 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 09:34:01,975 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-16 09:34:01,975 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-16 09:34:01,976 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 09:34:01,976 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 09:34:01,976 INFO L85 PathProgramCache]: Analyzing trace with hash -128557871, now seen corresponding path program 1 times [2024-11-16 09:34:01,977 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 09:34:01,977 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1307355865] [2024-11-16 09:34:01,977 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 09:34:01,977 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 09:34:02,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 09:34:02,063 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-16 09:34:02,064 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 09:34:02,064 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1307355865] [2024-11-16 09:34:02,064 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1307355865] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 09:34:02,064 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 09:34:02,064 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-16 09:34:02,064 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [701616402] [2024-11-16 09:34:02,064 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 09:34:02,065 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 09:34:02,065 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 09:34:02,065 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 09:34:02,065 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 09:34:02,065 INFO L87 Difference]: Start difference. First operand 3292 states and 4814 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-16 09:34:02,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 09:34:02,105 INFO L93 Difference]: Finished difference Result 4287 states and 6150 transitions. [2024-11-16 09:34:02,105 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 09:34:02,105 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-16 09:34:02,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 09:34:02,115 INFO L225 Difference]: With dead ends: 4287 [2024-11-16 09:34:02,119 INFO L226 Difference]: Without dead ends: 1776 [2024-11-16 09:34:02,122 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-16 09:34:02,123 INFO L432 NwaCegarLoop]: 1531 mSDtfsCounter, 24 mSDsluCounter, 1500 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 3031 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-16 09:34:02,123 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 3031 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-16 09:34:02,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1776 states. [2024-11-16 09:34:02,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1776 to 1766. [2024-11-16 09:34:02,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1766 states, 1764 states have (on average 1.572562358276644) internal successors, (2774), 1765 states have internal predecessors, (2774), 0 states have call successors, (0), 0 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-16 09:34:02,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1766 states to 1766 states and 2774 transitions. [2024-11-16 09:34:02,173 INFO L78 Accepts]: Start accepts. Automaton has 1766 states and 2774 transitions. Word has length 60 [2024-11-16 09:34:02,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 09:34:02,173 INFO L471 AbstractCegarLoop]: Abstraction has 1766 states and 2774 transitions. [2024-11-16 09:34:02,173 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-16 09:34:02,174 INFO L276 IsEmpty]: Start isEmpty. Operand 1766 states and 2774 transitions. [2024-11-16 09:34:02,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2024-11-16 09:34:02,174 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 09:34:02,174 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] [2024-11-16 09:34:02,175 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-16 09:34:02,175 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 09:34:02,175 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 09:34:02,175 INFO L85 PathProgramCache]: Analyzing trace with hash -1679113773, now seen corresponding path program 1 times [2024-11-16 09:34:02,175 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 09:34:02,175 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1678658989] [2024-11-16 09:34:02,175 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 09:34:02,175 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 09:34:02,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 09:34:02,261 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-16 09:34:02,262 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 09:34:02,262 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1678658989] [2024-11-16 09:34:02,262 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1678658989] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 09:34:02,262 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 09:34:02,262 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-16 09:34:02,262 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [210817646] [2024-11-16 09:34:02,262 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 09:34:02,263 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 09:34:02,263 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 09:34:02,263 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 09:34:02,264 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 09:34:02,267 INFO L87 Difference]: Start difference. First operand 1766 states and 2774 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-16 09:34:02,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 09:34:02,296 INFO L93 Difference]: Finished difference Result 2258 states and 3426 transitions. [2024-11-16 09:34:02,296 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 09:34:02,297 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-16 09:34:02,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 09:34:02,301 INFO L225 Difference]: With dead ends: 2258 [2024-11-16 09:34:02,303 INFO L226 Difference]: Without dead ends: 1283 [2024-11-16 09:34:02,307 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-16 09:34:02,308 INFO L432 NwaCegarLoop]: 1525 mSDtfsCounter, 22 mSDsluCounter, 1485 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 3010 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-16 09:34:02,310 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 3010 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-16 09:34:02,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1283 states. [2024-11-16 09:34:02,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1283 to 1280. [2024-11-16 09:34:02,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1280 states, 1278 states have (on average 1.6564945226917058) internal successors, (2117), 1279 states have internal predecessors, (2117), 0 states have call successors, (0), 0 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-16 09:34:02,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1280 states to 1280 states and 2117 transitions. [2024-11-16 09:34:02,338 INFO L78 Accepts]: Start accepts. Automaton has 1280 states and 2117 transitions. Word has length 62 [2024-11-16 09:34:02,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 09:34:02,339 INFO L471 AbstractCegarLoop]: Abstraction has 1280 states and 2117 transitions. [2024-11-16 09:34:02,339 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-16 09:34:02,339 INFO L276 IsEmpty]: Start isEmpty. Operand 1280 states and 2117 transitions. [2024-11-16 09:34:02,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2024-11-16 09:34:02,342 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 09:34:02,342 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 09:34:02,342 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-16 09:34:02,343 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 09:34:02,343 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 09:34:02,343 INFO L85 PathProgramCache]: Analyzing trace with hash 1459118732, now seen corresponding path program 1 times [2024-11-16 09:34:02,343 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 09:34:02,343 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [646968271] [2024-11-16 09:34:02,343 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 09:34:02,344 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 09:34:02,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 09:34:02,401 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-16 09:34:02,401 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 09:34:02,401 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [646968271] [2024-11-16 09:34:02,401 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [646968271] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 09:34:02,401 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 09:34:02,402 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-16 09:34:02,402 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [779397928] [2024-11-16 09:34:02,402 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 09:34:02,402 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 09:34:02,402 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 09:34:02,402 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 09:34:02,402 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 09:34:02,403 INFO L87 Difference]: Start difference. First operand 1280 states and 2117 transitions. Second operand has 3 states, 3 states have (on average 21.0) internal successors, (63), 2 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 09:34:05,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 09:34:05,640 INFO L93 Difference]: Finished difference Result 2787 states and 4993 transitions. [2024-11-16 09:34:05,640 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 09:34:05,641 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.0) internal successors, (63), 2 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 63 [2024-11-16 09:34:05,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 09:34:05,645 INFO L225 Difference]: With dead ends: 2787 [2024-11-16 09:34:05,646 INFO L226 Difference]: Without dead ends: 2032 [2024-11-16 09:34:05,647 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-16 09:34:05,647 INFO L432 NwaCegarLoop]: 542 mSDtfsCounter, 812 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 2261 mSolverCounterSat, 652 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 812 SdHoareTripleChecker+Valid, 551 SdHoareTripleChecker+Invalid, 2913 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 652 IncrementalHoareTripleChecker+Valid, 2261 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2024-11-16 09:34:05,648 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [812 Valid, 551 Invalid, 2913 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [652 Valid, 2261 Invalid, 0 Unknown, 0 Unchecked, 3.1s Time] [2024-11-16 09:34:05,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2032 states. [2024-11-16 09:34:05,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2032 to 2032. [2024-11-16 09:34:05,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2032 states, 2030 states have (on average 1.525615763546798) internal successors, (3097), 2031 states have internal predecessors, (3097), 0 states have call successors, (0), 0 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-16 09:34:05,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2032 states to 2032 states and 3097 transitions. [2024-11-16 09:34:05,697 INFO L78 Accepts]: Start accepts. Automaton has 2032 states and 3097 transitions. Word has length 63 [2024-11-16 09:34:05,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 09:34:05,698 INFO L471 AbstractCegarLoop]: Abstraction has 2032 states and 3097 transitions. [2024-11-16 09:34:05,698 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.0) internal successors, (63), 2 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 09:34:05,698 INFO L276 IsEmpty]: Start isEmpty. Operand 2032 states and 3097 transitions. [2024-11-16 09:34:05,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2024-11-16 09:34:05,699 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 09:34:05,699 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] [2024-11-16 09:34:05,700 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-16 09:34:05,700 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 09:34:05,700 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 09:34:05,700 INFO L85 PathProgramCache]: Analyzing trace with hash 1606031738, now seen corresponding path program 1 times [2024-11-16 09:34:05,701 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 09:34:05,701 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1045035021] [2024-11-16 09:34:05,701 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 09:34:05,701 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 09:34:05,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 09:34:06,190 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-16 09:34:06,190 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 09:34:06,190 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1045035021] [2024-11-16 09:34:06,190 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1045035021] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-16 09:34:06,191 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1361237537] [2024-11-16 09:34:06,191 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 09:34:06,191 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 09:34:06,191 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 09:34:06,193 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-16 09:34:06,195 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-16 09:34:06,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 09:34:06,334 INFO L255 TraceCheckSpWp]: Trace formula consists of 305 conjuncts, 31 conjuncts are in the unsatisfiable core [2024-11-16 09:34:06,342 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 09:34:08,123 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-16 09:34:08,123 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-16 09:34:11,221 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-16 09:34:11,221 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1361237537] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-16 09:34:11,221 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-16 09:34:11,221 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 19, 17] total 42 [2024-11-16 09:34:11,222 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1006635013] [2024-11-16 09:34:11,222 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-16 09:34:11,223 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2024-11-16 09:34:11,223 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 09:34:11,223 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2024-11-16 09:34:11,224 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=188, Invalid=1534, Unknown=0, NotChecked=0, Total=1722 [2024-11-16 09:34:11,224 INFO L87 Difference]: Start difference. First operand 2032 states and 3097 transitions. Second operand has 42 states, 42 states have (on average 4.0476190476190474) internal successors, (170), 42 states have internal predecessors, (170), 0 states have call successors, (0), 0 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-16 09:34:22,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 09:34:22,503 INFO L93 Difference]: Finished difference Result 5629 states and 7778 transitions. [2024-11-16 09:34:22,503 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2024-11-16 09:34:22,504 INFO L78 Accepts]: Start accepts. Automaton has has 42 states, 42 states have (on average 4.0476190476190474) internal successors, (170), 42 states have internal predecessors, (170), 0 states have call successors, (0), 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-16 09:34:22,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 09:34:22,518 INFO L225 Difference]: With dead ends: 5629 [2024-11-16 09:34:22,519 INFO L226 Difference]: Without dead ends: 5140 [2024-11-16 09:34:22,524 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 213 GetRequests, 96 SyntacticMatches, 0 SemanticMatches, 117 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4150 ImplicationChecksByTransitivity, 11.6s TimeCoverageRelationStatistics Valid=2486, Invalid=11556, Unknown=0, NotChecked=0, Total=14042 [2024-11-16 09:34:22,525 INFO L432 NwaCegarLoop]: 1513 mSDtfsCounter, 15921 mSDsluCounter, 17268 mSDsCounter, 0 mSdLazyCounter, 1263 mSolverCounterSat, 82 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15921 SdHoareTripleChecker+Valid, 18781 SdHoareTripleChecker+Invalid, 1345 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 82 IncrementalHoareTripleChecker+Valid, 1263 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-16 09:34:22,525 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [15921 Valid, 18781 Invalid, 1345 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [82 Valid, 1263 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-16 09:34:22,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5140 states. [2024-11-16 09:34:22,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5140 to 4006. [2024-11-16 09:34:22,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4006 states, 4004 states have (on average 1.4048451548451548) internal successors, (5625), 4005 states have internal predecessors, (5625), 0 states have call successors, (0), 0 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-16 09:34:22,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4006 states to 4006 states and 5625 transitions. [2024-11-16 09:34:22,638 INFO L78 Accepts]: Start accepts. Automaton has 4006 states and 5625 transitions. Word has length 64 [2024-11-16 09:34:22,638 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 09:34:22,638 INFO L471 AbstractCegarLoop]: Abstraction has 4006 states and 5625 transitions. [2024-11-16 09:34:22,638 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 42 states, 42 states have (on average 4.0476190476190474) internal successors, (170), 42 states have internal predecessors, (170), 0 states have call successors, (0), 0 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-16 09:34:22,639 INFO L276 IsEmpty]: Start isEmpty. Operand 4006 states and 5625 transitions. [2024-11-16 09:34:22,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2024-11-16 09:34:22,640 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 09:34:22,640 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] [2024-11-16 09:34:22,659 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-11-16 09:34:22,840 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,SelfDestructingSolverStorable16 [2024-11-16 09:34:22,841 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 09:34:22,841 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 09:34:22,841 INFO L85 PathProgramCache]: Analyzing trace with hash 1177276839, now seen corresponding path program 1 times [2024-11-16 09:34:22,841 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 09:34:22,841 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1256475402] [2024-11-16 09:34:22,842 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 09:34:22,842 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 09:34:22,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 09:34:23,280 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 9 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 09:34:23,280 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 09:34:23,282 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1256475402] [2024-11-16 09:34:23,282 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1256475402] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-16 09:34:23,282 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1512279063] [2024-11-16 09:34:23,282 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 09:34:23,283 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 09:34:23,283 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 09:34:23,284 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-16 09:34:23,285 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-16 09:34:23,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 09:34:23,382 INFO L255 TraceCheckSpWp]: Trace formula consists of 305 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-11-16 09:34:23,384 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 09:34:23,735 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 9 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 09:34:23,735 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-16 09:34:24,232 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 9 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 09:34:24,233 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1512279063] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-16 09:34:24,233 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-16 09:34:24,233 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 20 [2024-11-16 09:34:24,233 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [403168983] [2024-11-16 09:34:24,233 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-16 09:34:24,234 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2024-11-16 09:34:24,234 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 09:34:24,234 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2024-11-16 09:34:24,235 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=328, Unknown=0, NotChecked=0, Total=420 [2024-11-16 09:34:24,235 INFO L87 Difference]: Start difference. First operand 4006 states and 5625 transitions. Second operand has 21 states, 21 states have (on average 6.428571428571429) internal successors, (135), 20 states have internal predecessors, (135), 0 states have call successors, (0), 0 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-16 09:34:24,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 09:34:24,625 INFO L93 Difference]: Finished difference Result 7171 states and 9740 transitions. [2024-11-16 09:34:24,626 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-16 09:34:24,626 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 6.428571428571429) internal successors, (135), 20 states have internal predecessors, (135), 0 states have call successors, (0), 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 65 [2024-11-16 09:34:24,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 09:34:24,637 INFO L225 Difference]: With dead ends: 7171 [2024-11-16 09:34:24,637 INFO L226 Difference]: Without dead ends: 5128 [2024-11-16 09:34:24,640 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 118 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 140 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=215, Invalid=597, Unknown=0, NotChecked=0, Total=812 [2024-11-16 09:34:24,641 INFO L432 NwaCegarLoop]: 1507 mSDtfsCounter, 13502 mSDsluCounter, 3183 mSDsCounter, 0 mSdLazyCounter, 258 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13502 SdHoareTripleChecker+Valid, 4690 SdHoareTripleChecker+Invalid, 271 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 258 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-16 09:34:24,641 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [13502 Valid, 4690 Invalid, 271 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 258 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-16 09:34:24,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5128 states. [2024-11-16 09:34:24,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5128 to 5086. [2024-11-16 09:34:24,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5086 states, 5084 states have (on average 1.36801730920535) internal successors, (6955), 5085 states have internal predecessors, (6955), 0 states have call successors, (0), 0 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-16 09:34:24,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5086 states to 5086 states and 6955 transitions. [2024-11-16 09:34:24,819 INFO L78 Accepts]: Start accepts. Automaton has 5086 states and 6955 transitions. Word has length 65 [2024-11-16 09:34:24,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 09:34:24,819 INFO L471 AbstractCegarLoop]: Abstraction has 5086 states and 6955 transitions. [2024-11-16 09:34:24,819 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 6.428571428571429) internal successors, (135), 20 states have internal predecessors, (135), 0 states have call successors, (0), 0 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-16 09:34:24,819 INFO L276 IsEmpty]: Start isEmpty. Operand 5086 states and 6955 transitions. [2024-11-16 09:34:24,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2024-11-16 09:34:24,820 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 09:34:24,820 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] [2024-11-16 09:34:24,836 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-11-16 09:34:25,020 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,SelfDestructingSolverStorable17 [2024-11-16 09:34:25,021 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 09:34:25,021 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 09:34:25,021 INFO L85 PathProgramCache]: Analyzing trace with hash 1013955843, now seen corresponding path program 1 times [2024-11-16 09:34:25,021 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 09:34:25,022 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1214104042] [2024-11-16 09:34:25,022 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 09:34:25,022 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 09:34:25,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 09:34:25,944 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-16 09:34:25,945 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 09:34:25,945 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1214104042] [2024-11-16 09:34:25,945 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1214104042] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-16 09:34:25,945 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1475464441] [2024-11-16 09:34:25,945 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 09:34:25,945 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 09:34:25,945 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 09:34:25,947 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-16 09:34:25,948 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-16 09:34:26,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 09:34:26,044 INFO L255 TraceCheckSpWp]: Trace formula consists of 307 conjuncts, 20 conjuncts are in the unsatisfiable core [2024-11-16 09:34:26,046 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 09:34:26,617 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-16 09:34:26,617 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-16 09:34:27,848 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-16 09:34:27,848 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1475464441] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-16 09:34:27,848 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-16 09:34:27,848 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 13, 13] total 41 [2024-11-16 09:34:27,849 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1166257644] [2024-11-16 09:34:27,849 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-16 09:34:27,849 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2024-11-16 09:34:27,849 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 09:34:27,850 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2024-11-16 09:34:27,851 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=134, Invalid=1506, Unknown=0, NotChecked=0, Total=1640 [2024-11-16 09:34:27,851 INFO L87 Difference]: Start difference. First operand 5086 states and 6955 transitions. Second operand has 41 states, 41 states have (on average 4.048780487804878) internal successors, (166), 41 states have internal predecessors, (166), 0 states have call successors, (0), 0 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-16 09:34:34,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 09:34:34,457 INFO L93 Difference]: Finished difference Result 11959 states and 15580 transitions. [2024-11-16 09:34:34,457 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2024-11-16 09:34:34,457 INFO L78 Accepts]: Start accepts. Automaton has has 41 states, 41 states have (on average 4.048780487804878) internal successors, (166), 41 states have internal predecessors, (166), 0 states have call successors, (0), 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 65 [2024-11-16 09:34:34,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 09:34:34,476 INFO L225 Difference]: With dead ends: 11959 [2024-11-16 09:34:34,476 INFO L226 Difference]: Without dead ends: 9756 [2024-11-16 09:34:34,484 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 219 GetRequests, 109 SyntacticMatches, 0 SemanticMatches, 110 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3002 ImplicationChecksByTransitivity, 5.8s TimeCoverageRelationStatistics Valid=2376, Invalid=10056, Unknown=0, NotChecked=0, Total=12432 [2024-11-16 09:34:34,485 INFO L432 NwaCegarLoop]: 1559 mSDtfsCounter, 23418 mSDsluCounter, 22909 mSDsCounter, 0 mSdLazyCounter, 2457 mSolverCounterSat, 90 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23418 SdHoareTripleChecker+Valid, 24468 SdHoareTripleChecker+Invalid, 2547 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 90 IncrementalHoareTripleChecker+Valid, 2457 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-11-16 09:34:34,485 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [23418 Valid, 24468 Invalid, 2547 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [90 Valid, 2457 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-11-16 09:34:34,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9756 states. [2024-11-16 09:34:34,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9756 to 5825. [2024-11-16 09:34:34,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5825 states, 5823 states have (on average 1.3520522067662717) internal successors, (7873), 5824 states have internal predecessors, (7873), 0 states have call successors, (0), 0 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-16 09:34:34,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5825 states to 5825 states and 7873 transitions. [2024-11-16 09:34:34,688 INFO L78 Accepts]: Start accepts. Automaton has 5825 states and 7873 transitions. Word has length 65 [2024-11-16 09:34:34,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 09:34:34,688 INFO L471 AbstractCegarLoop]: Abstraction has 5825 states and 7873 transitions. [2024-11-16 09:34:34,689 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 41 states have (on average 4.048780487804878) internal successors, (166), 41 states have internal predecessors, (166), 0 states have call successors, (0), 0 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-16 09:34:34,689 INFO L276 IsEmpty]: Start isEmpty. Operand 5825 states and 7873 transitions. [2024-11-16 09:34:34,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2024-11-16 09:34:34,690 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 09:34:34,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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 09:34:34,708 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-16 09:34:34,894 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 09:34:34,895 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 09:34:34,895 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 09:34:34,895 INFO L85 PathProgramCache]: Analyzing trace with hash -717183867, now seen corresponding path program 1 times [2024-11-16 09:34:34,896 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 09:34:34,896 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [623996586] [2024-11-16 09:34:34,896 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 09:34:34,896 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 09:34:34,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 09:34:36,748 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-16 09:34:36,748 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 09:34:36,748 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [623996586] [2024-11-16 09:34:36,748 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [623996586] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-16 09:34:36,748 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1143868180] [2024-11-16 09:34:36,748 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 09:34:36,748 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 09:34:36,748 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 09:34:36,750 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-16 09:34:36,752 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-16 09:34:36,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 09:34:36,864 INFO L255 TraceCheckSpWp]: Trace formula consists of 306 conjuncts, 38 conjuncts are in the unsatisfiable core [2024-11-16 09:34:36,866 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 09:34:38,940 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-16 09:34:38,940 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-16 09:34:42,146 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-16 09:34:42,147 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1143868180] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-16 09:34:42,147 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-16 09:34:42,147 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 21, 20] total 58 [2024-11-16 09:34:42,147 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [628316569] [2024-11-16 09:34:42,147 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-16 09:34:42,147 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 58 states [2024-11-16 09:34:42,148 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 09:34:42,148 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2024-11-16 09:34:42,149 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=338, Invalid=2968, Unknown=0, NotChecked=0, Total=3306 [2024-11-16 09:34:42,149 INFO L87 Difference]: Start difference. First operand 5825 states and 7873 transitions. Second operand has 58 states, 58 states have (on average 3.0172413793103448) internal successors, (175), 58 states have internal predecessors, (175), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)