./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_fillercode_fillercodestructure_filler-pr-cn_file-59.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 4a390ef5 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-cn_file-59.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash b5a3a78de85206c06265f4a5f6df62e7897a8d9c53ab2b455732af1ef22c4599 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4a390ef-m [2024-10-24 07:40:46,496 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-24 07:40:46,581 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-24 07:40:46,591 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-24 07:40:46,592 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-24 07:40:46,620 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-24 07:40:46,620 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-24 07:40:46,621 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-24 07:40:46,622 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-24 07:40:46,622 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-24 07:40:46,622 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-24 07:40:46,623 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-24 07:40:46,623 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-24 07:40:46,624 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-24 07:40:46,624 INFO L153 SettingsManager]: * Use SBE=true [2024-10-24 07:40:46,625 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-24 07:40:46,625 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-24 07:40:46,625 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-24 07:40:46,626 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-24 07:40:46,626 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-24 07:40:46,626 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-24 07:40:46,630 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-24 07:40:46,631 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-24 07:40:46,631 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-24 07:40:46,631 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-24 07:40:46,635 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-24 07:40:46,636 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-24 07:40:46,636 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-24 07:40:46,636 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-24 07:40:46,636 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-24 07:40:46,637 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-24 07:40:46,637 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-24 07:40:46,637 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 07:40:46,638 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-24 07:40:46,638 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-24 07:40:46,638 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-24 07:40:46,638 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-24 07:40:46,639 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-24 07:40:46,639 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-24 07:40:46,639 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-24 07:40:46,639 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-24 07:40:46,643 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-24 07:40:46,643 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> b5a3a78de85206c06265f4a5f6df62e7897a8d9c53ab2b455732af1ef22c4599 [2024-10-24 07:40:46,912 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-24 07:40:46,942 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-24 07:40:46,946 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-24 07:40:46,948 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-24 07:40:46,948 INFO L274 PluginConnector]: CDTParser initialized [2024-10-24 07:40:46,949 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-cn_file-59.i [2024-10-24 07:40:48,465 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-24 07:40:48,689 INFO L384 CDTParser]: Found 1 translation units. [2024-10-24 07:40:48,689 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-cn_file-59.i [2024-10-24 07:40:48,700 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/12921d863/08e952fa38234321a79df3d95c7b750b/FLAGb327a16b1 [2024-10-24 07:40:48,716 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/12921d863/08e952fa38234321a79df3d95c7b750b [2024-10-24 07:40:48,719 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-24 07:40:48,720 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-24 07:40:48,721 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-24 07:40:48,721 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-24 07:40:48,725 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-24 07:40:48,726 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 07:40:48" (1/1) ... [2024-10-24 07:40:48,727 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@27167477 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:40:48, skipping insertion in model container [2024-10-24 07:40:48,727 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 07:40:48" (1/1) ... [2024-10-24 07:40:48,759 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-24 07:40:48,947 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_fillercode_fillercodestructure_filler-pr-cn_file-59.i[919,932] [2024-10-24 07:40:49,062 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 07:40:49,080 INFO L200 MainTranslator]: Completed pre-run [2024-10-24 07:40:49,094 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_fillercode_fillercodestructure_filler-pr-cn_file-59.i[919,932] [2024-10-24 07:40:49,140 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 07:40:49,162 INFO L204 MainTranslator]: Completed translation [2024-10-24 07:40:49,163 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:40:49 WrapperNode [2024-10-24 07:40:49,163 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-24 07:40:49,164 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-24 07:40:49,165 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-24 07:40:49,165 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-24 07:40:49,173 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:40:49" (1/1) ... [2024-10-24 07:40:49,192 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:40:49" (1/1) ... [2024-10-24 07:40:49,244 INFO L138 Inliner]: procedures = 26, calls = 47, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 242 [2024-10-24 07:40:49,245 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-24 07:40:49,246 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-24 07:40:49,246 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-24 07:40:49,246 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-24 07:40:49,261 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:40:49" (1/1) ... [2024-10-24 07:40:49,261 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:40:49" (1/1) ... [2024-10-24 07:40:49,269 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:40:49" (1/1) ... [2024-10-24 07:40:49,333 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-24 07:40:49,333 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:40:49" (1/1) ... [2024-10-24 07:40:49,333 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:40:49" (1/1) ... [2024-10-24 07:40:49,350 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:40:49" (1/1) ... [2024-10-24 07:40:49,359 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:40:49" (1/1) ... [2024-10-24 07:40:49,362 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:40:49" (1/1) ... [2024-10-24 07:40:49,368 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:40:49" (1/1) ... [2024-10-24 07:40:49,376 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-24 07:40:49,378 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-24 07:40:49,378 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-24 07:40:49,379 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-24 07:40:49,380 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:40:49" (1/1) ... [2024-10-24 07:40:49,385 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 07:40:49,399 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 07:40:49,422 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-24 07:40:49,430 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-24 07:40:49,477 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-24 07:40:49,477 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-24 07:40:49,477 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-24 07:40:49,477 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-24 07:40:49,477 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-24 07:40:49,477 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-24 07:40:49,562 INFO L238 CfgBuilder]: Building ICFG [2024-10-24 07:40:49,564 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-24 07:40:50,106 INFO L? ?]: Removed 20 outVars from TransFormulas that were not future-live. [2024-10-24 07:40:50,107 INFO L287 CfgBuilder]: Performing block encoding [2024-10-24 07:40:50,157 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-24 07:40:50,159 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-24 07:40:50,159 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 07:40:50 BoogieIcfgContainer [2024-10-24 07:40:50,159 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-24 07:40:50,162 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-24 07:40:50,163 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-24 07:40:50,166 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-24 07:40:50,166 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 07:40:48" (1/3) ... [2024-10-24 07:40:50,167 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@31870f82 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 07:40:50, skipping insertion in model container [2024-10-24 07:40:50,167 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 07:40:49" (2/3) ... [2024-10-24 07:40:50,167 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@31870f82 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 07:40:50, skipping insertion in model container [2024-10-24 07:40:50,167 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 07:40:50" (3/3) ... [2024-10-24 07:40:50,168 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-pr-cn_file-59.i [2024-10-24 07:40:50,184 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-24 07:40:50,184 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-24 07:40:50,247 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-24 07:40:50,253 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;@7e8d34cf, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-24 07:40:50,254 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-24 07:40:50,259 INFO L276 IsEmpty]: Start isEmpty. Operand has 99 states, 62 states have (on average 1.5) internal successors, (93), 63 states have internal predecessors, (93), 34 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) [2024-10-24 07:40:50,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2024-10-24 07:40:50,273 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 07:40:50,274 INFO L215 NwaCegarLoop]: trace histogram [34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 07:40:50,275 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 07:40:50,279 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 07:40:50,280 INFO L85 PathProgramCache]: Analyzing trace with hash 148909760, now seen corresponding path program 1 times [2024-10-24 07:40:50,287 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 07:40:50,287 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [378852609] [2024-10-24 07:40:50,288 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 07:40:50,288 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 07:40:50,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:40:50,655 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 07:40:50,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:40:50,664 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 07:40:50,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:40:50,674 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-24 07:40:50,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:40:50,679 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 07:40:50,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:40:50,685 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-24 07:40:50,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:40:50,692 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 07:40:50,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:40:50,701 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-24 07:40:50,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:40:50,709 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-24 07:40:50,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:40:50,718 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-24 07:40:50,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:40:50,728 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-24 07:40:50,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:40:50,733 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-24 07:40:50,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:40:50,739 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-24 07:40:50,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:40:50,754 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-24 07:40:50,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:40:50,768 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-24 07:40:50,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:40:50,777 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-24 07:40:50,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:40:50,790 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-24 07:40:50,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:40:50,800 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-24 07:40:50,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:40:50,805 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-10-24 07:40:50,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:40:50,814 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-10-24 07:40:50,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:40:50,822 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-24 07:40:50,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:40:50,831 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-24 07:40:50,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:40:50,842 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-24 07:40:50,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:40:50,854 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-10-24 07:40:50,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:40:50,862 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-10-24 07:40:50,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:40:50,871 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2024-10-24 07:40:50,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:40:50,879 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-10-24 07:40:50,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:40:50,886 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2024-10-24 07:40:50,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:40:50,891 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2024-10-24 07:40:50,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:40:50,901 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-10-24 07:40:50,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:40:50,908 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2024-10-24 07:40:50,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:40:50,917 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 169 [2024-10-24 07:40:50,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:40:50,921 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 174 [2024-10-24 07:40:50,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:40:50,929 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 180 [2024-10-24 07:40:50,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:40:50,935 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 185 [2024-10-24 07:40:50,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:40:50,949 INFO L134 CoverageAnalysis]: Checked inductivity of 2244 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2244 trivial. 0 not checked. [2024-10-24 07:40:50,951 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 07:40:50,951 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [378852609] [2024-10-24 07:40:50,952 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [378852609] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 07:40:50,953 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 07:40:50,954 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-24 07:40:50,955 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [37725219] [2024-10-24 07:40:50,957 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 07:40:50,963 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-24 07:40:50,963 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 07:40:50,985 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-24 07:40:50,986 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-24 07:40:50,989 INFO L87 Difference]: Start difference. First operand has 99 states, 62 states have (on average 1.5) internal successors, (93), 63 states have internal predecessors, (93), 34 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) Second operand has 2 states, 2 states have (on average 22.5) internal successors, (45), 2 states have internal predecessors, (45), 2 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 2 states have call successors, (34) [2024-10-24 07:40:51,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 07:40:51,050 INFO L93 Difference]: Finished difference Result 195 states and 354 transitions. [2024-10-24 07:40:51,053 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-24 07:40:51,055 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 22.5) internal successors, (45), 2 states have internal predecessors, (45), 2 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 2 states have call successors, (34) Word has length 212 [2024-10-24 07:40:51,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 07:40:51,067 INFO L225 Difference]: With dead ends: 195 [2024-10-24 07:40:51,067 INFO L226 Difference]: Without dead ends: 97 [2024-10-24 07:40:51,071 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 104 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-24 07:40:51,074 INFO L432 NwaCegarLoop]: 152 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 152 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 07:40:51,076 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 152 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 07:40:51,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2024-10-24 07:40:51,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 97. [2024-10-24 07:40:51,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 61 states have (on average 1.4262295081967213) internal successors, (87), 61 states have internal predecessors, (87), 34 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) [2024-10-24 07:40:51,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 155 transitions. [2024-10-24 07:40:51,149 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 155 transitions. Word has length 212 [2024-10-24 07:40:51,150 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 07:40:51,150 INFO L471 AbstractCegarLoop]: Abstraction has 97 states and 155 transitions. [2024-10-24 07:40:51,150 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 22.5) internal successors, (45), 2 states have internal predecessors, (45), 2 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 2 states have call successors, (34) [2024-10-24 07:40:51,151 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 155 transitions. [2024-10-24 07:40:51,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2024-10-24 07:40:51,156 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 07:40:51,156 INFO L215 NwaCegarLoop]: trace histogram [34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 07:40:51,156 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-24 07:40:51,157 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 07:40:51,157 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 07:40:51,158 INFO L85 PathProgramCache]: Analyzing trace with hash -524152456, now seen corresponding path program 1 times [2024-10-24 07:40:51,158 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 07:40:51,158 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [141628733] [2024-10-24 07:40:51,158 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 07:40:51,159 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 07:40:51,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:40:51,841 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 07:40:51,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:40:51,848 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 07:40:51,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:40:51,852 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-24 07:40:51,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:40:51,864 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 07:40:51,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:40:51,874 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-24 07:40:51,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:40:51,882 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 07:40:51,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:40:51,894 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-24 07:40:51,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:40:51,901 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-24 07:40:51,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:40:51,907 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-24 07:40:51,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:40:51,913 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-24 07:40:51,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:40:51,921 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-24 07:40:51,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:40:51,926 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-24 07:40:51,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:40:51,933 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-24 07:40:51,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:40:51,939 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-24 07:40:51,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:40:51,945 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-24 07:40:51,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:40:51,951 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-24 07:40:51,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:40:51,960 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-24 07:40:51,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:40:51,965 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-10-24 07:40:51,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:40:51,974 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-10-24 07:40:51,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:40:51,980 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-24 07:40:51,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:40:51,987 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-24 07:40:51,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:40:51,992 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-24 07:40:51,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:40:52,005 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-10-24 07:40:52,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:40:52,034 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-10-24 07:40:52,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:40:52,040 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2024-10-24 07:40:52,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:40:52,046 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-10-24 07:40:52,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:40:52,052 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2024-10-24 07:40:52,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:40:52,059 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2024-10-24 07:40:52,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:40:52,064 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-10-24 07:40:52,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:40:52,069 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2024-10-24 07:40:52,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:40:52,075 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 169 [2024-10-24 07:40:52,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:40:52,080 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 174 [2024-10-24 07:40:52,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:40:52,086 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 180 [2024-10-24 07:40:52,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:40:52,090 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 185 [2024-10-24 07:40:52,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:40:52,096 INFO L134 CoverageAnalysis]: Checked inductivity of 2244 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2244 trivial. 0 not checked. [2024-10-24 07:40:52,096 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 07:40:52,096 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [141628733] [2024-10-24 07:40:52,097 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [141628733] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 07:40:52,097 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 07:40:52,097 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-24 07:40:52,097 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [685281324] [2024-10-24 07:40:52,097 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 07:40:52,099 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 07:40:52,099 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 07:40:52,100 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 07:40:52,100 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 07:40:52,101 INFO L87 Difference]: Start difference. First operand 97 states and 155 transitions. Second operand has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) [2024-10-24 07:40:52,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 07:40:52,402 INFO L93 Difference]: Finished difference Result 290 states and 464 transitions. [2024-10-24 07:40:52,403 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-24 07:40:52,407 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) Word has length 212 [2024-10-24 07:40:52,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 07:40:52,413 INFO L225 Difference]: With dead ends: 290 [2024-10-24 07:40:52,413 INFO L226 Difference]: Without dead ends: 194 [2024-10-24 07:40:52,414 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 71 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-24 07:40:52,416 INFO L432 NwaCegarLoop]: 151 mSDtfsCounter, 114 mSDsluCounter, 301 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 103 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 114 SdHoareTripleChecker+Valid, 452 SdHoareTripleChecker+Invalid, 114 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 103 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-24 07:40:52,416 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [114 Valid, 452 Invalid, 114 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [103 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-24 07:40:52,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2024-10-24 07:40:52,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 156. [2024-10-24 07:40:52,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 156 states, 85 states have (on average 1.3058823529411765) internal successors, (111), 85 states have internal predecessors, (111), 68 states have call successors, (68), 2 states have call predecessors, (68), 2 states have return successors, (68), 68 states have call predecessors, (68), 68 states have call successors, (68) [2024-10-24 07:40:52,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 247 transitions. [2024-10-24 07:40:52,468 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 247 transitions. Word has length 212 [2024-10-24 07:40:52,473 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 07:40:52,473 INFO L471 AbstractCegarLoop]: Abstraction has 156 states and 247 transitions. [2024-10-24 07:40:52,473 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) [2024-10-24 07:40:52,474 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 247 transitions. [2024-10-24 07:40:52,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 214 [2024-10-24 07:40:52,477 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 07:40:52,477 INFO L215 NwaCegarLoop]: trace histogram [34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 07:40:52,478 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-24 07:40:52,478 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 07:40:52,478 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 07:40:52,479 INFO L85 PathProgramCache]: Analyzing trace with hash 784788139, now seen corresponding path program 1 times [2024-10-24 07:40:52,479 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 07:40:52,479 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [907024919] [2024-10-24 07:40:52,479 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 07:40:52,479 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 07:40:52,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:40:52,835 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 07:40:52,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:40:52,839 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 07:40:52,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:40:52,843 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-24 07:40:52,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:40:52,848 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 07:40:52,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:40:52,853 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-24 07:40:52,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:40:52,857 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 07:40:52,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:40:52,864 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-24 07:40:52,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:40:52,870 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-24 07:40:52,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:40:52,878 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-24 07:40:52,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:40:52,882 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-24 07:40:52,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:40:52,889 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-24 07:40:52,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:40:52,894 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-24 07:40:52,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:40:52,900 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-24 07:40:52,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:40:52,904 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-24 07:40:52,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:40:52,909 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-24 07:40:52,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:40:52,914 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-24 07:40:52,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:40:52,921 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-24 07:40:52,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:40:52,926 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-10-24 07:40:52,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:40:52,931 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-10-24 07:40:52,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:40:52,936 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-24 07:40:52,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:40:52,941 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-24 07:40:52,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:40:52,949 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-24 07:40:52,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:40:52,957 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-10-24 07:40:52,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:40:52,961 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-10-24 07:40:52,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:40:52,965 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2024-10-24 07:40:52,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:40:52,971 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-10-24 07:40:52,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:40:52,979 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2024-10-24 07:40:52,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:40:52,983 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2024-10-24 07:40:52,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:40:52,987 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-10-24 07:40:52,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:40:52,991 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2024-10-24 07:40:52,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:40:52,998 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 169 [2024-10-24 07:40:53,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:40:53,003 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 174 [2024-10-24 07:40:53,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:40:53,009 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 180 [2024-10-24 07:40:53,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:40:53,013 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 185 [2024-10-24 07:40:53,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:40:53,020 INFO L134 CoverageAnalysis]: Checked inductivity of 2244 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2244 trivial. 0 not checked. [2024-10-24 07:40:53,022 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 07:40:53,022 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [907024919] [2024-10-24 07:40:53,022 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [907024919] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 07:40:53,022 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 07:40:53,023 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-24 07:40:53,023 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1777523527] [2024-10-24 07:40:53,023 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 07:40:53,023 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 07:40:53,025 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 07:40:53,026 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 07:40:53,026 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 07:40:53,027 INFO L87 Difference]: Start difference. First operand 156 states and 247 transitions. Second operand has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) [2024-10-24 07:40:54,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 07:40:54,229 INFO L93 Difference]: Finished difference Result 357 states and 566 transitions. [2024-10-24 07:40:54,229 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-24 07:40:54,230 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) Word has length 213 [2024-10-24 07:40:54,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 07:40:54,234 INFO L225 Difference]: With dead ends: 357 [2024-10-24 07:40:54,234 INFO L226 Difference]: Without dead ends: 261 [2024-10-24 07:40:54,239 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 71 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-24 07:40:54,241 INFO L432 NwaCegarLoop]: 155 mSDtfsCounter, 132 mSDsluCounter, 294 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 104 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 132 SdHoareTripleChecker+Valid, 449 SdHoareTripleChecker+Invalid, 128 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 104 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-10-24 07:40:54,241 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [132 Valid, 449 Invalid, 128 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [104 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-10-24 07:40:54,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 261 states. [2024-10-24 07:40:54,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 261 to 250. [2024-10-24 07:40:54,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 250 states, 144 states have (on average 1.3472222222222223) internal successors, (194), 144 states have internal predecessors, (194), 102 states have call successors, (102), 3 states have call predecessors, (102), 3 states have return successors, (102), 102 states have call predecessors, (102), 102 states have call successors, (102) [2024-10-24 07:40:54,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 398 transitions. [2024-10-24 07:40:54,299 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 398 transitions. Word has length 213 [2024-10-24 07:40:54,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 07:40:54,301 INFO L471 AbstractCegarLoop]: Abstraction has 250 states and 398 transitions. [2024-10-24 07:40:54,301 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) [2024-10-24 07:40:54,301 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 398 transitions. [2024-10-24 07:40:54,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 215 [2024-10-24 07:40:54,304 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 07:40:54,305 INFO L215 NwaCegarLoop]: trace histogram [34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 07:40:54,305 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-24 07:40:54,305 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 07:40:54,306 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 07:40:54,306 INFO L85 PathProgramCache]: Analyzing trace with hash 206099835, now seen corresponding path program 1 times [2024-10-24 07:40:54,306 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 07:40:54,306 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1365387054] [2024-10-24 07:40:54,306 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 07:40:54,307 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 07:40:54,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-24 07:40:54,577 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [218557367] [2024-10-24 07:40:54,578 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 07:40:54,578 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 07:40:54,578 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 07:40:54,581 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-24 07:40:54,583 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-24 07:40:54,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 07:40:54,878 INFO L255 TraceCheckSpWp]: Trace formula consists of 497 conjuncts, 59 conjuncts are in the unsatisfiable core [2024-10-24 07:40:54,898 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 07:41:00,429 INFO L134 CoverageAnalysis]: Checked inductivity of 2244 backedges. 962 proven. 450 refuted. 0 times theorem prover too weak. 832 trivial. 0 not checked. [2024-10-24 07:41:00,430 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 07:41:19,367 WARN L286 SmtUtils]: Spent 10.80s on a formula simplification that was a NOOP. DAG size: 27 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-10-24 07:41:25,242 WARN L286 SmtUtils]: Spent 5.84s on a formula simplification that was a NOOP. DAG size: 7 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-10-24 07:41:31,457 WARN L286 SmtUtils]: Spent 5.69s on a formula simplification that was a NOOP. DAG size: 11 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-10-24 07:41:55,061 WARN L286 SmtUtils]: Spent 13.90s on a formula simplification that was a NOOP. DAG size: 54 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-10-24 07:42:19,779 WARN L286 SmtUtils]: Spent 8.08s on a formula simplification that was a NOOP. DAG size: 57 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate)