./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-89.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8be7027f Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/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-wip.dk.perfect-tracechecks-8be7027-m [2024-11-12 04:43:50,178 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-12 04:43:50,247 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-12 04:43:50,254 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-12 04:43:50,255 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-12 04:43:50,286 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-12 04:43:50,287 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-12 04:43:50,287 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-12 04:43:50,288 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-12 04:43:50,290 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-12 04:43:50,290 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-12 04:43:50,290 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-12 04:43:50,291 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-12 04:43:50,291 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-12 04:43:50,293 INFO L153 SettingsManager]: * Use SBE=true [2024-11-12 04:43:50,293 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-12 04:43:50,294 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-12 04:43:50,296 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-12 04:43:50,297 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-12 04:43:50,297 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-12 04:43:50,297 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-12 04:43:50,298 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-12 04:43:50,298 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-12 04:43:50,298 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-12 04:43:50,298 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-12 04:43:50,298 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-12 04:43:50,299 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-12 04:43:50,299 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-12 04:43:50,299 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-12 04:43:50,300 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-12 04:43:50,300 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-12 04:43:50,300 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-12 04:43:50,300 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 04:43:50,300 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-12 04:43:50,301 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-12 04:43:50,301 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-12 04:43:50,301 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-12 04:43:50,301 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-12 04:43:50,302 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-12 04:43:50,302 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-12 04:43:50,303 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-12 04:43:50,304 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-12 04:43:50,304 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-11-12 04:43:50,620 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-12 04:43:50,647 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-12 04:43:50,650 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-12 04:43:50,651 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-12 04:43:50,651 INFO L274 PluginConnector]: CDTParser initialized [2024-11-12 04:43:50,653 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-89.i [2024-11-12 04:43:52,074 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-12 04:43:52,274 INFO L384 CDTParser]: Found 1 translation units. [2024-11-12 04:43:52,275 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-89.i [2024-11-12 04:43:52,283 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5f14494bc/49187197a3b74e1ba1b457e3fa21c869/FLAG99aee2929 [2024-11-12 04:43:52,297 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5f14494bc/49187197a3b74e1ba1b457e3fa21c869 [2024-11-12 04:43:52,300 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-12 04:43:52,303 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-12 04:43:52,304 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-12 04:43:52,304 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-12 04:43:52,310 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-12 04:43:52,311 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 04:43:52" (1/1) ... [2024-11-12 04:43:52,312 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@26ce7937 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:43:52, skipping insertion in model container [2024-11-12 04:43:52,312 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 04:43:52" (1/1) ... [2024-11-12 04:43:52,336 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-12 04:43:52,526 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-89.i[917,930] [2024-11-12 04:43:52,581 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 04:43:52,590 INFO L200 MainTranslator]: Completed pre-run [2024-11-12 04:43:52,600 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-89.i[917,930] [2024-11-12 04:43:52,620 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 04:43:52,640 INFO L204 MainTranslator]: Completed translation [2024-11-12 04:43:52,644 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:43:52 WrapperNode [2024-11-12 04:43:52,645 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-12 04:43:52,646 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-12 04:43:52,646 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-12 04:43:52,646 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-12 04:43:52,654 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:43:52" (1/1) ... [2024-11-12 04:43:52,667 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:43:52" (1/1) ... [2024-11-12 04:43:52,734 INFO L138 Inliner]: procedures = 26, calls = 26, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 141 [2024-11-12 04:43:52,735 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-12 04:43:52,736 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-12 04:43:52,736 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-12 04:43:52,736 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-12 04:43:52,754 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:43:52" (1/1) ... [2024-11-12 04:43:52,755 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:43:52" (1/1) ... [2024-11-12 04:43:52,757 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:43:52" (1/1) ... [2024-11-12 04:43:52,778 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-12 04:43:52,778 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:43:52" (1/1) ... [2024-11-12 04:43:52,779 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:43:52" (1/1) ... [2024-11-12 04:43:52,785 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:43:52" (1/1) ... [2024-11-12 04:43:52,788 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:43:52" (1/1) ... [2024-11-12 04:43:52,791 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:43:52" (1/1) ... [2024-11-12 04:43:52,793 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:43:52" (1/1) ... [2024-11-12 04:43:52,796 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-12 04:43:52,798 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-12 04:43:52,802 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-12 04:43:52,802 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-12 04:43:52,803 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:43:52" (1/1) ... [2024-11-12 04:43:52,809 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 04:43:52,833 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 04:43:52,852 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-12 04:43:52,856 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-12 04:43:52,908 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-12 04:43:52,909 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-12 04:43:52,910 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-12 04:43:52,911 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-12 04:43:52,911 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-12 04:43:52,911 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-12 04:43:53,015 INFO L238 CfgBuilder]: Building ICFG [2024-11-12 04:43:53,019 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-12 04:43:53,376 INFO L? ?]: Removed 15 outVars from TransFormulas that were not future-live. [2024-11-12 04:43:53,377 INFO L287 CfgBuilder]: Performing block encoding [2024-11-12 04:43:53,391 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-12 04:43:53,394 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-12 04:43:53,394 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 04:43:53 BoogieIcfgContainer [2024-11-12 04:43:53,394 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-12 04:43:53,396 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-12 04:43:53,396 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-12 04:43:53,401 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-12 04:43:53,401 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.11 04:43:52" (1/3) ... [2024-11-12 04:43:53,402 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@450d2db2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 04:43:53, skipping insertion in model container [2024-11-12 04:43:53,403 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:43:52" (2/3) ... [2024-11-12 04:43:53,403 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@450d2db2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 04:43:53, skipping insertion in model container [2024-11-12 04:43:53,403 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 04:43:53" (3/3) ... [2024-11-12 04:43:53,405 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_floatingpointinfluence_has-floats_file-89.i [2024-11-12 04:43:53,421 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-12 04:43:53,421 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-12 04:43:53,480 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-12 04:43:53,487 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;@33ad0ac6, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-12 04:43:53,487 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-12 04:43:53,494 INFO L276 IsEmpty]: Start isEmpty. Operand has 63 states, 47 states have (on average 1.446808510638298) internal successors, (68), 48 states have internal predecessors, (68), 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-11-12 04:43:53,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2024-11-12 04:43:53,509 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 04:43:53,510 INFO L218 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-11-12 04:43:53,510 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 04:43:53,516 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 04:43:53,516 INFO L85 PathProgramCache]: Analyzing trace with hash 1313284559, now seen corresponding path program 1 times [2024-11-12 04:43:53,526 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 04:43:53,526 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [483505126] [2024-11-12 04:43:53,527 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 04:43:53,527 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 04:43:53,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:43:53,803 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 04:43:53,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:43:53,816 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-12 04:43:53,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:43:53,826 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-12 04:43:53,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:43:53,832 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-12 04:43:53,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:43:53,842 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-12 04:43:53,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:43:53,851 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 04:43:53,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:43:53,862 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-12 04:43:53,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:43:53,869 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-12 04:43:53,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:43:53,879 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-12 04:43:53,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:43:53,889 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-12 04:43:53,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:43:53,898 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-12 04:43:53,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:43:53,906 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-12 04:43:53,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:43:53,912 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-12 04:43:53,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:43:53,924 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2024-11-12 04:43:53,928 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 04:43:53,928 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [483505126] [2024-11-12 04:43:53,929 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [483505126] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 04:43:53,929 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 04:43:53,930 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-12 04:43:53,931 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1359916891] [2024-11-12 04:43:53,932 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 04:43:53,938 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-12 04:43:53,938 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 04:43:53,966 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-12 04:43:53,967 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-12 04:43:53,970 INFO L87 Difference]: Start difference. First operand has 63 states, 47 states have (on average 1.446808510638298) internal successors, (68), 48 states have internal predecessors, (68), 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 12.5) internal successors, (25), 2 states have internal predecessors, (25), 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-11-12 04:43:53,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 04:43:53,999 INFO L93 Difference]: Finished difference Result 119 states and 195 transitions. [2024-11-12 04:43:54,000 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-12 04:43:54,002 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 12.5) internal successors, (25), 2 states have internal predecessors, (25), 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 87 [2024-11-12 04:43:54,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 04:43:54,009 INFO L225 Difference]: With dead ends: 119 [2024-11-12 04:43:54,009 INFO L226 Difference]: Without dead ends: 59 [2024-11-12 04:43:54,013 INFO L434 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-11-12 04:43:54,016 INFO L435 NwaCegarLoop]: 85 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 85 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 04:43:54,017 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 85 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 04:43:54,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2024-11-12 04:43:54,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2024-11-12 04:43:54,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 44 states have (on average 1.3409090909090908) internal successors, (59), 44 states have internal predecessors, (59), 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-11-12 04:43:54,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 85 transitions. [2024-11-12 04:43:54,065 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 85 transitions. Word has length 87 [2024-11-12 04:43:54,065 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 04:43:54,065 INFO L471 AbstractCegarLoop]: Abstraction has 59 states and 85 transitions. [2024-11-12 04:43:54,066 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 12.5) internal successors, (25), 2 states have internal predecessors, (25), 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-11-12 04:43:54,066 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 85 transitions. [2024-11-12 04:43:54,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2024-11-12 04:43:54,071 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 04:43:54,071 INFO L218 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-11-12 04:43:54,071 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-12 04:43:54,072 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 04:43:54,074 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 04:43:54,074 INFO L85 PathProgramCache]: Analyzing trace with hash 1981552013, now seen corresponding path program 1 times [2024-11-12 04:43:54,074 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 04:43:54,075 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [756109705] [2024-11-12 04:43:54,075 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 04:43:54,076 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 04:43:54,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:43:54,757 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 04:43:54,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:43:54,768 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-12 04:43:54,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:43:54,776 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-12 04:43:54,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:43:54,788 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-12 04:43:54,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:43:54,798 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-12 04:43:54,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:43:54,806 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 04:43:54,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:43:54,814 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-12 04:43:54,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:43:54,823 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-12 04:43:54,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:43:54,834 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-12 04:43:54,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:43:54,851 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-12 04:43:54,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:43:54,863 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-12 04:43:54,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:43:54,872 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-12 04:43:54,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:43:54,883 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-12 04:43:54,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:43:54,894 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2024-11-12 04:43:54,895 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 04:43:54,896 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [756109705] [2024-11-12 04:43:54,896 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [756109705] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 04:43:54,896 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 04:43:54,896 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-12 04:43:54,897 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [261301804] [2024-11-12 04:43:54,897 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 04:43:54,899 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-12 04:43:54,900 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 04:43:54,901 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-12 04:43:54,902 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-12 04:43:54,904 INFO L87 Difference]: Start difference. First operand 59 states and 85 transitions. Second operand has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 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-11-12 04:43:55,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 04:43:55,173 INFO L93 Difference]: Finished difference Result 172 states and 250 transitions. [2024-11-12 04:43:55,176 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-12 04:43:55,176 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 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-11-12 04:43:55,177 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 04:43:55,179 INFO L225 Difference]: With dead ends: 172 [2024-11-12 04:43:55,179 INFO L226 Difference]: Without dead ends: 116 [2024-11-12 04:43:55,182 INFO L434 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-11-12 04:43:55,183 INFO L435 NwaCegarLoop]: 81 mSDtfsCounter, 62 mSDsluCounter, 201 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 282 SdHoareTripleChecker+Invalid, 92 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-12 04:43:55,185 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 282 Invalid, 92 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-12 04:43:55,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2024-11-12 04:43:55,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 85. [2024-11-12 04:43:55,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 56 states have (on average 1.2678571428571428) internal successors, (71), 56 states have internal predecessors, (71), 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-11-12 04:43:55,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 123 transitions. [2024-11-12 04:43:55,220 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 123 transitions. Word has length 87 [2024-11-12 04:43:55,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 04:43:55,223 INFO L471 AbstractCegarLoop]: Abstraction has 85 states and 123 transitions. [2024-11-12 04:43:55,224 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 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-11-12 04:43:55,224 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 123 transitions. [2024-11-12 04:43:55,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2024-11-12 04:43:55,228 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 04:43:55,229 INFO L218 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-11-12 04:43:55,229 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-12 04:43:55,229 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 04:43:55,230 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 04:43:55,231 INFO L85 PathProgramCache]: Analyzing trace with hash -1612350705, now seen corresponding path program 1 times [2024-11-12 04:43:55,231 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 04:43:55,231 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1739687420] [2024-11-12 04:43:55,232 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 04:43:55,232 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 04:43:55,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:43:58,013 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 04:43:58,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:43:58,016 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-12 04:43:58,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:43:58,019 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-12 04:43:58,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:43:58,021 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-12 04:43:58,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:43:58,023 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-12 04:43:58,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:43:58,025 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 04:43:58,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:43:58,027 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-12 04:43:58,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:43:58,031 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-12 04:43:58,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:43:58,036 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-12 04:43:58,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:43:58,042 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-12 04:43:58,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:43:58,046 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-12 04:43:58,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:43:58,048 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-12 04:43:58,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:43:58,051 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-12 04:43:58,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:43:58,054 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2024-11-12 04:43:58,055 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 04:43:58,055 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1739687420] [2024-11-12 04:43:58,055 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1739687420] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 04:43:58,056 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 04:43:58,056 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-12 04:43:58,056 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [327890935] [2024-11-12 04:43:58,056 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 04:43:58,058 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-12 04:43:58,058 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 04:43:58,059 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-12 04:43:58,059 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-11-12 04:43:58,060 INFO L87 Difference]: Start difference. First operand 85 states and 123 transitions. Second operand has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 6 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-11-12 04:43:58,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 04:43:58,596 INFO L93 Difference]: Finished difference Result 170 states and 246 transitions. [2024-11-12 04:43:58,597 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-12 04:43:58,598 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 6 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-11-12 04:43:58,598 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 04:43:58,600 INFO L225 Difference]: With dead ends: 170 [2024-11-12 04:43:58,600 INFO L226 Difference]: Without dead ends: 114 [2024-11-12 04:43:58,600 INFO L434 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-11-12 04:43:58,601 INFO L435 NwaCegarLoop]: 58 mSDtfsCounter, 123 mSDsluCounter, 118 mSDsCounter, 0 mSdLazyCounter, 131 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 123 SdHoareTripleChecker+Valid, 176 SdHoareTripleChecker+Invalid, 135 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 131 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-12 04:43:58,602 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [123 Valid, 176 Invalid, 135 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 131 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-12 04:43:58,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2024-11-12 04:43:58,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 96. [2024-11-12 04:43:58,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 67 states have (on average 1.3134328358208955) internal successors, (88), 67 states have internal predecessors, (88), 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-11-12 04:43:58,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 140 transitions. [2024-11-12 04:43:58,640 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 140 transitions. Word has length 87 [2024-11-12 04:43:58,641 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 04:43:58,641 INFO L471 AbstractCegarLoop]: Abstraction has 96 states and 140 transitions. [2024-11-12 04:43:58,641 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 6 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-11-12 04:43:58,642 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 140 transitions. [2024-11-12 04:43:58,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2024-11-12 04:43:58,643 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 04:43:58,643 INFO L218 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-11-12 04:43:58,643 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-12 04:43:58,644 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 04:43:58,644 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 04:43:58,645 INFO L85 PathProgramCache]: Analyzing trace with hash -932292335, now seen corresponding path program 1 times [2024-11-12 04:43:58,645 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 04:43:58,645 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [708858466] [2024-11-12 04:43:58,645 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 04:43:58,645 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 04:43:58,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:44:00,575 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 04:44:00,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:44:00,578 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-12 04:44:00,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:44:00,580 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-12 04:44:00,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:44:00,582 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-12 04:44:00,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:44:00,584 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-12 04:44:00,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:44:00,586 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 04:44:00,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:44:00,587 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-12 04:44:00,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:44:00,589 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-12 04:44:00,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:44:00,591 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-12 04:44:00,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:44:00,593 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-12 04:44:00,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:44:00,595 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-12 04:44:00,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:44:00,597 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-12 04:44:00,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:44:00,599 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-12 04:44:00,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:44:00,601 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2024-11-12 04:44:00,601 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 04:44:00,602 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [708858466] [2024-11-12 04:44:00,602 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [708858466] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 04:44:00,602 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 04:44:00,602 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-12 04:44:00,602 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1741500761] [2024-11-12 04:44:00,602 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 04:44:00,603 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-12 04:44:00,603 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 04:44:00,603 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-12 04:44:00,603 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-11-12 04:44:00,604 INFO L87 Difference]: Start difference. First operand 96 states and 140 transitions. Second operand has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 6 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-11-12 04:44:01,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 04:44:01,043 INFO L93 Difference]: Finished difference Result 181 states and 262 transitions. [2024-11-12 04:44:01,043 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-12 04:44:01,044 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 6 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-11-12 04:44:01,044 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 04:44:01,045 INFO L225 Difference]: With dead ends: 181 [2024-11-12 04:44:01,045 INFO L226 Difference]: Without dead ends: 114 [2024-11-12 04:44:01,046 INFO L434 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-11-12 04:44:01,047 INFO L435 NwaCegarLoop]: 69 mSDtfsCounter, 81 mSDsluCounter, 133 mSDsCounter, 0 mSdLazyCounter, 159 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 81 SdHoareTripleChecker+Valid, 202 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.3s IncrementalHoareTripleChecker+Time [2024-11-12 04:44:01,048 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [81 Valid, 202 Invalid, 162 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 159 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-12 04:44:01,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2024-11-12 04:44:01,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 85. [2024-11-12 04:44:01,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 56 states have (on average 1.25) internal successors, (70), 56 states have internal predecessors, (70), 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-11-12 04:44:01,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 122 transitions. [2024-11-12 04:44:01,063 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 122 transitions. Word has length 87 [2024-11-12 04:44:01,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 04:44:01,064 INFO L471 AbstractCegarLoop]: Abstraction has 85 states and 122 transitions. [2024-11-12 04:44:01,064 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 6 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-11-12 04:44:01,065 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 122 transitions. [2024-11-12 04:44:01,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2024-11-12 04:44:01,066 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 04:44:01,066 INFO L218 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] [2024-11-12 04:44:01,066 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-12 04:44:01,071 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 04:44:01,072 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 04:44:01,073 INFO L85 PathProgramCache]: Analyzing trace with hash -1191211448, now seen corresponding path program 1 times [2024-11-12 04:44:01,073 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 04:44:01,074 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1537353883] [2024-11-12 04:44:01,074 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 04:44:01,074 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 04:44:01,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:44:01,790 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 04:44:01,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:44:01,793 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-12 04:44:01,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:44:01,796 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-12 04:44:01,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:44:01,799 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-12 04:44:01,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:44:01,803 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-12 04:44:01,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:44:01,806 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 04:44:01,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:44:01,809 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-12 04:44:01,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:44:01,813 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-12 04:44:01,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:44:01,822 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-12 04:44:01,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:44:01,828 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-12 04:44:01,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:44:01,833 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-12 04:44:01,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:44:01,838 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-12 04:44:01,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:44:01,844 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-12 04:44:01,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:44:01,849 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2024-11-12 04:44:01,850 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 04:44:01,850 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1537353883] [2024-11-12 04:44:01,851 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1537353883] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 04:44:01,851 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 04:44:01,851 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-12 04:44:01,852 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2047170235] [2024-11-12 04:44:01,852 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 04:44:01,852 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-12 04:44:01,852 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 04:44:01,853 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-12 04:44:01,853 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-11-12 04:44:01,853 INFO L87 Difference]: Start difference. First operand 85 states and 122 transitions. Second operand has 9 states, 9 states have (on average 3.0) internal successors, (27), 9 states have internal predecessors, (27), 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-11-12 04:44:02,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 04:44:02,322 INFO L93 Difference]: Finished difference Result 202 states and 290 transitions. [2024-11-12 04:44:02,323 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-12 04:44:02,323 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.0) internal successors, (27), 9 states have internal predecessors, (27), 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 89 [2024-11-12 04:44:02,323 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 04:44:02,325 INFO L225 Difference]: With dead ends: 202 [2024-11-12 04:44:02,325 INFO L226 Difference]: Without dead ends: 146 [2024-11-12 04:44:02,325 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 30 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=62, Invalid=148, Unknown=0, NotChecked=0, Total=210 [2024-11-12 04:44:02,326 INFO L435 NwaCegarLoop]: 98 mSDtfsCounter, 100 mSDsluCounter, 370 mSDsCounter, 0 mSdLazyCounter, 344 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 100 SdHoareTripleChecker+Valid, 468 SdHoareTripleChecker+Invalid, 376 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 344 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-12 04:44:02,327 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [100 Valid, 468 Invalid, 376 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 344 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-12 04:44:02,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2024-11-12 04:44:02,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 143. [2024-11-12 04:44:02,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 143 states, 100 states have (on average 1.22) internal successors, (122), 100 states have internal predecessors, (122), 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-11-12 04:44:02,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 200 transitions. [2024-11-12 04:44:02,345 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 200 transitions. Word has length 89 [2024-11-12 04:44:02,345 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 04:44:02,345 INFO L471 AbstractCegarLoop]: Abstraction has 143 states and 200 transitions. [2024-11-12 04:44:02,346 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.0) internal successors, (27), 9 states have internal predecessors, (27), 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-11-12 04:44:02,346 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 200 transitions. [2024-11-12 04:44:02,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2024-11-12 04:44:02,347 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 04:44:02,347 INFO L218 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] [2024-11-12 04:44:02,347 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-12 04:44:02,347 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 04:44:02,348 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 04:44:02,348 INFO L85 PathProgramCache]: Analyzing trace with hash 1611278920, now seen corresponding path program 1 times [2024-11-12 04:44:02,348 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 04:44:02,348 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2010004083] [2024-11-12 04:44:02,349 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 04:44:02,349 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 04:44:02,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:44:02,479 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 04:44:02,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:44:02,481 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-12 04:44:02,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:44:02,482 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-12 04:44:02,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:44:02,484 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-12 04:44:02,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:44:02,486 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-12 04:44:02,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:44:02,487 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 04:44:02,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:44:02,489 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-12 04:44:02,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:44:02,490 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-12 04:44:02,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:44:02,492 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-12 04:44:02,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:44:02,493 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-12 04:44:02,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:44:02,495 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-12 04:44:02,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:44:02,496 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-12 04:44:02,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:44:02,497 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-12 04:44:02,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:44:02,499 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2024-11-12 04:44:02,499 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 04:44:02,499 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2010004083] [2024-11-12 04:44:02,500 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2010004083] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 04:44:02,500 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 04:44:02,500 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-12 04:44:02,500 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [82125349] [2024-11-12 04:44:02,500 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 04:44:02,501 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 04:44:02,501 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 04:44:02,501 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 04:44:02,502 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 04:44:02,502 INFO L87 Difference]: Start difference. First operand 143 states and 200 transitions. Second operand has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 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-11-12 04:44:02,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 04:44:02,564 INFO L93 Difference]: Finished difference Result 275 states and 379 transitions. [2024-11-12 04:44:02,565 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 04:44:02,565 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 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 91 [2024-11-12 04:44:02,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 04:44:02,566 INFO L225 Difference]: With dead ends: 275 [2024-11-12 04:44:02,567 INFO L226 Difference]: Without dead ends: 161 [2024-11-12 04:44:02,567 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 04:44:02,568 INFO L435 NwaCegarLoop]: 85 mSDtfsCounter, 9 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 150 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 04:44:02,569 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 150 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 04:44:02,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2024-11-12 04:44:02,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 149. [2024-11-12 04:44:02,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 149 states, 106 states have (on average 1.2075471698113207) internal successors, (128), 106 states have internal predecessors, (128), 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-11-12 04:44:02,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 206 transitions. [2024-11-12 04:44:02,591 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 206 transitions. Word has length 91 [2024-11-12 04:44:02,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 04:44:02,591 INFO L471 AbstractCegarLoop]: Abstraction has 149 states and 206 transitions. [2024-11-12 04:44:02,592 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 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-11-12 04:44:02,592 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 206 transitions. [2024-11-12 04:44:02,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2024-11-12 04:44:02,592 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 04:44:02,593 INFO L218 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] [2024-11-12 04:44:02,593 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-12 04:44:02,593 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 04:44:02,593 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 04:44:02,595 INFO L85 PathProgramCache]: Analyzing trace with hash 1697688837, now seen corresponding path program 1 times [2024-11-12 04:44:02,595 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 04:44:02,595 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [797373103] [2024-11-12 04:44:02,595 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 04:44:02,596 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 04:44:02,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:44:03,479 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 04:44:03,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:44:03,489 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-12 04:44:03,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:44:03,493 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-12 04:44:03,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:44:03,497 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-12 04:44:03,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:44:03,501 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-12 04:44:03,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:44:03,504 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 04:44:03,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:44:03,508 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-12 04:44:03,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:44:03,512 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-12 04:44:03,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:44:03,519 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-12 04:44:03,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:44:03,528 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-12 04:44:03,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:44:03,540 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-12 04:44:03,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:44:03,544 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-12 04:44:03,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:44:03,552 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-12 04:44:03,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:44:03,565 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2024-11-12 04:44:03,565 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 04:44:03,565 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [797373103] [2024-11-12 04:44:03,566 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [797373103] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 04:44:03,566 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 04:44:03,566 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-12 04:44:03,566 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [352167715] [2024-11-12 04:44:03,566 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 04:44:03,566 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-12 04:44:03,566 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 04:44:03,567 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-12 04:44:03,567 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2024-11-12 04:44:03,567 INFO L87 Difference]: Start difference. First operand 149 states and 206 transitions. Second operand has 10 states, 10 states have (on average 3.0) internal successors, (30), 10 states have internal predecessors, (30), 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-11-12 04:44:04,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 04:44:04,364 INFO L93 Difference]: Finished difference Result 165 states and 222 transitions. [2024-11-12 04:44:04,364 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-12 04:44:04,364 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.0) internal successors, (30), 10 states have internal predecessors, (30), 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 92 [2024-11-12 04:44:04,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 04:44:04,366 INFO L225 Difference]: With dead ends: 165 [2024-11-12 04:44:04,366 INFO L226 Difference]: Without dead ends: 163 [2024-11-12 04:44:04,367 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=86, Invalid=256, Unknown=0, NotChecked=0, Total=342 [2024-11-12 04:44:04,368 INFO L435 NwaCegarLoop]: 91 mSDtfsCounter, 171 mSDsluCounter, 286 mSDsCounter, 0 mSdLazyCounter, 400 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 171 SdHoareTripleChecker+Valid, 377 SdHoareTripleChecker+Invalid, 429 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 400 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-12 04:44:04,368 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [171 Valid, 377 Invalid, 429 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 400 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-12 04:44:04,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2024-11-12 04:44:04,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 155. [2024-11-12 04:44:04,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 155 states, 112 states have (on average 1.1964285714285714) internal successors, (134), 112 states have internal predecessors, (134), 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-11-12 04:44:04,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 212 transitions. [2024-11-12 04:44:04,393 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 212 transitions. Word has length 92 [2024-11-12 04:44:04,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 04:44:04,394 INFO L471 AbstractCegarLoop]: Abstraction has 155 states and 212 transitions. [2024-11-12 04:44:04,394 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.0) internal successors, (30), 10 states have internal predecessors, (30), 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-11-12 04:44:04,394 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 212 transitions. [2024-11-12 04:44:04,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2024-11-12 04:44:04,395 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 04:44:04,395 INFO L218 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] [2024-11-12 04:44:04,395 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-12 04:44:04,395 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 04:44:04,396 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 04:44:04,396 INFO L85 PathProgramCache]: Analyzing trace with hash -591190857, now seen corresponding path program 1 times [2024-11-12 04:44:04,396 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 04:44:04,396 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [914288600] [2024-11-12 04:44:04,396 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 04:44:04,397 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 04:44:04,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:44:04,454 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 04:44:04,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:44:04,456 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-12 04:44:04,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:44:04,458 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-12 04:44:04,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:44:04,460 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-12 04:44:04,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:44:04,461 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-12 04:44:04,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:44:04,463 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 04:44:04,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:44:04,465 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-12 04:44:04,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:44:04,466 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-12 04:44:04,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:44:04,468 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-12 04:44:04,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:44:04,469 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-12 04:44:04,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:44:04,471 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-12 04:44:04,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:44:04,472 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-12 04:44:04,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:44:04,473 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-12 04:44:04,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:44:04,475 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2024-11-12 04:44:04,475 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 04:44:04,476 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [914288600] [2024-11-12 04:44:04,476 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [914288600] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 04:44:04,476 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 04:44:04,476 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-12 04:44:04,476 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [328067111] [2024-11-12 04:44:04,476 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 04:44:04,477 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 04:44:04,477 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 04:44:04,477 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 04:44:04,477 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 04:44:04,478 INFO L87 Difference]: Start difference. First operand 155 states and 212 transitions. Second operand has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 1 states have call successors, (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-11-12 04:44:04,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 04:44:04,527 INFO L93 Difference]: Finished difference Result 335 states and 452 transitions. [2024-11-12 04:44:04,527 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 04:44:04,528 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 1 states have call successors, (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 99 [2024-11-12 04:44:04,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 04:44:04,529 INFO L225 Difference]: With dead ends: 335 [2024-11-12 04:44:04,529 INFO L226 Difference]: Without dead ends: 209 [2024-11-12 04:44:04,530 INFO L434 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-11-12 04:44:04,531 INFO L435 NwaCegarLoop]: 90 mSDtfsCounter, 31 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 158 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 04:44:04,531 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 158 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 04:44:04,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2024-11-12 04:44:04,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 207. [2024-11-12 04:44:04,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 207 states, 147 states have (on average 1.163265306122449) internal successors, (171), 149 states have internal predecessors, (171), 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-11-12 04:44:04,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 277 transitions. [2024-11-12 04:44:04,560 INFO L78 Accepts]: Start accepts. Automaton has 207 states and 277 transitions. Word has length 99 [2024-11-12 04:44:04,560 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 04:44:04,561 INFO L471 AbstractCegarLoop]: Abstraction has 207 states and 277 transitions. [2024-11-12 04:44:04,561 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 1 states have call successors, (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-11-12 04:44:04,561 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 277 transitions. [2024-11-12 04:44:04,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2024-11-12 04:44:04,562 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 04:44:04,562 INFO L218 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, 1, 1, 1, 1] [2024-11-12 04:44:04,563 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-12 04:44:04,563 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 04:44:04,564 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 04:44:04,564 INFO L85 PathProgramCache]: Analyzing trace with hash -867068570, now seen corresponding path program 1 times [2024-11-12 04:44:04,564 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 04:44:04,565 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [156000462] [2024-11-12 04:44:04,565 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 04:44:04,565 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 04:44:04,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:44:05,915 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 04:44:05,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:44:05,920 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-12 04:44:05,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:44:05,924 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-12 04:44:05,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:44:05,929 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-12 04:44:05,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:44:05,936 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-12 04:44:05,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:44:05,941 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 04:44:05,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:44:05,945 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-12 04:44:05,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:44:05,950 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-12 04:44:05,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:44:05,953 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-12 04:44:05,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:44:05,957 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-12 04:44:05,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:44:05,961 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-12 04:44:05,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:44:05,967 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-12 04:44:05,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:44:05,973 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-12 04:44:05,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:44:05,978 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2024-11-12 04:44:05,978 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 04:44:05,979 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [156000462] [2024-11-12 04:44:05,979 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [156000462] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 04:44:05,979 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 04:44:05,979 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2024-11-12 04:44:05,979 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1106000070] [2024-11-12 04:44:05,979 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 04:44:05,980 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-12 04:44:05,980 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 04:44:05,981 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-12 04:44:05,981 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2024-11-12 04:44:05,982 INFO L87 Difference]: Start difference. First operand 207 states and 277 transitions. Second operand has 14 states, 14 states have (on average 3.0714285714285716) internal successors, (43), 14 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-11-12 04:44:07,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 04:44:07,492 INFO L93 Difference]: Finished difference Result 258 states and 329 transitions. [2024-11-12 04:44:07,493 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2024-11-12 04:44:07,493 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 3.0714285714285716) internal successors, (43), 14 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 105 [2024-11-12 04:44:07,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 04:44:07,496 INFO L225 Difference]: With dead ends: 258 [2024-11-12 04:44:07,496 INFO L226 Difference]: Without dead ends: 256 [2024-11-12 04:44:07,497 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 170 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=248, Invalid=942, Unknown=0, NotChecked=0, Total=1190 [2024-11-12 04:44:07,498 INFO L435 NwaCegarLoop]: 98 mSDtfsCounter, 143 mSDsluCounter, 504 mSDsCounter, 0 mSdLazyCounter, 921 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 143 SdHoareTripleChecker+Valid, 602 SdHoareTripleChecker+Invalid, 949 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 921 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-12 04:44:07,498 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [143 Valid, 602 Invalid, 949 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 921 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-12 04:44:07,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 256 states. [2024-11-12 04:44:07,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 256 to 219. [2024-11-12 04:44:07,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 219 states, 159 states have (on average 1.1635220125786163) internal successors, (185), 161 states have internal predecessors, (185), 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-11-12 04:44:07,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 219 states and 291 transitions. [2024-11-12 04:44:07,532 INFO L78 Accepts]: Start accepts. Automaton has 219 states and 291 transitions. Word has length 105 [2024-11-12 04:44:07,533 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 04:44:07,533 INFO L471 AbstractCegarLoop]: Abstraction has 219 states and 291 transitions. [2024-11-12 04:44:07,533 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.0714285714285716) internal successors, (43), 14 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-11-12 04:44:07,533 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 291 transitions. [2024-11-12 04:44:07,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2024-11-12 04:44:07,535 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 04:44:07,535 INFO L218 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, 1, 1, 1, 1] [2024-11-12 04:44:07,535 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-12 04:44:07,535 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 04:44:07,536 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 04:44:07,536 INFO L85 PathProgramCache]: Analyzing trace with hash 1127076136, now seen corresponding path program 1 times [2024-11-12 04:44:07,536 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 04:44:07,536 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [283678347] [2024-11-12 04:44:07,536 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 04:44:07,536 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 04:44:07,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:44:07,618 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 04:44:07,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:44:07,622 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-12 04:44:07,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:44:07,624 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-12 04:44:07,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:44:07,626 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-12 04:44:07,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:44:07,628 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-12 04:44:07,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:44:07,630 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 04:44:07,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:44:07,632 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-12 04:44:07,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:44:07,635 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-12 04:44:07,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:44:07,636 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-12 04:44:07,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:44:07,638 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-12 04:44:07,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:44:07,640 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-12 04:44:07,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:44:07,642 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-12 04:44:07,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:44:07,644 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-12 04:44:07,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:44:07,646 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2024-11-12 04:44:07,646 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 04:44:07,646 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [283678347] [2024-11-12 04:44:07,647 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [283678347] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 04:44:07,647 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 04:44:07,647 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-12 04:44:07,647 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1722664491] [2024-11-12 04:44:07,647 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 04:44:07,647 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-12 04:44:07,648 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 04:44:07,648 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-12 04:44:07,648 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-12 04:44:07,649 INFO L87 Difference]: Start difference. First operand 219 states and 291 transitions. Second operand has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 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-11-12 04:44:07,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 04:44:07,744 INFO L93 Difference]: Finished difference Result 389 states and 519 transitions. [2024-11-12 04:44:07,745 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-12 04:44:07,745 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 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 105 [2024-11-12 04:44:07,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 04:44:07,747 INFO L225 Difference]: With dead ends: 389 [2024-11-12 04:44:07,747 INFO L226 Difference]: Without dead ends: 203 [2024-11-12 04:44:07,747 INFO L434 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-11-12 04:44:07,748 INFO L435 NwaCegarLoop]: 72 mSDtfsCounter, 40 mSDsluCounter, 120 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 192 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-12 04:44:07,749 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 192 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-12 04:44:07,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2024-11-12 04:44:07,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 203. [2024-11-12 04:44:07,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 203 states, 143 states have (on average 1.1538461538461537) internal successors, (165), 145 states have internal predecessors, (165), 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-11-12 04:44:07,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 271 transitions. [2024-11-12 04:44:07,774 INFO L78 Accepts]: Start accepts. Automaton has 203 states and 271 transitions. Word has length 105 [2024-11-12 04:44:07,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 04:44:07,775 INFO L471 AbstractCegarLoop]: Abstraction has 203 states and 271 transitions. [2024-11-12 04:44:07,775 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 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-11-12 04:44:07,776 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 271 transitions. [2024-11-12 04:44:07,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2024-11-12 04:44:07,778 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 04:44:07,778 INFO L218 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, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 04:44:07,778 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-12 04:44:07,778 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 04:44:07,779 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 04:44:07,779 INFO L85 PathProgramCache]: Analyzing trace with hash 821982124, now seen corresponding path program 1 times [2024-11-12 04:44:07,779 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 04:44:07,779 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [374144270] [2024-11-12 04:44:07,780 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 04:44:07,780 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 04:44:07,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:44:10,336 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 04:44:10,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:44:10,339 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-12 04:44:10,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:44:10,340 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-12 04:44:10,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:44:10,342 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-12 04:44:10,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:44:10,343 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-12 04:44:10,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:44:10,344 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 04:44:10,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:44:10,345 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-12 04:44:10,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:44:10,347 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-12 04:44:10,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:44:10,348 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-12 04:44:10,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:44:10,349 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-12 04:44:10,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:44:10,351 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-12 04:44:10,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:44:10,352 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-12 04:44:10,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:44:10,353 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-12 04:44:10,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:44:10,355 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-11-12 04:44:10,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:44:10,356 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-12 04:44:10,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:44:10,357 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-12 04:44:10,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:44:10,358 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-12 04:44:10,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:44:10,360 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-11-12 04:44:10,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:44:10,361 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-11-12 04:44:10,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:44:10,363 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-11-12 04:44:10,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:44:10,364 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-11-12 04:44:10,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:44:10,366 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-11-12 04:44:10,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:44:10,367 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-11-12 04:44:10,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:44:10,368 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2024-11-12 04:44:10,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:44:10,369 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2024-11-12 04:44:10,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:44:10,371 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2024-11-12 04:44:10,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:44:10,373 INFO L134 CoverageAnalysis]: Checked inductivity of 1333 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 1322 trivial. 0 not checked. [2024-11-12 04:44:10,373 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 04:44:10,373 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [374144270] [2024-11-12 04:44:10,373 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [374144270] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 04:44:10,373 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 04:44:10,373 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2024-11-12 04:44:10,374 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1767284157] [2024-11-12 04:44:10,374 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 04:44:10,374 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-12 04:44:10,374 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 04:44:10,375 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-12 04:44:10,375 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2024-11-12 04:44:10,375 INFO L87 Difference]: Start difference. First operand 203 states and 271 transitions. Second operand has 13 states, 13 states have (on average 3.5384615384615383) internal successors, (46), 13 states have internal predecessors, (46), 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-11-12 04:44:11,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 04:44:11,356 INFO L93 Difference]: Finished difference Result 398 states and 529 transitions. [2024-11-12 04:44:11,357 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-12 04:44:11,357 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 3.5384615384615383) internal successors, (46), 13 states have internal predecessors, (46), 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-11-12 04:44:11,357 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 04:44:11,359 INFO L225 Difference]: With dead ends: 398 [2024-11-12 04:44:11,359 INFO L226 Difference]: Without dead ends: 310 [2024-11-12 04:44:11,360 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 57 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=78, Invalid=264, Unknown=0, NotChecked=0, Total=342 [2024-11-12 04:44:11,360 INFO L435 NwaCegarLoop]: 117 mSDtfsCounter, 91 mSDsluCounter, 690 mSDsCounter, 0 mSdLazyCounter, 714 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 91 SdHoareTripleChecker+Valid, 807 SdHoareTripleChecker+Invalid, 717 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 714 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-12 04:44:11,361 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [91 Valid, 807 Invalid, 717 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 714 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-12 04:44:11,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 310 states. [2024-11-12 04:44:11,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 310 to 288. [2024-11-12 04:44:11,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 288 states, 210 states have (on average 1.180952380952381) internal successors, (248), 214 states have internal predecessors, (248), 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-11-12 04:44:11,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 288 states to 288 states and 386 transitions. [2024-11-12 04:44:11,397 INFO L78 Accepts]: Start accepts. Automaton has 288 states and 386 transitions. Word has length 181 [2024-11-12 04:44:11,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 04:44:11,397 INFO L471 AbstractCegarLoop]: Abstraction has 288 states and 386 transitions. [2024-11-12 04:44:11,398 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 3.5384615384615383) internal successors, (46), 13 states have internal predecessors, (46), 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-11-12 04:44:11,398 INFO L276 IsEmpty]: Start isEmpty. Operand 288 states and 386 transitions. [2024-11-12 04:44:11,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2024-11-12 04:44:11,399 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 04:44:11,400 INFO L218 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, 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-11-12 04:44:11,400 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-12 04:44:11,400 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 04:44:11,400 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 04:44:11,400 INFO L85 PathProgramCache]: Analyzing trace with hash -762564678, now seen corresponding path program 1 times [2024-11-12 04:44:11,401 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 04:44:11,401 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [207807542] [2024-11-12 04:44:11,401 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 04:44:11,401 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 04:44:11,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:44:11,476 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 04:44:11,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:44:11,480 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-12 04:44:11,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:44:11,481 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-12 04:44:11,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:44:11,482 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-12 04:44:11,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:44:11,484 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-12 04:44:11,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:44:11,485 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 04:44:11,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:44:11,486 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-12 04:44:11,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:44:11,488 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-12 04:44:11,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:44:11,489 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-12 04:44:11,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:44:11,490 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-12 04:44:11,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:44:11,491 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-12 04:44:11,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:44:11,492 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-12 04:44:11,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:44:11,493 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-12 04:44:11,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:44:11,494 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-11-12 04:44:11,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:44:11,497 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-12 04:44:11,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:44:11,498 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-12 04:44:11,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:44:11,499 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-12 04:44:11,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:44:11,500 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-11-12 04:44:11,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:44:11,501 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-11-12 04:44:11,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:44:11,504 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-11-12 04:44:11,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:44:11,505 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-11-12 04:44:11,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:44:11,506 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-11-12 04:44:11,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:44:11,507 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-11-12 04:44:11,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:44:11,509 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2024-11-12 04:44:11,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:44:11,510 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2024-11-12 04:44:11,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:44:11,512 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2024-11-12 04:44:11,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:44:11,513 INFO L134 CoverageAnalysis]: Checked inductivity of 1333 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 1326 trivial. 0 not checked. [2024-11-12 04:44:11,513 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 04:44:11,513 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [207807542] [2024-11-12 04:44:11,514 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [207807542] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 04:44:11,514 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 04:44:11,514 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-12 04:44:11,514 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1066017676] [2024-11-12 04:44:11,514 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 04:44:11,514 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 04:44:11,515 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 04:44:11,515 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 04:44:11,515 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 04:44:11,515 INFO L87 Difference]: Start difference. First operand 288 states and 386 transitions. Second operand has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 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-11-12 04:44:11,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 04:44:11,610 INFO L93 Difference]: Finished difference Result 624 states and 839 transitions. [2024-11-12 04:44:11,610 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 04:44:11,610 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 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 184 [2024-11-12 04:44:11,611 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 04:44:11,616 INFO L225 Difference]: With dead ends: 624 [2024-11-12 04:44:11,616 INFO L226 Difference]: Without dead ends: 451 [2024-11-12 04:44:11,617 INFO L434 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-11-12 04:44:11,618 INFO L435 NwaCegarLoop]: 81 mSDtfsCounter, 64 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 136 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 04:44:11,618 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 136 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 04:44:11,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 451 states. [2024-11-12 04:44:11,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 451 to 293. [2024-11-12 04:44:11,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 293 states, 215 states have (on average 1.1813953488372093) internal successors, (254), 219 states have internal predecessors, (254), 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-11-12 04:44:11,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 293 states to 293 states and 392 transitions. [2024-11-12 04:44:11,665 INFO L78 Accepts]: Start accepts. Automaton has 293 states and 392 transitions. Word has length 184 [2024-11-12 04:44:11,668 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 04:44:11,668 INFO L471 AbstractCegarLoop]: Abstraction has 293 states and 392 transitions. [2024-11-12 04:44:11,669 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 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-11-12 04:44:11,669 INFO L276 IsEmpty]: Start isEmpty. Operand 293 states and 392 transitions. [2024-11-12 04:44:11,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2024-11-12 04:44:11,671 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 04:44:11,671 INFO L218 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, 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] [2024-11-12 04:44:11,672 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-12 04:44:11,672 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 04:44:11,672 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 04:44:11,672 INFO L85 PathProgramCache]: Analyzing trace with hash -181504122, now seen corresponding path program 1 times [2024-11-12 04:44:11,672 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 04:44:11,672 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [538624709] [2024-11-12 04:44:11,673 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 04:44:11,673 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 04:44:11,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:44:11,850 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 04:44:11,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:44:11,852 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-12 04:44:11,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:44:11,853 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-12 04:44:11,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:44:11,855 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-12 04:44:11,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:44:11,856 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-12 04:44:11,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:44:11,857 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 04:44:11,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:44:11,858 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-12 04:44:11,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:44:11,860 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-12 04:44:11,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:44:11,861 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-12 04:44:11,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:44:11,862 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-12 04:44:11,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:44:11,863 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-12 04:44:11,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:44:11,865 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-12 04:44:11,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:44:11,866 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-12 04:44:11,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:44:11,867 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-11-12 04:44:11,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:44:11,868 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-12 04:44:11,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:44:11,869 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-12 04:44:11,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:44:11,871 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-12 04:44:11,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:44:11,872 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-11-12 04:44:11,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:44:11,874 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-11-12 04:44:11,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:44:11,875 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-11-12 04:44:11,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:44:11,876 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-11-12 04:44:11,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:44:11,877 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-11-12 04:44:11,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:44:11,878 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-11-12 04:44:11,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:44:11,880 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2024-11-12 04:44:11,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:44:11,881 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2024-11-12 04:44:11,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:44:11,882 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2024-11-12 04:44:11,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:44:11,884 INFO L134 CoverageAnalysis]: Checked inductivity of 1333 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 1323 trivial. 0 not checked. [2024-11-12 04:44:11,884 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 04:44:11,884 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [538624709] [2024-11-12 04:44:11,884 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [538624709] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 04:44:11,885 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 04:44:11,885 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-12 04:44:11,885 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1690280209] [2024-11-12 04:44:11,885 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 04:44:11,885 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-12 04:44:11,885 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 04:44:11,886 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-12 04:44:11,886 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-12 04:44:11,886 INFO L87 Difference]: Start difference. First operand 293 states and 392 transitions. Second operand has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 1 states have call successors, (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-11-12 04:44:12,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 04:44:12,046 INFO L93 Difference]: Finished difference Result 654 states and 877 transitions. [2024-11-12 04:44:12,047 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-12 04:44:12,047 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 1 states have call successors, (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 187 [2024-11-12 04:44:12,048 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 04:44:12,050 INFO L225 Difference]: With dead ends: 654 [2024-11-12 04:44:12,051 INFO L226 Difference]: Without dead ends: 476 [2024-11-12 04:44:12,051 INFO L434 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-11-12 04:44:12,052 INFO L435 NwaCegarLoop]: 155 mSDtfsCounter, 129 mSDsluCounter, 107 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 129 SdHoareTripleChecker+Valid, 262 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-12 04:44:12,052 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [129 Valid, 262 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-12 04:44:12,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 476 states. [2024-11-12 04:44:12,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 476 to 408. [2024-11-12 04:44:12,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 408 states, 290 states have (on average 1.1275862068965516) internal successors, (327), 297 states have internal predecessors, (327), 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-11-12 04:44:12,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 408 states to 408 states and 537 transitions. [2024-11-12 04:44:12,107 INFO L78 Accepts]: Start accepts. Automaton has 408 states and 537 transitions. Word has length 187 [2024-11-12 04:44:12,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 04:44:12,108 INFO L471 AbstractCegarLoop]: Abstraction has 408 states and 537 transitions. [2024-11-12 04:44:12,108 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 1 states have call successors, (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-11-12 04:44:12,108 INFO L276 IsEmpty]: Start isEmpty. Operand 408 states and 537 transitions. [2024-11-12 04:44:12,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2024-11-12 04:44:12,110 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 04:44:12,110 INFO L218 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, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 04:44:12,110 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-12 04:44:12,111 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 04:44:12,111 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 04:44:12,111 INFO L85 PathProgramCache]: Analyzing trace with hash 1603055788, now seen corresponding path program 1 times [2024-11-12 04:44:12,111 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 04:44:12,111 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [565300594] [2024-11-12 04:44:12,111 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 04:44:12,112 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 04:44:12,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:44:13,487 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 04:44:13,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:44:13,489 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-12 04:44:13,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:44:13,490 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-12 04:44:13,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:44:13,492 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-12 04:44:13,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:44:13,494 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-12 04:44:13,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:44:13,495 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 04:44:13,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:44:13,496 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-12 04:44:13,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:44:13,497 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-12 04:44:13,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:44:13,499 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-12 04:44:13,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:44:13,500 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-12 04:44:13,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:44:13,501 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-12 04:44:13,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:44:13,502 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-12 04:44:13,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:44:13,503 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-12 04:44:13,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:44:13,505 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-11-12 04:44:13,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:44:13,506 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-12 04:44:13,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:44:13,508 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-12 04:44:13,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:44:13,510 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-12 04:44:13,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:44:13,512 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-11-12 04:44:13,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:44:13,514 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-11-12 04:44:13,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:44:13,516 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-11-12 04:44:13,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:44:13,520 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-11-12 04:44:13,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:44:13,521 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-11-12 04:44:13,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:44:13,523 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-11-12 04:44:13,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:44:13,524 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2024-11-12 04:44:13,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:44:13,525 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2024-11-12 04:44:13,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:44:13,526 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2024-11-12 04:44:13,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:44:13,528 INFO L134 CoverageAnalysis]: Checked inductivity of 1333 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 1323 trivial. 0 not checked. [2024-11-12 04:44:13,529 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 04:44:13,529 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [565300594] [2024-11-12 04:44:13,529 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [565300594] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 04:44:13,529 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 04:44:13,529 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2024-11-12 04:44:13,529 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [450706719] [2024-11-12 04:44:13,529 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 04:44:13,530 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-12 04:44:13,530 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 04:44:13,531 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-12 04:44:13,531 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=134, Unknown=0, NotChecked=0, Total=182 [2024-11-12 04:44:13,531 INFO L87 Difference]: Start difference. First operand 408 states and 537 transitions. Second operand has 14 states, 14 states have (on average 4.0) internal successors, (56), 14 states have internal predecessors, (56), 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-11-12 04:44:14,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 04:44:14,180 INFO L93 Difference]: Finished difference Result 535 states and 668 transitions. [2024-11-12 04:44:14,181 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-11-12 04:44:14,181 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 4.0) internal successors, (56), 14 states have internal predecessors, (56), 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 191 [2024-11-12 04:44:14,182 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 04:44:14,185 INFO L225 Difference]: With dead ends: 535 [2024-11-12 04:44:14,185 INFO L226 Difference]: Without dead ends: 533 [2024-11-12 04:44:14,185 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 90 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=136, Invalid=464, Unknown=0, NotChecked=0, Total=600 [2024-11-12 04:44:14,186 INFO L435 NwaCegarLoop]: 97 mSDtfsCounter, 160 mSDsluCounter, 325 mSDsCounter, 0 mSdLazyCounter, 397 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 160 SdHoareTripleChecker+Valid, 422 SdHoareTripleChecker+Invalid, 402 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 397 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-12 04:44:14,186 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [160 Valid, 422 Invalid, 402 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 397 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-12 04:44:14,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 533 states. [2024-11-12 04:44:14,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 533 to 432. [2024-11-12 04:44:14,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 432 states, 314 states have (on average 1.1305732484076434) internal successors, (355), 321 states have internal predecessors, (355), 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-11-12 04:44:14,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 432 states to 432 states and 565 transitions. [2024-11-12 04:44:14,261 INFO L78 Accepts]: Start accepts. Automaton has 432 states and 565 transitions. Word has length 191 [2024-11-12 04:44:14,261 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 04:44:14,261 INFO L471 AbstractCegarLoop]: Abstraction has 432 states and 565 transitions. [2024-11-12 04:44:14,261 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 4.0) internal successors, (56), 14 states have internal predecessors, (56), 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-11-12 04:44:14,261 INFO L276 IsEmpty]: Start isEmpty. Operand 432 states and 565 transitions. [2024-11-12 04:44:14,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2024-11-12 04:44:14,263 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 04:44:14,264 INFO L218 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, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 04:44:14,264 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-12 04:44:14,265 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 04:44:14,265 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 04:44:14,265 INFO L85 PathProgramCache]: Analyzing trace with hash -697766802, now seen corresponding path program 1 times [2024-11-12 04:44:14,265 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 04:44:14,265 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [69777867] [2024-11-12 04:44:14,266 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 04:44:14,266 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 04:44:14,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:44:14,477 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 04:44:14,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:44:14,479 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-12 04:44:14,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:44:14,480 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-12 04:44:14,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:44:14,481 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-12 04:44:14,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:44:14,483 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-12 04:44:14,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:44:14,484 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 04:44:14,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:44:14,486 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-12 04:44:14,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:44:14,487 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-12 04:44:14,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:44:14,491 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-12 04:44:14,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:44:14,493 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-12 04:44:14,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:44:14,494 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-12 04:44:14,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:44:14,496 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-12 04:44:14,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:44:14,497 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-12 04:44:14,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:44:14,498 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-11-12 04:44:14,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:44:14,499 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-12 04:44:14,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:44:14,500 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-12 04:44:14,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:44:14,501 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-12 04:44:14,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:44:14,502 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-11-12 04:44:14,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:44:14,504 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-11-12 04:44:14,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:44:14,505 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-11-12 04:44:14,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:44:14,506 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-11-12 04:44:14,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:44:14,507 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-11-12 04:44:14,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:44:14,508 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-11-12 04:44:14,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:44:14,509 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2024-11-12 04:44:14,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:44:14,514 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2024-11-12 04:44:14,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:44:14,516 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2024-11-12 04:44:14,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:44:14,519 INFO L134 CoverageAnalysis]: Checked inductivity of 1333 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 1323 trivial. 0 not checked. [2024-11-12 04:44:14,519 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 04:44:14,519 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [69777867] [2024-11-12 04:44:14,519 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [69777867] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 04:44:14,519 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 04:44:14,519 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-12 04:44:14,519 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [176478685] [2024-11-12 04:44:14,520 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 04:44:14,520 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-12 04:44:14,520 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 04:44:14,521 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-12 04:44:14,521 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-12 04:44:14,521 INFO L87 Difference]: Start difference. First operand 432 states and 565 transitions. Second operand has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 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-11-12 04:44:14,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 04:44:14,772 INFO L93 Difference]: Finished difference Result 796 states and 1043 transitions. [2024-11-12 04:44:14,772 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-12 04:44:14,773 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 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 191 [2024-11-12 04:44:14,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 04:44:14,777 INFO L225 Difference]: With dead ends: 796 [2024-11-12 04:44:14,777 INFO L226 Difference]: Without dead ends: 479 [2024-11-12 04:44:14,780 INFO L434 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-11-12 04:44:14,780 INFO L435 NwaCegarLoop]: 155 mSDtfsCounter, 126 mSDsluCounter, 151 mSDsCounter, 0 mSdLazyCounter, 158 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 126 SdHoareTripleChecker+Valid, 306 SdHoareTripleChecker+Invalid, 160 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 158 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-12 04:44:14,781 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [126 Valid, 306 Invalid, 160 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 158 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-12 04:44:14,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 479 states. [2024-11-12 04:44:14,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 479 to 329. [2024-11-12 04:44:14,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 329 states, 233 states have (on average 1.1158798283261802) internal successors, (260), 239 states have internal predecessors, (260), 85 states have call successors, (85), 10 states have call predecessors, (85), 10 states have return successors, (85), 79 states have call predecessors, (85), 85 states have call successors, (85) [2024-11-12 04:44:14,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 329 states to 329 states and 430 transitions. [2024-11-12 04:44:14,835 INFO L78 Accepts]: Start accepts. Automaton has 329 states and 430 transitions. Word has length 191 [2024-11-12 04:44:14,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 04:44:14,836 INFO L471 AbstractCegarLoop]: Abstraction has 329 states and 430 transitions. [2024-11-12 04:44:14,837 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 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-11-12 04:44:14,837 INFO L276 IsEmpty]: Start isEmpty. Operand 329 states and 430 transitions. [2024-11-12 04:44:14,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 268 [2024-11-12 04:44:14,840 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 04:44:14,841 INFO L218 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, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 04:44:14,841 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-12 04:44:14,841 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 04:44:14,841 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 04:44:14,842 INFO L85 PathProgramCache]: Analyzing trace with hash 115108212, now seen corresponding path program 2 times [2024-11-12 04:44:14,842 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 04:44:14,842 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [122649474] [2024-11-12 04:44:14,842 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 04:44:14,842 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 04:44:14,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:44:16,454 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 04:44:16,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:44:16,456 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-12 04:44:16,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:44:16,457 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-12 04:44:16,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:44:16,458 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-12 04:44:16,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:44:16,460 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-12 04:44:16,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:44:16,461 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 04:44:16,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:44:16,462 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-12 04:44:16,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:44:16,464 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-12 04:44:16,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:44:16,465 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-12 04:44:16,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:44:16,466 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-12 04:44:16,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:44:16,467 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-12 04:44:16,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:44:16,469 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-12 04:44:16,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:44:16,470 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-12 04:44:16,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:44:16,472 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-11-12 04:44:16,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:44:16,473 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-12 04:44:16,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:44:16,474 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-12 04:44:16,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:44:16,476 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-12 04:44:16,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:44:16,477 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-11-12 04:44:16,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:44:16,479 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-11-12 04:44:16,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:44:16,482 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-11-12 04:44:16,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:44:16,485 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-11-12 04:44:16,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:44:16,487 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-11-12 04:44:16,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:44:16,488 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-11-12 04:44:16,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:44:16,490 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2024-11-12 04:44:16,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:44:16,491 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2024-11-12 04:44:16,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:44:16,493 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2024-11-12 04:44:16,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:44:16,494 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 177 [2024-11-12 04:44:16,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:44:16,496 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 182 [2024-11-12 04:44:16,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:44:16,498 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 187 [2024-11-12 04:44:16,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:44:16,500 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 193 [2024-11-12 04:44:16,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:44:16,503 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 198 [2024-11-12 04:44:16,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:44:16,505 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 204 [2024-11-12 04:44:16,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:44:16,508 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 209 [2024-11-12 04:44:16,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:44:16,510 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 215 [2024-11-12 04:44:16,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:44:16,512 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 220 [2024-11-12 04:44:16,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:44:16,514 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 226 [2024-11-12 04:44:16,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:44:16,517 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 231 [2024-11-12 04:44:16,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:44:16,519 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 237 [2024-11-12 04:44:16,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:44:16,521 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 242 [2024-11-12 04:44:16,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:44:16,525 INFO L134 CoverageAnalysis]: Checked inductivity of 3064 backedges. 67 proven. 11 refuted. 0 times theorem prover too weak. 2986 trivial. 0 not checked. [2024-11-12 04:44:16,525 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 04:44:16,525 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [122649474] [2024-11-12 04:44:16,527 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [122649474] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 04:44:16,527 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1440381467] [2024-11-12 04:44:16,527 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-12 04:44:16,528 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 04:44:16,528 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 04:44:16,530 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-12 04:44:16,531 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-12 04:44:16,672 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-12 04:44:16,673 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-12 04:44:16,680 INFO L256 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 26 conjuncts are in the unsatisfiable core [2024-11-12 04:44:16,710 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 04:44:17,307 INFO L134 CoverageAnalysis]: Checked inductivity of 3064 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 3044 trivial. 0 not checked. [2024-11-12 04:44:17,307 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 04:44:17,307 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1440381467] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 04:44:17,308 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-12 04:44:17,308 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [14] total 25 [2024-11-12 04:44:17,308 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1537373913] [2024-11-12 04:44:17,308 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 04:44:17,308 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-12 04:44:17,308 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 04:44:17,309 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-12 04:44:17,311 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=516, Unknown=0, NotChecked=0, Total=600 [2024-11-12 04:44:17,311 INFO L87 Difference]: Start difference. First operand 329 states and 430 transitions. Second operand has 13 states, 13 states have (on average 3.5384615384615383) internal successors, (46), 13 states have internal predecessors, (46), 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-11-12 04:44:18,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 04:44:18,330 INFO L93 Difference]: Finished difference Result 384 states and 485 transitions. [2024-11-12 04:44:18,331 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2024-11-12 04:44:18,331 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 3.5384615384615383) internal successors, (46), 13 states have internal predecessors, (46), 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 267 [2024-11-12 04:44:18,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 04:44:18,335 INFO L225 Difference]: With dead ends: 384 [2024-11-12 04:44:18,336 INFO L226 Difference]: Without dead ends: 382 [2024-11-12 04:44:18,337 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 381 GetRequests, 338 SyntacticMatches, 3 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 407 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=231, Invalid=1491, Unknown=0, NotChecked=0, Total=1722 [2024-11-12 04:44:18,338 INFO L435 NwaCegarLoop]: 94 mSDtfsCounter, 200 mSDsluCounter, 336 mSDsCounter, 0 mSdLazyCounter, 687 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 200 SdHoareTripleChecker+Valid, 430 SdHoareTripleChecker+Invalid, 717 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 687 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-12 04:44:18,338 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [200 Valid, 430 Invalid, 717 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 687 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-12 04:44:18,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 382 states. [2024-11-12 04:44:18,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 382 to 325. [2024-11-12 04:44:18,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 325 states, 229 states have (on average 1.1135371179039302) internal successors, (255), 235 states have internal predecessors, (255), 85 states have call successors, (85), 10 states have call predecessors, (85), 10 states have return successors, (85), 79 states have call predecessors, (85), 85 states have call successors, (85) [2024-11-12 04:44:18,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 325 states to 325 states and 425 transitions. [2024-11-12 04:44:18,394 INFO L78 Accepts]: Start accepts. Automaton has 325 states and 425 transitions. Word has length 267 [2024-11-12 04:44:18,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 04:44:18,396 INFO L471 AbstractCegarLoop]: Abstraction has 325 states and 425 transitions. [2024-11-12 04:44:18,396 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 3.5384615384615383) internal successors, (46), 13 states have internal predecessors, (46), 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-11-12 04:44:18,396 INFO L276 IsEmpty]: Start isEmpty. Operand 325 states and 425 transitions. [2024-11-12 04:44:18,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 273 [2024-11-12 04:44:18,399 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 04:44:18,399 INFO L218 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, 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] [2024-11-12 04:44:18,419 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-11-12 04:44:18,603 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2024-11-12 04:44:18,604 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 04:44:18,605 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 04:44:18,605 INFO L85 PathProgramCache]: Analyzing trace with hash -1042737457, now seen corresponding path program 1 times [2024-11-12 04:44:18,605 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 04:44:18,605 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [890504413] [2024-11-12 04:44:18,605 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 04:44:18,605 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 04:44:18,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:44:18,693 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 04:44:18,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:44:18,695 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-12 04:44:18,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:44:18,696 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-12 04:44:18,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:44:18,698 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-12 04:44:18,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:44:18,699 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-12 04:44:18,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:44:18,700 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 04:44:18,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:44:18,703 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-12 04:44:18,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:44:18,704 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-12 04:44:18,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:44:18,705 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-12 04:44:18,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:44:18,707 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-12 04:44:18,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:44:18,708 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-12 04:44:18,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:44:18,710 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-12 04:44:18,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:44:18,711 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-12 04:44:18,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:44:18,712 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-11-12 04:44:18,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:44:18,713 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-12 04:44:18,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:44:18,714 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-12 04:44:18,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:44:18,715 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-12 04:44:18,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:44:18,717 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-11-12 04:44:18,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:44:18,719 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-11-12 04:44:18,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:44:18,720 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-11-12 04:44:18,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:44:18,721 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-11-12 04:44:18,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:44:18,722 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-11-12 04:44:18,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:44:18,724 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-11-12 04:44:18,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:44:18,725 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2024-11-12 04:44:18,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:44:18,727 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2024-11-12 04:44:18,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:44:18,728 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2024-11-12 04:44:18,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:44:18,729 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 177 [2024-11-12 04:44:18,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:44:18,731 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 182 [2024-11-12 04:44:18,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:44:18,732 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 187 [2024-11-12 04:44:18,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:44:18,734 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 193 [2024-11-12 04:44:18,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:44:18,735 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 198 [2024-11-12 04:44:18,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:44:18,736 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 204 [2024-11-12 04:44:18,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:44:18,741 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 209 [2024-11-12 04:44:18,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:44:18,743 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 215 [2024-11-12 04:44:18,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:44:18,744 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 220 [2024-11-12 04:44:18,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:44:18,746 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 226 [2024-11-12 04:44:18,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:44:18,748 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 231 [2024-11-12 04:44:18,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:44:18,749 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 237 [2024-11-12 04:44:18,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:44:18,750 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 242 [2024-11-12 04:44:18,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 04:44:18,752 INFO L134 CoverageAnalysis]: Checked inductivity of 3064 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 3050 trivial. 0 not checked. [2024-11-12 04:44:18,752 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 04:44:18,752 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [890504413] [2024-11-12 04:44:18,753 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [890504413] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 04:44:18,753 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 04:44:18,753 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-12 04:44:18,753 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1993245224] [2024-11-12 04:44:18,753 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 04:44:18,754 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 04:44:18,754 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 04:44:18,755 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 04:44:18,755 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 04:44:18,755 INFO L87 Difference]: Start difference. First operand 325 states and 425 transitions. Second operand has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 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-11-12 04:44:18,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 04:44:18,891 INFO L93 Difference]: Finished difference Result 713 states and 940 transitions. [2024-11-12 04:44:18,892 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 04:44:18,892 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 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 272 [2024-11-12 04:44:18,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 04:44:18,893 INFO L225 Difference]: With dead ends: 713 [2024-11-12 04:44:18,894 INFO L226 Difference]: Without dead ends: 0 [2024-11-12 04:44:18,895 INFO L434 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-11-12 04:44:18,896 INFO L435 NwaCegarLoop]: 130 mSDtfsCounter, 55 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 189 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 04:44:18,896 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 189 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 04:44:18,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-11-12 04:44:18,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-11-12 04:44:18,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 04:44:18,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-11-12 04:44:18,897 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 272 [2024-11-12 04:44:18,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 04:44:18,898 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-12 04:44:18,898 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 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-11-12 04:44:18,898 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-11-12 04:44:18,898 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-11-12 04:44:18,901 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-12 04:44:18,901 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-12 04:44:18,904 INFO L421 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 04:44:18,906 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-11-12 04:44:46,002 WARN L286 SmtUtils]: Spent 26.34s on a formula simplification. DAG size of input: 284 DAG size of output: 363 (called from [L 212] de.uni_freiburg.informatik.ultimate.lib.proofs.floydhoare.HoareAnnotationComposer.or) [2024-11-12 04:44:51,041 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-12 04:44:51,070 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.11 04:44:51 BoogieIcfgContainer [2024-11-12 04:44:51,070 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-12 04:44:51,071 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-12 04:44:51,071 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-12 04:44:51,071 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-12 04:44:51,071 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 04:43:53" (3/4) ... [2024-11-12 04:44:51,074 INFO L142 WitnessPrinter]: Generating witness for correct program [2024-11-12 04:44:51,078 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure assume_abort_if_not [2024-11-12 04:44:51,082 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 13 nodes and edges [2024-11-12 04:44:51,083 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2024-11-12 04:44:51,083 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-11-12 04:44:51,083 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-12 04:44:51,195 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-12 04:44:51,196 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-11-12 04:44:51,196 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-12 04:44:51,196 INFO L158 Benchmark]: Toolchain (without parser) took 58894.45ms. Allocated memory was 174.1MB in the beginning and 1.1GB in the end (delta: 950.0MB). Free memory was 136.8MB in the beginning and 838.5MB in the end (delta: -701.7MB). Peak memory consumption was 248.1MB. Max. memory is 16.1GB. [2024-11-12 04:44:51,197 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 109.1MB. Free memory was 77.8MB in the beginning and 77.6MB in the end (delta: 142.6kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-12 04:44:51,197 INFO L158 Benchmark]: CACSL2BoogieTranslator took 341.14ms. Allocated memory is still 174.1MB. Free memory was 136.8MB in the beginning and 122.1MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-11-12 04:44:51,197 INFO L158 Benchmark]: Boogie Procedure Inliner took 89.17ms. Allocated memory is still 174.1MB. Free memory was 122.1MB in the beginning and 119.2MB in the end (delta: 2.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-12 04:44:51,197 INFO L158 Benchmark]: Boogie Preprocessor took 60.45ms. Allocated memory is still 174.1MB. Free memory was 119.2MB in the beginning and 115.8MB in the end (delta: 3.4MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-12 04:44:51,197 INFO L158 Benchmark]: RCFGBuilder took 596.50ms. Allocated memory is still 174.1MB. Free memory was 115.8MB in the beginning and 129.7MB in the end (delta: -13.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-12 04:44:51,198 INFO L158 Benchmark]: TraceAbstraction took 57673.82ms. Allocated memory was 174.1MB in the beginning and 1.1GB in the end (delta: 950.0MB). Free memory was 129.0MB in the beginning and 844.8MB in the end (delta: -715.8MB). Peak memory consumption was 666.6MB. Max. memory is 16.1GB. [2024-11-12 04:44:51,198 INFO L158 Benchmark]: Witness Printer took 125.31ms. Allocated memory is still 1.1GB. Free memory was 844.8MB in the beginning and 838.5MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-11-12 04:44:51,200 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.19ms. Allocated memory is still 109.1MB. Free memory was 77.8MB in the beginning and 77.6MB in the end (delta: 142.6kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 341.14ms. Allocated memory is still 174.1MB. Free memory was 136.8MB in the beginning and 122.1MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 89.17ms. Allocated memory is still 174.1MB. Free memory was 122.1MB in the beginning and 119.2MB in the end (delta: 2.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 60.45ms. Allocated memory is still 174.1MB. Free memory was 119.2MB in the beginning and 115.8MB in the end (delta: 3.4MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 596.50ms. Allocated memory is still 174.1MB. Free memory was 115.8MB in the beginning and 129.7MB in the end (delta: -13.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 57673.82ms. Allocated memory was 174.1MB in the beginning and 1.1GB in the end (delta: 950.0MB). Free memory was 129.0MB in the beginning and 844.8MB in the end (delta: -715.8MB). Peak memory consumption was 666.6MB. Max. memory is 16.1GB. * Witness Printer took 125.31ms. Allocated memory is still 1.1GB. Free memory was 844.8MB in the beginning and 838.5MB 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, 63 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 25.4s, OverallIterations: 17, TraceHistogramMax: 39, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.1s, AutomataDifference: 7.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1585 SdHoareTripleChecker+Valid, 4.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1585 mSDsluCounter, 5244 SdHoareTripleChecker+Invalid, 4.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 3588 mSDsCounter, 189 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 4170 IncrementalHoareTripleChecker+Invalid, 4359 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 189 mSolverCounterUnsat, 1656 mSDtfsCounter, 4170 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1178 GetRequests, 1002 SyntacticMatches, 5 SemanticMatches, 171 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 763 ImplicationChecksByTransitivity, 4.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=432occurred in iteration=14, InterpolantAutomatonStates: 148, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.6s AutomataMinimizationTime, 17 MinimizatonAttempts, 696 StatesRemovedByMinimization, 14 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 15.6s InterpolantComputationTime, 2669 NumberOfCodeBlocks, 2432 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 2651 ConstructedInterpolants, 0 QuantifiedInterpolants, 10479 SizeOfPredicates, 11 NumberOfNonLiveVariables, 112 ConjunctsInSsa, 26 ConjunctsInUnsatCore, 18 InterpolantComputations, 17 PerfectInterpolantSequences, 18966/18977 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: (((((((((((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)) || ((((((var_1_1 == 1) || (var_1_1 == 0)) && ((((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))) - 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-11-12 04:44:51,290 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE