./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/systemc/mem_slave_tlm.2.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 3061b6dc 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/systemc/mem_slave_tlm.2.cil.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 68ec02878969b041c7f7a32af94816f6626efeef23b5da7ea64f6e61f6ff6501 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-3061b6d-m [2024-11-18 14:33:11,676 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-18 14:33:11,726 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-18 14:33:11,730 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-18 14:33:11,733 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-18 14:33:11,754 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-18 14:33:11,754 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-18 14:33:11,755 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-18 14:33:11,755 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-18 14:33:11,758 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-18 14:33:11,758 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-18 14:33:11,759 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-18 14:33:11,759 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-18 14:33:11,759 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-18 14:33:11,759 INFO L153 SettingsManager]: * Use SBE=true [2024-11-18 14:33:11,760 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-18 14:33:11,760 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-18 14:33:11,760 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-18 14:33:11,760 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-18 14:33:11,760 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-18 14:33:11,761 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-18 14:33:11,761 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-18 14:33:11,761 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-18 14:33:11,761 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-18 14:33:11,761 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-18 14:33:11,762 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-18 14:33:11,762 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-18 14:33:11,762 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-18 14:33:11,762 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-18 14:33:11,762 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-18 14:33:11,763 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-18 14:33:11,763 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-18 14:33:11,763 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-18 14:33:11,763 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-18 14:33:11,763 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-18 14:33:11,764 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-18 14:33:11,764 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-18 14:33:11,764 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-18 14:33:11,764 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-18 14:33:11,764 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-18 14:33:11,764 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-18 14:33:11,765 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-18 14:33:11,765 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 -> 68ec02878969b041c7f7a32af94816f6626efeef23b5da7ea64f6e61f6ff6501 [2024-11-18 14:33:11,968 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-18 14:33:11,990 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-18 14:33:11,993 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-18 14:33:11,994 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-18 14:33:11,994 INFO L274 PluginConnector]: CDTParser initialized [2024-11-18 14:33:11,995 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/systemc/mem_slave_tlm.2.cil.c [2024-11-18 14:33:13,228 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-18 14:33:13,421 INFO L384 CDTParser]: Found 1 translation units. [2024-11-18 14:33:13,421 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/systemc/mem_slave_tlm.2.cil.c [2024-11-18 14:33:13,435 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/547888791/e2c81e69113f44799fbbdc6c9313bad8/FLAG0e2302f8c [2024-11-18 14:33:13,449 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/547888791/e2c81e69113f44799fbbdc6c9313bad8 [2024-11-18 14:33:13,452 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-18 14:33:13,454 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-18 14:33:13,456 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-18 14:33:13,456 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-18 14:33:13,462 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-18 14:33:13,463 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 02:33:13" (1/1) ... [2024-11-18 14:33:13,466 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@b4d6786 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 02:33:13, skipping insertion in model container [2024-11-18 14:33:13,466 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 02:33:13" (1/1) ... [2024-11-18 14:33:13,517 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-18 14:33:13,730 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/systemc/mem_slave_tlm.2.cil.c[646,659] [2024-11-18 14:33:13,823 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-18 14:33:13,833 INFO L200 MainTranslator]: Completed pre-run [2024-11-18 14:33:13,842 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/systemc/mem_slave_tlm.2.cil.c[646,659] [2024-11-18 14:33:13,900 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-18 14:33:13,924 INFO L204 MainTranslator]: Completed translation [2024-11-18 14:33:13,925 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 02:33:13 WrapperNode [2024-11-18 14:33:13,925 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-18 14:33:13,926 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-18 14:33:13,926 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-18 14:33:13,926 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-18 14:33:13,932 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 02:33:13" (1/1) ... [2024-11-18 14:33:13,942 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 02:33:13" (1/1) ... [2024-11-18 14:33:13,977 INFO L138 Inliner]: procedures = 19, calls = 18, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 852 [2024-11-18 14:33:13,977 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-18 14:33:13,978 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-18 14:33:13,978 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-18 14:33:13,978 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-18 14:33:13,987 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 02:33:13" (1/1) ... [2024-11-18 14:33:13,988 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 02:33:13" (1/1) ... [2024-11-18 14:33:13,990 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 02:33:13" (1/1) ... [2024-11-18 14:33:14,009 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-18 14:33:14,010 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 02:33:13" (1/1) ... [2024-11-18 14:33:14,010 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 02:33:13" (1/1) ... [2024-11-18 14:33:14,017 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 02:33:13" (1/1) ... [2024-11-18 14:33:14,029 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 02:33:13" (1/1) ... [2024-11-18 14:33:14,031 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 02:33:13" (1/1) ... [2024-11-18 14:33:14,033 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 02:33:13" (1/1) ... [2024-11-18 14:33:14,037 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-18 14:33:14,040 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-18 14:33:14,040 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-18 14:33:14,041 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-18 14:33:14,041 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 02:33:13" (1/1) ... [2024-11-18 14:33:14,052 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-18 14:33:14,065 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-18 14:33:14,083 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-18 14:33:14,086 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-18 14:33:14,126 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-18 14:33:14,126 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-18 14:33:14,126 INFO L130 BoogieDeclarations]: Found specification of procedure error [2024-11-18 14:33:14,127 INFO L138 BoogieDeclarations]: Found implementation of procedure error [2024-11-18 14:33:14,127 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-18 14:33:14,127 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-18 14:33:14,219 INFO L238 CfgBuilder]: Building ICFG [2024-11-18 14:33:14,221 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-18 14:33:14,886 INFO L? ?]: Removed 87 outVars from TransFormulas that were not future-live. [2024-11-18 14:33:14,887 INFO L287 CfgBuilder]: Performing block encoding [2024-11-18 14:33:14,910 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-18 14:33:14,910 INFO L316 CfgBuilder]: Removed 13 assume(true) statements. [2024-11-18 14:33:14,911 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 02:33:14 BoogieIcfgContainer [2024-11-18 14:33:14,911 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-18 14:33:14,915 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-18 14:33:14,915 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-18 14:33:14,918 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-18 14:33:14,919 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.11 02:33:13" (1/3) ... [2024-11-18 14:33:14,920 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4c35144b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 02:33:14, skipping insertion in model container [2024-11-18 14:33:14,921 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 02:33:13" (2/3) ... [2024-11-18 14:33:14,921 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4c35144b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 02:33:14, skipping insertion in model container [2024-11-18 14:33:14,922 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 02:33:14" (3/3) ... [2024-11-18 14:33:14,923 INFO L112 eAbstractionObserver]: Analyzing ICFG mem_slave_tlm.2.cil.c [2024-11-18 14:33:14,941 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-18 14:33:14,941 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-18 14:33:15,006 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-18 14:33:15,013 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;@16e8a9a8, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-18 14:33:15,013 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-18 14:33:15,017 INFO L276 IsEmpty]: Start isEmpty. Operand has 273 states, 265 states have (on average 1.8528301886792453) internal successors, (491), 271 states have internal predecessors, (491), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-18 14:33:15,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-11-18 14:33:15,027 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 14:33:15,028 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] [2024-11-18 14:33:15,028 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 14:33:15,032 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 14:33:15,033 INFO L85 PathProgramCache]: Analyzing trace with hash 193086899, now seen corresponding path program 1 times [2024-11-18 14:33:15,040 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 14:33:15,040 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [169267421] [2024-11-18 14:33:15,040 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 14:33:15,041 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 14:33:15,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 14:33:15,326 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-18 14:33:15,327 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 14:33:15,327 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [169267421] [2024-11-18 14:33:15,327 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [169267421] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 14:33:15,327 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 14:33:15,328 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-18 14:33:15,332 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [793239080] [2024-11-18 14:33:15,333 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 14:33:15,337 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-18 14:33:15,339 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 14:33:15,363 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-18 14:33:15,364 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-18 14:33:15,368 INFO L87 Difference]: Start difference. First operand has 273 states, 265 states have (on average 1.8528301886792453) internal successors, (491), 271 states have internal predecessors, (491), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-18 14:33:15,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 14:33:15,724 INFO L93 Difference]: Finished difference Result 718 states and 1317 transitions. [2024-11-18 14:33:15,729 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-18 14:33:15,731 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2024-11-18 14:33:15,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 14:33:15,761 INFO L225 Difference]: With dead ends: 718 [2024-11-18 14:33:15,761 INFO L226 Difference]: Without dead ends: 442 [2024-11-18 14:33:15,764 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-18 14:33:15,767 INFO L432 NwaCegarLoop]: 471 mSDtfsCounter, 259 mSDsluCounter, 302 mSDsCounter, 0 mSdLazyCounter, 190 mSolverCounterSat, 62 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 259 SdHoareTripleChecker+Valid, 773 SdHoareTripleChecker+Invalid, 252 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 62 IncrementalHoareTripleChecker+Valid, 190 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-18 14:33:15,768 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [259 Valid, 773 Invalid, 252 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [62 Valid, 190 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-18 14:33:15,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 442 states. [2024-11-18 14:33:15,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 442 to 429. [2024-11-18 14:33:15,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 429 states, 423 states have (on average 1.5933806146572105) internal successors, (674), 427 states have internal predecessors, (674), 5 states have call successors, (5), 1 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-18 14:33:15,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 429 states to 429 states and 679 transitions. [2024-11-18 14:33:15,835 INFO L78 Accepts]: Start accepts. Automaton has 429 states and 679 transitions. Word has length 29 [2024-11-18 14:33:15,835 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 14:33:15,835 INFO L471 AbstractCegarLoop]: Abstraction has 429 states and 679 transitions. [2024-11-18 14:33:15,836 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-18 14:33:15,836 INFO L276 IsEmpty]: Start isEmpty. Operand 429 states and 679 transitions. [2024-11-18 14:33:15,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2024-11-18 14:33:15,838 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 14:33:15,838 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 14:33:15,839 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-18 14:33:15,839 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 14:33:15,839 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 14:33:15,840 INFO L85 PathProgramCache]: Analyzing trace with hash -1317478755, now seen corresponding path program 1 times [2024-11-18 14:33:15,840 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 14:33:15,840 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [692805540] [2024-11-18 14:33:15,840 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 14:33:15,840 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 14:33:15,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 14:33:15,904 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-18 14:33:15,904 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 14:33:15,905 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [692805540] [2024-11-18 14:33:15,905 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [692805540] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 14:33:15,905 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 14:33:15,905 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-18 14:33:15,905 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1928544672] [2024-11-18 14:33:15,905 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 14:33:15,908 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-18 14:33:15,909 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 14:33:15,909 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-18 14:33:15,909 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-18 14:33:15,910 INFO L87 Difference]: Start difference. First operand 429 states and 679 transitions. Second operand has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-18 14:33:16,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 14:33:16,030 INFO L93 Difference]: Finished difference Result 1125 states and 1805 transitions. [2024-11-18 14:33:16,031 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-18 14:33:16,031 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2024-11-18 14:33:16,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 14:33:16,034 INFO L225 Difference]: With dead ends: 1125 [2024-11-18 14:33:16,036 INFO L226 Difference]: Without dead ends: 710 [2024-11-18 14:33:16,040 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-18 14:33:16,041 INFO L432 NwaCegarLoop]: 642 mSDtfsCounter, 322 mSDsluCounter, 374 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 72 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 322 SdHoareTripleChecker+Valid, 1016 SdHoareTripleChecker+Invalid, 92 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 72 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-18 14:33:16,041 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [322 Valid, 1016 Invalid, 92 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [72 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-18 14:33:16,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 710 states. [2024-11-18 14:33:16,068 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 710 to 697. [2024-11-18 14:33:16,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 697 states, 691 states have (on average 1.6266280752532563) internal successors, (1124), 695 states have internal predecessors, (1124), 5 states have call successors, (5), 1 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-18 14:33:16,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 697 states to 697 states and 1129 transitions. [2024-11-18 14:33:16,077 INFO L78 Accepts]: Start accepts. Automaton has 697 states and 1129 transitions. Word has length 38 [2024-11-18 14:33:16,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 14:33:16,078 INFO L471 AbstractCegarLoop]: Abstraction has 697 states and 1129 transitions. [2024-11-18 14:33:16,078 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-18 14:33:16,078 INFO L276 IsEmpty]: Start isEmpty. Operand 697 states and 1129 transitions. [2024-11-18 14:33:16,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-11-18 14:33:16,080 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 14:33:16,080 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-18 14:33:16,080 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-18 14:33:16,080 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 14:33:16,081 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 14:33:16,081 INFO L85 PathProgramCache]: Analyzing trace with hash 851929906, now seen corresponding path program 1 times [2024-11-18 14:33:16,085 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 14:33:16,085 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1928004872] [2024-11-18 14:33:16,085 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 14:33:16,085 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 14:33:16,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 14:33:16,155 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-18 14:33:16,158 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 14:33:16,158 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1928004872] [2024-11-18 14:33:16,158 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1928004872] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 14:33:16,158 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 14:33:16,158 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-18 14:33:16,158 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [803325075] [2024-11-18 14:33:16,158 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 14:33:16,159 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-18 14:33:16,159 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 14:33:16,159 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-18 14:33:16,159 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-18 14:33:16,160 INFO L87 Difference]: Start difference. First operand 697 states and 1129 transitions. Second operand has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-18 14:33:16,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 14:33:16,200 INFO L93 Difference]: Finished difference Result 1761 states and 2852 transitions. [2024-11-18 14:33:16,201 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-18 14:33:16,201 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 39 [2024-11-18 14:33:16,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 14:33:16,206 INFO L225 Difference]: With dead ends: 1761 [2024-11-18 14:33:16,207 INFO L226 Difference]: Without dead ends: 1089 [2024-11-18 14:33:16,210 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-18 14:33:16,211 INFO L432 NwaCegarLoop]: 443 mSDtfsCounter, 349 mSDsluCounter, 366 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 349 SdHoareTripleChecker+Valid, 809 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-18 14:33:16,212 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [349 Valid, 809 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-18 14:33:16,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1089 states. [2024-11-18 14:33:16,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1089 to 1078. [2024-11-18 14:33:16,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1078 states, 1072 states have (on average 1.617537313432836) internal successors, (1734), 1076 states have internal predecessors, (1734), 5 states have call successors, (5), 1 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-18 14:33:16,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1078 states to 1078 states and 1739 transitions. [2024-11-18 14:33:16,241 INFO L78 Accepts]: Start accepts. Automaton has 1078 states and 1739 transitions. Word has length 39 [2024-11-18 14:33:16,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 14:33:16,244 INFO L471 AbstractCegarLoop]: Abstraction has 1078 states and 1739 transitions. [2024-11-18 14:33:16,244 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-18 14:33:16,244 INFO L276 IsEmpty]: Start isEmpty. Operand 1078 states and 1739 transitions. [2024-11-18 14:33:16,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2024-11-18 14:33:16,246 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 14:33:16,246 INFO L215 NwaCegarLoop]: trace histogram [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-18 14:33:16,246 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-18 14:33:16,246 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 14:33:16,246 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 14:33:16,246 INFO L85 PathProgramCache]: Analyzing trace with hash 18237494, now seen corresponding path program 1 times [2024-11-18 14:33:16,246 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 14:33:16,247 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1418493405] [2024-11-18 14:33:16,247 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 14:33:16,247 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 14:33:16,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 14:33:16,335 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-18 14:33:16,336 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 14:33:16,336 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1418493405] [2024-11-18 14:33:16,336 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1418493405] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 14:33:16,336 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 14:33:16,336 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-18 14:33:16,336 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1116429551] [2024-11-18 14:33:16,336 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 14:33:16,337 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-18 14:33:16,337 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 14:33:16,338 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-18 14:33:16,338 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-18 14:33:16,338 INFO L87 Difference]: Start difference. First operand 1078 states and 1739 transitions. Second operand has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-18 14:33:16,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 14:33:16,630 INFO L93 Difference]: Finished difference Result 2970 states and 4767 transitions. [2024-11-18 14:33:16,630 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-18 14:33:16,630 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 48 [2024-11-18 14:33:16,631 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 14:33:16,638 INFO L225 Difference]: With dead ends: 2970 [2024-11-18 14:33:16,638 INFO L226 Difference]: Without dead ends: 1917 [2024-11-18 14:33:16,644 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-18 14:33:16,645 INFO L432 NwaCegarLoop]: 686 mSDtfsCounter, 580 mSDsluCounter, 860 mSDsCounter, 0 mSdLazyCounter, 286 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 580 SdHoareTripleChecker+Valid, 1546 SdHoareTripleChecker+Invalid, 297 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 286 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-18 14:33:16,645 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [580 Valid, 1546 Invalid, 297 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 286 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-18 14:33:16,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1917 states. [2024-11-18 14:33:16,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1917 to 1684. [2024-11-18 14:33:16,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1684 states, 1678 states have (on average 1.5911799761620977) internal successors, (2670), 1682 states have internal predecessors, (2670), 5 states have call successors, (5), 1 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-18 14:33:16,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1684 states to 1684 states and 2675 transitions. [2024-11-18 14:33:16,686 INFO L78 Accepts]: Start accepts. Automaton has 1684 states and 2675 transitions. Word has length 48 [2024-11-18 14:33:16,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 14:33:16,687 INFO L471 AbstractCegarLoop]: Abstraction has 1684 states and 2675 transitions. [2024-11-18 14:33:16,687 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-18 14:33:16,688 INFO L276 IsEmpty]: Start isEmpty. Operand 1684 states and 2675 transitions. [2024-11-18 14:33:16,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2024-11-18 14:33:16,689 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 14:33:16,690 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] [2024-11-18 14:33:16,690 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-18 14:33:16,690 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 14:33:16,691 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 14:33:16,691 INFO L85 PathProgramCache]: Analyzing trace with hash -1086799520, now seen corresponding path program 1 times [2024-11-18 14:33:16,691 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 14:33:16,691 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [160679980] [2024-11-18 14:33:16,691 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 14:33:16,691 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 14:33:16,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 14:33:16,767 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-18 14:33:16,768 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 14:33:16,768 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [160679980] [2024-11-18 14:33:16,768 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [160679980] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 14:33:16,768 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 14:33:16,768 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-18 14:33:16,768 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1002994694] [2024-11-18 14:33:16,768 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 14:33:16,769 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-18 14:33:16,769 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 14:33:16,769 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-18 14:33:16,769 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-18 14:33:16,769 INFO L87 Difference]: Start difference. First operand 1684 states and 2675 transitions. Second operand has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-18 14:33:17,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 14:33:17,152 INFO L93 Difference]: Finished difference Result 4997 states and 7840 transitions. [2024-11-18 14:33:17,152 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-18 14:33:17,152 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 53 [2024-11-18 14:33:17,153 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 14:33:17,163 INFO L225 Difference]: With dead ends: 4997 [2024-11-18 14:33:17,163 INFO L226 Difference]: Without dead ends: 3332 [2024-11-18 14:33:17,167 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-18 14:33:17,167 INFO L432 NwaCegarLoop]: 380 mSDtfsCounter, 734 mSDsluCounter, 665 mSDsCounter, 0 mSdLazyCounter, 339 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 734 SdHoareTripleChecker+Valid, 1045 SdHoareTripleChecker+Invalid, 392 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 339 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-18 14:33:17,168 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [734 Valid, 1045 Invalid, 392 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 339 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-18 14:33:17,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3332 states. [2024-11-18 14:33:17,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3332 to 2962. [2024-11-18 14:33:17,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2962 states, 2956 states have (on average 1.5639377537212449) internal successors, (4623), 2960 states have internal predecessors, (4623), 5 states have call successors, (5), 1 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-18 14:33:17,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2962 states to 2962 states and 4628 transitions. [2024-11-18 14:33:17,268 INFO L78 Accepts]: Start accepts. Automaton has 2962 states and 4628 transitions. Word has length 53 [2024-11-18 14:33:17,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 14:33:17,269 INFO L471 AbstractCegarLoop]: Abstraction has 2962 states and 4628 transitions. [2024-11-18 14:33:17,269 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-18 14:33:17,270 INFO L276 IsEmpty]: Start isEmpty. Operand 2962 states and 4628 transitions. [2024-11-18 14:33:17,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2024-11-18 14:33:17,271 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 14:33:17,271 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] [2024-11-18 14:33:17,271 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-18 14:33:17,271 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 14:33:17,272 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 14:33:17,272 INFO L85 PathProgramCache]: Analyzing trace with hash 1057984617, now seen corresponding path program 1 times [2024-11-18 14:33:17,272 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 14:33:17,272 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2006694281] [2024-11-18 14:33:17,272 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 14:33:17,272 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 14:33:17,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 14:33:17,317 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-18 14:33:17,317 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 14:33:17,317 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2006694281] [2024-11-18 14:33:17,318 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2006694281] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 14:33:17,318 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 14:33:17,318 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-18 14:33:17,318 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [745111032] [2024-11-18 14:33:17,319 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 14:33:17,319 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-18 14:33:17,319 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 14:33:17,319 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-18 14:33:17,319 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-18 14:33:17,320 INFO L87 Difference]: Start difference. First operand 2962 states and 4628 transitions. Second operand has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-18 14:33:17,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 14:33:17,404 INFO L93 Difference]: Finished difference Result 6953 states and 10821 transitions. [2024-11-18 14:33:17,405 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-18 14:33:17,406 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 53 [2024-11-18 14:33:17,406 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 14:33:17,419 INFO L225 Difference]: With dead ends: 6953 [2024-11-18 14:33:17,420 INFO L226 Difference]: Without dead ends: 4014 [2024-11-18 14:33:17,425 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-18 14:33:17,426 INFO L432 NwaCegarLoop]: 440 mSDtfsCounter, 364 mSDsluCounter, 264 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 364 SdHoareTripleChecker+Valid, 704 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-18 14:33:17,428 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [364 Valid, 704 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-18 14:33:17,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4014 states. [2024-11-18 14:33:17,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4014 to 3830. [2024-11-18 14:33:17,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3830 states, 3824 states have (on average 1.5431485355648535) internal successors, (5901), 3828 states have internal predecessors, (5901), 5 states have call successors, (5), 1 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-18 14:33:17,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3830 states to 3830 states and 5906 transitions. [2024-11-18 14:33:17,562 INFO L78 Accepts]: Start accepts. Automaton has 3830 states and 5906 transitions. Word has length 53 [2024-11-18 14:33:17,563 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 14:33:17,563 INFO L471 AbstractCegarLoop]: Abstraction has 3830 states and 5906 transitions. [2024-11-18 14:33:17,563 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-18 14:33:17,564 INFO L276 IsEmpty]: Start isEmpty. Operand 3830 states and 5906 transitions. [2024-11-18 14:33:17,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2024-11-18 14:33:17,565 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 14:33:17,565 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] [2024-11-18 14:33:17,565 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-18 14:33:17,565 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 14:33:17,566 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 14:33:17,566 INFO L85 PathProgramCache]: Analyzing trace with hash 1793836096, now seen corresponding path program 1 times [2024-11-18 14:33:17,566 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 14:33:17,566 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1674306481] [2024-11-18 14:33:17,566 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 14:33:17,566 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 14:33:17,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 14:33:17,605 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-18 14:33:17,605 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 14:33:17,605 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1674306481] [2024-11-18 14:33:17,605 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1674306481] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 14:33:17,605 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 14:33:17,606 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-18 14:33:17,606 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [715763638] [2024-11-18 14:33:17,606 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 14:33:17,606 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-18 14:33:17,606 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 14:33:17,607 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-18 14:33:17,607 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-18 14:33:17,607 INFO L87 Difference]: Start difference. First operand 3830 states and 5906 transitions. Second operand has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-18 14:33:17,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 14:33:17,873 INFO L93 Difference]: Finished difference Result 9202 states and 14308 transitions. [2024-11-18 14:33:17,874 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-18 14:33:17,874 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 59 [2024-11-18 14:33:17,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 14:33:17,891 INFO L225 Difference]: With dead ends: 9202 [2024-11-18 14:33:17,891 INFO L226 Difference]: Without dead ends: 5395 [2024-11-18 14:33:17,898 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-18 14:33:17,899 INFO L432 NwaCegarLoop]: 585 mSDtfsCounter, 246 mSDsluCounter, 288 mSDsCounter, 0 mSdLazyCounter, 186 mSolverCounterSat, 67 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 246 SdHoareTripleChecker+Valid, 873 SdHoareTripleChecker+Invalid, 253 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 67 IncrementalHoareTripleChecker+Valid, 186 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-18 14:33:17,899 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [246 Valid, 873 Invalid, 253 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [67 Valid, 186 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-18 14:33:17,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5395 states. [2024-11-18 14:33:18,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5395 to 4638. [2024-11-18 14:33:18,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4638 states, 4632 states have (on average 1.4853195164075994) internal successors, (6880), 4636 states have internal predecessors, (6880), 5 states have call successors, (5), 1 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-18 14:33:18,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4638 states to 4638 states and 6885 transitions. [2024-11-18 14:33:18,063 INFO L78 Accepts]: Start accepts. Automaton has 4638 states and 6885 transitions. Word has length 59 [2024-11-18 14:33:18,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 14:33:18,064 INFO L471 AbstractCegarLoop]: Abstraction has 4638 states and 6885 transitions. [2024-11-18 14:33:18,064 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-18 14:33:18,064 INFO L276 IsEmpty]: Start isEmpty. Operand 4638 states and 6885 transitions. [2024-11-18 14:33:18,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2024-11-18 14:33:18,066 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 14:33:18,066 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] [2024-11-18 14:33:18,066 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-18 14:33:18,067 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 14:33:18,067 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 14:33:18,067 INFO L85 PathProgramCache]: Analyzing trace with hash -1530108436, now seen corresponding path program 1 times [2024-11-18 14:33:18,067 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 14:33:18,067 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [980115564] [2024-11-18 14:33:18,067 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 14:33:18,068 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 14:33:18,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 14:33:18,153 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-18 14:33:18,153 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 14:33:18,153 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [980115564] [2024-11-18 14:33:18,153 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [980115564] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 14:33:18,153 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 14:33:18,153 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-18 14:33:18,154 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [337468270] [2024-11-18 14:33:18,154 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 14:33:18,154 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-18 14:33:18,154 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 14:33:18,154 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-18 14:33:18,154 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-18 14:33:18,155 INFO L87 Difference]: Start difference. First operand 4638 states and 6885 transitions. Second operand has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-18 14:33:18,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 14:33:18,266 INFO L93 Difference]: Finished difference Result 9119 states and 13547 transitions. [2024-11-18 14:33:18,266 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-18 14:33:18,267 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), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 61 [2024-11-18 14:33:18,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 14:33:18,281 INFO L225 Difference]: With dead ends: 9119 [2024-11-18 14:33:18,282 INFO L226 Difference]: Without dead ends: 4504 [2024-11-18 14:33:18,288 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-18 14:33:18,289 INFO L432 NwaCegarLoop]: 411 mSDtfsCounter, 341 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 341 SdHoareTripleChecker+Valid, 439 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-18 14:33:18,289 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [341 Valid, 439 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-18 14:33:18,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4504 states. [2024-11-18 14:33:18,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4504 to 4504. [2024-11-18 14:33:18,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4504 states, 4498 states have (on average 1.4626500666963094) internal successors, (6579), 4502 states have internal predecessors, (6579), 5 states have call successors, (5), 1 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-18 14:33:18,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4504 states to 4504 states and 6584 transitions. [2024-11-18 14:33:18,421 INFO L78 Accepts]: Start accepts. Automaton has 4504 states and 6584 transitions. Word has length 61 [2024-11-18 14:33:18,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 14:33:18,421 INFO L471 AbstractCegarLoop]: Abstraction has 4504 states and 6584 transitions. [2024-11-18 14:33:18,421 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), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-18 14:33:18,421 INFO L276 IsEmpty]: Start isEmpty. Operand 4504 states and 6584 transitions. [2024-11-18 14:33:18,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2024-11-18 14:33:18,423 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 14:33:18,423 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] [2024-11-18 14:33:18,423 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-18 14:33:18,423 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 14:33:18,424 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 14:33:18,424 INFO L85 PathProgramCache]: Analyzing trace with hash -1072243498, now seen corresponding path program 1 times [2024-11-18 14:33:18,424 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 14:33:18,424 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1093353235] [2024-11-18 14:33:18,424 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 14:33:18,424 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 14:33:18,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 14:33:18,463 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-18 14:33:18,463 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 14:33:18,463 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1093353235] [2024-11-18 14:33:18,464 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1093353235] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 14:33:18,464 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 14:33:18,464 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-18 14:33:18,464 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1630494937] [2024-11-18 14:33:18,464 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 14:33:18,464 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-18 14:33:18,464 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 14:33:18,464 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-18 14:33:18,464 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-18 14:33:18,465 INFO L87 Difference]: Start difference. First operand 4504 states and 6584 transitions. Second operand has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-18 14:33:18,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 14:33:18,560 INFO L93 Difference]: Finished difference Result 8602 states and 12691 transitions. [2024-11-18 14:33:18,560 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-18 14:33:18,561 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 62 [2024-11-18 14:33:18,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 14:33:18,579 INFO L225 Difference]: With dead ends: 8602 [2024-11-18 14:33:18,579 INFO L226 Difference]: Without dead ends: 4121 [2024-11-18 14:33:18,586 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-18 14:33:18,588 INFO L432 NwaCegarLoop]: 483 mSDtfsCounter, 152 mSDsluCounter, 403 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 152 SdHoareTripleChecker+Valid, 886 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-18 14:33:18,588 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [152 Valid, 886 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-18 14:33:18,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4121 states. [2024-11-18 14:33:18,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4121 to 3478. [2024-11-18 14:33:18,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3478 states, 3472 states have (on average 1.4818548387096775) internal successors, (5145), 3476 states have internal predecessors, (5145), 5 states have call successors, (5), 1 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-18 14:33:18,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3478 states to 3478 states and 5150 transitions. [2024-11-18 14:33:18,668 INFO L78 Accepts]: Start accepts. Automaton has 3478 states and 5150 transitions. Word has length 62 [2024-11-18 14:33:18,668 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 14:33:18,668 INFO L471 AbstractCegarLoop]: Abstraction has 3478 states and 5150 transitions. [2024-11-18 14:33:18,669 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-18 14:33:18,669 INFO L276 IsEmpty]: Start isEmpty. Operand 3478 states and 5150 transitions. [2024-11-18 14:33:18,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2024-11-18 14:33:18,670 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 14:33:18,670 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 14:33:18,670 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-18 14:33:18,670 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 14:33:18,670 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 14:33:18,670 INFO L85 PathProgramCache]: Analyzing trace with hash 1578233961, now seen corresponding path program 1 times [2024-11-18 14:33:18,670 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 14:33:18,671 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1047434983] [2024-11-18 14:33:18,671 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 14:33:18,671 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 14:33:18,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 14:33:18,763 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-18 14:33:18,764 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 14:33:18,764 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1047434983] [2024-11-18 14:33:18,764 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1047434983] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 14:33:18,764 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 14:33:18,764 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-18 14:33:18,764 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [729661042] [2024-11-18 14:33:18,764 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 14:33:18,764 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-18 14:33:18,764 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 14:33:18,765 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-18 14:33:18,765 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-18 14:33:18,765 INFO L87 Difference]: Start difference. First operand 3478 states and 5150 transitions. Second operand has 6 states, 6 states have (on average 10.5) internal successors, (63), 6 states have internal predecessors, (63), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-18 14:33:19,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 14:33:19,113 INFO L93 Difference]: Finished difference Result 9529 states and 14030 transitions. [2024-11-18 14:33:19,114 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-18 14:33:19,114 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.5) internal successors, (63), 6 states have internal predecessors, (63), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 64 [2024-11-18 14:33:19,114 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 14:33:19,132 INFO L225 Difference]: With dead ends: 9529 [2024-11-18 14:33:19,132 INFO L226 Difference]: Without dead ends: 6276 [2024-11-18 14:33:19,139 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2024-11-18 14:33:19,139 INFO L432 NwaCegarLoop]: 554 mSDtfsCounter, 952 mSDsluCounter, 1853 mSDsCounter, 0 mSdLazyCounter, 384 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 952 SdHoareTripleChecker+Valid, 2407 SdHoareTripleChecker+Invalid, 391 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 384 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-18 14:33:19,140 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [952 Valid, 2407 Invalid, 391 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 384 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-18 14:33:19,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6276 states. [2024-11-18 14:33:19,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6276 to 4348. [2024-11-18 14:33:19,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4348 states, 4342 states have (on average 1.4755872869645326) internal successors, (6407), 4346 states have internal predecessors, (6407), 5 states have call successors, (5), 1 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-18 14:33:19,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4348 states to 4348 states and 6412 transitions. [2024-11-18 14:33:19,263 INFO L78 Accepts]: Start accepts. Automaton has 4348 states and 6412 transitions. Word has length 64 [2024-11-18 14:33:19,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 14:33:19,264 INFO L471 AbstractCegarLoop]: Abstraction has 4348 states and 6412 transitions. [2024-11-18 14:33:19,264 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.5) internal successors, (63), 6 states have internal predecessors, (63), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-18 14:33:19,264 INFO L276 IsEmpty]: Start isEmpty. Operand 4348 states and 6412 transitions. [2024-11-18 14:33:19,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2024-11-18 14:33:19,265 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 14:33:19,265 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 14:33:19,265 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-18 14:33:19,265 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 14:33:19,265 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 14:33:19,265 INFO L85 PathProgramCache]: Analyzing trace with hash -2113614342, now seen corresponding path program 1 times [2024-11-18 14:33:19,265 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 14:33:19,265 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1000457700] [2024-11-18 14:33:19,265 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 14:33:19,266 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 14:33:19,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 14:33:19,335 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-18 14:33:19,336 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 14:33:19,336 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1000457700] [2024-11-18 14:33:19,336 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1000457700] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 14:33:19,336 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 14:33:19,336 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-18 14:33:19,336 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [720825150] [2024-11-18 14:33:19,336 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 14:33:19,337 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-18 14:33:19,337 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 14:33:19,337 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-18 14:33:19,337 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-18 14:33:19,337 INFO L87 Difference]: Start difference. First operand 4348 states and 6412 transitions. Second operand has 7 states, 7 states have (on average 9.142857142857142) internal successors, (64), 7 states have internal predecessors, (64), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-18 14:33:19,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 14:33:19,604 INFO L93 Difference]: Finished difference Result 10489 states and 15346 transitions. [2024-11-18 14:33:19,604 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-18 14:33:19,605 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.142857142857142) internal successors, (64), 7 states have internal predecessors, (64), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 65 [2024-11-18 14:33:19,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 14:33:19,618 INFO L225 Difference]: With dead ends: 10489 [2024-11-18 14:33:19,618 INFO L226 Difference]: Without dead ends: 6366 [2024-11-18 14:33:19,622 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2024-11-18 14:33:19,623 INFO L432 NwaCegarLoop]: 539 mSDtfsCounter, 842 mSDsluCounter, 2389 mSDsCounter, 0 mSdLazyCounter, 123 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 842 SdHoareTripleChecker+Valid, 2928 SdHoareTripleChecker+Invalid, 128 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 123 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-18 14:33:19,623 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [842 Valid, 2928 Invalid, 128 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 123 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-18 14:33:19,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6366 states. [2024-11-18 14:33:19,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6366 to 4658. [2024-11-18 14:33:19,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4658 states, 4652 states have (on average 1.4658211521926052) internal successors, (6819), 4656 states have internal predecessors, (6819), 5 states have call successors, (5), 1 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-18 14:33:19,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4658 states to 4658 states and 6824 transitions. [2024-11-18 14:33:19,780 INFO L78 Accepts]: Start accepts. Automaton has 4658 states and 6824 transitions. Word has length 65 [2024-11-18 14:33:19,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 14:33:19,781 INFO L471 AbstractCegarLoop]: Abstraction has 4658 states and 6824 transitions. [2024-11-18 14:33:19,781 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.142857142857142) internal successors, (64), 7 states have internal predecessors, (64), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-18 14:33:19,781 INFO L276 IsEmpty]: Start isEmpty. Operand 4658 states and 6824 transitions. [2024-11-18 14:33:19,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2024-11-18 14:33:19,785 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 14:33:19,785 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 14:33:19,785 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-18 14:33:19,785 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 14:33:19,785 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 14:33:19,786 INFO L85 PathProgramCache]: Analyzing trace with hash 142613235, now seen corresponding path program 1 times [2024-11-18 14:33:19,786 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 14:33:19,786 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [79511801] [2024-11-18 14:33:19,786 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 14:33:19,786 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 14:33:19,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 14:33:19,823 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-18 14:33:19,827 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 14:33:19,827 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [79511801] [2024-11-18 14:33:19,827 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [79511801] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 14:33:19,827 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 14:33:19,828 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-18 14:33:19,828 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1779117514] [2024-11-18 14:33:19,828 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 14:33:19,828 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-18 14:33:19,828 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 14:33:19,829 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-18 14:33:19,829 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-18 14:33:19,829 INFO L87 Difference]: Start difference. First operand 4658 states and 6824 transitions. Second operand has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-18 14:33:19,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 14:33:19,963 INFO L93 Difference]: Finished difference Result 9803 states and 14328 transitions. [2024-11-18 14:33:19,963 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-18 14:33:19,964 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 79 [2024-11-18 14:33:19,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 14:33:19,974 INFO L225 Difference]: With dead ends: 9803 [2024-11-18 14:33:19,975 INFO L226 Difference]: Without dead ends: 5166 [2024-11-18 14:33:19,981 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-18 14:33:19,982 INFO L432 NwaCegarLoop]: 444 mSDtfsCounter, 131 mSDsluCounter, 366 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 131 SdHoareTripleChecker+Valid, 810 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-18 14:33:19,982 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [131 Valid, 810 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-18 14:33:19,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5166 states. [2024-11-18 14:33:20,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5166 to 5092. [2024-11-18 14:33:20,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5092 states, 5086 states have (on average 1.4598898938261895) internal successors, (7425), 5090 states have internal predecessors, (7425), 5 states have call successors, (5), 1 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-18 14:33:20,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5092 states to 5092 states and 7430 transitions. [2024-11-18 14:33:20,123 INFO L78 Accepts]: Start accepts. Automaton has 5092 states and 7430 transitions. Word has length 79 [2024-11-18 14:33:20,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 14:33:20,123 INFO L471 AbstractCegarLoop]: Abstraction has 5092 states and 7430 transitions. [2024-11-18 14:33:20,123 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-18 14:33:20,124 INFO L276 IsEmpty]: Start isEmpty. Operand 5092 states and 7430 transitions. [2024-11-18 14:33:20,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2024-11-18 14:33:20,125 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 14:33:20,125 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 14:33:20,125 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-18 14:33:20,126 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 14:33:20,126 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 14:33:20,126 INFO L85 PathProgramCache]: Analyzing trace with hash 1699220715, now seen corresponding path program 1 times [2024-11-18 14:33:20,126 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 14:33:20,126 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [261931370] [2024-11-18 14:33:20,126 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 14:33:20,126 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 14:33:20,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 14:33:20,175 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-18 14:33:20,175 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 14:33:20,175 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [261931370] [2024-11-18 14:33:20,175 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [261931370] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 14:33:20,175 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 14:33:20,175 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-18 14:33:20,175 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [400821828] [2024-11-18 14:33:20,175 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 14:33:20,176 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-18 14:33:20,176 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 14:33:20,176 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-18 14:33:20,176 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-18 14:33:20,176 INFO L87 Difference]: Start difference. First operand 5092 states and 7430 transitions. Second operand has 4 states, 4 states have (on average 22.5) internal successors, (90), 4 states have internal predecessors, (90), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-18 14:33:20,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 14:33:20,543 INFO L93 Difference]: Finished difference Result 13610 states and 19696 transitions. [2024-11-18 14:33:20,544 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-18 14:33:20,544 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 22.5) internal successors, (90), 4 states have internal predecessors, (90), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 91 [2024-11-18 14:33:20,544 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 14:33:20,564 INFO L225 Difference]: With dead ends: 13610 [2024-11-18 14:33:20,564 INFO L226 Difference]: Without dead ends: 8417 [2024-11-18 14:33:20,575 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-18 14:33:20,576 INFO L432 NwaCegarLoop]: 567 mSDtfsCounter, 646 mSDsluCounter, 685 mSDsCounter, 0 mSdLazyCounter, 293 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 646 SdHoareTripleChecker+Valid, 1252 SdHoareTripleChecker+Invalid, 309 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 293 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-18 14:33:20,576 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [646 Valid, 1252 Invalid, 309 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 293 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-18 14:33:20,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8417 states. [2024-11-18 14:33:20,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8417 to 7555. [2024-11-18 14:33:20,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7555 states, 7549 states have (on average 1.4323751490263612) internal successors, (10813), 7553 states have internal predecessors, (10813), 5 states have call successors, (5), 1 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-18 14:33:20,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7555 states to 7555 states and 10818 transitions. [2024-11-18 14:33:20,786 INFO L78 Accepts]: Start accepts. Automaton has 7555 states and 10818 transitions. Word has length 91 [2024-11-18 14:33:20,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 14:33:20,787 INFO L471 AbstractCegarLoop]: Abstraction has 7555 states and 10818 transitions. [2024-11-18 14:33:20,787 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 22.5) internal successors, (90), 4 states have internal predecessors, (90), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-18 14:33:20,787 INFO L276 IsEmpty]: Start isEmpty. Operand 7555 states and 10818 transitions. [2024-11-18 14:33:20,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2024-11-18 14:33:20,789 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 14:33:20,789 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 14:33:20,789 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-18 14:33:20,789 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 14:33:20,790 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 14:33:20,790 INFO L85 PathProgramCache]: Analyzing trace with hash -414205958, now seen corresponding path program 1 times [2024-11-18 14:33:20,790 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 14:33:20,790 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [170490783] [2024-11-18 14:33:20,790 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 14:33:20,790 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 14:33:20,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 14:33:20,828 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-18 14:33:20,829 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 14:33:20,829 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [170490783] [2024-11-18 14:33:20,829 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [170490783] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 14:33:20,829 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 14:33:20,829 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-18 14:33:20,829 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1902697316] [2024-11-18 14:33:20,830 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 14:33:20,830 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-18 14:33:20,830 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 14:33:20,830 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-18 14:33:20,830 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-18 14:33:20,831 INFO L87 Difference]: Start difference. First operand 7555 states and 10818 transitions. Second operand has 3 states, 3 states have (on average 32.666666666666664) internal successors, (98), 3 states have internal predecessors, (98), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-18 14:33:20,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 14:33:20,985 INFO L93 Difference]: Finished difference Result 10913 states and 15666 transitions. [2024-11-18 14:33:20,985 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-18 14:33:20,986 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 32.666666666666664) internal successors, (98), 3 states have internal predecessors, (98), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 99 [2024-11-18 14:33:20,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 14:33:20,994 INFO L225 Difference]: With dead ends: 10913 [2024-11-18 14:33:20,995 INFO L226 Difference]: Without dead ends: 3361 [2024-11-18 14:33:21,000 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-18 14:33:21,001 INFO L432 NwaCegarLoop]: 438 mSDtfsCounter, 335 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 335 SdHoareTripleChecker+Valid, 517 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-18 14:33:21,001 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [335 Valid, 517 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-18 14:33:21,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3361 states. [2024-11-18 14:33:21,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3361 to 3308. [2024-11-18 14:33:21,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3308 states, 3302 states have (on average 1.3452453058752272) internal successors, (4442), 3306 states have internal predecessors, (4442), 5 states have call successors, (5), 1 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-18 14:33:21,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3308 states to 3308 states and 4447 transitions. [2024-11-18 14:33:21,065 INFO L78 Accepts]: Start accepts. Automaton has 3308 states and 4447 transitions. Word has length 99 [2024-11-18 14:33:21,065 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 14:33:21,066 INFO L471 AbstractCegarLoop]: Abstraction has 3308 states and 4447 transitions. [2024-11-18 14:33:21,066 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 32.666666666666664) internal successors, (98), 3 states have internal predecessors, (98), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-18 14:33:21,066 INFO L276 IsEmpty]: Start isEmpty. Operand 3308 states and 4447 transitions. [2024-11-18 14:33:21,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2024-11-18 14:33:21,067 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 14:33:21,067 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-18 14:33:21,067 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-18 14:33:21,067 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 14:33:21,068 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 14:33:21,068 INFO L85 PathProgramCache]: Analyzing trace with hash -1527373171, now seen corresponding path program 1 times [2024-11-18 14:33:21,068 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 14:33:21,068 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [706971546] [2024-11-18 14:33:21,068 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 14:33:21,068 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 14:33:21,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 14:33:21,125 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-18 14:33:21,125 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 14:33:21,125 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [706971546] [2024-11-18 14:33:21,125 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [706971546] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 14:33:21,125 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 14:33:21,125 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-18 14:33:21,126 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2145853421] [2024-11-18 14:33:21,126 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 14:33:21,126 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-18 14:33:21,126 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 14:33:21,126 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-18 14:33:21,127 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-18 14:33:21,127 INFO L87 Difference]: Start difference. First operand 3308 states and 4447 transitions. Second operand has 5 states, 5 states have (on average 20.0) internal successors, (100), 5 states have internal predecessors, (100), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-18 14:33:21,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 14:33:21,278 INFO L93 Difference]: Finished difference Result 7549 states and 10142 transitions. [2024-11-18 14:33:21,279 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-18 14:33:21,279 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 20.0) internal successors, (100), 5 states have internal predecessors, (100), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 101 [2024-11-18 14:33:21,279 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 14:33:21,288 INFO L225 Difference]: With dead ends: 7549 [2024-11-18 14:33:21,288 INFO L226 Difference]: Without dead ends: 4418 [2024-11-18 14:33:21,293 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-18 14:33:21,293 INFO L432 NwaCegarLoop]: 705 mSDtfsCounter, 543 mSDsluCounter, 1653 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 543 SdHoareTripleChecker+Valid, 2358 SdHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-18 14:33:21,293 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [543 Valid, 2358 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-18 14:33:21,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4418 states. [2024-11-18 14:33:21,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4418 to 3310. [2024-11-18 14:33:21,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3310 states, 3304 states have (on average 1.3432203389830508) internal successors, (4438), 3308 states have internal predecessors, (4438), 5 states have call successors, (5), 1 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-18 14:33:21,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3310 states to 3310 states and 4443 transitions. [2024-11-18 14:33:21,442 INFO L78 Accepts]: Start accepts. Automaton has 3310 states and 4443 transitions. Word has length 101 [2024-11-18 14:33:21,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 14:33:21,443 INFO L471 AbstractCegarLoop]: Abstraction has 3310 states and 4443 transitions. [2024-11-18 14:33:21,443 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 20.0) internal successors, (100), 5 states have internal predecessors, (100), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-18 14:33:21,443 INFO L276 IsEmpty]: Start isEmpty. Operand 3310 states and 4443 transitions. [2024-11-18 14:33:21,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-11-18 14:33:21,445 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 14:33:21,445 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-18 14:33:21,445 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-18 14:33:21,445 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 14:33:21,446 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 14:33:21,446 INFO L85 PathProgramCache]: Analyzing trace with hash -653251672, now seen corresponding path program 1 times [2024-11-18 14:33:21,446 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 14:33:21,446 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [15282569] [2024-11-18 14:33:21,446 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 14:33:21,446 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 14:33:21,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 14:33:21,509 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-18 14:33:21,510 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 14:33:21,510 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [15282569] [2024-11-18 14:33:21,510 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [15282569] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-18 14:33:21,510 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1104671706] [2024-11-18 14:33:21,510 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 14:33:21,511 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-18 14:33:21,511 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-18 14:33:21,512 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-18 14:33:21,513 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-18 14:33:21,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 14:33:21,609 INFO L255 TraceCheckSpWp]: Trace formula consists of 385 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-18 14:33:21,615 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-18 14:33:21,765 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-11-18 14:33:21,766 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-18 14:33:21,766 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1104671706] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 14:33:21,766 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-18 14:33:21,766 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2024-11-18 14:33:21,766 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [797565791] [2024-11-18 14:33:21,766 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 14:33:21,767 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-18 14:33:21,767 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 14:33:21,767 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-18 14:33:21,767 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-18 14:33:21,767 INFO L87 Difference]: Start difference. First operand 3310 states and 4443 transitions. Second operand has 3 states, 3 states have (on average 33.0) internal successors, (99), 3 states have internal predecessors, (99), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-18 14:33:21,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 14:33:21,889 INFO L93 Difference]: Finished difference Result 3945 states and 5288 transitions. [2024-11-18 14:33:21,890 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-18 14:33:21,890 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 33.0) internal successors, (99), 3 states have internal predecessors, (99), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 103 [2024-11-18 14:33:21,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 14:33:21,898 INFO L225 Difference]: With dead ends: 3945 [2024-11-18 14:33:21,898 INFO L226 Difference]: Without dead ends: 3941 [2024-11-18 14:33:21,899 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 103 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-18 14:33:21,900 INFO L432 NwaCegarLoop]: 429 mSDtfsCounter, 229 mSDsluCounter, 366 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 229 SdHoareTripleChecker+Valid, 795 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-18 14:33:21,900 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [229 Valid, 795 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-18 14:33:21,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3941 states. [2024-11-18 14:33:22,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3941 to 3891. [2024-11-18 14:33:22,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3891 states, 3885 states have (on average 1.3397683397683398) internal successors, (5205), 3889 states have internal predecessors, (5205), 5 states have call successors, (5), 1 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-18 14:33:22,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3891 states to 3891 states and 5210 transitions. [2024-11-18 14:33:22,052 INFO L78 Accepts]: Start accepts. Automaton has 3891 states and 5210 transitions. Word has length 103 [2024-11-18 14:33:22,052 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 14:33:22,052 INFO L471 AbstractCegarLoop]: Abstraction has 3891 states and 5210 transitions. [2024-11-18 14:33:22,053 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 33.0) internal successors, (99), 3 states have internal predecessors, (99), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-18 14:33:22,053 INFO L276 IsEmpty]: Start isEmpty. Operand 3891 states and 5210 transitions. [2024-11-18 14:33:22,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2024-11-18 14:33:22,056 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 14:33:22,056 INFO L215 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 14:33:22,073 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-18 14:33:22,256 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2024-11-18 14:33:22,257 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 14:33:22,257 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 14:33:22,257 INFO L85 PathProgramCache]: Analyzing trace with hash -182113054, now seen corresponding path program 1 times [2024-11-18 14:33:22,257 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 14:33:22,258 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1104709677] [2024-11-18 14:33:22,258 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 14:33:22,258 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 14:33:22,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 14:33:22,347 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 15 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-18 14:33:22,348 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 14:33:22,348 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1104709677] [2024-11-18 14:33:22,348 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1104709677] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-18 14:33:22,348 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [353782399] [2024-11-18 14:33:22,348 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 14:33:22,349 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-18 14:33:22,349 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-18 14:33:22,352 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-18 14:33:22,353 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-18 14:33:22,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 14:33:22,481 INFO L255 TraceCheckSpWp]: Trace formula consists of 531 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-18 14:33:22,484 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-18 14:33:22,577 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-11-18 14:33:22,577 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-18 14:33:22,577 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [353782399] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 14:33:22,577 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-18 14:33:22,577 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2024-11-18 14:33:22,578 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [662550387] [2024-11-18 14:33:22,578 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 14:33:22,578 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-18 14:33:22,578 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 14:33:22,579 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-18 14:33:22,579 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-18 14:33:22,579 INFO L87 Difference]: Start difference. First operand 3891 states and 5210 transitions. Second operand has 3 states, 3 states have (on average 51.0) internal successors, (153), 3 states have internal predecessors, (153), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-18 14:33:22,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 14:33:22,667 INFO L93 Difference]: Finished difference Result 6926 states and 9320 transitions. [2024-11-18 14:33:22,667 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-18 14:33:22,667 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 51.0) internal successors, (153), 3 states have internal predecessors, (153), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 157 [2024-11-18 14:33:22,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 14:33:22,674 INFO L225 Difference]: With dead ends: 6926 [2024-11-18 14:33:22,675 INFO L226 Difference]: Without dead ends: 3040 [2024-11-18 14:33:22,680 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 161 GetRequests, 157 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-18 14:33:22,681 INFO L432 NwaCegarLoop]: 369 mSDtfsCounter, 260 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 260 SdHoareTripleChecker+Valid, 418 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-18 14:33:22,681 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [260 Valid, 418 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-18 14:33:22,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3040 states. [2024-11-18 14:33:22,762 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3040 to 2818. [2024-11-18 14:33:22,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2818 states, 2812 states have (on average 1.3182788051209104) internal successors, (3707), 2816 states have internal predecessors, (3707), 5 states have call successors, (5), 1 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-18 14:33:22,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2818 states to 2818 states and 3712 transitions. [2024-11-18 14:33:22,769 INFO L78 Accepts]: Start accepts. Automaton has 2818 states and 3712 transitions. Word has length 157 [2024-11-18 14:33:22,770 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 14:33:22,770 INFO L471 AbstractCegarLoop]: Abstraction has 2818 states and 3712 transitions. [2024-11-18 14:33:22,770 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 51.0) internal successors, (153), 3 states have internal predecessors, (153), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-18 14:33:22,770 INFO L276 IsEmpty]: Start isEmpty. Operand 2818 states and 3712 transitions. [2024-11-18 14:33:22,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2024-11-18 14:33:22,771 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 14:33:22,772 INFO L215 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 14:33:22,790 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-18 14:33:22,973 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2024-11-18 14:33:22,974 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 14:33:22,974 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 14:33:22,974 INFO L85 PathProgramCache]: Analyzing trace with hash 1837024668, now seen corresponding path program 1 times [2024-11-18 14:33:22,974 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 14:33:22,974 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1520920706] [2024-11-18 14:33:22,974 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 14:33:22,975 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 14:33:22,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 14:33:23,110 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 19 proven. 2 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-11-18 14:33:23,111 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 14:33:23,111 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1520920706] [2024-11-18 14:33:23,111 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1520920706] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-18 14:33:23,111 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [368184784] [2024-11-18 14:33:23,111 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 14:33:23,112 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-18 14:33:23,112 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-18 14:33:23,113 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-18 14:33:23,117 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-18 14:33:23,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 14:33:23,224 INFO L255 TraceCheckSpWp]: Trace formula consists of 525 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-18 14:33:23,227 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-18 14:33:23,293 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-11-18 14:33:23,294 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-18 14:33:23,294 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [368184784] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 14:33:23,294 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-18 14:33:23,294 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2024-11-18 14:33:23,294 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2095178129] [2024-11-18 14:33:23,294 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 14:33:23,295 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-18 14:33:23,295 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 14:33:23,295 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-18 14:33:23,295 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-18 14:33:23,296 INFO L87 Difference]: Start difference. First operand 2818 states and 3712 transitions. Second operand has 3 states, 3 states have (on average 50.666666666666664) internal successors, (152), 3 states have internal predecessors, (152), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-18 14:33:23,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 14:33:23,395 INFO L93 Difference]: Finished difference Result 5464 states and 7237 transitions. [2024-11-18 14:33:23,400 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-18 14:33:23,400 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 50.666666666666664) internal successors, (152), 3 states have internal predecessors, (152), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 160 [2024-11-18 14:33:23,401 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 14:33:23,407 INFO L225 Difference]: With dead ends: 5464 [2024-11-18 14:33:23,407 INFO L226 Difference]: Without dead ends: 2818 [2024-11-18 14:33:23,410 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 165 GetRequests, 161 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-18 14:33:23,411 INFO L432 NwaCegarLoop]: 348 mSDtfsCounter, 270 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 270 SdHoareTripleChecker+Valid, 390 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-18 14:33:23,411 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [270 Valid, 390 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-18 14:33:23,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2818 states. [2024-11-18 14:33:23,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2818 to 2818. [2024-11-18 14:33:23,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2818 states, 2812 states have (on average 1.2841394025604551) internal successors, (3611), 2816 states have internal predecessors, (3611), 5 states have call successors, (5), 1 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-18 14:33:23,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2818 states to 2818 states and 3616 transitions. [2024-11-18 14:33:23,480 INFO L78 Accepts]: Start accepts. Automaton has 2818 states and 3616 transitions. Word has length 160 [2024-11-18 14:33:23,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 14:33:23,480 INFO L471 AbstractCegarLoop]: Abstraction has 2818 states and 3616 transitions. [2024-11-18 14:33:23,481 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 50.666666666666664) internal successors, (152), 3 states have internal predecessors, (152), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-18 14:33:23,481 INFO L276 IsEmpty]: Start isEmpty. Operand 2818 states and 3616 transitions. [2024-11-18 14:33:23,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2024-11-18 14:33:23,483 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 14:33:23,483 INFO L215 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-18 14:33:23,497 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-11-18 14:33:23,686 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2024-11-18 14:33:23,687 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 14:33:23,687 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 14:33:23,687 INFO L85 PathProgramCache]: Analyzing trace with hash -321422549, now seen corresponding path program 1 times [2024-11-18 14:33:23,687 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 14:33:23,687 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [211158972] [2024-11-18 14:33:23,687 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 14:33:23,687 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 14:33:23,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 14:33:23,782 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 20 proven. 2 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-11-18 14:33:23,782 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 14:33:23,782 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [211158972] [2024-11-18 14:33:23,782 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [211158972] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-18 14:33:23,782 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [907749666] [2024-11-18 14:33:23,783 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 14:33:23,783 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-18 14:33:23,783 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-18 14:33:23,787 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-18 14:33:23,788 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-18 14:33:23,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 14:33:23,887 INFO L255 TraceCheckSpWp]: Trace formula consists of 526 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-18 14:33:23,889 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-18 14:33:23,916 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-18 14:33:23,916 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-18 14:33:23,916 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [907749666] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 14:33:23,916 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-18 14:33:23,916 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2024-11-18 14:33:23,916 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [865150430] [2024-11-18 14:33:23,916 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 14:33:23,917 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-18 14:33:23,917 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 14:33:23,917 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-18 14:33:23,917 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-18 14:33:23,917 INFO L87 Difference]: Start difference. First operand 2818 states and 3616 transitions. Second operand has 3 states, 3 states have (on average 50.666666666666664) internal successors, (152), 3 states have internal predecessors, (152), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-18 14:33:24,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 14:33:24,207 INFO L93 Difference]: Finished difference Result 6367 states and 8330 transitions. [2024-11-18 14:33:24,207 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-18 14:33:24,208 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 50.666666666666664) internal successors, (152), 3 states have internal predecessors, (152), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 161 [2024-11-18 14:33:24,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 14:33:24,215 INFO L225 Difference]: With dead ends: 6367 [2024-11-18 14:33:24,215 INFO L226 Difference]: Without dead ends: 3721 [2024-11-18 14:33:24,218 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 166 GetRequests, 162 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-18 14:33:24,218 INFO L432 NwaCegarLoop]: 439 mSDtfsCounter, 201 mSDsluCounter, 215 mSDsCounter, 0 mSdLazyCounter, 198 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 201 SdHoareTripleChecker+Valid, 654 SdHoareTripleChecker+Invalid, 258 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 198 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-18 14:33:24,218 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [201 Valid, 654 Invalid, 258 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 198 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-18 14:33:24,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3721 states. [2024-11-18 14:33:24,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3721 to 3633. [2024-11-18 14:33:24,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3633 states, 3627 states have (on average 1.2514474772539288) internal successors, (4539), 3631 states have internal predecessors, (4539), 5 states have call successors, (5), 1 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-18 14:33:24,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3633 states to 3633 states and 4544 transitions. [2024-11-18 14:33:24,313 INFO L78 Accepts]: Start accepts. Automaton has 3633 states and 4544 transitions. Word has length 161 [2024-11-18 14:33:24,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 14:33:24,314 INFO L471 AbstractCegarLoop]: Abstraction has 3633 states and 4544 transitions. [2024-11-18 14:33:24,314 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 50.666666666666664) internal successors, (152), 3 states have internal predecessors, (152), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-18 14:33:24,314 INFO L276 IsEmpty]: Start isEmpty. Operand 3633 states and 4544 transitions. [2024-11-18 14:33:24,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2024-11-18 14:33:24,315 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 14:33:24,315 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-18 14:33:24,328 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-18 14:33:24,516 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-18 14:33:24,516 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 14:33:24,517 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 14:33:24,517 INFO L85 PathProgramCache]: Analyzing trace with hash 920589941, now seen corresponding path program 1 times [2024-11-18 14:33:24,517 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 14:33:24,517 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1743624643] [2024-11-18 14:33:24,517 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 14:33:24,517 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 14:33:24,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 14:33:24,750 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 5 proven. 44 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-11-18 14:33:24,750 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 14:33:24,750 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1743624643] [2024-11-18 14:33:24,750 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1743624643] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-18 14:33:24,750 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1484955233] [2024-11-18 14:33:24,751 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 14:33:24,751 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-18 14:33:24,751 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-18 14:33:24,752 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-18 14:33:24,754 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-18 14:33:24,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 14:33:24,863 INFO L255 TraceCheckSpWp]: Trace formula consists of 530 conjuncts, 19 conjuncts are in the unsatisfiable core [2024-11-18 14:33:24,865 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-18 14:33:25,030 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 5 proven. 44 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-11-18 14:33:25,031 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-18 14:33:25,173 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 5 proven. 44 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-11-18 14:33:25,173 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1484955233] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-18 14:33:25,173 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-18 14:33:25,174 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 9] total 10 [2024-11-18 14:33:25,174 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [293583128] [2024-11-18 14:33:25,175 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-18 14:33:25,175 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-18 14:33:25,176 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 14:33:25,176 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-18 14:33:25,176 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2024-11-18 14:33:25,176 INFO L87 Difference]: Start difference. First operand 3633 states and 4544 transitions. Second operand has 10 states, 10 states have (on average 16.2) internal successors, (162), 10 states have internal predecessors, (162), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-18 14:33:25,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 14:33:25,541 INFO L93 Difference]: Finished difference Result 9773 states and 12248 transitions. [2024-11-18 14:33:25,541 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-18 14:33:25,542 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 16.2) internal successors, (162), 10 states have internal predecessors, (162), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 163 [2024-11-18 14:33:25,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 14:33:25,553 INFO L225 Difference]: With dead ends: 9773 [2024-11-18 14:33:25,553 INFO L226 Difference]: Without dead ends: 6312 [2024-11-18 14:33:25,558 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 344 GetRequests, 327 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=72, Invalid=270, Unknown=0, NotChecked=0, Total=342 [2024-11-18 14:33:25,559 INFO L432 NwaCegarLoop]: 542 mSDtfsCounter, 919 mSDsluCounter, 3752 mSDsCounter, 0 mSdLazyCounter, 325 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 919 SdHoareTripleChecker+Valid, 4294 SdHoareTripleChecker+Invalid, 347 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 325 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-18 14:33:25,559 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [919 Valid, 4294 Invalid, 347 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 325 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-18 14:33:25,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6312 states. [2024-11-18 14:33:25,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6312 to 5146. [2024-11-18 14:33:25,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5146 states, 5140 states have (on average 1.2560311284046692) internal successors, (6456), 5144 states have internal predecessors, (6456), 5 states have call successors, (5), 1 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-18 14:33:25,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5146 states to 5146 states and 6461 transitions. [2024-11-18 14:33:25,702 INFO L78 Accepts]: Start accepts. Automaton has 5146 states and 6461 transitions. Word has length 163 [2024-11-18 14:33:25,702 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 14:33:25,702 INFO L471 AbstractCegarLoop]: Abstraction has 5146 states and 6461 transitions. [2024-11-18 14:33:25,703 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 16.2) internal successors, (162), 10 states have internal predecessors, (162), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-18 14:33:25,703 INFO L276 IsEmpty]: Start isEmpty. Operand 5146 states and 6461 transitions. [2024-11-18 14:33:25,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 264 [2024-11-18 14:33:25,705 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 14:33:25,706 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 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-18 14:33:25,723 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-11-18 14:33:25,909 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-18 14:33:25,910 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 14:33:25,911 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 14:33:25,911 INFO L85 PathProgramCache]: Analyzing trace with hash -763703227, now seen corresponding path program 1 times [2024-11-18 14:33:25,911 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 14:33:25,911 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1330104643] [2024-11-18 14:33:25,911 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 14:33:25,911 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 14:33:25,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 14:33:26,118 INFO L134 CoverageAnalysis]: Checked inductivity of 215 backedges. 103 proven. 103 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-18 14:33:26,118 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 14:33:26,118 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1330104643] [2024-11-18 14:33:26,118 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1330104643] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-18 14:33:26,119 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [735794646] [2024-11-18 14:33:26,119 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 14:33:26,119 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-18 14:33:26,119 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-18 14:33:26,121 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-18 14:33:26,129 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-18 14:33:26,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 14:33:26,302 INFO L255 TraceCheckSpWp]: Trace formula consists of 788 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-18 14:33:26,305 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-18 14:33:26,494 INFO L134 CoverageAnalysis]: Checked inductivity of 215 backedges. 206 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-18 14:33:26,495 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-18 14:33:26,495 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [735794646] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 14:33:26,495 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-18 14:33:26,495 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [7] total 9 [2024-11-18 14:33:26,495 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [797395799] [2024-11-18 14:33:26,495 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 14:33:26,496 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-18 14:33:26,496 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 14:33:26,496 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-18 14:33:26,496 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-11-18 14:33:26,497 INFO L87 Difference]: Start difference. First operand 5146 states and 6461 transitions. Second operand has 7 states, 7 states have (on average 36.714285714285715) internal successors, (257), 7 states have internal predecessors, (257), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-18 14:33:26,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 14:33:26,750 INFO L93 Difference]: Finished difference Result 10807 states and 13568 transitions. [2024-11-18 14:33:26,750 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-18 14:33:26,750 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 36.714285714285715) internal successors, (257), 7 states have internal predecessors, (257), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 263 [2024-11-18 14:33:26,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 14:33:26,762 INFO L225 Difference]: With dead ends: 10807 [2024-11-18 14:33:26,763 INFO L226 Difference]: Without dead ends: 5830 [2024-11-18 14:33:26,770 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 276 GetRequests, 264 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=57, Invalid=125, Unknown=0, NotChecked=0, Total=182 [2024-11-18 14:33:26,771 INFO L432 NwaCegarLoop]: 728 mSDtfsCounter, 1028 mSDsluCounter, 1513 mSDsCounter, 0 mSdLazyCounter, 148 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1028 SdHoareTripleChecker+Valid, 2241 SdHoareTripleChecker+Invalid, 180 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 148 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-18 14:33:26,772 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1028 Valid, 2241 Invalid, 180 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 148 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-18 14:33:26,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5830 states. [2024-11-18 14:33:26,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5830 to 5015. [2024-11-18 14:33:26,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5015 states, 5009 states have (on average 1.2537432621281692) internal successors, (6280), 5013 states have internal predecessors, (6280), 5 states have call successors, (5), 1 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-18 14:33:26,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5015 states to 5015 states and 6285 transitions. [2024-11-18 14:33:26,969 INFO L78 Accepts]: Start accepts. Automaton has 5015 states and 6285 transitions. Word has length 263 [2024-11-18 14:33:26,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 14:33:26,969 INFO L471 AbstractCegarLoop]: Abstraction has 5015 states and 6285 transitions. [2024-11-18 14:33:26,970 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 36.714285714285715) internal successors, (257), 7 states have internal predecessors, (257), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-18 14:33:26,970 INFO L276 IsEmpty]: Start isEmpty. Operand 5015 states and 6285 transitions. [2024-11-18 14:33:26,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 265 [2024-11-18 14:33:26,973 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 14:33:26,973 INFO L215 NwaCegarLoop]: trace histogram [5, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-18 14:33:26,987 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-11-18 14:33:27,173 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-18 14:33:27,174 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 14:33:27,174 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 14:33:27,174 INFO L85 PathProgramCache]: Analyzing trace with hash 1019295115, now seen corresponding path program 1 times [2024-11-18 14:33:27,174 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 14:33:27,174 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1316184566] [2024-11-18 14:33:27,175 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 14:33:27,175 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 14:33:27,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 14:33:27,251 INFO L134 CoverageAnalysis]: Checked inductivity of 166 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2024-11-18 14:33:27,252 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 14:33:27,252 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1316184566] [2024-11-18 14:33:27,252 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1316184566] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 14:33:27,252 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 14:33:27,252 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-18 14:33:27,252 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1706995673] [2024-11-18 14:33:27,252 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 14:33:27,253 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-18 14:33:27,253 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 14:33:27,253 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-18 14:33:27,253 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-18 14:33:27,253 INFO L87 Difference]: Start difference. First operand 5015 states and 6285 transitions. Second operand has 3 states, 3 states have (on average 56.333333333333336) internal successors, (169), 3 states have internal predecessors, (169), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-18 14:33:27,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 14:33:27,394 INFO L93 Difference]: Finished difference Result 5886 states and 7262 transitions. [2024-11-18 14:33:27,394 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-18 14:33:27,395 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 56.333333333333336) internal successors, (169), 3 states have internal predecessors, (169), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 264 [2024-11-18 14:33:27,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 14:33:27,399 INFO L225 Difference]: With dead ends: 5886 [2024-11-18 14:33:27,400 INFO L226 Difference]: Without dead ends: 924 [2024-11-18 14:33:27,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-18 14:33:27,404 INFO L432 NwaCegarLoop]: 275 mSDtfsCounter, 130 mSDsluCounter, 113 mSDsCounter, 0 mSdLazyCounter, 101 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 130 SdHoareTripleChecker+Valid, 388 SdHoareTripleChecker+Invalid, 107 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 101 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-18 14:33:27,405 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [130 Valid, 388 Invalid, 107 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 101 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-18 14:33:27,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 924 states. [2024-11-18 14:33:27,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 924 to 921. [2024-11-18 14:33:27,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 921 states, 917 states have (on average 1.0828789531079608) internal successors, (993), 919 states have internal predecessors, (993), 3 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-18 14:33:27,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 921 states to 921 states and 996 transitions. [2024-11-18 14:33:27,447 INFO L78 Accepts]: Start accepts. Automaton has 921 states and 996 transitions. Word has length 264 [2024-11-18 14:33:27,447 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 14:33:27,447 INFO L471 AbstractCegarLoop]: Abstraction has 921 states and 996 transitions. [2024-11-18 14:33:27,448 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 56.333333333333336) internal successors, (169), 3 states have internal predecessors, (169), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-18 14:33:27,448 INFO L276 IsEmpty]: Start isEmpty. Operand 921 states and 996 transitions. [2024-11-18 14:33:27,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 266 [2024-11-18 14:33:27,450 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 14:33:27,451 INFO L215 NwaCegarLoop]: trace histogram [5, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-18 14:33:27,451 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-11-18 14:33:27,451 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 14:33:27,451 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 14:33:27,451 INFO L85 PathProgramCache]: Analyzing trace with hash -1686235295, now seen corresponding path program 1 times [2024-11-18 14:33:27,451 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 14:33:27,451 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1510098103] [2024-11-18 14:33:27,452 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 14:33:27,452 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 14:33:27,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 14:33:27,609 INFO L134 CoverageAnalysis]: Checked inductivity of 166 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2024-11-18 14:33:27,609 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 14:33:27,609 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1510098103] [2024-11-18 14:33:27,609 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1510098103] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 14:33:27,609 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 14:33:27,609 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-18 14:33:27,609 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1228294399] [2024-11-18 14:33:27,609 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 14:33:27,610 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-18 14:33:27,610 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 14:33:27,610 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-18 14:33:27,610 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-18 14:33:27,611 INFO L87 Difference]: Start difference. First operand 921 states and 996 transitions. Second operand has 7 states, 7 states have (on average 24.285714285714285) internal successors, (170), 7 states have internal predecessors, (170), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-18 14:33:27,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 14:33:27,737 INFO L93 Difference]: Finished difference Result 1233 states and 1332 transitions. [2024-11-18 14:33:27,737 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-18 14:33:27,737 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 24.285714285714285) internal successors, (170), 7 states have internal predecessors, (170), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 265 [2024-11-18 14:33:27,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 14:33:27,741 INFO L225 Difference]: With dead ends: 1233 [2024-11-18 14:33:27,742 INFO L226 Difference]: Without dead ends: 932 [2024-11-18 14:33:27,742 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2024-11-18 14:33:27,743 INFO L432 NwaCegarLoop]: 265 mSDtfsCounter, 223 mSDsluCounter, 1186 mSDsCounter, 0 mSdLazyCounter, 87 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 223 SdHoareTripleChecker+Valid, 1451 SdHoareTripleChecker+Invalid, 90 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 87 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-18 14:33:27,743 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [223 Valid, 1451 Invalid, 90 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 87 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-18 14:33:27,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 932 states. [2024-11-18 14:33:27,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 932 to 919. [2024-11-18 14:33:27,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 919 states, 915 states have (on average 1.0786885245901638) internal successors, (987), 917 states have internal predecessors, (987), 3 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-18 14:33:27,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 919 states to 919 states and 990 transitions. [2024-11-18 14:33:27,779 INFO L78 Accepts]: Start accepts. Automaton has 919 states and 990 transitions. Word has length 265 [2024-11-18 14:33:27,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 14:33:27,779 INFO L471 AbstractCegarLoop]: Abstraction has 919 states and 990 transitions. [2024-11-18 14:33:27,779 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 24.285714285714285) internal successors, (170), 7 states have internal predecessors, (170), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-18 14:33:27,779 INFO L276 IsEmpty]: Start isEmpty. Operand 919 states and 990 transitions. [2024-11-18 14:33:27,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 267 [2024-11-18 14:33:27,780 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 14:33:27,781 INFO L215 NwaCegarLoop]: trace histogram [5, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-18 14:33:27,781 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-11-18 14:33:27,781 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 14:33:27,781 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 14:33:27,781 INFO L85 PathProgramCache]: Analyzing trace with hash -232946174, now seen corresponding path program 1 times [2024-11-18 14:33:27,781 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 14:33:27,781 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1009001117] [2024-11-18 14:33:27,781 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 14:33:27,781 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 14:33:27,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 14:33:27,856 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 47 proven. 0 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2024-11-18 14:33:27,856 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 14:33:27,856 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1009001117] [2024-11-18 14:33:27,856 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1009001117] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 14:33:27,856 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 14:33:27,856 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-18 14:33:27,856 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [849966157] [2024-11-18 14:33:27,856 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 14:33:27,857 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-18 14:33:27,857 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 14:33:27,857 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-18 14:33:27,857 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-18 14:33:27,857 INFO L87 Difference]: Start difference. First operand 919 states and 990 transitions. Second operand has 5 states, 5 states have (on average 34.2) internal successors, (171), 5 states have internal predecessors, (171), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-18 14:33:27,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 14:33:27,911 INFO L93 Difference]: Finished difference Result 1211 states and 1301 transitions. [2024-11-18 14:33:27,911 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-18 14:33:27,912 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 34.2) internal successors, (171), 5 states have internal predecessors, (171), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 266 [2024-11-18 14:33:27,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 14:33:27,915 INFO L225 Difference]: With dead ends: 1211 [2024-11-18 14:33:27,915 INFO L226 Difference]: Without dead ends: 908 [2024-11-18 14:33:27,916 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-18 14:33:27,917 INFO L432 NwaCegarLoop]: 261 mSDtfsCounter, 178 mSDsluCounter, 588 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 178 SdHoareTripleChecker+Valid, 849 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-18 14:33:27,917 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [178 Valid, 849 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-18 14:33:27,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 908 states. [2024-11-18 14:33:27,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 908 to 902. [2024-11-18 14:33:27,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 902 states, 899 states have (on average 1.0622914349276975) internal successors, (955), 900 states have internal predecessors, (955), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-18 14:33:27,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 902 states to 902 states and 957 transitions. [2024-11-18 14:33:27,942 INFO L78 Accepts]: Start accepts. Automaton has 902 states and 957 transitions. Word has length 266 [2024-11-18 14:33:27,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 14:33:27,944 INFO L471 AbstractCegarLoop]: Abstraction has 902 states and 957 transitions. [2024-11-18 14:33:27,944 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 34.2) internal successors, (171), 5 states have internal predecessors, (171), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-18 14:33:27,944 INFO L276 IsEmpty]: Start isEmpty. Operand 902 states and 957 transitions. [2024-11-18 14:33:27,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 326 [2024-11-18 14:33:27,945 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 14:33:27,946 INFO L215 NwaCegarLoop]: trace histogram [6, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 14:33:27,946 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-11-18 14:33:27,946 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 14:33:27,946 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 14:33:27,946 INFO L85 PathProgramCache]: Analyzing trace with hash 1219154648, now seen corresponding path program 1 times [2024-11-18 14:33:27,946 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 14:33:27,946 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1903894617] [2024-11-18 14:33:27,946 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 14:33:27,947 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 14:33:27,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 14:33:28,440 INFO L134 CoverageAnalysis]: Checked inductivity of 225 backedges. 40 proven. 123 refuted. 0 times theorem prover too weak. 62 trivial. 0 not checked. [2024-11-18 14:33:28,441 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 14:33:28,441 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1903894617] [2024-11-18 14:33:28,441 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1903894617] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-18 14:33:28,441 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [882265272] [2024-11-18 14:33:28,441 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 14:33:28,441 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-18 14:33:28,441 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-18 14:33:28,445 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-18 14:33:28,447 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-11-18 14:33:28,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 14:33:28,586 INFO L255 TraceCheckSpWp]: Trace formula consists of 925 conjuncts, 33 conjuncts are in the unsatisfiable core [2024-11-18 14:33:28,590 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-18 14:33:29,021 INFO L134 CoverageAnalysis]: Checked inductivity of 225 backedges. 40 proven. 123 refuted. 0 times theorem prover too weak. 62 trivial. 0 not checked. [2024-11-18 14:33:29,022 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-18 14:33:29,474 INFO L134 CoverageAnalysis]: Checked inductivity of 225 backedges. 15 proven. 148 refuted. 0 times theorem prover too weak. 62 trivial. 0 not checked. [2024-11-18 14:33:29,474 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [882265272] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-18 14:33:29,474 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-18 14:33:29,474 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 17, 17] total 28 [2024-11-18 14:33:29,474 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1907041346] [2024-11-18 14:33:29,474 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-18 14:33:29,475 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2024-11-18 14:33:29,475 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 14:33:29,476 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2024-11-18 14:33:29,476 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=686, Unknown=0, NotChecked=0, Total=756 [2024-11-18 14:33:29,476 INFO L87 Difference]: Start difference. First operand 902 states and 957 transitions. Second operand has 28 states, 28 states have (on average 14.142857142857142) internal successors, (396), 28 states have internal predecessors, (396), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-18 14:33:29,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 14:33:29,951 INFO L93 Difference]: Finished difference Result 917 states and 971 transitions. [2024-11-18 14:33:29,952 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-11-18 14:33:29,952 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 14.142857142857142) internal successors, (396), 28 states have internal predecessors, (396), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 325 [2024-11-18 14:33:29,952 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 14:33:29,955 INFO L225 Difference]: With dead ends: 917 [2024-11-18 14:33:29,955 INFO L226 Difference]: Without dead ends: 914 [2024-11-18 14:33:29,956 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 682 GetRequests, 642 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 287 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=181, Invalid=1541, Unknown=0, NotChecked=0, Total=1722 [2024-11-18 14:33:29,957 INFO L432 NwaCegarLoop]: 389 mSDtfsCounter, 551 mSDsluCounter, 7176 mSDsCounter, 0 mSdLazyCounter, 636 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 551 SdHoareTripleChecker+Valid, 7565 SdHoareTripleChecker+Invalid, 638 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 636 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-18 14:33:29,957 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [551 Valid, 7565 Invalid, 638 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 636 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-18 14:33:29,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 914 states. [2024-11-18 14:33:29,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 914 to 902. [2024-11-18 14:33:29,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 902 states, 899 states have (on average 1.061179087875417) internal successors, (954), 900 states have internal predecessors, (954), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-18 14:33:29,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 902 states to 902 states and 956 transitions. [2024-11-18 14:33:29,982 INFO L78 Accepts]: Start accepts. Automaton has 902 states and 956 transitions. Word has length 325 [2024-11-18 14:33:29,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 14:33:29,982 INFO L471 AbstractCegarLoop]: Abstraction has 902 states and 956 transitions. [2024-11-18 14:33:29,982 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 14.142857142857142) internal successors, (396), 28 states have internal predecessors, (396), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-18 14:33:29,983 INFO L276 IsEmpty]: Start isEmpty. Operand 902 states and 956 transitions. [2024-11-18 14:33:29,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 373 [2024-11-18 14:33:29,984 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 14:33:29,984 INFO L215 NwaCegarLoop]: trace histogram [7, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 14:33:29,998 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2024-11-18 14:33:30,188 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-18 14:33:30,189 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 14:33:30,189 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 14:33:30,189 INFO L85 PathProgramCache]: Analyzing trace with hash 200109303, now seen corresponding path program 1 times [2024-11-18 14:33:30,189 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 14:33:30,189 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [906824622] [2024-11-18 14:33:30,190 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 14:33:30,190 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 14:33:30,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 14:33:30,487 INFO L134 CoverageAnalysis]: Checked inductivity of 315 backedges. 139 proven. 48 refuted. 0 times theorem prover too weak. 128 trivial. 0 not checked. [2024-11-18 14:33:30,488 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 14:33:30,488 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [906824622] [2024-11-18 14:33:30,488 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [906824622] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-18 14:33:30,488 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [25069549] [2024-11-18 14:33:30,488 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 14:33:30,488 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-18 14:33:30,488 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-18 14:33:30,490 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-18 14:33:30,491 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-11-18 14:33:30,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 14:33:30,638 INFO L255 TraceCheckSpWp]: Trace formula consists of 1049 conjuncts, 19 conjuncts are in the unsatisfiable core [2024-11-18 14:33:30,643 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-18 14:33:30,815 INFO L134 CoverageAnalysis]: Checked inductivity of 315 backedges. 139 proven. 48 refuted. 0 times theorem prover too weak. 128 trivial. 0 not checked. [2024-11-18 14:33:30,815 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-18 14:33:30,940 INFO L134 CoverageAnalysis]: Checked inductivity of 315 backedges. 139 proven. 48 refuted. 0 times theorem prover too weak. 128 trivial. 0 not checked. [2024-11-18 14:33:30,940 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [25069549] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-18 14:33:30,940 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-18 14:33:30,940 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 9] total 10 [2024-11-18 14:33:30,940 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [361248383] [2024-11-18 14:33:30,940 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-18 14:33:30,941 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-18 14:33:30,941 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 14:33:30,941 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-18 14:33:30,942 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2024-11-18 14:33:30,942 INFO L87 Difference]: Start difference. First operand 902 states and 956 transitions. Second operand has 10 states, 10 states have (on average 27.8) internal successors, (278), 10 states have internal predecessors, (278), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-18 14:33:31,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 14:33:31,090 INFO L93 Difference]: Finished difference Result 1014 states and 1071 transitions. [2024-11-18 14:33:31,090 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-18 14:33:31,090 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 27.8) internal successors, (278), 10 states have internal predecessors, (278), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 372 [2024-11-18 14:33:31,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 14:33:31,094 INFO L225 Difference]: With dead ends: 1014 [2024-11-18 14:33:31,094 INFO L226 Difference]: Without dead ends: 910 [2024-11-18 14:33:31,094 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 762 GetRequests, 748 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=187, Unknown=0, NotChecked=0, Total=240 [2024-11-18 14:33:31,095 INFO L432 NwaCegarLoop]: 346 mSDtfsCounter, 437 mSDsluCounter, 1997 mSDsCounter, 0 mSdLazyCounter, 187 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 437 SdHoareTripleChecker+Valid, 2343 SdHoareTripleChecker+Invalid, 194 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 187 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-18 14:33:31,095 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [437 Valid, 2343 Invalid, 194 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 187 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-18 14:33:31,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 910 states. [2024-11-18 14:33:31,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 910 to 901. [2024-11-18 14:33:31,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 901 states, 899 states have (on average 1.0567296996662958) internal successors, (950), 899 states have internal predecessors, (950), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-18 14:33:31,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 901 states to 901 states and 951 transitions. [2024-11-18 14:33:31,122 INFO L78 Accepts]: Start accepts. Automaton has 901 states and 951 transitions. Word has length 372 [2024-11-18 14:33:31,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 14:33:31,122 INFO L471 AbstractCegarLoop]: Abstraction has 901 states and 951 transitions. [2024-11-18 14:33:31,122 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 27.8) internal successors, (278), 10 states have internal predecessors, (278), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-18 14:33:31,122 INFO L276 IsEmpty]: Start isEmpty. Operand 901 states and 951 transitions. [2024-11-18 14:33:31,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 434 [2024-11-18 14:33:31,124 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 14:33:31,124 INFO L215 NwaCegarLoop]: trace histogram [8, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-18 14:33:31,139 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2024-11-18 14:33:31,325 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2024-11-18 14:33:31,325 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 14:33:31,326 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 14:33:31,326 INFO L85 PathProgramCache]: Analyzing trace with hash 2022630306, now seen corresponding path program 1 times [2024-11-18 14:33:31,326 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 14:33:31,326 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [270917501] [2024-11-18 14:33:31,326 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 14:33:31,326 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 14:33:31,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 14:33:32,372 INFO L134 CoverageAnalysis]: Checked inductivity of 439 backedges. 73 proven. 357 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-18 14:33:32,373 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 14:33:32,373 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [270917501] [2024-11-18 14:33:32,373 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [270917501] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-18 14:33:32,373 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1433650772] [2024-11-18 14:33:32,373 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 14:33:32,373 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-18 14:33:32,374 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-18 14:33:32,375 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-18 14:33:32,376 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-11-18 14:33:32,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 14:33:32,568 INFO L255 TraceCheckSpWp]: Trace formula consists of 1190 conjuncts, 45 conjuncts are in the unsatisfiable core [2024-11-18 14:33:32,572 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-18 14:33:33,340 INFO L134 CoverageAnalysis]: Checked inductivity of 439 backedges. 91 proven. 339 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-18 14:33:33,341 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-18 14:33:33,765 INFO L134 CoverageAnalysis]: Checked inductivity of 439 backedges. 20 proven. 410 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-18 14:33:33,765 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1433650772] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-18 14:33:33,765 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-18 14:33:33,765 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 21, 21] total 35 [2024-11-18 14:33:33,765 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [802983555] [2024-11-18 14:33:33,765 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-18 14:33:33,766 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2024-11-18 14:33:33,766 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 14:33:33,767 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2024-11-18 14:33:33,767 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=1099, Unknown=0, NotChecked=0, Total=1190 [2024-11-18 14:33:33,768 INFO L87 Difference]: Start difference. First operand 901 states and 951 transitions. Second operand has 35 states, 35 states have (on average 18.914285714285715) internal successors, (662), 35 states have internal predecessors, (662), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-18 14:33:34,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 14:33:34,296 INFO L93 Difference]: Finished difference Result 910 states and 960 transitions. [2024-11-18 14:33:34,296 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2024-11-18 14:33:34,296 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 35 states have (on average 18.914285714285715) internal successors, (662), 35 states have internal predecessors, (662), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 433 [2024-11-18 14:33:34,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 14:33:34,300 INFO L225 Difference]: With dead ends: 910 [2024-11-18 14:33:34,300 INFO L226 Difference]: Without dead ends: 0 [2024-11-18 14:33:34,301 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 911 GetRequests, 858 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 583 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=254, Invalid=2716, Unknown=0, NotChecked=0, Total=2970 [2024-11-18 14:33:34,302 INFO L432 NwaCegarLoop]: 524 mSDtfsCounter, 1002 mSDsluCounter, 10629 mSDsCounter, 0 mSdLazyCounter, 949 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1002 SdHoareTripleChecker+Valid, 11153 SdHoareTripleChecker+Invalid, 952 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 949 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-18 14:33:34,302 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1002 Valid, 11153 Invalid, 952 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 949 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-18 14:33:34,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-11-18 14:33:34,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-11-18 14:33:34,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 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-18 14:33:34,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-11-18 14:33:34,305 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 433 [2024-11-18 14:33:34,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 14:33:34,305 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-18 14:33:34,305 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 35 states have (on average 18.914285714285715) internal successors, (662), 35 states have internal predecessors, (662), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-18 14:33:34,305 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-11-18 14:33:34,305 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-11-18 14:33:34,308 INFO L782 garLoopResultBuilder]: Registering result SAFE for location errorErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-18 14:33:34,332 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2024-11-18 14:33:34,512 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2024-11-18 14:33:34,516 INFO L407 BasicCegarLoop]: Path program 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] [2024-11-18 14:33:34,518 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-11-18 14:34:09,875 WARN L286 SmtUtils]: Spent 31.67s on a formula simplification. DAG size of input: 187 DAG size of output: 275 (called from [L 212] de.uni_freiburg.informatik.ultimate.lib.proofs.floydhoare.HoareAnnotationComposer.or) [2024-11-18 14:34:22,159 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-18 14:34:22,220 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.11 02:34:22 BoogieIcfgContainer [2024-11-18 14:34:22,220 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-18 14:34:22,221 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-18 14:34:22,221 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-18 14:34:22,221 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-18 14:34:22,221 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 02:33:14" (3/4) ... [2024-11-18 14:34:22,223 INFO L142 WitnessPrinter]: Generating witness for correct program [2024-11-18 14:34:22,226 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure error [2024-11-18 14:34:22,238 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 12 nodes and edges [2024-11-18 14:34:22,239 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2024-11-18 14:34:22,241 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-11-18 14:34:22,242 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-18 14:34:22,414 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-18 14:34:22,414 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-11-18 14:34:22,415 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-18 14:34:22,415 INFO L158 Benchmark]: Toolchain (without parser) took 68961.32ms. Allocated memory was 174.1MB in the beginning and 1.5GB in the end (delta: 1.4GB). Free memory was 109.2MB in the beginning and 1.2GB in the end (delta: -1.1GB). Peak memory consumption was 219.1MB. Max. memory is 16.1GB. [2024-11-18 14:34:22,415 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 100.7MB. Free memory is still 50.5MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-18 14:34:22,416 INFO L158 Benchmark]: CACSL2BoogieTranslator took 469.19ms. Allocated memory is still 174.1MB. Free memory was 108.8MB in the beginning and 134.9MB in the end (delta: -26.2MB). Peak memory consumption was 13.8MB. Max. memory is 16.1GB. [2024-11-18 14:34:22,416 INFO L158 Benchmark]: Boogie Procedure Inliner took 51.37ms. Allocated memory is still 174.1MB. Free memory was 134.9MB in the beginning and 131.6MB in the end (delta: 3.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-18 14:34:22,416 INFO L158 Benchmark]: Boogie Preprocessor took 59.87ms. Allocated memory is still 174.1MB. Free memory was 131.6MB in the beginning and 127.1MB in the end (delta: 4.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-18 14:34:22,416 INFO L158 Benchmark]: RCFGBuilder took 870.45ms. Allocated memory is still 174.1MB. Free memory was 127.1MB in the beginning and 125.7MB in the end (delta: 1.5MB). Peak memory consumption was 42.6MB. Max. memory is 16.1GB. [2024-11-18 14:34:22,416 INFO L158 Benchmark]: TraceAbstraction took 67305.35ms. Allocated memory was 174.1MB in the beginning and 1.5GB in the end (delta: 1.4GB). Free memory was 124.8MB in the beginning and 1.3GB in the end (delta: -1.1GB). Peak memory consumption was 932.2MB. Max. memory is 16.1GB. [2024-11-18 14:34:22,417 INFO L158 Benchmark]: Witness Printer took 194.05ms. Allocated memory is still 1.5GB. Free memory was 1.3GB in the beginning and 1.2GB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-11-18 14:34:22,418 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.14ms. Allocated memory is still 100.7MB. Free memory is still 50.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 469.19ms. Allocated memory is still 174.1MB. Free memory was 108.8MB in the beginning and 134.9MB in the end (delta: -26.2MB). Peak memory consumption was 13.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 51.37ms. Allocated memory is still 174.1MB. Free memory was 134.9MB in the beginning and 131.6MB in the end (delta: 3.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 59.87ms. Allocated memory is still 174.1MB. Free memory was 131.6MB in the beginning and 127.1MB in the end (delta: 4.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 870.45ms. Allocated memory is still 174.1MB. Free memory was 127.1MB in the beginning and 125.7MB in the end (delta: 1.5MB). Peak memory consumption was 42.6MB. Max. memory is 16.1GB. * TraceAbstraction took 67305.35ms. Allocated memory was 174.1MB in the beginning and 1.5GB in the end (delta: 1.4GB). Free memory was 124.8MB in the beginning and 1.3GB in the end (delta: -1.1GB). Peak memory consumption was 932.2MB. Max. memory is 16.1GB. * Witness Printer took 194.05ms. Allocated memory is still 1.5GB. Free memory was 1.3GB in the beginning and 1.2GB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 20]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 273 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 19.5s, OverallIterations: 27, TraceHistogramMax: 8, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 6.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 12224 SdHoareTripleChecker+Valid, 3.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 12224 mSDsluCounter, 50904 SdHoareTripleChecker+Invalid, 2.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 38201 mSDsCounter, 512 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 4765 IncrementalHoareTripleChecker+Invalid, 5277 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 512 mSolverCounterUnsat, 12703 mSDtfsCounter, 4765 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 3680 GetRequests, 3469 SyntacticMatches, 0 SemanticMatches, 211 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 971 ImplicationChecksByTransitivity, 1.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=7555occurred in iteration=13, InterpolantAutomatonStates: 183, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 2.5s AutomataMinimizationTime, 27 MinimizatonAttempts, 10341 StatesRemovedByMinimization, 24 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 6.8s InterpolantComputationTime, 6010 NumberOfCodeBlocks, 6010 NumberOfCodeBlocksAsserted, 36 NumberOfCheckSat, 7263 ConstructedInterpolants, 0 QuantifiedInterpolants, 19528 SizeOfPredicates, 32 NumberOfNonLiveVariables, 6449 ConjunctsInSsa, 132 ConjunctsInUnsatCore, 40 InterpolantComputations, 23 PerfectInterpolantSequences, 2367/4270 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 293]: Loop Invariant Derived loop invariant: ((((((((((((((((((2 <= c_write_req_ev) && (c_req_a == 0)) && (1 <= c_m_lock)) && (c_req_type == 1)) && (2 == s_run_pc)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (a_t == 0)) && (a == 0)) && (2 <= c_m_ev)) && (c_req_d == 50)) || ((((((((((((51 == c_req_d) && (2 <= c_write_req_ev)) && (1 <= c_m_lock)) && (c_req_type == 1)) && (c_req_a == 1)) && (s_memory0 == 50)) && (2 == s_run_pc)) && (0 <= a_t)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (1 <= a)) && (2 <= c_m_ev))) || (((((2 <= c_write_req_ev) && (s_run_st != 0)) && (2 == s_run_pc)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1))) || (((((((((((((51 == c_req_d) && (2 <= c_write_req_ev)) && (1 <= c_m_lock)) && (1 <= a_t)) && (s_run_st != 0)) && (s_memory0 == 50)) && (2 == s_run_pc)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (m_run_pc == 3)) && (1 <= a)) && (2 <= c_m_ev)) && (s_memory1 == 51))) || ((((((((((((2 <= c_write_req_ev) && (1 <= c_m_lock)) && (s_run_st != 0)) && (s_memory0 == 50)) && (2 == s_run_pc)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (m_run_pc == 3)) && (a_t == 0)) && (a == 0)) && (2 <= c_m_ev)) && (c_req_d == 50))) || (((((2 == s_run_pc) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 3))) || ((((((c_req_a == 0) && (s_run_st != 0)) && (s_run_pc == 0)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (c_req_type != 0))) || (((((((((((2 <= c_write_req_ev) && (c_req_a == 0)) && (1 <= c_m_lock)) && (c_req_type == 1)) && (s_run_pc == 0)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (a_t == 0)) && (a == 0)) && (2 <= c_m_ev)) && (c_req_d == 50))) - InvariantResult [Line: 490]: Loop Invariant Derived loop invariant: (((((((((((((((((51 == c_req_d) && (2 <= c_write_req_ev)) && (1 <= a_t)) && (s_run_st != 0)) && (c_m_lock != 1)) && (s_memory0 == 50)) && (2 == s_run_pc)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 3)) && (a == 0)) && (2 <= c_m_ev)) && (s_memory1 == 51)) || (((((((((((2 <= c_write_req_ev) && (1 <= a_t)) && (s_run_st != 0)) && (2 <= a)) && (c_m_lock != 1)) && (2 == s_run_pc)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 6)) && (2 <= c_m_ev))) || (((((((((((((((((c_req_type == 0) && (2 <= c_write_req_ev)) && (c_req_a == 0)) && (c_rsp_d == 50)) && (s_run_st != 0)) && (req_tt_a == 0)) && (c_m_lock != 1)) && (s_memory0 == 50)) && (a == 1)) && (2 == s_run_pc)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 6)) && (a_t == 0)) && (2 <= c_m_ev)) && (s_memory1 == 51))) || ((((((((((2 <= c_write_req_ev) && (1 <= a_t)) && (s_run_st != 0)) && (2 <= a)) && (c_m_lock != 1)) && (2 == s_run_pc)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 3)) && (2 <= c_m_ev))) - InvariantResult [Line: 139]: Loop Invariant Derived loop invariant: (((((((((((((((((2 <= c_write_req_ev) && (s_run_st != 0)) && (c_m_lock != 1)) && (s_memory0 == 50)) && (a == 1)) && (2 == s_run_pc)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 3)) && (a_t == 0)) && (2 <= c_m_ev)) && (c_req_d == 50)) || ((((((((((((c_req_type == 0) && (2 <= c_write_req_ev)) && (c_req_a == 0)) && (s_run_pc == 0)) && (c_m_lock != 1)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (a_t == 0)) && (a == 0)) && (2 <= c_m_ev)) && (m_run_pc == 0))) || ((((((((((((((51 == c_req_d) && (2 <= c_write_req_ev)) && (1 <= a_t)) && (s_run_st != 0)) && (2 <= a)) && (c_m_lock != 1)) && (s_memory0 == 50)) && (2 == s_run_pc)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 3)) && (2 <= c_m_ev)) && (s_memory1 == 51))) || ((((((((s_run_st != 0) && (s_run_pc == 0)) && (c_m_lock != 1)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (a == 0)) && (m_run_pc == 0))) || (((((((((((((c_req_type == 0) && (2 <= c_write_req_ev)) && (c_req_a == 0)) && (s_run_st != 0)) && (c_m_lock != 1)) && (2 == s_run_pc)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (a_t == 0)) && (a == 0)) && (2 <= c_m_ev)) && (m_run_pc == 0))) - InvariantResult [Line: 533]: Loop Invariant Derived loop invariant: (((((((((((((((((51 == c_req_d) && (req_type___0 == 0)) && (2 <= c_write_req_ev)) && (1 <= c_m_lock)) && (1 <= a_t)) && (s_run_st != 0)) && (req_a___0 == 0)) && (s_memory0 == 50)) && (2 == s_run_pc)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 3)) && (a == 0)) && (2 <= c_m_ev)) && (s_memory1 == 51)) || (((((((((((((((((((req_type___0 == 0) && (c_req_type == 0)) && (2 <= c_write_req_ev)) && (c_req_a == 0)) && (1 <= c_m_lock)) && (c_rsp_d == 50)) && (s_run_st != 0)) && (req_tt_a == 0)) && (s_memory0 == 50)) && (a == 1)) && (2 == s_run_pc)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 6)) && (a_t == 0)) && (2 <= c_m_ev)) && (s_memory1 == 51)) && (req_a___0 == 1))) - InvariantResult [Line: 183]: Loop Invariant Derived loop invariant: ((((((((((((req_a == 0) && (req_type != 0)) && (s_run_st != 0)) && (s_run_pc == 0)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (a == 0)) && (m_run_pc == 0)) || ((((((((((((((((2 <= c_write_req_ev) && (1 <= c_m_lock)) && (s_run_st != 0)) && (51 == req_d)) && (s_memory0 == 50)) && (a == 1)) && (2 == s_run_pc)) && (req_type == 1)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 3)) && (a_t == 0)) && (2 <= c_m_ev)) && (c_req_d == 50)) && (req_a == 1))) || (((((((((((((((c_req_type == 0) && (2 <= c_write_req_ev)) && (c_req_a == 0)) && (1 <= c_m_lock)) && (req_a == 0)) && (s_run_pc == 0)) && (req_d == 50)) && (req_type == 1)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (a_t == 0)) && (a == 0)) && (2 <= c_m_ev)) && (m_run_pc == 0))) || ((((((((((((((((c_req_type == 0) && (2 <= c_write_req_ev)) && (c_req_a == 0)) && (1 <= c_m_lock)) && (req_a == 0)) && (s_run_st != 0)) && (req_d == 50)) && (2 == s_run_pc)) && (req_type == 1)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (a_t == 0)) && (a == 0)) && (2 <= c_m_ev)) && (m_run_pc == 0))) - InvariantResult [Line: 1260]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((51 == c_req_d) && (2 <= c_write_req_ev)) && (1 <= c_m_lock)) && (1 <= a_t)) && (s_run_st != 0)) && (m_run_st == 0)) && (s_memory0 == 50)) && (2 == s_run_pc)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (m_run_pc == 3)) && (2 <= c_m_ev)) && (s_memory1 == 51)) || (((((((((((((c_req_type == 0) && (2 <= c_write_req_ev)) && (c_req_a == 0)) && (s_run_st != 0)) && (c_m_lock != 1)) && (m_run_st == 0)) && (2 == s_run_pc)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (a_t == 0)) && (2 <= c_m_ev)) && (m_run_pc == 0))) || ((((((((c_req_a == 0) && (s_run_st != 0)) && (s_run_pc == 0)) && (c_m_lock != 1)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 0))) || ((((((((((((2 <= c_write_req_ev) && (1 <= c_m_lock)) && (s_run_st != 0)) && (m_run_st == 0)) && (s_memory0 == 50)) && (2 == s_run_pc)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (m_run_pc == 3)) && (a_t == 0)) && (2 <= c_m_ev)) && (c_req_d == 50))) || ((((((((((2 <= c_write_req_ev) && (1 <= c_m_lock)) && (s_run_st != 0)) && (m_run_st == 0)) && (2 == s_run_pc)) && (0 <= a_t)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 6)) && (2 <= c_m_ev))) || ((((((((((((((((c_req_type == 0) && (2 <= c_write_req_ev)) && (1 <= c_m_lock)) && (1 <= a_t)) && (51 == c_rsp_d)) && (c_req_a == 1)) && (s_run_st != 0)) && (req_tt_a == 1)) && (m_run_st == 0)) && (s_memory0 == 50)) && (2 == s_run_pc)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (m_run_pc == 6)) && (2 <= c_m_ev)) && (s_memory1 == 51))) || (((((((((((c_req_type == 0) && (2 <= c_write_req_ev)) && (c_req_a == 0)) && (s_run_pc == 0)) && (c_m_lock != 1)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (a_t == 0)) && (2 <= c_m_ev)) && (m_run_pc == 0))) || ((((((((c_req_a == 0) && (s_run_st != 0)) && (s_run_pc == 0)) && (m_run_st == 0)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 3)) && (c_req_type != 0))) || (((((2 == s_run_pc) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 3))) || ((((((((((((((((c_req_type == 0) && (2 <= c_write_req_ev)) && (c_req_a == 0)) && (1 <= c_m_lock)) && (c_rsp_d == 50)) && (s_run_st != 0)) && (req_tt_a == 0)) && (m_run_st == 0)) && (s_memory0 == 50)) && (2 == s_run_pc)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (m_run_pc == 6)) && (a_t == 0)) && (2 <= c_m_ev)) && (s_memory1 == 51))) || ((((((((((2 <= c_write_req_ev) && (1 <= a_t)) && (s_run_st != 0)) && (m_run_st == 0)) && (2 == s_run_pc)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 6)) && (2 <= c_m_ev))) || (((((((2 <= c_write_req_ev) && (s_run_st != 0)) && (m_run_st == 0)) && (2 == s_run_pc)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 3))) - InvariantResult [Line: 884]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((((c_req_type == 0) && (2 <= c_write_req_ev)) && (1 <= c_m_lock)) && (1 <= a_t)) && (51 == c_rsp_d)) && (c_req_a == 1)) && (51 == rsp_d)) && (req_tt_a == 1)) && (req_a == 1)) && (s_memory0 == 50)) && (2 == s_run_pc)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (m_run_pc == 6)) && (req_type == 0)) && (2 <= c_m_ev)) && (s_memory1 == 51)) || ((((((s_run_st != 0) && (2 == s_run_pc)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 3))) || (((((((((((51 == c_req_d) && (2 <= c_write_req_ev)) && (1 <= c_m_lock)) && (1 <= a_t)) && (51 == req_d)) && (s_memory0 == 50)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (m_run_pc == 3)) && (2 <= c_m_ev)) && (s_memory1 == 51))) || ((((((((((((((c_req_type == 0) && (2 <= c_write_req_ev)) && (c_req_a == 0)) && (1 <= c_m_lock)) && (s_run_st != 0)) && (req_tt_a == 0)) && (s_memory0 == 50)) && (2 == s_run_pc)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 6)) && (a_t == 0)) && (2 <= c_m_ev)) && (s_memory1 == 51))) || (((((((((((((51 == c_req_d) && (2 <= c_write_req_ev)) && (1 <= c_m_lock)) && (c_req_type == 1)) && (1 <= a_t)) && (c_req_a == 1)) && (s_run_st != 0)) && (s_memory0 == 50)) && (2 == s_run_pc)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 3)) && (2 <= c_m_ev))) || ((((((((((((2 <= c_write_req_ev) && (c_req_a == 0)) && (1 <= c_m_lock)) && (c_req_type == 1)) && (s_run_st != 0)) && (2 == s_run_pc)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 3)) && (a_t == 0)) && (2 <= c_m_ev)) && (c_req_d == 50))) || ((((((((((((((c_req_type == 0) && (2 <= c_write_req_ev)) && (1 <= c_m_lock)) && (1 <= a_t)) && (c_req_a == 1)) && (s_run_st != 0)) && (req_tt_a == 1)) && (s_memory0 == 50)) && (2 == s_run_pc)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 6)) && (2 <= c_m_ev)) && (s_memory1 == 51))) || (((((((((((c_req_type == 0) && (2 <= c_write_req_ev)) && (c_req_a == 0)) && (s_run_st != 0)) && (c_m_lock != 1)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (a_t == 0)) && (2 <= c_m_ev)) && (m_run_pc == 0))) || ((((((((((2 <= c_write_req_ev) && (1 <= c_m_lock)) && (s_memory0 == 50)) && (c_empty_req == 1)) && (req_d == 50)) && (2 == c_write_rsp_ev)) && (m_run_pc == 3)) && (a_t == 0)) && (2 <= c_m_ev)) && (c_req_d == 50))) || ((((((((((((2 <= c_write_req_ev) && (c_req_a == 0)) && (1 <= c_m_lock)) && (c_req_type == 1)) && (s_run_st != 0)) && (s_run_pc == 0)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 3)) && (a_t == 0)) && (2 <= c_m_ev)) && (c_req_d == 50))) || (((((((((((((((((c_req_type == 0) && (2 <= c_write_req_ev)) && (c_req_a == 0)) && (1 <= c_m_lock)) && (c_rsp_d == 50)) && (req_tt_a == 0)) && (req_a == 0)) && (s_memory0 == 50)) && (2 == s_run_pc)) && (rsp_d == 50)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (m_run_pc == 6)) && (a_t == 0)) && (req_type == 0)) && (2 <= c_m_ev)) && (s_memory1 == 51))) - InvariantResult [Line: 881]: Location Invariant Derived location invariant: ((((((((((((((((((((((c_req_type == 0) && (2 <= c_write_req_ev)) && (1 <= c_m_lock)) && (1 <= a_t)) && (51 == c_rsp_d)) && (c_req_a == 1)) && (51 == rsp_d)) && (req_tt_a == 1)) && (req_a == 1)) && (s_memory0 == 50)) && (2 == s_run_pc)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (m_run_pc == 6)) && (req_type == 0)) && (2 <= c_m_ev)) && (s_memory1 == 51)) || (((((((((((51 == c_req_d) && (2 <= c_write_req_ev)) && (1 <= c_m_lock)) && (1 <= a_t)) && (51 == req_d)) && (s_memory0 == 50)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (m_run_pc == 3)) && (2 <= c_m_ev)) && (s_memory1 == 51))) || (((((((((((c_req_type == 0) && (2 <= c_write_req_ev)) && (c_req_a == 0)) && (s_run_st != 0)) && (c_m_lock != 1)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (a_t == 0)) && (2 <= c_m_ev)) && (m_run_pc == 0))) || ((((((((((2 <= c_write_req_ev) && (1 <= c_m_lock)) && (s_memory0 == 50)) && (c_empty_req == 1)) && (req_d == 50)) && (2 == c_write_rsp_ev)) && (m_run_pc == 3)) && (a_t == 0)) && (2 <= c_m_ev)) && (c_req_d == 50))) || ((((((((((((2 <= c_write_req_ev) && (c_req_a == 0)) && (1 <= c_m_lock)) && (c_req_type == 1)) && (s_run_st != 0)) && (s_run_pc == 0)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 3)) && (a_t == 0)) && (2 <= c_m_ev)) && (c_req_d == 50))) || (((((((((((((((((c_req_type == 0) && (2 <= c_write_req_ev)) && (c_req_a == 0)) && (1 <= c_m_lock)) && (c_rsp_d == 50)) && (req_tt_a == 0)) && (req_a == 0)) && (s_memory0 == 50)) && (2 == s_run_pc)) && (rsp_d == 50)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (m_run_pc == 6)) && (a_t == 0)) && (req_type == 0)) && (2 <= c_m_ev)) && (s_memory1 == 51))) - InvariantResult [Line: 1124]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((((((((c_req_type == 0) && (2 <= c_write_req_ev)) && (1 <= c_m_lock)) && (1 <= a_t)) && (51 == c_rsp_d)) && (c_req_a == 1)) && (s_run_st != 0)) && (req_tt_a == 1)) && (s_memory0 == 50)) && (2 == s_run_pc)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (m_run_pc == 6)) && (2 <= c_m_ev)) && (s_memory1 == 51)) || ((((((((c_req_a == 0) && (s_run_st != 0)) && (s_run_pc == 0)) && (c_m_lock != 1)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 0))) || (((((((((((2 <= c_write_req_ev) && (c_req_a == 0)) && (1 <= c_m_lock)) && (c_req_type == 1)) && (s_run_pc == 0)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 3)) && (a_t == 0)) && (2 <= c_m_ev)) && (c_req_d == 50))) || (((((((((((((c_req_type == 0) && (2 <= c_write_req_ev)) && (c_req_a == 0)) && (1 <= c_m_lock)) && (req_tt_a == 0)) && (s_memory0 == 50)) && (2 == s_run_pc)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 6)) && (a_t == 0)) && (2 <= c_m_ev)) && (s_memory1 == 51))) || (((((((((2 <= c_write_req_ev) && (1 <= c_m_lock)) && (s_run_st != 0)) && (2 == s_run_pc)) && (0 <= a_t)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 6)) && (2 <= c_m_ev))) || (((((((((2 <= c_write_req_ev) && (1 <= a_t)) && (s_run_st != 0)) && (2 == s_run_pc)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 6)) && (2 <= c_m_ev))) || ((((((((((((51 == c_req_d) && (2 <= c_write_req_ev)) && (1 <= c_m_lock)) && (1 <= a_t)) && (s_run_st != 0)) && (s_memory0 == 50)) && (2 == s_run_pc)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (m_run_pc == 3)) && (2 <= c_m_ev)) && (s_memory1 == 51))) || (((((((((((c_req_type == 0) && (2 <= c_write_req_ev)) && (c_req_a == 0)) && (s_run_pc == 0)) && (c_m_lock != 1)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (a_t == 0)) && (2 <= c_m_ev)) && (m_run_pc == 0))) || ((((((((((((51 == c_req_d) && (2 <= c_write_req_ev)) && (1 <= c_m_lock)) && (c_req_type == 1)) && (1 <= a_t)) && (c_req_a == 1)) && (s_memory0 == 50)) && (2 == s_run_pc)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 3)) && (2 <= c_m_ev))) || (((((((((((((((c_req_type == 0) && (2 <= c_write_req_ev)) && (c_req_a == 0)) && (1 <= c_m_lock)) && (c_rsp_d == 50)) && (s_run_st != 0)) && (req_tt_a == 0)) && (s_memory0 == 50)) && (2 == s_run_pc)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (m_run_pc == 6)) && (a_t == 0)) && (2 <= c_m_ev)) && (s_memory1 == 51))) || (((((2 == s_run_pc) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 3))) || (((((((((((((c_req_type == 0) && (2 <= c_write_req_ev)) && (1 <= c_m_lock)) && (1 <= a_t)) && (c_req_a == 1)) && (req_tt_a == 1)) && (s_memory0 == 50)) && (2 == s_run_pc)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 6)) && (2 <= c_m_ev)) && (s_memory1 == 51))) || ((((((2 <= c_write_req_ev) && (s_run_st != 0)) && (2 == s_run_pc)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 3))) || (((((((c_req_a == 0) && (s_run_st != 0)) && (s_run_pc == 0)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 3)) && (c_req_type != 0))) || (((((((((((2 <= c_write_req_ev) && (1 <= c_m_lock)) && (s_run_st != 0)) && (s_memory0 == 50)) && (2 == s_run_pc)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (m_run_pc == 3)) && (a_t == 0)) && (2 <= c_m_ev)) && (c_req_d == 50))) || ((((((((((((c_req_type == 0) && (2 <= c_write_req_ev)) && (c_req_a == 0)) && (s_run_st != 0)) && (c_m_lock != 1)) && (2 == s_run_pc)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (a_t == 0)) && (2 <= c_m_ev)) && (m_run_pc == 0))) || (((((((((((2 <= c_write_req_ev) && (c_req_a == 0)) && (1 <= c_m_lock)) && (c_req_type == 1)) && (2 == s_run_pc)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 3)) && (a_t == 0)) && (2 <= c_m_ev)) && (c_req_d == 50))) - InvariantResult [Line: 150]: Loop Invariant Derived loop invariant: (((((((((((((((((((c_req_type == 0) && (2 <= c_write_req_ev)) && (c_req_a == 0)) && (req_a == 0)) && (s_run_st != 0)) && (c_m_lock != 1)) && (req_d == 50)) && (2 == s_run_pc)) && (req_type == 1)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (a_t == 0)) && (a == 0)) && (2 <= c_m_ev)) && (m_run_pc == 0)) || (((((((((((((((c_req_type == 0) && (2 <= c_write_req_ev)) && (c_req_a == 0)) && (req_a == 0)) && (s_run_pc == 0)) && (c_m_lock != 1)) && (req_d == 50)) && (req_type == 1)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (a_t == 0)) && (a == 0)) && (2 <= c_m_ev)) && (m_run_pc == 0))) || ((((((((((req_a == 0) && (req_type != 0)) && (s_run_st != 0)) && (s_run_pc == 0)) && (c_m_lock != 1)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (a == 0)) && (m_run_pc == 0))) || ((((((((((((((((2 <= c_write_req_ev) && (s_run_st != 0)) && (51 == req_d)) && (c_m_lock != 1)) && (s_memory0 == 50)) && (a == 1)) && (2 == s_run_pc)) && (req_type == 1)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 3)) && (a_t == 0)) && (2 <= c_m_ev)) && (c_req_d == 50)) && (req_a == 1))) - InvariantResult [Line: 643]: Loop Invariant Derived loop invariant: ((((((((((((((((((((c_req_type == 0) && (2 <= c_write_req_ev)) && (1 <= c_m_lock)) && (c_req_a == 1)) && (s_memory0 == 50)) && (a == 1)) && (2 == s_run_pc)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 6)) && (a_t == 0)) && (2 <= c_m_ev)) && (s_memory1 == 51)) && (req_a___0 == 1)) || (((((((((((((c_req_type == 0) && (2 <= c_write_req_ev)) && (c_req_a == 0)) && (1 <= c_m_lock)) && (req_a___0 == 0)) && (s_memory0 == 50)) && (2 == s_run_pc)) && (0 <= a_t)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (a == 0)) && (2 <= c_m_ev)) && (s_memory1 == 51))) || (((((((((((((((c_req_type == 0) && (2 <= c_write_req_ev)) && (1 <= c_m_lock)) && (c_req_a == 1)) && (req_tt_a == 1)) && (s_memory0 == 50)) && (2 == s_run_pc)) && (0 <= a_t)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 6)) && (1 <= a)) && (2 <= c_m_ev)) && (s_memory1 == 51)) && (req_a___0 == 1))) || (((((((((((((((((c_req_type == 0) && (2 <= c_write_req_ev)) && (1 <= c_m_lock)) && (1 <= a_t)) && (51 == c_rsp_d)) && (c_req_a == 1)) && (s_run_st != 0)) && (req_tt_a == 1)) && (s_memory0 == 50)) && (2 == s_run_pc)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (m_run_pc == 6)) && (1 <= a)) && (2 <= c_m_ev)) && (s_memory1 == 51)) && (req_a___0 == 1))) || (((((((((((((((((c_req_type == 0) && (2 <= c_write_req_ev)) && (c_req_a == 0)) && (1 <= c_m_lock)) && (c_rsp_d == 50)) && (s_run_st != 0)) && (req_a___0 == 0)) && (req_tt_a == 0)) && (s_memory0 == 50)) && (2 == s_run_pc)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (m_run_pc == 6)) && (a_t == 0)) && (a == 0)) && (2 <= c_m_ev)) && (s_memory1 == 51))) || ((((((((((2 <= c_write_req_ev) && (1 <= a_t)) && (s_run_st != 0)) && (2 == s_run_pc)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 6)) && (1 <= a)) && (2 <= c_m_ev))) || (((((((((2 <= c_write_req_ev) && (0 <= a)) && (1 <= c_m_lock)) && (s_run_st != 0)) && (2 == s_run_pc)) && (0 <= a_t)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (2 <= c_m_ev))) - InvariantResult [Line: 1006]: Loop Invariant Derived loop invariant: (((((((((((((((((((((c_req_type == 0) && (2 <= c_write_req_ev)) && (c_req_a == 0)) && (1 <= c_m_lock)) && (req_tt_a == 0)) && (req_a == 0)) && (s_memory0 == 50)) && (2 == s_run_pc)) && (rsp_d == 50)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 6)) && (a_t == 0)) && (req_type == 0)) && (2 <= c_m_ev)) && (s_memory1 == 51)) || (((((((((((((((2 <= c_write_req_ev) && (1 <= c_m_lock)) && (c_req_type == 1)) && (req_type == 1)) && (s_run_st != 0)) && (s_run_pc == 0)) && (s_memory0 == 50)) && (c_empty_req == 1)) && (req_d == 50)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 3)) && (a_t == 0)) && (2 <= c_m_ev)) && (c_req_d == 50))) || ((((((((((((2 <= c_write_req_ev) && (1 <= c_m_lock)) && (s_memory0 == 50)) && (2 == s_run_pc)) && (c_empty_req == 1)) && (req_d == 50)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 3)) && (a_t == 0)) && (2 <= c_m_ev)) && (c_req_d == 50))) || (((((((((((((51 == c_req_d) && (2 <= c_write_req_ev)) && (1 <= c_m_lock)) && (1 <= a_t)) && (51 == req_d)) && (s_memory0 == 50)) && (2 == s_run_pc)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 3)) && (2 <= c_m_ev)) && (s_memory1 == 51))) || (((((((((((((((((c_req_type == 0) && (2 <= c_write_req_ev)) && (1 <= c_m_lock)) && (1 <= a_t)) && (c_req_a == 1)) && (51 == rsp_d)) && (req_tt_a == 1)) && (req_a == 1)) && (s_memory0 == 50)) && (2 == s_run_pc)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 6)) && (req_type == 0)) && (2 <= c_m_ev)) && (s_memory1 == 51))) - InvariantResult [Line: 500]: Loop Invariant Derived loop invariant: (((((((((((((((((51 == c_req_d) && (req_type___0 == 0)) && (2 <= c_write_req_ev)) && (1 <= a_t)) && (s_run_st != 0)) && (req_a___0 == 0)) && (c_m_lock != 1)) && (s_memory0 == 50)) && (2 == s_run_pc)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 3)) && (a == 0)) && (2 <= c_m_ev)) && (s_memory1 == 51)) || (((((((((((((((((((req_type___0 == 0) && (c_req_type == 0)) && (2 <= c_write_req_ev)) && (c_req_a == 0)) && (c_rsp_d == 50)) && (s_run_st != 0)) && (req_tt_a == 0)) && (c_m_lock != 1)) && (s_memory0 == 50)) && (a == 1)) && (2 == s_run_pc)) && (c_empty_req == 1)) && (2 == c_write_rsp_ev)) && (c_empty_rsp == 1)) && (m_run_pc == 6)) && (a_t == 0)) && (2 <= c_m_ev)) && (s_memory1 == 51)) && (req_a___0 == 1))) - ProcedureContractResult [Line: 16]: Procedure Contract for error Derived contract for procedure error. Requires: 0 Ensures: (0 && ((((((((((((((((((((((((((((((((((((((((((m_run_st == \old(m_run_st)) && (m_run_i == \old(m_run_i))) && (m_run_pc == \old(m_run_pc))) && (s_memory0 == \old(s_memory0))) && (s_memory1 == \old(s_memory1))) && (s_run_st == \old(s_run_st))) && (s_run_i == \old(s_run_i))) && (s_run_pc == \old(s_run_pc))) && (c_m_lock == \old(c_m_lock))) && (c_m_ev == \old(c_m_ev))) && (c_req_type == \old(c_req_type))) && (c_req_a == \old(c_req_a))) && (c_req_d == \old(c_req_d))) && (c_rsp_type == \old(c_rsp_type))) && (c_rsp_status == \old(c_rsp_status))) && (c_rsp_d == \old(c_rsp_d))) && (c_empty_req == \old(c_empty_req))) && (c_empty_rsp == \old(c_empty_rsp))) && (c_read_req_ev == \old(c_read_req_ev))) && (c_write_req_ev == \old(c_write_req_ev))) && (c_read_rsp_ev == \old(c_read_rsp_ev))) && (c_write_rsp_ev == \old(c_write_rsp_ev))) && (d_t == \old(d_t))) && (a_t == \old(a_t))) && (req_t_type == \old(req_t_type))) && (req_t_a == \old(req_t_a))) && (req_t_d == \old(req_t_d))) && (rsp_t_type == \old(rsp_t_type))) && (rsp_t_status == \old(rsp_t_status))) && (rsp_t_d == \old(rsp_t_d))) && (req_tt_type == \old(req_tt_type))) && (req_tt_a == \old(req_tt_a))) && (req_tt_d == \old(req_tt_d))) && (rsp_tt_type == \old(rsp_tt_type))) && (rsp_tt_status == \old(rsp_tt_status))) && (rsp_tt_d == \old(rsp_tt_d))) && (req_t_type___0 == \old(req_t_type___0))) && (req_t_a___0 == \old(req_t_a___0))) && (req_t_d___0 == \old(req_t_d___0))) && (rsp_t_type___0 == \old(rsp_t_type___0))) && (rsp_t_status___0 == \old(rsp_t_status___0))) && (rsp_t_d___0 == \old(rsp_t_d___0)))) RESULT: Ultimate proved your program to be correct! [2024-11-18 14:34:22,450 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE