./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-1loop_file-66.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8be7027f Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-1loop_file-66.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 2fb5494f31021cb0f379142b5b5cf1efd42a1c877a9dec66b9c682ab4f055ad0 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dk.perfect-tracechecks-8be7027-m [2024-11-12 05:44:44,297 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-12 05:44:44,369 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-12 05:44:44,375 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-12 05:44:44,377 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-12 05:44:44,412 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-12 05:44:44,413 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-12 05:44:44,413 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-12 05:44:44,414 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-12 05:44:44,415 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-12 05:44:44,415 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-12 05:44:44,416 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-12 05:44:44,416 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-12 05:44:44,418 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-12 05:44:44,419 INFO L153 SettingsManager]: * Use SBE=true [2024-11-12 05:44:44,419 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-12 05:44:44,419 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-12 05:44:44,420 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-12 05:44:44,420 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-12 05:44:44,420 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-12 05:44:44,420 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-12 05:44:44,425 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-12 05:44:44,425 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-12 05:44:44,425 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-12 05:44:44,425 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-12 05:44:44,426 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-12 05:44:44,426 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-12 05:44:44,426 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-12 05:44:44,426 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-12 05:44:44,427 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-12 05:44:44,427 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-12 05:44:44,427 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-12 05:44:44,428 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 05:44:44,428 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-12 05:44:44,429 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-12 05:44:44,429 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-12 05:44:44,429 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-12 05:44:44,430 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-12 05:44:44,430 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-12 05:44:44,430 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-12 05:44:44,441 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-12 05:44:44,442 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-12 05:44:44,442 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 -> 2fb5494f31021cb0f379142b5b5cf1efd42a1c877a9dec66b9c682ab4f055ad0 [2024-11-12 05:44:44,732 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-12 05:44:44,759 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-12 05:44:44,763 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-12 05:44:44,764 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-12 05:44:44,765 INFO L274 PluginConnector]: CDTParser initialized [2024-11-12 05:44:44,767 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-1loop_file-66.i [2024-11-12 05:44:46,250 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-12 05:44:46,564 INFO L384 CDTParser]: Found 1 translation units. [2024-11-12 05:44:46,565 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-1loop_file-66.i [2024-11-12 05:44:46,587 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/17f854694/8d9c9b48c0584c57bd41d038022bdf4a/FLAGccfe0bd71 [2024-11-12 05:44:46,828 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/17f854694/8d9c9b48c0584c57bd41d038022bdf4a [2024-11-12 05:44:46,830 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-12 05:44:46,831 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-12 05:44:46,832 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-12 05:44:46,832 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-12 05:44:46,838 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-12 05:44:46,840 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 05:44:46" (1/1) ... [2024-11-12 05:44:46,841 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3e1b6796 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:44:46, skipping insertion in model container [2024-11-12 05:44:46,841 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 05:44:46" (1/1) ... [2024-11-12 05:44:46,874 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-12 05:44:47,054 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_loopvsstraightlinecode_50-1loop_file-66.i[915,928] [2024-11-12 05:44:47,117 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 05:44:47,137 INFO L200 MainTranslator]: Completed pre-run [2024-11-12 05:44:47,152 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_loopvsstraightlinecode_50-1loop_file-66.i[915,928] [2024-11-12 05:44:47,174 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 05:44:47,190 INFO L204 MainTranslator]: Completed translation [2024-11-12 05:44:47,191 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:44:47 WrapperNode [2024-11-12 05:44:47,191 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-12 05:44:47,192 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-12 05:44:47,192 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-12 05:44:47,192 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-12 05:44:47,199 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:44:47" (1/1) ... [2024-11-12 05:44:47,208 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:44:47" (1/1) ... [2024-11-12 05:44:47,249 INFO L138 Inliner]: procedures = 26, calls = 31, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 137 [2024-11-12 05:44:47,249 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-12 05:44:47,250 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-12 05:44:47,250 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-12 05:44:47,250 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-12 05:44:47,268 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:44:47" (1/1) ... [2024-11-12 05:44:47,268 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:44:47" (1/1) ... [2024-11-12 05:44:47,271 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:44:47" (1/1) ... [2024-11-12 05:44:47,288 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-12 05:44:47,289 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:44:47" (1/1) ... [2024-11-12 05:44:47,289 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:44:47" (1/1) ... [2024-11-12 05:44:47,304 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:44:47" (1/1) ... [2024-11-12 05:44:47,308 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:44:47" (1/1) ... [2024-11-12 05:44:47,310 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:44:47" (1/1) ... [2024-11-12 05:44:47,312 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:44:47" (1/1) ... [2024-11-12 05:44:47,314 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-12 05:44:47,315 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-12 05:44:47,316 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-12 05:44:47,316 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-12 05:44:47,317 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:44:47" (1/1) ... [2024-11-12 05:44:47,328 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 05:44:47,341 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 05:44:47,361 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-12 05:44:47,365 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-12 05:44:47,413 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-12 05:44:47,414 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-12 05:44:47,415 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-12 05:44:47,415 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-12 05:44:47,415 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-12 05:44:47,415 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-12 05:44:47,496 INFO L238 CfgBuilder]: Building ICFG [2024-11-12 05:44:47,498 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-12 05:44:47,854 INFO L? ?]: Removed 19 outVars from TransFormulas that were not future-live. [2024-11-12 05:44:47,855 INFO L287 CfgBuilder]: Performing block encoding [2024-11-12 05:44:47,873 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-12 05:44:47,875 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-12 05:44:47,875 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 05:44:47 BoogieIcfgContainer [2024-11-12 05:44:47,875 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-12 05:44:47,878 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-12 05:44:47,879 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-12 05:44:47,882 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-12 05:44:47,882 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.11 05:44:46" (1/3) ... [2024-11-12 05:44:47,883 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@73f3aaf7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 05:44:47, skipping insertion in model container [2024-11-12 05:44:47,884 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:44:47" (2/3) ... [2024-11-12 05:44:47,884 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@73f3aaf7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 05:44:47, skipping insertion in model container [2024-11-12 05:44:47,885 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 05:44:47" (3/3) ... [2024-11-12 05:44:47,886 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_50-1loop_file-66.i [2024-11-12 05:44:47,903 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-12 05:44:47,903 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-12 05:44:47,968 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-12 05:44:47,975 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;@714e3f7f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-12 05:44:47,976 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-12 05:44:47,980 INFO L276 IsEmpty]: Start isEmpty. Operand has 62 states, 41 states have (on average 1.4146341463414633) internal successors, (58), 42 states have internal predecessors, (58), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-11-12 05:44:47,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2024-11-12 05:44:47,995 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 05:44:47,996 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 05:44:47,997 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 05:44:48,003 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 05:44:48,004 INFO L85 PathProgramCache]: Analyzing trace with hash -1929590305, now seen corresponding path program 1 times [2024-11-12 05:44:48,011 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 05:44:48,011 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [777088719] [2024-11-12 05:44:48,012 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 05:44:48,012 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 05:44:48,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:45:09,685 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 05:45:09,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:45:09,691 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-12 05:45:09,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:45:09,695 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-12 05:45:09,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:45:09,699 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-12 05:45:09,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:45:09,707 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-12 05:45:09,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:45:09,710 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 05:45:09,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:45:09,714 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-12 05:45:09,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:45:09,718 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-12 05:45:09,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:45:09,723 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-12 05:45:09,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:45:09,726 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-12 05:45:09,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:45:09,729 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-12 05:45:09,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:45:09,733 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-12 05:45:09,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:45:09,739 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-12 05:45:09,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:45:09,741 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-12 05:45:09,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:45:09,744 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-12 05:45:09,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:45:09,750 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-12 05:45:09,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:45:09,757 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-12 05:45:09,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:45:09,761 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-12 05:45:09,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:45:09,765 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-12 05:45:09,766 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 05:45:09,766 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [777088719] [2024-11-12 05:45:09,767 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [777088719] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 05:45:09,767 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 05:45:09,767 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2024-11-12 05:45:09,769 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [630356401] [2024-11-12 05:45:09,770 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 05:45:09,774 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-11-12 05:45:09,775 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 05:45:09,801 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-11-12 05:45:09,803 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=150, Unknown=0, NotChecked=0, Total=210 [2024-11-12 05:45:09,805 INFO L87 Difference]: Start difference. First operand has 62 states, 41 states have (on average 1.4146341463414633) internal successors, (58), 42 states have internal predecessors, (58), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) Second operand has 15 states, 15 states have (on average 2.1333333333333333) internal successors, (32), 15 states have internal predecessors, (32), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-12 05:45:10,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 05:45:10,938 INFO L93 Difference]: Finished difference Result 262 states and 407 transitions. [2024-11-12 05:45:10,941 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-12 05:45:10,943 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 2.1333333333333333) internal successors, (32), 15 states have internal predecessors, (32), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 119 [2024-11-12 05:45:10,944 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 05:45:10,954 INFO L225 Difference]: With dead ends: 262 [2024-11-12 05:45:10,954 INFO L226 Difference]: Without dead ends: 175 [2024-11-12 05:45:10,960 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=82, Invalid=190, Unknown=0, NotChecked=0, Total=272 [2024-11-12 05:45:10,964 INFO L435 NwaCegarLoop]: 81 mSDtfsCounter, 256 mSDsluCounter, 504 mSDsCounter, 0 mSdLazyCounter, 368 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 256 SdHoareTripleChecker+Valid, 585 SdHoareTripleChecker+Invalid, 376 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 368 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-12 05:45:10,966 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [256 Valid, 585 Invalid, 376 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 368 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-12 05:45:10,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2024-11-12 05:45:11,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 105. [2024-11-12 05:45:11,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 80 states have (on average 1.3875) internal successors, (111), 81 states have internal predecessors, (111), 22 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (22), 21 states have call predecessors, (22), 22 states have call successors, (22) [2024-11-12 05:45:11,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 155 transitions. [2024-11-12 05:45:11,035 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 155 transitions. Word has length 119 [2024-11-12 05:45:11,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 05:45:11,038 INFO L471 AbstractCegarLoop]: Abstraction has 105 states and 155 transitions. [2024-11-12 05:45:11,039 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 2.1333333333333333) internal successors, (32), 15 states have internal predecessors, (32), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-12 05:45:11,039 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 155 transitions. [2024-11-12 05:45:11,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2024-11-12 05:45:11,044 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 05:45:11,044 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 05:45:11,045 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-12 05:45:11,045 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 05:45:11,046 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 05:45:11,046 INFO L85 PathProgramCache]: Analyzing trace with hash -1927743263, now seen corresponding path program 1 times [2024-11-12 05:45:11,046 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 05:45:11,047 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [340825284] [2024-11-12 05:45:11,047 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 05:45:11,047 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 05:45:11,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:45:38,565 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 05:45:38,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:45:38,569 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-12 05:45:38,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:45:38,571 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-12 05:45:38,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:45:38,573 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-12 05:45:38,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:45:38,575 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-12 05:45:38,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:45:38,577 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 05:45:38,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:45:38,578 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-12 05:45:38,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:45:38,580 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-12 05:45:38,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:45:38,582 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-12 05:45:38,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:45:38,584 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-12 05:45:38,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:45:38,586 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-12 05:45:38,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:45:38,587 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-12 05:45:38,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:45:38,589 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-12 05:45:38,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:45:38,590 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-12 05:45:38,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:45:38,592 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-12 05:45:38,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:45:38,594 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-12 05:45:38,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:45:38,631 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-12 05:45:38,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:45:38,634 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-12 05:45:38,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:45:38,637 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-12 05:45:38,639 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 05:45:38,639 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [340825284] [2024-11-12 05:45:38,639 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [340825284] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 05:45:38,640 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 05:45:38,640 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2024-11-12 05:45:38,640 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [859340953] [2024-11-12 05:45:38,640 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 05:45:38,642 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-12 05:45:38,643 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 05:45:38,644 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-12 05:45:38,645 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=183, Unknown=0, NotChecked=0, Total=240 [2024-11-12 05:45:38,646 INFO L87 Difference]: Start difference. First operand 105 states and 155 transitions. Second operand has 16 states, 16 states have (on average 2.0) internal successors, (32), 16 states have internal predecessors, (32), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-12 05:45:41,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 05:45:41,180 INFO L93 Difference]: Finished difference Result 159 states and 219 transitions. [2024-11-12 05:45:41,181 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-12 05:45:41,181 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 2.0) internal successors, (32), 16 states have internal predecessors, (32), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 119 [2024-11-12 05:45:41,182 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 05:45:41,186 INFO L225 Difference]: With dead ends: 159 [2024-11-12 05:45:41,187 INFO L226 Difference]: Without dead ends: 157 [2024-11-12 05:45:41,187 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=102, Invalid=278, Unknown=0, NotChecked=0, Total=380 [2024-11-12 05:45:41,188 INFO L435 NwaCegarLoop]: 63 mSDtfsCounter, 129 mSDsluCounter, 416 mSDsCounter, 0 mSdLazyCounter, 469 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 129 SdHoareTripleChecker+Valid, 479 SdHoareTripleChecker+Invalid, 470 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 469 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-12 05:45:41,189 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [129 Valid, 479 Invalid, 470 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 469 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-12 05:45:41,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2024-11-12 05:45:41,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 105. [2024-11-12 05:45:41,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 80 states have (on average 1.3875) internal successors, (111), 81 states have internal predecessors, (111), 22 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (22), 21 states have call predecessors, (22), 22 states have call successors, (22) [2024-11-12 05:45:41,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 155 transitions. [2024-11-12 05:45:41,206 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 155 transitions. Word has length 119 [2024-11-12 05:45:41,206 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 05:45:41,206 INFO L471 AbstractCegarLoop]: Abstraction has 105 states and 155 transitions. [2024-11-12 05:45:41,207 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 2.0) internal successors, (32), 16 states have internal predecessors, (32), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-12 05:45:41,207 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 155 transitions. [2024-11-12 05:45:41,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2024-11-12 05:45:41,209 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 05:45:41,209 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 05:45:41,209 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-12 05:45:41,210 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 05:45:41,210 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 05:45:41,210 INFO L85 PathProgramCache]: Analyzing trace with hash -1249531935, now seen corresponding path program 1 times [2024-11-12 05:45:41,210 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 05:45:41,211 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2123539348] [2024-11-12 05:45:41,211 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 05:45:41,211 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 05:45:41,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:46:01,087 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 05:46:01,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:46:01,090 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-12 05:46:01,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:46:01,091 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-12 05:46:01,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:46:01,093 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-12 05:46:01,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:46:01,095 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-12 05:46:01,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:46:01,097 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 05:46:01,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:46:01,099 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-12 05:46:01,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:46:01,100 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-12 05:46:01,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:46:01,102 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-12 05:46:01,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:46:01,104 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-12 05:46:01,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:46:01,106 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-12 05:46:01,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:46:01,108 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-12 05:46:01,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:46:01,110 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-12 05:46:01,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:46:01,111 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-12 05:46:01,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:46:01,113 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-12 05:46:01,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:46:01,115 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-12 05:46:01,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:46:01,116 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-12 05:46:01,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:46:01,118 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-12 05:46:01,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:46:01,121 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-12 05:46:01,121 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 05:46:01,121 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2123539348] [2024-11-12 05:46:01,121 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2123539348] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 05:46:01,121 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 05:46:01,122 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2024-11-12 05:46:01,122 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [875509157] [2024-11-12 05:46:01,122 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 05:46:01,123 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-11-12 05:46:01,123 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 05:46:01,124 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-11-12 05:46:01,124 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=150, Unknown=0, NotChecked=0, Total=210 [2024-11-12 05:46:01,124 INFO L87 Difference]: Start difference. First operand 105 states and 155 transitions. Second operand has 15 states, 15 states have (on average 2.1333333333333333) internal successors, (32), 15 states have internal predecessors, (32), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-12 05:46:02,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 05:46:02,193 INFO L93 Difference]: Finished difference Result 175 states and 238 transitions. [2024-11-12 05:46:02,193 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-12 05:46:02,193 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 2.1333333333333333) internal successors, (32), 15 states have internal predecessors, (32), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 119 [2024-11-12 05:46:02,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 05:46:02,195 INFO L225 Difference]: With dead ends: 175 [2024-11-12 05:46:02,195 INFO L226 Difference]: Without dead ends: 173 [2024-11-12 05:46:02,196 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=82, Invalid=190, Unknown=0, NotChecked=0, Total=272 [2024-11-12 05:46:02,197 INFO L435 NwaCegarLoop]: 79 mSDtfsCounter, 168 mSDsluCounter, 449 mSDsCounter, 0 mSdLazyCounter, 476 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 168 SdHoareTripleChecker+Valid, 528 SdHoareTripleChecker+Invalid, 477 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 476 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-12 05:46:02,197 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [168 Valid, 528 Invalid, 477 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 476 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-12 05:46:02,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2024-11-12 05:46:02,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 110. [2024-11-12 05:46:02,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 85 states have (on average 1.388235294117647) internal successors, (118), 86 states have internal predecessors, (118), 22 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (22), 21 states have call predecessors, (22), 22 states have call successors, (22) [2024-11-12 05:46:02,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 162 transitions. [2024-11-12 05:46:02,220 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 162 transitions. Word has length 119 [2024-11-12 05:46:02,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 05:46:02,220 INFO L471 AbstractCegarLoop]: Abstraction has 110 states and 162 transitions. [2024-11-12 05:46:02,220 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 2.1333333333333333) internal successors, (32), 15 states have internal predecessors, (32), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-12 05:46:02,220 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 162 transitions. [2024-11-12 05:46:02,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2024-11-12 05:46:02,222 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 05:46:02,223 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 05:46:02,223 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-12 05:46:02,223 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 05:46:02,223 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 05:46:02,223 INFO L85 PathProgramCache]: Analyzing trace with hash -1247684893, now seen corresponding path program 1 times [2024-11-12 05:46:02,224 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 05:46:02,224 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1900028280] [2024-11-12 05:46:02,224 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 05:46:02,224 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 05:46:02,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat