./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-co_file-98.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8be7027f Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-co_file-98.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 b1b9302ff54a53ad4ae263e58d48d5865cea0604451c8d951e928f2ef921524a --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dk.perfect-tracechecks-8be7027-m [2024-11-12 03:50:18,042 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-12 03:50:18,122 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-12 03:50:18,136 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-12 03:50:18,139 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-12 03:50:18,160 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-12 03:50:18,163 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-12 03:50:18,164 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-12 03:50:18,164 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-12 03:50:18,166 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-12 03:50:18,166 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-12 03:50:18,167 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-12 03:50:18,167 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-12 03:50:18,168 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-12 03:50:18,170 INFO L153 SettingsManager]: * Use SBE=true [2024-11-12 03:50:18,170 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-12 03:50:18,171 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-12 03:50:18,171 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-12 03:50:18,171 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-12 03:50:18,172 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-12 03:50:18,172 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-12 03:50:18,172 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-12 03:50:18,176 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-12 03:50:18,176 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-12 03:50:18,177 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-12 03:50:18,177 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-12 03:50:18,177 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-12 03:50:18,177 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-12 03:50:18,178 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-12 03:50:18,178 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-12 03:50:18,178 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-12 03:50:18,178 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-12 03:50:18,179 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 03:50:18,179 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-12 03:50:18,179 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-12 03:50:18,181 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-12 03:50:18,182 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-12 03:50:18,182 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-12 03:50:18,182 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-12 03:50:18,182 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-12 03:50:18,183 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-12 03:50:18,183 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-12 03:50:18,184 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 -> b1b9302ff54a53ad4ae263e58d48d5865cea0604451c8d951e928f2ef921524a [2024-11-12 03:50:18,444 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-12 03:50:18,474 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-12 03:50:18,479 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-12 03:50:18,480 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-12 03:50:18,480 INFO L274 PluginConnector]: CDTParser initialized [2024-11-12 03:50:18,482 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-co_file-98.i [2024-11-12 03:50:19,995 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-12 03:50:20,219 INFO L384 CDTParser]: Found 1 translation units. [2024-11-12 03:50:20,220 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-co_file-98.i [2024-11-12 03:50:20,233 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f4fe878d6/d57198b281244177a325749701c9b578/FLAGcfe3ff8b3 [2024-11-12 03:50:20,584 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f4fe878d6/d57198b281244177a325749701c9b578 [2024-11-12 03:50:20,586 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-12 03:50:20,587 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-12 03:50:20,590 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-12 03:50:20,590 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-12 03:50:20,595 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-12 03:50:20,596 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 03:50:20" (1/1) ... [2024-11-12 03:50:20,597 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7c7d27dd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 03:50:20, skipping insertion in model container [2024-11-12 03:50:20,597 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 03:50:20" (1/1) ... [2024-11-12 03:50:20,631 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-12 03:50:20,810 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-co_file-98.i[919,932] [2024-11-12 03:50:20,889 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 03:50:20,901 INFO L200 MainTranslator]: Completed pre-run [2024-11-12 03:50:20,911 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-co_file-98.i[919,932] [2024-11-12 03:50:20,958 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 03:50:20,982 INFO L204 MainTranslator]: Completed translation [2024-11-12 03:50:20,983 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 03:50:20 WrapperNode [2024-11-12 03:50:20,983 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-12 03:50:20,984 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-12 03:50:20,985 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-12 03:50:20,985 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-12 03:50:20,993 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 03:50:20" (1/1) ... [2024-11-12 03:50:21,012 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 03:50:20" (1/1) ... [2024-11-12 03:50:21,071 INFO L138 Inliner]: procedures = 26, calls = 47, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 248 [2024-11-12 03:50:21,072 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-12 03:50:21,072 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-12 03:50:21,073 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-12 03:50:21,073 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-12 03:50:21,083 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 03:50:20" (1/1) ... [2024-11-12 03:50:21,083 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 03:50:20" (1/1) ... [2024-11-12 03:50:21,088 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 03:50:20" (1/1) ... [2024-11-12 03:50:21,120 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-12 03:50:21,121 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 03:50:20" (1/1) ... [2024-11-12 03:50:21,121 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 03:50:20" (1/1) ... [2024-11-12 03:50:21,139 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 03:50:20" (1/1) ... [2024-11-12 03:50:21,143 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 03:50:20" (1/1) ... [2024-11-12 03:50:21,146 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 03:50:20" (1/1) ... [2024-11-12 03:50:21,149 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 03:50:20" (1/1) ... [2024-11-12 03:50:21,157 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-12 03:50:21,162 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-12 03:50:21,162 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-12 03:50:21,163 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-12 03:50:21,164 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 03:50:20" (1/1) ... [2024-11-12 03:50:21,172 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 03:50:21,187 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 03:50:21,205 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-12 03:50:21,209 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-12 03:50:21,258 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-12 03:50:21,259 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-12 03:50:21,260 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-12 03:50:21,260 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-12 03:50:21,260 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-12 03:50:21,260 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-12 03:50:21,364 INFO L238 CfgBuilder]: Building ICFG [2024-11-12 03:50:21,369 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-12 03:50:21,917 INFO L? ?]: Removed 16 outVars from TransFormulas that were not future-live. [2024-11-12 03:50:21,917 INFO L287 CfgBuilder]: Performing block encoding [2024-11-12 03:50:21,936 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-12 03:50:21,938 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-12 03:50:21,938 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 03:50:21 BoogieIcfgContainer [2024-11-12 03:50:21,938 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-12 03:50:21,941 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-12 03:50:21,941 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-12 03:50:21,945 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-12 03:50:21,945 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.11 03:50:20" (1/3) ... [2024-11-12 03:50:21,946 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@130d6917 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 03:50:21, skipping insertion in model container [2024-11-12 03:50:21,947 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 03:50:20" (2/3) ... [2024-11-12 03:50:21,948 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@130d6917 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 03:50:21, skipping insertion in model container [2024-11-12 03:50:21,948 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 03:50:21" (3/3) ... [2024-11-12 03:50:21,949 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-pr-co_file-98.i [2024-11-12 03:50:21,964 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-12 03:50:21,964 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-12 03:50:22,029 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-12 03:50:22,037 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;@2ecfd767, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-12 03:50:22,037 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-12 03:50:22,042 INFO L276 IsEmpty]: Start isEmpty. Operand has 106 states, 69 states have (on average 1.434782608695652) internal successors, (99), 70 states have internal predecessors, (99), 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-11-12 03:50:22,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 218 [2024-11-12 03:50:22,058 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 03:50:22,059 INFO L218 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, 1, 1, 1] [2024-11-12 03:50:22,060 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 03:50:22,067 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 03:50:22,067 INFO L85 PathProgramCache]: Analyzing trace with hash 2007489777, now seen corresponding path program 1 times [2024-11-12 03:50:22,077 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 03:50:22,077 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [510614310] [2024-11-12 03:50:22,078 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 03:50:22,078 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 03:50:22,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:50:22,445 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 03:50:22,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:50:22,454 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-12 03:50:22,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:50:22,461 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-12 03:50:22,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:50:22,472 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-12 03:50:22,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:50:22,481 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-12 03:50:22,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:50:22,486 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-11-12 03:50:22,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:50:22,490 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-12 03:50:22,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:50:22,495 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-12 03:50:22,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:50:22,502 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-12 03:50:22,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:50:22,506 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-12 03:50:22,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:50:22,511 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-12 03:50:22,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:50:22,516 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-12 03:50:22,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:50:22,521 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-12 03:50:22,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:50:22,529 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-12 03:50:22,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:50:22,541 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-12 03:50:22,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:50:22,548 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-12 03:50:22,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:50:22,556 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-12 03:50:22,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:50:22,563 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-12 03:50:22,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:50:22,570 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-12 03:50:22,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:50:22,577 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-11-12 03:50:22,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:50:22,583 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-12 03:50:22,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:50:22,589 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-11-12 03:50:22,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:50:22,597 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-11-12 03:50:22,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:50:22,602 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-12 03:50:22,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:50:22,609 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-11-12 03:50:22,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:50:22,620 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2024-11-12 03:50:22,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:50:22,626 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2024-11-12 03:50:22,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:50:22,634 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2024-11-12 03:50:22,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:50:22,641 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 159 [2024-11-12 03:50:22,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:50:22,652 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 165 [2024-11-12 03:50:22,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:50:22,659 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 170 [2024-11-12 03:50:22,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:50:22,665 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 176 [2024-11-12 03:50:22,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:50:22,670 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 182 [2024-11-12 03:50:22,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:50:22,675 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 188 [2024-11-12 03:50:22,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:50:22,685 INFO L134 CoverageAnalysis]: Checked inductivity of 2244 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2244 trivial. 0 not checked. [2024-11-12 03:50:22,686 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 03:50:22,687 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [510614310] [2024-11-12 03:50:22,688 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [510614310] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 03:50:22,688 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 03:50:22,689 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-12 03:50:22,691 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1730835977] [2024-11-12 03:50:22,691 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 03:50:22,697 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-12 03:50:22,698 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 03:50:22,726 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-12 03:50:22,727 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-12 03:50:22,730 INFO L87 Difference]: Start difference. First operand has 106 states, 69 states have (on average 1.434782608695652) internal successors, (99), 70 states have internal predecessors, (99), 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 25.0) internal successors, (50), 2 states have internal predecessors, (50), 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-11-12 03:50:22,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 03:50:22,775 INFO L93 Difference]: Finished difference Result 205 states and 362 transitions. [2024-11-12 03:50:22,776 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-12 03:50:22,778 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 25.0) internal successors, (50), 2 states have internal predecessors, (50), 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 217 [2024-11-12 03:50:22,778 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 03:50:22,789 INFO L225 Difference]: With dead ends: 205 [2024-11-12 03:50:22,790 INFO L226 Difference]: Without dead ends: 102 [2024-11-12 03:50:22,797 INFO L434 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-11-12 03:50:22,803 INFO L435 NwaCegarLoop]: 159 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 159 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 03:50:22,804 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 159 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 03:50:22,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2024-11-12 03:50:22,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 102. [2024-11-12 03:50:22,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 66 states have (on average 1.378787878787879) internal successors, (91), 66 states have internal predecessors, (91), 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-11-12 03:50:22,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 159 transitions. [2024-11-12 03:50:22,868 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 159 transitions. Word has length 217 [2024-11-12 03:50:22,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 03:50:22,869 INFO L471 AbstractCegarLoop]: Abstraction has 102 states and 159 transitions. [2024-11-12 03:50:22,870 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 25.0) internal successors, (50), 2 states have internal predecessors, (50), 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-11-12 03:50:22,870 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 159 transitions. [2024-11-12 03:50:22,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 218 [2024-11-12 03:50:22,874 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 03:50:22,874 INFO L218 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, 1, 1, 1] [2024-11-12 03:50:22,875 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-12 03:50:22,875 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 03:50:22,875 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 03:50:22,876 INFO L85 PathProgramCache]: Analyzing trace with hash -1922861391, now seen corresponding path program 1 times [2024-11-12 03:50:22,876 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 03:50:22,876 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [604388338] [2024-11-12 03:50:22,878 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 03:50:22,878 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 03:50:23,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:50:24,554 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 03:50:24,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:50:24,561 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-12 03:50:24,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:50:24,566 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-12 03:50:24,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:50:24,579 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-12 03:50:24,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:50:24,586 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-12 03:50:24,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:50:24,591 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-11-12 03:50:24,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:50:24,602 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-12 03:50:24,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:50:24,608 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-12 03:50:24,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:50:24,614 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-12 03:50:24,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:50:24,618 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-12 03:50:24,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:50:24,626 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-12 03:50:24,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:50:24,635 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-12 03:50:24,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:50:24,643 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-12 03:50:24,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:50:24,648 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-12 03:50:24,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:50:24,653 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-12 03:50:24,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:50:24,658 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-12 03:50:24,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:50:24,663 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-12 03:50:24,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:50:24,668 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-12 03:50:24,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:50:24,673 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-12 03:50:24,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:50:24,678 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-11-12 03:50:24,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:50:24,683 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-12 03:50:24,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:50:24,686 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-11-12 03:50:24,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:50:24,690 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-11-12 03:50:24,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:50:24,694 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-12 03:50:24,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:50:24,697 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-11-12 03:50:24,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:50:24,701 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2024-11-12 03:50:24,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:50:24,705 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2024-11-12 03:50:24,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:50:24,709 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2024-11-12 03:50:24,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:50:24,712 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 159 [2024-11-12 03:50:24,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:50:24,716 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 165 [2024-11-12 03:50:24,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:50:24,720 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 170 [2024-11-12 03:50:24,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:50:24,723 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 176 [2024-11-12 03:50:24,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:50:24,728 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 182 [2024-11-12 03:50:24,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:50:24,733 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 188 [2024-11-12 03:50:24,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:50:24,738 INFO L134 CoverageAnalysis]: Checked inductivity of 2244 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2244 trivial. 0 not checked. [2024-11-12 03:50:24,739 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 03:50:24,739 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [604388338] [2024-11-12 03:50:24,739 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [604388338] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 03:50:24,739 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 03:50:24,740 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-12 03:50:24,740 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1856794786] [2024-11-12 03:50:24,740 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 03:50:24,742 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-12 03:50:24,742 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 03:50:24,743 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-12 03:50:24,743 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-12 03:50:24,743 INFO L87 Difference]: Start difference. First operand 102 states and 159 transitions. Second operand has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 6 states have internal predecessors, (50), 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-11-12 03:50:25,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 03:50:25,367 INFO L93 Difference]: Finished difference Result 282 states and 445 transitions. [2024-11-12 03:50:25,367 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-12 03:50:25,367 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 6 states have internal predecessors, (50), 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 217 [2024-11-12 03:50:25,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 03:50:25,371 INFO L225 Difference]: With dead ends: 282 [2024-11-12 03:50:25,371 INFO L226 Difference]: Without dead ends: 183 [2024-11-12 03:50:25,372 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 72 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-11-12 03:50:25,373 INFO L435 NwaCegarLoop]: 137 mSDtfsCounter, 94 mSDsluCounter, 286 mSDsCounter, 0 mSdLazyCounter, 369 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 94 SdHoareTripleChecker+Valid, 423 SdHoareTripleChecker+Invalid, 370 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 369 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-12 03:50:25,374 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [94 Valid, 423 Invalid, 370 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 369 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-12 03:50:25,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2024-11-12 03:50:25,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 171. [2024-11-12 03:50:25,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 171 states, 100 states have (on average 1.31) internal successors, (131), 100 states have internal predecessors, (131), 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-11-12 03:50:25,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 267 transitions. [2024-11-12 03:50:25,423 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 267 transitions. Word has length 217 [2024-11-12 03:50:25,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 03:50:25,424 INFO L471 AbstractCegarLoop]: Abstraction has 171 states and 267 transitions. [2024-11-12 03:50:25,424 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 6 states have internal predecessors, (50), 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-11-12 03:50:25,424 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 267 transitions. [2024-11-12 03:50:25,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 218 [2024-11-12 03:50:25,433 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 03:50:25,434 INFO L218 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, 1, 1, 1] [2024-11-12 03:50:25,434 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-12 03:50:25,434 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 03:50:25,435 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 03:50:25,435 INFO L85 PathProgramCache]: Analyzing trace with hash 783758003, now seen corresponding path program 1 times [2024-11-12 03:50:25,435 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 03:50:25,435 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [319404213] [2024-11-12 03:50:25,435 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 03:50:25,435 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 03:50:25,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:50:26,162 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 03:50:26,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:50:26,167 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-12 03:50:26,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:50:26,172 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-12 03:50:26,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:50:26,177 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-12 03:50:26,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:50:26,183 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-12 03:50:26,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:50:26,189 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-11-12 03:50:26,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:50:26,196 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-12 03:50:26,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:50:26,202 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-12 03:50:26,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:50:26,207 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-12 03:50:26,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:50:26,212 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-12 03:50:26,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:50:26,216 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-12 03:50:26,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:50:26,220 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-12 03:50:26,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:50:26,226 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-12 03:50:26,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:50:26,231 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-12 03:50:26,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:50:26,236 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-12 03:50:26,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:50:26,241 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-12 03:50:26,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:50:26,246 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-12 03:50:26,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:50:26,254 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-12 03:50:26,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:50:26,260 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-12 03:50:26,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:50:26,265 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-11-12 03:50:26,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:50:26,271 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-12 03:50:26,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:50:26,275 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-11-12 03:50:26,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:50:26,279 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-11-12 03:50:26,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:50:26,284 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-12 03:50:26,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:50:26,288 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-11-12 03:50:26,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:50:26,292 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2024-11-12 03:50:26,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:50:26,295 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2024-11-12 03:50:26,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:50:26,300 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2024-11-12 03:50:26,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:50:26,304 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 159 [2024-11-12 03:50:26,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:50:26,308 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 165 [2024-11-12 03:50:26,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:50:26,313 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 170 [2024-11-12 03:50:26,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:50:26,316 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 176 [2024-11-12 03:50:26,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:50:26,322 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 182 [2024-11-12 03:50:26,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:50:26,328 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 188 [2024-11-12 03:50:26,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:50:26,335 INFO L134 CoverageAnalysis]: Checked inductivity of 2244 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2244 trivial. 0 not checked. [2024-11-12 03:50:26,335 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 03:50:26,335 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [319404213] [2024-11-12 03:50:26,335 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [319404213] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 03:50:26,335 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 03:50:26,336 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-12 03:50:26,336 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2128358974] [2024-11-12 03:50:26,336 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 03:50:26,337 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-12 03:50:26,337 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 03:50:26,338 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-12 03:50:26,338 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-12 03:50:26,338 INFO L87 Difference]: Start difference. First operand 171 states and 267 transitions. Second operand has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 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-11-12 03:50:26,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 03:50:26,513 INFO L93 Difference]: Finished difference Result 271 states and 425 transitions. [2024-11-12 03:50:26,514 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-12 03:50:26,515 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 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 217 [2024-11-12 03:50:26,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 03:50:26,517 INFO L225 Difference]: With dead ends: 271 [2024-11-12 03:50:26,517 INFO L226 Difference]: Without dead ends: 172 [2024-11-12 03:50:26,518 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 70 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-12 03:50:26,519 INFO L435 NwaCegarLoop]: 152 mSDtfsCounter, 85 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 88 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 229 SdHoareTripleChecker+Invalid, 89 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 88 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-12 03:50:26,520 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [85 Valid, 229 Invalid, 89 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 88 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-12 03:50:26,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2024-11-12 03:50:26,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 172. [2024-11-12 03:50:26,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 172 states, 101 states have (on average 1.306930693069307) internal successors, (132), 101 states have internal predecessors, (132), 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-11-12 03:50:26,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 268 transitions. [2024-11-12 03:50:26,551 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 268 transitions. Word has length 217 [2024-11-12 03:50:26,553 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 03:50:26,553 INFO L471 AbstractCegarLoop]: Abstraction has 172 states and 268 transitions. [2024-11-12 03:50:26,554 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 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-11-12 03:50:26,554 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 268 transitions. [2024-11-12 03:50:26,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 219 [2024-11-12 03:50:26,558 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 03:50:26,558 INFO L218 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, 1, 1, 1, 1] [2024-11-12 03:50:26,559 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-12 03:50:26,559 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 03:50:26,559 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 03:50:26,559 INFO L85 PathProgramCache]: Analyzing trace with hash -340582665, now seen corresponding path program 1 times [2024-11-12 03:50:26,560 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 03:50:26,560 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1033363031] [2024-11-12 03:50:26,560 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 03:50:26,560 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 03:50:26,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:50:27,670 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 03:50:27,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:50:27,674 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-12 03:50:27,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:50:27,677 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-12 03:50:27,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:50:27,680 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-12 03:50:27,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:50:27,682 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-12 03:50:27,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:50:27,685 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-11-12 03:50:27,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:50:27,688 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-12 03:50:27,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:50:27,691 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-12 03:50:27,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:50:27,693 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-12 03:50:27,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:50:27,696 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-12 03:50:27,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:50:27,699 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-12 03:50:27,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:50:27,702 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-12 03:50:27,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:50:27,705 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-12 03:50:27,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:50:27,707 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-12 03:50:27,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:50:27,709 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-12 03:50:27,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:50:27,712 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-12 03:50:27,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:50:27,715 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-12 03:50:27,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:50:27,717 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-12 03:50:27,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:50:27,724 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-12 03:50:27,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:50:27,731 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-11-12 03:50:27,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:50:27,739 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-12 03:50:27,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:50:27,742 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-11-12 03:50:27,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:50:27,745 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-11-12 03:50:27,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:50:27,748 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-12 03:50:27,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:50:27,750 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-11-12 03:50:27,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:50:27,753 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2024-11-12 03:50:27,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:50:27,755 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2024-11-12 03:50:27,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:50:27,758 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2024-11-12 03:50:27,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:50:27,760 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 159 [2024-11-12 03:50:27,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:50:27,763 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 165 [2024-11-12 03:50:27,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:50:27,766 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 170 [2024-11-12 03:50:27,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:50:27,768 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 176 [2024-11-12 03:50:27,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:50:27,771 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 182 [2024-11-12 03:50:27,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:50:27,774 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 188 [2024-11-12 03:50:27,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:50:27,778 INFO L134 CoverageAnalysis]: Checked inductivity of 2244 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2244 trivial. 0 not checked. [2024-11-12 03:50:27,778 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 03:50:27,778 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1033363031] [2024-11-12 03:50:27,778 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1033363031] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 03:50:27,778 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 03:50:27,779 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-12 03:50:27,779 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [491751810] [2024-11-12 03:50:27,779 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 03:50:27,779 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-12 03:50:27,779 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 03:50:27,780 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-12 03:50:27,780 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-11-12 03:50:27,781 INFO L87 Difference]: Start difference. First operand 172 states and 268 transitions. Second operand has 6 states, 6 states have (on average 8.5) internal successors, (51), 6 states have internal predecessors, (51), 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-11-12 03:50:28,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 03:50:28,549 INFO L93 Difference]: Finished difference Result 396 states and 624 transitions. [2024-11-12 03:50:28,550 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-12 03:50:28,550 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.5) internal successors, (51), 6 states have internal predecessors, (51), 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 218 [2024-11-12 03:50:28,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 03:50:28,554 INFO L225 Difference]: With dead ends: 396 [2024-11-12 03:50:28,554 INFO L226 Difference]: Without dead ends: 296 [2024-11-12 03:50:28,555 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 72 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-11-12 03:50:28,555 INFO L435 NwaCegarLoop]: 230 mSDtfsCounter, 225 mSDsluCounter, 424 mSDsCounter, 0 mSdLazyCounter, 572 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 225 SdHoareTripleChecker+Valid, 654 SdHoareTripleChecker+Invalid, 580 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 572 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-12 03:50:28,556 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [225 Valid, 654 Invalid, 580 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 572 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-12 03:50:28,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 296 states. [2024-11-12 03:50:28,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 296 to 275. [2024-11-12 03:50:28,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 275 states, 169 states have (on average 1.349112426035503) internal successors, (228), 169 states have internal predecessors, (228), 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-11-12 03:50:28,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 275 states to 275 states and 432 transitions. [2024-11-12 03:50:28,608 INFO L78 Accepts]: Start accepts. Automaton has 275 states and 432 transitions. Word has length 218 [2024-11-12 03:50:28,609 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 03:50:28,609 INFO L471 AbstractCegarLoop]: Abstraction has 275 states and 432 transitions. [2024-11-12 03:50:28,610 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.5) internal successors, (51), 6 states have internal predecessors, (51), 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-11-12 03:50:28,610 INFO L276 IsEmpty]: Start isEmpty. Operand 275 states and 432 transitions. [2024-11-12 03:50:28,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 219 [2024-11-12 03:50:28,612 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 03:50:28,612 INFO L218 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, 1, 1, 1, 1] [2024-11-12 03:50:28,612 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-12 03:50:28,613 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 03:50:28,613 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 03:50:28,613 INFO L85 PathProgramCache]: Analyzing trace with hash -607751005, now seen corresponding path program 1 times [2024-11-12 03:50:28,613 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 03:50:28,613 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1505294845] [2024-11-12 03:50:28,614 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 03:50:28,614 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 03:50:28,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:50:30,385 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 03:50:30,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:50:30,390 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-12 03:50:30,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:50:30,393 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-12 03:50:30,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:50:30,396 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-12 03:50:30,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:50:30,399 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-12 03:50:30,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:50:30,402 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-11-12 03:50:30,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:50:30,405 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-12 03:50:30,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:50:30,409 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-12 03:50:30,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:50:30,413 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-12 03:50:30,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:50:30,416 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-12 03:50:30,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:50:30,423 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-12 03:50:30,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:50:30,431 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-12 03:50:30,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:50:30,437 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-12 03:50:30,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:50:30,443 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-12 03:50:30,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:50:30,447 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-12 03:50:30,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:50:30,451 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-12 03:50:30,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:50:30,454 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-12 03:50:30,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:50:30,457 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-12 03:50:30,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:50:30,461 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-12 03:50:30,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:50:30,464 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-11-12 03:50:30,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:50:30,467 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-12 03:50:30,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:50:30,472 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-11-12 03:50:30,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:50:30,476 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-11-12 03:50:30,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:50:30,483 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-12 03:50:30,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:50:30,487 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-11-12 03:50:30,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:50:30,490 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2024-11-12 03:50:30,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:50:30,494 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2024-11-12 03:50:30,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:50:30,501 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2024-11-12 03:50:30,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:50:30,508 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 159 [2024-11-12 03:50:30,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:50:30,512 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 165 [2024-11-12 03:50:30,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:50:30,516 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 170 [2024-11-12 03:50:30,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:50:30,519 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 176 [2024-11-12 03:50:30,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:50:30,525 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 182 [2024-11-12 03:50:30,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:50:30,531 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 188 [2024-11-12 03:50:30,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 03:50:30,539 INFO L134 CoverageAnalysis]: Checked inductivity of 2244 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2244 trivial. 0 not checked. [2024-11-12 03:50:30,539 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 03:50:30,539 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1505294845] [2024-11-12 03:50:30,541 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1505294845] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 03:50:30,541 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 03:50:30,541 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-12 03:50:30,541 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1621728743] [2024-11-12 03:50:30,541 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 03:50:30,542 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-12 03:50:30,542 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 03:50:30,543 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-12 03:50:30,543 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-12 03:50:30,543 INFO L87 Difference]: Start difference. First operand 275 states and 432 transitions. Second operand has 7 states, 7 states have (on average 7.285714285714286) internal successors, (51), 7 states have internal predecessors, (51), 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-11-12 03:50:32,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 03:50:32,125 INFO L93 Difference]: Finished difference Result 645 states and 1003 transitions. [2024-11-12 03:50:32,125 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-12 03:50:32,126 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.285714285714286) internal successors, (51), 7 states have internal predecessors, (51), 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 218 [2024-11-12 03:50:32,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 03:50:32,132 INFO L225 Difference]: With dead ends: 645 [2024-11-12 03:50:32,132 INFO L226 Difference]: Without dead ends: 449 [2024-11-12 03:50:32,133 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2024-11-12 03:50:32,136 INFO L435 NwaCegarLoop]: 230 mSDtfsCounter, 341 mSDsluCounter, 459 mSDsCounter, 0 mSdLazyCounter, 819 mSolverCounterSat, 85 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 341 SdHoareTripleChecker+Valid, 689 SdHoareTripleChecker+Invalid, 904 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 85 IncrementalHoareTripleChecker+Valid, 819 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-11-12 03:50:32,139 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [341 Valid, 689 Invalid, 904 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [85 Valid, 819 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-11-12 03:50:32,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 449 states. [2024-11-12 03:50:32,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 449 to 421. [2024-11-12 03:50:32,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 421 states, 259 states have (on average 1.3243243243243243) internal successors, (343), 260 states have internal predecessors, (343), 156 states have call successors, (156), 5 states have call predecessors, (156), 5 states have return successors, (156), 155 states have call predecessors, (156), 156 states have call successors, (156) [2024-11-12 03:50:32,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 421 states to 421 states and 655 transitions. [2024-11-12 03:50:32,277 INFO L78 Accepts]: Start accepts. Automaton has 421 states and 655 transitions. Word has length 218 [2024-11-12 03:50:32,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 03:50:32,278 INFO L471 AbstractCegarLoop]: Abstraction has 421 states and 655 transitions. [2024-11-12 03:50:32,278 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.285714285714286) internal successors, (51), 7 states have internal predecessors, (51), 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-11-12 03:50:32,278 INFO L276 IsEmpty]: Start isEmpty. Operand 421 states and 655 transitions. [2024-11-12 03:50:32,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 219 [2024-11-12 03:50:32,282 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 03:50:32,282 INFO L218 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, 1, 1, 1, 1] [2024-11-12 03:50:32,282 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-12 03:50:32,283 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 03:50:32,284 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 03:50:32,284 INFO L85 PathProgramCache]: Analyzing trace with hash -1000778015, now seen corresponding path program 1 times [2024-11-12 03:50:32,285 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 03:50:32,285 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1996422795] [2024-11-12 03:50:32,285 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 03:50:32,285 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 03:50:32,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat