./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-89.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 4a390ef5 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-89.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash b61474e3055b599a740acd844baa39c957b5e0efc678fbcea6f4ee1ccd6cc136 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4a390ef-m [2024-10-24 08:50:13,458 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-24 08:50:13,530 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-24 08:50:13,537 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-24 08:50:13,538 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-24 08:50:13,567 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-24 08:50:13,567 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-24 08:50:13,568 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-24 08:50:13,568 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-24 08:50:13,569 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-24 08:50:13,571 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-24 08:50:13,571 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-24 08:50:13,572 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-24 08:50:13,572 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-24 08:50:13,574 INFO L153 SettingsManager]: * Use SBE=true [2024-10-24 08:50:13,574 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-24 08:50:13,575 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-24 08:50:13,575 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-24 08:50:13,575 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-24 08:50:13,576 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-24 08:50:13,576 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-24 08:50:13,580 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-24 08:50:13,580 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-24 08:50:13,581 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-24 08:50:13,581 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-24 08:50:13,581 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-24 08:50:13,582 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-24 08:50:13,582 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-24 08:50:13,582 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-24 08:50:13,582 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-24 08:50:13,583 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-24 08:50:13,583 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-24 08:50:13,583 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 08:50:13,583 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-24 08:50:13,583 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-24 08:50:13,584 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-24 08:50:13,584 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-24 08:50:13,584 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-24 08:50:13,585 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-24 08:50:13,585 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-24 08:50:13,586 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-24 08:50:13,586 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-24 08:50:13,586 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> b61474e3055b599a740acd844baa39c957b5e0efc678fbcea6f4ee1ccd6cc136 [2024-10-24 08:50:13,818 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-24 08:50:13,846 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-24 08:50:13,849 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-24 08:50:13,850 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-24 08:50:13,851 INFO L274 PluginConnector]: CDTParser initialized [2024-10-24 08:50:13,852 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-89.i [2024-10-24 08:50:15,308 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-24 08:50:15,515 INFO L384 CDTParser]: Found 1 translation units. [2024-10-24 08:50:15,516 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-89.i [2024-10-24 08:50:15,526 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3ca7109e3/85cd94180ad24012b3ae2ff299944d4b/FLAG47092d6e6 [2024-10-24 08:50:15,544 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3ca7109e3/85cd94180ad24012b3ae2ff299944d4b [2024-10-24 08:50:15,547 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-24 08:50:15,548 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-24 08:50:15,550 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-24 08:50:15,550 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-24 08:50:15,556 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-24 08:50:15,557 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 08:50:15" (1/1) ... [2024-10-24 08:50:15,560 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5097b70d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 08:50:15, skipping insertion in model container [2024-10-24 08:50:15,560 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 08:50:15" (1/1) ... [2024-10-24 08:50:15,588 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-24 08:50:15,754 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/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-89.i[917,930] [2024-10-24 08:50:15,792 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 08:50:15,823 INFO L200 MainTranslator]: Completed pre-run [2024-10-24 08:50:15,835 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/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-89.i[917,930] [2024-10-24 08:50:15,853 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 08:50:15,882 INFO L204 MainTranslator]: Completed translation [2024-10-24 08:50:15,883 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 08:50:15 WrapperNode [2024-10-24 08:50:15,883 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-24 08:50:15,885 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-24 08:50:15,885 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-24 08:50:15,886 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-24 08:50:15,894 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 08:50:15" (1/1) ... [2024-10-24 08:50:15,905 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 08:50:15" (1/1) ... [2024-10-24 08:50:15,964 INFO L138 Inliner]: procedures = 26, calls = 26, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 141 [2024-10-24 08:50:15,964 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-24 08:50:15,965 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-24 08:50:15,965 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-24 08:50:15,965 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-24 08:50:15,984 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 08:50:15" (1/1) ... [2024-10-24 08:50:15,985 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 08:50:15" (1/1) ... [2024-10-24 08:50:15,992 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 08:50:15" (1/1) ... [2024-10-24 08:50:16,023 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-24 08:50:16,024 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 08:50:15" (1/1) ... [2024-10-24 08:50:16,025 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 08:50:15" (1/1) ... [2024-10-24 08:50:16,032 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 08:50:15" (1/1) ... [2024-10-24 08:50:16,041 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 08:50:15" (1/1) ... [2024-10-24 08:50:16,047 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 08:50:15" (1/1) ... [2024-10-24 08:50:16,048 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 08:50:15" (1/1) ... [2024-10-24 08:50:16,055 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-24 08:50:16,056 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-24 08:50:16,058 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-24 08:50:16,058 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-24 08:50:16,059 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 08:50:15" (1/1) ... [2024-10-24 08:50:16,064 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 08:50:16,076 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 08:50:16,092 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-24 08:50:16,096 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-24 08:50:16,144 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-24 08:50:16,145 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-24 08:50:16,146 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-24 08:50:16,146 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-24 08:50:16,146 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-24 08:50:16,146 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-24 08:50:16,237 INFO L238 CfgBuilder]: Building ICFG [2024-10-24 08:50:16,240 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-24 08:50:16,622 INFO L? ?]: Removed 15 outVars from TransFormulas that were not future-live. [2024-10-24 08:50:16,622 INFO L287 CfgBuilder]: Performing block encoding [2024-10-24 08:50:16,664 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-24 08:50:16,665 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-24 08:50:16,665 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 08:50:16 BoogieIcfgContainer [2024-10-24 08:50:16,665 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-24 08:50:16,668 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-24 08:50:16,668 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-24 08:50:16,672 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-24 08:50:16,673 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 08:50:15" (1/3) ... [2024-10-24 08:50:16,673 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7d35ffde and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 08:50:16, skipping insertion in model container [2024-10-24 08:50:16,674 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 08:50:15" (2/3) ... [2024-10-24 08:50:16,675 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7d35ffde and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 08:50:16, skipping insertion in model container [2024-10-24 08:50:16,675 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 08:50:16" (3/3) ... [2024-10-24 08:50:16,676 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_floatingpointinfluence_has-floats_file-89.i [2024-10-24 08:50:16,695 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-24 08:50:16,695 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-24 08:50:16,762 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-24 08:50:16,769 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;@1e00e86c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-24 08:50:16,769 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-24 08:50:16,774 INFO L276 IsEmpty]: Start isEmpty. Operand has 57 states, 41 states have (on average 1.5121951219512195) internal successors, (62), 42 states have internal predecessors, (62), 13 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2024-10-24 08:50:16,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2024-10-24 08:50:16,787 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 08:50:16,788 INFO L215 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-24 08:50:16,789 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 08:50:16,795 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 08:50:16,797 INFO L85 PathProgramCache]: Analyzing trace with hash -1045799969, now seen corresponding path program 1 times [2024-10-24 08:50:16,806 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 08:50:16,806 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1692077672] [2024-10-24 08:50:16,807 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 08:50:16,807 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 08:50:16,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:50:17,052 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 08:50:17,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:50:17,063 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 08:50:17,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:50:17,068 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-24 08:50:17,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:50:17,075 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 08:50:17,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:50:17,085 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-24 08:50:17,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:50:17,098 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 08:50:17,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:50:17,107 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-24 08:50:17,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:50:17,117 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-24 08:50:17,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:50:17,121 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-24 08:50:17,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:50:17,127 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-24 08:50:17,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:50:17,133 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-24 08:50:17,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:50:17,137 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 08:50:17,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:50:17,142 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-24 08:50:17,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:50:17,147 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2024-10-24 08:50:17,148 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 08:50:17,148 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1692077672] [2024-10-24 08:50:17,149 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1692077672] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 08:50:17,149 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 08:50:17,149 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-24 08:50:17,151 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [279504068] [2024-10-24 08:50:17,152 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 08:50:17,157 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-24 08:50:17,158 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 08:50:17,184 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-24 08:50:17,186 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-24 08:50:17,188 INFO L87 Difference]: Start difference. First operand has 57 states, 41 states have (on average 1.5121951219512195) internal successors, (62), 42 states have internal predecessors, (62), 13 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) Second operand has 2 states, 2 states have (on average 10.5) internal successors, (21), 2 states have internal predecessors, (21), 2 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 2 states have call successors, (13) [2024-10-24 08:50:17,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 08:50:17,233 INFO L93 Difference]: Finished difference Result 111 states and 187 transitions. [2024-10-24 08:50:17,234 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-24 08:50:17,236 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 10.5) internal successors, (21), 2 states have internal predecessors, (21), 2 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 2 states have call successors, (13) Word has length 83 [2024-10-24 08:50:17,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 08:50:17,257 INFO L225 Difference]: With dead ends: 111 [2024-10-24 08:50:17,258 INFO L226 Difference]: Without dead ends: 55 [2024-10-24 08:50:17,263 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-24 08:50:17,267 INFO L432 NwaCegarLoop]: 78 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 78 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 08:50:17,271 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 78 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 08:50:17,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2024-10-24 08:50:17,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2024-10-24 08:50:17,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 40 states have (on average 1.375) internal successors, (55), 40 states have internal predecessors, (55), 13 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2024-10-24 08:50:17,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 81 transitions. [2024-10-24 08:50:17,384 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 81 transitions. Word has length 83 [2024-10-24 08:50:17,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 08:50:17,385 INFO L471 AbstractCegarLoop]: Abstraction has 55 states and 81 transitions. [2024-10-24 08:50:17,385 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 10.5) internal successors, (21), 2 states have internal predecessors, (21), 2 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 2 states have call successors, (13) [2024-10-24 08:50:17,385 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 81 transitions. [2024-10-24 08:50:17,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2024-10-24 08:50:17,388 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 08:50:17,389 INFO L215 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-24 08:50:17,389 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-24 08:50:17,389 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 08:50:17,390 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 08:50:17,390 INFO L85 PathProgramCache]: Analyzing trace with hash -1716979615, now seen corresponding path program 1 times [2024-10-24 08:50:17,390 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 08:50:17,391 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1027462552] [2024-10-24 08:50:17,391 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 08:50:17,391 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 08:50:17,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:50:17,918 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 08:50:17,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:50:17,929 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 08:50:17,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:50:17,940 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-24 08:50:17,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:50:17,950 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 08:50:17,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:50:17,963 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-24 08:50:17,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:50:17,972 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 08:50:17,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:50:17,980 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-24 08:50:17,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:50:17,987 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-24 08:50:17,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:50:17,996 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-24 08:50:17,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:50:18,007 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-24 08:50:18,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:50:18,020 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-24 08:50:18,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:50:18,031 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 08:50:18,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:50:18,057 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-24 08:50:18,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:50:18,072 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2024-10-24 08:50:18,077 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 08:50:18,077 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1027462552] [2024-10-24 08:50:18,078 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1027462552] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 08:50:18,078 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 08:50:18,078 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-24 08:50:18,078 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1576288074] [2024-10-24 08:50:18,078 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 08:50:18,080 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-24 08:50:18,084 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 08:50:18,086 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-24 08:50:18,086 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-24 08:50:18,086 INFO L87 Difference]: Start difference. First operand 55 states and 81 transitions. Second operand has 5 states, 5 states have (on average 4.2) internal successors, (21), 5 states have internal predecessors, (21), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-10-24 08:50:18,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 08:50:18,374 INFO L93 Difference]: Finished difference Result 164 states and 242 transitions. [2024-10-24 08:50:18,374 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-24 08:50:18,375 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.2) internal successors, (21), 5 states have internal predecessors, (21), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 83 [2024-10-24 08:50:18,376 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 08:50:18,378 INFO L225 Difference]: With dead ends: 164 [2024-10-24 08:50:18,379 INFO L226 Difference]: Without dead ends: 110 [2024-10-24 08:50:18,381 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-10-24 08:50:18,383 INFO L432 NwaCegarLoop]: 75 mSDtfsCounter, 58 mSDsluCounter, 191 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 266 SdHoareTripleChecker+Invalid, 96 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-24 08:50:18,383 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 266 Invalid, 96 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-24 08:50:18,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2024-10-24 08:50:18,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 80. [2024-10-24 08:50:18,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 51 states have (on average 1.2941176470588236) internal successors, (66), 51 states have internal predecessors, (66), 26 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2024-10-24 08:50:18,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 118 transitions. [2024-10-24 08:50:18,421 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 118 transitions. Word has length 83 [2024-10-24 08:50:18,422 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 08:50:18,424 INFO L471 AbstractCegarLoop]: Abstraction has 80 states and 118 transitions. [2024-10-24 08:50:18,424 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.2) internal successors, (21), 5 states have internal predecessors, (21), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-10-24 08:50:18,425 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 118 transitions. [2024-10-24 08:50:18,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2024-10-24 08:50:18,426 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 08:50:18,427 INFO L215 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-24 08:50:18,427 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-24 08:50:18,427 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 08:50:18,427 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 08:50:18,428 INFO L85 PathProgramCache]: Analyzing trace with hash -2110006625, now seen corresponding path program 1 times [2024-10-24 08:50:18,428 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 08:50:18,428 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [659675186] [2024-10-24 08:50:18,428 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 08:50:18,430 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 08:50:18,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:50:21,381 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 08:50:21,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:50:21,385 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 08:50:21,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:50:21,388 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-24 08:50:21,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:50:21,394 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 08:50:21,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:50:21,398 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-24 08:50:21,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:50:21,401 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 08:50:21,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:50:21,406 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-24 08:50:21,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:50:21,411 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-24 08:50:21,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:50:21,414 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-24 08:50:21,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:50:21,420 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-24 08:50:21,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:50:21,423 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-24 08:50:21,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:50:21,426 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 08:50:21,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:50:21,429 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-24 08:50:21,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:50:21,433 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2024-10-24 08:50:21,434 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 08:50:21,435 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [659675186] [2024-10-24 08:50:21,435 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [659675186] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 08:50:21,436 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 08:50:21,436 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-24 08:50:21,436 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1824753450] [2024-10-24 08:50:21,436 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 08:50:21,437 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-24 08:50:21,437 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 08:50:21,437 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-24 08:50:21,438 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-10-24 08:50:21,438 INFO L87 Difference]: Start difference. First operand 80 states and 118 transitions. Second operand has 6 states, 6 states have (on average 3.5) internal successors, (21), 6 states have internal predecessors, (21), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-10-24 08:50:21,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 08:50:21,940 INFO L93 Difference]: Finished difference Result 162 states and 238 transitions. [2024-10-24 08:50:21,941 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-24 08:50:21,941 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), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 83 [2024-10-24 08:50:21,942 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 08:50:21,962 INFO L225 Difference]: With dead ends: 162 [2024-10-24 08:50:21,963 INFO L226 Difference]: Without dead ends: 108 [2024-10-24 08:50:21,964 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-10-24 08:50:21,965 INFO L432 NwaCegarLoop]: 51 mSDtfsCounter, 76 mSDsluCounter, 137 mSDsCounter, 0 mSdLazyCounter, 140 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 188 SdHoareTripleChecker+Invalid, 142 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 140 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-24 08:50:21,966 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [76 Valid, 188 Invalid, 142 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 140 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-24 08:50:21,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2024-10-24 08:50:21,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 91. [2024-10-24 08:50:21,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 62 states have (on average 1.3387096774193548) internal successors, (83), 62 states have internal predecessors, (83), 26 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2024-10-24 08:50:21,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 135 transitions. [2024-10-24 08:50:21,981 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 135 transitions. Word has length 83 [2024-10-24 08:50:21,981 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 08:50:21,982 INFO L471 AbstractCegarLoop]: Abstraction has 91 states and 135 transitions. [2024-10-24 08:50:21,982 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), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-10-24 08:50:21,982 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 135 transitions. [2024-10-24 08:50:21,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2024-10-24 08:50:21,983 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 08:50:21,984 INFO L215 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-24 08:50:21,984 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-24 08:50:21,984 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 08:50:21,985 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 08:50:21,985 INFO L85 PathProgramCache]: Analyzing trace with hash 1375614045, now seen corresponding path program 1 times [2024-10-24 08:50:21,985 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 08:50:21,985 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [512177512] [2024-10-24 08:50:21,985 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 08:50:21,986 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 08:50:22,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:50:23,847 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 08:50:23,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:50:23,850 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 08:50:23,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:50:23,852 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-24 08:50:23,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:50:23,854 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 08:50:23,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:50:23,856 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-24 08:50:23,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:50:23,859 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 08:50:23,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:50:23,861 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-24 08:50:23,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:50:23,864 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-24 08:50:23,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:50:23,866 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-24 08:50:23,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:50:23,868 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-24 08:50:23,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:50:23,873 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-24 08:50:23,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:50:23,877 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 08:50:23,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:50:23,880 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-24 08:50:23,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:50:23,886 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2024-10-24 08:50:23,886 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 08:50:23,886 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [512177512] [2024-10-24 08:50:23,887 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [512177512] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 08:50:23,887 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 08:50:23,887 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-24 08:50:23,887 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1654019700] [2024-10-24 08:50:23,888 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 08:50:23,888 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-24 08:50:23,888 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 08:50:23,889 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-24 08:50:23,889 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-10-24 08:50:23,889 INFO L87 Difference]: Start difference. First operand 91 states and 135 transitions. Second operand has 6 states, 6 states have (on average 3.5) internal successors, (21), 6 states have internal predecessors, (21), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-10-24 08:50:24,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 08:50:24,406 INFO L93 Difference]: Finished difference Result 173 states and 254 transitions. [2024-10-24 08:50:24,406 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-24 08:50:24,406 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), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 83 [2024-10-24 08:50:24,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 08:50:24,408 INFO L225 Difference]: With dead ends: 173 [2024-10-24 08:50:24,408 INFO L226 Difference]: Without dead ends: 108 [2024-10-24 08:50:24,409 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-10-24 08:50:24,410 INFO L432 NwaCegarLoop]: 63 mSDtfsCounter, 75 mSDsluCounter, 126 mSDsCounter, 0 mSdLazyCounter, 159 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 189 SdHoareTripleChecker+Invalid, 162 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 159 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-24 08:50:24,411 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [75 Valid, 189 Invalid, 162 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 159 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-24 08:50:24,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2024-10-24 08:50:24,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 80. [2024-10-24 08:50:24,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 51 states have (on average 1.2745098039215685) internal successors, (65), 51 states have internal predecessors, (65), 26 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2024-10-24 08:50:24,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 117 transitions. [2024-10-24 08:50:24,431 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 117 transitions. Word has length 83 [2024-10-24 08:50:24,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 08:50:24,432 INFO L471 AbstractCegarLoop]: Abstraction has 80 states and 117 transitions. [2024-10-24 08:50:24,432 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), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-10-24 08:50:24,432 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 117 transitions. [2024-10-24 08:50:24,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2024-10-24 08:50:24,436 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 08:50:24,436 INFO L215 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-24 08:50:24,437 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-24 08:50:24,437 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 08:50:24,438 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 08:50:24,438 INFO L85 PathProgramCache]: Analyzing trace with hash -1726763130, now seen corresponding path program 1 times [2024-10-24 08:50:24,438 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 08:50:24,439 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [858773358] [2024-10-24 08:50:24,439 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 08:50:24,439 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 08:50:24,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:50:25,003 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 08:50:25,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:50:25,007 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 08:50:25,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:50:25,009 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-24 08:50:25,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:50:25,013 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 08:50:25,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:50:25,016 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-24 08:50:25,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:50:25,023 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 08:50:25,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:50:25,031 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-24 08:50:25,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:50:25,034 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-24 08:50:25,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:50:25,039 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-24 08:50:25,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:50:25,043 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-24 08:50:25,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:50:25,046 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-24 08:50:25,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:50:25,050 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 08:50:25,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:50:25,055 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-24 08:50:25,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:50:25,060 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2024-10-24 08:50:25,063 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 08:50:25,064 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [858773358] [2024-10-24 08:50:25,064 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [858773358] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 08:50:25,064 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 08:50:25,064 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-24 08:50:25,064 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [725910214] [2024-10-24 08:50:25,064 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 08:50:25,065 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-24 08:50:25,065 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 08:50:25,065 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-24 08:50:25,066 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-10-24 08:50:25,066 INFO L87 Difference]: Start difference. First operand 80 states and 117 transitions. Second operand has 8 states, 8 states have (on average 2.875) internal successors, (23), 8 states have internal predecessors, (23), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-10-24 08:50:25,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 08:50:25,623 INFO L93 Difference]: Finished difference Result 196 states and 285 transitions. [2024-10-24 08:50:25,623 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-24 08:50:25,623 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.875) internal successors, (23), 8 states have internal predecessors, (23), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 85 [2024-10-24 08:50:25,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 08:50:25,625 INFO L225 Difference]: With dead ends: 196 [2024-10-24 08:50:25,626 INFO L226 Difference]: Without dead ends: 142 [2024-10-24 08:50:25,627 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=58, Invalid=124, Unknown=0, NotChecked=0, Total=182 [2024-10-24 08:50:25,628 INFO L432 NwaCegarLoop]: 86 mSDtfsCounter, 168 mSDsluCounter, 175 mSDsCounter, 0 mSdLazyCounter, 329 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 168 SdHoareTripleChecker+Valid, 261 SdHoareTripleChecker+Invalid, 362 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 329 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-24 08:50:25,628 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [168 Valid, 261 Invalid, 362 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 329 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-24 08:50:25,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2024-10-24 08:50:25,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 138. [2024-10-24 08:50:25,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 138 states, 95 states have (on average 1.231578947368421) internal successors, (117), 95 states have internal predecessors, (117), 39 states have call successors, (39), 3 states have call predecessors, (39), 3 states have return successors, (39), 39 states have call predecessors, (39), 39 states have call successors, (39) [2024-10-24 08:50:25,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 195 transitions. [2024-10-24 08:50:25,665 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 195 transitions. Word has length 85 [2024-10-24 08:50:25,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 08:50:25,666 INFO L471 AbstractCegarLoop]: Abstraction has 138 states and 195 transitions. [2024-10-24 08:50:25,666 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.875) internal successors, (23), 8 states have internal predecessors, (23), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-10-24 08:50:25,666 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 195 transitions. [2024-10-24 08:50:25,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2024-10-24 08:50:25,667 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 08:50:25,667 INFO L215 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-24 08:50:25,668 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-24 08:50:25,668 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 08:50:25,671 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 08:50:25,671 INFO L85 PathProgramCache]: Analyzing trace with hash -1907132730, now seen corresponding path program 1 times [2024-10-24 08:50:25,671 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 08:50:25,672 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [243499467] [2024-10-24 08:50:25,672 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 08:50:25,672 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 08:50:25,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:50:25,790 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 08:50:25,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:50:25,792 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 08:50:25,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:50:25,793 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-24 08:50:25,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:50:25,795 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 08:50:25,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:50:25,797 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-24 08:50:25,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:50:25,799 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 08:50:25,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:50:25,800 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-24 08:50:25,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:50:25,802 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-24 08:50:25,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:50:25,804 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-24 08:50:25,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:50:25,806 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-24 08:50:25,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:50:25,808 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-24 08:50:25,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:50:25,810 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 08:50:25,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:50:25,811 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-24 08:50:25,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:50:25,814 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2024-10-24 08:50:25,814 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 08:50:25,814 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [243499467] [2024-10-24 08:50:25,814 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [243499467] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 08:50:25,815 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 08:50:25,815 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-24 08:50:25,815 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1436840620] [2024-10-24 08:50:25,815 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 08:50:25,815 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 08:50:25,815 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 08:50:25,816 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 08:50:25,816 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 08:50:25,817 INFO L87 Difference]: Start difference. First operand 138 states and 195 transitions. Second operand has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-10-24 08:50:25,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 08:50:25,897 INFO L93 Difference]: Finished difference Result 260 states and 364 transitions. [2024-10-24 08:50:25,898 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 08:50:25,898 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 87 [2024-10-24 08:50:25,899 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 08:50:25,900 INFO L225 Difference]: With dead ends: 260 [2024-10-24 08:50:25,900 INFO L226 Difference]: Without dead ends: 148 [2024-10-24 08:50:25,901 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 28 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-24 08:50:25,904 INFO L432 NwaCegarLoop]: 75 mSDtfsCounter, 5 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 136 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 08:50:25,905 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 136 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 08:50:25,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2024-10-24 08:50:25,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 144. [2024-10-24 08:50:25,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 144 states, 101 states have (on average 1.2178217821782178) internal successors, (123), 101 states have internal predecessors, (123), 39 states have call successors, (39), 3 states have call predecessors, (39), 3 states have return successors, (39), 39 states have call predecessors, (39), 39 states have call successors, (39) [2024-10-24 08:50:25,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 201 transitions. [2024-10-24 08:50:25,937 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 201 transitions. Word has length 87 [2024-10-24 08:50:25,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 08:50:25,938 INFO L471 AbstractCegarLoop]: Abstraction has 144 states and 201 transitions. [2024-10-24 08:50:25,939 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-10-24 08:50:25,958 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 201 transitions. [2024-10-24 08:50:25,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2024-10-24 08:50:25,963 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 08:50:25,963 INFO L215 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-24 08:50:25,963 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-24 08:50:25,964 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 08:50:25,964 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 08:50:25,964 INFO L85 PathProgramCache]: Analyzing trace with hash -965461757, now seen corresponding path program 1 times [2024-10-24 08:50:25,965 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 08:50:25,965 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [415387579] [2024-10-24 08:50:25,965 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 08:50:25,966 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 08:50:25,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:50:26,674 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 08:50:26,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:50:26,681 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 08:50:26,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:50:26,685 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-24 08:50:26,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:50:26,690 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 08:50:26,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:50:26,695 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-24 08:50:26,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:50:26,701 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 08:50:26,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:50:26,705 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-24 08:50:26,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:50:26,709 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-24 08:50:26,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:50:26,713 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-24 08:50:26,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:50:26,719 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-24 08:50:26,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:50:26,723 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-24 08:50:26,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:50:26,729 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 08:50:26,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:50:26,736 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-24 08:50:26,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:50:26,744 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2024-10-24 08:50:26,748 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 08:50:26,749 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [415387579] [2024-10-24 08:50:26,749 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [415387579] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 08:50:26,749 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 08:50:26,749 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-24 08:50:26,753 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [297243607] [2024-10-24 08:50:26,753 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 08:50:26,754 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-24 08:50:26,754 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 08:50:26,755 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-24 08:50:26,755 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-10-24 08:50:26,755 INFO L87 Difference]: Start difference. First operand 144 states and 201 transitions. Second operand has 9 states, 9 states have (on average 2.888888888888889) internal successors, (26), 9 states have internal predecessors, (26), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-10-24 08:50:27,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 08:50:27,264 INFO L93 Difference]: Finished difference Result 153 states and 209 transitions. [2024-10-24 08:50:27,264 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-24 08:50:27,264 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.888888888888889) internal successors, (26), 9 states have internal predecessors, (26), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 88 [2024-10-24 08:50:27,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 08:50:27,268 INFO L225 Difference]: With dead ends: 153 [2024-10-24 08:50:27,268 INFO L226 Difference]: Without dead ends: 151 [2024-10-24 08:50:27,268 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 30 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=64, Invalid=146, Unknown=0, NotChecked=0, Total=210 [2024-10-24 08:50:27,269 INFO L432 NwaCegarLoop]: 91 mSDtfsCounter, 94 mSDsluCounter, 243 mSDsCounter, 0 mSdLazyCounter, 273 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 94 SdHoareTripleChecker+Valid, 334 SdHoareTripleChecker+Invalid, 300 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 273 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-24 08:50:27,270 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [94 Valid, 334 Invalid, 300 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 273 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-24 08:50:27,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2024-10-24 08:50:27,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 145. [2024-10-24 08:50:27,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 145 states, 102 states have (on average 1.2156862745098038) internal successors, (124), 102 states have internal predecessors, (124), 39 states have call successors, (39), 3 states have call predecessors, (39), 3 states have return successors, (39), 39 states have call predecessors, (39), 39 states have call successors, (39) [2024-10-24 08:50:27,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 202 transitions. [2024-10-24 08:50:27,294 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 202 transitions. Word has length 88 [2024-10-24 08:50:27,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 08:50:27,295 INFO L471 AbstractCegarLoop]: Abstraction has 145 states and 202 transitions. [2024-10-24 08:50:27,295 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.888888888888889) internal successors, (26), 9 states have internal predecessors, (26), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-10-24 08:50:27,295 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 202 transitions. [2024-10-24 08:50:27,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2024-10-24 08:50:27,298 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 08:50:27,299 INFO L215 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-24 08:50:27,299 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-24 08:50:27,299 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 08:50:27,299 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 08:50:27,299 INFO L85 PathProgramCache]: Analyzing trace with hash 1500733303, now seen corresponding path program 1 times [2024-10-24 08:50:27,300 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 08:50:27,300 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [821208612] [2024-10-24 08:50:27,300 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 08:50:27,300 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 08:50:27,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:50:27,357 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 08:50:27,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:50:27,359 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 08:50:27,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:50:27,361 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-24 08:50:27,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:50:27,363 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 08:50:27,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:50:27,365 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-24 08:50:27,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:50:27,368 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 08:50:27,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:50:27,371 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-24 08:50:27,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:50:27,373 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-24 08:50:27,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:50:27,375 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-24 08:50:27,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:50:27,377 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-24 08:50:27,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:50:27,379 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-24 08:50:27,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:50:27,381 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 08:50:27,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:50:27,384 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-24 08:50:27,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:50:27,386 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2024-10-24 08:50:27,386 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 08:50:27,386 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [821208612] [2024-10-24 08:50:27,386 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [821208612] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 08:50:27,387 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 08:50:27,387 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-24 08:50:27,387 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [294962822] [2024-10-24 08:50:27,387 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 08:50:27,387 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 08:50:27,388 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 08:50:27,388 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 08:50:27,388 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 08:50:27,389 INFO L87 Difference]: Start difference. First operand 145 states and 202 transitions. Second operand has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-10-24 08:50:27,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 08:50:27,441 INFO L93 Difference]: Finished difference Result 320 states and 437 transitions. [2024-10-24 08:50:27,442 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 08:50:27,442 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 95 [2024-10-24 08:50:27,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 08:50:27,444 INFO L225 Difference]: With dead ends: 320 [2024-10-24 08:50:27,445 INFO L226 Difference]: Without dead ends: 201 [2024-10-24 08:50:27,446 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 28 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-24 08:50:27,447 INFO L432 NwaCegarLoop]: 83 mSDtfsCounter, 29 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 147 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 08:50:27,447 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 147 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 08:50:27,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2024-10-24 08:50:27,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 197. [2024-10-24 08:50:27,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 197 states, 137 states have (on average 1.1824817518248176) internal successors, (162), 139 states have internal predecessors, (162), 53 states have call successors, (53), 6 states have call predecessors, (53), 6 states have return successors, (53), 51 states have call predecessors, (53), 53 states have call successors, (53) [2024-10-24 08:50:27,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 268 transitions. [2024-10-24 08:50:27,479 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 268 transitions. Word has length 95 [2024-10-24 08:50:27,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 08:50:27,480 INFO L471 AbstractCegarLoop]: Abstraction has 197 states and 268 transitions. [2024-10-24 08:50:27,481 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-10-24 08:50:27,481 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 268 transitions. [2024-10-24 08:50:27,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2024-10-24 08:50:27,482 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 08:50:27,482 INFO L215 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-24 08:50:27,484 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-24 08:50:27,484 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 08:50:27,484 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 08:50:27,484 INFO L85 PathProgramCache]: Analyzing trace with hash -1510365528, now seen corresponding path program 1 times [2024-10-24 08:50:27,485 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 08:50:27,485 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [770547429] [2024-10-24 08:50:27,485 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 08:50:27,485 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 08:50:27,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:50:28,716 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 08:50:28,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:50:28,719 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 08:50:28,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:50:28,721 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-24 08:50:28,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:50:28,723 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 08:50:28,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:50:28,726 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-24 08:50:28,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:50:28,728 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 08:50:28,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:50:28,731 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-24 08:50:28,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:50:28,733 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-24 08:50:28,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:50:28,735 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-24 08:50:28,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:50:28,737 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-24 08:50:28,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:50:28,740 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-24 08:50:28,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:50:28,742 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 08:50:28,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:50:28,744 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-24 08:50:28,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:50:28,747 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2024-10-24 08:50:28,747 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 08:50:28,747 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [770547429] [2024-10-24 08:50:28,747 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [770547429] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 08:50:28,747 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 08:50:28,748 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2024-10-24 08:50:28,748 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1048351843] [2024-10-24 08:50:28,748 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 08:50:28,748 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-10-24 08:50:28,748 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 08:50:28,749 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-10-24 08:50:28,749 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2024-10-24 08:50:28,749 INFO L87 Difference]: Start difference. First operand 197 states and 268 transitions. Second operand has 13 states, 13 states have (on average 3.0) internal successors, (39), 13 states have internal predecessors, (39), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-10-24 08:50:29,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 08:50:29,842 INFO L93 Difference]: Finished difference Result 239 states and 311 transitions. [2024-10-24 08:50:29,843 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-10-24 08:50:29,843 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 3.0) internal successors, (39), 13 states have internal predecessors, (39), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 101 [2024-10-24 08:50:29,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 08:50:29,846 INFO L225 Difference]: With dead ends: 239 [2024-10-24 08:50:29,846 INFO L226 Difference]: Without dead ends: 237 [2024-10-24 08:50:29,847 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 120 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=213, Invalid=717, Unknown=0, NotChecked=0, Total=930 [2024-10-24 08:50:29,847 INFO L432 NwaCegarLoop]: 91 mSDtfsCounter, 149 mSDsluCounter, 359 mSDsCounter, 0 mSdLazyCounter, 834 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 149 SdHoareTripleChecker+Valid, 450 SdHoareTripleChecker+Invalid, 862 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 834 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-24 08:50:29,847 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [149 Valid, 450 Invalid, 862 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 834 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-24 08:50:29,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 237 states. [2024-10-24 08:50:29,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 237 to 209. [2024-10-24 08:50:29,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 209 states, 149 states have (on average 1.1812080536912752) internal successors, (176), 151 states have internal predecessors, (176), 53 states have call successors, (53), 6 states have call predecessors, (53), 6 states have return successors, (53), 51 states have call predecessors, (53), 53 states have call successors, (53) [2024-10-24 08:50:29,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 282 transitions. [2024-10-24 08:50:29,876 INFO L78 Accepts]: Start accepts. Automaton has 209 states and 282 transitions. Word has length 101 [2024-10-24 08:50:29,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 08:50:29,879 INFO L471 AbstractCegarLoop]: Abstraction has 209 states and 282 transitions. [2024-10-24 08:50:29,879 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 3.0) internal successors, (39), 13 states have internal predecessors, (39), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-10-24 08:50:29,879 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 282 transitions. [2024-10-24 08:50:29,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2024-10-24 08:50:29,881 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 08:50:29,881 INFO L215 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-24 08:50:29,881 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-24 08:50:29,882 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 08:50:29,882 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 08:50:29,882 INFO L85 PathProgramCache]: Analyzing trace with hash 77982374, now seen corresponding path program 1 times [2024-10-24 08:50:29,882 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 08:50:29,882 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1041844956] [2024-10-24 08:50:29,882 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 08:50:29,883 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 08:50:29,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:50:29,988 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 08:50:29,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:50:29,993 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 08:50:29,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:50:29,998 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-24 08:50:29,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:50:30,001 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 08:50:30,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:50:30,003 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-24 08:50:30,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:50:30,007 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 08:50:30,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:50:30,012 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-24 08:50:30,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:50:30,015 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-24 08:50:30,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:50:30,018 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-24 08:50:30,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:50:30,021 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-24 08:50:30,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:50:30,025 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-24 08:50:30,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:50:30,028 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 08:50:30,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:50:30,031 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-24 08:50:30,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:50:30,035 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2024-10-24 08:50:30,035 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 08:50:30,035 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1041844956] [2024-10-24 08:50:30,035 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1041844956] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 08:50:30,035 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 08:50:30,035 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-24 08:50:30,036 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1988715597] [2024-10-24 08:50:30,036 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 08:50:30,036 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 08:50:30,036 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 08:50:30,037 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 08:50:30,037 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 08:50:30,037 INFO L87 Difference]: Start difference. First operand 209 states and 282 transitions. Second operand has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-10-24 08:50:30,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 08:50:30,128 INFO L93 Difference]: Finished difference Result 373 states and 505 transitions. [2024-10-24 08:50:30,129 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-24 08:50:30,129 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 101 [2024-10-24 08:50:30,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 08:50:30,131 INFO L225 Difference]: With dead ends: 373 [2024-10-24 08:50:30,131 INFO L226 Difference]: Without dead ends: 194 [2024-10-24 08:50:30,132 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-24 08:50:30,132 INFO L432 NwaCegarLoop]: 66 mSDtfsCounter, 39 mSDsluCounter, 113 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 179 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 08:50:30,133 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 179 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 08:50:30,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2024-10-24 08:50:30,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 194. [2024-10-24 08:50:30,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 194 states, 134 states have (on average 1.171641791044776) internal successors, (157), 136 states have internal predecessors, (157), 53 states have call successors, (53), 6 states have call predecessors, (53), 6 states have return successors, (53), 51 states have call predecessors, (53), 53 states have call successors, (53) [2024-10-24 08:50:30,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 263 transitions. [2024-10-24 08:50:30,157 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 263 transitions. Word has length 101 [2024-10-24 08:50:30,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 08:50:30,160 INFO L471 AbstractCegarLoop]: Abstraction has 194 states and 263 transitions. [2024-10-24 08:50:30,160 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-10-24 08:50:30,160 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 263 transitions. [2024-10-24 08:50:30,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2024-10-24 08:50:30,162 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 08:50:30,162 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 08:50:30,162 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-24 08:50:30,162 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 08:50:30,163 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 08:50:30,163 INFO L85 PathProgramCache]: Analyzing trace with hash 1897851069, now seen corresponding path program 1 times [2024-10-24 08:50:30,164 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 08:50:30,164 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [625828002] [2024-10-24 08:50:30,164 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 08:50:30,164 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 08:50:30,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:50:30,744 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 08:50:30,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:50:30,746 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 08:50:30,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:50:30,747 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-24 08:50:30,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:50:30,748 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 08:50:30,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:50:30,750 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-24 08:50:30,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:50:30,753 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 08:50:30,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:50:30,755 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-24 08:50:30,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:50:30,757 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-24 08:50:30,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:50:30,759 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-24 08:50:30,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:50:30,760 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-24 08:50:30,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:50:30,761 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-24 08:50:30,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:50:30,763 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 08:50:30,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:50:30,764 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-24 08:50:30,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:50:30,766 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-24 08:50:30,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:50:30,767 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-24 08:50:30,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:50:30,768 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-24 08:50:30,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:50:30,770 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-24 08:50:30,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:50:30,773 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-24 08:50:30,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:50:30,774 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-24 08:50:30,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:50:30,777 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-10-24 08:50:30,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:50:30,779 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-10-24 08:50:30,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:50:30,782 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-10-24 08:50:30,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:50:30,785 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2024-10-24 08:50:30,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:50:30,786 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-10-24 08:50:30,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:50:30,788 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2024-10-24 08:50:30,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:50:30,789 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2024-10-24 08:50:30,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:50:30,792 INFO L134 CoverageAnalysis]: Checked inductivity of 1331 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 1322 trivial. 0 not checked. [2024-10-24 08:50:30,792 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 08:50:30,792 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [625828002] [2024-10-24 08:50:30,792 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [625828002] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 08:50:30,792 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 08:50:30,793 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-24 08:50:30,793 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [293000392] [2024-10-24 08:50:30,793 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 08:50:30,793 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-24 08:50:30,793 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 08:50:30,794 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-24 08:50:30,794 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-10-24 08:50:30,794 INFO L87 Difference]: Start difference. First operand 194 states and 263 transitions. Second operand has 8 states, 8 states have (on average 4.75) internal successors, (38), 8 states have internal predecessors, (38), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-10-24 08:50:31,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 08:50:31,038 INFO L93 Difference]: Finished difference Result 201 states and 269 transitions. [2024-10-24 08:50:31,038 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-24 08:50:31,038 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.75) internal successors, (38), 8 states have internal predecessors, (38), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 172 [2024-10-24 08:50:31,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 08:50:31,041 INFO L225 Difference]: With dead ends: 201 [2024-10-24 08:50:31,041 INFO L226 Difference]: Without dead ends: 199 [2024-10-24 08:50:31,042 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2024-10-24 08:50:31,042 INFO L432 NwaCegarLoop]: 86 mSDtfsCounter, 103 mSDsluCounter, 209 mSDsCounter, 0 mSdLazyCounter, 254 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 103 SdHoareTripleChecker+Valid, 295 SdHoareTripleChecker+Invalid, 255 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 254 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-24 08:50:31,043 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [103 Valid, 295 Invalid, 255 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 254 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-24 08:50:31,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states. [2024-10-24 08:50:31,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 191. [2024-10-24 08:50:31,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 191 states, 131 states have (on average 1.16793893129771) internal successors, (153), 133 states have internal predecessors, (153), 53 states have call successors, (53), 6 states have call predecessors, (53), 6 states have return successors, (53), 51 states have call predecessors, (53), 53 states have call successors, (53) [2024-10-24 08:50:31,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 259 transitions. [2024-10-24 08:50:31,067 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 259 transitions. Word has length 172 [2024-10-24 08:50:31,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 08:50:31,067 INFO L471 AbstractCegarLoop]: Abstraction has 191 states and 259 transitions. [2024-10-24 08:50:31,067 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.75) internal successors, (38), 8 states have internal predecessors, (38), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-10-24 08:50:31,068 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 259 transitions. [2024-10-24 08:50:31,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2024-10-24 08:50:31,070 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 08:50:31,071 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 08:50:31,071 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-24 08:50:31,071 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 08:50:31,071 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 08:50:31,072 INFO L85 PathProgramCache]: Analyzing trace with hash -1881337618, now seen corresponding path program 1 times [2024-10-24 08:50:31,072 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 08:50:31,072 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1128662128] [2024-10-24 08:50:31,072 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 08:50:31,072 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 08:50:31,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:50:33,526 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 08:50:33,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:50:33,528 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 08:50:33,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:50:33,529 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-24 08:50:33,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:50:33,531 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 08:50:33,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:50:33,533 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-24 08:50:33,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:50:33,535 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 08:50:33,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:50:33,537 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-24 08:50:33,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:50:33,539 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-24 08:50:33,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:50:33,540 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-24 08:50:33,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:50:33,542 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-24 08:50:33,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:50:33,543 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-24 08:50:33,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:50:33,544 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 08:50:33,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:50:33,546 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-24 08:50:33,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:50:33,547 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-24 08:50:33,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:50:33,549 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-24 08:50:33,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:50:33,550 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-24 08:50:33,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:50:33,552 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-24 08:50:33,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:50:33,554 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-24 08:50:33,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:50:33,556 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-24 08:50:33,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:50:33,558 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-10-24 08:50:33,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:50:33,560 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-10-24 08:50:33,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:50:33,561 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-10-24 08:50:33,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:50:33,563 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2024-10-24 08:50:33,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:50:33,564 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-10-24 08:50:33,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:50:33,566 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2024-10-24 08:50:33,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:50:33,568 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2024-10-24 08:50:33,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:50:33,570 INFO L134 CoverageAnalysis]: Checked inductivity of 1331 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 1321 trivial. 0 not checked. [2024-10-24 08:50:33,570 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 08:50:33,570 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1128662128] [2024-10-24 08:50:33,571 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1128662128] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 08:50:33,571 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 08:50:33,571 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2024-10-24 08:50:33,571 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2077622699] [2024-10-24 08:50:33,571 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 08:50:33,572 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-10-24 08:50:33,572 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 08:50:33,572 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-10-24 08:50:33,572 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2024-10-24 08:50:33,573 INFO L87 Difference]: Start difference. First operand 191 states and 259 transitions. Second operand has 13 states, 13 states have (on average 3.1538461538461537) internal successors, (41), 13 states have internal predecessors, (41), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-10-24 08:50:34,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 08:50:34,472 INFO L93 Difference]: Finished difference Result 371 states and 502 transitions. [2024-10-24 08:50:34,472 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-24 08:50:34,473 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 3.1538461538461537) internal successors, (41), 13 states have internal predecessors, (41), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 175 [2024-10-24 08:50:34,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 08:50:34,475 INFO L225 Difference]: With dead ends: 371 [2024-10-24 08:50:34,475 INFO L226 Difference]: Without dead ends: 288 [2024-10-24 08:50:34,476 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=90, Invalid=252, Unknown=0, NotChecked=0, Total=342 [2024-10-24 08:50:34,477 INFO L432 NwaCegarLoop]: 107 mSDtfsCounter, 126 mSDsluCounter, 502 mSDsCounter, 0 mSdLazyCounter, 610 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 126 SdHoareTripleChecker+Valid, 609 SdHoareTripleChecker+Invalid, 613 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 610 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-24 08:50:34,477 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [126 Valid, 609 Invalid, 613 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 610 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-24 08:50:34,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 288 states. [2024-10-24 08:50:34,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 288 to 271. [2024-10-24 08:50:34,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 271 states, 193 states have (on average 1.1968911917098446) internal successors, (231), 197 states have internal predecessors, (231), 69 states have call successors, (69), 8 states have call predecessors, (69), 8 states have return successors, (69), 65 states have call predecessors, (69), 69 states have call successors, (69) [2024-10-24 08:50:34,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 271 states to 271 states and 369 transitions. [2024-10-24 08:50:34,520 INFO L78 Accepts]: Start accepts. Automaton has 271 states and 369 transitions. Word has length 175 [2024-10-24 08:50:34,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 08:50:34,521 INFO L471 AbstractCegarLoop]: Abstraction has 271 states and 369 transitions. [2024-10-24 08:50:34,521 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 3.1538461538461537) internal successors, (41), 13 states have internal predecessors, (41), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-10-24 08:50:34,522 INFO L276 IsEmpty]: Start isEmpty. Operand 271 states and 369 transitions. [2024-10-24 08:50:34,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2024-10-24 08:50:34,525 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 08:50:34,525 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 08:50:34,525 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-24 08:50:34,526 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 08:50:34,526 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 08:50:34,526 INFO L85 PathProgramCache]: Analyzing trace with hash 167130338, now seen corresponding path program 1 times [2024-10-24 08:50:34,526 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 08:50:34,526 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1377471453] [2024-10-24 08:50:34,527 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 08:50:34,527 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 08:50:34,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:50:34,592 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 08:50:34,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:50:34,594 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 08:50:34,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:50:34,595 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-24 08:50:34,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:50:34,596 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 08:50:34,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:50:34,597 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-24 08:50:34,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:50:34,598 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 08:50:34,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:50:34,601 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-24 08:50:34,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:50:34,602 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-24 08:50:34,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:50:34,603 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-24 08:50:34,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:50:34,606 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-24 08:50:34,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:50:34,607 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-24 08:50:34,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:50:34,608 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 08:50:34,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:50:34,610 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-24 08:50:34,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:50:34,611 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-24 08:50:34,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:50:34,622 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-24 08:50:34,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:50:34,623 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-24 08:50:34,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:50:34,627 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-24 08:50:34,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:50:34,629 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-24 08:50:34,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:50:34,630 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-24 08:50:34,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:50:34,631 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-10-24 08:50:34,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:50:34,633 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-10-24 08:50:34,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:50:34,634 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-10-24 08:50:34,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:50:34,635 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2024-10-24 08:50:34,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:50:34,636 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-10-24 08:50:34,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:50:34,637 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2024-10-24 08:50:34,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:50:34,639 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2024-10-24 08:50:34,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:50:34,640 INFO L134 CoverageAnalysis]: Checked inductivity of 1331 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 1325 trivial. 0 not checked. [2024-10-24 08:50:34,640 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 08:50:34,641 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1377471453] [2024-10-24 08:50:34,641 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1377471453] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 08:50:34,641 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 08:50:34,641 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-24 08:50:34,641 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [131278100] [2024-10-24 08:50:34,641 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 08:50:34,642 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 08:50:34,642 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 08:50:34,643 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 08:50:34,643 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 08:50:34,643 INFO L87 Difference]: Start difference. First operand 271 states and 369 transitions. Second operand has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-10-24 08:50:34,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 08:50:34,735 INFO L93 Difference]: Finished difference Result 584 states and 799 transitions. [2024-10-24 08:50:34,736 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 08:50:34,736 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 178 [2024-10-24 08:50:34,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 08:50:34,740 INFO L225 Difference]: With dead ends: 584 [2024-10-24 08:50:34,740 INFO L226 Difference]: Without dead ends: 421 [2024-10-24 08:50:34,741 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 54 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-24 08:50:34,742 INFO L432 NwaCegarLoop]: 74 mSDtfsCounter, 60 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 127 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 08:50:34,743 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 127 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 08:50:34,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 421 states. [2024-10-24 08:50:34,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 421 to 276. [2024-10-24 08:50:34,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 276 states, 198 states have (on average 1.196969696969697) internal successors, (237), 202 states have internal predecessors, (237), 69 states have call successors, (69), 8 states have call predecessors, (69), 8 states have return successors, (69), 65 states have call predecessors, (69), 69 states have call successors, (69) [2024-10-24 08:50:34,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 276 states to 276 states and 375 transitions. [2024-10-24 08:50:34,786 INFO L78 Accepts]: Start accepts. Automaton has 276 states and 375 transitions. Word has length 178 [2024-10-24 08:50:34,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 08:50:34,786 INFO L471 AbstractCegarLoop]: Abstraction has 276 states and 375 transitions. [2024-10-24 08:50:34,787 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-10-24 08:50:34,787 INFO L276 IsEmpty]: Start isEmpty. Operand 276 states and 375 transitions. [2024-10-24 08:50:34,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2024-10-24 08:50:34,788 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 08:50:34,789 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 08:50:34,789 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-24 08:50:34,789 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 08:50:34,789 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 08:50:34,790 INFO L85 PathProgramCache]: Analyzing trace with hash 265665172, now seen corresponding path program 1 times [2024-10-24 08:50:34,790 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 08:50:34,790 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [210676372] [2024-10-24 08:50:34,790 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 08:50:34,790 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 08:50:34,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:50:34,957 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 08:50:34,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:50:34,959 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 08:50:34,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:50:34,960 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-24 08:50:34,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:50:34,962 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 08:50:34,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:50:34,964 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-24 08:50:34,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:50:34,965 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 08:50:34,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:50:34,967 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-24 08:50:34,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:50:34,968 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-24 08:50:34,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:50:34,971 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-24 08:50:34,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:50:34,973 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-24 08:50:34,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:50:34,974 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-24 08:50:34,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:50:34,976 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 08:50:34,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:50:34,978 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-24 08:50:34,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:50:34,979 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-24 08:50:34,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:50:34,980 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-24 08:50:34,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:50:34,982 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-24 08:50:34,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:50:34,983 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-24 08:50:34,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:50:34,985 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-24 08:50:34,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:50:34,987 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-24 08:50:34,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:50:34,990 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-10-24 08:50:34,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:50:34,995 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-10-24 08:50:34,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:50:34,998 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-10-24 08:50:35,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:50:35,001 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2024-10-24 08:50:35,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:50:35,003 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-10-24 08:50:35,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:50:35,005 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2024-10-24 08:50:35,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:50:35,007 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2024-10-24 08:50:35,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:50:35,009 INFO L134 CoverageAnalysis]: Checked inductivity of 1331 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 1322 trivial. 0 not checked. [2024-10-24 08:50:35,009 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 08:50:35,009 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [210676372] [2024-10-24 08:50:35,009 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [210676372] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 08:50:35,009 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 08:50:35,009 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-24 08:50:35,009 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [581729509] [2024-10-24 08:50:35,010 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 08:50:35,010 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 08:50:35,010 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 08:50:35,011 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 08:50:35,011 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-24 08:50:35,011 INFO L87 Difference]: Start difference. First operand 276 states and 375 transitions. Second operand has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-10-24 08:50:35,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 08:50:35,166 INFO L93 Difference]: Finished difference Result 614 states and 837 transitions. [2024-10-24 08:50:35,167 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-24 08:50:35,167 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 181 [2024-10-24 08:50:35,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 08:50:35,173 INFO L225 Difference]: With dead ends: 614 [2024-10-24 08:50:35,173 INFO L226 Difference]: Without dead ends: 446 [2024-10-24 08:50:35,174 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-24 08:50:35,174 INFO L432 NwaCegarLoop]: 146 mSDtfsCounter, 125 mSDsluCounter, 99 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 125 SdHoareTripleChecker+Valid, 245 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 08:50:35,175 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [125 Valid, 245 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 08:50:35,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 446 states. [2024-10-24 08:50:35,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 446 to 382. [2024-10-24 08:50:35,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 382 states, 264 states have (on average 1.1401515151515151) internal successors, (301), 271 states have internal predecessors, (301), 105 states have call successors, (105), 12 states have call predecessors, (105), 12 states have return successors, (105), 98 states have call predecessors, (105), 105 states have call successors, (105) [2024-10-24 08:50:35,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 382 states and 511 transitions. [2024-10-24 08:50:35,266 INFO L78 Accepts]: Start accepts. Automaton has 382 states and 511 transitions. Word has length 181 [2024-10-24 08:50:35,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 08:50:35,267 INFO L471 AbstractCegarLoop]: Abstraction has 382 states and 511 transitions. [2024-10-24 08:50:35,267 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-10-24 08:50:35,267 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states and 511 transitions. [2024-10-24 08:50:35,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2024-10-24 08:50:35,269 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 08:50:35,270 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 08:50:35,270 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-24 08:50:35,270 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 08:50:35,270 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 08:50:35,270 INFO L85 PathProgramCache]: Analyzing trace with hash -678963922, now seen corresponding path program 1 times [2024-10-24 08:50:35,271 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 08:50:35,271 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1395394971] [2024-10-24 08:50:35,271 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 08:50:35,271 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 08:50:35,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:50:37,736 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 08:50:37,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:50:37,738 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 08:50:37,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:50:37,740 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-24 08:50:37,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:50:37,742 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 08:50:37,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:50:37,745 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-24 08:50:37,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:50:37,747 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 08:50:37,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:50:37,748 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-24 08:50:37,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:50:37,750 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-24 08:50:37,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:50:37,752 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-24 08:50:37,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:50:37,753 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-24 08:50:37,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:50:37,755 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-24 08:50:37,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:50:37,757 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 08:50:37,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:50:37,758 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-24 08:50:37,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:50:37,760 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-24 08:50:37,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:50:37,762 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-24 08:50:37,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:50:37,763 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-24 08:50:37,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:50:37,765 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-24 08:50:37,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:50:37,767 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-24 08:50:37,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:50:37,768 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-24 08:50:37,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:50:37,770 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-10-24 08:50:37,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:50:37,771 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-10-24 08:50:37,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:50:37,773 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-10-24 08:50:37,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:50:37,775 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2024-10-24 08:50:37,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:50:37,776 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-10-24 08:50:37,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:50:37,778 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2024-10-24 08:50:37,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:50:37,780 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2024-10-24 08:50:37,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:50:37,782 INFO L134 CoverageAnalysis]: Checked inductivity of 1331 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 1321 trivial. 0 not checked. [2024-10-24 08:50:37,783 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 08:50:37,783 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1395394971] [2024-10-24 08:50:37,783 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1395394971] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 08:50:37,783 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 08:50:37,783 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2024-10-24 08:50:37,784 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [129429739] [2024-10-24 08:50:37,784 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 08:50:37,784 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-10-24 08:50:37,784 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 08:50:37,785 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-10-24 08:50:37,785 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=169, Unknown=0, NotChecked=0, Total=210 [2024-10-24 08:50:37,786 INFO L87 Difference]: Start difference. First operand 382 states and 511 transitions. Second operand has 15 states, 15 states have (on average 3.4) internal successors, (51), 15 states have internal predecessors, (51), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-10-24 08:50:39,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 08:50:39,135 INFO L93 Difference]: Finished difference Result 425 states and 555 transitions. [2024-10-24 08:50:39,135 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-10-24 08:50:39,135 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 3.4) internal successors, (51), 15 states have internal predecessors, (51), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 185 [2024-10-24 08:50:39,136 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 08:50:39,138 INFO L225 Difference]: With dead ends: 425 [2024-10-24 08:50:39,139 INFO L226 Difference]: Without dead ends: 423 [2024-10-24 08:50:39,141 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=191, Invalid=565, Unknown=0, NotChecked=0, Total=756 [2024-10-24 08:50:39,142 INFO L432 NwaCegarLoop]: 113 mSDtfsCounter, 143 mSDsluCounter, 642 mSDsCounter, 0 mSdLazyCounter, 795 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 143 SdHoareTripleChecker+Valid, 755 SdHoareTripleChecker+Invalid, 835 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 795 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-24 08:50:39,142 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [143 Valid, 755 Invalid, 835 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 795 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-24 08:50:39,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 423 states. [2024-10-24 08:50:39,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 423 to 394. [2024-10-24 08:50:39,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 394 states, 276 states have (on average 1.141304347826087) internal successors, (315), 283 states have internal predecessors, (315), 105 states have call successors, (105), 12 states have call predecessors, (105), 12 states have return successors, (105), 98 states have call predecessors, (105), 105 states have call successors, (105) [2024-10-24 08:50:39,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 394 states to 394 states and 525 transitions. [2024-10-24 08:50:39,206 INFO L78 Accepts]: Start accepts. Automaton has 394 states and 525 transitions. Word has length 185 [2024-10-24 08:50:39,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 08:50:39,207 INFO L471 AbstractCegarLoop]: Abstraction has 394 states and 525 transitions. [2024-10-24 08:50:39,207 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 3.4) internal successors, (51), 15 states have internal predecessors, (51), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-10-24 08:50:39,207 INFO L276 IsEmpty]: Start isEmpty. Operand 394 states and 525 transitions. [2024-10-24 08:50:39,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2024-10-24 08:50:39,209 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 08:50:39,210 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 08:50:39,210 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-24 08:50:39,210 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 08:50:39,211 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 08:50:39,211 INFO L85 PathProgramCache]: Analyzing trace with hash 909383980, now seen corresponding path program 1 times [2024-10-24 08:50:39,211 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 08:50:39,211 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1949102082] [2024-10-24 08:50:39,211 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 08:50:39,211 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 08:50:39,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:50:39,408 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 08:50:39,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:50:39,410 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 08:50:39,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:50:39,411 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-24 08:50:39,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:50:39,412 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 08:50:39,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:50:39,413 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-24 08:50:39,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:50:39,415 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 08:50:39,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:50:39,416 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-24 08:50:39,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:50:39,418 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-24 08:50:39,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:50:39,419 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-24 08:50:39,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:50:39,420 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-24 08:50:39,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:50:39,421 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-24 08:50:39,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:50:39,422 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 08:50:39,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:50:39,423 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-24 08:50:39,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:50:39,425 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-24 08:50:39,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:50:39,426 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-24 08:50:39,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:50:39,427 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-24 08:50:39,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:50:39,428 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-24 08:50:39,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:50:39,430 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-24 08:50:39,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:50:39,431 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-24 08:50:39,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:50:39,432 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-10-24 08:50:39,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:50:39,434 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-10-24 08:50:39,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:50:39,435 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-10-24 08:50:39,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:50:39,436 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2024-10-24 08:50:39,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:50:39,437 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-10-24 08:50:39,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:50:39,438 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2024-10-24 08:50:39,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:50:39,439 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2024-10-24 08:50:39,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:50:39,440 INFO L134 CoverageAnalysis]: Checked inductivity of 1331 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 1322 trivial. 0 not checked. [2024-10-24 08:50:39,441 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 08:50:39,441 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1949102082] [2024-10-24 08:50:39,443 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1949102082] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 08:50:39,443 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 08:50:39,443 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-24 08:50:39,443 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [145058] [2024-10-24 08:50:39,443 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 08:50:39,444 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-24 08:50:39,444 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 08:50:39,444 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-24 08:50:39,445 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-24 08:50:39,445 INFO L87 Difference]: Start difference. First operand 394 states and 525 transitions. Second operand has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-10-24 08:50:39,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 08:50:39,722 INFO L93 Difference]: Finished difference Result 729 states and 974 transitions. [2024-10-24 08:50:39,722 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-24 08:50:39,723 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 185 [2024-10-24 08:50:39,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 08:50:39,726 INFO L225 Difference]: With dead ends: 729 [2024-10-24 08:50:39,727 INFO L226 Difference]: Without dead ends: 443 [2024-10-24 08:50:39,728 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2024-10-24 08:50:39,729 INFO L432 NwaCegarLoop]: 146 mSDtfsCounter, 132 mSDsluCounter, 139 mSDsCounter, 0 mSdLazyCounter, 160 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 132 SdHoareTripleChecker+Valid, 285 SdHoareTripleChecker+Invalid, 162 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 160 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-24 08:50:39,729 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [132 Valid, 285 Invalid, 162 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 160 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-24 08:50:39,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 443 states. [2024-10-24 08:50:39,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 443 to 379. [2024-10-24 08:50:39,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 379 states, 261 states have (on average 1.1302681992337165) internal successors, (295), 268 states have internal predecessors, (295), 105 states have call successors, (105), 12 states have call predecessors, (105), 12 states have return successors, (105), 98 states have call predecessors, (105), 105 states have call successors, (105) [2024-10-24 08:50:39,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 379 states to 379 states and 505 transitions. [2024-10-24 08:50:39,789 INFO L78 Accepts]: Start accepts. Automaton has 379 states and 505 transitions. Word has length 185 [2024-10-24 08:50:39,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 08:50:39,791 INFO L471 AbstractCegarLoop]: Abstraction has 379 states and 505 transitions. [2024-10-24 08:50:39,791 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-10-24 08:50:39,791 INFO L276 IsEmpty]: Start isEmpty. Operand 379 states and 505 transitions. [2024-10-24 08:50:39,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 260 [2024-10-24 08:50:39,795 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 08:50:39,795 INFO L215 NwaCegarLoop]: trace histogram [39, 39, 39, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 08:50:39,795 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-10-24 08:50:39,796 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 08:50:39,796 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 08:50:39,796 INFO L85 PathProgramCache]: Analyzing trace with hash 434627634, now seen corresponding path program 2 times [2024-10-24 08:50:39,796 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 08:50:39,796 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1098824535] [2024-10-24 08:50:39,797 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 08:50:39,797 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 08:50:39,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:50:42,083 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 08:50:42,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:50:42,085 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 08:50:42,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:50:42,086 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-24 08:50:42,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:50:42,088 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 08:50:42,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:50:42,089 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-24 08:50:42,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:50:42,090 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 08:50:42,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:50:42,091 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-24 08:50:42,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:50:42,093 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-24 08:50:42,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:50:42,094 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-24 08:50:42,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:50:42,095 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-24 08:50:42,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:50:42,097 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-24 08:50:42,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:50:42,098 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 08:50:42,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:50:42,099 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-24 08:50:42,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:50:42,100 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-24 08:50:42,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:50:42,101 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-24 08:50:42,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:50:42,102 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-24 08:50:42,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:50:42,103 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-24 08:50:42,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:50:42,105 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-24 08:50:42,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:50:42,106 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-24 08:50:42,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:50:42,107 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-10-24 08:50:42,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:50:42,108 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-10-24 08:50:42,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:50:42,113 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-10-24 08:50:42,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:50:42,114 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2024-10-24 08:50:42,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:50:42,115 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-10-24 08:50:42,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:50:42,121 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2024-10-24 08:50:42,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:50:42,122 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2024-10-24 08:50:42,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:50:42,123 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 170 [2024-10-24 08:50:42,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:50:42,136 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 175 [2024-10-24 08:50:42,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:50:42,143 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 180 [2024-10-24 08:50:42,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:50:42,154 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 186 [2024-10-24 08:50:42,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:50:42,159 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 191 [2024-10-24 08:50:42,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:50:42,164 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 197 [2024-10-24 08:50:42,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:50:42,169 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 202 [2024-10-24 08:50:42,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:50:42,174 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 208 [2024-10-24 08:50:42,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:50:42,178 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 213 [2024-10-24 08:50:42,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:50:42,184 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 219 [2024-10-24 08:50:42,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:50:42,189 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 224 [2024-10-24 08:50:42,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:50:42,194 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 230 [2024-10-24 08:50:42,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:50:42,199 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 235 [2024-10-24 08:50:42,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:50:42,205 INFO L134 CoverageAnalysis]: Checked inductivity of 3058 backedges. 63 proven. 10 refuted. 0 times theorem prover too weak. 2985 trivial. 0 not checked. [2024-10-24 08:50:42,205 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 08:50:42,205 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1098824535] [2024-10-24 08:50:42,206 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1098824535] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 08:50:42,206 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1317953059] [2024-10-24 08:50:42,206 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-24 08:50:42,206 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 08:50:42,206 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 08:50:42,209 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-24 08:50:42,210 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-24 08:50:42,297 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-10-24 08:50:42,297 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-24 08:50:42,299 INFO L255 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 23 conjuncts are in the unsatisfiable core [2024-10-24 08:50:42,315 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 08:50:42,934 INFO L134 CoverageAnalysis]: Checked inductivity of 3058 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 3040 trivial. 0 not checked. [2024-10-24 08:50:42,934 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 08:50:42,935 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1317953059] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 08:50:42,935 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-24 08:50:42,935 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [17] total 27 [2024-10-24 08:50:42,935 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1039362586] [2024-10-24 08:50:42,935 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 08:50:42,936 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-10-24 08:50:42,936 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 08:50:42,937 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-10-24 08:50:42,937 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=617, Unknown=0, NotChecked=0, Total=702 [2024-10-24 08:50:42,937 INFO L87 Difference]: Start difference. First operand 379 states and 505 transitions. Second operand has 12 states, 12 states have (on average 3.4166666666666665) internal successors, (41), 12 states have internal predecessors, (41), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-10-24 08:50:43,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 08:50:43,863 INFO L93 Difference]: Finished difference Result 447 states and 573 transitions. [2024-10-24 08:50:43,863 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-10-24 08:50:43,863 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.4166666666666665) internal successors, (41), 12 states have internal predecessors, (41), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 259 [2024-10-24 08:50:43,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 08:50:43,866 INFO L225 Difference]: With dead ends: 447 [2024-10-24 08:50:43,866 INFO L226 Difference]: Without dead ends: 445 [2024-10-24 08:50:43,867 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 379 GetRequests, 337 SyntacticMatches, 2 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 321 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=220, Invalid=1502, Unknown=0, NotChecked=0, Total=1722 [2024-10-24 08:50:43,868 INFO L432 NwaCegarLoop]: 87 mSDtfsCounter, 167 mSDsluCounter, 296 mSDsCounter, 0 mSdLazyCounter, 629 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 167 SdHoareTripleChecker+Valid, 383 SdHoareTripleChecker+Invalid, 659 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 629 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-24 08:50:43,868 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [167 Valid, 383 Invalid, 659 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 629 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-24 08:50:43,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 445 states. [2024-10-24 08:50:43,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 445 to 376. [2024-10-24 08:50:43,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 376 states, 258 states have (on average 1.127906976744186) internal successors, (291), 265 states have internal predecessors, (291), 105 states have call successors, (105), 12 states have call predecessors, (105), 12 states have return successors, (105), 98 states have call predecessors, (105), 105 states have call successors, (105) [2024-10-24 08:50:43,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 376 states to 376 states and 501 transitions. [2024-10-24 08:50:43,929 INFO L78 Accepts]: Start accepts. Automaton has 376 states and 501 transitions. Word has length 259 [2024-10-24 08:50:43,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 08:50:43,929 INFO L471 AbstractCegarLoop]: Abstraction has 376 states and 501 transitions. [2024-10-24 08:50:43,929 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.4166666666666665) internal successors, (41), 12 states have internal predecessors, (41), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-10-24 08:50:43,930 INFO L276 IsEmpty]: Start isEmpty. Operand 376 states and 501 transitions. [2024-10-24 08:50:43,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 265 [2024-10-24 08:50:43,933 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 08:50:43,933 INFO L215 NwaCegarLoop]: trace histogram [39, 39, 39, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 08:50:43,953 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-10-24 08:50:44,137 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2024-10-24 08:50:44,138 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 08:50:44,138 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 08:50:44,139 INFO L85 PathProgramCache]: Analyzing trace with hash -595774367, now seen corresponding path program 1 times [2024-10-24 08:50:44,139 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 08:50:44,139 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1268194383] [2024-10-24 08:50:44,139 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 08:50:44,139 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 08:50:44,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:50:44,238 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 08:50:44,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:50:44,244 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 08:50:44,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:50:44,245 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-24 08:50:44,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:50:44,247 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 08:50:44,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:50:44,248 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-24 08:50:44,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:50:44,250 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 08:50:44,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:50:44,251 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-24 08:50:44,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:50:44,256 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-24 08:50:44,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:50:44,258 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-24 08:50:44,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:50:44,259 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-24 08:50:44,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:50:44,261 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-24 08:50:44,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:50:44,262 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 08:50:44,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:50:44,265 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-24 08:50:44,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:50:44,266 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-24 08:50:44,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:50:44,269 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-24 08:50:44,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:50:44,270 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-24 08:50:44,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:50:44,271 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-24 08:50:44,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:50:44,273 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-24 08:50:44,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:50:44,275 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-24 08:50:44,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:50:44,276 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-10-24 08:50:44,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:50:44,277 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-10-24 08:50:44,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:50:44,278 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-10-24 08:50:44,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:50:44,281 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2024-10-24 08:50:44,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:50:44,285 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-10-24 08:50:44,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:50:44,287 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2024-10-24 08:50:44,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:50:44,288 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2024-10-24 08:50:44,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:50:44,293 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 170 [2024-10-24 08:50:44,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:50:44,294 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 175 [2024-10-24 08:50:44,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:50:44,295 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 180 [2024-10-24 08:50:44,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:50:44,296 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 186 [2024-10-24 08:50:44,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:50:44,297 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 191 [2024-10-24 08:50:44,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:50:44,303 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 197 [2024-10-24 08:50:44,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:50:44,305 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 202 [2024-10-24 08:50:44,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:50:44,308 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 208 [2024-10-24 08:50:44,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:50:44,309 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 213 [2024-10-24 08:50:44,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:50:44,310 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 219 [2024-10-24 08:50:44,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:50:44,312 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 224 [2024-10-24 08:50:44,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:50:44,315 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 230 [2024-10-24 08:50:44,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:50:44,317 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 235 [2024-10-24 08:50:44,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:50:44,319 INFO L134 CoverageAnalysis]: Checked inductivity of 3058 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 3046 trivial. 0 not checked. [2024-10-24 08:50:44,319 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 08:50:44,319 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1268194383] [2024-10-24 08:50:44,319 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1268194383] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 08:50:44,319 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 08:50:44,319 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-24 08:50:44,320 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [614715917] [2024-10-24 08:50:44,320 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 08:50:44,320 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 08:50:44,320 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 08:50:44,321 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 08:50:44,321 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 08:50:44,321 INFO L87 Difference]: Start difference. First operand 376 states and 501 transitions. Second operand has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-10-24 08:50:44,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 08:50:44,440 INFO L93 Difference]: Finished difference Result 745 states and 997 transitions. [2024-10-24 08:50:44,441 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 08:50:44,441 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 264 [2024-10-24 08:50:44,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 08:50:44,445 INFO L225 Difference]: With dead ends: 745 [2024-10-24 08:50:44,446 INFO L226 Difference]: Without dead ends: 477 [2024-10-24 08:50:44,447 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 80 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-24 08:50:44,448 INFO L432 NwaCegarLoop]: 123 mSDtfsCounter, 53 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 180 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 08:50:44,448 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 180 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 08:50:44,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 477 states. [2024-10-24 08:50:44,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 477 to 477. [2024-10-24 08:50:44,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 477 states, 319 states have (on average 1.115987460815047) internal successors, (356), 329 states have internal predecessors, (356), 141 states have call successors, (141), 16 states have call predecessors, (141), 16 states have return successors, (141), 131 states have call predecessors, (141), 141 states have call successors, (141) [2024-10-24 08:50:44,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 477 states to 477 states and 638 transitions. [2024-10-24 08:50:44,532 INFO L78 Accepts]: Start accepts. Automaton has 477 states and 638 transitions. Word has length 264 [2024-10-24 08:50:44,532 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 08:50:44,532 INFO L471 AbstractCegarLoop]: Abstraction has 477 states and 638 transitions. [2024-10-24 08:50:44,533 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-10-24 08:50:44,533 INFO L276 IsEmpty]: Start isEmpty. Operand 477 states and 638 transitions. [2024-10-24 08:50:44,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 270 [2024-10-24 08:50:44,535 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 08:50:44,535 INFO L215 NwaCegarLoop]: trace histogram [39, 39, 39, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2024-10-24 08:50:44,536 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-10-24 08:50:44,536 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 08:50:44,536 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 08:50:44,536 INFO L85 PathProgramCache]: Analyzing trace with hash -383360142, now seen corresponding path program 2 times [2024-10-24 08:50:44,536 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 08:50:44,536 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [255323409] [2024-10-24 08:50:44,537 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 08:50:44,537 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 08:50:44,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:50:46,434 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 08:50:46,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:50:46,436 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 08:50:46,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:50:46,437 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-24 08:50:46,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:50:46,438 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 08:50:46,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:50:46,439 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-24 08:50:46,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:50:46,440 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 08:50:46,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:50:46,442 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-24 08:50:46,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:50:46,443 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-24 08:50:46,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:50:46,444 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-10-24 08:50:46,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:50:46,445 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-24 08:50:46,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:50:46,446 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-24 08:50:46,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:50:46,447 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 08:50:46,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:50:46,449 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-24 08:50:46,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:50:46,450 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-24 08:50:46,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:50:46,451 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-24 08:50:46,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:50:46,452 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-24 08:50:46,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:50:46,453 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-24 08:50:46,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:50:46,454 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-24 08:50:46,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:50:46,455 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-24 08:50:46,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:50:46,457 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-10-24 08:50:46,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:50:46,458 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-10-24 08:50:46,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:50:46,459 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-10-24 08:50:46,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:50:46,460 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2024-10-24 08:50:46,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:50:46,462 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-10-24 08:50:46,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:50:46,465 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2024-10-24 08:50:46,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:50:46,472 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2024-10-24 08:50:46,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:50:46,479 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 170 [2024-10-24 08:50:46,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:50:46,483 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 175 [2024-10-24 08:50:46,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:50:46,486 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 180 [2024-10-24 08:50:46,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:50:46,491 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 186 [2024-10-24 08:50:46,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:50:46,495 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 191 [2024-10-24 08:50:46,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:50:46,499 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 197 [2024-10-24 08:50:46,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:50:46,503 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 202 [2024-10-24 08:50:46,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:50:46,508 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 208 [2024-10-24 08:50:46,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:50:46,511 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 213 [2024-10-24 08:50:46,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:50:46,516 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 219 [2024-10-24 08:50:46,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:50:46,520 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 224 [2024-10-24 08:50:46,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:50:46,524 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 230 [2024-10-24 08:50:46,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:50:46,528 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 235 [2024-10-24 08:50:46,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:50:46,533 INFO L134 CoverageAnalysis]: Checked inductivity of 3058 backedges. 73 proven. 7 refuted. 0 times theorem prover too weak. 2978 trivial. 0 not checked. [2024-10-24 08:50:46,534 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 08:50:46,534 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [255323409] [2024-10-24 08:50:46,534 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [255323409] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 08:50:46,534 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1333659139] [2024-10-24 08:50:46,534 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-24 08:50:46,535 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 08:50:46,535 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 08:50:46,537 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-24 08:50:46,538 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-24 08:50:46,639 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-10-24 08:50:46,640 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-24 08:50:46,642 INFO L255 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 26 conjuncts are in the unsatisfiable core [2024-10-24 08:50:46,652 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 08:50:47,480 INFO L134 CoverageAnalysis]: Checked inductivity of 3058 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 3040 trivial. 0 not checked. [2024-10-24 08:50:47,481 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 08:50:47,481 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1333659139] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 08:50:47,481 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-24 08:50:47,481 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [13] total 25 [2024-10-24 08:50:47,482 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2119160057] [2024-10-24 08:50:47,482 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 08:50:47,482 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-10-24 08:50:47,482 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 08:50:47,483 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-10-24 08:50:47,483 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=515, Unknown=0, NotChecked=0, Total=600 [2024-10-24 08:50:47,484 INFO L87 Difference]: Start difference. First operand 477 states and 638 transitions. Second operand has 14 states, 14 states have (on average 3.642857142857143) internal successors, (51), 14 states have internal predecessors, (51), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-10-24 08:50:48,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 08:50:48,303 INFO L93 Difference]: Finished difference Result 568 states and 715 transitions. [2024-10-24 08:50:48,303 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-24 08:50:48,304 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 3.642857142857143) internal successors, (51), 14 states have internal predecessors, (51), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 269 [2024-10-24 08:50:48,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 08:50:48,305 INFO L225 Difference]: With dead ends: 568 [2024-10-24 08:50:48,305 INFO L226 Difference]: Without dead ends: 0 [2024-10-24 08:50:48,307 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 372 GetRequests, 341 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 183 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=167, Invalid=889, Unknown=0, NotChecked=0, Total=1056 [2024-10-24 08:50:48,308 INFO L432 NwaCegarLoop]: 88 mSDtfsCounter, 98 mSDsluCounter, 471 mSDsCounter, 0 mSdLazyCounter, 627 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 98 SdHoareTripleChecker+Valid, 559 SdHoareTripleChecker+Invalid, 634 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 627 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-24 08:50:48,308 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [98 Valid, 559 Invalid, 634 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 627 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-24 08:50:48,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-10-24 08:50:48,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-10-24 08:50:48,311 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-24 08:50:48,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-10-24 08:50:48,312 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 269 [2024-10-24 08:50:48,312 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 08:50:48,313 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-10-24 08:50:48,313 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.642857142857143) internal successors, (51), 14 states have internal predecessors, (51), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-10-24 08:50:48,313 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-10-24 08:50:48,313 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-10-24 08:50:48,316 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-24 08:50:48,335 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-10-24 08:50:48,517 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 08:50:48,520 INFO L407 BasicCegarLoop]: Path program histogram: [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 08:50:48,522 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-10-24 08:51:21,984 WARN L286 SmtUtils]: Spent 33.34s on a formula simplification. DAG size of input: 293 DAG size of output: 376 (called from [L 212] de.uni_freiburg.informatik.ultimate.lib.proofs.floydhoare.HoareAnnotationComposer.or) [2024-10-24 08:51:28,447 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-24 08:51:28,473 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.10 08:51:28 BoogieIcfgContainer [2024-10-24 08:51:28,474 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-24 08:51:28,474 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-24 08:51:28,474 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-24 08:51:28,475 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-24 08:51:28,475 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 08:50:16" (3/4) ... [2024-10-24 08:51:28,477 INFO L139 WitnessPrinter]: Generating witness for correct program [2024-10-24 08:51:28,480 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure assume_abort_if_not [2024-10-24 08:51:28,485 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 16 nodes and edges [2024-10-24 08:51:28,485 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2024-10-24 08:51:28,485 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-10-24 08:51:28,486 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-10-24 08:51:28,606 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-10-24 08:51:28,607 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-10-24 08:51:28,607 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-24 08:51:28,608 INFO L158 Benchmark]: Toolchain (without parser) took 73059.12ms. Allocated memory was 146.8MB in the beginning and 1.0GB in the end (delta: 864.0MB). Free memory was 77.4MB in the beginning and 392.0MB in the end (delta: -314.6MB). Peak memory consumption was 551.7MB. Max. memory is 16.1GB. [2024-10-24 08:51:28,608 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 146.8MB. Free memory is still 96.9MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-24 08:51:28,609 INFO L158 Benchmark]: CACSL2BoogieTranslator took 333.69ms. Allocated memory was 146.8MB in the beginning and 182.5MB in the end (delta: 35.7MB). Free memory was 77.2MB in the beginning and 154.6MB in the end (delta: -77.4MB). Peak memory consumption was 19.5MB. Max. memory is 16.1GB. [2024-10-24 08:51:28,610 INFO L158 Benchmark]: Boogie Procedure Inliner took 79.47ms. Allocated memory is still 182.5MB. Free memory was 154.6MB in the beginning and 151.4MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-24 08:51:28,610 INFO L158 Benchmark]: Boogie Preprocessor took 90.79ms. Allocated memory is still 182.5MB. Free memory was 151.4MB in the beginning and 148.3MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-24 08:51:28,610 INFO L158 Benchmark]: RCFGBuilder took 609.30ms. Allocated memory is still 182.5MB. Free memory was 148.3MB in the beginning and 125.2MB in the end (delta: 23.1MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2024-10-24 08:51:28,610 INFO L158 Benchmark]: TraceAbstraction took 71806.08ms. Allocated memory was 182.5MB in the beginning and 1.0GB in the end (delta: 828.4MB). Free memory was 125.2MB in the beginning and 398.3MB in the end (delta: -273.1MB). Peak memory consumption was 582.6MB. Max. memory is 16.1GB. [2024-10-24 08:51:28,611 INFO L158 Benchmark]: Witness Printer took 132.57ms. Allocated memory is still 1.0GB. Free memory was 398.3MB in the beginning and 392.0MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-10-24 08:51:28,615 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.20ms. Allocated memory is still 146.8MB. Free memory is still 96.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 333.69ms. Allocated memory was 146.8MB in the beginning and 182.5MB in the end (delta: 35.7MB). Free memory was 77.2MB in the beginning and 154.6MB in the end (delta: -77.4MB). Peak memory consumption was 19.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 79.47ms. Allocated memory is still 182.5MB. Free memory was 154.6MB in the beginning and 151.4MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 90.79ms. Allocated memory is still 182.5MB. Free memory was 151.4MB in the beginning and 148.3MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 609.30ms. Allocated memory is still 182.5MB. Free memory was 148.3MB in the beginning and 125.2MB in the end (delta: 23.1MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. * TraceAbstraction took 71806.08ms. Allocated memory was 182.5MB in the beginning and 1.0GB in the end (delta: 828.4MB). Free memory was 125.2MB in the beginning and 398.3MB in the end (delta: -273.1MB). Peak memory consumption was 582.6MB. Max. memory is 16.1GB. * Witness Printer took 132.57ms. Allocated memory is still 1.0GB. Free memory was 398.3MB in the beginning and 392.0MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 19]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 57 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 31.8s, OverallIterations: 19, TraceHistogramMax: 39, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.1s, AutomataDifference: 8.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1700 SdHoareTripleChecker+Valid, 5.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1700 mSDsluCounter, 5666 SdHoareTripleChecker+Invalid, 4.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 3937 mSDsCounter, 229 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 5095 IncrementalHoareTripleChecker+Invalid, 5324 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 229 mSolverCounterUnsat, 1729 mSDtfsCounter, 5095 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1608 GetRequests, 1402 SyntacticMatches, 3 SemanticMatches, 203 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 806 ImplicationChecksByTransitivity, 5.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=477occurred in iteration=18, InterpolantAutomatonStates: 158, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.8s AutomataMinimizationTime, 19 MinimizatonAttempts, 517 StatesRemovedByMinimization, 15 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 20.2s InterpolantComputationTime, 3285 NumberOfCodeBlocks, 2819 NumberOfCodeBlocksAsserted, 21 NumberOfCheckSat, 3264 ConstructedInterpolants, 0 QuantifiedInterpolants, 13747 SizeOfPredicates, 22 NumberOfNonLiveVariables, 221 ConjunctsInSsa, 49 ConjunctsInUnsatCore, 21 InterpolantComputations, 19 PerfectInterpolantSequences, 26379/26396 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 97]: Loop Invariant Derived loop invariant: (((((((((var_1_8 != ((var_1_10 >= 0) ? (var_1_10 % 256) : ((var_1_10 % 256) + 256))) || ((((3 + var_1_10) < var_1_9) || (var_1_8 == ((252 + var_1_9) % 256))) && (((var_1_10 >= 0) ? (var_1_10 % 256) : ((var_1_10 % 256) + 256)) <= 127))) && ((var_1_8 == ((var_1_10 >= 0) ? (var_1_10 % 256) : ((var_1_10 % 256) + 256))) || ((((((3 + var_1_10) < var_1_9) || ((256 + var_1_8) == ((252 + var_1_9) % 256))) && (128 <= ((var_1_10 >= 0) ? (var_1_10 % 256) : ((var_1_10 % 256) + 256)))) || ((256 + var_1_8) != ((var_1_10 >= 0) ? (var_1_10 % 256) : ((var_1_10 % 256) + 256)))) && (((((var_1_9 <= (3 + var_1_10)) && ((256 + var_1_8) == ((252 + var_1_9) % 256))) || (((252 + var_1_9) % 256) < 128)) && ((127 < ((252 + var_1_9) % 256)) || ((var_1_8 == ((252 + var_1_9) % 256)) && (var_1_9 <= (3 + var_1_10))))) || ((256 + var_1_8) == ((var_1_10 >= 0) ? (var_1_10 % 256) : ((var_1_10 % 256) + 256))))))) || (last_1_var_1_14 < (last_1_var_1_15 + 1))) && (var_1_13 == var_1_10)) && (var_1_8 == var_1_14)) && (var_1_15 == var_1_3)) && (((var_1_1 == 1) && (var_1_5 != 0)) || (var_1_1 == 0))) || ((((((((((9 + last_1_var_1_14) <= last_1_var_1_15) && (0 <= 0)) && (((var_1_14 / var_1_3) + 1) <= var_1_14)) && ((9 + var_1_14) <= var_1_15)) && ((var_1_7 == 0) || (var_1_5 == 0))) && (16 <= var_1_14)) && (var_1_15 <= 25)) && (var_1_1 == 0)) && ((var_1_8 + 1) == 0))) - ProcedureContractResult [Line: 20]: Procedure Contract for assume_abort_if_not Derived contract for procedure assume_abort_if_not. Requires: ((((var_1_1 == 1) || (var_1_1 == 0)) && (var_1_8 == var_1_14)) || (((((((9 + last_1_var_1_14) <= last_1_var_1_15) && (0 <= 0)) && ((9 + var_1_14) <= var_1_15)) && (16 <= var_1_14)) && (var_1_15 <= 25)) && ((var_1_8 + 1) == 0))) Ensures: (((((var_1_1 == 1) || (var_1_1 == 0)) && (var_1_8 == var_1_14)) || (((((((9 + last_1_var_1_14) <= last_1_var_1_15) && (0 <= 0)) && ((9 + var_1_14) <= var_1_15)) && (16 <= var_1_14)) && (var_1_15 <= 25)) && ((var_1_8 + 1) == 0))) && (((((((((((((((isInitial == \old(isInitial)) && (var_1_1 == \old(var_1_1))) && (var_1_3 == \old(var_1_3))) && (var_1_5 == \old(var_1_5))) && (var_1_6 == \old(var_1_6))) && (var_1_7 == \old(var_1_7))) && (var_1_8 == \old(var_1_8))) && (var_1_9 == \old(var_1_9))) && (var_1_10 == \old(var_1_10))) && (var_1_11 == \old(var_1_11))) && (var_1_13 == \old(var_1_13))) && (var_1_14 == \old(var_1_14))) && (var_1_15 == \old(var_1_15))) && (last_1_var_1_14 == \old(last_1_var_1_14))) && (last_1_var_1_15 == \old(last_1_var_1_15)))) RESULT: Ultimate proved your program to be correct! [2024-10-24 08:51:28,756 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE