./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-cn_file-59.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 3289d67d 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-cn_file-59.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash b5a3a78de85206c06265f4a5f6df62e7897a8d9c53ab2b455732af1ef22c4599 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-3289d67-m [2024-11-16 14:35:42,110 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-16 14:35:42,187 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-16 14:35:42,192 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-16 14:35:42,195 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-16 14:35:42,224 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-16 14:35:42,226 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-16 14:35:42,226 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-16 14:35:42,227 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-16 14:35:42,232 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-16 14:35:42,232 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-16 14:35:42,233 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-16 14:35:42,233 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-16 14:35:42,234 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-16 14:35:42,234 INFO L153 SettingsManager]: * Use SBE=true [2024-11-16 14:35:42,234 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-16 14:35:42,234 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-16 14:35:42,235 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-16 14:35:42,235 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-16 14:35:42,235 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-16 14:35:42,235 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-16 14:35:42,236 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-16 14:35:42,238 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-16 14:35:42,238 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-16 14:35:42,238 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-16 14:35:42,238 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-16 14:35:42,239 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-16 14:35:42,239 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-16 14:35:42,239 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-16 14:35:42,239 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-16 14:35:42,240 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-16 14:35:42,240 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-16 14:35:42,240 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 14:35:42,240 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-16 14:35:42,240 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-16 14:35:42,241 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-16 14:35:42,241 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-16 14:35:42,242 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-16 14:35:42,242 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-16 14:35:42,243 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-16 14:35:42,243 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-16 14:35:42,243 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-16 14:35:42,243 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> b5a3a78de85206c06265f4a5f6df62e7897a8d9c53ab2b455732af1ef22c4599 [2024-11-16 14:35:42,525 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-16 14:35:42,553 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-16 14:35:42,558 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-16 14:35:42,559 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-16 14:35:42,560 INFO L274 PluginConnector]: CDTParser initialized [2024-11-16 14:35:42,562 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-cn_file-59.i [2024-11-16 14:35:44,068 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-16 14:35:44,276 INFO L384 CDTParser]: Found 1 translation units. [2024-11-16 14:35:44,278 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-cn_file-59.i [2024-11-16 14:35:44,292 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a6905035d/95cb30efb9f34d5ebe0678fbbdb5634f/FLAG5a3cd8cb8 [2024-11-16 14:35:44,308 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a6905035d/95cb30efb9f34d5ebe0678fbbdb5634f [2024-11-16 14:35:44,311 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-16 14:35:44,312 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-16 14:35:44,313 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-16 14:35:44,314 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-16 14:35:44,319 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-16 14:35:44,320 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 02:35:44" (1/1) ... [2024-11-16 14:35:44,321 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4b66b816 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 02:35:44, skipping insertion in model container [2024-11-16 14:35:44,321 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 02:35:44" (1/1) ... [2024-11-16 14:35:44,351 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-16 14:35:44,516 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-cn_file-59.i[919,932] [2024-11-16 14:35:44,601 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 14:35:44,612 INFO L200 MainTranslator]: Completed pre-run [2024-11-16 14:35:44,625 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-cn_file-59.i[919,932] [2024-11-16 14:35:44,677 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 14:35:44,701 INFO L204 MainTranslator]: Completed translation [2024-11-16 14:35:44,702 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 02:35:44 WrapperNode [2024-11-16 14:35:44,702 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-16 14:35:44,703 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-16 14:35:44,703 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-16 14:35:44,703 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-16 14:35:44,709 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 02:35:44" (1/1) ... [2024-11-16 14:35:44,721 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 02:35:44" (1/1) ... [2024-11-16 14:35:44,767 INFO L138 Inliner]: procedures = 26, calls = 47, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 241 [2024-11-16 14:35:44,768 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-16 14:35:44,769 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-16 14:35:44,769 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-16 14:35:44,769 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-16 14:35:44,782 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 02:35:44" (1/1) ... [2024-11-16 14:35:44,782 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 02:35:44" (1/1) ... [2024-11-16 14:35:44,797 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 02:35:44" (1/1) ... [2024-11-16 14:35:44,833 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-16 14:35:44,837 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 02:35:44" (1/1) ... [2024-11-16 14:35:44,838 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 02:35:44" (1/1) ... [2024-11-16 14:35:44,857 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 02:35:44" (1/1) ... [2024-11-16 14:35:44,860 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 02:35:44" (1/1) ... [2024-11-16 14:35:44,865 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 02:35:44" (1/1) ... [2024-11-16 14:35:44,872 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 02:35:44" (1/1) ... [2024-11-16 14:35:44,884 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-16 14:35:44,886 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-16 14:35:44,887 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-16 14:35:44,887 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-16 14:35:44,889 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 02:35:44" (1/1) ... [2024-11-16 14:35:44,894 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 14:35:44,906 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 14:35:44,923 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-16 14:35:44,928 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-16 14:35:44,979 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-16 14:35:44,980 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-16 14:35:44,980 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-16 14:35:44,980 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-16 14:35:44,980 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-16 14:35:44,980 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-16 14:35:45,120 INFO L256 CfgBuilder]: Building ICFG [2024-11-16 14:35:45,126 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-16 14:35:45,693 INFO L? ?]: Removed 20 outVars from TransFormulas that were not future-live. [2024-11-16 14:35:45,693 INFO L307 CfgBuilder]: Performing block encoding [2024-11-16 14:35:45,724 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-16 14:35:45,726 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-16 14:35:45,727 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 02:35:45 BoogieIcfgContainer [2024-11-16 14:35:45,727 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-16 14:35:45,730 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-16 14:35:45,731 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-16 14:35:45,734 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-16 14:35:45,734 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.11 02:35:44" (1/3) ... [2024-11-16 14:35:45,735 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4f5be4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 02:35:45, skipping insertion in model container [2024-11-16 14:35:45,736 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 02:35:44" (2/3) ... [2024-11-16 14:35:45,736 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4f5be4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 02:35:45, skipping insertion in model container [2024-11-16 14:35:45,737 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 02:35:45" (3/3) ... [2024-11-16 14:35:45,739 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-pr-cn_file-59.i [2024-11-16 14:35:45,757 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-16 14:35:45,758 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-16 14:35:45,832 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-16 14:35:45,842 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;@670a6d19, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-16 14:35:45,842 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-16 14:35:45,848 INFO L276 IsEmpty]: Start isEmpty. Operand has 108 states, 71 states have (on average 1.4366197183098592) internal successors, (102), 72 states have internal predecessors, (102), 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-16 14:35:45,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 219 [2024-11-16 14:35:45,872 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 14:35:45,873 INFO L215 NwaCegarLoop]: trace histogram [34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 14:35:45,874 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 14:35:45,880 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 14:35:45,880 INFO L85 PathProgramCache]: Analyzing trace with hash -1275628166, now seen corresponding path program 1 times [2024-11-16 14:35:45,889 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 14:35:45,890 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1143668470] [2024-11-16 14:35:45,890 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 14:35:45,891 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 14:35:46,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:35:46,288 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 14:35:46,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:35:46,303 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-16 14:35:46,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:35:46,308 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-16 14:35:46,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:35:46,314 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-16 14:35:46,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:35:46,320 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-16 14:35:46,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:35:46,327 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-16 14:35:46,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:35:46,332 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-16 14:35:46,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:35:46,338 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-16 14:35:46,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:35:46,344 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-16 14:35:46,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:35:46,354 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-16 14:35:46,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:35:46,364 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-16 14:35:46,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:35:46,373 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-16 14:35:46,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:35:46,386 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-16 14:35:46,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:35:46,397 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-16 14:35:46,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:35:46,404 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-16 14:35:46,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:35:46,412 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-16 14:35:46,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:35:46,420 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-16 14:35:46,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:35:46,427 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-16 14:35:46,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:35:46,432 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-16 14:35:46,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:35:46,442 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-11-16 14:35:46,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:35:46,448 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-16 14:35:46,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:35:46,456 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-11-16 14:35:46,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:35:46,463 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-16 14:35:46,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:35:46,470 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-11-16 14:35:46,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:35:46,475 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-11-16 14:35:46,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:35:46,479 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2024-11-16 14:35:46,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:35:46,483 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2024-11-16 14:35:46,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:35:46,487 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2024-11-16 14:35:46,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:35:46,491 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 162 [2024-11-16 14:35:46,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:35:46,514 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 167 [2024-11-16 14:35:46,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:35:46,521 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2024-11-16 14:35:46,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:35:46,526 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 178 [2024-11-16 14:35:46,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:35:46,530 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 184 [2024-11-16 14:35:46,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:35:46,555 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 189 [2024-11-16 14:35:46,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:35:46,568 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-16 14:35:46,569 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 14:35:46,569 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1143668470] [2024-11-16 14:35:46,570 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1143668470] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 14:35:46,570 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 14:35:46,571 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-16 14:35:46,573 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1154330408] [2024-11-16 14:35:46,574 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 14:35:46,579 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-16 14:35:46,580 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 14:35:46,602 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-16 14:35:46,603 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-16 14:35:46,605 INFO L87 Difference]: Start difference. First operand has 108 states, 71 states have (on average 1.4366197183098592) internal successors, (102), 72 states have internal predecessors, (102), 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.5) internal successors, (51), 2 states have internal predecessors, (51), 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-16 14:35:46,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 14:35:46,650 INFO L93 Difference]: Finished difference Result 208 states and 367 transitions. [2024-11-16 14:35:46,653 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-16 14:35:46,655 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 25.5) internal successors, (51), 2 states have internal predecessors, (51), 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 218 [2024-11-16 14:35:46,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 14:35:46,665 INFO L225 Difference]: With dead ends: 208 [2024-11-16 14:35:46,666 INFO L226 Difference]: Without dead ends: 103 [2024-11-16 14:35:46,671 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 104 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-16 14:35:46,676 INFO L432 NwaCegarLoop]: 159 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 159 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-16 14:35:46,677 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 159 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-16 14:35:46,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2024-11-16 14:35:46,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 103. [2024-11-16 14:35:46,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 67 states have (on average 1.3880597014925373) internal successors, (93), 67 states have internal predecessors, (93), 34 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) [2024-11-16 14:35:46,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 161 transitions. [2024-11-16 14:35:46,741 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 161 transitions. Word has length 218 [2024-11-16 14:35:46,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 14:35:46,742 INFO L471 AbstractCegarLoop]: Abstraction has 103 states and 161 transitions. [2024-11-16 14:35:46,742 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 25.5) internal successors, (51), 2 states have internal predecessors, (51), 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-16 14:35:46,743 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 161 transitions. [2024-11-16 14:35:46,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 219 [2024-11-16 14:35:46,748 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 14:35:46,748 INFO L215 NwaCegarLoop]: trace histogram [34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 14:35:46,748 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-16 14:35:46,749 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 14:35:46,749 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 14:35:46,750 INFO L85 PathProgramCache]: Analyzing trace with hash 1735491542, now seen corresponding path program 1 times [2024-11-16 14:35:46,750 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 14:35:46,750 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1441020566] [2024-11-16 14:35:46,750 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 14:35:46,750 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 14:35:46,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:35:47,421 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 14:35:47,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:35:47,426 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-16 14:35:47,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:35:47,429 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-16 14:35:47,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:35:47,433 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-16 14:35:47,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:35:47,437 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-16 14:35:47,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:35:47,441 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-16 14:35:47,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:35:47,445 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-16 14:35:47,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:35:47,449 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-16 14:35:47,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:35:47,454 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-16 14:35:47,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:35:47,463 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-16 14:35:47,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:35:47,476 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-16 14:35:47,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:35:47,480 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-16 14:35:47,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:35:47,487 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-16 14:35:47,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:35:47,493 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-16 14:35:47,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:35:47,498 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-16 14:35:47,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:35:47,503 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-16 14:35:47,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:35:47,507 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-16 14:35:47,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:35:47,510 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-16 14:35:47,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:35:47,515 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-16 14:35:47,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:35:47,523 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-11-16 14:35:47,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:35:47,532 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-16 14:35:47,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:35:47,541 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-11-16 14:35:47,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:35:47,554 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-16 14:35:47,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:35:47,562 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-11-16 14:35:47,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:35:47,568 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-11-16 14:35:47,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:35:47,581 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2024-11-16 14:35:47,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:35:47,590 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2024-11-16 14:35:47,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:35:47,596 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2024-11-16 14:35:47,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:35:47,603 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 162 [2024-11-16 14:35:47,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:35:47,609 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 167 [2024-11-16 14:35:47,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:35:47,614 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2024-11-16 14:35:47,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:35:47,620 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 178 [2024-11-16 14:35:47,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:35:47,627 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 184 [2024-11-16 14:35:47,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:35:47,635 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 189 [2024-11-16 14:35:47,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:35:47,645 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-16 14:35:47,645 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 14:35:47,645 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1441020566] [2024-11-16 14:35:47,646 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1441020566] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 14:35:47,646 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 14:35:47,649 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-16 14:35:47,649 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2105762593] [2024-11-16 14:35:47,649 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 14:35:47,651 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-16 14:35:47,651 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 14:35:47,652 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-16 14:35:47,652 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-16 14:35:47,652 INFO L87 Difference]: Start difference. First operand 103 states and 161 transitions. Second operand has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 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-16 14:35:47,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 14:35:47,897 INFO L93 Difference]: Finished difference Result 305 states and 479 transitions. [2024-11-16 14:35:47,898 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-16 14:35:47,898 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 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-16 14:35:47,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 14:35:47,906 INFO L225 Difference]: With dead ends: 305 [2024-11-16 14:35:47,907 INFO L226 Difference]: Without dead ends: 205 [2024-11-16 14:35:47,908 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 71 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-16 14:35:47,909 INFO L432 NwaCegarLoop]: 156 mSDtfsCounter, 121 mSDsluCounter, 305 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 103 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 121 SdHoareTripleChecker+Valid, 461 SdHoareTripleChecker+Invalid, 119 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 103 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-16 14:35:47,913 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [121 Valid, 461 Invalid, 119 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [103 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-16 14:35:47,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2024-11-16 14:35:47,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 164. [2024-11-16 14:35:47,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 164 states, 93 states have (on average 1.2795698924731183) internal successors, (119), 93 states have internal predecessors, (119), 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-16 14:35:47,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 255 transitions. [2024-11-16 14:35:47,967 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 255 transitions. Word has length 218 [2024-11-16 14:35:47,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 14:35:47,968 INFO L471 AbstractCegarLoop]: Abstraction has 164 states and 255 transitions. [2024-11-16 14:35:47,968 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 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-16 14:35:47,970 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 255 transitions. [2024-11-16 14:35:47,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 220 [2024-11-16 14:35:47,977 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 14:35:47,977 INFO L215 NwaCegarLoop]: trace histogram [34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 14:35:47,978 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-16 14:35:47,978 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 14:35:47,978 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 14:35:47,978 INFO L85 PathProgramCache]: Analyzing trace with hash 988379546, now seen corresponding path program 1 times [2024-11-16 14:35:47,978 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 14:35:47,979 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1055354730] [2024-11-16 14:35:47,979 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 14:35:47,979 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 14:35:48,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:35:48,368 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 14:35:48,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:35:48,372 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-16 14:35:48,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:35:48,375 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-16 14:35:48,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:35:48,378 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-16 14:35:48,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:35:48,381 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-16 14:35:48,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:35:48,385 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-16 14:35:48,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:35:48,393 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-16 14:35:48,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:35:48,399 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-16 14:35:48,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:35:48,405 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-16 14:35:48,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:35:48,408 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-16 14:35:48,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:35:48,412 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-16 14:35:48,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:35:48,418 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-16 14:35:48,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:35:48,426 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-16 14:35:48,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:35:48,432 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-16 14:35:48,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:35:48,435 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-16 14:35:48,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:35:48,439 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-16 14:35:48,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:35:48,445 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-16 14:35:48,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:35:48,450 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-16 14:35:48,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:35:48,453 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-16 14:35:48,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:35:48,457 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-11-16 14:35:48,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:35:48,460 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-16 14:35:48,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:35:48,464 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-11-16 14:35:48,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:35:48,467 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-16 14:35:48,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:35:48,470 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-11-16 14:35:48,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:35:48,474 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-11-16 14:35:48,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:35:48,477 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2024-11-16 14:35:48,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:35:48,482 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2024-11-16 14:35:48,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:35:48,487 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2024-11-16 14:35:48,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:35:48,490 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 162 [2024-11-16 14:35:48,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:35:48,495 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 167 [2024-11-16 14:35:48,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:35:48,500 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2024-11-16 14:35:48,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:35:48,504 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 178 [2024-11-16 14:35:48,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:35:48,509 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 184 [2024-11-16 14:35:48,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:35:48,513 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 189 [2024-11-16 14:35:48,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:35:48,521 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-16 14:35:48,522 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 14:35:48,523 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1055354730] [2024-11-16 14:35:48,523 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1055354730] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 14:35:48,523 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 14:35:48,523 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-16 14:35:48,523 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1922704097] [2024-11-16 14:35:48,524 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 14:35:48,525 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-16 14:35:48,526 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 14:35:48,527 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-16 14:35:48,527 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-16 14:35:48,527 INFO L87 Difference]: Start difference. First operand 164 states and 255 transitions. Second operand has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 1 states have call successors, (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-16 14:35:48,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 14:35:48,772 INFO L93 Difference]: Finished difference Result 376 states and 585 transitions. [2024-11-16 14:35:48,773 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-16 14:35:48,773 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 1 states have call successors, (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 219 [2024-11-16 14:35:48,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 14:35:48,779 INFO L225 Difference]: With dead ends: 376 [2024-11-16 14:35:48,780 INFO L226 Difference]: Without dead ends: 276 [2024-11-16 14:35:48,781 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 71 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-16 14:35:48,782 INFO L432 NwaCegarLoop]: 162 mSDtfsCounter, 141 mSDsluCounter, 298 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 104 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 141 SdHoareTripleChecker+Valid, 460 SdHoareTripleChecker+Invalid, 133 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 104 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-16 14:35:48,782 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [141 Valid, 460 Invalid, 133 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [104 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-16 14:35:48,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 276 states. [2024-11-16 14:35:48,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 276 to 261. [2024-11-16 14:35:48,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 261 states, 155 states have (on average 1.3225806451612903) internal successors, (205), 155 states have internal predecessors, (205), 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-16 14:35:48,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 261 states to 261 states and 409 transitions. [2024-11-16 14:35:48,837 INFO L78 Accepts]: Start accepts. Automaton has 261 states and 409 transitions. Word has length 219 [2024-11-16 14:35:48,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 14:35:48,838 INFO L471 AbstractCegarLoop]: Abstraction has 261 states and 409 transitions. [2024-11-16 14:35:48,839 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 1 states have call successors, (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-16 14:35:48,839 INFO L276 IsEmpty]: Start isEmpty. Operand 261 states and 409 transitions. [2024-11-16 14:35:48,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 221 [2024-11-16 14:35:48,842 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 14:35:48,842 INFO L215 NwaCegarLoop]: trace histogram [34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 14:35:48,842 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-16 14:35:48,842 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 14:35:48,843 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 14:35:48,843 INFO L85 PathProgramCache]: Analyzing trace with hash 501054573, now seen corresponding path program 1 times [2024-11-16 14:35:48,843 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 14:35:48,843 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1535455549] [2024-11-16 14:35:48,843 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 14:35:48,844 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 14:35:49,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-16 14:35:49,112 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [340562658] [2024-11-16 14:35:49,113 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 14:35:49,114 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 14:35:49,114 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 14:35:49,116 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-16 14:35:49,118 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-16 14:35:49,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:35:49,494 INFO L255 TraceCheckSpWp]: Trace formula consists of 509 conjuncts, 42 conjuncts are in the unsatisfiable core [2024-11-16 14:35:49,508 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 14:35:53,714 INFO L134 CoverageAnalysis]: Checked inductivity of 2244 backedges. 429 proven. 405 refuted. 0 times theorem prover too weak. 1410 trivial. 0 not checked. [2024-11-16 14:35:53,714 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-16 14:36:02,179 WARN L286 SmtUtils]: Spent 6.56s on a formula simplification that was a NOOP. DAG size: 7 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-16 14:36:35,654 WARN L286 SmtUtils]: Spent 5.87s on a formula simplification that was a NOOP. DAG size: 11 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-16 14:36:48,954 WARN L286 SmtUtils]: Spent 8.24s on a formula simplification that was a NOOP. DAG size: 53 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-16 14:36:59,063 WARN L286 SmtUtils]: Spent 5.60s on a formula simplification that was a NOOP. DAG size: 7 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-16 14:37:04,719 WARN L286 SmtUtils]: Spent 5.64s on a formula simplification that was a NOOP. DAG size: 9 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)