./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-1loop_file-61.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 84cfde4a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-1loop_file-61.i -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash dbe45afa86e2c578c058b9245371f9cd8d3f7cde9f82c7f7a0cfc33405a8ed29 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 11:08:18,539 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 11:08:18,592 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-11 11:08:18,599 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 11:08:18,600 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 11:08:18,631 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 11:08:18,631 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 11:08:18,631 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 11:08:18,632 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 11:08:18,632 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 11:08:18,632 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 11:08:18,633 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 11:08:18,634 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 11:08:18,638 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 11:08:18,638 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 11:08:18,639 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 11:08:18,639 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 11:08:18,639 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 11:08:18,639 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 11:08:18,639 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 11:08:18,640 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 11:08:18,640 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 11:08:18,640 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 11:08:18,641 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 11:08:18,641 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 11:08:18,641 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 11:08:18,641 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 11:08:18,641 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 11:08:18,642 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 11:08:18,642 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 11:08:18,642 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 11:08:18,642 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 11:08:18,643 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 11:08:18,643 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 11:08:18,643 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 11:08:18,643 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 11:08:18,643 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 11:08:18,644 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 11:08:18,644 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 11:08:18,644 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 11:08:18,644 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 11:08:18,645 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 11:08:18,646 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> dbe45afa86e2c578c058b9245371f9cd8d3f7cde9f82c7f7a0cfc33405a8ed29 [2024-10-11 11:08:18,861 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 11:08:18,884 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 11:08:18,887 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 11:08:18,888 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 11:08:18,888 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 11:08:18,890 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-1loop_file-61.i [2024-10-11 11:08:20,160 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 11:08:20,355 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 11:08:20,359 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-1loop_file-61.i [2024-10-11 11:08:20,370 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/44179c0a0/fa6168169aa6461db7c69abf8d938c92/FLAG2c738ea49 [2024-10-11 11:08:20,387 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/44179c0a0/fa6168169aa6461db7c69abf8d938c92 [2024-10-11 11:08:20,389 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 11:08:20,391 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 11:08:20,392 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 11:08:20,392 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 11:08:20,397 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 11:08:20,397 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 11:08:20" (1/1) ... [2024-10-11 11:08:20,400 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5bf653d9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:08:20, skipping insertion in model container [2024-10-11 11:08:20,400 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 11:08:20" (1/1) ... [2024-10-11 11:08:20,434 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 11:08:20,663 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-1loop_file-61.i[916,929] [2024-10-11 11:08:20,760 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 11:08:20,774 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 11:08:20,783 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-1loop_file-61.i[916,929] [2024-10-11 11:08:20,810 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 11:08:20,833 INFO L204 MainTranslator]: Completed translation [2024-10-11 11:08:20,833 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:08:20 WrapperNode [2024-10-11 11:08:20,834 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 11:08:20,834 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 11:08:20,835 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 11:08:20,835 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 11:08:20,841 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:08:20" (1/1) ... [2024-10-11 11:08:20,852 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:08:20" (1/1) ... [2024-10-11 11:08:20,894 INFO L138 Inliner]: procedures = 26, calls = 39, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 249 [2024-10-11 11:08:20,894 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 11:08:20,896 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 11:08:20,897 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 11:08:20,897 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 11:08:20,910 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:08:20" (1/1) ... [2024-10-11 11:08:20,910 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:08:20" (1/1) ... [2024-10-11 11:08:20,920 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:08:20" (1/1) ... [2024-10-11 11:08:20,945 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-11 11:08:20,945 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:08:20" (1/1) ... [2024-10-11 11:08:20,946 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:08:20" (1/1) ... [2024-10-11 11:08:20,960 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:08:20" (1/1) ... [2024-10-11 11:08:20,963 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:08:20" (1/1) ... [2024-10-11 11:08:20,971 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:08:20" (1/1) ... [2024-10-11 11:08:20,975 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:08:20" (1/1) ... [2024-10-11 11:08:20,984 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 11:08:20,985 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 11:08:20,985 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 11:08:20,985 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 11:08:20,986 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:08:20" (1/1) ... [2024-10-11 11:08:20,991 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 11:08:21,001 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 11:08:21,016 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 11:08:21,019 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 11:08:21,064 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 11:08:21,064 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-11 11:08:21,065 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-11 11:08:21,065 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-11 11:08:21,065 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 11:08:21,065 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 11:08:21,152 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 11:08:21,154 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 11:08:21,653 INFO L? ?]: Removed 36 outVars from TransFormulas that were not future-live. [2024-10-11 11:08:21,653 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 11:08:21,684 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 11:08:21,685 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-11 11:08:21,685 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 11:08:21 BoogieIcfgContainer [2024-10-11 11:08:21,685 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 11:08:21,687 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 11:08:21,687 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 11:08:21,690 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 11:08:21,690 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 11:08:20" (1/3) ... [2024-10-11 11:08:21,691 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@20a23ee0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 11:08:21, skipping insertion in model container [2024-10-11 11:08:21,691 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:08:20" (2/3) ... [2024-10-11 11:08:21,691 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@20a23ee0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 11:08:21, skipping insertion in model container [2024-10-11 11:08:21,692 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 11:08:21" (3/3) ... [2024-10-11 11:08:21,693 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_100-1loop_file-61.i [2024-10-11 11:08:21,707 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 11:08:21,708 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-11 11:08:21,776 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 11:08:21,782 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;@668938e9, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 11:08:21,782 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-11 11:08:21,789 INFO L276 IsEmpty]: Start isEmpty. Operand has 100 states, 71 states have (on average 1.5211267605633803) internal successors, (108), 72 states have internal predecessors, (108), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2024-10-11 11:08:21,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2024-10-11 11:08:21,809 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 11:08:21,811 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 11:08:21,811 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 11:08:21,817 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 11:08:21,817 INFO L85 PathProgramCache]: Analyzing trace with hash 1619408389, now seen corresponding path program 1 times [2024-10-11 11:08:21,825 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 11:08:21,825 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2002851579] [2024-10-11 11:08:21,826 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 11:08:21,826 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 11:08:22,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:08:22,154 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 11:08:22,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:08:22,163 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 11:08:22,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:08:22,176 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 11:08:22,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:08:22,180 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 11:08:22,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:08:22,184 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 11:08:22,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:08:22,188 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 11:08:22,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:08:22,192 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 11:08:22,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:08:22,197 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 11:08:22,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:08:22,207 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 11:08:22,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:08:22,214 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-11 11:08:22,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:08:22,222 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-11 11:08:22,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:08:22,229 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 11:08:22,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:08:22,233 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 11:08:22,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:08:22,236 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-11 11:08:22,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:08:22,240 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-10-11 11:08:22,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:08:22,243 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-11 11:08:22,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:08:22,250 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-11 11:08:22,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:08:22,254 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-11 11:08:22,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:08:22,261 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-10-11 11:08:22,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:08:22,267 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-10-11 11:08:22,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:08:22,270 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-10-11 11:08:22,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:08:22,274 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-10-11 11:08:22,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:08:22,278 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-10-11 11:08:22,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:08:22,282 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-10-11 11:08:22,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:08:22,289 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2024-10-11 11:08:22,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:08:22,293 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-10-11 11:08:22,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:08:22,305 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2024-10-11 11:08:22,306 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 11:08:22,306 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2002851579] [2024-10-11 11:08:22,307 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2002851579] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 11:08:22,307 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 11:08:22,307 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 11:08:22,308 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2118912559] [2024-10-11 11:08:22,309 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 11:08:22,312 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-11 11:08:22,313 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 11:08:22,331 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-11 11:08:22,331 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 11:08:22,333 INFO L87 Difference]: Start difference. First operand has 100 states, 71 states have (on average 1.5211267605633803) internal successors, (108), 72 states have internal predecessors, (108), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) Second operand has 2 states, 2 states have (on average 22.0) internal successors, (44), 2 states have internal predecessors, (44), 2 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 2 states have call successors, (26) [2024-10-11 11:08:22,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 11:08:22,384 INFO L93 Difference]: Finished difference Result 199 states and 345 transitions. [2024-10-11 11:08:22,385 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-11 11:08:22,386 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 22.0) internal successors, (44), 2 states have internal predecessors, (44), 2 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 2 states have call successors, (26) Word has length 171 [2024-10-11 11:08:22,386 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 11:08:22,393 INFO L225 Difference]: With dead ends: 199 [2024-10-11 11:08:22,394 INFO L226 Difference]: Without dead ends: 98 [2024-10-11 11:08:22,398 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 80 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 11:08:22,404 INFO L432 NwaCegarLoop]: 152 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 152 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 11:08:22,405 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 152 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 11:08:22,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2024-10-11 11:08:22,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 98. [2024-10-11 11:08:22,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 70 states have (on average 1.4714285714285715) internal successors, (103), 70 states have internal predecessors, (103), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2024-10-11 11:08:22,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 155 transitions. [2024-10-11 11:08:22,457 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 155 transitions. Word has length 171 [2024-10-11 11:08:22,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 11:08:22,458 INFO L471 AbstractCegarLoop]: Abstraction has 98 states and 155 transitions. [2024-10-11 11:08:22,459 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 22.0) internal successors, (44), 2 states have internal predecessors, (44), 2 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 2 states have call successors, (26) [2024-10-11 11:08:22,459 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 155 transitions. [2024-10-11 11:08:22,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2024-10-11 11:08:22,462 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 11:08:22,462 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 11:08:22,462 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 11:08:22,462 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 11:08:22,463 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 11:08:22,463 INFO L85 PathProgramCache]: Analyzing trace with hash -1101636531, now seen corresponding path program 1 times [2024-10-11 11:08:22,464 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 11:08:22,464 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1875200692] [2024-10-11 11:08:22,464 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 11:08:22,464 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 11:08:22,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:08:28,701 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 11:08:28,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:08:28,710 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 11:08:28,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:08:28,716 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 11:08:28,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:08:28,726 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 11:08:28,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:08:28,731 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 11:08:28,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:08:28,737 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 11:08:28,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:08:28,745 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 11:08:28,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:08:28,759 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 11:08:28,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:08:28,764 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 11:08:28,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:08:28,770 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-11 11:08:28,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:08:28,775 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-11 11:08:28,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:08:28,780 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 11:08:28,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:08:28,786 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 11:08:28,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:08:28,791 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-11 11:08:28,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:08:28,797 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-10-11 11:08:28,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:08:28,803 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-11 11:08:28,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:08:28,808 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-11 11:08:28,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:08:28,814 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-11 11:08:28,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:08:28,820 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-10-11 11:08:28,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:08:28,826 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-10-11 11:08:28,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:08:28,833 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-10-11 11:08:28,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:08:28,842 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-10-11 11:08:28,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:08:28,852 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-10-11 11:08:28,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:08:28,861 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-10-11 11:08:28,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:08:28,878 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2024-10-11 11:08:28,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:08:28,892 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-10-11 11:08:28,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:08:28,907 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2024-10-11 11:08:28,908 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 11:08:28,908 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1875200692] [2024-10-11 11:08:28,908 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1875200692] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 11:08:28,908 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 11:08:28,908 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-10-11 11:08:28,909 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1663059117] [2024-10-11 11:08:28,909 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 11:08:28,910 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-11 11:08:28,910 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 11:08:28,911 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-11 11:08:28,911 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2024-10-11 11:08:28,911 INFO L87 Difference]: Start difference. First operand 98 states and 155 transitions. Second operand has 11 states, 10 states have (on average 4.4) internal successors, (44), 11 states have internal predecessors, (44), 3 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 2 states have call predecessors, (26), 3 states have call successors, (26) [2024-10-11 11:08:29,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 11:08:29,875 INFO L93 Difference]: Finished difference Result 481 states and 760 transitions. [2024-10-11 11:08:29,875 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-11 11:08:29,876 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 4.4) internal successors, (44), 11 states have internal predecessors, (44), 3 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 2 states have call predecessors, (26), 3 states have call successors, (26) Word has length 171 [2024-10-11 11:08:29,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 11:08:29,881 INFO L225 Difference]: With dead ends: 481 [2024-10-11 11:08:29,882 INFO L226 Difference]: Without dead ends: 384 [2024-10-11 11:08:29,883 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=104, Invalid=238, Unknown=0, NotChecked=0, Total=342 [2024-10-11 11:08:29,884 INFO L432 NwaCegarLoop]: 141 mSDtfsCounter, 827 mSDsluCounter, 670 mSDsCounter, 0 mSdLazyCounter, 584 mSolverCounterSat, 155 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 827 SdHoareTripleChecker+Valid, 811 SdHoareTripleChecker+Invalid, 739 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 155 IncrementalHoareTripleChecker+Valid, 584 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-10-11 11:08:29,885 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [827 Valid, 811 Invalid, 739 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [155 Valid, 584 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-10-11 11:08:29,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 384 states. [2024-10-11 11:08:29,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 384 to 236. [2024-10-11 11:08:29,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 236 states, 181 states have (on average 1.5082872928176796) internal successors, (273), 181 states have internal predecessors, (273), 52 states have call successors, (52), 2 states have call predecessors, (52), 2 states have return successors, (52), 52 states have call predecessors, (52), 52 states have call successors, (52) [2024-10-11 11:08:29,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 236 states to 236 states and 377 transitions. [2024-10-11 11:08:29,918 INFO L78 Accepts]: Start accepts. Automaton has 236 states and 377 transitions. Word has length 171 [2024-10-11 11:08:29,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 11:08:29,919 INFO L471 AbstractCegarLoop]: Abstraction has 236 states and 377 transitions. [2024-10-11 11:08:29,919 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 4.4) internal successors, (44), 11 states have internal predecessors, (44), 3 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 2 states have call predecessors, (26), 3 states have call successors, (26) [2024-10-11 11:08:29,919 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states and 377 transitions. [2024-10-11 11:08:29,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2024-10-11 11:08:29,922 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 11:08:29,923 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 11:08:29,923 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-11 11:08:29,923 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 11:08:29,923 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 11:08:29,924 INFO L85 PathProgramCache]: Analyzing trace with hash 1913467087, now seen corresponding path program 1 times [2024-10-11 11:08:29,924 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 11:08:29,924 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1662827524] [2024-10-11 11:08:29,925 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 11:08:29,926 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 11:08:29,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:08:30,126 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 11:08:30,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:08:30,131 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 11:08:30,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:08:30,133 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 11:08:30,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:08:30,135 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 11:08:30,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:08:30,137 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 11:08:30,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:08:30,138 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 11:08:30,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:08:30,139 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 11:08:30,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:08:30,141 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 11:08:30,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:08:30,142 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 11:08:30,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:08:30,144 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-11 11:08:30,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:08:30,147 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-11 11:08:30,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:08:30,149 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 11:08:30,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:08:30,151 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 11:08:30,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:08:30,154 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-11 11:08:30,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:08:30,156 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-10-11 11:08:30,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:08:30,158 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-11 11:08:30,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:08:30,160 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-11 11:08:30,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:08:30,163 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-11 11:08:30,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:08:30,165 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-10-11 11:08:30,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:08:30,166 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-10-11 11:08:30,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:08:30,168 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-10-11 11:08:30,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:08:30,169 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-10-11 11:08:30,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:08:30,171 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-10-11 11:08:30,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:08:30,172 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-10-11 11:08:30,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:08:30,174 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2024-10-11 11:08:30,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:08:30,175 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-10-11 11:08:30,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:08:30,178 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2024-10-11 11:08:30,178 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 11:08:30,178 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1662827524] [2024-10-11 11:08:30,178 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1662827524] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 11:08:30,178 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 11:08:30,178 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 11:08:30,179 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [128377979] [2024-10-11 11:08:30,179 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 11:08:30,179 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 11:08:30,179 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 11:08:30,180 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 11:08:30,180 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 11:08:30,180 INFO L87 Difference]: Start difference. First operand 236 states and 377 transitions. Second operand has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-10-11 11:08:30,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 11:08:30,243 INFO L93 Difference]: Finished difference Result 374 states and 589 transitions. [2024-10-11 11:08:30,244 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 11:08:30,244 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 171 [2024-10-11 11:08:30,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 11:08:30,246 INFO L225 Difference]: With dead ends: 374 [2024-10-11 11:08:30,246 INFO L226 Difference]: Without dead ends: 238 [2024-10-11 11:08:30,247 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 56 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 11:08:30,248 INFO L432 NwaCegarLoop]: 121 mSDtfsCounter, 90 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 90 SdHoareTripleChecker+Valid, 174 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 11:08:30,248 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [90 Valid, 174 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 11:08:30,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 238 states. [2024-10-11 11:08:30,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 238 to 238. [2024-10-11 11:08:30,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 238 states, 181 states have (on average 1.4640883977900552) internal successors, (265), 181 states have internal predecessors, (265), 52 states have call successors, (52), 4 states have call predecessors, (52), 4 states have return successors, (52), 52 states have call predecessors, (52), 52 states have call successors, (52) [2024-10-11 11:08:30,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 238 states to 238 states and 369 transitions. [2024-10-11 11:08:30,270 INFO L78 Accepts]: Start accepts. Automaton has 238 states and 369 transitions. Word has length 171 [2024-10-11 11:08:30,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 11:08:30,270 INFO L471 AbstractCegarLoop]: Abstraction has 238 states and 369 transitions. [2024-10-11 11:08:30,271 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-10-11 11:08:30,271 INFO L276 IsEmpty]: Start isEmpty. Operand 238 states and 369 transitions. [2024-10-11 11:08:30,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2024-10-11 11:08:30,272 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 11:08:30,273 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 11:08:30,273 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-11 11:08:30,273 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 11:08:30,274 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 11:08:30,274 INFO L85 PathProgramCache]: Analyzing trace with hash -56850524, now seen corresponding path program 1 times [2024-10-11 11:08:30,274 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 11:08:30,274 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1074027730] [2024-10-11 11:08:30,275 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 11:08:30,275 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 11:08:30,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:08:31,754 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 11:08:31,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:08:31,757 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 11:08:31,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:08:31,759 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 11:08:31,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:08:31,761 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 11:08:31,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:08:31,763 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 11:08:31,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:08:31,765 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 11:08:31,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:08:31,766 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 11:08:31,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:08:31,768 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 11:08:31,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:08:31,769 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 11:08:31,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:08:31,771 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-11 11:08:31,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:08:31,773 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-11 11:08:31,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:08:31,774 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 11:08:31,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:08:31,776 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 11:08:31,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:08:31,778 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-11 11:08:31,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:08:31,780 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-10-11 11:08:31,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:08:31,782 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-11 11:08:31,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:08:31,783 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-11 11:08:31,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:08:31,785 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-11 11:08:31,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:08:31,787 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-10-11 11:08:31,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:08:31,789 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-10-11 11:08:31,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:08:31,791 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-10-11 11:08:31,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:08:31,793 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-10-11 11:08:31,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:08:31,794 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-10-11 11:08:31,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:08:31,796 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-10-11 11:08:31,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:08:31,798 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2024-10-11 11:08:31,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:08:31,800 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-10-11 11:08:31,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:08:31,803 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2024-10-11 11:08:31,803 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 11:08:31,803 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1074027730] [2024-10-11 11:08:31,803 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1074027730] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 11:08:31,804 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 11:08:31,804 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 11:08:31,804 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [149860166] [2024-10-11 11:08:31,804 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 11:08:31,804 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 11:08:31,805 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 11:08:31,805 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 11:08:31,805 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-10-11 11:08:31,806 INFO L87 Difference]: Start difference. First operand 238 states and 369 transitions. Second operand has 6 states, 6 states have (on average 7.5) internal successors, (45), 6 states have internal predecessors, (45), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-10-11 11:08:32,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 11:08:32,171 INFO L93 Difference]: Finished difference Result 412 states and 633 transitions. [2024-10-11 11:08:32,172 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 11:08:32,172 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.5) internal successors, (45), 6 states have internal predecessors, (45), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 172 [2024-10-11 11:08:32,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 11:08:32,175 INFO L225 Difference]: With dead ends: 412 [2024-10-11 11:08:32,175 INFO L226 Difference]: Without dead ends: 302 [2024-10-11 11:08:32,176 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-10-11 11:08:32,176 INFO L432 NwaCegarLoop]: 151 mSDtfsCounter, 152 mSDsluCounter, 237 mSDsCounter, 0 mSdLazyCounter, 207 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 152 SdHoareTripleChecker+Valid, 388 SdHoareTripleChecker+Invalid, 207 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 207 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-11 11:08:32,177 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [152 Valid, 388 Invalid, 207 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 207 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-11 11:08:32,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 302 states. [2024-10-11 11:08:32,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 302 to 256. [2024-10-11 11:08:32,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 256 states, 199 states have (on average 1.4623115577889447) internal successors, (291), 199 states have internal predecessors, (291), 52 states have call successors, (52), 4 states have call predecessors, (52), 4 states have return successors, (52), 52 states have call predecessors, (52), 52 states have call successors, (52) [2024-10-11 11:08:32,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 395 transitions. [2024-10-11 11:08:32,193 INFO L78 Accepts]: Start accepts. Automaton has 256 states and 395 transitions. Word has length 172 [2024-10-11 11:08:32,193 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 11:08:32,193 INFO L471 AbstractCegarLoop]: Abstraction has 256 states and 395 transitions. [2024-10-11 11:08:32,193 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.5) internal successors, (45), 6 states have internal predecessors, (45), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-10-11 11:08:32,193 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 395 transitions. [2024-10-11 11:08:32,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2024-10-11 11:08:32,195 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 11:08:32,195 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 11:08:32,195 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-11 11:08:32,195 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 11:08:32,196 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 11:08:32,196 INFO L85 PathProgramCache]: Analyzing trace with hash 979279292, now seen corresponding path program 1 times [2024-10-11 11:08:32,196 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 11:08:32,196 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [109271033] [2024-10-11 11:08:32,196 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 11:08:32,196 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 11:08:32,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:08:33,305 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 11:08:33,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:08:33,308 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 11:08:33,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:08:33,311 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 11:08:33,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:08:33,313 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 11:08:33,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:08:33,315 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 11:08:33,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:08:33,317 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 11:08:33,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:08:33,319 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 11:08:33,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:08:33,321 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 11:08:33,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:08:33,323 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 11:08:33,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:08:33,324 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-11 11:08:33,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:08:33,326 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-11 11:08:33,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:08:33,328 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 11:08:33,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:08:33,332 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 11:08:33,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:08:33,334 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-11 11:08:33,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:08:33,337 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-10-11 11:08:33,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:08:33,340 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-11 11:08:33,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:08:33,342 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-11 11:08:33,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:08:33,344 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-11 11:08:33,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:08:33,346 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-10-11 11:08:33,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:08:33,350 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-10-11 11:08:33,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:08:33,352 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-10-11 11:08:33,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:08:33,355 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-10-11 11:08:33,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:08:33,358 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-10-11 11:08:33,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:08:33,361 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-10-11 11:08:33,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:08:33,364 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2024-10-11 11:08:33,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:08:33,367 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-10-11 11:08:33,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:08:33,370 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2024-10-11 11:08:33,370 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 11:08:33,370 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [109271033] [2024-10-11 11:08:33,371 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [109271033] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 11:08:33,371 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 11:08:33,372 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 11:08:33,372 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1169928391] [2024-10-11 11:08:33,372 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 11:08:33,373 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 11:08:33,373 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 11:08:33,374 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 11:08:33,374 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-11 11:08:33,374 INFO L87 Difference]: Start difference. First operand 256 states and 395 transitions. Second operand has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-10-11 11:08:33,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 11:08:33,708 INFO L93 Difference]: Finished difference Result 394 states and 605 transitions. [2024-10-11 11:08:33,711 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 11:08:33,712 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 172 [2024-10-11 11:08:33,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 11:08:33,714 INFO L225 Difference]: With dead ends: 394 [2024-10-11 11:08:33,714 INFO L226 Difference]: Without dead ends: 284 [2024-10-11 11:08:33,714 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-10-11 11:08:33,715 INFO L432 NwaCegarLoop]: 153 mSDtfsCounter, 90 mSDsluCounter, 325 mSDsCounter, 0 mSdLazyCounter, 149 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 90 SdHoareTripleChecker+Valid, 478 SdHoareTripleChecker+Invalid, 149 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 149 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-11 11:08:33,716 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [90 Valid, 478 Invalid, 149 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 149 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-11 11:08:33,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 284 states. [2024-10-11 11:08:33,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 284 to 247. [2024-10-11 11:08:33,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 247 states, 190 states have (on average 1.4526315789473685) internal successors, (276), 190 states have internal predecessors, (276), 52 states have call successors, (52), 4 states have call predecessors, (52), 4 states have return successors, (52), 52 states have call predecessors, (52), 52 states have call successors, (52) [2024-10-11 11:08:33,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 247 states to 247 states and 380 transitions. [2024-10-11 11:08:33,731 INFO L78 Accepts]: Start accepts. Automaton has 247 states and 380 transitions. Word has length 172 [2024-10-11 11:08:33,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 11:08:33,732 INFO L471 AbstractCegarLoop]: Abstraction has 247 states and 380 transitions. [2024-10-11 11:08:33,732 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-10-11 11:08:33,733 INFO L276 IsEmpty]: Start isEmpty. Operand 247 states and 380 transitions. [2024-10-11 11:08:33,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2024-10-11 11:08:33,734 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 11:08:33,734 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 11:08:33,734 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-11 11:08:33,735 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 11:08:33,735 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 11:08:33,735 INFO L85 PathProgramCache]: Analyzing trace with hash -231134889, now seen corresponding path program 1 times [2024-10-11 11:08:33,735 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 11:08:33,735 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [853379050] [2024-10-11 11:08:33,735 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 11:08:33,736 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 11:08:33,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:08:34,670 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 11:08:34,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:08:34,673 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 11:08:34,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:08:34,675 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 11:08:34,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:08:34,678 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 11:08:34,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:08:34,682 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 11:08:34,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:08:34,685 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 11:08:34,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:08:34,688 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 11:08:34,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:08:34,693 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 11:08:34,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:08:34,695 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 11:08:34,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:08:34,698 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-11 11:08:34,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:08:34,701 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-11 11:08:34,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:08:34,704 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 11:08:34,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:08:34,706 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 11:08:34,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:08:34,709 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-11 11:08:34,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:08:34,711 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-10-11 11:08:34,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:08:34,714 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-11 11:08:34,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:08:34,716 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-11 11:08:34,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:08:34,719 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-11 11:08:34,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:08:34,722 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-10-11 11:08:34,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:08:34,725 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-10-11 11:08:34,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:08:34,729 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-10-11 11:08:34,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:08:34,732 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-10-11 11:08:34,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:08:34,735 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-10-11 11:08:34,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:08:34,738 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-10-11 11:08:34,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:08:34,740 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2024-10-11 11:08:34,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:08:34,743 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-10-11 11:08:34,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:08:34,746 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2024-10-11 11:08:34,747 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 11:08:34,747 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [853379050] [2024-10-11 11:08:34,747 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [853379050] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 11:08:34,748 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 11:08:34,748 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 11:08:34,748 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1538217225] [2024-10-11 11:08:34,748 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 11:08:34,749 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 11:08:34,749 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 11:08:34,750 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 11:08:34,750 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-10-11 11:08:34,751 INFO L87 Difference]: Start difference. First operand 247 states and 380 transitions. Second operand has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 6 states have internal predecessors, (46), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-10-11 11:08:35,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 11:08:35,138 INFO L93 Difference]: Finished difference Result 410 states and 623 transitions. [2024-10-11 11:08:35,139 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 11:08:35,139 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 6 states have internal predecessors, (46), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 173 [2024-10-11 11:08:35,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 11:08:35,141 INFO L225 Difference]: With dead ends: 410 [2024-10-11 11:08:35,142 INFO L226 Difference]: Without dead ends: 300 [2024-10-11 11:08:35,142 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-10-11 11:08:35,143 INFO L432 NwaCegarLoop]: 148 mSDtfsCounter, 125 mSDsluCounter, 311 mSDsCounter, 0 mSdLazyCounter, 198 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 125 SdHoareTripleChecker+Valid, 459 SdHoareTripleChecker+Invalid, 200 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 198 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-11 11:08:35,143 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [125 Valid, 459 Invalid, 200 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 198 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-11 11:08:35,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 300 states. [2024-10-11 11:08:35,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 300 to 243. [2024-10-11 11:08:35,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 243 states, 186 states have (on average 1.435483870967742) internal successors, (267), 186 states have internal predecessors, (267), 52 states have call successors, (52), 4 states have call predecessors, (52), 4 states have return successors, (52), 52 states have call predecessors, (52), 52 states have call successors, (52) [2024-10-11 11:08:35,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 243 states to 243 states and 371 transitions. [2024-10-11 11:08:35,166 INFO L78 Accepts]: Start accepts. Automaton has 243 states and 371 transitions. Word has length 173 [2024-10-11 11:08:35,167 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 11:08:35,167 INFO L471 AbstractCegarLoop]: Abstraction has 243 states and 371 transitions. [2024-10-11 11:08:35,167 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 6 states have internal predecessors, (46), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-10-11 11:08:35,167 INFO L276 IsEmpty]: Start isEmpty. Operand 243 states and 371 transitions. [2024-10-11 11:08:35,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2024-10-11 11:08:35,169 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 11:08:35,169 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 11:08:35,169 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-11 11:08:35,169 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 11:08:35,170 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 11:08:35,170 INFO L85 PathProgramCache]: Analyzing trace with hash 474742761, now seen corresponding path program 1 times [2024-10-11 11:08:35,170 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 11:08:35,170 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1548204254] [2024-10-11 11:08:35,170 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 11:08:35,170 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 11:08:35,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:08:35,409 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 11:08:35,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:08:35,412 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 11:08:35,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:08:35,414 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 11:08:35,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:08:35,415 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 11:08:35,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:08:35,416 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 11:08:35,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:08:35,417 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 11:08:35,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:08:35,418 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 11:08:35,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:08:35,419 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 11:08:35,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:08:35,420 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 11:08:35,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:08:35,421 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-11 11:08:35,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:08:35,424 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-11 11:08:35,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:08:35,425 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 11:08:35,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:08:35,426 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 11:08:35,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:08:35,431 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-11 11:08:35,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:08:35,432 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-10-11 11:08:35,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:08:35,434 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-11 11:08:35,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:08:35,435 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-11 11:08:35,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:08:35,436 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-11 11:08:35,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:08:35,437 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-10-11 11:08:35,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:08:35,438 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-10-11 11:08:35,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:08:35,439 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-10-11 11:08:35,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:08:35,442 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-10-11 11:08:35,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:08:35,444 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-10-11 11:08:35,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:08:35,446 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-10-11 11:08:35,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:08:35,447 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2024-10-11 11:08:35,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:08:35,448 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-10-11 11:08:35,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:08:35,450 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2024-10-11 11:08:35,451 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 11:08:35,451 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1548204254] [2024-10-11 11:08:35,451 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1548204254] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 11:08:35,451 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 11:08:35,451 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 11:08:35,451 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [330180677] [2024-10-11 11:08:35,451 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 11:08:35,452 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 11:08:35,452 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 11:08:35,452 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 11:08:35,453 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2024-10-11 11:08:35,453 INFO L87 Difference]: Start difference. First operand 243 states and 371 transitions. Second operand has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 6 states have internal predecessors, (47), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-10-11 11:08:35,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 11:08:35,600 INFO L93 Difference]: Finished difference Result 368 states and 563 transitions. [2024-10-11 11:08:35,600 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 11:08:35,600 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 6 states have internal predecessors, (47), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 174 [2024-10-11 11:08:35,600 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 11:08:35,602 INFO L225 Difference]: With dead ends: 368 [2024-10-11 11:08:35,602 INFO L226 Difference]: Without dead ends: 240 [2024-10-11 11:08:35,602 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2024-10-11 11:08:35,603 INFO L432 NwaCegarLoop]: 145 mSDtfsCounter, 75 mSDsluCounter, 307 mSDsCounter, 0 mSdLazyCounter, 163 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 452 SdHoareTripleChecker+Invalid, 167 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 163 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 11:08:35,606 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [75 Valid, 452 Invalid, 167 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 163 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 11:08:35,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 240 states. [2024-10-11 11:08:35,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 240 to 240. [2024-10-11 11:08:35,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 240 states, 183 states have (on average 1.4098360655737705) internal successors, (258), 183 states have internal predecessors, (258), 52 states have call successors, (52), 4 states have call predecessors, (52), 4 states have return successors, (52), 52 states have call predecessors, (52), 52 states have call successors, (52) [2024-10-11 11:08:35,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 240 states to 240 states and 362 transitions. [2024-10-11 11:08:35,621 INFO L78 Accepts]: Start accepts. Automaton has 240 states and 362 transitions. Word has length 174 [2024-10-11 11:08:35,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 11:08:35,622 INFO L471 AbstractCegarLoop]: Abstraction has 240 states and 362 transitions. [2024-10-11 11:08:35,622 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 6 states have internal predecessors, (47), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-10-11 11:08:35,622 INFO L276 IsEmpty]: Start isEmpty. Operand 240 states and 362 transitions. [2024-10-11 11:08:35,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2024-10-11 11:08:35,624 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 11:08:35,625 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 11:08:35,625 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-11 11:08:35,625 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 11:08:35,625 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 11:08:35,626 INFO L85 PathProgramCache]: Analyzing trace with hash 104970146, now seen corresponding path program 1 times [2024-10-11 11:08:35,626 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 11:08:35,626 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [857000182] [2024-10-11 11:08:35,626 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 11:08:35,626 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 11:08:35,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat