./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-ps-cn_file-59.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version a046e57d Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-cn_file-59.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 32753d18822513354e4b9efa6f4c19579a930a0a9d80feee2c0fa6780fee33a5 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-13 02:55:13,587 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-13 02:55:13,668 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-13 02:55:13,672 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-13 02:55:13,674 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-13 02:55:13,705 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-13 02:55:13,706 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-13 02:55:13,706 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-13 02:55:13,707 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-13 02:55:13,708 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-13 02:55:13,709 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-13 02:55:13,709 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-13 02:55:13,709 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-13 02:55:13,710 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-13 02:55:13,711 INFO L153 SettingsManager]: * Use SBE=true [2024-10-13 02:55:13,712 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-13 02:55:13,712 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-13 02:55:13,712 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-13 02:55:13,713 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-13 02:55:13,713 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-13 02:55:13,715 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-13 02:55:13,717 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-13 02:55:13,717 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-13 02:55:13,718 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-13 02:55:13,718 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-13 02:55:13,718 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-13 02:55:13,718 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-13 02:55:13,718 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-13 02:55:13,719 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-13 02:55:13,719 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-13 02:55:13,719 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-13 02:55:13,719 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-13 02:55:13,719 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 02:55:13,720 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-13 02:55:13,720 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-13 02:55:13,721 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-13 02:55:13,722 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-13 02:55:13,722 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-13 02:55:13,722 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-13 02:55:13,722 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-13 02:55:13,722 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-13 02:55:13,723 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-13 02:55:13,723 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 -> 32753d18822513354e4b9efa6f4c19579a930a0a9d80feee2c0fa6780fee33a5 [2024-10-13 02:55:14,004 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-13 02:55:14,029 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-13 02:55:14,032 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-13 02:55:14,033 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-13 02:55:14,034 INFO L274 PluginConnector]: CDTParser initialized [2024-10-13 02:55:14,035 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-cn_file-59.i [2024-10-13 02:55:15,487 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-13 02:55:15,706 INFO L384 CDTParser]: Found 1 translation units. [2024-10-13 02:55:15,707 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-cn_file-59.i [2024-10-13 02:55:15,716 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5f5dee16d/705fe189271c464097c8f0529bdc2c59/FLAGe2dc3b6f8 [2024-10-13 02:55:15,736 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5f5dee16d/705fe189271c464097c8f0529bdc2c59 [2024-10-13 02:55:15,739 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-13 02:55:15,740 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-13 02:55:15,744 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-13 02:55:15,745 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-13 02:55:15,750 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-13 02:55:15,751 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 02:55:15" (1/1) ... [2024-10-13 02:55:15,752 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@e19e07d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:55:15, skipping insertion in model container [2024-10-13 02:55:15,752 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 02:55:15" (1/1) ... [2024-10-13 02:55:15,789 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-13 02:55:15,967 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-ps-cn_file-59.i[919,932] [2024-10-13 02:55:16,056 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 02:55:16,070 INFO L200 MainTranslator]: Completed pre-run [2024-10-13 02:55:16,081 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-ps-cn_file-59.i[919,932] [2024-10-13 02:55:16,126 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 02:55:16,148 INFO L204 MainTranslator]: Completed translation [2024-10-13 02:55:16,149 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:55:16 WrapperNode [2024-10-13 02:55:16,149 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-13 02:55:16,151 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-13 02:55:16,151 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-13 02:55:16,151 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-13 02:55:16,157 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:55:16" (1/1) ... [2024-10-13 02:55:16,173 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:55:16" (1/1) ... [2024-10-13 02:55:16,219 INFO L138 Inliner]: procedures = 26, calls = 47, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 242 [2024-10-13 02:55:16,220 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-13 02:55:16,221 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-13 02:55:16,221 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-13 02:55:16,221 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-13 02:55:16,232 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:55:16" (1/1) ... [2024-10-13 02:55:16,233 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:55:16" (1/1) ... [2024-10-13 02:55:16,237 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:55:16" (1/1) ... [2024-10-13 02:55:16,262 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-13 02:55:16,262 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:55:16" (1/1) ... [2024-10-13 02:55:16,262 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:55:16" (1/1) ... [2024-10-13 02:55:16,278 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:55:16" (1/1) ... [2024-10-13 02:55:16,290 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:55:16" (1/1) ... [2024-10-13 02:55:16,298 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:55:16" (1/1) ... [2024-10-13 02:55:16,306 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:55:16" (1/1) ... [2024-10-13 02:55:16,318 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-13 02:55:16,320 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-13 02:55:16,320 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-13 02:55:16,320 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-13 02:55:16,323 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:55:16" (1/1) ... [2024-10-13 02:55:16,329 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 02:55:16,347 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 02:55:16,365 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-13 02:55:16,372 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-13 02:55:16,422 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-13 02:55:16,422 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-13 02:55:16,423 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-13 02:55:16,423 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-13 02:55:16,423 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-13 02:55:16,423 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-13 02:55:16,522 INFO L238 CfgBuilder]: Building ICFG [2024-10-13 02:55:16,524 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-13 02:55:16,988 INFO L? ?]: Removed 20 outVars from TransFormulas that were not future-live. [2024-10-13 02:55:16,988 INFO L287 CfgBuilder]: Performing block encoding [2024-10-13 02:55:17,064 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-13 02:55:17,065 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-13 02:55:17,065 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 02:55:17 BoogieIcfgContainer [2024-10-13 02:55:17,066 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-13 02:55:17,081 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-13 02:55:17,082 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-13 02:55:17,085 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-13 02:55:17,086 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 02:55:15" (1/3) ... [2024-10-13 02:55:17,086 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1b6ef3bd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 02:55:17, skipping insertion in model container [2024-10-13 02:55:17,086 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:55:16" (2/3) ... [2024-10-13 02:55:17,087 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1b6ef3bd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 02:55:17, skipping insertion in model container [2024-10-13 02:55:17,087 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 02:55:17" (3/3) ... [2024-10-13 02:55:17,088 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-ps-cn_file-59.i [2024-10-13 02:55:17,106 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-13 02:55:17,107 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-13 02:55:17,183 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-13 02:55:17,190 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;@43b48568, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-13 02:55:17,191 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-13 02:55:17,196 INFO L276 IsEmpty]: Start isEmpty. Operand has 98 states, 61 states have (on average 1.5081967213114753) internal successors, (92), 62 states have internal predecessors, (92), 34 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) [2024-10-13 02:55:17,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 212 [2024-10-13 02:55:17,221 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 02:55:17,222 INFO L215 NwaCegarLoop]: trace histogram [34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 02:55:17,223 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 02:55:17,229 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 02:55:17,229 INFO L85 PathProgramCache]: Analyzing trace with hash 1555441975, now seen corresponding path program 1 times [2024-10-13 02:55:17,238 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 02:55:17,238 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [624675648] [2024-10-13 02:55:17,239 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 02:55:17,239 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 02:55:17,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:55:17,590 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 02:55:17,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:55:17,603 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 02:55:17,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:55:17,612 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-13 02:55:17,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:55:17,623 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 02:55:17,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:55:17,634 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-13 02:55:17,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:55:17,639 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 02:55:17,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:55:17,646 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-13 02:55:17,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:55:17,655 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-13 02:55:17,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:55:17,665 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-13 02:55:17,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:55:17,673 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-13 02:55:17,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:55:17,681 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-13 02:55:17,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:55:17,690 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-13 02:55:17,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:55:17,705 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-13 02:55:17,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:55:17,713 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-13 02:55:17,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:55:17,723 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-13 02:55:17,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:55:17,729 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-13 02:55:17,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:55:17,734 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-13 02:55:17,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:55:17,739 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-10-13 02:55:17,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:55:17,748 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-10-13 02:55:17,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:55:17,756 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-13 02:55:17,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:55:17,764 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-13 02:55:17,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:55:17,771 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-13 02:55:17,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:55:17,776 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-10-13 02:55:17,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:55:17,783 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-10-13 02:55:17,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:55:17,787 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2024-10-13 02:55:17,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:55:17,791 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-10-13 02:55:17,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:55:17,794 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2024-10-13 02:55:17,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:55:17,800 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2024-10-13 02:55:17,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:55:17,809 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-10-13 02:55:17,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:55:17,817 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2024-10-13 02:55:17,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:55:17,825 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 169 [2024-10-13 02:55:17,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:55:17,831 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 174 [2024-10-13 02:55:17,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:55:17,839 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 180 [2024-10-13 02:55:17,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:55:17,846 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 185 [2024-10-13 02:55:17,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:55:17,855 INFO L134 CoverageAnalysis]: Checked inductivity of 2244 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2244 trivial. 0 not checked. [2024-10-13 02:55:17,855 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 02:55:17,856 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [624675648] [2024-10-13 02:55:17,856 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [624675648] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 02:55:17,857 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 02:55:17,857 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 02:55:17,859 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [377902062] [2024-10-13 02:55:17,859 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 02:55:17,865 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-13 02:55:17,866 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 02:55:17,892 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-13 02:55:17,893 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-13 02:55:17,896 INFO L87 Difference]: Start difference. First operand has 98 states, 61 states have (on average 1.5081967213114753) internal successors, (92), 62 states have internal predecessors, (92), 34 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) Second operand has 2 states, 2 states have (on average 22.0) internal successors, (44), 2 states have internal predecessors, (44), 2 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 2 states have call successors, (34) [2024-10-13 02:55:17,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 02:55:17,953 INFO L93 Difference]: Finished difference Result 193 states and 352 transitions. [2024-10-13 02:55:17,956 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-13 02:55:17,958 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 22.0) internal successors, (44), 2 states have internal predecessors, (44), 2 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 2 states have call successors, (34) Word has length 211 [2024-10-13 02:55:17,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 02:55:17,967 INFO L225 Difference]: With dead ends: 193 [2024-10-13 02:55:17,969 INFO L226 Difference]: Without dead ends: 96 [2024-10-13 02:55:17,976 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 104 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-13 02:55:17,981 INFO L432 NwaCegarLoop]: 151 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, 151 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-13 02:55:17,983 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 151 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 02:55:17,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2024-10-13 02:55:18,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 96. [2024-10-13 02:55:18,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 60 states have (on average 1.4333333333333333) internal successors, (86), 60 states have internal predecessors, (86), 34 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) [2024-10-13 02:55:18,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 154 transitions. [2024-10-13 02:55:18,047 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 154 transitions. Word has length 211 [2024-10-13 02:55:18,047 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 02:55:18,047 INFO L471 AbstractCegarLoop]: Abstraction has 96 states and 154 transitions. [2024-10-13 02:55:18,048 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 22.0) internal successors, (44), 2 states have internal predecessors, (44), 2 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 2 states have call successors, (34) [2024-10-13 02:55:18,048 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 154 transitions. [2024-10-13 02:55:18,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 212 [2024-10-13 02:55:18,054 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 02:55:18,054 INFO L215 NwaCegarLoop]: trace histogram [34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 02:55:18,054 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-13 02:55:18,055 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 02:55:18,055 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 02:55:18,055 INFO L85 PathProgramCache]: Analyzing trace with hash 1949372287, now seen corresponding path program 1 times [2024-10-13 02:55:18,056 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 02:55:18,056 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [812714900] [2024-10-13 02:55:18,056 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 02:55:18,056 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 02:55:18,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:55:18,435 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 02:55:18,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:55:18,469 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 02:55:18,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:55:18,482 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-13 02:55:18,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:55:18,499 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 02:55:18,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:55:18,520 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-13 02:55:18,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:55:18,534 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 02:55:18,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:55:18,543 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-13 02:55:18,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:55:18,548 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-13 02:55:18,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:55:18,556 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-13 02:55:18,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:55:18,566 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-13 02:55:18,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:55:18,576 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-13 02:55:18,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:55:18,585 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-13 02:55:18,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:55:18,594 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-13 02:55:18,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:55:18,607 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-13 02:55:18,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:55:18,619 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-13 02:55:18,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:55:18,630 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-13 02:55:18,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:55:18,639 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-13 02:55:18,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:55:18,643 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-10-13 02:55:18,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:55:18,654 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-10-13 02:55:18,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:55:18,659 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-13 02:55:18,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:55:18,672 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-13 02:55:18,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:55:18,682 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-13 02:55:18,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:55:18,695 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-10-13 02:55:18,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:55:18,700 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-10-13 02:55:18,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:55:18,705 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2024-10-13 02:55:18,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:55:18,710 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-10-13 02:55:18,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:55:18,715 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2024-10-13 02:55:18,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:55:18,724 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2024-10-13 02:55:18,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:55:18,732 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-10-13 02:55:18,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:55:18,741 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2024-10-13 02:55:18,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:55:18,750 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 169 [2024-10-13 02:55:18,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:55:18,762 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 174 [2024-10-13 02:55:18,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:55:18,767 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 180 [2024-10-13 02:55:18,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:55:18,770 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 185 [2024-10-13 02:55:18,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:55:18,776 INFO L134 CoverageAnalysis]: Checked inductivity of 2244 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2244 trivial. 0 not checked. [2024-10-13 02:55:18,776 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 02:55:18,777 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [812714900] [2024-10-13 02:55:18,777 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [812714900] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 02:55:18,777 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 02:55:18,777 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-13 02:55:18,777 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [180542427] [2024-10-13 02:55:18,777 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 02:55:18,779 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 02:55:18,779 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 02:55:18,780 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 02:55:18,780 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-13 02:55:18,781 INFO L87 Difference]: Start difference. First operand 96 states and 154 transitions. Second operand has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) [2024-10-13 02:55:18,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 02:55:18,968 INFO L93 Difference]: Finished difference Result 286 states and 460 transitions. [2024-10-13 02:55:18,968 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 02:55:18,969 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) Word has length 211 [2024-10-13 02:55:18,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 02:55:18,975 INFO L225 Difference]: With dead ends: 286 [2024-10-13 02:55:18,976 INFO L226 Difference]: Without dead ends: 191 [2024-10-13 02:55:18,977 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-13 02:55:18,979 INFO L432 NwaCegarLoop]: 179 mSDtfsCounter, 149 mSDsluCounter, 131 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 149 SdHoareTripleChecker+Valid, 310 SdHoareTripleChecker+Invalid, 68 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 02:55:18,979 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [149 Valid, 310 Invalid, 68 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 02:55:18,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2024-10-13 02:55:19,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 189. [2024-10-13 02:55:19,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 189 states, 118 states have (on average 1.423728813559322) internal successors, (168), 118 states have internal predecessors, (168), 68 states have call successors, (68), 2 states have call predecessors, (68), 2 states have return successors, (68), 68 states have call predecessors, (68), 68 states have call successors, (68) [2024-10-13 02:55:19,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 304 transitions. [2024-10-13 02:55:19,025 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 304 transitions. Word has length 211 [2024-10-13 02:55:19,025 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 02:55:19,026 INFO L471 AbstractCegarLoop]: Abstraction has 189 states and 304 transitions. [2024-10-13 02:55:19,026 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) [2024-10-13 02:55:19,026 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 304 transitions. [2024-10-13 02:55:19,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 212 [2024-10-13 02:55:19,030 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 02:55:19,030 INFO L215 NwaCegarLoop]: trace histogram [34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 02:55:19,030 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-13 02:55:19,031 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 02:55:19,031 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 02:55:19,031 INFO L85 PathProgramCache]: Analyzing trace with hash -656651267, now seen corresponding path program 1 times [2024-10-13 02:55:19,031 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 02:55:19,032 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1082424449] [2024-10-13 02:55:19,032 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 02:55:19,032 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 02:55:19,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:55:19,332 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 02:55:19,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:55:19,335 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 02:55:19,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:55:19,338 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-13 02:55:19,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:55:19,341 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 02:55:19,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:55:19,345 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-13 02:55:19,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:55:19,348 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 02:55:19,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:55:19,352 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-13 02:55:19,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:55:19,356 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-13 02:55:19,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:55:19,360 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-13 02:55:19,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:55:19,364 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-13 02:55:19,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:55:19,368 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-13 02:55:19,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:55:19,371 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-13 02:55:19,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:55:19,374 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-13 02:55:19,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:55:19,377 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-13 02:55:19,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:55:19,380 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-13 02:55:19,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:55:19,384 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-13 02:55:19,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:55:19,387 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-13 02:55:19,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:55:19,390 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-10-13 02:55:19,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:55:19,393 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-10-13 02:55:19,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:55:19,395 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-13 02:55:19,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:55:19,398 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-13 02:55:19,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:55:19,401 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-13 02:55:19,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:55:19,404 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-10-13 02:55:19,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:55:19,407 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-10-13 02:55:19,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:55:19,410 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2024-10-13 02:55:19,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:55:19,414 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-10-13 02:55:19,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:55:19,417 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2024-10-13 02:55:19,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:55:19,421 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2024-10-13 02:55:19,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:55:19,425 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-10-13 02:55:19,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:55:19,429 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2024-10-13 02:55:19,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:55:19,432 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 169 [2024-10-13 02:55:19,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:55:19,435 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 174 [2024-10-13 02:55:19,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:55:19,439 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 180 [2024-10-13 02:55:19,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:55:19,442 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 185 [2024-10-13 02:55:19,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:55:19,446 INFO L134 CoverageAnalysis]: Checked inductivity of 2244 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2244 trivial. 0 not checked. [2024-10-13 02:55:19,447 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 02:55:19,447 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1082424449] [2024-10-13 02:55:19,447 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1082424449] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 02:55:19,447 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 02:55:19,447 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-13 02:55:19,447 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [499816081] [2024-10-13 02:55:19,448 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 02:55:19,450 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 02:55:19,450 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 02:55:19,451 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 02:55:19,451 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 02:55:19,452 INFO L87 Difference]: Start difference. First operand 189 states and 304 transitions. Second operand has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) [2024-10-13 02:55:19,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 02:55:19,662 INFO L93 Difference]: Finished difference Result 507 states and 817 transitions. [2024-10-13 02:55:19,663 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 02:55:19,663 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) Word has length 211 [2024-10-13 02:55:19,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 02:55:19,667 INFO L225 Difference]: With dead ends: 507 [2024-10-13 02:55:19,668 INFO L226 Difference]: Without dead ends: 319 [2024-10-13 02:55:19,669 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 71 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-13 02:55:19,670 INFO L432 NwaCegarLoop]: 150 mSDtfsCounter, 117 mSDsluCounter, 299 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 103 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 117 SdHoareTripleChecker+Valid, 449 SdHoareTripleChecker+Invalid, 114 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 103 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-13 02:55:19,674 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [117 Valid, 449 Invalid, 114 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [103 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-13 02:55:19,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 319 states. [2024-10-13 02:55:19,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 319 to 285. [2024-10-13 02:55:19,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 285 states, 179 states have (on average 1.4245810055865922) internal successors, (255), 179 states have internal predecessors, (255), 102 states have call successors, (102), 3 states have call predecessors, (102), 3 states have return successors, (102), 102 states have call predecessors, (102), 102 states have call successors, (102) [2024-10-13 02:55:19,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 285 states to 285 states and 459 transitions. [2024-10-13 02:55:19,728 INFO L78 Accepts]: Start accepts. Automaton has 285 states and 459 transitions. Word has length 211 [2024-10-13 02:55:19,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 02:55:19,729 INFO L471 AbstractCegarLoop]: Abstraction has 285 states and 459 transitions. [2024-10-13 02:55:19,729 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) [2024-10-13 02:55:19,729 INFO L276 IsEmpty]: Start isEmpty. Operand 285 states and 459 transitions. [2024-10-13 02:55:19,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2024-10-13 02:55:19,736 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 02:55:19,736 INFO L215 NwaCegarLoop]: trace histogram [34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 02:55:19,736 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-13 02:55:19,736 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 02:55:19,737 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 02:55:19,737 INFO L85 PathProgramCache]: Analyzing trace with hash 890353917, now seen corresponding path program 1 times [2024-10-13 02:55:19,737 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 02:55:19,737 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [534223755] [2024-10-13 02:55:19,737 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 02:55:19,738 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 02:55:19,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:55:20,293 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 02:55:20,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:55:20,297 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 02:55:20,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:55:20,305 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-13 02:55:20,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:55:20,312 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 02:55:20,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:55:20,316 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-13 02:55:20,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:55:20,319 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 02:55:20,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:55:20,322 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-13 02:55:20,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:55:20,326 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-13 02:55:20,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:55:20,329 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-13 02:55:20,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:55:20,332 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-13 02:55:20,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:55:20,334 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-13 02:55:20,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:55:20,337 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-13 02:55:20,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:55:20,339 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-13 02:55:20,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:55:20,342 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-13 02:55:20,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:55:20,345 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-13 02:55:20,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:55:20,348 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-13 02:55:20,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:55:20,351 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-13 02:55:20,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:55:20,354 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-10-13 02:55:20,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:55:20,359 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-10-13 02:55:20,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:55:20,363 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-13 02:55:20,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:55:20,366 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-13 02:55:20,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:55:20,369 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-13 02:55:20,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:55:20,375 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-10-13 02:55:20,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:55:20,382 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-10-13 02:55:20,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:55:20,386 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2024-10-13 02:55:20,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:55:20,390 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-10-13 02:55:20,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:55:20,394 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2024-10-13 02:55:20,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:55:20,398 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2024-10-13 02:55:20,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:55:20,402 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-10-13 02:55:20,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:55:20,407 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2024-10-13 02:55:20,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:55:20,410 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 169 [2024-10-13 02:55:20,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:55:20,417 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 174 [2024-10-13 02:55:20,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:55:20,423 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 180 [2024-10-13 02:55:20,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:55:20,427 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 185 [2024-10-13 02:55:20,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:55:20,432 INFO L134 CoverageAnalysis]: Checked inductivity of 2244 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2244 trivial. 0 not checked. [2024-10-13 02:55:20,432 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 02:55:20,432 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [534223755] [2024-10-13 02:55:20,432 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [534223755] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 02:55:20,433 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 02:55:20,433 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-13 02:55:20,433 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1956680522] [2024-10-13 02:55:20,433 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 02:55:20,434 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-13 02:55:20,434 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 02:55:20,435 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-13 02:55:20,435 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-13 02:55:20,435 INFO L87 Difference]: Start difference. First operand 285 states and 459 transitions. Second operand has 6 states, 6 states have (on average 7.5) internal successors, (45), 6 states have internal predecessors, (45), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) [2024-10-13 02:55:20,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 02:55:20,879 INFO L93 Difference]: Finished difference Result 677 states and 1086 transitions. [2024-10-13 02:55:20,880 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-13 02:55:20,880 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.5) internal successors, (45), 6 states have internal predecessors, (45), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) Word has length 212 [2024-10-13 02:55:20,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 02:55:20,888 INFO L225 Difference]: With dead ends: 677 [2024-10-13 02:55:20,888 INFO L226 Difference]: Without dead ends: 489 [2024-10-13 02:55:20,891 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 72 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2024-10-13 02:55:20,892 INFO L432 NwaCegarLoop]: 150 mSDtfsCounter, 163 mSDsluCounter, 515 mSDsCounter, 0 mSdLazyCounter, 122 mSolverCounterSat, 139 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 163 SdHoareTripleChecker+Valid, 665 SdHoareTripleChecker+Invalid, 261 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 139 IncrementalHoareTripleChecker+Valid, 122 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-13 02:55:20,892 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [163 Valid, 665 Invalid, 261 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [139 Valid, 122 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-13 02:55:20,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 489 states. [2024-10-13 02:55:20,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 489 to 471. [2024-10-13 02:55:20,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 471 states, 295 states have (on average 1.4135593220338982) internal successors, (417), 295 states have internal predecessors, (417), 170 states have call successors, (170), 5 states have call predecessors, (170), 5 states have return successors, (170), 170 states have call predecessors, (170), 170 states have call successors, (170) [2024-10-13 02:55:20,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 471 states to 471 states and 757 transitions. [2024-10-13 02:55:20,976 INFO L78 Accepts]: Start accepts. Automaton has 471 states and 757 transitions. Word has length 212 [2024-10-13 02:55:20,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 02:55:20,980 INFO L471 AbstractCegarLoop]: Abstraction has 471 states and 757 transitions. [2024-10-13 02:55:20,980 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.5) internal successors, (45), 6 states have internal predecessors, (45), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) [2024-10-13 02:55:20,980 INFO L276 IsEmpty]: Start isEmpty. Operand 471 states and 757 transitions. [2024-10-13 02:55:20,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 214 [2024-10-13 02:55:20,982 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 02:55:20,982 INFO L215 NwaCegarLoop]: trace histogram [34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 02:55:20,983 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-13 02:55:20,983 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 02:55:20,983 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 02:55:20,983 INFO L85 PathProgramCache]: Analyzing trace with hash -816328344, now seen corresponding path program 1 times [2024-10-13 02:55:20,984 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 02:55:20,984 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1437936670] [2024-10-13 02:55:20,984 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 02:55:20,984 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 02:55:21,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-13 02:55:21,202 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [563400156] [2024-10-13 02:55:21,202 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 02:55:21,202 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 02:55:21,202 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 02:55:21,205 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-13 02:55:21,206 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-13 02:55:21,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:55:21,584 INFO L255 TraceCheckSpWp]: Trace formula consists of 498 conjuncts, 37 conjuncts are in the unsatisfiable core [2024-10-13 02:55:21,600 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 02:55:24,827 INFO L134 CoverageAnalysis]: Checked inductivity of 2244 backedges. 429 proven. 405 refuted. 0 times theorem prover too weak. 1410 trivial. 0 not checked. [2024-10-13 02:55:24,828 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 02:55:37,542 WARN L286 SmtUtils]: Spent 8.96s on a formula simplification that was a NOOP. DAG size: 45 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-10-13 02:55:43,516 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse7 (mod c_~var_1_4~0 256))) (let ((.cse3 (mod c_~var_1_19~0 4294967296)) (.cse2 (div (mod c_~var_1_6~0 65536) .cse7))) (let ((.cse5 (< 65535 (mod (* c_~var_1_19~0 .cse2) 4294967296))) (.cse0 (mod (+ .cse7 c_~var_1_7~0) 65536)) (.cse6 (mod |c_ULTIMATE.start_step_~stepLocal_2~0#1| 65536)) (.cse1 (+ .cse3 1)) (.cse4 (+ (mod c_~var_1_7~0 65536) .cse7 1))) (and (or (< .cse0 .cse1) (< 65535 (mod (* .cse2 .cse0) 4294967296))) (or (< .cse3 .cse4) .cse5 (< .cse6 .cse4)) (or .cse5 (< .cse3 .cse0)) (forall ((v_z_7 Int)) (or (< 65535 (mod (* v_z_7 .cse2) 4294967296)) (< .cse6 v_z_7) (< v_z_7 .cse1) (< v_z_7 .cse4))))))) is different from false