./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-invgen/heapsort.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 84cfde4a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-invgen/heapsort.i -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/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-dev-84cfde4 [2024-10-11 01:51:34,930 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 01:51:34,979 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-11 01:51:34,983 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 01:51:34,984 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 01:51:35,005 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 01:51:35,006 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 01:51:35,006 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 01:51:35,006 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 01:51:35,007 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 01:51:35,007 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 01:51:35,007 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 01:51:35,008 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 01:51:35,011 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 01:51:35,011 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 01:51:35,012 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 01:51:35,013 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 01:51:35,013 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 01:51:35,013 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 01:51:35,014 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 01:51:35,014 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 01:51:35,017 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 01:51:35,017 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 01:51:35,017 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 01:51:35,017 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 01:51:35,018 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 01:51:35,018 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 01:51:35,018 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 01:51:35,018 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 01:51:35,019 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 01:51:35,019 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 01:51:35,019 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 01:51:35,019 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 01:51:35,019 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 01:51:35,019 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 01:51:35,020 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 01:51:35,020 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 01:51:35,020 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 01:51:35,021 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 01:51:35,021 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 01:51:35,021 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 01:51:35,022 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 01:51:35,022 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate-clean/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-clean/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-10-11 01:51:35,249 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 01:51:35,273 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 01:51:35,275 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 01:51:35,276 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 01:51:35,277 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 01:51:35,278 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-invgen/heapsort.i [2024-10-11 01:51:36,704 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 01:51:36,884 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 01:51:36,885 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-invgen/heapsort.i [2024-10-11 01:51:36,891 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/ac483ae38/af9240140d4d49edbc42606c81b16c61/FLAG8fffc63ec [2024-10-11 01:51:36,903 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/ac483ae38/af9240140d4d49edbc42606c81b16c61 [2024-10-11 01:51:36,905 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 01:51:36,906 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 01:51:36,907 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 01:51:36,908 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 01:51:36,915 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 01:51:36,916 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 01:51:36" (1/1) ... [2024-10-11 01:51:36,917 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6fac2e66 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:51:36, skipping insertion in model container [2024-10-11 01:51:36,917 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 01:51:36" (1/1) ... [2024-10-11 01:51:36,941 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 01:51:37,117 WARN L248 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-10-11 01:51:37,134 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 01:51:37,142 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 01:51:37,160 WARN L248 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-10-11 01:51:37,167 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 01:51:37,183 INFO L204 MainTranslator]: Completed translation [2024-10-11 01:51:37,184 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:51:37 WrapperNode [2024-10-11 01:51:37,184 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 01:51:37,185 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 01:51:37,185 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 01:51:37,185 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 01:51:37,191 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:51:37" (1/1) ... [2024-10-11 01:51:37,196 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:51:37" (1/1) ... [2024-10-11 01:51:37,217 INFO L138 Inliner]: procedures = 16, calls = 20, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 78 [2024-10-11 01:51:37,217 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 01:51:37,218 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 01:51:37,218 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 01:51:37,218 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 01:51:37,227 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:51:37" (1/1) ... [2024-10-11 01:51:37,227 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:51:37" (1/1) ... [2024-10-11 01:51:37,230 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:51:37" (1/1) ... [2024-10-11 01:51:37,244 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-10-11 01:51:37,244 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:51:37" (1/1) ... [2024-10-11 01:51:37,244 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:51:37" (1/1) ... [2024-10-11 01:51:37,247 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:51:37" (1/1) ... [2024-10-11 01:51:37,250 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:51:37" (1/1) ... [2024-10-11 01:51:37,251 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:51:37" (1/1) ... [2024-10-11 01:51:37,252 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:51:37" (1/1) ... [2024-10-11 01:51:37,253 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 01:51:37,254 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 01:51:37,254 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 01:51:37,255 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 01:51:37,255 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:51:37" (1/1) ... [2024-10-11 01:51:37,261 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 01:51:37,272 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 01:51:37,288 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 01:51:37,295 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 01:51:37,343 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 01:51:37,343 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-11 01:51:37,343 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 01:51:37,343 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 01:51:37,343 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-10-11 01:51:37,343 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-10-11 01:51:37,415 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 01:51:37,417 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 01:51:37,615 INFO L? ?]: Removed 14 outVars from TransFormulas that were not future-live. [2024-10-11 01:51:37,616 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 01:51:37,649 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 01:51:37,649 INFO L314 CfgBuilder]: Removed 2 assume(true) statements. [2024-10-11 01:51:37,650 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 01:51:37 BoogieIcfgContainer [2024-10-11 01:51:37,650 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 01:51:37,654 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 01:51:37,654 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 01:51:37,657 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 01:51:37,657 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 01:51:36" (1/3) ... [2024-10-11 01:51:37,659 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2000d416 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 01:51:37, skipping insertion in model container [2024-10-11 01:51:37,659 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:51:37" (2/3) ... [2024-10-11 01:51:37,660 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2000d416 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 01:51:37, skipping insertion in model container [2024-10-11 01:51:37,660 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 01:51:37" (3/3) ... [2024-10-11 01:51:37,661 INFO L112 eAbstractionObserver]: Analyzing ICFG heapsort.i [2024-10-11 01:51:37,707 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 01:51:37,707 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-11 01:51:37,799 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 01:51:37,807 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;@12014a3, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 01:51:37,807 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-11 01:51:37,812 INFO L276 IsEmpty]: Start isEmpty. Operand has 37 states, 20 states have (on average 1.6) internal successors, (32), 21 states have internal predecessors, (32), 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-10-11 01:51:37,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-10-11 01:51:37,819 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 01:51:37,820 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 01:51:37,821 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 01:51:37,826 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 01:51:37,827 INFO L85 PathProgramCache]: Analyzing trace with hash -1492052254, now seen corresponding path program 1 times [2024-10-11 01:51:37,835 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 01:51:37,836 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [841579810] [2024-10-11 01:51:37,836 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 01:51:37,836 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 01:51:37,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:51:38,194 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 01:51:38,194 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 01:51:38,194 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [841579810] [2024-10-11 01:51:38,195 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [841579810] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 01:51:38,195 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 01:51:38,195 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 01:51:38,197 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1767063856] [2024-10-11 01:51:38,197 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 01:51:38,200 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 01:51:38,201 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 01:51:38,219 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 01:51:38,220 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 01:51:38,222 INFO L87 Difference]: Start difference. First operand has 37 states, 20 states have (on average 1.6) internal successors, (32), 21 states have internal predecessors, (32), 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.25) internal successors, (9), 4 states have internal predecessors, (9), 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-10-11 01:51:38,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 01:51:38,361 INFO L93 Difference]: Finished difference Result 99 states and 189 transitions. [2024-10-11 01:51:38,362 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 01:51:38,363 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 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 10 [2024-10-11 01:51:38,364 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 01:51:38,372 INFO L225 Difference]: With dead ends: 99 [2024-10-11 01:51:38,372 INFO L226 Difference]: Without dead ends: 60 [2024-10-11 01:51:38,376 INFO L431 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-10-11 01:51:38,380 INFO L432 NwaCegarLoop]: 46 mSDtfsCounter, 20 mSDsluCounter, 122 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 168 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 01:51:38,381 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 168 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 01:51:38,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2024-10-11 01:51:38,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 38. [2024-10-11 01:51:38,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 21 states have (on average 1.3333333333333333) internal successors, (28), 21 states have internal predecessors, (28), 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-10-11 01:51:38,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 56 transitions. [2024-10-11 01:51:38,430 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 56 transitions. Word has length 10 [2024-10-11 01:51:38,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 01:51:38,431 INFO L471 AbstractCegarLoop]: Abstraction has 38 states and 56 transitions. [2024-10-11 01:51:38,432 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 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-10-11 01:51:38,432 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 56 transitions. [2024-10-11 01:51:38,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-10-11 01:51:38,432 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 01:51:38,433 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 01:51:38,433 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 01:51:38,433 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 01:51:38,434 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 01:51:38,434 INFO L85 PathProgramCache]: Analyzing trace with hash -1487315485, now seen corresponding path program 1 times [2024-10-11 01:51:38,434 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 01:51:38,434 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2079407389] [2024-10-11 01:51:38,434 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 01:51:38,434 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 01:51:38,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:51:38,557 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 01:51:38,557 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 01:51:38,557 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2079407389] [2024-10-11 01:51:38,558 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2079407389] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 01:51:38,558 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 01:51:38,558 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 01:51:38,558 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1014786369] [2024-10-11 01:51:38,558 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 01:51:38,559 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 01:51:38,559 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 01:51:38,560 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 01:51:38,560 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 01:51:38,561 INFO L87 Difference]: Start difference. First operand 38 states and 56 transitions. Second operand has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 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-10-11 01:51:38,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 01:51:38,648 INFO L93 Difference]: Finished difference Result 45 states and 62 transitions. [2024-10-11 01:51:38,649 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 01:51:38,649 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 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 10 [2024-10-11 01:51:38,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 01:51:38,650 INFO L225 Difference]: With dead ends: 45 [2024-10-11 01:51:38,650 INFO L226 Difference]: Without dead ends: 43 [2024-10-11 01:51:38,650 INFO L431 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-10-11 01:51:38,651 INFO L432 NwaCegarLoop]: 45 mSDtfsCounter, 16 mSDsluCounter, 91 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 136 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 01:51:38,652 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 136 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 01:51:38,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2024-10-11 01:51:38,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 42. [2024-10-11 01:51:38,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 24 states have (on average 1.2916666666666667) internal successors, (31), 24 states have internal predecessors, (31), 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-10-11 01:51:38,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 59 transitions. [2024-10-11 01:51:38,670 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 59 transitions. Word has length 10 [2024-10-11 01:51:38,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 01:51:38,670 INFO L471 AbstractCegarLoop]: Abstraction has 42 states and 59 transitions. [2024-10-11 01:51:38,670 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 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-10-11 01:51:38,670 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 59 transitions. [2024-10-11 01:51:38,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-10-11 01:51:38,672 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 01:51:38,672 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 01:51:38,672 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-11 01:51:38,673 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 01:51:38,673 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 01:51:38,674 INFO L85 PathProgramCache]: Analyzing trace with hash -1465865965, now seen corresponding path program 1 times [2024-10-11 01:51:38,674 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 01:51:38,674 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1873351831] [2024-10-11 01:51:38,675 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 01:51:38,675 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 01:51:38,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:51:38,793 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 01:51:38,793 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 01:51:38,795 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1873351831] [2024-10-11 01:51:38,795 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1873351831] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 01:51:38,795 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 01:51:38,795 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 01:51:38,795 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1469615326] [2024-10-11 01:51:38,796 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 01:51:38,796 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 01:51:38,797 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 01:51:38,798 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 01:51:38,798 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-11 01:51:38,799 INFO L87 Difference]: Start difference. First operand 42 states and 59 transitions. Second operand has 6 states, 6 states have (on average 1.5) internal successors, (9), 5 states have internal predecessors, (9), 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-10-11 01:51:38,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 01:51:38,992 INFO L93 Difference]: Finished difference Result 79 states and 117 transitions. [2024-10-11 01:51:38,993 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 01:51:38,993 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.5) internal successors, (9), 5 states have internal predecessors, (9), 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 10 [2024-10-11 01:51:38,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 01:51:38,995 INFO L225 Difference]: With dead ends: 79 [2024-10-11 01:51:38,996 INFO L226 Difference]: Without dead ends: 77 [2024-10-11 01:51:38,996 INFO L431 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-10-11 01:51:38,997 INFO L432 NwaCegarLoop]: 42 mSDtfsCounter, 29 mSDsluCounter, 152 mSDsCounter, 0 mSdLazyCounter, 116 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 194 SdHoareTripleChecker+Invalid, 148 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 116 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 01:51:38,997 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 194 Invalid, 148 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 116 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 01:51:38,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2024-10-11 01:51:39,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 68. [2024-10-11 01:51:39,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 37 states have (on average 1.3243243243243243) internal successors, (49), 37 states have internal predecessors, (49), 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-10-11 01:51:39,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 101 transitions. [2024-10-11 01:51:39,019 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 101 transitions. Word has length 10 [2024-10-11 01:51:39,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 01:51:39,019 INFO L471 AbstractCegarLoop]: Abstraction has 68 states and 101 transitions. [2024-10-11 01:51:39,020 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 1.5) internal successors, (9), 5 states have internal predecessors, (9), 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-10-11 01:51:39,020 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 101 transitions. [2024-10-11 01:51:39,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-10-11 01:51:39,020 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 01:51:39,020 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 01:51:39,021 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-11 01:51:39,021 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 01:51:39,025 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 01:51:39,025 INFO L85 PathProgramCache]: Analyzing trace with hash 1063638546, now seen corresponding path program 1 times [2024-10-11 01:51:39,025 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 01:51:39,025 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1323444781] [2024-10-11 01:51:39,025 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 01:51:39,026 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 01:51:39,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:51:39,164 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-11 01:51:39,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:51:39,170 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 01:51:39,171 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 01:51:39,171 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1323444781] [2024-10-11 01:51:39,171 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1323444781] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 01:51:39,171 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 01:51:39,172 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 01:51:39,172 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [775789281] [2024-10-11 01:51:39,172 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 01:51:39,172 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 01:51:39,173 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 01:51:39,175 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 01:51:39,175 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-11 01:51:39,175 INFO L87 Difference]: Start difference. First operand 68 states and 101 transitions. Second operand has 7 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 6 states have internal predecessors, (12), 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-10-11 01:51:39,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 01:51:39,410 INFO L93 Difference]: Finished difference Result 101 states and 152 transitions. [2024-10-11 01:51:39,411 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 01:51:39,411 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 6 states have internal predecessors, (12), 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 15 [2024-10-11 01:51:39,411 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 01:51:39,413 INFO L225 Difference]: With dead ends: 101 [2024-10-11 01:51:39,413 INFO L226 Difference]: Without dead ends: 99 [2024-10-11 01:51:39,413 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-10-11 01:51:39,414 INFO L432 NwaCegarLoop]: 56 mSDtfsCounter, 56 mSDsluCounter, 153 mSDsCounter, 0 mSdLazyCounter, 127 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 209 SdHoareTripleChecker+Invalid, 167 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 127 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 01:51:39,414 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 209 Invalid, 167 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 127 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 01:51:39,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2024-10-11 01:51:39,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 96. [2024-10-11 01:51:39,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 50 states have (on average 1.34) internal successors, (67), 51 states have internal predecessors, (67), 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-10-11 01:51:39,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 147 transitions. [2024-10-11 01:51:39,442 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 147 transitions. Word has length 15 [2024-10-11 01:51:39,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 01:51:39,443 INFO L471 AbstractCegarLoop]: Abstraction has 96 states and 147 transitions. [2024-10-11 01:51:39,443 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 6 states have internal predecessors, (12), 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-10-11 01:51:39,443 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 147 transitions. [2024-10-11 01:51:39,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-10-11 01:51:39,444 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 01:51:39,444 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 01:51:39,444 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-11 01:51:39,444 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 01:51:39,445 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 01:51:39,445 INFO L85 PathProgramCache]: Analyzing trace with hash 1445001009, now seen corresponding path program 1 times [2024-10-11 01:51:39,445 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 01:51:39,445 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1345222160] [2024-10-11 01:51:39,446 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 01:51:39,446 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 01:51:39,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:51:39,503 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-11 01:51:39,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:51:39,508 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 01:51:39,508 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 01:51:39,508 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1345222160] [2024-10-11 01:51:39,508 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1345222160] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 01:51:39,508 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 01:51:39,508 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 01:51:39,509 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1037800183] [2024-10-11 01:51:39,509 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 01:51:39,509 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 01:51:39,509 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 01:51:39,510 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 01:51:39,510 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 01:51:39,510 INFO L87 Difference]: Start difference. First operand 96 states and 147 transitions. Second operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 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-10-11 01:51:39,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 01:51:39,576 INFO L93 Difference]: Finished difference Result 102 states and 152 transitions. [2024-10-11 01:51:39,576 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 01:51:39,577 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 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 15 [2024-10-11 01:51:39,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 01:51:39,579 INFO L225 Difference]: With dead ends: 102 [2024-10-11 01:51:39,579 INFO L226 Difference]: Without dead ends: 100 [2024-10-11 01:51:39,580 INFO L431 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-10-11 01:51:39,581 INFO L432 NwaCegarLoop]: 45 mSDtfsCounter, 15 mSDsluCounter, 91 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 136 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 01:51:39,581 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 136 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 01:51:39,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2024-10-11 01:51:39,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 100. [2024-10-11 01:51:39,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 53 states have (on average 1.320754716981132) internal successors, (70), 54 states have internal predecessors, (70), 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-10-11 01:51:39,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 150 transitions. [2024-10-11 01:51:39,611 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 150 transitions. Word has length 15 [2024-10-11 01:51:39,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 01:51:39,611 INFO L471 AbstractCegarLoop]: Abstraction has 100 states and 150 transitions. [2024-10-11 01:51:39,611 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 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-10-11 01:51:39,611 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 150 transitions. [2024-10-11 01:51:39,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-10-11 01:51:39,612 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 01:51:39,612 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 01:51:39,613 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-11 01:51:39,613 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 01:51:39,613 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 01:51:39,613 INFO L85 PathProgramCache]: Analyzing trace with hash 1429998849, now seen corresponding path program 1 times [2024-10-11 01:51:39,613 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 01:51:39,614 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [612210256] [2024-10-11 01:51:39,614 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 01:51:39,614 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 01:51:39,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:51:39,695 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-11 01:51:39,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:51:39,700 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 01:51:39,701 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 01:51:39,701 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [612210256] [2024-10-11 01:51:39,701 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [612210256] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 01:51:39,701 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 01:51:39,702 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 01:51:39,702 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1690767804] [2024-10-11 01:51:39,702 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 01:51:39,702 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 01:51:39,703 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 01:51:39,704 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 01:51:39,706 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-11 01:51:39,706 INFO L87 Difference]: Start difference. First operand 100 states and 150 transitions. Second operand has 7 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 6 states have internal predecessors, (12), 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-10-11 01:51:39,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 01:51:39,957 INFO L93 Difference]: Finished difference Result 154 states and 239 transitions. [2024-10-11 01:51:39,958 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 01:51:39,958 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 6 states have internal predecessors, (12), 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 15 [2024-10-11 01:51:39,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 01:51:39,962 INFO L225 Difference]: With dead ends: 154 [2024-10-11 01:51:39,965 INFO L226 Difference]: Without dead ends: 152 [2024-10-11 01:51:39,966 INFO L431 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-10-11 01:51:39,966 INFO L432 NwaCegarLoop]: 66 mSDtfsCounter, 55 mSDsluCounter, 215 mSDsCounter, 0 mSdLazyCounter, 161 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 281 SdHoareTripleChecker+Invalid, 188 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 161 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 01:51:39,967 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [83 Valid, 281 Invalid, 188 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 161 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 01:51:39,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2024-10-11 01:51:40,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 136. [2024-10-11 01:51:40,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 136 states, 68 states have (on average 1.3676470588235294) internal successors, (93), 71 states have internal predecessors, (93), 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-10-11 01:51:40,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 213 transitions. [2024-10-11 01:51:40,033 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 213 transitions. Word has length 15 [2024-10-11 01:51:40,034 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 01:51:40,035 INFO L471 AbstractCegarLoop]: Abstraction has 136 states and 213 transitions. [2024-10-11 01:51:40,035 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 6 states have internal predecessors, (12), 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-10-11 01:51:40,035 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 213 transitions. [2024-10-11 01:51:40,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-10-11 01:51:40,036 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 01:51:40,036 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 01:51:40,036 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-11 01:51:40,036 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 01:51:40,037 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 01:51:40,037 INFO L85 PathProgramCache]: Analyzing trace with hash 476832532, now seen corresponding path program 1 times [2024-10-11 01:51:40,037 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 01:51:40,037 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [416700604] [2024-10-11 01:51:40,037 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 01:51:40,037 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 01:51:40,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:51:40,058 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-11 01:51:40,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:51:40,061 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 01:51:40,061 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 01:51:40,061 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [416700604] [2024-10-11 01:51:40,062 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [416700604] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 01:51:40,062 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 01:51:40,062 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 01:51:40,062 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1553147314] [2024-10-11 01:51:40,062 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 01:51:40,062 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 01:51:40,063 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 01:51:40,063 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 01:51:40,063 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 01:51:40,064 INFO L87 Difference]: Start difference. First operand 136 states and 213 transitions. Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 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-10-11 01:51:40,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 01:51:40,115 INFO L93 Difference]: Finished difference Result 273 states and 435 transitions. [2024-10-11 01:51:40,116 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 01:51:40,116 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 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 15 [2024-10-11 01:51:40,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 01:51:40,119 INFO L225 Difference]: With dead ends: 273 [2024-10-11 01:51:40,119 INFO L226 Difference]: Without dead ends: 204 [2024-10-11 01:51:40,121 INFO L431 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-10-11 01:51:40,123 INFO L432 NwaCegarLoop]: 71 mSDtfsCounter, 11 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 120 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 01:51:40,123 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 120 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 01:51:40,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 204 states. [2024-10-11 01:51:40,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 204 to 204. [2024-10-11 01:51:40,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 204 states, 98 states have (on average 1.4081632653061225) internal successors, (138), 102 states have internal predecessors, (138), 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-10-11 01:51:40,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 204 states and 334 transitions. [2024-10-11 01:51:40,176 INFO L78 Accepts]: Start accepts. Automaton has 204 states and 334 transitions. Word has length 15 [2024-10-11 01:51:40,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 01:51:40,176 INFO L471 AbstractCegarLoop]: Abstraction has 204 states and 334 transitions. [2024-10-11 01:51:40,177 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 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-10-11 01:51:40,177 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 334 transitions. [2024-10-11 01:51:40,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-10-11 01:51:40,177 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 01:51:40,178 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 01:51:40,178 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-11 01:51:40,178 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 01:51:40,178 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 01:51:40,179 INFO L85 PathProgramCache]: Analyzing trace with hash 843192835, now seen corresponding path program 1 times [2024-10-11 01:51:40,179 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 01:51:40,179 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1658321259] [2024-10-11 01:51:40,179 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 01:51:40,179 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 01:51:40,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:51:40,222 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-11 01:51:40,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:51:40,225 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 01:51:40,225 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 01:51:40,225 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1658321259] [2024-10-11 01:51:40,226 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1658321259] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 01:51:40,226 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 01:51:40,226 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 01:51:40,226 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2056222469] [2024-10-11 01:51:40,226 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 01:51:40,227 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 01:51:40,227 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 01:51:40,227 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 01:51:40,228 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-11 01:51:40,228 INFO L87 Difference]: Start difference. First operand 204 states and 334 transitions. Second operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 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-10-11 01:51:40,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 01:51:40,308 INFO L93 Difference]: Finished difference Result 228 states and 357 transitions. [2024-10-11 01:51:40,309 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 01:51:40,309 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 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 15 [2024-10-11 01:51:40,309 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 01:51:40,311 INFO L225 Difference]: With dead ends: 228 [2024-10-11 01:51:40,311 INFO L226 Difference]: Without dead ends: 182 [2024-10-11 01:51:40,312 INFO L431 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-10-11 01:51:40,313 INFO L432 NwaCegarLoop]: 52 mSDtfsCounter, 3 mSDsluCounter, 126 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 178 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 01:51:40,314 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 178 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 01:51:40,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2024-10-11 01:51:40,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 182. [2024-10-11 01:51:40,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 182 states, 88 states have (on average 1.3977272727272727) internal successors, (123), 92 states have internal predecessors, (123), 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-10-11 01:51:40,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 295 transitions. [2024-10-11 01:51:40,362 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 295 transitions. Word has length 15 [2024-10-11 01:51:40,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 01:51:40,362 INFO L471 AbstractCegarLoop]: Abstraction has 182 states and 295 transitions. [2024-10-11 01:51:40,363 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 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-10-11 01:51:40,363 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 295 transitions. [2024-10-11 01:51:40,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-10-11 01:51:40,363 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 01:51:40,364 INFO L215 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 01:51:40,367 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-11 01:51:40,367 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 01:51:40,367 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 01:51:40,367 INFO L85 PathProgramCache]: Analyzing trace with hash 1745067101, now seen corresponding path program 1 times [2024-10-11 01:51:40,367 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 01:51:40,368 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [140417549] [2024-10-11 01:51:40,368 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 01:51:40,368 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 01:51:40,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:51:40,439 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-11 01:51:40,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:51:40,443 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-11 01:51:40,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:51:40,447 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-11 01:51:40,447 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 01:51:40,447 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [140417549] [2024-10-11 01:51:40,447 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [140417549] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 01:51:40,447 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 01:51:40,447 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 01:51:40,448 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2046985450] [2024-10-11 01:51:40,448 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 01:51:40,448 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 01:51:40,448 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 01:51:40,449 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 01:51:40,449 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-11 01:51:40,449 INFO L87 Difference]: Start difference. First operand 182 states and 295 transitions. Second operand has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 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-10-11 01:51:40,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 01:51:40,593 INFO L93 Difference]: Finished difference Result 216 states and 347 transitions. [2024-10-11 01:51:40,593 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 01:51:40,593 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 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 22 [2024-10-11 01:51:40,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 01:51:40,595 INFO L225 Difference]: With dead ends: 216 [2024-10-11 01:51:40,596 INFO L226 Difference]: Without dead ends: 214 [2024-10-11 01:51:40,596 INFO L431 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-10-11 01:51:40,597 INFO L432 NwaCegarLoop]: 43 mSDtfsCounter, 41 mSDsluCounter, 180 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 223 SdHoareTripleChecker+Invalid, 93 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 01:51:40,597 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 223 Invalid, 93 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 01:51:40,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214 states. [2024-10-11 01:51:40,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214 to 196. [2024-10-11 01:51:40,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 196 states, 95 states have (on average 1.3894736842105264) internal successors, (132), 101 states have internal predecessors, (132), 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-10-11 01:51:40,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 316 transitions. [2024-10-11 01:51:40,646 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 316 transitions. Word has length 22 [2024-10-11 01:51:40,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 01:51:40,648 INFO L471 AbstractCegarLoop]: Abstraction has 196 states and 316 transitions. [2024-10-11 01:51:40,648 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 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-10-11 01:51:40,648 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 316 transitions. [2024-10-11 01:51:40,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-10-11 01:51:40,650 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 01:51:40,650 INFO L215 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 01:51:40,650 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-11 01:51:40,651 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 01:51:40,651 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 01:51:40,652 INFO L85 PathProgramCache]: Analyzing trace with hash -790320915, now seen corresponding path program 1 times [2024-10-11 01:51:40,653 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 01:51:40,653 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1484999213] [2024-10-11 01:51:40,653 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 01:51:40,653 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 01:51:40,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:51:40,717 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-11 01:51:40,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:51:40,720 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-11 01:51:40,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:51:40,722 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-11 01:51:40,723 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 01:51:40,723 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1484999213] [2024-10-11 01:51:40,723 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1484999213] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 01:51:40,723 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 01:51:40,723 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 01:51:40,724 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2108780581] [2024-10-11 01:51:40,724 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 01:51:40,724 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 01:51:40,724 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 01:51:40,725 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 01:51:40,725 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-11 01:51:40,725 INFO L87 Difference]: Start difference. First operand 196 states and 316 transitions. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 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-10-11 01:51:40,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 01:51:40,967 INFO L93 Difference]: Finished difference Result 519 states and 853 transitions. [2024-10-11 01:51:40,968 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 01:51:40,968 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 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 24 [2024-10-11 01:51:40,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 01:51:40,972 INFO L225 Difference]: With dead ends: 519 [2024-10-11 01:51:40,972 INFO L226 Difference]: Without dead ends: 365 [2024-10-11 01:51:40,974 INFO L431 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-10-11 01:51:40,974 INFO L432 NwaCegarLoop]: 39 mSDtfsCounter, 83 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 89 mSolverCounterSat, 80 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 113 SdHoareTripleChecker+Valid, 92 SdHoareTripleChecker+Invalid, 169 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 80 IncrementalHoareTripleChecker+Valid, 89 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 01:51:40,975 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [113 Valid, 92 Invalid, 169 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [80 Valid, 89 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 01:51:40,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 365 states. [2024-10-11 01:51:41,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 365 to 196. [2024-10-11 01:51:41,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 196 states, 95 states have (on average 1.368421052631579) internal successors, (130), 101 states have internal predecessors, (130), 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-10-11 01:51:41,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 314 transitions. [2024-10-11 01:51:41,033 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 314 transitions. Word has length 24 [2024-10-11 01:51:41,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 01:51:41,033 INFO L471 AbstractCegarLoop]: Abstraction has 196 states and 314 transitions. [2024-10-11 01:51:41,033 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 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-10-11 01:51:41,034 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 314 transitions. [2024-10-11 01:51:41,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-10-11 01:51:41,034 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 01:51:41,034 INFO L215 NwaCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 01:51:41,034 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-11 01:51:41,034 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 01:51:41,035 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 01:51:41,035 INFO L85 PathProgramCache]: Analyzing trace with hash -1386762239, now seen corresponding path program 1 times [2024-10-11 01:51:41,035 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 01:51:41,035 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [350771788] [2024-10-11 01:51:41,035 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 01:51:41,035 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 01:51:41,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:51:41,097 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-11 01:51:41,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:51:41,100 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-11 01:51:41,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:51:41,105 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-11 01:51:41,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:51:41,109 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-11 01:51:41,110 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 01:51:41,110 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [350771788] [2024-10-11 01:51:41,110 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [350771788] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 01:51:41,110 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 01:51:41,110 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 01:51:41,110 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1136129425] [2024-10-11 01:51:41,111 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 01:51:41,111 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 01:51:41,111 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 01:51:41,111 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 01:51:41,112 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-11 01:51:41,112 INFO L87 Difference]: Start difference. First operand 196 states and 314 transitions. Second operand has 6 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 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-10-11 01:51:41,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 01:51:41,290 INFO L93 Difference]: Finished difference Result 290 states and 470 transitions. [2024-10-11 01:51:41,290 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 01:51:41,290 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 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 25 [2024-10-11 01:51:41,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 01:51:41,293 INFO L225 Difference]: With dead ends: 290 [2024-10-11 01:51:41,293 INFO L226 Difference]: Without dead ends: 288 [2024-10-11 01:51:41,293 INFO L431 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-10-11 01:51:41,294 INFO L432 NwaCegarLoop]: 65 mSDtfsCounter, 25 mSDsluCounter, 168 mSDsCounter, 0 mSdLazyCounter, 102 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 233 SdHoareTripleChecker+Invalid, 122 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 102 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 01:51:41,294 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 233 Invalid, 122 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 102 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 01:51:41,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 288 states. [2024-10-11 01:51:41,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 288 to 268. [2024-10-11 01:51:41,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 268 states, 117 states have (on average 1.3675213675213675) internal successors, (160), 131 states have internal predecessors, (160), 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-10-11 01:51:41,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 268 states to 268 states and 440 transitions. [2024-10-11 01:51:41,347 INFO L78 Accepts]: Start accepts. Automaton has 268 states and 440 transitions. Word has length 25 [2024-10-11 01:51:41,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 01:51:41,348 INFO L471 AbstractCegarLoop]: Abstraction has 268 states and 440 transitions. [2024-10-11 01:51:41,348 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 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-10-11 01:51:41,348 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 440 transitions. [2024-10-11 01:51:41,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-10-11 01:51:41,349 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 01:51:41,349 INFO L215 NwaCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 01:51:41,349 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-11 01:51:41,349 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 01:51:41,350 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 01:51:41,350 INFO L85 PathProgramCache]: Analyzing trace with hash 195962487, now seen corresponding path program 1 times [2024-10-11 01:51:41,350 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 01:51:41,351 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1316941691] [2024-10-11 01:51:41,351 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 01:51:41,351 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 01:51:41,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:51:41,426 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-11 01:51:41,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:51:41,429 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-11 01:51:41,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:51:41,431 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 01:51:41,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:51:41,434 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-11 01:51:41,434 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 01:51:41,434 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1316941691] [2024-10-11 01:51:41,434 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1316941691] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 01:51:41,434 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 01:51:41,434 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 01:51:41,435 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [345846991] [2024-10-11 01:51:41,435 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 01:51:41,435 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 01:51:41,435 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 01:51:41,436 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 01:51:41,436 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 01:51:41,436 INFO L87 Difference]: Start difference. First operand 268 states and 440 transitions. Second operand has 7 states, 7 states have (on average 2.0) internal successors, (14), 6 states have internal predecessors, (14), 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-10-11 01:51:41,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 01:51:41,670 INFO L93 Difference]: Finished difference Result 316 states and 515 transitions. [2024-10-11 01:51:41,671 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 01:51:41,671 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.0) internal successors, (14), 6 states have internal predecessors, (14), 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 27 [2024-10-11 01:51:41,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 01:51:41,674 INFO L225 Difference]: With dead ends: 316 [2024-10-11 01:51:41,674 INFO L226 Difference]: Without dead ends: 314 [2024-10-11 01:51:41,674 INFO L431 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-10-11 01:51:41,675 INFO L432 NwaCegarLoop]: 45 mSDtfsCounter, 71 mSDsluCounter, 142 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 74 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 187 SdHoareTripleChecker+Invalid, 151 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 74 IncrementalHoareTripleChecker+Valid, 77 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 01:51:41,675 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 187 Invalid, 151 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [74 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 01:51:41,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 314 states. [2024-10-11 01:51:41,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 314 to 286. [2024-10-11 01:51:41,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 286 states, 124 states have (on average 1.3629032258064515) internal successors, (169), 140 states have internal predecessors, (169), 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-10-11 01:51:41,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 286 states to 286 states and 469 transitions. [2024-10-11 01:51:41,732 INFO L78 Accepts]: Start accepts. Automaton has 286 states and 469 transitions. Word has length 27 [2024-10-11 01:51:41,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 01:51:41,733 INFO L471 AbstractCegarLoop]: Abstraction has 286 states and 469 transitions. [2024-10-11 01:51:41,733 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.0) internal successors, (14), 6 states have internal predecessors, (14), 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-10-11 01:51:41,733 INFO L276 IsEmpty]: Start isEmpty. Operand 286 states and 469 transitions. [2024-10-11 01:51:41,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-10-11 01:51:41,734 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 01:51:41,734 INFO L215 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] [2024-10-11 01:51:41,734 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-11 01:51:41,734 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 01:51:41,735 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 01:51:41,735 INFO L85 PathProgramCache]: Analyzing trace with hash -298962274, now seen corresponding path program 1 times [2024-10-11 01:51:41,735 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 01:51:41,735 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1778147530] [2024-10-11 01:51:41,735 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 01:51:41,735 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 01:51:41,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:51:41,798 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-11 01:51:41,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:51:41,802 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-11 01:51:41,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:51:41,804 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-11 01:51:41,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:51:41,809 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-11 01:51:41,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:51:41,811 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-11 01:51:41,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:51:41,815 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2024-10-11 01:51:41,817 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 01:51:41,817 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1778147530] [2024-10-11 01:51:41,817 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1778147530] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 01:51:41,817 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 01:51:41,817 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 01:51:41,817 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [790965228] [2024-10-11 01:51:41,818 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 01:51:41,818 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 01:51:41,818 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 01:51:41,818 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 01:51:41,819 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-11 01:51:41,819 INFO L87 Difference]: Start difference. First operand 286 states and 469 transitions. Second operand has 7 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 states have internal predecessors, (14), 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-10-11 01:51:42,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 01:51:42,056 INFO L93 Difference]: Finished difference Result 328 states and 526 transitions. [2024-10-11 01:51:42,057 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 01:51:42,057 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 states have internal predecessors, (14), 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 37 [2024-10-11 01:51:42,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 01:51:42,059 INFO L225 Difference]: With dead ends: 328 [2024-10-11 01:51:42,060 INFO L226 Difference]: Without dead ends: 326 [2024-10-11 01:51:42,060 INFO L431 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-10-11 01:51:42,061 INFO L432 NwaCegarLoop]: 62 mSDtfsCounter, 35 mSDsluCounter, 196 mSDsCounter, 0 mSdLazyCounter, 128 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 258 SdHoareTripleChecker+Invalid, 169 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 128 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 01:51:42,061 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 258 Invalid, 169 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 128 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 01:51:42,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 326 states. [2024-10-11 01:51:42,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 326 to 290. [2024-10-11 01:51:42,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 290 states, 127 states have (on average 1.3543307086614174) internal successors, (172), 143 states have internal predecessors, (172), 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-10-11 01:51:42,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 290 states to 290 states and 472 transitions. [2024-10-11 01:51:42,121 INFO L78 Accepts]: Start accepts. Automaton has 290 states and 472 transitions. Word has length 37 [2024-10-11 01:51:42,121 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 01:51:42,121 INFO L471 AbstractCegarLoop]: Abstraction has 290 states and 472 transitions. [2024-10-11 01:51:42,122 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 states have internal predecessors, (14), 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-10-11 01:51:42,122 INFO L276 IsEmpty]: Start isEmpty. Operand 290 states and 472 transitions. [2024-10-11 01:51:42,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-10-11 01:51:42,123 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 01:51:42,123 INFO L215 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] [2024-10-11 01:51:42,123 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-11 01:51:42,123 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 01:51:42,123 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 01:51:42,123 INFO L85 PathProgramCache]: Analyzing trace with hash 1033855744, now seen corresponding path program 1 times [2024-10-11 01:51:42,124 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 01:51:42,124 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1005147520] [2024-10-11 01:51:42,124 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 01:51:42,124 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 01:51:42,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:51:42,180 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-11 01:51:42,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:51:42,182 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-11 01:51:42,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:51:42,183 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-11 01:51:42,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:51:42,186 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 01:51:42,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:51:42,188 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-10-11 01:51:42,188 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 01:51:42,188 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1005147520] [2024-10-11 01:51:42,188 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1005147520] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 01:51:42,189 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 01:51:42,189 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 01:51:42,189 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1992272193] [2024-10-11 01:51:42,189 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 01:51:42,189 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 01:51:42,189 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 01:51:42,190 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 01:51:42,190 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-11 01:51:42,190 INFO L87 Difference]: Start difference. First operand 290 states and 472 transitions. Second operand has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 6 states have internal predecessors, (19), 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-10-11 01:51:42,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 01:51:42,381 INFO L93 Difference]: Finished difference Result 312 states and 501 transitions. [2024-10-11 01:51:42,382 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-11 01:51:42,382 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 6 states have internal predecessors, (19), 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 37 [2024-10-11 01:51:42,382 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 01:51:42,385 INFO L225 Difference]: With dead ends: 312 [2024-10-11 01:51:42,385 INFO L226 Difference]: Without dead ends: 310 [2024-10-11 01:51:42,385 INFO L431 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-10-11 01:51:42,386 INFO L432 NwaCegarLoop]: 33 mSDtfsCounter, 29 mSDsluCounter, 114 mSDsCounter, 0 mSdLazyCounter, 108 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 147 SdHoareTripleChecker+Invalid, 143 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 108 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 01:51:42,387 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 147 Invalid, 143 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 108 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 01:51:42,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 310 states. [2024-10-11 01:51:42,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 310 to 294. [2024-10-11 01:51:42,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 294 states, 130 states have (on average 1.3461538461538463) internal successors, (175), 146 states have internal predecessors, (175), 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-10-11 01:51:42,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 294 states to 294 states and 475 transitions. [2024-10-11 01:51:42,462 INFO L78 Accepts]: Start accepts. Automaton has 294 states and 475 transitions. Word has length 37 [2024-10-11 01:51:42,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 01:51:42,462 INFO L471 AbstractCegarLoop]: Abstraction has 294 states and 475 transitions. [2024-10-11 01:51:42,462 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 6 states have internal predecessors, (19), 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-10-11 01:51:42,463 INFO L276 IsEmpty]: Start isEmpty. Operand 294 states and 475 transitions. [2024-10-11 01:51:42,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2024-10-11 01:51:42,463 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 01:51:42,464 INFO L215 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] [2024-10-11 01:51:42,464 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-11 01:51:42,464 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 01:51:42,464 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 01:51:42,464 INFO L85 PathProgramCache]: Analyzing trace with hash -285091126, now seen corresponding path program 1 times [2024-10-11 01:51:42,465 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 01:51:42,465 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1881794362] [2024-10-11 01:51:42,465 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 01:51:42,465 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 01:51:42,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:51:42,544 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-11 01:51:42,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:51:42,547 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-11 01:51:42,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:51:42,550 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-11 01:51:42,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:51:42,552 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 01:51:42,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:51:42,555 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-10-11 01:51:42,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:51:42,557 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-11 01:51:42,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:51:42,560 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2024-10-11 01:51:42,560 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 01:51:42,560 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1881794362] [2024-10-11 01:51:42,560 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1881794362] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 01:51:42,560 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 01:51:42,560 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 01:51:42,560 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [528434748] [2024-10-11 01:51:42,560 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 01:51:42,561 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 01:51:42,561 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 01:51:42,561 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 01:51:42,562 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-11 01:51:42,562 INFO L87 Difference]: Start difference. First operand 294 states and 475 transitions. Second operand has 7 states, 7 states have (on average 3.0) internal successors, (21), 6 states have internal predecessors, (21), 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-10-11 01:51:42,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 01:51:42,704 INFO L93 Difference]: Finished difference Result 328 states and 524 transitions. [2024-10-11 01:51:42,705 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-11 01:51:42,706 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.0) internal successors, (21), 6 states have internal predecessors, (21), 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 49 [2024-10-11 01:51:42,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 01:51:42,708 INFO L225 Difference]: With dead ends: 328 [2024-10-11 01:51:42,709 INFO L226 Difference]: Without dead ends: 326 [2024-10-11 01:51:42,709 INFO L431 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-10-11 01:51:42,710 INFO L432 NwaCegarLoop]: 45 mSDtfsCounter, 40 mSDsluCounter, 148 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 193 SdHoareTripleChecker+Invalid, 105 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 77 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 01:51:42,711 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 193 Invalid, 105 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 01:51:42,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 326 states. [2024-10-11 01:51:42,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 326 to 173. [2024-10-11 01:51:42,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 173 states, 84 states have (on average 1.2738095238095237) internal successors, (107), 92 states have internal predecessors, (107), 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-10-11 01:51:42,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 259 transitions. [2024-10-11 01:51:42,761 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 259 transitions. Word has length 49 [2024-10-11 01:51:42,761 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 01:51:42,761 INFO L471 AbstractCegarLoop]: Abstraction has 173 states and 259 transitions. [2024-10-11 01:51:42,762 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.0) internal successors, (21), 6 states have internal predecessors, (21), 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-10-11 01:51:42,762 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 259 transitions. [2024-10-11 01:51:42,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2024-10-11 01:51:42,763 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 01:51:42,763 INFO L215 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] [2024-10-11 01:51:42,764 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-11 01:51:42,764 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 01:51:42,765 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 01:51:42,765 INFO L85 PathProgramCache]: Analyzing trace with hash -1647948154, now seen corresponding path program 1 times [2024-10-11 01:51:42,765 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 01:51:42,765 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1210182103] [2024-10-11 01:51:42,765 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 01:51:42,765 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 01:51:42,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:51:42,856 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-11 01:51:42,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:51:42,862 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-11 01:51:42,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:51:42,865 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 01:51:42,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:51:42,867 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-11 01:51:42,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:51:42,870 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-11 01:51:42,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:51:42,872 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-10-11 01:51:42,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:51:42,874 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-11 01:51:42,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:51:42,877 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 01:51:42,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:51:42,879 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 16 proven. 7 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2024-10-11 01:51:42,880 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 01:51:42,880 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1210182103] [2024-10-11 01:51:42,880 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1210182103] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 01:51:42,880 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [71672107] [2024-10-11 01:51:42,880 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 01:51:42,880 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 01:51:42,881 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 01:51:42,882 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 01:51:42,884 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-11 01:51:42,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:51:42,947 INFO L255 TraceCheckSpWp]: Trace formula consists of 130 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-11 01:51:42,952 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 01:51:43,057 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 67 proven. 0 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2024-10-11 01:51:43,057 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 01:51:43,057 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [71672107] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 01:51:43,057 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 01:51:43,057 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [7] total 9 [2024-10-11 01:51:43,058 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [775318943] [2024-10-11 01:51:43,058 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 01:51:43,058 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 01:51:43,058 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 01:51:43,059 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 01:51:43,059 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-10-11 01:51:43,059 INFO L87 Difference]: Start difference. First operand 173 states and 259 transitions. Second operand has 6 states, 6 states have (on average 3.5) internal successors, (21), 6 states have internal predecessors, (21), 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-10-11 01:51:43,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 01:51:43,270 INFO L93 Difference]: Finished difference Result 500 states and 794 transitions. [2024-10-11 01:51:43,270 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-11 01:51:43,270 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.5) internal successors, (21), 6 states have internal predecessors, (21), 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 57 [2024-10-11 01:51:43,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 01:51:43,273 INFO L225 Difference]: With dead ends: 500 [2024-10-11 01:51:43,273 INFO L226 Difference]: Without dead ends: 330 [2024-10-11 01:51:43,274 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 72 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-10-11 01:51:43,274 INFO L432 NwaCegarLoop]: 39 mSDtfsCounter, 41 mSDsluCounter, 93 mSDsCounter, 0 mSdLazyCounter, 82 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 132 SdHoareTripleChecker+Invalid, 131 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 82 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 01:51:43,275 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 132 Invalid, 131 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 82 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 01:51:43,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 330 states. [2024-10-11 01:51:43,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 330 to 310. [2024-10-11 01:51:43,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 310 states, 135 states have (on average 1.348148148148148) internal successors, (182), 151 states have internal predecessors, (182), 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-10-11 01:51:43,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 310 states to 310 states and 506 transitions. [2024-10-11 01:51:43,356 INFO L78 Accepts]: Start accepts. Automaton has 310 states and 506 transitions. Word has length 57 [2024-10-11 01:51:43,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 01:51:43,357 INFO L471 AbstractCegarLoop]: Abstraction has 310 states and 506 transitions. [2024-10-11 01:51:43,357 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.5) internal successors, (21), 6 states have internal predecessors, (21), 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-10-11 01:51:43,357 INFO L276 IsEmpty]: Start isEmpty. Operand 310 states and 506 transitions. [2024-10-11 01:51:43,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2024-10-11 01:51:43,358 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 01:51:43,359 INFO L215 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] [2024-10-11 01:51:43,373 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-11 01:51:43,562 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2024-10-11 01:51:43,563 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 01:51:43,563 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 01:51:43,563 INFO L85 PathProgramCache]: Analyzing trace with hash 242531336, now seen corresponding path program 1 times [2024-10-11 01:51:43,563 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 01:51:43,563 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [38903685] [2024-10-11 01:51:43,563 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 01:51:43,564 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 01:51:43,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:51:43,656 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-11 01:51:43,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:51:43,659 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-11 01:51:43,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:51:43,661 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-11 01:51:43,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:51:43,663 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-11 01:51:43,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:51:43,665 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-11 01:51:43,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:51:43,667 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-10-11 01:51:43,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:51:43,669 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 01:51:43,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:51:43,672 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-11 01:51:43,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:51:43,674 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-11 01:51:43,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:51:43,676 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-10-11 01:51:43,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:51:43,678 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-11 01:51:43,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:51:43,680 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 01:51:43,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:51:43,683 INFO L134 CoverageAnalysis]: Checked inductivity of 295 backedges. 24 proven. 7 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-10-11 01:51:43,683 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 01:51:43,683 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [38903685] [2024-10-11 01:51:43,683 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [38903685] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 01:51:43,683 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1668611799] [2024-10-11 01:51:43,684 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 01:51:43,684 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 01:51:43,684 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 01:51:43,685 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 01:51:43,686 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-11 01:51:43,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:51:43,741 INFO L255 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-10-11 01:51:43,743 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 01:51:43,962 INFO L134 CoverageAnalysis]: Checked inductivity of 295 backedges. 107 proven. 0 refuted. 0 times theorem prover too weak. 188 trivial. 0 not checked. [2024-10-11 01:51:43,962 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 01:51:43,963 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1668611799] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 01:51:43,963 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 01:51:43,963 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [8] total 13 [2024-10-11 01:51:43,963 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [555211916] [2024-10-11 01:51:43,963 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 01:51:43,964 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 01:51:43,964 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 01:51:43,964 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 01:51:43,964 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2024-10-11 01:51:43,965 INFO L87 Difference]: Start difference. First operand 310 states and 506 transitions. Second operand has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 7 states have internal predecessors, (23), 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-10-11 01:51:44,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 01:51:44,278 INFO L93 Difference]: Finished difference Result 577 states and 924 transitions. [2024-10-11 01:51:44,279 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-11 01:51:44,279 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 7 states have internal predecessors, (23), 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 79 [2024-10-11 01:51:44,279 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 01:51:44,282 INFO L225 Difference]: With dead ends: 577 [2024-10-11 01:51:44,282 INFO L226 Difference]: Without dead ends: 301 [2024-10-11 01:51:44,283 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 99 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-10-11 01:51:44,284 INFO L432 NwaCegarLoop]: 62 mSDtfsCounter, 30 mSDsluCounter, 169 mSDsCounter, 0 mSdLazyCounter, 161 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 231 SdHoareTripleChecker+Invalid, 195 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 161 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 01:51:44,284 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 231 Invalid, 195 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 161 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 01:51:44,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 301 states. [2024-10-11 01:51:44,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 301 to 266. [2024-10-11 01:51:44,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 266 states, 123 states have (on average 1.3170731707317074) internal successors, (162), 135 states have internal predecessors, (162), 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-10-11 01:51:44,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 266 states to 266 states and 422 transitions. [2024-10-11 01:51:44,366 INFO L78 Accepts]: Start accepts. Automaton has 266 states and 422 transitions. Word has length 79 [2024-10-11 01:51:44,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 01:51:44,366 INFO L471 AbstractCegarLoop]: Abstraction has 266 states and 422 transitions. [2024-10-11 01:51:44,366 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 7 states have internal predecessors, (23), 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-10-11 01:51:44,366 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 422 transitions. [2024-10-11 01:51:44,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2024-10-11 01:51:44,368 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 01:51:44,368 INFO L215 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] [2024-10-11 01:51:44,385 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-10-11 01:51:44,569 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2024-10-11 01:51:44,569 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 01:51:44,569 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 01:51:44,570 INFO L85 PathProgramCache]: Analyzing trace with hash 1780871366, now seen corresponding path program 1 times [2024-10-11 01:51:44,570 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 01:51:44,570 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1083913890] [2024-10-11 01:51:44,570 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 01:51:44,570 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 01:51:44,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:51:44,652 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-11 01:51:44,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:51:44,655 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-11 01:51:44,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:51:44,658 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-11 01:51:44,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:51:44,661 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-11 01:51:44,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:51:44,664 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-11 01:51:44,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:51:44,666 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-10-11 01:51:44,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:51:44,669 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 01:51:44,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:51:44,671 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-11 01:51:44,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:51:44,674 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-11 01:51:44,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:51:44,676 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-10-11 01:51:44,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:51:44,679 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-11 01:51:44,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:51:44,681 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 01:51:44,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:51:44,683 INFO L134 CoverageAnalysis]: Checked inductivity of 295 backedges. 24 proven. 7 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-10-11 01:51:44,685 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 01:51:44,685 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1083913890] [2024-10-11 01:51:44,685 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1083913890] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 01:51:44,685 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1669722070] [2024-10-11 01:51:44,685 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 01:51:44,685 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 01:51:44,686 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 01:51:44,687 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 01:51:44,689 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-10-11 01:51:44,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:51:44,743 INFO L255 TraceCheckSpWp]: Trace formula consists of 170 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-10-11 01:51:44,745 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 01:51:44,910 INFO L134 CoverageAnalysis]: Checked inductivity of 295 backedges. 107 proven. 0 refuted. 0 times theorem prover too weak. 188 trivial. 0 not checked. [2024-10-11 01:51:44,910 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 01:51:44,911 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1669722070] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 01:51:44,912 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 01:51:44,912 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [7] total 11 [2024-10-11 01:51:44,912 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [40034554] [2024-10-11 01:51:44,912 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 01:51:44,912 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 01:51:44,913 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 01:51:44,913 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 01:51:44,913 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2024-10-11 01:51:44,913 INFO L87 Difference]: Start difference. First operand 266 states and 422 transitions. Second operand has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 6 states have internal predecessors, (23), 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-10-11 01:51:45,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 01:51:45,136 INFO L93 Difference]: Finished difference Result 495 states and 778 transitions. [2024-10-11 01:51:45,137 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 01:51:45,137 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 6 states have internal predecessors, (23), 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 79 [2024-10-11 01:51:45,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 01:51:45,139 INFO L225 Difference]: With dead ends: 495 [2024-10-11 01:51:45,140 INFO L226 Difference]: Without dead ends: 219 [2024-10-11 01:51:45,141 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 100 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-10-11 01:51:45,142 INFO L432 NwaCegarLoop]: 39 mSDtfsCounter, 21 mSDsluCounter, 104 mSDsCounter, 0 mSdLazyCounter, 99 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 143 SdHoareTripleChecker+Invalid, 121 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 99 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 01:51:45,142 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 143 Invalid, 121 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 99 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 01:51:45,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2024-10-11 01:51:45,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 209. [2024-10-11 01:51:45,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 209 states, 98 states have (on average 1.2857142857142858) internal successors, (126), 108 states have internal predecessors, (126), 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-10-11 01:51:45,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 322 transitions. [2024-10-11 01:51:45,200 INFO L78 Accepts]: Start accepts. Automaton has 209 states and 322 transitions. Word has length 79 [2024-10-11 01:51:45,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 01:51:45,201 INFO L471 AbstractCegarLoop]: Abstraction has 209 states and 322 transitions. [2024-10-11 01:51:45,201 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 6 states have internal predecessors, (23), 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-10-11 01:51:45,201 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 322 transitions. [2024-10-11 01:51:45,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2024-10-11 01:51:45,202 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 01:51:45,203 INFO L215 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] [2024-10-11 01:51:45,220 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-10-11 01:51:45,406 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17,4 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 01:51:45,407 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 01:51:45,407 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 01:51:45,407 INFO L85 PathProgramCache]: Analyzing trace with hash 345657593, now seen corresponding path program 1 times [2024-10-11 01:51:45,407 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 01:51:45,408 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1673094779] [2024-10-11 01:51:45,408 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 01:51:45,408 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 01:51:45,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:51:45,525 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-11 01:51:45,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:51:45,528 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-11 01:51:45,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:51:45,529 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-11 01:51:45,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:51:45,531 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 01:51:45,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:51:45,533 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-10-11 01:51:45,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:51:45,535 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-11 01:51:45,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:51:45,537 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-11 01:51:45,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:51:45,538 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-11 01:51:45,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:51:45,540 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-10-11 01:51:45,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:51:45,542 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-10-11 01:51:45,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:51:45,544 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 01:51:45,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:51:45,547 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-11 01:51:45,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:51:45,549 INFO L134 CoverageAnalysis]: Checked inductivity of 308 backedges. 37 proven. 7 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-10-11 01:51:45,549 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 01:51:45,550 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1673094779] [2024-10-11 01:51:45,550 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1673094779] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 01:51:45,550 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [498207132] [2024-10-11 01:51:45,551 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 01:51:45,551 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 01:51:45,551 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 01:51:45,552 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 01:51:45,554 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-10-11 01:51:45,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:51:45,604 INFO L255 TraceCheckSpWp]: Trace formula consists of 179 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-11 01:51:45,609 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 01:51:45,682 INFO L134 CoverageAnalysis]: Checked inductivity of 308 backedges. 149 proven. 2 refuted. 0 times theorem prover too weak. 157 trivial. 0 not checked. [2024-10-11 01:51:45,682 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 01:51:45,799 INFO L134 CoverageAnalysis]: Checked inductivity of 308 backedges. 37 proven. 2 refuted. 0 times theorem prover too weak. 269 trivial. 0 not checked. [2024-10-11 01:51:45,799 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [498207132] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 01:51:45,799 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 01:51:45,799 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6, 6] total 16 [2024-10-11 01:51:45,800 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [897735930] [2024-10-11 01:51:45,800 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 01:51:45,800 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-10-11 01:51:45,800 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 01:51:45,801 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-10-11 01:51:45,802 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=202, Unknown=0, NotChecked=0, Total=240 [2024-10-11 01:51:45,802 INFO L87 Difference]: Start difference. First operand 209 states and 322 transitions. Second operand has 16 states, 16 states have (on average 3.4375) internal successors, (55), 15 states have internal predecessors, (55), 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-10-11 01:51:47,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 01:51:47,077 INFO L93 Difference]: Finished difference Result 514 states and 774 transitions. [2024-10-11 01:51:47,078 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2024-10-11 01:51:47,078 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 3.4375) internal successors, (55), 15 states have internal predecessors, (55), 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 84 [2024-10-11 01:51:47,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 01:51:47,081 INFO L225 Difference]: With dead ends: 514 [2024-10-11 01:51:47,081 INFO L226 Difference]: Without dead ends: 344 [2024-10-11 01:51:47,082 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 240 GetRequests, 195 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 463 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=549, Invalid=1613, Unknown=0, NotChecked=0, Total=2162 [2024-10-11 01:51:47,083 INFO L432 NwaCegarLoop]: 159 mSDtfsCounter, 195 mSDsluCounter, 960 mSDsCounter, 0 mSdLazyCounter, 854 mSolverCounterSat, 247 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 197 SdHoareTripleChecker+Valid, 1119 SdHoareTripleChecker+Invalid, 1101 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 247 IncrementalHoareTripleChecker+Valid, 854 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-11 01:51:47,083 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [197 Valid, 1119 Invalid, 1101 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [247 Valid, 854 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-11 01:51:47,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 344 states. [2024-10-11 01:51:47,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 344 to 240. [2024-10-11 01:51:47,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 240 states, 120 states have (on average 1.2583333333333333) internal successors, (151), 130 states have internal predecessors, (151), 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-10-11 01:51:47,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 240 states to 240 states and 361 transitions. [2024-10-11 01:51:47,140 INFO L78 Accepts]: Start accepts. Automaton has 240 states and 361 transitions. Word has length 84 [2024-10-11 01:51:47,140 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 01:51:47,141 INFO L471 AbstractCegarLoop]: Abstraction has 240 states and 361 transitions. [2024-10-11 01:51:47,141 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 3.4375) internal successors, (55), 15 states have internal predecessors, (55), 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-10-11 01:51:47,141 INFO L276 IsEmpty]: Start isEmpty. Operand 240 states and 361 transitions. [2024-10-11 01:51:47,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2024-10-11 01:51:47,142 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 01:51:47,142 INFO L215 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] [2024-10-11 01:51:47,158 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-10-11 01:51:47,343 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,5 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 01:51:47,343 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 01:51:47,343 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 01:51:47,343 INFO L85 PathProgramCache]: Analyzing trace with hash -2105137319, now seen corresponding path program 1 times [2024-10-11 01:51:47,344 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 01:51:47,344 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1367510890] [2024-10-11 01:51:47,344 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 01:51:47,344 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 01:51:47,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:51:47,468 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-11 01:51:47,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:51:47,470 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-11 01:51:47,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:51:47,472 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-11 01:51:47,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:51:47,474 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 01:51:47,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:51:47,476 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-10-11 01:51:47,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:51:47,478 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-11 01:51:47,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:51:47,480 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-11 01:51:47,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:51:47,482 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-10-11 01:51:47,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:51:47,485 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-10-11 01:51:47,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:51:47,488 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-10-11 01:51:47,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:51:47,490 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-11 01:51:47,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:51:47,492 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-10-11 01:51:47,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:51:47,496 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-11 01:51:47,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:51:47,500 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-10-11 01:51:47,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:51:47,504 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-11 01:51:47,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:51:47,506 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-11 01:51:47,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:51:47,507 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-11 01:51:47,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:51:47,509 INFO L134 CoverageAnalysis]: Checked inductivity of 599 backedges. 47 proven. 8 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-10-11 01:51:47,509 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 01:51:47,509 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1367510890] [2024-10-11 01:51:47,509 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1367510890] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 01:51:47,509 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1576651376] [2024-10-11 01:51:47,509 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 01:51:47,509 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 01:51:47,509 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 01:51:47,513 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 01:51:47,515 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-10-11 01:51:47,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:51:47,603 INFO L255 TraceCheckSpWp]: Trace formula consists of 229 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-10-11 01:51:47,605 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 01:51:47,798 INFO L134 CoverageAnalysis]: Checked inductivity of 599 backedges. 210 proven. 7 refuted. 0 times theorem prover too weak. 382 trivial. 0 not checked. [2024-10-11 01:51:47,798 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 01:51:47,981 INFO L134 CoverageAnalysis]: Checked inductivity of 599 backedges. 47 proven. 8 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-10-11 01:51:47,982 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1576651376] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 01:51:47,982 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 01:51:47,982 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 21 [2024-10-11 01:51:47,982 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1582232183] [2024-10-11 01:51:47,982 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 01:51:47,983 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2024-10-11 01:51:47,983 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 01:51:47,984 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2024-10-11 01:51:47,984 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=340, Unknown=0, NotChecked=0, Total=420 [2024-10-11 01:51:47,984 INFO L87 Difference]: Start difference. First operand 240 states and 361 transitions. Second operand has 21 states, 21 states have (on average 2.7142857142857144) internal successors, (57), 21 states have internal predecessors, (57), 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-10-11 01:51:49,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 01:51:49,797 INFO L93 Difference]: Finished difference Result 849 states and 1341 transitions. [2024-10-11 01:51:49,798 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2024-10-11 01:51:49,798 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 2.7142857142857144) internal successors, (57), 21 states have internal predecessors, (57), 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 111 [2024-10-11 01:51:49,799 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 01:51:49,803 INFO L225 Difference]: With dead ends: 849 [2024-10-11 01:51:49,803 INFO L226 Difference]: Without dead ends: 482 [2024-10-11 01:51:49,805 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 305 GetRequests, 245 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 967 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=943, Invalid=2839, Unknown=0, NotChecked=0, Total=3782 [2024-10-11 01:51:49,806 INFO L432 NwaCegarLoop]: 152 mSDtfsCounter, 310 mSDsluCounter, 1128 mSDsCounter, 0 mSdLazyCounter, 1268 mSolverCounterSat, 405 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 336 SdHoareTripleChecker+Valid, 1280 SdHoareTripleChecker+Invalid, 1673 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 405 IncrementalHoareTripleChecker+Valid, 1268 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-10-11 01:51:49,806 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [336 Valid, 1280 Invalid, 1673 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [405 Valid, 1268 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-10-11 01:51:49,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 482 states. [2024-10-11 01:51:49,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 482 to 369. [2024-10-11 01:51:49,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 369 states, 169 states have (on average 1.2662721893491125) internal successors, (214), 183 states have internal predecessors, (214), 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-10-11 01:51:49,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 369 states to 369 states and 586 transitions. [2024-10-11 01:51:49,943 INFO L78 Accepts]: Start accepts. Automaton has 369 states and 586 transitions. Word has length 111 [2024-10-11 01:51:49,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 01:51:49,943 INFO L471 AbstractCegarLoop]: Abstraction has 369 states and 586 transitions. [2024-10-11 01:51:49,943 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 2.7142857142857144) internal successors, (57), 21 states have internal predecessors, (57), 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-10-11 01:51:49,943 INFO L276 IsEmpty]: Start isEmpty. Operand 369 states and 586 transitions. [2024-10-11 01:51:49,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2024-10-11 01:51:49,945 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 01:51:49,945 INFO L215 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] [2024-10-11 01:51:49,958 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-10-11 01:51:50,145 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,6 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 01:51:50,146 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 01:51:50,146 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 01:51:50,146 INFO L85 PathProgramCache]: Analyzing trace with hash -844220069, now seen corresponding path program 1 times [2024-10-11 01:51:50,146 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 01:51:50,146 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [282157826] [2024-10-11 01:51:50,146 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 01:51:50,146 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 01:51:50,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:51:50,280 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-11 01:51:50,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:51:50,283 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-11 01:51:50,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:51:50,284 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-11 01:51:50,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:51:50,286 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 01:51:50,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:51:50,288 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-10-11 01:51:50,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:51:50,290 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-11 01:51:50,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:51:50,292 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-11 01:51:50,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:51:50,294 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-10-11 01:51:50,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:51:50,295 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-10-11 01:51:50,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:51:50,297 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-10-11 01:51:50,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:51:50,299 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-11 01:51:50,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:51:50,301 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-10-11 01:51:50,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:51:50,304 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-11 01:51:50,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:51:50,306 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-10-11 01:51:50,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:51:50,307 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-11 01:51:50,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:51:50,309 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-11 01:51:50,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:51:50,311 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-11 01:51:50,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:51:50,314 INFO L134 CoverageAnalysis]: Checked inductivity of 599 backedges. 34 proven. 21 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-10-11 01:51:50,314 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 01:51:50,314 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [282157826] [2024-10-11 01:51:50,314 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [282157826] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 01:51:50,314 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [464847352] [2024-10-11 01:51:50,314 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 01:51:50,314 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 01:51:50,315 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 01:51:50,316 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 01:51:50,317 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-10-11 01:51:50,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:51:50,370 INFO L255 TraceCheckSpWp]: Trace formula consists of 228 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-10-11 01:51:50,372 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 01:51:50,543 INFO L134 CoverageAnalysis]: Checked inductivity of 599 backedges. 34 proven. 21 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-10-11 01:51:50,543 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 01:51:50,730 INFO L134 CoverageAnalysis]: Checked inductivity of 599 backedges. 34 proven. 21 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-10-11 01:51:50,730 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [464847352] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 01:51:50,730 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 01:51:50,730 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 20 [2024-10-11 01:51:50,730 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1365186994] [2024-10-11 01:51:50,730 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 01:51:50,731 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2024-10-11 01:51:50,731 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 01:51:50,732 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2024-10-11 01:51:50,732 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=323, Unknown=0, NotChecked=0, Total=380 [2024-10-11 01:51:50,732 INFO L87 Difference]: Start difference. First operand 369 states and 586 transitions. Second operand has 20 states, 20 states have (on average 3.25) internal successors, (65), 18 states have internal predecessors, (65), 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-10-11 01:51:51,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 01:51:51,882 INFO L93 Difference]: Finished difference Result 856 states and 1367 transitions. [2024-10-11 01:51:51,882 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-10-11 01:51:51,883 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 3.25) internal successors, (65), 18 states have internal predecessors, (65), 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 111 [2024-10-11 01:51:51,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 01:51:51,887 INFO L225 Difference]: With dead ends: 856 [2024-10-11 01:51:51,887 INFO L226 Difference]: Without dead ends: 738 [2024-10-11 01:51:51,888 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 283 GetRequests, 244 SyntacticMatches, 2 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 286 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=363, Invalid=1119, Unknown=0, NotChecked=0, Total=1482 [2024-10-11 01:51:51,888 INFO L432 NwaCegarLoop]: 78 mSDtfsCounter, 313 mSDsluCounter, 580 mSDsCounter, 0 mSdLazyCounter, 564 mSolverCounterSat, 435 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 313 SdHoareTripleChecker+Valid, 658 SdHoareTripleChecker+Invalid, 999 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 435 IncrementalHoareTripleChecker+Valid, 564 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-11 01:51:51,888 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [313 Valid, 658 Invalid, 999 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [435 Valid, 564 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-11 01:51:51,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 738 states. [2024-10-11 01:51:52,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 738 to 413. [2024-10-11 01:51:52,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 413 states, 184 states have (on average 1.2771739130434783) internal successors, (235), 206 states have internal predecessors, (235), 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-10-11 01:51:52,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 413 states to 413 states and 659 transitions. [2024-10-11 01:51:52,044 INFO L78 Accepts]: Start accepts. Automaton has 413 states and 659 transitions. Word has length 111 [2024-10-11 01:51:52,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 01:51:52,044 INFO L471 AbstractCegarLoop]: Abstraction has 413 states and 659 transitions. [2024-10-11 01:51:52,044 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 3.25) internal successors, (65), 18 states have internal predecessors, (65), 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-10-11 01:51:52,045 INFO L276 IsEmpty]: Start isEmpty. Operand 413 states and 659 transitions. [2024-10-11 01:51:52,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2024-10-11 01:51:52,049 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 01:51:52,049 INFO L215 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] [2024-10-11 01:51:52,065 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-10-11 01:51:52,249 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2024-10-11 01:51:52,250 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 01:51:52,250 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 01:51:52,250 INFO L85 PathProgramCache]: Analyzing trace with hash 1492040008, now seen corresponding path program 2 times [2024-10-11 01:51:52,250 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 01:51:52,250 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [667598226] [2024-10-11 01:51:52,250 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 01:51:52,251 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 01:51:52,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:51:52,463 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-11 01:51:52,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:51:52,465 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-11 01:51:52,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:51:52,467 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-11 01:51:52,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:51:52,470 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-11 01:51:52,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:51:52,471 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-11 01:51:52,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:51:52,473 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-10-11 01:51:52,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:51:52,475 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-11 01:51:52,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:51:52,477 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 01:51:52,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:51:52,479 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-10-11 01:51:52,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:51:52,482 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-10-11 01:51:52,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:51:52,483 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-11 01:51:52,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:51:52,486 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-11 01:51:52,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:51:52,488 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-11 01:51:52,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:51:52,490 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-10-11 01:51:52,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:51:52,492 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-11 01:51:52,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:51:52,494 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-10-11 01:51:52,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:51:52,496 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-10-11 01:51:52,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:51:52,498 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-11 01:51:52,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:51:52,500 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-10-11 01:51:52,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:51:52,501 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-10-11 01:51:52,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:51:52,503 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-10-11 01:51:52,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:51:52,505 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-10-11 01:51:52,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:51:52,507 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-10-11 01:51:52,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:51:52,509 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-10-11 01:51:52,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:51:52,511 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2024-10-11 01:51:52,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:51:52,513 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2024-10-11 01:51:52,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:51:52,515 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2024-10-11 01:51:52,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:51:52,517 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2024-10-11 01:51:52,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:51:52,519 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 169 [2024-10-11 01:51:52,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:51:52,521 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 174 [2024-10-11 01:51:52,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:51:52,523 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 181 [2024-10-11 01:51:52,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:51:52,525 INFO L134 CoverageAnalysis]: Checked inductivity of 1986 backedges. 62 proven. 47 refuted. 0 times theorem prover too weak. 1877 trivial. 0 not checked. [2024-10-11 01:51:52,526 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 01:51:52,526 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [667598226] [2024-10-11 01:51:52,526 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [667598226] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 01:51:52,526 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [235024993] [2024-10-11 01:51:52,526 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-11 01:51:52,526 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 01:51:52,527 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 01:51:52,528 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 01:51:52,529 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-10-11 01:51:52,611 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-11 01:51:52,611 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-11 01:51:52,613 INFO L255 TraceCheckSpWp]: Trace formula consists of 375 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-10-11 01:51:52,616 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 01:51:52,842 INFO L134 CoverageAnalysis]: Checked inductivity of 1986 backedges. 89 proven. 19 refuted. 0 times theorem prover too weak. 1878 trivial. 0 not checked. [2024-10-11 01:51:52,842 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 01:51:53,084 INFO L134 CoverageAnalysis]: Checked inductivity of 1986 backedges. 86 proven. 22 refuted. 0 times theorem prover too weak. 1878 trivial. 0 not checked. [2024-10-11 01:51:53,084 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [235024993] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 01:51:53,084 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 01:51:53,085 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8, 8] total 19 [2024-10-11 01:51:53,085 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1606253442] [2024-10-11 01:51:53,085 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 01:51:53,085 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-10-11 01:51:53,085 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 01:51:53,086 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-10-11 01:51:53,087 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=287, Unknown=0, NotChecked=0, Total=342 [2024-10-11 01:51:53,087 INFO L87 Difference]: Start difference. First operand 413 states and 659 transitions. Second operand has 19 states, 19 states have (on average 4.157894736842105) internal successors, (79), 17 states have internal predecessors, (79), 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-10-11 01:51:53,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 01:51:53,971 INFO L93 Difference]: Finished difference Result 466 states and 733 transitions. [2024-10-11 01:51:53,972 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2024-10-11 01:51:53,972 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 4.157894736842105) internal successors, (79), 17 states have internal predecessors, (79), 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 190 [2024-10-11 01:51:53,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 01:51:53,974 INFO L225 Difference]: With dead ends: 466 [2024-10-11 01:51:53,974 INFO L226 Difference]: Without dead ends: 0 [2024-10-11 01:51:53,976 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 468 GetRequests, 433 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 197 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=327, Invalid=1005, Unknown=0, NotChecked=0, Total=1332 [2024-10-11 01:51:53,976 INFO L432 NwaCegarLoop]: 80 mSDtfsCounter, 133 mSDsluCounter, 591 mSDsCounter, 0 mSdLazyCounter, 472 mSolverCounterSat, 184 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 135 SdHoareTripleChecker+Valid, 671 SdHoareTripleChecker+Invalid, 656 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 184 IncrementalHoareTripleChecker+Valid, 472 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-11 01:51:53,976 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [135 Valid, 671 Invalid, 656 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [184 Valid, 472 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-11 01:51:53,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-10-11 01:51:53,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-10-11 01:51:53,977 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-10-11 01:51:53,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-10-11 01:51:53,977 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 190 [2024-10-11 01:51:53,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 01:51:53,978 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-10-11 01:51:53,978 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 4.157894736842105) internal successors, (79), 17 states have internal predecessors, (79), 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-10-11 01:51:53,978 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-10-11 01:51:53,978 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-10-11 01:51:53,981 INFO L782 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-11 01:51:53,998 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2024-10-11 01:51:54,185 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,8 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 01:51:54,189 INFO L407 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-10-11 01:51:54,190 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions.