./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-100_file-95.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_fillercodesize_ps-cn-100_file-95.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 1b12db86960fa9dc6b9cfa8223c629c146a6be8798d3651a94f684c115400abd --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-3289d67-m [2024-11-16 12:55:11,031 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-16 12:55:11,112 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-16 12:55:11,121 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-16 12:55:11,122 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-16 12:55:11,153 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-16 12:55:11,155 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-16 12:55:11,156 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-16 12:55:11,156 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-16 12:55:11,157 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-16 12:55:11,158 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-16 12:55:11,158 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-16 12:55:11,159 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-16 12:55:11,161 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-16 12:55:11,161 INFO L153 SettingsManager]: * Use SBE=true [2024-11-16 12:55:11,162 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-16 12:55:11,162 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-16 12:55:11,162 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-16 12:55:11,163 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-16 12:55:11,163 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-16 12:55:11,163 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-16 12:55:11,166 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-16 12:55:11,166 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-16 12:55:11,166 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-16 12:55:11,167 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-16 12:55:11,167 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-16 12:55:11,167 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-16 12:55:11,167 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-16 12:55:11,168 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-16 12:55:11,168 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-16 12:55:11,168 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-16 12:55:11,169 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-16 12:55:11,169 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 12:55:11,173 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-16 12:55:11,173 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-16 12:55:11,173 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-16 12:55:11,173 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-16 12:55:11,174 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-16 12:55:11,174 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-16 12:55:11,175 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-16 12:55:11,175 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-16 12:55:11,175 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-16 12:55:11,176 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 -> 1b12db86960fa9dc6b9cfa8223c629c146a6be8798d3651a94f684c115400abd [2024-11-16 12:55:11,440 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-16 12:55:11,468 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-16 12:55:11,472 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-16 12:55:11,474 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-16 12:55:11,474 INFO L274 PluginConnector]: CDTParser initialized [2024-11-16 12:55:11,475 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-100_file-95.i [2024-11-16 12:55:12,960 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-16 12:55:13,181 INFO L384 CDTParser]: Found 1 translation units. [2024-11-16 12:55:13,182 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-100_file-95.i [2024-11-16 12:55:13,197 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/789ee4f19/2984efa21d094c5197ffdbb29e3e14ac/FLAG0ad54525a [2024-11-16 12:55:13,527 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/789ee4f19/2984efa21d094c5197ffdbb29e3e14ac [2024-11-16 12:55:13,529 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-16 12:55:13,530 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-16 12:55:13,532 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-16 12:55:13,532 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-16 12:55:13,536 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-16 12:55:13,537 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 12:55:13" (1/1) ... [2024-11-16 12:55:13,538 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4d9e770e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:55:13, skipping insertion in model container [2024-11-16 12:55:13,538 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 12:55:13" (1/1) ... [2024-11-16 12:55:13,573 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-16 12:55:13,738 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_fillercodesize_ps-cn-100_file-95.i[916,929] [2024-11-16 12:55:13,871 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 12:55:13,887 INFO L200 MainTranslator]: Completed pre-run [2024-11-16 12:55:13,900 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_fillercodesize_ps-cn-100_file-95.i[916,929] [2024-11-16 12:55:13,963 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 12:55:13,989 INFO L204 MainTranslator]: Completed translation [2024-11-16 12:55:13,990 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:55:13 WrapperNode [2024-11-16 12:55:13,990 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-16 12:55:13,991 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-16 12:55:13,992 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-16 12:55:13,992 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-16 12:55:14,018 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:55:13" (1/1) ... [2024-11-16 12:55:14,033 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:55:13" (1/1) ... [2024-11-16 12:55:14,090 INFO L138 Inliner]: procedures = 26, calls = 63, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 370 [2024-11-16 12:55:14,091 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-16 12:55:14,091 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-16 12:55:14,092 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-16 12:55:14,092 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-16 12:55:14,103 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:55:13" (1/1) ... [2024-11-16 12:55:14,104 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:55:13" (1/1) ... [2024-11-16 12:55:14,108 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:55:13" (1/1) ... [2024-11-16 12:55:14,141 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 12:55:14,142 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:55:13" (1/1) ... [2024-11-16 12:55:14,142 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:55:13" (1/1) ... [2024-11-16 12:55:14,171 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:55:13" (1/1) ... [2024-11-16 12:55:14,172 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:55:13" (1/1) ... [2024-11-16 12:55:14,178 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:55:13" (1/1) ... [2024-11-16 12:55:14,184 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:55:13" (1/1) ... [2024-11-16 12:55:14,194 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-16 12:55:14,197 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-16 12:55:14,197 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-16 12:55:14,197 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-16 12:55:14,198 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:55:13" (1/1) ... [2024-11-16 12:55:14,204 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 12:55:14,216 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 12:55:14,237 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 12:55:14,242 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 12:55:14,295 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-16 12:55:14,295 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-16 12:55:14,296 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-16 12:55:14,296 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-16 12:55:14,296 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-16 12:55:14,296 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-16 12:55:14,426 INFO L256 CfgBuilder]: Building ICFG [2024-11-16 12:55:14,429 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-16 12:55:15,140 INFO L1250 $ProcedureCfgBuilder]: dead code at ProgramPoint L271: havoc property_#t~bitwise39#1;havoc property_#t~short40#1; [2024-11-16 12:55:15,223 INFO L? ?]: Removed 20 outVars from TransFormulas that were not future-live. [2024-11-16 12:55:15,224 INFO L307 CfgBuilder]: Performing block encoding [2024-11-16 12:55:15,265 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-16 12:55:15,265 INFO L336 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-16 12:55:15,265 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 12:55:15 BoogieIcfgContainer [2024-11-16 12:55:15,267 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-16 12:55:15,269 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-16 12:55:15,270 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-16 12:55:15,274 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-16 12:55:15,274 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.11 12:55:13" (1/3) ... [2024-11-16 12:55:15,275 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@b1f03a7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 12:55:15, skipping insertion in model container [2024-11-16 12:55:15,275 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:55:13" (2/3) ... [2024-11-16 12:55:15,275 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@b1f03a7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 12:55:15, skipping insertion in model container [2024-11-16 12:55:15,275 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 12:55:15" (3/3) ... [2024-11-16 12:55:15,277 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_ps-cn-100_file-95.i [2024-11-16 12:55:15,298 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-16 12:55:15,299 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-16 12:55:15,382 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-16 12:55:15,394 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;@4a6b4429, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-16 12:55:15,395 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-16 12:55:15,403 INFO L276 IsEmpty]: Start isEmpty. Operand has 162 states, 109 states have (on average 1.5045871559633028) internal successors, (164), 110 states have internal predecessors, (164), 50 states have call successors, (50), 1 states have call predecessors, (50), 1 states have return successors, (50), 50 states have call predecessors, (50), 50 states have call successors, (50) [2024-11-16 12:55:15,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 314 [2024-11-16 12:55:15,437 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 12:55:15,439 INFO L215 NwaCegarLoop]: trace histogram [50, 50, 50, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:55:15,440 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 12:55:15,446 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 12:55:15,448 INFO L85 PathProgramCache]: Analyzing trace with hash 173166375, now seen corresponding path program 1 times [2024-11-16 12:55:15,462 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 12:55:15,462 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [27989109] [2024-11-16 12:55:15,463 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 12:55:15,463 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 12:55:15,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:55:15,900 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 12:55:15,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:55:15,913 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-16 12:55:15,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:55:15,923 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-16 12:55:15,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:55:15,930 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-16 12:55:15,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:55:15,942 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-16 12:55:15,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:55:15,947 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-16 12:55:15,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:55:15,952 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-16 12:55:15,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:55:15,957 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-16 12:55:15,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:55:15,963 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-16 12:55:15,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:55:15,967 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-16 12:55:15,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:55:15,976 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-16 12:55:15,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:55:15,985 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-16 12:55:15,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:55:15,991 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-16 12:55:15,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:55:16,001 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-16 12:55:16,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:55:16,006 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-16 12:55:16,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:55:16,012 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-16 12:55:16,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:55:16,019 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-16 12:55:16,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:55:16,029 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-16 12:55:16,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:55:16,040 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-16 12:55:16,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:55:16,048 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-11-16 12:55:16,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:55:16,057 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-16 12:55:16,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:55:16,062 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-11-16 12:55:16,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:55:16,070 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-16 12:55:16,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:55:16,082 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-11-16 12:55:16,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:55:16,087 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-11-16 12:55:16,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:55:16,092 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2024-11-16 12:55:16,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:55:16,096 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2024-11-16 12:55:16,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:55:16,102 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2024-11-16 12:55:16,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:55:16,111 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2024-11-16 12:55:16,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:55:16,120 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 167 [2024-11-16 12:55:16,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:55:16,131 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 172 [2024-11-16 12:55:16,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:55:16,138 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 178 [2024-11-16 12:55:16,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:55:16,145 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 184 [2024-11-16 12:55:16,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:55:16,156 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 189 [2024-11-16 12:55:16,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:55:16,162 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 195 [2024-11-16 12:55:16,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:55:16,174 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 200 [2024-11-16 12:55:16,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:55:16,181 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 206 [2024-11-16 12:55:16,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:55:16,187 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 211 [2024-11-16 12:55:16,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:55:16,194 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 217 [2024-11-16 12:55:16,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:55:16,200 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 222 [2024-11-16 12:55:16,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:55:16,207 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 228 [2024-11-16 12:55:16,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:55:16,212 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 233 [2024-11-16 12:55:16,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:55:16,219 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 239 [2024-11-16 12:55:16,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:55:16,230 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 244 [2024-11-16 12:55:16,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:55:16,236 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 250 [2024-11-16 12:55:16,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:55:16,242 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 255 [2024-11-16 12:55:16,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:55:16,268 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 261 [2024-11-16 12:55:16,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:55:16,273 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 266 [2024-11-16 12:55:16,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:55:16,281 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 272 [2024-11-16 12:55:16,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:55:16,287 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 277 [2024-11-16 12:55:16,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:55:16,297 INFO L134 CoverageAnalysis]: Checked inductivity of 4900 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4900 trivial. 0 not checked. [2024-11-16 12:55:16,298 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 12:55:16,298 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [27989109] [2024-11-16 12:55:16,299 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [27989109] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 12:55:16,299 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 12:55:16,300 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-16 12:55:16,302 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [170593119] [2024-11-16 12:55:16,303 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 12:55:16,309 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-16 12:55:16,311 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 12:55:16,339 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-16 12:55:16,340 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-16 12:55:16,344 INFO L87 Difference]: Start difference. First operand has 162 states, 109 states have (on average 1.5045871559633028) internal successors, (164), 110 states have internal predecessors, (164), 50 states have call successors, (50), 1 states have call predecessors, (50), 1 states have return successors, (50), 50 states have call predecessors, (50), 50 states have call successors, (50) Second operand has 2 states, 2 states have (on average 33.0) internal successors, (66), 2 states have internal predecessors, (66), 2 states have call successors, (50), 1 states have call predecessors, (50), 1 states have return successors, (50), 1 states have call predecessors, (50), 2 states have call successors, (50) [2024-11-16 12:55:16,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 12:55:16,413 INFO L93 Difference]: Finished difference Result 315 states and 569 transitions. [2024-11-16 12:55:16,414 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-16 12:55:16,416 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 33.0) internal successors, (66), 2 states have internal predecessors, (66), 2 states have call successors, (50), 1 states have call predecessors, (50), 1 states have return successors, (50), 1 states have call predecessors, (50), 2 states have call successors, (50) Word has length 313 [2024-11-16 12:55:16,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 12:55:16,430 INFO L225 Difference]: With dead ends: 315 [2024-11-16 12:55:16,430 INFO L226 Difference]: Without dead ends: 156 [2024-11-16 12:55:16,437 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 152 GetRequests, 152 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 12:55:16,444 INFO L432 NwaCegarLoop]: 245 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 245 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-16 12:55:16,445 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 245 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-16 12:55:16,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2024-11-16 12:55:16,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 156. [2024-11-16 12:55:16,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 156 states, 104 states have (on average 1.4711538461538463) internal successors, (153), 104 states have internal predecessors, (153), 50 states have call successors, (50), 1 states have call predecessors, (50), 1 states have return successors, (50), 50 states have call predecessors, (50), 50 states have call successors, (50) [2024-11-16 12:55:16,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 253 transitions. [2024-11-16 12:55:16,509 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 253 transitions. Word has length 313 [2024-11-16 12:55:16,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 12:55:16,510 INFO L471 AbstractCegarLoop]: Abstraction has 156 states and 253 transitions. [2024-11-16 12:55:16,510 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 33.0) internal successors, (66), 2 states have internal predecessors, (66), 2 states have call successors, (50), 1 states have call predecessors, (50), 1 states have return successors, (50), 1 states have call predecessors, (50), 2 states have call successors, (50) [2024-11-16 12:55:16,511 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 253 transitions. [2024-11-16 12:55:16,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 314 [2024-11-16 12:55:16,517 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 12:55:16,518 INFO L215 NwaCegarLoop]: trace histogram [50, 50, 50, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:55:16,518 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-16 12:55:16,519 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 12:55:16,519 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 12:55:16,519 INFO L85 PathProgramCache]: Analyzing trace with hash 1976366731, now seen corresponding path program 1 times [2024-11-16 12:55:16,520 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 12:55:16,520 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2040547057] [2024-11-16 12:55:16,520 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 12:55:16,520 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 12:55:16,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:55:16,758 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 12:55:16,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:55:16,763 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-16 12:55:16,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:55:16,767 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-16 12:55:16,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:55:16,770 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-16 12:55:16,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:55:16,775 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-16 12:55:16,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:55:16,781 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-16 12:55:16,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:55:16,787 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-16 12:55:16,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:55:16,790 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-16 12:55:16,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:55:16,794 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-16 12:55:16,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:55:16,798 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-16 12:55:16,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:55:16,801 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-16 12:55:16,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:55:16,805 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-16 12:55:16,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:55:16,809 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-16 12:55:16,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:55:16,812 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-16 12:55:16,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:55:16,816 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-16 12:55:16,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:55:16,820 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-16 12:55:16,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:55:16,824 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-16 12:55:16,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:55:16,828 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-16 12:55:16,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:55:16,831 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-16 12:55:16,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:55:16,835 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-11-16 12:55:16,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:55:16,839 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-16 12:55:16,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:55:16,843 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-11-16 12:55:16,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:55:16,849 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-16 12:55:16,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:55:16,855 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-11-16 12:55:16,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:55:16,859 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-11-16 12:55:16,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:55:16,864 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2024-11-16 12:55:16,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:55:16,869 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2024-11-16 12:55:16,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:55:16,874 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2024-11-16 12:55:16,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:55:16,878 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2024-11-16 12:55:16,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:55:16,887 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 167 [2024-11-16 12:55:16,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:55:16,891 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 172 [2024-11-16 12:55:16,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:55:16,895 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 178 [2024-11-16 12:55:16,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:55:16,902 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 184 [2024-11-16 12:55:16,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:55:16,906 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 189 [2024-11-16 12:55:16,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:55:16,911 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 195 [2024-11-16 12:55:16,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:55:16,916 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 200 [2024-11-16 12:55:16,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:55:16,924 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 206 [2024-11-16 12:55:16,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:55:16,931 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 211 [2024-11-16 12:55:16,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:55:16,939 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 217 [2024-11-16 12:55:16,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:55:16,944 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 222 [2024-11-16 12:55:16,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:55:16,949 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 228 [2024-11-16 12:55:16,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:55:16,953 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 233 [2024-11-16 12:55:16,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:55:16,958 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 239 [2024-11-16 12:55:16,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:55:16,964 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 244 [2024-11-16 12:55:16,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:55:16,970 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 250 [2024-11-16 12:55:16,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:55:16,977 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 255 [2024-11-16 12:55:16,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:55:16,983 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 261 [2024-11-16 12:55:16,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:55:16,988 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 266 [2024-11-16 12:55:16,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:55:16,992 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 272 [2024-11-16 12:55:16,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:55:16,996 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 277 [2024-11-16 12:55:16,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:55:17,006 INFO L134 CoverageAnalysis]: Checked inductivity of 4900 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4900 trivial. 0 not checked. [2024-11-16 12:55:17,008 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 12:55:17,009 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2040547057] [2024-11-16 12:55:17,010 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2040547057] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 12:55:17,010 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 12:55:17,010 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-16 12:55:17,010 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2118398489] [2024-11-16 12:55:17,010 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 12:55:17,012 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 12:55:17,014 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 12:55:17,015 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 12:55:17,016 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 12:55:17,017 INFO L87 Difference]: Start difference. First operand 156 states and 253 transitions. Second operand has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 1 states have call successors, (50), 1 states have call predecessors, (50), 1 states have return successors, (50), 1 states have call predecessors, (50), 1 states have call successors, (50) [2024-11-16 12:55:17,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 12:55:17,134 INFO L93 Difference]: Finished difference Result 407 states and 661 transitions. [2024-11-16 12:55:17,134 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 12:55:17,135 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 1 states have call successors, (50), 1 states have call predecessors, (50), 1 states have return successors, (50), 1 states have call predecessors, (50), 1 states have call successors, (50) Word has length 313 [2024-11-16 12:55:17,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 12:55:17,141 INFO L225 Difference]: With dead ends: 407 [2024-11-16 12:55:17,141 INFO L226 Difference]: Without dead ends: 254 [2024-11-16 12:55:17,146 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 102 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 12:55:17,149 INFO L432 NwaCegarLoop]: 243 mSDtfsCounter, 156 mSDsluCounter, 235 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 156 SdHoareTripleChecker+Valid, 478 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-16 12:55:17,151 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [156 Valid, 478 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-16 12:55:17,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 254 states. [2024-11-16 12:55:17,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 254 to 250. [2024-11-16 12:55:17,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 250 states, 182 states have (on average 1.521978021978022) internal successors, (277), 183 states have internal predecessors, (277), 65 states have call successors, (65), 2 states have call predecessors, (65), 2 states have return successors, (65), 64 states have call predecessors, (65), 65 states have call successors, (65) [2024-11-16 12:55:17,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 407 transitions. [2024-11-16 12:55:17,201 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 407 transitions. Word has length 313 [2024-11-16 12:55:17,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 12:55:17,202 INFO L471 AbstractCegarLoop]: Abstraction has 250 states and 407 transitions. [2024-11-16 12:55:17,203 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 1 states have call successors, (50), 1 states have call predecessors, (50), 1 states have return successors, (50), 1 states have call predecessors, (50), 1 states have call successors, (50) [2024-11-16 12:55:17,203 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 407 transitions. [2024-11-16 12:55:17,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 314 [2024-11-16 12:55:17,212 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 12:55:17,213 INFO L215 NwaCegarLoop]: trace histogram [50, 50, 50, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:55:17,213 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-16 12:55:17,214 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 12:55:17,214 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 12:55:17,214 INFO L85 PathProgramCache]: Analyzing trace with hash -1356986548, now seen corresponding path program 1 times [2024-11-16 12:55:17,214 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 12:55:17,215 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [403530112] [2024-11-16 12:55:17,215 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 12:55:17,215 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 12:55:17,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat