./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-33.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 84cfde4a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-33.i -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash d964adfd28c767eded8fdfbce722a54e84eb80fd1e317a796a69a672aa367725 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 09:27:38,776 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 09:27:38,860 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-11 09:27:38,865 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 09:27:38,866 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 09:27:38,885 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 09:27:38,886 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 09:27:38,886 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 09:27:38,887 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 09:27:38,887 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 09:27:38,887 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 09:27:38,888 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 09:27:38,888 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 09:27:38,889 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 09:27:38,889 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 09:27:38,889 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 09:27:38,890 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 09:27:38,890 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 09:27:38,891 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 09:27:38,891 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 09:27:38,891 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 09:27:38,895 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 09:27:38,896 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 09:27:38,896 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 09:27:38,896 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 09:27:38,896 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 09:27:38,897 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 09:27:38,897 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 09:27:38,897 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 09:27:38,897 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 09:27:38,898 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 09:27:38,898 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 09:27:38,898 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 09:27:38,898 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 09:27:38,899 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 09:27:38,899 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 09:27:38,899 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 09:27:38,899 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 09:27:38,900 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 09:27:38,900 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 09:27:38,900 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 09:27:38,901 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 09:27:38,901 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> d964adfd28c767eded8fdfbce722a54e84eb80fd1e317a796a69a672aa367725 [2024-10-11 09:27:39,183 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 09:27:39,210 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 09:27:39,212 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 09:27:39,214 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 09:27:39,215 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 09:27:39,216 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-33.i [2024-10-11 09:27:40,691 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 09:27:40,924 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 09:27:40,925 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-33.i [2024-10-11 09:27:40,935 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/074e1e835/d4755ca66e90408eb528ac9280f0ab77/FLAG82a635ebb [2024-10-11 09:27:40,949 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/074e1e835/d4755ca66e90408eb528ac9280f0ab77 [2024-10-11 09:27:40,952 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 09:27:40,953 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 09:27:40,955 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 09:27:40,956 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 09:27:40,961 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 09:27:40,962 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 09:27:40" (1/1) ... [2024-10-11 09:27:40,963 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@579dabc5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:27:40, skipping insertion in model container [2024-10-11 09:27:40,963 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 09:27:40" (1/1) ... [2024-10-11 09:27:40,995 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 09:27:41,178 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-33.i[919,932] [2024-10-11 09:27:41,254 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 09:27:41,266 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 09:27:41,279 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-33.i[919,932] [2024-10-11 09:27:41,308 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 09:27:41,334 INFO L204 MainTranslator]: Completed translation [2024-10-11 09:27:41,335 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:27:41 WrapperNode [2024-10-11 09:27:41,335 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 09:27:41,336 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 09:27:41,337 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 09:27:41,337 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 09:27:41,343 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:27:41" (1/1) ... [2024-10-11 09:27:41,353 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:27:41" (1/1) ... [2024-10-11 09:27:41,388 INFO L138 Inliner]: procedures = 26, calls = 39, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 201 [2024-10-11 09:27:41,388 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 09:27:41,389 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 09:27:41,389 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 09:27:41,393 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 09:27:41,403 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:27:41" (1/1) ... [2024-10-11 09:27:41,403 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:27:41" (1/1) ... [2024-10-11 09:27:41,409 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:27:41" (1/1) ... [2024-10-11 09:27:41,428 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-11 09:27:41,428 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:27:41" (1/1) ... [2024-10-11 09:27:41,429 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:27:41" (1/1) ... [2024-10-11 09:27:41,442 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:27:41" (1/1) ... [2024-10-11 09:27:41,456 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:27:41" (1/1) ... [2024-10-11 09:27:41,464 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:27:41" (1/1) ... [2024-10-11 09:27:41,471 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:27:41" (1/1) ... [2024-10-11 09:27:41,488 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 09:27:41,490 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 09:27:41,491 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 09:27:41,491 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 09:27:41,492 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:27:41" (1/1) ... [2024-10-11 09:27:41,497 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 09:27:41,508 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 09:27:41,524 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 09:27:41,531 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 09:27:41,584 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 09:27:41,584 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-11 09:27:41,585 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-11 09:27:41,585 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-11 09:27:41,585 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 09:27:41,585 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 09:27:41,694 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 09:27:41,696 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 09:27:42,117 INFO L? ?]: Removed 15 outVars from TransFormulas that were not future-live. [2024-10-11 09:27:42,118 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 09:27:42,162 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 09:27:42,163 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-11 09:27:42,163 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 09:27:42 BoogieIcfgContainer [2024-10-11 09:27:42,163 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 09:27:42,166 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 09:27:42,166 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 09:27:42,169 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 09:27:42,169 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 09:27:40" (1/3) ... [2024-10-11 09:27:42,170 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@22ab9838 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 09:27:42, skipping insertion in model container [2024-10-11 09:27:42,171 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:27:41" (2/3) ... [2024-10-11 09:27:42,171 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@22ab9838 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 09:27:42, skipping insertion in model container [2024-10-11 09:27:42,173 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 09:27:42" (3/3) ... [2024-10-11 09:27:42,174 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-pr-ci_file-33.i [2024-10-11 09:27:42,190 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 09:27:42,191 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-11 09:27:42,264 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 09:27:42,275 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;@4879aa1d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 09:27:42,275 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-11 09:27:42,282 INFO L276 IsEmpty]: Start isEmpty. Operand has 83 states, 54 states have (on average 1.5) internal successors, (81), 55 states have internal predecessors, (81), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2024-10-11 09:27:42,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2024-10-11 09:27:42,300 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 09:27:42,301 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 09:27:42,302 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 09:27:42,306 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 09:27:42,307 INFO L85 PathProgramCache]: Analyzing trace with hash 220986510, now seen corresponding path program 1 times [2024-10-11 09:27:42,315 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 09:27:42,316 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1252517365] [2024-10-11 09:27:42,316 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 09:27:42,317 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 09:27:42,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:27:42,657 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 09:27:42,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:27:42,670 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 09:27:42,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:27:42,679 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 09:27:42,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:27:42,685 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-11 09:27:42,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:27:42,690 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-11 09:27:42,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:27:42,693 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-11 09:27:42,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:27:42,698 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-11 09:27:42,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:27:42,701 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-11 09:27:42,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:27:42,706 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-11 09:27:42,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:27:42,710 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-11 09:27:42,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:27:42,714 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-11 09:27:42,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:27:42,726 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-11 09:27:42,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:27:42,756 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-11 09:27:42,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:27:42,765 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-11 09:27:42,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:27:42,775 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-11 09:27:42,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:27:42,783 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-11 09:27:42,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:27:42,795 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-11 09:27:42,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:27:42,823 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-11 09:27:42,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:27:42,833 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-11 09:27:42,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:27:42,840 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-11 09:27:42,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:27:42,846 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-10-11 09:27:42,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:27:42,851 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-10-11 09:27:42,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:27:42,855 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-10-11 09:27:42,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:27:42,864 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-10-11 09:27:42,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:27:42,871 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-10-11 09:27:42,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:27:42,877 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-10-11 09:27:42,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:27:42,887 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2024-10-11 09:27:42,889 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 09:27:42,889 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1252517365] [2024-10-11 09:27:42,890 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1252517365] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 09:27:42,891 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 09:27:42,891 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 09:27:42,892 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2082529360] [2024-10-11 09:27:42,893 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 09:27:42,898 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-11 09:27:42,899 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 09:27:42,922 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-11 09:27:42,923 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 09:27:42,926 INFO L87 Difference]: Start difference. First operand has 83 states, 54 states have (on average 1.5) internal successors, (81), 55 states have internal predecessors, (81), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) Second operand has 2 states, 2 states have (on average 19.5) internal successors, (39), 2 states have internal predecessors, (39), 2 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 2 states have call successors, (26) [2024-10-11 09:27:42,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 09:27:42,979 INFO L93 Difference]: Finished difference Result 161 states and 286 transitions. [2024-10-11 09:27:42,982 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-11 09:27:42,983 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 19.5) internal successors, (39), 2 states have internal predecessors, (39), 2 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 2 states have call successors, (26) Word has length 166 [2024-10-11 09:27:42,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 09:27:42,991 INFO L225 Difference]: With dead ends: 161 [2024-10-11 09:27:42,991 INFO L226 Difference]: Without dead ends: 79 [2024-10-11 09:27:42,995 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 80 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 09:27:42,998 INFO L432 NwaCegarLoop]: 118 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 118 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 09:27:42,999 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 118 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 09:27:43,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2024-10-11 09:27:43,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2024-10-11 09:27:43,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 51 states have (on average 1.3529411764705883) internal successors, (69), 51 states have internal predecessors, (69), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2024-10-11 09:27:43,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 121 transitions. [2024-10-11 09:27:43,053 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 121 transitions. Word has length 166 [2024-10-11 09:27:43,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 09:27:43,053 INFO L471 AbstractCegarLoop]: Abstraction has 79 states and 121 transitions. [2024-10-11 09:27:43,054 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 19.5) internal successors, (39), 2 states have internal predecessors, (39), 2 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 2 states have call successors, (26) [2024-10-11 09:27:43,054 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 121 transitions. [2024-10-11 09:27:43,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2024-10-11 09:27:43,058 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 09:27:43,058 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 09:27:43,059 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 09:27:43,059 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 09:27:43,060 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 09:27:43,060 INFO L85 PathProgramCache]: Analyzing trace with hash -1910866226, now seen corresponding path program 1 times [2024-10-11 09:27:43,060 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 09:27:43,060 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [657452504] [2024-10-11 09:27:43,061 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 09:27:43,061 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 09:27:43,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:27:43,997 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 09:27:43,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:27:44,004 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 09:27:44,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:27:44,013 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 09:27:44,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:27:44,022 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-11 09:27:44,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:27:44,030 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-11 09:27:44,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:27:44,039 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-11 09:27:44,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:27:44,050 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-11 09:27:44,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:27:44,057 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-11 09:27:44,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:27:44,067 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-11 09:27:44,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:27:44,074 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-11 09:27:44,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:27:44,092 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-11 09:27:44,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:27:44,103 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-11 09:27:44,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:27:44,109 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-11 09:27:44,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:27:44,116 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-11 09:27:44,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:27:44,122 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-11 09:27:44,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:27:44,131 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-11 09:27:44,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:27:44,141 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-11 09:27:44,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:27:44,152 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-11 09:27:44,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:27:44,159 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-11 09:27:44,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:27:44,168 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-11 09:27:44,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:27:44,179 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-10-11 09:27:44,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:27:44,185 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-10-11 09:27:44,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:27:44,191 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-10-11 09:27:44,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:27:44,201 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-10-11 09:27:44,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:27:44,213 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-10-11 09:27:44,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:27:44,221 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-10-11 09:27:44,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:27:44,236 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2024-10-11 09:27:44,236 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 09:27:44,236 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [657452504] [2024-10-11 09:27:44,237 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [657452504] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 09:27:44,237 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 09:27:44,237 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 09:27:44,237 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1285689010] [2024-10-11 09:27:44,238 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 09:27:44,240 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 09:27:44,242 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 09:27:44,242 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 09:27:44,243 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 09:27:44,243 INFO L87 Difference]: Start difference. First operand 79 states and 121 transitions. Second operand has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-10-11 09:27:44,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 09:27:44,622 INFO L93 Difference]: Finished difference Result 241 states and 371 transitions. [2024-10-11 09:27:44,623 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 09:27:44,623 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 166 [2024-10-11 09:27:44,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 09:27:44,626 INFO L225 Difference]: With dead ends: 241 [2024-10-11 09:27:44,626 INFO L226 Difference]: Without dead ends: 163 [2024-10-11 09:27:44,627 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-11 09:27:44,631 INFO L432 NwaCegarLoop]: 101 mSDtfsCounter, 86 mSDsluCounter, 192 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 81 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 86 SdHoareTripleChecker+Valid, 293 SdHoareTripleChecker+Invalid, 162 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 81 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-11 09:27:44,632 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [86 Valid, 293 Invalid, 162 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [81 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-11 09:27:44,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2024-10-11 09:27:44,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 149. [2024-10-11 09:27:44,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 149 states, 94 states have (on average 1.3297872340425532) internal successors, (125), 94 states have internal predecessors, (125), 52 states have call successors, (52), 2 states have call predecessors, (52), 2 states have return successors, (52), 52 states have call predecessors, (52), 52 states have call successors, (52) [2024-10-11 09:27:44,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 229 transitions. [2024-10-11 09:27:44,677 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 229 transitions. Word has length 166 [2024-10-11 09:27:44,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 09:27:44,678 INFO L471 AbstractCegarLoop]: Abstraction has 149 states and 229 transitions. [2024-10-11 09:27:44,679 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-10-11 09:27:44,679 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 229 transitions. [2024-10-11 09:27:44,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2024-10-11 09:27:44,681 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 09:27:44,681 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 09:27:44,681 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-11 09:27:44,681 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 09:27:44,682 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 09:27:44,682 INFO L85 PathProgramCache]: Analyzing trace with hash -2041200573, now seen corresponding path program 1 times [2024-10-11 09:27:44,682 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 09:27:44,682 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1566735886] [2024-10-11 09:27:44,683 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 09:27:44,683 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 09:27:44,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:27:44,933 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 09:27:44,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:27:44,939 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 09:27:44,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:27:44,944 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 09:27:44,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:27:44,950 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-11 09:27:44,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:27:44,954 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-11 09:27:44,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:27:44,957 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-11 09:27:44,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:27:44,960 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-11 09:27:44,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:27:44,965 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-11 09:27:44,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:27:44,969 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-11 09:27:44,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:27:44,975 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-11 09:27:44,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:27:44,979 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-11 09:27:44,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:27:44,985 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-11 09:27:44,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:27:44,991 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-11 09:27:44,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:27:44,996 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-11 09:27:44,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:27:45,000 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-11 09:27:45,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:27:45,005 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-11 09:27:45,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:27:45,013 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-11 09:27:45,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:27:45,020 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-11 09:27:45,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:27:45,025 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-11 09:27:45,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:27:45,031 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-11 09:27:45,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:27:45,036 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-10-11 09:27:45,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:27:45,039 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-10-11 09:27:45,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:27:45,044 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-10-11 09:27:45,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:27:45,049 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-10-11 09:27:45,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:27:45,053 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-10-11 09:27:45,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:27:45,057 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-10-11 09:27:45,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:27:45,062 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2024-10-11 09:27:45,063 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 09:27:45,063 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1566735886] [2024-10-11 09:27:45,063 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1566735886] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 09:27:45,063 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 09:27:45,063 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 09:27:45,064 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1135153896] [2024-10-11 09:27:45,064 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 09:27:45,065 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 09:27:45,065 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 09:27:45,065 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 09:27:45,066 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 09:27:45,066 INFO L87 Difference]: Start difference. First operand 149 states and 229 transitions. Second operand has 4 states, 4 states have (on average 10.0) internal successors, (40), 4 states have internal predecessors, (40), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-10-11 09:27:45,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 09:27:45,289 INFO L93 Difference]: Finished difference Result 259 states and 394 transitions. [2024-10-11 09:27:45,289 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 09:27:45,290 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.0) internal successors, (40), 4 states have internal predecessors, (40), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 167 [2024-10-11 09:27:45,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 09:27:45,292 INFO L225 Difference]: With dead ends: 259 [2024-10-11 09:27:45,292 INFO L226 Difference]: Without dead ends: 158 [2024-10-11 09:27:45,296 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-11 09:27:45,297 INFO L432 NwaCegarLoop]: 101 mSDtfsCounter, 83 mSDsluCounter, 201 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 80 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 302 SdHoareTripleChecker+Invalid, 139 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 80 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 09:27:45,299 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [83 Valid, 302 Invalid, 139 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [80 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 09:27:45,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2024-10-11 09:27:45,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 150. [2024-10-11 09:27:45,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 150 states, 95 states have (on average 1.3157894736842106) internal successors, (125), 95 states have internal predecessors, (125), 52 states have call successors, (52), 2 states have call predecessors, (52), 2 states have return successors, (52), 52 states have call predecessors, (52), 52 states have call successors, (52) [2024-10-11 09:27:45,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 229 transitions. [2024-10-11 09:27:45,340 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 229 transitions. Word has length 167 [2024-10-11 09:27:45,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 09:27:45,343 INFO L471 AbstractCegarLoop]: Abstraction has 150 states and 229 transitions. [2024-10-11 09:27:45,344 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.0) internal successors, (40), 4 states have internal predecessors, (40), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-10-11 09:27:45,344 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 229 transitions. [2024-10-11 09:27:45,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2024-10-11 09:27:45,346 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 09:27:45,346 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 09:27:45,346 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-11 09:27:45,346 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 09:27:45,347 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 09:27:45,347 INFO L85 PathProgramCache]: Analyzing trace with hash 841599411, now seen corresponding path program 1 times [2024-10-11 09:27:45,347 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 09:27:45,347 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2015041683] [2024-10-11 09:27:45,348 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 09:27:45,348 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 09:27:45,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:27:53,636 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 09:27:53,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:27:53,641 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 09:27:53,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:27:53,644 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 09:27:53,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:27:53,648 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-11 09:27:53,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:27:53,651 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-11 09:27:53,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:27:53,654 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-11 09:27:53,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:27:53,657 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-11 09:27:53,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:27:53,660 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-11 09:27:53,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:27:53,662 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-11 09:27:53,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:27:53,665 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-11 09:27:53,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:27:53,667 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-11 09:27:53,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:27:53,669 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-11 09:27:53,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:27:53,672 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-11 09:27:53,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:27:53,675 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-11 09:27:53,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:27:53,678 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-11 09:27:53,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:27:53,681 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-11 09:27:53,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:27:53,684 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-11 09:27:53,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:27:53,686 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-11 09:27:53,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:27:53,689 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-11 09:27:53,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:27:53,692 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-11 09:27:53,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:27:53,694 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-10-11 09:27:53,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:27:53,696 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-10-11 09:27:53,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:27:53,699 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-10-11 09:27:53,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:27:53,702 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-10-11 09:27:53,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:27:53,704 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-10-11 09:27:53,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:27:53,708 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-10-11 09:27:53,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 09:27:53,711 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2024-10-11 09:27:53,715 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 09:27:53,715 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2015041683] [2024-10-11 09:27:53,716 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2015041683] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 09:27:53,716 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 09:27:53,716 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-11 09:27:53,716 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [200139442] [2024-10-11 09:27:53,716 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 09:27:53,717 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-11 09:27:53,717 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 09:27:53,718 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-11 09:27:53,718 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-10-11 09:27:53,718 INFO L87 Difference]: Start difference. First operand 150 states and 229 transitions. Second operand has 9 states, 9 states have (on average 4.555555555555555) internal successors, (41), 9 states have internal predecessors, (41), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-10-11 09:27:55,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 09:27:55,764 INFO L93 Difference]: Finished difference Result 331 states and 478 transitions. [2024-10-11 09:27:55,765 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-11 09:27:55,765 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.555555555555555) internal successors, (41), 9 states have internal predecessors, (41), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 168 [2024-10-11 09:27:55,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 09:27:55,768 INFO L225 Difference]: With dead ends: 331 [2024-10-11 09:27:55,768 INFO L226 Difference]: Without dead ends: 247 [2024-10-11 09:27:55,769 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=71, Invalid=169, Unknown=0, NotChecked=0, Total=240 [2024-10-11 09:27:55,771 INFO L432 NwaCegarLoop]: 122 mSDtfsCounter, 363 mSDsluCounter, 448 mSDsCounter, 0 mSdLazyCounter, 590 mSolverCounterSat, 82 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 363 SdHoareTripleChecker+Valid, 570 SdHoareTripleChecker+Invalid, 672 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 82 IncrementalHoareTripleChecker+Valid, 590 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-10-11 09:27:55,771 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [363 Valid, 570 Invalid, 672 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [82 Valid, 590 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-10-11 09:27:55,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 247 states. [2024-10-11 09:27:55,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 247 to 192. [2024-10-11 09:27:55,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 192 states, 132 states have (on average 1.3257575757575757) internal successors, (175), 133 states have internal predecessors, (175), 56 states have call successors, (56), 3 states have call predecessors, (56), 3 states have return successors, (56), 55 states have call predecessors, (56), 56 states have call successors, (56) [2024-10-11 09:27:55,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 287 transitions. [2024-10-11 09:27:55,812 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 287 transitions. Word has length 168 [2024-10-11 09:27:55,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 09:27:55,813 INFO L471 AbstractCegarLoop]: Abstraction has 192 states and 287 transitions. [2024-10-11 09:27:55,813 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.555555555555555) internal successors, (41), 9 states have internal predecessors, (41), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-10-11 09:27:55,813 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 287 transitions. [2024-10-11 09:27:55,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2024-10-11 09:27:55,817 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 09:27:55,817 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 09:27:55,818 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-11 09:27:55,818 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 09:27:55,818 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 09:27:55,818 INFO L85 PathProgramCache]: Analyzing trace with hash 448572401, now seen corresponding path program 1 times [2024-10-11 09:27:55,818 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 09:27:55,818 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1291547923] [2024-10-11 09:27:55,819 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 09:27:55,819 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 09:27:55,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat