./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/loop-invgen/heapsort.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8be7027f 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/loop-invgen/heapsort.i -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 8e7c8e5dc2a9e8f11b25d1bb9948f05f37b9553e3dc9f8bd8213088dea43cb37 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dk.perfect-tracechecks-8be7027-m [2024-11-11 19:45:47,615 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-11 19:45:47,674 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-11 19:45:47,680 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-11 19:45:47,680 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-11 19:45:47,710 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-11 19:45:47,711 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-11 19:45:47,711 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-11 19:45:47,712 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-11 19:45:47,713 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-11 19:45:47,713 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-11 19:45:47,714 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-11 19:45:47,714 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-11 19:45:47,715 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-11 19:45:47,717 INFO L153 SettingsManager]: * Use SBE=true [2024-11-11 19:45:47,717 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-11 19:45:47,717 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-11 19:45:47,718 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-11 19:45:47,718 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-11 19:45:47,718 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-11 19:45:47,722 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-11 19:45:47,723 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-11 19:45:47,723 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-11 19:45:47,723 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-11 19:45:47,723 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-11 19:45:47,724 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-11 19:45:47,724 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-11 19:45:47,724 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-11 19:45:47,724 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-11 19:45:47,724 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-11 19:45:47,725 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-11 19:45:47,725 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-11 19:45:47,725 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-11 19:45:47,725 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-11 19:45:47,726 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-11 19:45:47,726 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-11 19:45:47,726 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-11 19:45:47,728 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-11 19:45:47,728 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-11 19:45:47,728 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-11 19:45:47,728 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-11 19:45:47,729 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-11 19:45:47,729 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 -> 8e7c8e5dc2a9e8f11b25d1bb9948f05f37b9553e3dc9f8bd8213088dea43cb37 [2024-11-11 19:45:47,959 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-11 19:45:47,983 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-11 19:45:47,986 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-11 19:45:47,987 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-11 19:45:47,987 INFO L274 PluginConnector]: CDTParser initialized [2024-11-11 19:45:47,988 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/loop-invgen/heapsort.i [2024-11-11 19:45:49,406 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-11 19:45:49,588 INFO L384 CDTParser]: Found 1 translation units. [2024-11-11 19:45:49,589 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-invgen/heapsort.i [2024-11-11 19:45:49,596 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/06d7f705f/704bec1f63b14f97a4de736cf0f13af9/FLAG4bc96b7dc [2024-11-11 19:45:49,610 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/06d7f705f/704bec1f63b14f97a4de736cf0f13af9 [2024-11-11 19:45:49,613 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-11 19:45:49,615 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-11 19:45:49,620 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-11 19:45:49,620 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-11 19:45:49,625 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-11 19:45:49,626 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.11 07:45:49" (1/1) ... [2024-11-11 19:45:49,628 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@765467f0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 07:45:49, skipping insertion in model container [2024-11-11 19:45:49,629 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.11 07:45:49" (1/1) ... [2024-11-11 19:45:49,652 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-11 19:45:49,831 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/loop-invgen/heapsort.i[893,906] [2024-11-11 19:45:49,846 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-11 19:45:49,856 INFO L200 MainTranslator]: Completed pre-run [2024-11-11 19:45:49,866 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/loop-invgen/heapsort.i[893,906] [2024-11-11 19:45:49,873 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-11 19:45:49,892 INFO L204 MainTranslator]: Completed translation [2024-11-11 19:45:49,893 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 07:45:49 WrapperNode [2024-11-11 19:45:49,893 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-11 19:45:49,894 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-11 19:45:49,894 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-11 19:45:49,894 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-11 19:45:49,902 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 07:45:49" (1/1) ... [2024-11-11 19:45:49,914 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 07:45:49" (1/1) ... [2024-11-11 19:45:49,940 INFO L138 Inliner]: procedures = 16, calls = 20, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 78 [2024-11-11 19:45:49,941 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-11 19:45:49,941 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-11 19:45:49,941 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-11 19:45:49,942 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-11 19:45:49,949 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 07:45:49" (1/1) ... [2024-11-11 19:45:49,949 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 07:45:49" (1/1) ... [2024-11-11 19:45:49,950 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 07:45:49" (1/1) ... [2024-11-11 19:45:49,961 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-11 19:45:49,962 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 07:45:49" (1/1) ... [2024-11-11 19:45:49,962 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 07:45:49" (1/1) ... [2024-11-11 19:45:49,964 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 07:45:49" (1/1) ... [2024-11-11 19:45:49,967 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 07:45:49" (1/1) ... [2024-11-11 19:45:49,968 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 07:45:49" (1/1) ... [2024-11-11 19:45:49,969 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 07:45:49" (1/1) ... [2024-11-11 19:45:49,971 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-11 19:45:49,973 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-11 19:45:49,973 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-11 19:45:49,973 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-11 19:45:49,974 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 07:45:49" (1/1) ... [2024-11-11 19:45:49,979 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-11 19:45:49,988 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 19:45:50,009 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-11 19:45:50,012 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-11 19:45:50,059 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-11 19:45:50,059 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-11 19:45:50,059 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-11 19:45:50,059 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-11 19:45:50,060 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-11-11 19:45:50,060 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-11-11 19:45:50,122 INFO L238 CfgBuilder]: Building ICFG [2024-11-11 19:45:50,127 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-11 19:45:50,327 INFO L? ?]: Removed 14 outVars from TransFormulas that were not future-live. [2024-11-11 19:45:50,328 INFO L287 CfgBuilder]: Performing block encoding [2024-11-11 19:45:50,340 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-11 19:45:50,340 INFO L316 CfgBuilder]: Removed 2 assume(true) statements. [2024-11-11 19:45:50,340 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.11 07:45:50 BoogieIcfgContainer [2024-11-11 19:45:50,340 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-11 19:45:50,342 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-11 19:45:50,342 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-11 19:45:50,345 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-11 19:45:50,346 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.11 07:45:49" (1/3) ... [2024-11-11 19:45:50,347 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@42494fdd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.11 07:45:50, skipping insertion in model container [2024-11-11 19:45:50,347 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 07:45:49" (2/3) ... [2024-11-11 19:45:50,348 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@42494fdd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.11 07:45:50, skipping insertion in model container [2024-11-11 19:45:50,348 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.11 07:45:50" (3/3) ... [2024-11-11 19:45:50,349 INFO L112 eAbstractionObserver]: Analyzing ICFG heapsort.i [2024-11-11 19:45:50,366 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-11 19:45:50,367 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-11 19:45:50,420 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-11 19:45:50,428 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;@89e7253, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-11 19:45:50,428 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-11 19:45:50,432 INFO L276 IsEmpty]: Start isEmpty. Operand has 39 states, 22 states have (on average 1.5454545454545454) internal successors, (34), 23 states have internal predecessors, (34), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-11-11 19:45:50,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-11 19:45:50,438 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 19:45:50,439 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 19:45:50,439 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 19:45:50,444 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 19:45:50,444 INFO L85 PathProgramCache]: Analyzing trace with hash -1754201352, now seen corresponding path program 1 times [2024-11-11 19:45:50,452 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 19:45:50,452 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [528773269] [2024-11-11 19:45:50,453 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 19:45:50,453 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 19:45:50,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 19:45:50,769 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-11 19:45:50,769 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 19:45:50,770 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [528773269] [2024-11-11 19:45:50,770 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [528773269] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 19:45:50,770 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 19:45:50,771 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-11 19:45:50,772 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1929043408] [2024-11-11 19:45:50,773 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 19:45:50,775 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-11 19:45:50,776 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 19:45:50,791 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-11 19:45:50,791 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-11 19:45:50,793 INFO L87 Difference]: Start difference. First operand has 39 states, 22 states have (on average 1.5454545454545454) internal successors, (34), 23 states have internal predecessors, (34), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) Second operand has 5 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 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-11 19:45:50,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 19:45:50,924 INFO L93 Difference]: Finished difference Result 102 states and 192 transitions. [2024-11-11 19:45:50,925 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-11 19:45:50,927 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 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 11 [2024-11-11 19:45:50,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 19:45:50,936 INFO L225 Difference]: With dead ends: 102 [2024-11-11 19:45:50,936 INFO L226 Difference]: Without dead ends: 61 [2024-11-11 19:45:50,939 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-11 19:45:50,942 INFO L435 NwaCegarLoop]: 51 mSDtfsCounter, 20 mSDsluCounter, 134 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 185 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-11 19:45:50,943 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 185 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-11 19:45:50,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2024-11-11 19:45:50,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 39. [2024-11-11 19:45:50,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 22 states have (on average 1.3181818181818181) internal successors, (29), 22 states have internal predecessors, (29), 14 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-11-11 19:45:50,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 57 transitions. [2024-11-11 19:45:50,981 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 57 transitions. Word has length 11 [2024-11-11 19:45:50,981 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 19:45:50,981 INFO L471 AbstractCegarLoop]: Abstraction has 39 states and 57 transitions. [2024-11-11 19:45:50,984 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 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-11 19:45:50,984 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 57 transitions. [2024-11-11 19:45:50,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-11 19:45:50,985 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 19:45:50,985 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 19:45:50,985 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-11 19:45:50,985 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 19:45:50,986 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 19:45:50,987 INFO L85 PathProgramCache]: Analyzing trace with hash -1749464583, now seen corresponding path program 1 times [2024-11-11 19:45:50,987 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 19:45:50,987 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1767036467] [2024-11-11 19:45:50,987 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 19:45:50,988 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 19:45:51,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 19:45:51,147 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-11 19:45:51,147 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 19:45:51,147 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1767036467] [2024-11-11 19:45:51,148 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1767036467] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 19:45:51,148 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 19:45:51,148 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-11 19:45:51,148 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1217618002] [2024-11-11 19:45:51,148 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 19:45:51,149 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-11 19:45:51,149 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 19:45:51,150 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-11 19:45:51,151 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-11 19:45:51,151 INFO L87 Difference]: Start difference. First operand 39 states and 57 transitions. Second operand has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 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-11 19:45:51,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 19:45:51,231 INFO L93 Difference]: Finished difference Result 46 states and 63 transitions. [2024-11-11 19:45:51,232 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-11 19:45:51,232 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 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 11 [2024-11-11 19:45:51,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 19:45:51,234 INFO L225 Difference]: With dead ends: 46 [2024-11-11 19:45:51,234 INFO L226 Difference]: Without dead ends: 44 [2024-11-11 19:45:51,235 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-11 19:45:51,237 INFO L435 NwaCegarLoop]: 47 mSDtfsCounter, 16 mSDsluCounter, 96 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 143 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-11 19:45:51,237 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 143 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-11 19:45:51,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2024-11-11 19:45:51,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 43. [2024-11-11 19:45:51,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 25 states have (on average 1.28) internal successors, (32), 25 states have internal predecessors, (32), 14 states have call successors, (14), 3 states have call predecessors, (14), 3 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-11-11 19:45:51,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 60 transitions. [2024-11-11 19:45:51,252 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 60 transitions. Word has length 11 [2024-11-11 19:45:51,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 19:45:51,252 INFO L471 AbstractCegarLoop]: Abstraction has 43 states and 60 transitions. [2024-11-11 19:45:51,253 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 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-11 19:45:51,253 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 60 transitions. [2024-11-11 19:45:51,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-11 19:45:51,253 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 19:45:51,253 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 19:45:51,253 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-11 19:45:51,254 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 19:45:51,254 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 19:45:51,254 INFO L85 PathProgramCache]: Analyzing trace with hash -1728015063, now seen corresponding path program 1 times [2024-11-11 19:45:51,254 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 19:45:51,254 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1853462332] [2024-11-11 19:45:51,255 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 19:45:51,255 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 19:45:51,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 19:45:51,370 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-11 19:45:51,371 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 19:45:51,371 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1853462332] [2024-11-11 19:45:51,371 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1853462332] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 19:45:51,371 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 19:45:51,371 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-11 19:45:51,372 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1204184173] [2024-11-11 19:45:51,372 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 19:45:51,372 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-11 19:45:51,372 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 19:45:51,373 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-11 19:45:51,373 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-11 19:45:51,373 INFO L87 Difference]: Start difference. First operand 43 states and 60 transitions. Second operand has 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 5 states have internal predecessors, (10), 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-11 19:45:51,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 19:45:51,576 INFO L93 Difference]: Finished difference Result 80 states and 118 transitions. [2024-11-11 19:45:51,577 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-11 19:45:51,577 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 5 states have internal predecessors, (10), 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 11 [2024-11-11 19:45:51,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 19:45:51,579 INFO L225 Difference]: With dead ends: 80 [2024-11-11 19:45:51,579 INFO L226 Difference]: Without dead ends: 78 [2024-11-11 19:45:51,579 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-11-11 19:45:51,582 INFO L435 NwaCegarLoop]: 44 mSDtfsCounter, 29 mSDsluCounter, 158 mSDsCounter, 0 mSdLazyCounter, 113 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 202 SdHoareTripleChecker+Invalid, 145 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 113 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-11 19:45:51,583 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 202 Invalid, 145 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 113 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-11 19:45:51,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2024-11-11 19:45:51,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 69. [2024-11-11 19:45:51,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 38 states have (on average 1.3157894736842106) internal successors, (50), 38 states have internal predecessors, (50), 26 states have call successors, (26), 4 states have call predecessors, (26), 4 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2024-11-11 19:45:51,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 102 transitions. [2024-11-11 19:45:51,604 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 102 transitions. Word has length 11 [2024-11-11 19:45:51,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 19:45:51,606 INFO L471 AbstractCegarLoop]: Abstraction has 69 states and 102 transitions. [2024-11-11 19:45:51,606 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 5 states have internal predecessors, (10), 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-11 19:45:51,606 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 102 transitions. [2024-11-11 19:45:51,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-11-11 19:45:51,608 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 19:45:51,608 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 19:45:51,608 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-11 19:45:51,608 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 19:45:51,609 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 19:45:51,609 INFO L85 PathProgramCache]: Analyzing trace with hash -1885075524, now seen corresponding path program 1 times [2024-11-11 19:45:51,609 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 19:45:51,610 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1472299288] [2024-11-11 19:45:51,610 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 19:45:51,610 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 19:45:51,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 19:45:51,794 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-11-11 19:45:51,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 19:45:51,800 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 19:45:51,800 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 19:45:51,801 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1472299288] [2024-11-11 19:45:51,801 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1472299288] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 19:45:51,801 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 19:45:51,801 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-11 19:45:51,801 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1061700153] [2024-11-11 19:45:51,801 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 19:45:51,802 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-11 19:45:51,802 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 19:45:51,803 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-11 19:45:51,803 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-11 19:45:51,803 INFO L87 Difference]: Start difference. First operand 69 states and 102 transitions. Second operand has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 6 states have internal predecessors, (13), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-11 19:45:52,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 19:45:52,021 INFO L93 Difference]: Finished difference Result 102 states and 153 transitions. [2024-11-11 19:45:52,022 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-11 19:45:52,022 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 6 states have internal predecessors, (13), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2024-11-11 19:45:52,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 19:45:52,024 INFO L225 Difference]: With dead ends: 102 [2024-11-11 19:45:52,024 INFO L226 Difference]: Without dead ends: 100 [2024-11-11 19:45:52,024 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-11-11 19:45:52,028 INFO L435 NwaCegarLoop]: 55 mSDtfsCounter, 43 mSDsluCounter, 176 mSDsCounter, 0 mSdLazyCounter, 128 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 231 SdHoareTripleChecker+Invalid, 160 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 128 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-11 19:45:52,029 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 231 Invalid, 160 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 128 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-11 19:45:52,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2024-11-11 19:45:52,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 97. [2024-11-11 19:45:52,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 51 states have (on average 1.3333333333333333) internal successors, (68), 52 states have internal predecessors, (68), 40 states have call successors, (40), 5 states have call predecessors, (40), 5 states have return successors, (40), 39 states have call predecessors, (40), 40 states have call successors, (40) [2024-11-11 19:45:52,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 148 transitions. [2024-11-11 19:45:52,061 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 148 transitions. Word has length 16 [2024-11-11 19:45:52,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 19:45:52,062 INFO L471 AbstractCegarLoop]: Abstraction has 97 states and 148 transitions. [2024-11-11 19:45:52,062 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 6 states have internal predecessors, (13), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-11 19:45:52,062 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 148 transitions. [2024-11-11 19:45:52,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-11-11 19:45:52,066 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 19:45:52,066 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 19:45:52,067 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-11 19:45:52,067 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 19:45:52,067 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 19:45:52,067 INFO L85 PathProgramCache]: Analyzing trace with hash -1503713061, now seen corresponding path program 1 times [2024-11-11 19:45:52,067 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 19:45:52,068 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [223193913] [2024-11-11 19:45:52,068 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 19:45:52,068 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 19:45:52,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 19:45:52,132 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-11-11 19:45:52,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 19:45:52,139 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 19:45:52,139 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 19:45:52,139 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [223193913] [2024-11-11 19:45:52,139 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [223193913] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 19:45:52,139 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 19:45:52,139 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-11 19:45:52,140 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [765614561] [2024-11-11 19:45:52,140 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 19:45:52,142 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-11 19:45:52,142 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 19:45:52,142 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-11 19:45:52,142 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-11 19:45:52,142 INFO L87 Difference]: Start difference. First operand 97 states and 148 transitions. Second operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-11 19:45:52,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 19:45:52,219 INFO L93 Difference]: Finished difference Result 103 states and 153 transitions. [2024-11-11 19:45:52,219 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-11 19:45:52,220 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2024-11-11 19:45:52,220 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 19:45:52,223 INFO L225 Difference]: With dead ends: 103 [2024-11-11 19:45:52,223 INFO L226 Difference]: Without dead ends: 101 [2024-11-11 19:45:52,223 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-11 19:45:52,228 INFO L435 NwaCegarLoop]: 47 mSDtfsCounter, 15 mSDsluCounter, 96 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 143 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-11 19:45:52,228 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 143 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 19:45:52,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2024-11-11 19:45:52,258 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 101. [2024-11-11 19:45:52,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 54 states have (on average 1.3148148148148149) internal successors, (71), 55 states have internal predecessors, (71), 40 states have call successors, (40), 6 states have call predecessors, (40), 6 states have return successors, (40), 39 states have call predecessors, (40), 40 states have call successors, (40) [2024-11-11 19:45:52,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 151 transitions. [2024-11-11 19:45:52,262 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 151 transitions. Word has length 16 [2024-11-11 19:45:52,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 19:45:52,262 INFO L471 AbstractCegarLoop]: Abstraction has 101 states and 151 transitions. [2024-11-11 19:45:52,263 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-11 19:45:52,264 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 151 transitions. [2024-11-11 19:45:52,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-11-11 19:45:52,264 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 19:45:52,265 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 19:45:52,265 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-11 19:45:52,265 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 19:45:52,266 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 19:45:52,267 INFO L85 PathProgramCache]: Analyzing trace with hash -1518715221, now seen corresponding path program 1 times [2024-11-11 19:45:52,267 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 19:45:52,267 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1804414095] [2024-11-11 19:45:52,267 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 19:45:52,268 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 19:45:52,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 19:45:52,357 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-11-11 19:45:52,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 19:45:52,364 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 19:45:52,364 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 19:45:52,364 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1804414095] [2024-11-11 19:45:52,364 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1804414095] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 19:45:52,364 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 19:45:52,365 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-11 19:45:52,365 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1160290511] [2024-11-11 19:45:52,365 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 19:45:52,365 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-11 19:45:52,365 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 19:45:52,366 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-11 19:45:52,366 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-11 19:45:52,366 INFO L87 Difference]: Start difference. First operand 101 states and 151 transitions. Second operand has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 6 states have internal predecessors, (13), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-11 19:45:52,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 19:45:52,642 INFO L93 Difference]: Finished difference Result 155 states and 240 transitions. [2024-11-11 19:45:52,643 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-11 19:45:52,643 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 6 states have internal predecessors, (13), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2024-11-11 19:45:52,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 19:45:52,646 INFO L225 Difference]: With dead ends: 155 [2024-11-11 19:45:52,646 INFO L226 Difference]: Without dead ends: 153 [2024-11-11 19:45:52,647 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-11-11 19:45:52,650 INFO L435 NwaCegarLoop]: 61 mSDtfsCounter, 55 mSDsluCounter, 204 mSDsCounter, 0 mSdLazyCounter, 163 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 265 SdHoareTripleChecker+Invalid, 189 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 163 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-11 19:45:52,651 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [83 Valid, 265 Invalid, 189 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 163 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-11 19:45:52,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2024-11-11 19:45:52,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 137. [2024-11-11 19:45:52,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 137 states, 69 states have (on average 1.3623188405797102) internal successors, (94), 72 states have internal predecessors, (94), 60 states have call successors, (60), 7 states have call predecessors, (60), 7 states have return successors, (60), 57 states have call predecessors, (60), 60 states have call successors, (60) [2024-11-11 19:45:52,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 214 transitions. [2024-11-11 19:45:52,705 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 214 transitions. Word has length 16 [2024-11-11 19:45:52,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 19:45:52,706 INFO L471 AbstractCegarLoop]: Abstraction has 137 states and 214 transitions. [2024-11-11 19:45:52,706 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 6 states have internal predecessors, (13), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-11 19:45:52,706 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 214 transitions. [2024-11-11 19:45:52,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-11-11 19:45:52,707 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 19:45:52,707 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 19:45:52,707 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-11 19:45:52,707 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 19:45:52,707 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 19:45:52,708 INFO L85 PathProgramCache]: Analyzing trace with hash 1823085758, now seen corresponding path program 1 times [2024-11-11 19:45:52,708 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 19:45:52,708 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [483775495] [2024-11-11 19:45:52,708 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 19:45:52,708 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 19:45:52,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 19:45:52,729 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-11-11 19:45:52,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 19:45:52,732 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 19:45:52,732 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 19:45:52,733 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [483775495] [2024-11-11 19:45:52,733 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [483775495] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 19:45:52,733 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 19:45:52,733 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-11 19:45:52,733 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [787578067] [2024-11-11 19:45:52,733 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 19:45:52,734 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 19:45:52,734 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 19:45:52,734 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 19:45:52,735 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 19:45:52,735 INFO L87 Difference]: Start difference. First operand 137 states and 214 transitions. Second operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-11 19:45:52,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 19:45:52,793 INFO L93 Difference]: Finished difference Result 274 states and 436 transitions. [2024-11-11 19:45:52,793 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 19:45:52,794 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2024-11-11 19:45:52,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 19:45:52,796 INFO L225 Difference]: With dead ends: 274 [2024-11-11 19:45:52,796 INFO L226 Difference]: Without dead ends: 205 [2024-11-11 19:45:52,797 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 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-11 19:45:52,800 INFO L435 NwaCegarLoop]: 72 mSDtfsCounter, 11 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 120 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-11 19:45:52,800 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 120 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 19:45:52,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2024-11-11 19:45:52,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 205. [2024-11-11 19:45:52,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 205 states, 99 states have (on average 1.404040404040404) internal successors, (139), 103 states have internal predecessors, (139), 98 states have call successors, (98), 7 states have call predecessors, (98), 7 states have return successors, (98), 94 states have call predecessors, (98), 98 states have call successors, (98) [2024-11-11 19:45:52,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 335 transitions. [2024-11-11 19:45:52,855 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 335 transitions. Word has length 16 [2024-11-11 19:45:52,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 19:45:52,856 INFO L471 AbstractCegarLoop]: Abstraction has 205 states and 335 transitions. [2024-11-11 19:45:52,856 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-11 19:45:52,856 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 335 transitions. [2024-11-11 19:45:52,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-11-11 19:45:52,858 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 19:45:52,858 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 19:45:52,858 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-11 19:45:52,858 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 19:45:52,859 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 19:45:52,859 INFO L85 PathProgramCache]: Analyzing trace with hash -2105521235, now seen corresponding path program 1 times [2024-11-11 19:45:52,859 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 19:45:52,859 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [726039884] [2024-11-11 19:45:52,859 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 19:45:52,860 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 19:45:52,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 19:45:52,903 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-11-11 19:45:52,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 19:45:52,906 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 19:45:52,906 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 19:45:52,906 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [726039884] [2024-11-11 19:45:52,906 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [726039884] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 19:45:52,906 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 19:45:52,906 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-11 19:45:52,907 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1779677320] [2024-11-11 19:45:52,907 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 19:45:52,907 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-11 19:45:52,907 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 19:45:52,907 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-11 19:45:52,908 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-11 19:45:52,908 INFO L87 Difference]: Start difference. First operand 205 states and 335 transitions. Second operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-11 19:45:53,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 19:45:53,016 INFO L93 Difference]: Finished difference Result 229 states and 358 transitions. [2024-11-11 19:45:53,016 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-11 19:45:53,016 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2024-11-11 19:45:53,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 19:45:53,019 INFO L225 Difference]: With dead ends: 229 [2024-11-11 19:45:53,020 INFO L226 Difference]: Without dead ends: 183 [2024-11-11 19:45:53,021 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-11 19:45:53,021 INFO L435 NwaCegarLoop]: 54 mSDtfsCounter, 3 mSDsluCounter, 129 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 183 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-11 19:45:53,022 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 183 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 19:45:53,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2024-11-11 19:45:53,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 183. [2024-11-11 19:45:53,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 183 states, 89 states have (on average 1.3932584269662922) internal successors, (124), 93 states have internal predecessors, (124), 86 states have call successors, (86), 7 states have call predecessors, (86), 7 states have return successors, (86), 82 states have call predecessors, (86), 86 states have call successors, (86) [2024-11-11 19:45:53,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 296 transitions. [2024-11-11 19:45:53,088 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 296 transitions. Word has length 16 [2024-11-11 19:45:53,088 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 19:45:53,089 INFO L471 AbstractCegarLoop]: Abstraction has 183 states and 296 transitions. [2024-11-11 19:45:53,089 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-11 19:45:53,089 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 296 transitions. [2024-11-11 19:45:53,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-11-11 19:45:53,093 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 19:45:53,093 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 19:45:53,093 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-11 19:45:53,093 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 19:45:53,094 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 19:45:53,094 INFO L85 PathProgramCache]: Analyzing trace with hash 186914675, now seen corresponding path program 1 times [2024-11-11 19:45:53,094 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 19:45:53,094 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [850622417] [2024-11-11 19:45:53,094 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 19:45:53,095 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 19:45:53,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 19:45:53,165 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-11-11 19:45:53,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 19:45:53,169 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-11 19:45:53,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 19:45:53,173 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-11 19:45:53,173 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 19:45:53,173 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [850622417] [2024-11-11 19:45:53,174 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [850622417] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 19:45:53,174 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 19:45:53,174 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-11 19:45:53,174 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [283460599] [2024-11-11 19:45:53,174 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 19:45:53,174 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-11 19:45:53,175 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 19:45:53,175 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-11 19:45:53,175 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-11 19:45:53,175 INFO L87 Difference]: Start difference. First operand 183 states and 296 transitions. Second operand has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 states have internal predecessors, (15), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-11 19:45:53,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 19:45:53,323 INFO L93 Difference]: Finished difference Result 217 states and 348 transitions. [2024-11-11 19:45:53,324 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-11 19:45:53,324 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 states have internal predecessors, (15), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 23 [2024-11-11 19:45:53,324 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 19:45:53,326 INFO L225 Difference]: With dead ends: 217 [2024-11-11 19:45:53,326 INFO L226 Difference]: Without dead ends: 215 [2024-11-11 19:45:53,326 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-11-11 19:45:53,327 INFO L435 NwaCegarLoop]: 45 mSDtfsCounter, 41 mSDsluCounter, 186 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 231 SdHoareTripleChecker+Invalid, 90 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-11 19:45:53,327 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 231 Invalid, 90 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-11 19:45:53,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2024-11-11 19:45:53,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 197. [2024-11-11 19:45:53,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 197 states, 96 states have (on average 1.3854166666666667) internal successors, (133), 102 states have internal predecessors, (133), 92 states have call successors, (92), 8 states have call predecessors, (92), 8 states have return successors, (92), 86 states have call predecessors, (92), 92 states have call successors, (92) [2024-11-11 19:45:53,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 317 transitions. [2024-11-11 19:45:53,373 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 317 transitions. Word has length 23 [2024-11-11 19:45:53,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 19:45:53,373 INFO L471 AbstractCegarLoop]: Abstraction has 197 states and 317 transitions. [2024-11-11 19:45:53,373 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 states have internal predecessors, (15), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-11 19:45:53,374 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 317 transitions. [2024-11-11 19:45:53,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-11-11 19:45:53,375 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 19:45:53,375 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 19:45:53,375 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-11 19:45:53,375 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 19:45:53,376 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 19:45:53,376 INFO L85 PathProgramCache]: Analyzing trace with hash 768784003, now seen corresponding path program 1 times [2024-11-11 19:45:53,376 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 19:45:53,376 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1580419563] [2024-11-11 19:45:53,377 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 19:45:53,377 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 19:45:53,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 19:45:53,454 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-11-11 19:45:53,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 19:45:53,458 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-11 19:45:53,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 19:45:53,461 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-11 19:45:53,465 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 19:45:53,465 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1580419563] [2024-11-11 19:45:53,465 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1580419563] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 19:45:53,465 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 19:45:53,466 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-11 19:45:53,466 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1603388283] [2024-11-11 19:45:53,466 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 19:45:53,466 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-11 19:45:53,466 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 19:45:53,467 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-11 19:45:53,467 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-11 19:45:53,467 INFO L87 Difference]: Start difference. First operand 197 states and 317 transitions. Second operand has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-11 19:45:53,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 19:45:53,744 INFO L93 Difference]: Finished difference Result 520 states and 854 transitions. [2024-11-11 19:45:53,745 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-11 19:45:53,745 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 25 [2024-11-11 19:45:53,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 19:45:53,750 INFO L225 Difference]: With dead ends: 520 [2024-11-11 19:45:53,750 INFO L226 Difference]: Without dead ends: 366 [2024-11-11 19:45:53,751 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-11-11 19:45:53,752 INFO L435 NwaCegarLoop]: 41 mSDtfsCounter, 83 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 88 mSolverCounterSat, 80 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 113 SdHoareTripleChecker+Valid, 96 SdHoareTripleChecker+Invalid, 168 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 80 IncrementalHoareTripleChecker+Valid, 88 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-11 19:45:53,753 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [113 Valid, 96 Invalid, 168 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [80 Valid, 88 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-11 19:45:53,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 366 states. [2024-11-11 19:45:53,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 366 to 197. [2024-11-11 19:45:53,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 197 states, 96 states have (on average 1.3645833333333333) internal successors, (131), 102 states have internal predecessors, (131), 92 states have call successors, (92), 8 states have call predecessors, (92), 8 states have return successors, (92), 86 states have call predecessors, (92), 92 states have call successors, (92) [2024-11-11 19:45:53,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 315 transitions. [2024-11-11 19:45:53,802 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 315 transitions. Word has length 25 [2024-11-11 19:45:53,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 19:45:53,803 INFO L471 AbstractCegarLoop]: Abstraction has 197 states and 315 transitions. [2024-11-11 19:45:53,803 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-11 19:45:53,803 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 315 transitions. [2024-11-11 19:45:53,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-11-11 19:45:53,804 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 19:45:53,804 INFO L218 NwaCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 19:45:53,804 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-11 19:45:53,805 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 19:45:53,805 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 19:45:53,805 INFO L85 PathProgramCache]: Analyzing trace with hash -299150037, now seen corresponding path program 1 times [2024-11-11 19:45:53,805 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 19:45:53,805 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [108813823] [2024-11-11 19:45:53,806 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 19:45:53,806 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 19:45:53,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 19:45:53,870 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-11-11 19:45:53,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 19:45:53,874 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-11 19:45:53,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 19:45:53,878 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-11 19:45:53,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 19:45:53,881 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-11 19:45:53,881 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 19:45:53,881 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [108813823] [2024-11-11 19:45:53,881 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [108813823] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 19:45:53,882 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 19:45:53,882 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-11 19:45:53,882 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1119277864] [2024-11-11 19:45:53,882 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 19:45:53,882 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-11 19:45:53,883 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 19:45:53,883 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-11 19:45:53,883 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-11 19:45:53,883 INFO L87 Difference]: Start difference. First operand 197 states and 315 transitions. Second operand has 6 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-11 19:45:54,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 19:45:54,075 INFO L93 Difference]: Finished difference Result 291 states and 471 transitions. [2024-11-11 19:45:54,075 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-11 19:45:54,075 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 26 [2024-11-11 19:45:54,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 19:45:54,078 INFO L225 Difference]: With dead ends: 291 [2024-11-11 19:45:54,078 INFO L226 Difference]: Without dead ends: 289 [2024-11-11 19:45:54,079 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-11-11 19:45:54,079 INFO L435 NwaCegarLoop]: 67 mSDtfsCounter, 25 mSDsluCounter, 174 mSDsCounter, 0 mSdLazyCounter, 99 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 241 SdHoareTripleChecker+Invalid, 119 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 99 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-11 19:45:54,079 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 241 Invalid, 119 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 99 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-11 19:45:54,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 289 states. [2024-11-11 19:45:54,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 289 to 269. [2024-11-11 19:45:54,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 269 states, 118 states have (on average 1.3644067796610169) internal successors, (161), 132 states have internal predecessors, (161), 140 states have call successors, (140), 10 states have call predecessors, (140), 10 states have return successors, (140), 126 states have call predecessors, (140), 140 states have call successors, (140) [2024-11-11 19:45:54,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 269 states to 269 states and 441 transitions. [2024-11-11 19:45:54,153 INFO L78 Accepts]: Start accepts. Automaton has 269 states and 441 transitions. Word has length 26 [2024-11-11 19:45:54,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 19:45:54,154 INFO L471 AbstractCegarLoop]: Abstraction has 269 states and 441 transitions. [2024-11-11 19:45:54,154 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-11 19:45:54,156 INFO L276 IsEmpty]: Start isEmpty. Operand 269 states and 441 transitions. [2024-11-11 19:45:54,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-11-11 19:45:54,156 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 19:45:54,156 INFO L218 NwaCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 19:45:54,156 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-11 19:45:54,157 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 19:45:54,157 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 19:45:54,157 INFO L85 PathProgramCache]: Analyzing trace with hash 1714235681, now seen corresponding path program 1 times [2024-11-11 19:45:54,157 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 19:45:54,157 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1243658111] [2024-11-11 19:45:54,158 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 19:45:54,158 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 19:45:54,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 19:45:54,282 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-11-11 19:45:54,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 19:45:54,286 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-11 19:45:54,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 19:45:54,289 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-11-11 19:45:54,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 19:45:54,293 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-11 19:45:54,293 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 19:45:54,293 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1243658111] [2024-11-11 19:45:54,293 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1243658111] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 19:45:54,293 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 19:45:54,294 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-11 19:45:54,294 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [411311459] [2024-11-11 19:45:54,294 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 19:45:54,294 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-11 19:45:54,294 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 19:45:54,294 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-11 19:45:54,295 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-11 19:45:54,295 INFO L87 Difference]: Start difference. First operand 269 states and 441 transitions. Second operand has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 6 states have internal predecessors, (15), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-11 19:45:54,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 19:45:54,506 INFO L93 Difference]: Finished difference Result 317 states and 516 transitions. [2024-11-11 19:45:54,506 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-11 19:45:54,507 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 6 states have internal predecessors, (15), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 28 [2024-11-11 19:45:54,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 19:45:54,509 INFO L225 Difference]: With dead ends: 317 [2024-11-11 19:45:54,509 INFO L226 Difference]: Without dead ends: 315 [2024-11-11 19:45:54,510 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2024-11-11 19:45:54,510 INFO L435 NwaCegarLoop]: 47 mSDtfsCounter, 71 mSDsluCounter, 149 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 74 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 196 SdHoareTripleChecker+Invalid, 148 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 74 IncrementalHoareTripleChecker+Valid, 74 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-11 19:45:54,511 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 196 Invalid, 148 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [74 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-11 19:45:54,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 315 states. [2024-11-11 19:45:54,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 315 to 287. [2024-11-11 19:45:54,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 287 states, 125 states have (on average 1.36) internal successors, (170), 141 states have internal predecessors, (170), 150 states have call successors, (150), 11 states have call predecessors, (150), 11 states have return successors, (150), 134 states have call predecessors, (150), 150 states have call successors, (150) [2024-11-11 19:45:54,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 287 states to 287 states and 470 transitions. [2024-11-11 19:45:54,590 INFO L78 Accepts]: Start accepts. Automaton has 287 states and 470 transitions. Word has length 28 [2024-11-11 19:45:54,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 19:45:54,591 INFO L471 AbstractCegarLoop]: Abstraction has 287 states and 470 transitions. [2024-11-11 19:45:54,591 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 6 states have internal predecessors, (15), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-11 19:45:54,591 INFO L276 IsEmpty]: Start isEmpty. Operand 287 states and 470 transitions. [2024-11-11 19:45:54,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2024-11-11 19:45:54,592 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 19:45:54,592 INFO L218 NwaCegarLoop]: trace histogram [6, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 19:45:54,592 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-11 19:45:54,592 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 19:45:54,593 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 19:45:54,593 INFO L85 PathProgramCache]: Analyzing trace with hash 523331784, now seen corresponding path program 1 times [2024-11-11 19:45:54,593 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 19:45:54,593 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [931673527] [2024-11-11 19:45:54,593 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 19:45:54,593 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 19:45:54,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 19:45:54,667 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-11-11 19:45:54,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 19:45:54,671 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-11 19:45:54,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 19:45:54,674 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-11 19:45:54,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 19:45:54,677 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-11 19:45:54,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 19:45:54,680 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-11 19:45:54,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 19:45:54,686 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2024-11-11 19:45:54,687 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 19:45:54,687 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [931673527] [2024-11-11 19:45:54,688 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [931673527] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 19:45:54,688 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 19:45:54,689 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-11 19:45:54,689 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1761013299] [2024-11-11 19:45:54,689 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 19:45:54,689 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-11 19:45:54,689 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 19:45:54,690 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-11 19:45:54,690 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-11 19:45:54,691 INFO L87 Difference]: Start difference. First operand 287 states and 470 transitions. Second operand has 7 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-11 19:45:54,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 19:45:54,898 INFO L93 Difference]: Finished difference Result 329 states and 527 transitions. [2024-11-11 19:45:54,898 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-11 19:45:54,898 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 38 [2024-11-11 19:45:54,899 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 19:45:54,901 INFO L225 Difference]: With dead ends: 329 [2024-11-11 19:45:54,901 INFO L226 Difference]: Without dead ends: 327 [2024-11-11 19:45:54,902 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2024-11-11 19:45:54,903 INFO L435 NwaCegarLoop]: 64 mSDtfsCounter, 36 mSDsluCounter, 171 mSDsCounter, 0 mSdLazyCounter, 115 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 235 SdHoareTripleChecker+Invalid, 156 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 115 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-11 19:45:54,904 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 235 Invalid, 156 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 115 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-11 19:45:54,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 327 states. [2024-11-11 19:45:54,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 327 to 291. [2024-11-11 19:45:54,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 291 states, 128 states have (on average 1.3515625) internal successors, (173), 144 states have internal predecessors, (173), 150 states have call successors, (150), 12 states have call predecessors, (150), 12 states have return successors, (150), 134 states have call predecessors, (150), 150 states have call successors, (150) [2024-11-11 19:45:54,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 291 states to 291 states and 473 transitions. [2024-11-11 19:45:54,992 INFO L78 Accepts]: Start accepts. Automaton has 291 states and 473 transitions. Word has length 38 [2024-11-11 19:45:54,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 19:45:54,993 INFO L471 AbstractCegarLoop]: Abstraction has 291 states and 473 transitions. [2024-11-11 19:45:54,994 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-11 19:45:54,994 INFO L276 IsEmpty]: Start isEmpty. Operand 291 states and 473 transitions. [2024-11-11 19:45:54,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2024-11-11 19:45:54,995 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 19:45:54,995 INFO L218 NwaCegarLoop]: trace histogram [5, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 19:45:54,995 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-11 19:45:54,995 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 19:45:54,996 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 19:45:54,996 INFO L85 PathProgramCache]: Analyzing trace with hash 1856149802, now seen corresponding path program 1 times [2024-11-11 19:45:54,996 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 19:45:54,996 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [946688473] [2024-11-11 19:45:54,996 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 19:45:54,996 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 19:45:55,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 19:45:55,071 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-11-11 19:45:55,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 19:45:55,074 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-11 19:45:55,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 19:45:55,075 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-11 19:45:55,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 19:45:55,078 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-11 19:45:55,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 19:45:55,081 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-11-11 19:45:55,081 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 19:45:55,081 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [946688473] [2024-11-11 19:45:55,081 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [946688473] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 19:45:55,081 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 19:45:55,081 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-11 19:45:55,081 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1531790652] [2024-11-11 19:45:55,081 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 19:45:55,082 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-11 19:45:55,082 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 19:45:55,082 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-11 19:45:55,082 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-11 19:45:55,083 INFO L87 Difference]: Start difference. First operand 291 states and 473 transitions. Second operand has 7 states, 7 states have (on average 2.857142857142857) internal successors, (20), 6 states have internal predecessors, (20), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-11 19:45:55,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 19:45:55,249 INFO L93 Difference]: Finished difference Result 313 states and 502 transitions. [2024-11-11 19:45:55,249 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-11 19:45:55,250 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.857142857142857) internal successors, (20), 6 states have internal predecessors, (20), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 38 [2024-11-11 19:45:55,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 19:45:55,252 INFO L225 Difference]: With dead ends: 313 [2024-11-11 19:45:55,252 INFO L226 Difference]: Without dead ends: 311 [2024-11-11 19:45:55,253 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2024-11-11 19:45:55,253 INFO L435 NwaCegarLoop]: 35 mSDtfsCounter, 29 mSDsluCounter, 103 mSDsCounter, 0 mSdLazyCounter, 102 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 138 SdHoareTripleChecker+Invalid, 137 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 102 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-11 19:45:55,254 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 138 Invalid, 137 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 102 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-11 19:45:55,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 311 states. [2024-11-11 19:45:55,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 311 to 295. [2024-11-11 19:45:55,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 295 states, 131 states have (on average 1.3435114503816794) internal successors, (176), 147 states have internal predecessors, (176), 150 states have call successors, (150), 13 states have call predecessors, (150), 13 states have return successors, (150), 134 states have call predecessors, (150), 150 states have call successors, (150) [2024-11-11 19:45:55,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 295 states to 295 states and 476 transitions. [2024-11-11 19:45:55,319 INFO L78 Accepts]: Start accepts. Automaton has 295 states and 476 transitions. Word has length 38 [2024-11-11 19:45:55,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 19:45:55,319 INFO L471 AbstractCegarLoop]: Abstraction has 295 states and 476 transitions. [2024-11-11 19:45:55,319 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.857142857142857) internal successors, (20), 6 states have internal predecessors, (20), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-11 19:45:55,320 INFO L276 IsEmpty]: Start isEmpty. Operand 295 states and 476 transitions. [2024-11-11 19:45:55,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2024-11-11 19:45:55,320 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 19:45:55,321 INFO L218 NwaCegarLoop]: trace histogram [7, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 19:45:55,321 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-11 19:45:55,321 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 19:45:55,321 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 19:45:55,321 INFO L85 PathProgramCache]: Analyzing trace with hash 2019762676, now seen corresponding path program 1 times [2024-11-11 19:45:55,322 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 19:45:55,322 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1317476612] [2024-11-11 19:45:55,322 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 19:45:55,322 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 19:45:55,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 19:45:55,397 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-11-11 19:45:55,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 19:45:55,401 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-11 19:45:55,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 19:45:55,404 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-11 19:45:55,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 19:45:55,408 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-11 19:45:55,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 19:45:55,411 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-11 19:45:55,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 19:45:55,413 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-11 19:45:55,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 19:45:55,417 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2024-11-11 19:45:55,420 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 19:45:55,421 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1317476612] [2024-11-11 19:45:55,421 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1317476612] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 19:45:55,421 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 19:45:55,421 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-11 19:45:55,421 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [723560031] [2024-11-11 19:45:55,421 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 19:45:55,422 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-11 19:45:55,422 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 19:45:55,422 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-11 19:45:55,422 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-11 19:45:55,422 INFO L87 Difference]: Start difference. First operand 295 states and 476 transitions. Second operand has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 6 states have internal predecessors, (22), 3 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2024-11-11 19:45:55,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 19:45:55,586 INFO L93 Difference]: Finished difference Result 329 states and 525 transitions. [2024-11-11 19:45:55,586 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-11 19:45:55,586 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 6 states have internal predecessors, (22), 3 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 50 [2024-11-11 19:45:55,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 19:45:55,589 INFO L225 Difference]: With dead ends: 329 [2024-11-11 19:45:55,589 INFO L226 Difference]: Without dead ends: 327 [2024-11-11 19:45:55,591 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2024-11-11 19:45:55,591 INFO L435 NwaCegarLoop]: 47 mSDtfsCounter, 40 mSDsluCounter, 154 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 201 SdHoareTripleChecker+Invalid, 102 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 74 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-11 19:45:55,592 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 201 Invalid, 102 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-11 19:45:55,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 327 states. [2024-11-11 19:45:55,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 327 to 174. [2024-11-11 19:45:55,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 174 states, 85 states have (on average 1.2705882352941176) internal successors, (108), 93 states have internal predecessors, (108), 76 states have call successors, (76), 12 states have call predecessors, (76), 12 states have return successors, (76), 68 states have call predecessors, (76), 76 states have call successors, (76) [2024-11-11 19:45:55,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 260 transitions. [2024-11-11 19:45:55,631 INFO L78 Accepts]: Start accepts. Automaton has 174 states and 260 transitions. Word has length 50 [2024-11-11 19:45:55,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 19:45:55,631 INFO L471 AbstractCegarLoop]: Abstraction has 174 states and 260 transitions. [2024-11-11 19:45:55,631 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 6 states have internal predecessors, (22), 3 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2024-11-11 19:45:55,631 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 260 transitions. [2024-11-11 19:45:55,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2024-11-11 19:45:55,632 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 19:45:55,632 INFO L218 NwaCegarLoop]: trace histogram [9, 8, 8, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 19:45:55,633 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-11 19:45:55,633 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 19:45:55,633 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 19:45:55,633 INFO L85 PathProgramCache]: Analyzing trace with hash -2077570128, now seen corresponding path program 1 times [2024-11-11 19:45:55,633 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 19:45:55,633 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1766620765] [2024-11-11 19:45:55,634 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 19:45:55,634 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 19:45:55,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 19:45:55,714 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-11-11 19:45:55,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 19:45:55,718 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-11 19:45:55,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 19:45:55,720 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-11-11 19:45:55,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 19:45:55,723 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-11 19:45:55,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 19:45:55,726 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-11 19:45:55,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 19:45:55,728 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-11 19:45:55,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 19:45:55,731 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-11 19:45:55,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 19:45:55,734 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-11 19:45:55,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 19:45:55,737 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 16 proven. 7 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2024-11-11 19:45:55,737 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 19:45:55,737 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1766620765] [2024-11-11 19:45:55,738 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1766620765] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-11 19:45:55,738 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1030782699] [2024-11-11 19:45:55,738 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 19:45:55,738 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 19:45:55,738 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 19:45:55,740 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-11 19:45:55,742 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-11 19:45:55,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 19:45:55,815 INFO L256 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-11 19:45:55,821 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 19:45:55,944 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 67 proven. 0 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2024-11-11 19:45:55,945 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-11 19:45:55,945 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1030782699] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 19:45:55,945 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-11 19:45:55,945 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [7] total 9 [2024-11-11 19:45:55,945 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [517110084] [2024-11-11 19:45:55,945 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 19:45:55,946 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-11 19:45:55,946 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 19:45:55,947 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-11 19:45:55,947 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-11-11 19:45:55,947 INFO L87 Difference]: Start difference. First operand 174 states and 260 transitions. Second operand has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 6 states have internal predecessors, (22), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-11-11 19:45:56,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 19:45:56,210 INFO L93 Difference]: Finished difference Result 501 states and 795 transitions. [2024-11-11 19:45:56,210 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-11 19:45:56,211 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 6 states have internal predecessors, (22), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 58 [2024-11-11 19:45:56,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 19:45:56,213 INFO L225 Difference]: With dead ends: 501 [2024-11-11 19:45:56,214 INFO L226 Difference]: Without dead ends: 331 [2024-11-11 19:45:56,215 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2024-11-11 19:45:56,215 INFO L435 NwaCegarLoop]: 41 mSDtfsCounter, 36 mSDsluCounter, 147 mSDsCounter, 0 mSdLazyCounter, 100 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 188 SdHoareTripleChecker+Invalid, 143 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 100 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-11 19:45:56,215 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 188 Invalid, 143 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 100 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-11 19:45:56,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 331 states. [2024-11-11 19:45:56,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 331 to 311. [2024-11-11 19:45:56,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 311 states, 136 states have (on average 1.3455882352941178) internal successors, (183), 152 states have internal predecessors, (183), 162 states have call successors, (162), 12 states have call predecessors, (162), 12 states have return successors, (162), 146 states have call predecessors, (162), 162 states have call successors, (162) [2024-11-11 19:45:56,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 311 states to 311 states and 507 transitions. [2024-11-11 19:45:56,314 INFO L78 Accepts]: Start accepts. Automaton has 311 states and 507 transitions. Word has length 58 [2024-11-11 19:45:56,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 19:45:56,314 INFO L471 AbstractCegarLoop]: Abstraction has 311 states and 507 transitions. [2024-11-11 19:45:56,314 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 6 states have internal predecessors, (22), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-11-11 19:45:56,314 INFO L276 IsEmpty]: Start isEmpty. Operand 311 states and 507 transitions. [2024-11-11 19:45:56,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2024-11-11 19:45:56,315 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 19:45:56,315 INFO L218 NwaCegarLoop]: trace histogram [13, 12, 12, 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] [2024-11-11 19:45:56,333 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-11 19:45:56,516 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-11 19:45:56,516 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 19:45:56,517 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 19:45:56,517 INFO L85 PathProgramCache]: Analyzing trace with hash -1244619342, now seen corresponding path program 1 times [2024-11-11 19:45:56,517 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 19:45:56,517 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [765663961] [2024-11-11 19:45:56,517 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 19:45:56,517 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 19:45:56,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 19:45:56,655 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-11-11 19:45:56,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 19:45:56,661 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-11 19:45:56,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 19:45:56,664 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-11 19:45:56,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 19:45:56,667 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-11 19:45:56,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 19:45:56,671 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-11 19:45:56,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 19:45:56,673 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-11 19:45:56,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 19:45:56,675 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-11 19:45:56,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 19:45:56,677 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-11-11 19:45:56,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 19:45:56,679 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-11 19:45:56,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 19:45:56,687 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-11 19:45:56,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 19:45:56,690 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-11-11 19:45:56,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 19:45:56,696 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-11-11 19:45:56,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 19:45:56,703 INFO L134 CoverageAnalysis]: Checked inductivity of 295 backedges. 24 proven. 7 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-11 19:45:56,703 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 19:45:56,703 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [765663961] [2024-11-11 19:45:56,703 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [765663961] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-11 19:45:56,703 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [850551453] [2024-11-11 19:45:56,703 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 19:45:56,704 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 19:45:56,704 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 19:45:56,705 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-11 19:45:56,707 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-11 19:45:56,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 19:45:56,767 INFO L256 TraceCheckSpWp]: Trace formula consists of 179 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-11 19:45:56,769 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 19:45:57,008 INFO L134 CoverageAnalysis]: Checked inductivity of 295 backedges. 107 proven. 0 refuted. 0 times theorem prover too weak. 188 trivial. 0 not checked. [2024-11-11 19:45:57,008 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-11 19:45:57,008 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [850551453] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 19:45:57,008 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-11 19:45:57,009 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [8] total 13 [2024-11-11 19:45:57,009 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [169211072] [2024-11-11 19:45:57,009 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 19:45:57,009 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-11 19:45:57,009 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 19:45:57,010 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-11 19:45:57,010 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2024-11-11 19:45:57,010 INFO L87 Difference]: Start difference. First operand 311 states and 507 transitions. Second operand has 7 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 7 states have internal predecessors, (24), 3 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2024-11-11 19:45:57,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 19:45:57,295 INFO L93 Difference]: Finished difference Result 578 states and 925 transitions. [2024-11-11 19:45:57,295 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-11 19:45:57,295 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 7 states have internal predecessors, (24), 3 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) Word has length 80 [2024-11-11 19:45:57,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 19:45:57,298 INFO L225 Difference]: With dead ends: 578 [2024-11-11 19:45:57,298 INFO L226 Difference]: Without dead ends: 302 [2024-11-11 19:45:57,322 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 100 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=61, Invalid=179, Unknown=0, NotChecked=0, Total=240 [2024-11-11 19:45:57,324 INFO L435 NwaCegarLoop]: 64 mSDtfsCounter, 30 mSDsluCounter, 142 mSDsCounter, 0 mSdLazyCounter, 150 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 206 SdHoareTripleChecker+Invalid, 185 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 150 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-11 19:45:57,324 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 206 Invalid, 185 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 150 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-11 19:45:57,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 302 states. [2024-11-11 19:45:57,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 302 to 267. [2024-11-11 19:45:57,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 267 states, 124 states have (on average 1.314516129032258) internal successors, (163), 136 states have internal predecessors, (163), 130 states have call successors, (130), 12 states have call predecessors, (130), 12 states have return successors, (130), 118 states have call predecessors, (130), 130 states have call successors, (130) [2024-11-11 19:45:57,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 267 states to 267 states and 423 transitions. [2024-11-11 19:45:57,426 INFO L78 Accepts]: Start accepts. Automaton has 267 states and 423 transitions. Word has length 80 [2024-11-11 19:45:57,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 19:45:57,427 INFO L471 AbstractCegarLoop]: Abstraction has 267 states and 423 transitions. [2024-11-11 19:45:57,427 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 7 states have internal predecessors, (24), 3 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2024-11-11 19:45:57,427 INFO L276 IsEmpty]: Start isEmpty. Operand 267 states and 423 transitions. [2024-11-11 19:45:57,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2024-11-11 19:45:57,429 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 19:45:57,429 INFO L218 NwaCegarLoop]: trace histogram [13, 12, 12, 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] [2024-11-11 19:45:57,446 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-11 19:45:57,633 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-11 19:45:57,634 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 19:45:57,634 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 19:45:57,634 INFO L85 PathProgramCache]: Analyzing trace with hash 293720688, now seen corresponding path program 1 times [2024-11-11 19:45:57,634 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 19:45:57,634 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [700927477] [2024-11-11 19:45:57,635 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 19:45:57,635 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 19:45:57,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 19:45:57,726 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-11-11 19:45:57,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 19:45:57,729 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-11 19:45:57,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 19:45:57,731 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-11 19:45:57,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 19:45:57,733 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-11 19:45:57,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 19:45:57,736 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-11 19:45:57,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 19:45:57,738 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-11 19:45:57,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 19:45:57,740 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-11 19:45:57,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 19:45:57,743 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-11-11 19:45:57,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 19:45:57,745 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-11 19:45:57,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 19:45:57,747 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-11 19:45:57,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 19:45:57,750 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-11-11 19:45:57,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 19:45:57,752 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-11-11 19:45:57,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 19:45:57,754 INFO L134 CoverageAnalysis]: Checked inductivity of 295 backedges. 24 proven. 7 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-11 19:45:57,755 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 19:45:57,755 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [700927477] [2024-11-11 19:45:57,755 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [700927477] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-11 19:45:57,755 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1354495636] [2024-11-11 19:45:57,755 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 19:45:57,755 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 19:45:57,756 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 19:45:57,757 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-11 19:45:57,758 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-11 19:45:57,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 19:45:57,818 INFO L256 TraceCheckSpWp]: Trace formula consists of 178 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-11 19:45:57,821 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 19:45:57,965 INFO L134 CoverageAnalysis]: Checked inductivity of 295 backedges. 107 proven. 0 refuted. 0 times theorem prover too weak. 188 trivial. 0 not checked. [2024-11-11 19:45:57,966 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-11 19:45:57,966 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1354495636] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 19:45:57,966 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-11 19:45:57,966 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [7] total 11 [2024-11-11 19:45:57,966 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1410042736] [2024-11-11 19:45:57,966 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 19:45:57,967 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-11 19:45:57,967 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 19:45:57,967 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-11 19:45:57,967 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2024-11-11 19:45:57,968 INFO L87 Difference]: Start difference. First operand 267 states and 423 transitions. Second operand has 6 states, 6 states have (on average 4.0) internal successors, (24), 6 states have internal predecessors, (24), 2 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-11 19:45:58,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 19:45:58,181 INFO L93 Difference]: Finished difference Result 496 states and 779 transitions. [2024-11-11 19:45:58,182 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-11 19:45:58,182 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.0) internal successors, (24), 6 states have internal predecessors, (24), 2 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 80 [2024-11-11 19:45:58,182 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 19:45:58,184 INFO L225 Difference]: With dead ends: 496 [2024-11-11 19:45:58,184 INFO L226 Difference]: Without dead ends: 220 [2024-11-11 19:45:58,185 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 101 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2024-11-11 19:45:58,186 INFO L435 NwaCegarLoop]: 41 mSDtfsCounter, 21 mSDsluCounter, 89 mSDsCounter, 0 mSdLazyCounter, 95 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 130 SdHoareTripleChecker+Invalid, 117 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 95 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-11 19:45:58,186 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 130 Invalid, 117 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 95 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-11 19:45:58,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 220 states. [2024-11-11 19:45:58,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 220 to 210. [2024-11-11 19:45:58,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 210 states, 99 states have (on average 1.2828282828282829) internal successors, (127), 109 states have internal predecessors, (127), 98 states have call successors, (98), 12 states have call predecessors, (98), 12 states have return successors, (98), 88 states have call predecessors, (98), 98 states have call successors, (98) [2024-11-11 19:45:58,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 323 transitions. [2024-11-11 19:45:58,228 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 323 transitions. Word has length 80 [2024-11-11 19:45:58,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 19:45:58,229 INFO L471 AbstractCegarLoop]: Abstraction has 210 states and 323 transitions. [2024-11-11 19:45:58,229 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.0) internal successors, (24), 6 states have internal predecessors, (24), 2 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-11 19:45:58,229 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 323 transitions. [2024-11-11 19:45:58,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2024-11-11 19:45:58,230 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 19:45:58,230 INFO L218 NwaCegarLoop]: trace histogram [13, 12, 12, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 19:45:58,247 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-11 19:45:58,431 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-11 19:45:58,432 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 19:45:58,432 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 19:45:58,432 INFO L85 PathProgramCache]: Analyzing trace with hash -493164145, now seen corresponding path program 1 times [2024-11-11 19:45:58,432 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 19:45:58,432 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [754536048] [2024-11-11 19:45:58,433 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 19:45:58,433 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 19:45:58,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 19:45:58,547 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-11-11 19:45:58,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 19:45:58,549 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-11 19:45:58,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 19:45:58,552 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-11 19:45:58,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 19:45:58,555 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-11 19:45:58,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 19:45:58,557 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-11 19:45:58,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 19:45:58,559 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-11 19:45:58,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 19:45:58,562 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-11-11 19:45:58,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 19:45:58,564 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-11 19:45:58,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 19:45:58,567 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-11 19:45:58,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 19:45:58,570 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-11 19:45:58,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 19:45:58,577 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-11-11 19:45:58,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 19:45:58,578 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-11 19:45:58,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 19:45:58,584 INFO L134 CoverageAnalysis]: Checked inductivity of 308 backedges. 37 proven. 7 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-11 19:45:58,585 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 19:45:58,585 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [754536048] [2024-11-11 19:45:58,585 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [754536048] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-11 19:45:58,585 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [337788777] [2024-11-11 19:45:58,585 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 19:45:58,585 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 19:45:58,586 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 19:45:58,587 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-11 19:45:58,589 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-11 19:45:58,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 19:45:58,644 INFO L256 TraceCheckSpWp]: Trace formula consists of 187 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-11 19:45:58,647 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 19:45:58,726 INFO L134 CoverageAnalysis]: Checked inductivity of 308 backedges. 149 proven. 2 refuted. 0 times theorem prover too weak. 157 trivial. 0 not checked. [2024-11-11 19:45:58,726 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-11 19:45:58,852 INFO L134 CoverageAnalysis]: Checked inductivity of 308 backedges. 37 proven. 2 refuted. 0 times theorem prover too weak. 269 trivial. 0 not checked. [2024-11-11 19:45:58,852 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [337788777] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-11 19:45:58,852 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-11 19:45:58,852 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6, 6] total 16 [2024-11-11 19:45:58,853 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1812237941] [2024-11-11 19:45:58,853 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-11 19:45:58,853 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-11 19:45:58,853 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 19:45:58,854 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-11 19:45:58,854 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=202, Unknown=0, NotChecked=0, Total=240 [2024-11-11 19:45:58,854 INFO L87 Difference]: Start difference. First operand 210 states and 323 transitions. Second operand has 16 states, 16 states have (on average 3.5) internal successors, (56), 15 states have internal predecessors, (56), 7 states have call successors, (33), 3 states have call predecessors, (33), 2 states have return successors, (32), 7 states have call predecessors, (32), 7 states have call successors, (32) [2024-11-11 19:46:00,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 19:46:00,283 INFO L93 Difference]: Finished difference Result 515 states and 775 transitions. [2024-11-11 19:46:00,283 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2024-11-11 19:46:00,283 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 3.5) internal successors, (56), 15 states have internal predecessors, (56), 7 states have call successors, (33), 3 states have call predecessors, (33), 2 states have return successors, (32), 7 states have call predecessors, (32), 7 states have call successors, (32) Word has length 85 [2024-11-11 19:46:00,283 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 19:46:00,286 INFO L225 Difference]: With dead ends: 515 [2024-11-11 19:46:00,286 INFO L226 Difference]: Without dead ends: 345 [2024-11-11 19:46:00,287 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 242 GetRequests, 197 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 463 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=549, Invalid=1613, Unknown=0, NotChecked=0, Total=2162 [2024-11-11 19:46:00,288 INFO L435 NwaCegarLoop]: 160 mSDtfsCounter, 185 mSDsluCounter, 1057 mSDsCounter, 0 mSdLazyCounter, 918 mSolverCounterSat, 241 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 187 SdHoareTripleChecker+Valid, 1217 SdHoareTripleChecker+Invalid, 1159 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 241 IncrementalHoareTripleChecker+Valid, 918 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-11 19:46:00,288 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [187 Valid, 1217 Invalid, 1159 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [241 Valid, 918 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-11 19:46:00,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 345 states. [2024-11-11 19:46:00,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 345 to 241. [2024-11-11 19:46:00,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 241 states, 121 states have (on average 1.256198347107438) internal successors, (152), 131 states have internal predecessors, (152), 105 states have call successors, (105), 14 states have call predecessors, (105), 14 states have return successors, (105), 95 states have call predecessors, (105), 105 states have call successors, (105) [2024-11-11 19:46:00,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 241 states to 241 states and 362 transitions. [2024-11-11 19:46:00,342 INFO L78 Accepts]: Start accepts. Automaton has 241 states and 362 transitions. Word has length 85 [2024-11-11 19:46:00,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 19:46:00,342 INFO L471 AbstractCegarLoop]: Abstraction has 241 states and 362 transitions. [2024-11-11 19:46:00,343 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 3.5) internal successors, (56), 15 states have internal predecessors, (56), 7 states have call successors, (33), 3 states have call predecessors, (33), 2 states have return successors, (32), 7 states have call predecessors, (32), 7 states have call successors, (32) [2024-11-11 19:46:00,343 INFO L276 IsEmpty]: Start isEmpty. Operand 241 states and 362 transitions. [2024-11-11 19:46:00,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2024-11-11 19:46:00,346 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 19:46:00,346 INFO L218 NwaCegarLoop]: trace histogram [18, 17, 17, 3, 3, 3, 3, 3, 3, 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] [2024-11-11 19:46:00,364 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-11 19:46:00,546 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-11 19:46:00,547 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 19:46:00,547 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 19:46:00,547 INFO L85 PathProgramCache]: Analyzing trace with hash 727769347, now seen corresponding path program 1 times [2024-11-11 19:46:00,547 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 19:46:00,547 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1239138965] [2024-11-11 19:46:00,547 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 19:46:00,547 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 19:46:00,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 19:46:00,679 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-11-11 19:46:00,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 19:46:00,682 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-11 19:46:00,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 19:46:00,683 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-11 19:46:00,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 19:46:00,685 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-11 19:46:00,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 19:46:00,687 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-11 19:46:00,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 19:46:00,690 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-11 19:46:00,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 19:46:00,691 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-11 19:46:00,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 19:46:00,693 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-11 19:46:00,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 19:46:00,695 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-11 19:46:00,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 19:46:00,699 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-11 19:46:00,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 19:46:00,702 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-11 19:46:00,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 19:46:00,704 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-11 19:46:00,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 19:46:00,706 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-11 19:46:00,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 19:46:00,711 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-11 19:46:00,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 19:46:00,713 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-11-11 19:46:00,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 19:46:00,716 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-11 19:46:00,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 19:46:00,717 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-11-11 19:46:00,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 19:46:00,719 INFO L134 CoverageAnalysis]: Checked inductivity of 599 backedges. 47 proven. 8 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-11-11 19:46:00,719 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 19:46:00,719 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1239138965] [2024-11-11 19:46:00,719 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1239138965] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-11 19:46:00,720 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1332823389] [2024-11-11 19:46:00,720 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 19:46:00,720 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 19:46:00,720 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 19:46:00,722 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-11 19:46:00,724 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-11 19:46:00,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 19:46:00,794 INFO L256 TraceCheckSpWp]: Trace formula consists of 237 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-11 19:46:00,796 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 19:46:00,979 INFO L134 CoverageAnalysis]: Checked inductivity of 599 backedges. 210 proven. 7 refuted. 0 times theorem prover too weak. 382 trivial. 0 not checked. [2024-11-11 19:46:00,980 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-11 19:46:01,184 INFO L134 CoverageAnalysis]: Checked inductivity of 599 backedges. 47 proven. 8 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-11-11 19:46:01,184 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1332823389] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-11 19:46:01,184 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-11 19:46:01,185 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 21 [2024-11-11 19:46:01,186 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1129607094] [2024-11-11 19:46:01,187 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-11 19:46:01,187 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2024-11-11 19:46:01,187 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 19:46:01,188 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2024-11-11 19:46:01,188 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=340, Unknown=0, NotChecked=0, Total=420 [2024-11-11 19:46:01,189 INFO L87 Difference]: Start difference. First operand 241 states and 362 transitions. Second operand has 21 states, 21 states have (on average 2.761904761904762) internal successors, (58), 21 states have internal predecessors, (58), 12 states have call successors, (47), 2 states have call predecessors, (47), 2 states have return successors, (46), 12 states have call predecessors, (46), 12 states have call successors, (46) [2024-11-11 19:46:03,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 19:46:03,148 INFO L93 Difference]: Finished difference Result 850 states and 1342 transitions. [2024-11-11 19:46:03,148 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2024-11-11 19:46:03,149 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 2.761904761904762) internal successors, (58), 21 states have internal predecessors, (58), 12 states have call successors, (47), 2 states have call predecessors, (47), 2 states have return successors, (46), 12 states have call predecessors, (46), 12 states have call successors, (46) Word has length 112 [2024-11-11 19:46:03,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 19:46:03,152 INFO L225 Difference]: With dead ends: 850 [2024-11-11 19:46:03,152 INFO L226 Difference]: Without dead ends: 483 [2024-11-11 19:46:03,154 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 307 GetRequests, 247 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 953 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=943, Invalid=2839, Unknown=0, NotChecked=0, Total=3782 [2024-11-11 19:46:03,155 INFO L435 NwaCegarLoop]: 167 mSDtfsCounter, 310 mSDsluCounter, 745 mSDsCounter, 0 mSdLazyCounter, 1170 mSolverCounterSat, 420 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 336 SdHoareTripleChecker+Valid, 912 SdHoareTripleChecker+Invalid, 1590 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 420 IncrementalHoareTripleChecker+Valid, 1170 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-11 19:46:03,155 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [336 Valid, 912 Invalid, 1590 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [420 Valid, 1170 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-11 19:46:03,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 483 states. [2024-11-11 19:46:03,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 483 to 370. [2024-11-11 19:46:03,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 370 states, 170 states have (on average 1.2647058823529411) internal successors, (215), 184 states have internal predecessors, (215), 186 states have call successors, (186), 13 states have call predecessors, (186), 13 states have return successors, (186), 172 states have call predecessors, (186), 186 states have call successors, (186) [2024-11-11 19:46:03,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 370 states to 370 states and 587 transitions. [2024-11-11 19:46:03,267 INFO L78 Accepts]: Start accepts. Automaton has 370 states and 587 transitions. Word has length 112 [2024-11-11 19:46:03,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 19:46:03,268 INFO L471 AbstractCegarLoop]: Abstraction has 370 states and 587 transitions. [2024-11-11 19:46:03,268 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 2.761904761904762) internal successors, (58), 21 states have internal predecessors, (58), 12 states have call successors, (47), 2 states have call predecessors, (47), 2 states have return successors, (46), 12 states have call predecessors, (46), 12 states have call successors, (46) [2024-11-11 19:46:03,268 INFO L276 IsEmpty]: Start isEmpty. Operand 370 states and 587 transitions. [2024-11-11 19:46:03,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2024-11-11 19:46:03,270 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 19:46:03,270 INFO L218 NwaCegarLoop]: trace histogram [18, 17, 17, 3, 3, 3, 3, 3, 3, 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] [2024-11-11 19:46:03,286 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-11 19:46:03,473 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-11 19:46:03,474 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 19:46:03,474 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 19:46:03,474 INFO L85 PathProgramCache]: Analyzing trace with hash 1988686597, now seen corresponding path program 1 times [2024-11-11 19:46:03,474 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 19:46:03,474 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2105491497] [2024-11-11 19:46:03,475 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 19:46:03,475 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 19:46:03,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 19:46:03,622 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-11-11 19:46:03,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 19:46:03,625 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-11 19:46:03,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 19:46:03,627 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-11 19:46:03,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 19:46:03,628 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-11 19:46:03,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 19:46:03,631 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-11 19:46:03,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 19:46:03,633 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-11 19:46:03,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 19:46:03,635 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-11 19:46:03,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 19:46:03,638 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-11 19:46:03,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 19:46:03,642 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-11 19:46:03,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 19:46:03,645 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-11 19:46:03,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 19:46:03,647 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-11 19:46:03,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 19:46:03,650 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-11 19:46:03,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 19:46:03,652 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-11 19:46:03,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 19:46:03,654 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-11 19:46:03,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 19:46:03,656 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-11-11 19:46:03,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 19:46:03,660 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-11 19:46:03,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 19:46:03,662 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-11-11 19:46:03,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 19:46:03,667 INFO L134 CoverageAnalysis]: Checked inductivity of 599 backedges. 34 proven. 21 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-11-11 19:46:03,667 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 19:46:03,667 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2105491497] [2024-11-11 19:46:03,667 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2105491497] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-11 19:46:03,667 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1419680678] [2024-11-11 19:46:03,667 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 19:46:03,667 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 19:46:03,668 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 19:46:03,669 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-11 19:46:03,671 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-11 19:46:03,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 19:46:03,735 INFO L256 TraceCheckSpWp]: Trace formula consists of 236 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-11 19:46:03,737 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 19:46:03,953 INFO L134 CoverageAnalysis]: Checked inductivity of 599 backedges. 34 proven. 21 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-11-11 19:46:03,953 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-11 19:46:04,186 INFO L134 CoverageAnalysis]: Checked inductivity of 599 backedges. 34 proven. 21 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-11-11 19:46:04,186 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1419680678] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-11 19:46:04,186 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-11 19:46:04,186 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 20 [2024-11-11 19:46:04,186 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [988314841] [2024-11-11 19:46:04,186 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-11 19:46:04,187 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2024-11-11 19:46:04,187 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 19:46:04,189 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2024-11-11 19:46:04,189 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=323, Unknown=0, NotChecked=0, Total=380 [2024-11-11 19:46:04,189 INFO L87 Difference]: Start difference. First operand 370 states and 587 transitions. Second operand has 20 states, 20 states have (on average 3.3) internal successors, (66), 18 states have internal predecessors, (66), 8 states have call successors, (50), 3 states have call predecessors, (50), 1 states have return successors, (47), 8 states have call predecessors, (47), 8 states have call successors, (47) [2024-11-11 19:46:05,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 19:46:05,477 INFO L93 Difference]: Finished difference Result 857 states and 1368 transitions. [2024-11-11 19:46:05,477 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-11-11 19:46:05,477 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 3.3) internal successors, (66), 18 states have internal predecessors, (66), 8 states have call successors, (50), 3 states have call predecessors, (50), 1 states have return successors, (47), 8 states have call predecessors, (47), 8 states have call successors, (47) Word has length 112 [2024-11-11 19:46:05,478 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 19:46:05,483 INFO L225 Difference]: With dead ends: 857 [2024-11-11 19:46:05,483 INFO L226 Difference]: Without dead ends: 739 [2024-11-11 19:46:05,484 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 285 GetRequests, 245 SyntacticMatches, 3 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 291 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=363, Invalid=1119, Unknown=0, NotChecked=0, Total=1482 [2024-11-11 19:46:05,484 INFO L435 NwaCegarLoop]: 80 mSDtfsCounter, 385 mSDsluCounter, 584 mSDsCounter, 0 mSdLazyCounter, 512 mSolverCounterSat, 531 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 385 SdHoareTripleChecker+Valid, 664 SdHoareTripleChecker+Invalid, 1043 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 531 IncrementalHoareTripleChecker+Valid, 512 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-11 19:46:05,485 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [385 Valid, 664 Invalid, 1043 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [531 Valid, 512 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-11 19:46:05,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 739 states. [2024-11-11 19:46:05,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 739 to 414. [2024-11-11 19:46:05,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 414 states, 185 states have (on average 1.2756756756756757) internal successors, (236), 207 states have internal predecessors, (236), 212 states have call successors, (212), 16 states have call predecessors, (212), 16 states have return successors, (212), 190 states have call predecessors, (212), 212 states have call successors, (212) [2024-11-11 19:46:05,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 414 states to 414 states and 660 transitions. [2024-11-11 19:46:05,629 INFO L78 Accepts]: Start accepts. Automaton has 414 states and 660 transitions. Word has length 112 [2024-11-11 19:46:05,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 19:46:05,630 INFO L471 AbstractCegarLoop]: Abstraction has 414 states and 660 transitions. [2024-11-11 19:46:05,630 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 3.3) internal successors, (66), 18 states have internal predecessors, (66), 8 states have call successors, (50), 3 states have call predecessors, (50), 1 states have return successors, (47), 8 states have call predecessors, (47), 8 states have call successors, (47) [2024-11-11 19:46:05,630 INFO L276 IsEmpty]: Start isEmpty. Operand 414 states and 660 transitions. [2024-11-11 19:46:05,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2024-11-11 19:46:05,635 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 19:46:05,635 INFO L218 NwaCegarLoop]: trace histogram [32, 31, 31, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 19:46:05,652 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2024-11-11 19:46:05,835 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-11 19:46:05,836 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 19:46:05,836 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 19:46:05,836 INFO L85 PathProgramCache]: Analyzing trace with hash -1189837218, now seen corresponding path program 2 times [2024-11-11 19:46:05,836 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 19:46:05,836 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [857740769] [2024-11-11 19:46:05,837 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 19:46:05,837 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 19:46:05,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 19:46:06,045 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-11-11 19:46:06,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 19:46:06,050 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-11 19:46:06,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 19:46:06,052 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-11 19:46:06,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 19:46:06,054 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-11 19:46:06,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 19:46:06,055 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-11 19:46:06,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 19:46:06,057 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-11 19:46:06,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 19:46:06,060 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-11 19:46:06,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 19:46:06,062 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-11 19:46:06,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 19:46:06,065 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-11 19:46:06,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 19:46:06,067 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-11 19:46:06,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 19:46:06,070 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-11 19:46:06,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 19:46:06,071 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-11 19:46:06,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 19:46:06,073 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-11 19:46:06,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 19:46:06,075 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-11 19:46:06,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 19:46:06,077 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-11 19:46:06,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 19:46:06,079 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-11 19:46:06,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 19:46:06,081 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-11 19:46:06,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 19:46:06,084 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-11 19:46:06,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 19:46:06,086 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-11 19:46:06,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 19:46:06,088 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-11-11 19:46:06,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 19:46:06,090 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-11-11 19:46:06,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 19:46:06,092 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-11 19:46:06,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 19:46:06,094 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2024-11-11 19:46:06,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 19:46:06,097 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-11-11 19:46:06,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 19:46:06,100 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2024-11-11 19:46:06,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 19:46:06,102 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2024-11-11 19:46:06,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 19:46:06,104 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2024-11-11 19:46:06,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 19:46:06,106 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 162 [2024-11-11 19:46:06,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 19:46:06,108 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 170 [2024-11-11 19:46:06,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 19:46:06,110 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 175 [2024-11-11 19:46:06,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 19:46:06,113 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 182 [2024-11-11 19:46:06,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 19:46:06,115 INFO L134 CoverageAnalysis]: Checked inductivity of 1986 backedges. 62 proven. 47 refuted. 0 times theorem prover too weak. 1877 trivial. 0 not checked. [2024-11-11 19:46:06,115 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 19:46:06,115 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [857740769] [2024-11-11 19:46:06,116 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [857740769] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-11 19:46:06,116 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1108626262] [2024-11-11 19:46:06,116 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-11 19:46:06,116 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 19:46:06,116 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 19:46:06,118 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-11 19:46:06,119 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-11 19:46:06,207 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-11 19:46:06,207 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-11 19:46:06,208 INFO L256 TraceCheckSpWp]: Trace formula consists of 383 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-11 19:46:06,210 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 19:46:06,462 INFO L134 CoverageAnalysis]: Checked inductivity of 1986 backedges. 89 proven. 19 refuted. 0 times theorem prover too weak. 1878 trivial. 0 not checked. [2024-11-11 19:46:06,463 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-11 19:46:06,742 INFO L134 CoverageAnalysis]: Checked inductivity of 1986 backedges. 86 proven. 22 refuted. 0 times theorem prover too weak. 1878 trivial. 0 not checked. [2024-11-11 19:46:06,742 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1108626262] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-11 19:46:06,743 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-11 19:46:06,743 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8, 8] total 19 [2024-11-11 19:46:06,743 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2139203752] [2024-11-11 19:46:06,743 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-11 19:46:06,744 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-11-11 19:46:06,744 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 19:46:06,744 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-11-11 19:46:06,745 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=287, Unknown=0, NotChecked=0, Total=342 [2024-11-11 19:46:06,745 INFO L87 Difference]: Start difference. First operand 414 states and 660 transitions. Second operand has 19 states, 19 states have (on average 4.2105263157894735) internal successors, (80), 17 states have internal predecessors, (80), 9 states have call successors, (66), 3 states have call predecessors, (66), 1 states have return successors, (63), 9 states have call predecessors, (63), 9 states have call successors, (63) [2024-11-11 19:46:07,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 19:46:07,592 INFO L93 Difference]: Finished difference Result 467 states and 734 transitions. [2024-11-11 19:46:07,593 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2024-11-11 19:46:07,593 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 4.2105263157894735) internal successors, (80), 17 states have internal predecessors, (80), 9 states have call successors, (66), 3 states have call predecessors, (66), 1 states have return successors, (63), 9 states have call predecessors, (63), 9 states have call successors, (63) Word has length 191 [2024-11-11 19:46:07,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 19:46:07,595 INFO L225 Difference]: With dead ends: 467 [2024-11-11 19:46:07,595 INFO L226 Difference]: Without dead ends: 0 [2024-11-11 19:46:07,597 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 470 GetRequests, 435 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 196 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=327, Invalid=1005, Unknown=0, NotChecked=0, Total=1332 [2024-11-11 19:46:07,597 INFO L435 NwaCegarLoop]: 82 mSDtfsCounter, 135 mSDsluCounter, 606 mSDsCounter, 0 mSdLazyCounter, 480 mSolverCounterSat, 199 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 137 SdHoareTripleChecker+Valid, 688 SdHoareTripleChecker+Invalid, 679 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 199 IncrementalHoareTripleChecker+Valid, 480 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-11 19:46:07,597 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [137 Valid, 688 Invalid, 679 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [199 Valid, 480 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-11 19:46:07,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-11-11 19:46:07,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-11-11 19:46:07,598 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-11 19:46:07,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-11-11 19:46:07,599 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 191 [2024-11-11 19:46:07,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 19:46:07,599 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-11 19:46:07,599 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 4.2105263157894735) internal successors, (80), 17 states have internal predecessors, (80), 9 states have call successors, (66), 3 states have call predecessors, (66), 1 states have return successors, (63), 9 states have call predecessors, (63), 9 states have call successors, (63) [2024-11-11 19:46:07,599 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-11-11 19:46:07,599 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-11-11 19:46:07,602 INFO L782 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-11 19:46:07,620 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-11 19:46:07,803 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 19:46:07,807 INFO L421 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 19:46:07,809 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions.