./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount250_file-85.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 803cd42f 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 ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount250_file-85.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 ca6e4c9424ce788edffc7e38265d581995e88f82a3064eb9de3661dcf45cf369 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-803cd42-m [2024-11-22 11:45:34,704 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-22 11:45:34,761 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-22 11:45:34,767 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-22 11:45:34,768 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-22 11:45:34,788 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-22 11:45:34,789 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-22 11:45:34,789 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-22 11:45:34,789 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-22 11:45:34,791 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-22 11:45:34,793 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-22 11:45:34,793 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-22 11:45:34,794 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-22 11:45:34,794 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-22 11:45:34,794 INFO L153 SettingsManager]: * Use SBE=true [2024-11-22 11:45:34,794 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-22 11:45:34,794 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-22 11:45:34,794 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-22 11:45:34,795 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-22 11:45:34,795 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-22 11:45:34,795 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-22 11:45:34,797 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-22 11:45:34,797 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-22 11:45:34,797 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-22 11:45:34,797 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-22 11:45:34,797 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-22 11:45:34,797 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-22 11:45:34,798 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-22 11:45:34,798 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-22 11:45:34,798 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-22 11:45:34,798 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-22 11:45:34,798 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-22 11:45:34,798 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-22 11:45:34,799 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-22 11:45:34,799 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-22 11:45:34,799 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-22 11:45:34,799 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-22 11:45:34,799 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-22 11:45:34,799 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-22 11:45:34,800 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-22 11:45:34,800 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-22 11:45:34,801 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-22 11:45:34,801 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 -> ca6e4c9424ce788edffc7e38265d581995e88f82a3064eb9de3661dcf45cf369 [2024-11-22 11:45:34,988 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-22 11:45:35,005 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-22 11:45:35,007 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-22 11:45:35,008 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-22 11:45:35,008 INFO L274 PluginConnector]: CDTParser initialized [2024-11-22 11:45:35,009 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount250_file-85.i [2024-11-22 11:45:36,287 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-22 11:45:36,515 INFO L384 CDTParser]: Found 1 translation units. [2024-11-22 11:45:36,516 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount250_file-85.i [2024-11-22 11:45:36,530 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2f524b3fb/f09a27bd4a314640b947f27183ff4931/FLAG9cfbebf91 [2024-11-22 11:45:36,544 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2f524b3fb/f09a27bd4a314640b947f27183ff4931 [2024-11-22 11:45:36,547 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-22 11:45:36,549 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-22 11:45:36,551 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-22 11:45:36,551 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-22 11:45:36,555 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-22 11:45:36,556 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 11:45:36" (1/1) ... [2024-11-22 11:45:36,557 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4aa168a1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:45:36, skipping insertion in model container [2024-11-22 11:45:36,557 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 11:45:36" (1/1) ... [2024-11-22 11:45:36,592 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-22 11:45:36,734 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_operatoramount_amount250_file-85.i[916,929] [2024-11-22 11:45:36,849 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-22 11:45:36,859 INFO L200 MainTranslator]: Completed pre-run [2024-11-22 11:45:36,872 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_operatoramount_amount250_file-85.i[916,929] [2024-11-22 11:45:36,997 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-22 11:45:37,065 INFO L204 MainTranslator]: Completed translation [2024-11-22 11:45:37,065 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:45:37 WrapperNode [2024-11-22 11:45:37,065 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-22 11:45:37,066 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-22 11:45:37,066 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-22 11:45:37,066 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-22 11:45:37,072 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:45:37" (1/1) ... [2024-11-22 11:45:37,094 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:45:37" (1/1) ... [2024-11-22 11:45:37,209 INFO L138 Inliner]: procedures = 26, calls = 65, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 497 [2024-11-22 11:45:37,210 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-22 11:45:37,213 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-22 11:45:37,213 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-22 11:45:37,213 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-22 11:45:37,228 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:45:37" (1/1) ... [2024-11-22 11:45:37,232 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:45:37" (1/1) ... [2024-11-22 11:45:37,244 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:45:37" (1/1) ... [2024-11-22 11:45:37,297 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-22 11:45:37,297 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:45:37" (1/1) ... [2024-11-22 11:45:37,297 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:45:37" (1/1) ... [2024-11-22 11:45:37,317 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:45:37" (1/1) ... [2024-11-22 11:45:37,322 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:45:37" (1/1) ... [2024-11-22 11:45:37,326 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:45:37" (1/1) ... [2024-11-22 11:45:37,330 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:45:37" (1/1) ... [2024-11-22 11:45:37,337 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-22 11:45:37,338 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-22 11:45:37,338 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-22 11:45:37,338 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-22 11:45:37,341 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:45:37" (1/1) ... [2024-11-22 11:45:37,352 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-22 11:45:37,366 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 11:45:37,386 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-22 11:45:37,394 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-22 11:45:37,452 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-22 11:45:37,452 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-22 11:45:37,452 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-22 11:45:37,452 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-22 11:45:37,453 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-22 11:45:37,453 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-22 11:45:37,573 INFO L238 CfgBuilder]: Building ICFG [2024-11-22 11:45:37,575 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-22 11:45:38,162 INFO L? ?]: Removed 50 outVars from TransFormulas that were not future-live. [2024-11-22 11:45:38,162 INFO L287 CfgBuilder]: Performing block encoding [2024-11-22 11:45:38,179 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-22 11:45:38,180 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-22 11:45:38,180 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 11:45:38 BoogieIcfgContainer [2024-11-22 11:45:38,180 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-22 11:45:38,182 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-22 11:45:38,182 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-22 11:45:38,184 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-22 11:45:38,185 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.11 11:45:36" (1/3) ... [2024-11-22 11:45:38,186 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@76610d5d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 11:45:38, skipping insertion in model container [2024-11-22 11:45:38,186 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:45:37" (2/3) ... [2024-11-22 11:45:38,186 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@76610d5d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 11:45:38, skipping insertion in model container [2024-11-22 11:45:38,187 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 11:45:38" (3/3) ... [2024-11-22 11:45:38,188 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount250_file-85.i [2024-11-22 11:45:38,200 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-22 11:45:38,200 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-22 11:45:38,253 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-22 11:45:38,258 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;@53b7d190, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-22 11:45:38,258 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-22 11:45:38,263 INFO L276 IsEmpty]: Start isEmpty. Operand has 193 states, 138 states have (on average 1.4855072463768115) internal successors, (205), 139 states have internal predecessors, (205), 52 states have call successors, (52), 1 states have call predecessors, (52), 1 states have return successors, (52), 52 states have call predecessors, (52), 52 states have call successors, (52) [2024-11-22 11:45:38,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 350 [2024-11-22 11:45:38,291 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 11:45:38,292 INFO L215 NwaCegarLoop]: trace histogram [52, 52, 52, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-22 11:45:38,293 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 11:45:38,296 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 11:45:38,297 INFO L85 PathProgramCache]: Analyzing trace with hash 1606397795, now seen corresponding path program 1 times [2024-11-22 11:45:38,304 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 11:45:38,304 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1389530454] [2024-11-22 11:45:38,304 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 11:45:38,305 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 11:45:38,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 11:45:38,776 INFO L134 CoverageAnalysis]: Checked inductivity of 5304 backedges. 0 proven. 102 refuted. 0 times theorem prover too weak. 5202 trivial. 0 not checked. [2024-11-22 11:45:38,777 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 11:45:38,777 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1389530454] [2024-11-22 11:45:38,778 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1389530454] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-22 11:45:38,779 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [155120290] [2024-11-22 11:45:38,779 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 11:45:38,779 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 11:45:38,779 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 11:45:38,785 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-22 11:45:38,786 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-22 11:45:39,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 11:45:39,094 INFO L255 TraceCheckSpWp]: Trace formula consists of 887 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-22 11:45:39,110 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 11:45:39,155 INFO L134 CoverageAnalysis]: Checked inductivity of 5304 backedges. 102 proven. 0 refuted. 0 times theorem prover too weak. 5202 trivial. 0 not checked. [2024-11-22 11:45:39,155 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-22 11:45:39,155 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [155120290] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 11:45:39,156 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-22 11:45:39,156 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2024-11-22 11:45:39,158 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2125435422] [2024-11-22 11:45:39,158 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 11:45:39,162 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-22 11:45:39,162 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 11:45:39,182 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-22 11:45:39,182 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-22 11:45:39,185 INFO L87 Difference]: Start difference. First operand has 193 states, 138 states have (on average 1.4855072463768115) internal successors, (205), 139 states have internal predecessors, (205), 52 states have call successors, (52), 1 states have call predecessors, (52), 1 states have return successors, (52), 52 states have call predecessors, (52), 52 states have call successors, (52) Second operand has 2 states, 2 states have (on average 47.0) internal successors, (94), 2 states have internal predecessors, (94), 2 states have call successors, (52), 2 states have call predecessors, (52), 1 states have return successors, (52), 1 states have call predecessors, (52), 2 states have call successors, (52) [2024-11-22 11:45:39,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 11:45:39,226 INFO L93 Difference]: Finished difference Result 379 states and 664 transitions. [2024-11-22 11:45:39,227 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-22 11:45:39,229 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 47.0) internal successors, (94), 2 states have internal predecessors, (94), 2 states have call successors, (52), 2 states have call predecessors, (52), 1 states have return successors, (52), 1 states have call predecessors, (52), 2 states have call successors, (52) Word has length 349 [2024-11-22 11:45:39,229 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 11:45:39,237 INFO L225 Difference]: With dead ends: 379 [2024-11-22 11:45:39,238 INFO L226 Difference]: Without dead ends: 189 [2024-11-22 11:45:39,245 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 350 GetRequests, 350 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-22 11:45:39,248 INFO L432 NwaCegarLoop]: 302 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 302 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-22 11:45:39,248 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 302 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-22 11:45:39,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2024-11-22 11:45:39,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 189. [2024-11-22 11:45:39,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 189 states, 135 states have (on average 1.4666666666666666) internal successors, (198), 135 states have internal predecessors, (198), 52 states have call successors, (52), 1 states have call predecessors, (52), 1 states have return successors, (52), 52 states have call predecessors, (52), 52 states have call successors, (52) [2024-11-22 11:45:39,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 302 transitions. [2024-11-22 11:45:39,296 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 302 transitions. Word has length 349 [2024-11-22 11:45:39,296 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 11:45:39,297 INFO L471 AbstractCegarLoop]: Abstraction has 189 states and 302 transitions. [2024-11-22 11:45:39,297 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 47.0) internal successors, (94), 2 states have internal predecessors, (94), 2 states have call successors, (52), 2 states have call predecessors, (52), 1 states have return successors, (52), 1 states have call predecessors, (52), 2 states have call successors, (52) [2024-11-22 11:45:39,297 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 302 transitions. [2024-11-22 11:45:39,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 350 [2024-11-22 11:45:39,305 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 11:45:39,306 INFO L215 NwaCegarLoop]: trace histogram [52, 52, 52, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-22 11:45:39,314 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-22 11:45:39,506 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2024-11-22 11:45:39,507 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 11:45:39,508 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 11:45:39,508 INFO L85 PathProgramCache]: Analyzing trace with hash -1307537189, now seen corresponding path program 1 times [2024-11-22 11:45:39,508 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 11:45:39,508 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1037434378] [2024-11-22 11:45:39,509 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 11:45:39,509 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 11:45:39,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 11:45:39,876 INFO L134 CoverageAnalysis]: Checked inductivity of 5304 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5304 trivial. 0 not checked. [2024-11-22 11:45:39,876 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 11:45:39,876 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1037434378] [2024-11-22 11:45:39,876 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1037434378] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 11:45:39,876 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 11:45:39,877 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-22 11:45:39,877 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1744318688] [2024-11-22 11:45:39,877 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 11:45:39,878 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-22 11:45:39,878 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 11:45:39,881 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-22 11:45:39,881 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-22 11:45:39,882 INFO L87 Difference]: Start difference. First operand 189 states and 302 transitions. Second operand has 3 states, 3 states have (on average 30.666666666666668) internal successors, (92), 3 states have internal predecessors, (92), 1 states have call successors, (52), 1 states have call predecessors, (52), 1 states have return successors, (52), 1 states have call predecessors, (52), 1 states have call successors, (52) [2024-11-22 11:45:40,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 11:45:40,013 INFO L93 Difference]: Finished difference Result 558 states and 894 transitions. [2024-11-22 11:45:40,015 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-22 11:45:40,015 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 30.666666666666668) internal successors, (92), 3 states have internal predecessors, (92), 1 states have call successors, (52), 1 states have call predecessors, (52), 1 states have return successors, (52), 1 states have call predecessors, (52), 1 states have call successors, (52) Word has length 349 [2024-11-22 11:45:40,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 11:45:40,022 INFO L225 Difference]: With dead ends: 558 [2024-11-22 11:45:40,022 INFO L226 Difference]: Without dead ends: 372 [2024-11-22 11:45:40,023 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-22 11:45:40,024 INFO L432 NwaCegarLoop]: 550 mSDtfsCounter, 275 mSDsluCounter, 287 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 275 SdHoareTripleChecker+Valid, 837 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-22 11:45:40,024 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [275 Valid, 837 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-22 11:45:40,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 372 states. [2024-11-22 11:45:40,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 372 to 221. [2024-11-22 11:45:40,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 221 states, 167 states have (on average 1.4970059880239521) internal successors, (250), 167 states have internal predecessors, (250), 52 states have call successors, (52), 1 states have call predecessors, (52), 1 states have return successors, (52), 52 states have call predecessors, (52), 52 states have call successors, (52) [2024-11-22 11:45:40,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 354 transitions. [2024-11-22 11:45:40,057 INFO L78 Accepts]: Start accepts. Automaton has 221 states and 354 transitions. Word has length 349 [2024-11-22 11:45:40,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 11:45:40,060 INFO L471 AbstractCegarLoop]: Abstraction has 221 states and 354 transitions. [2024-11-22 11:45:40,060 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.666666666666668) internal successors, (92), 3 states have internal predecessors, (92), 1 states have call successors, (52), 1 states have call predecessors, (52), 1 states have return successors, (52), 1 states have call predecessors, (52), 1 states have call successors, (52) [2024-11-22 11:45:40,061 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 354 transitions. [2024-11-22 11:45:40,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 351 [2024-11-22 11:45:40,065 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 11:45:40,066 INFO L215 NwaCegarLoop]: trace histogram [52, 52, 52, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-22 11:45:40,066 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-22 11:45:40,066 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 11:45:40,067 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 11:45:40,067 INFO L85 PathProgramCache]: Analyzing trace with hash 1797734086, now seen corresponding path program 1 times [2024-11-22 11:45:40,068 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 11:45:40,068 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1884982956] [2024-11-22 11:45:40,068 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 11:45:40,068 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 11:45:40,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 11:45:40,274 INFO L134 CoverageAnalysis]: Checked inductivity of 5304 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5304 trivial. 0 not checked. [2024-11-22 11:45:40,275 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 11:45:40,277 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1884982956] [2024-11-22 11:45:40,277 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1884982956] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 11:45:40,277 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 11:45:40,278 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-22 11:45:40,278 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1763879136] [2024-11-22 11:45:40,278 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 11:45:40,279 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-22 11:45:40,280 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 11:45:40,280 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-22 11:45:40,280 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-22 11:45:40,281 INFO L87 Difference]: Start difference. First operand 221 states and 354 transitions. Second operand has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 1 states have call successors, (52), 1 states have call predecessors, (52), 1 states have return successors, (52), 1 states have call predecessors, (52), 1 states have call successors, (52) [2024-11-22 11:45:40,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 11:45:40,325 INFO L93 Difference]: Finished difference Result 630 states and 1011 transitions. [2024-11-22 11:45:40,326 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-22 11:45:40,326 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 1 states have call successors, (52), 1 states have call predecessors, (52), 1 states have return successors, (52), 1 states have call predecessors, (52), 1 states have call successors, (52) Word has length 350 [2024-11-22 11:45:40,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 11:45:40,331 INFO L225 Difference]: With dead ends: 630 [2024-11-22 11:45:40,332 INFO L226 Difference]: Without dead ends: 412 [2024-11-22 11:45:40,332 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-22 11:45:40,333 INFO L432 NwaCegarLoop]: 299 mSDtfsCounter, 269 mSDsluCounter, 292 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 269 SdHoareTripleChecker+Valid, 591 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-22 11:45:40,334 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [269 Valid, 591 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-22 11:45:40,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 412 states. [2024-11-22 11:45:40,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 412 to 238. [2024-11-22 11:45:40,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 238 states, 184 states have (on average 1.5108695652173914) internal successors, (278), 184 states have internal predecessors, (278), 52 states have call successors, (52), 1 states have call predecessors, (52), 1 states have return successors, (52), 52 states have call predecessors, (52), 52 states have call successors, (52) [2024-11-22 11:45:40,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 238 states to 238 states and 382 transitions. [2024-11-22 11:45:40,362 INFO L78 Accepts]: Start accepts. Automaton has 238 states and 382 transitions. Word has length 350 [2024-11-22 11:45:40,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 11:45:40,363 INFO L471 AbstractCegarLoop]: Abstraction has 238 states and 382 transitions. [2024-11-22 11:45:40,363 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 1 states have call successors, (52), 1 states have call predecessors, (52), 1 states have return successors, (52), 1 states have call predecessors, (52), 1 states have call successors, (52) [2024-11-22 11:45:40,364 INFO L276 IsEmpty]: Start isEmpty. Operand 238 states and 382 transitions. [2024-11-22 11:45:40,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 351 [2024-11-22 11:45:40,367 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 11:45:40,367 INFO L215 NwaCegarLoop]: trace histogram [52, 52, 52, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-22 11:45:40,367 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-22 11:45:40,367 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 11:45:40,368 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 11:45:40,368 INFO L85 PathProgramCache]: Analyzing trace with hash -503088504, now seen corresponding path program 1 times [2024-11-22 11:45:40,369 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 11:45:40,369 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [198444664] [2024-11-22 11:45:40,369 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 11:45:40,369 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 11:45:40,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 11:45:40,571 INFO L134 CoverageAnalysis]: Checked inductivity of 5304 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5304 trivial. 0 not checked. [2024-11-22 11:45:40,572 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 11:45:40,572 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [198444664] [2024-11-22 11:45:40,572 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [198444664] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 11:45:40,572 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 11:45:40,572 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-22 11:45:40,573 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1686587778] [2024-11-22 11:45:40,573 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 11:45:40,573 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-22 11:45:40,573 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 11:45:40,574 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-22 11:45:40,574 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-22 11:45:40,574 INFO L87 Difference]: Start difference. First operand 238 states and 382 transitions. Second operand has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 1 states have call successors, (52), 1 states have call predecessors, (52), 1 states have return successors, (52), 1 states have call predecessors, (52), 1 states have call successors, (52) [2024-11-22 11:45:40,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 11:45:40,628 INFO L93 Difference]: Finished difference Result 699 states and 1124 transitions. [2024-11-22 11:45:40,629 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-22 11:45:40,629 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 1 states have call successors, (52), 1 states have call predecessors, (52), 1 states have return successors, (52), 1 states have call predecessors, (52), 1 states have call successors, (52) Word has length 350 [2024-11-22 11:45:40,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 11:45:40,632 INFO L225 Difference]: With dead ends: 699 [2024-11-22 11:45:40,632 INFO L226 Difference]: Without dead ends: 464 [2024-11-22 11:45:40,633 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-22 11:45:40,633 INFO L432 NwaCegarLoop]: 294 mSDtfsCounter, 258 mSDsluCounter, 273 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 258 SdHoareTripleChecker+Valid, 567 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-22 11:45:40,634 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [258 Valid, 567 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-22 11:45:40,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 464 states. [2024-11-22 11:45:40,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 464 to 462. [2024-11-22 11:45:40,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 462 states, 355 states have (on average 1.4816901408450704) internal successors, (526), 355 states have internal predecessors, (526), 104 states have call successors, (104), 2 states have call predecessors, (104), 2 states have return successors, (104), 104 states have call predecessors, (104), 104 states have call successors, (104) [2024-11-22 11:45:40,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 462 states to 462 states and 734 transitions. [2024-11-22 11:45:40,654 INFO L78 Accepts]: Start accepts. Automaton has 462 states and 734 transitions. Word has length 350 [2024-11-22 11:45:40,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 11:45:40,655 INFO L471 AbstractCegarLoop]: Abstraction has 462 states and 734 transitions. [2024-11-22 11:45:40,655 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 1 states have call successors, (52), 1 states have call predecessors, (52), 1 states have return successors, (52), 1 states have call predecessors, (52), 1 states have call successors, (52) [2024-11-22 11:45:40,655 INFO L276 IsEmpty]: Start isEmpty. Operand 462 states and 734 transitions. [2024-11-22 11:45:40,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 352 [2024-11-22 11:45:40,658 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 11:45:40,658 INFO L215 NwaCegarLoop]: trace histogram [52, 52, 52, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-22 11:45:40,658 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-22 11:45:40,659 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 11:45:40,659 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 11:45:40,659 INFO L85 PathProgramCache]: Analyzing trace with hash -153970233, now seen corresponding path program 1 times [2024-11-22 11:45:40,659 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 11:45:40,659 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [272410709] [2024-11-22 11:45:40,659 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 11:45:40,660 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 11:45:40,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 11:45:41,788 INFO L134 CoverageAnalysis]: Checked inductivity of 5304 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5304 trivial. 0 not checked. [2024-11-22 11:45:41,789 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 11:45:41,789 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [272410709] [2024-11-22 11:45:41,789 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [272410709] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 11:45:41,789 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 11:45:41,789 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-22 11:45:41,789 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1558003572] [2024-11-22 11:45:41,789 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 11:45:41,790 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-22 11:45:41,790 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 11:45:41,790 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-22 11:45:41,791 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-22 11:45:41,791 INFO L87 Difference]: Start difference. First operand 462 states and 734 transitions. Second operand has 6 states, 6 states have (on average 15.666666666666666) internal successors, (94), 6 states have internal predecessors, (94), 1 states have call successors, (52), 1 states have call predecessors, (52), 1 states have return successors, (52), 1 states have call predecessors, (52), 1 states have call successors, (52) [2024-11-22 11:45:42,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 11:45:42,152 INFO L93 Difference]: Finished difference Result 1559 states and 2461 transitions. [2024-11-22 11:45:42,153 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-22 11:45:42,153 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 15.666666666666666) internal successors, (94), 6 states have internal predecessors, (94), 1 states have call successors, (52), 1 states have call predecessors, (52), 1 states have return successors, (52), 1 states have call predecessors, (52), 1 states have call successors, (52) Word has length 351 [2024-11-22 11:45:42,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 11:45:42,158 INFO L225 Difference]: With dead ends: 1559 [2024-11-22 11:45:42,158 INFO L226 Difference]: Without dead ends: 1100 [2024-11-22 11:45:42,159 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2024-11-22 11:45:42,160 INFO L432 NwaCegarLoop]: 367 mSDtfsCounter, 484 mSDsluCounter, 1062 mSDsCounter, 0 mSdLazyCounter, 345 mSolverCounterSat, 162 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 484 SdHoareTripleChecker+Valid, 1429 SdHoareTripleChecker+Invalid, 507 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 162 IncrementalHoareTripleChecker+Valid, 345 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-22 11:45:42,160 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [484 Valid, 1429 Invalid, 507 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [162 Valid, 345 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-22 11:45:42,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1100 states. [2024-11-22 11:45:42,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1100 to 799. [2024-11-22 11:45:42,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 799 states, 639 states have (on average 1.5054773082942097) internal successors, (962), 639 states have internal predecessors, (962), 156 states have call successors, (156), 3 states have call predecessors, (156), 3 states have return successors, (156), 156 states have call predecessors, (156), 156 states have call successors, (156) [2024-11-22 11:45:42,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 799 states to 799 states and 1274 transitions. [2024-11-22 11:45:42,201 INFO L78 Accepts]: Start accepts. Automaton has 799 states and 1274 transitions. Word has length 351 [2024-11-22 11:45:42,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 11:45:42,201 INFO L471 AbstractCegarLoop]: Abstraction has 799 states and 1274 transitions. [2024-11-22 11:45:42,202 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 15.666666666666666) internal successors, (94), 6 states have internal predecessors, (94), 1 states have call successors, (52), 1 states have call predecessors, (52), 1 states have return successors, (52), 1 states have call predecessors, (52), 1 states have call successors, (52) [2024-11-22 11:45:42,202 INFO L276 IsEmpty]: Start isEmpty. Operand 799 states and 1274 transitions. [2024-11-22 11:45:42,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 352 [2024-11-22 11:45:42,205 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 11:45:42,205 INFO L215 NwaCegarLoop]: trace histogram [52, 52, 52, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-22 11:45:42,205 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-22 11:45:42,206 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 11:45:42,206 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 11:45:42,206 INFO L85 PathProgramCache]: Analyzing trace with hash -1183329531, now seen corresponding path program 1 times [2024-11-22 11:45:42,206 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 11:45:42,206 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [745800331] [2024-11-22 11:45:42,206 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 11:45:42,206 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 11:45:42,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 11:45:42,763 INFO L134 CoverageAnalysis]: Checked inductivity of 5304 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5304 trivial. 0 not checked. [2024-11-22 11:45:42,763 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 11:45:42,763 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [745800331] [2024-11-22 11:45:42,765 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [745800331] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 11:45:42,765 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 11:45:42,765 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-22 11:45:42,765 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [431022] [2024-11-22 11:45:42,765 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 11:45:42,766 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-22 11:45:42,766 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 11:45:42,767 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-22 11:45:42,768 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-22 11:45:42,769 INFO L87 Difference]: Start difference. First operand 799 states and 1274 transitions. Second operand has 5 states, 5 states have (on average 18.8) internal successors, (94), 5 states have internal predecessors, (94), 1 states have call successors, (52), 1 states have call predecessors, (52), 1 states have return successors, (52), 1 states have call predecessors, (52), 1 states have call successors, (52) [2024-11-22 11:45:43,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 11:45:43,091 INFO L93 Difference]: Finished difference Result 1319 states and 2090 transitions. [2024-11-22 11:45:43,092 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-22 11:45:43,092 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 18.8) internal successors, (94), 5 states have internal predecessors, (94), 1 states have call successors, (52), 1 states have call predecessors, (52), 1 states have return successors, (52), 1 states have call predecessors, (52), 1 states have call successors, (52) Word has length 351 [2024-11-22 11:45:43,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 11:45:43,096 INFO L225 Difference]: With dead ends: 1319 [2024-11-22 11:45:43,096 INFO L226 Difference]: Without dead ends: 860 [2024-11-22 11:45:43,097 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-22 11:45:43,098 INFO L432 NwaCegarLoop]: 298 mSDtfsCounter, 236 mSDsluCounter, 767 mSDsCounter, 0 mSdLazyCounter, 137 mSolverCounterSat, 157 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 236 SdHoareTripleChecker+Valid, 1065 SdHoareTripleChecker+Invalid, 294 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 157 IncrementalHoareTripleChecker+Valid, 137 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-22 11:45:43,098 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [236 Valid, 1065 Invalid, 294 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [157 Valid, 137 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-22 11:45:43,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 860 states. [2024-11-22 11:45:43,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 860 to 799. [2024-11-22 11:45:43,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 799 states, 639 states have (on average 1.4992175273865416) internal successors, (958), 639 states have internal predecessors, (958), 156 states have call successors, (156), 3 states have call predecessors, (156), 3 states have return successors, (156), 156 states have call predecessors, (156), 156 states have call successors, (156) [2024-11-22 11:45:43,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 799 states to 799 states and 1270 transitions. [2024-11-22 11:45:43,138 INFO L78 Accepts]: Start accepts. Automaton has 799 states and 1270 transitions. Word has length 351 [2024-11-22 11:45:43,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 11:45:43,139 INFO L471 AbstractCegarLoop]: Abstraction has 799 states and 1270 transitions. [2024-11-22 11:45:43,139 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 18.8) internal successors, (94), 5 states have internal predecessors, (94), 1 states have call successors, (52), 1 states have call predecessors, (52), 1 states have return successors, (52), 1 states have call predecessors, (52), 1 states have call successors, (52) [2024-11-22 11:45:43,139 INFO L276 IsEmpty]: Start isEmpty. Operand 799 states and 1270 transitions. [2024-11-22 11:45:43,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 352 [2024-11-22 11:45:43,142 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 11:45:43,142 INFO L215 NwaCegarLoop]: trace histogram [52, 52, 52, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-22 11:45:43,142 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-22 11:45:43,143 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 11:45:43,143 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 11:45:43,143 INFO L85 PathProgramCache]: Analyzing trace with hash -2105316767, now seen corresponding path program 1 times [2024-11-22 11:45:43,143 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 11:45:43,143 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1385104010] [2024-11-22 11:45:43,143 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 11:45:43,144 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 11:45:43,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 11:45:43,709 INFO L134 CoverageAnalysis]: Checked inductivity of 5304 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5304 trivial. 0 not checked. [2024-11-22 11:45:43,710 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 11:45:43,710 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1385104010] [2024-11-22 11:45:43,710 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1385104010] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 11:45:43,710 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 11:45:43,710 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-22 11:45:43,710 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [731031112] [2024-11-22 11:45:43,710 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 11:45:43,711 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-22 11:45:43,711 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 11:45:43,711 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-22 11:45:43,711 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-22 11:45:43,712 INFO L87 Difference]: Start difference. First operand 799 states and 1270 transitions. Second operand has 4 states, 4 states have (on average 23.5) internal successors, (94), 4 states have internal predecessors, (94), 1 states have call successors, (52), 1 states have call predecessors, (52), 1 states have return successors, (52), 1 states have call predecessors, (52), 1 states have call successors, (52) [2024-11-22 11:45:44,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 11:45:44,010 INFO L93 Difference]: Finished difference Result 2089 states and 3280 transitions. [2024-11-22 11:45:44,010 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-22 11:45:44,010 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 23.5) internal successors, (94), 4 states have internal predecessors, (94), 1 states have call successors, (52), 1 states have call predecessors, (52), 1 states have return successors, (52), 1 states have call predecessors, (52), 1 states have call successors, (52) Word has length 351 [2024-11-22 11:45:44,011 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 11:45:44,016 INFO L225 Difference]: With dead ends: 2089 [2024-11-22 11:45:44,016 INFO L226 Difference]: Without dead ends: 1553 [2024-11-22 11:45:44,017 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-22 11:45:44,018 INFO L432 NwaCegarLoop]: 340 mSDtfsCounter, 328 mSDsluCounter, 510 mSDsCounter, 0 mSdLazyCounter, 157 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 328 SdHoareTripleChecker+Valid, 850 SdHoareTripleChecker+Invalid, 179 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 157 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-22 11:45:44,018 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [328 Valid, 850 Invalid, 179 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 157 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-22 11:45:44,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1553 states. [2024-11-22 11:45:44,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1553 to 1545. [2024-11-22 11:45:44,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1545 states, 1312 states have (on average 1.5053353658536586) internal successors, (1975), 1316 states have internal predecessors, (1975), 222 states have call successors, (222), 10 states have call predecessors, (222), 10 states have return successors, (222), 218 states have call predecessors, (222), 222 states have call successors, (222) [2024-11-22 11:45:44,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1545 states to 1545 states and 2419 transitions. [2024-11-22 11:45:44,094 INFO L78 Accepts]: Start accepts. Automaton has 1545 states and 2419 transitions. Word has length 351 [2024-11-22 11:45:44,094 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 11:45:44,094 INFO L471 AbstractCegarLoop]: Abstraction has 1545 states and 2419 transitions. [2024-11-22 11:45:44,094 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 23.5) internal successors, (94), 4 states have internal predecessors, (94), 1 states have call successors, (52), 1 states have call predecessors, (52), 1 states have return successors, (52), 1 states have call predecessors, (52), 1 states have call successors, (52) [2024-11-22 11:45:44,095 INFO L276 IsEmpty]: Start isEmpty. Operand 1545 states and 2419 transitions. [2024-11-22 11:45:44,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 352 [2024-11-22 11:45:44,098 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 11:45:44,098 INFO L215 NwaCegarLoop]: trace histogram [52, 52, 52, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-22 11:45:44,099 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-22 11:45:44,099 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 11:45:44,099 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 11:45:44,099 INFO L85 PathProgramCache]: Analyzing trace with hash 266422495, now seen corresponding path program 1 times [2024-11-22 11:45:44,099 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 11:45:44,099 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1213701819] [2024-11-22 11:45:44,099 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 11:45:44,099 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 11:45:44,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 11:45:44,831 INFO L134 CoverageAnalysis]: Checked inductivity of 5304 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5304 trivial. 0 not checked. [2024-11-22 11:45:44,831 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 11:45:44,831 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1213701819] [2024-11-22 11:45:44,832 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1213701819] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 11:45:44,832 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 11:45:44,832 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-22 11:45:44,832 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [205586767] [2024-11-22 11:45:44,832 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 11:45:44,832 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-22 11:45:44,833 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 11:45:44,833 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-22 11:45:44,833 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-22 11:45:44,833 INFO L87 Difference]: Start difference. First operand 1545 states and 2419 transitions. Second operand has 5 states, 5 states have (on average 18.8) internal successors, (94), 5 states have internal predecessors, (94), 1 states have call successors, (52), 1 states have call predecessors, (52), 1 states have return successors, (52), 1 states have call predecessors, (52), 1 states have call successors, (52) [2024-11-22 11:45:45,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 11:45:45,523 INFO L93 Difference]: Finished difference Result 4224 states and 6481 transitions. [2024-11-22 11:45:45,523 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-22 11:45:45,524 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 18.8) internal successors, (94), 5 states have internal predecessors, (94), 1 states have call successors, (52), 1 states have call predecessors, (52), 1 states have return successors, (52), 1 states have call predecessors, (52), 1 states have call successors, (52) Word has length 351 [2024-11-22 11:45:45,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 11:45:45,536 INFO L225 Difference]: With dead ends: 4224 [2024-11-22 11:45:45,536 INFO L226 Difference]: Without dead ends: 3203 [2024-11-22 11:45:45,539 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2024-11-22 11:45:45,540 INFO L432 NwaCegarLoop]: 447 mSDtfsCounter, 773 mSDsluCounter, 959 mSDsCounter, 0 mSdLazyCounter, 372 mSolverCounterSat, 148 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 773 SdHoareTripleChecker+Valid, 1406 SdHoareTripleChecker+Invalid, 520 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 148 IncrementalHoareTripleChecker+Valid, 372 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-22 11:45:45,540 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [773 Valid, 1406 Invalid, 520 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [148 Valid, 372 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-22 11:45:45,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3203 states. [2024-11-22 11:45:45,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3203 to 2219. [2024-11-22 11:45:45,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2219 states, 1913 states have (on average 1.4898065865133299) internal successors, (2850), 1920 states have internal predecessors, (2850), 291 states have call successors, (291), 14 states have call predecessors, (291), 14 states have return successors, (291), 284 states have call predecessors, (291), 291 states have call successors, (291) [2024-11-22 11:45:45,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2219 states to 2219 states and 3432 transitions. [2024-11-22 11:45:45,635 INFO L78 Accepts]: Start accepts. Automaton has 2219 states and 3432 transitions. Word has length 351 [2024-11-22 11:45:45,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 11:45:45,636 INFO L471 AbstractCegarLoop]: Abstraction has 2219 states and 3432 transitions. [2024-11-22 11:45:45,636 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 18.8) internal successors, (94), 5 states have internal predecessors, (94), 1 states have call successors, (52), 1 states have call predecessors, (52), 1 states have return successors, (52), 1 states have call predecessors, (52), 1 states have call successors, (52) [2024-11-22 11:45:45,636 INFO L276 IsEmpty]: Start isEmpty. Operand 2219 states and 3432 transitions. [2024-11-22 11:45:45,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 352 [2024-11-22 11:45:45,639 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 11:45:45,639 INFO L215 NwaCegarLoop]: trace histogram [52, 52, 52, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-22 11:45:45,639 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-22 11:45:45,640 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 11:45:45,640 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 11:45:45,640 INFO L85 PathProgramCache]: Analyzing trace with hash -1360481633, now seen corresponding path program 1 times [2024-11-22 11:45:45,640 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 11:45:45,640 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1764408794] [2024-11-22 11:45:45,640 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 11:45:45,641 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 11:45:46,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 11:45:46,491 INFO L134 CoverageAnalysis]: Checked inductivity of 5304 backedges. 120 proven. 33 refuted. 0 times theorem prover too weak. 5151 trivial. 0 not checked. [2024-11-22 11:45:46,491 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 11:45:46,491 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1764408794] [2024-11-22 11:45:46,491 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1764408794] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-22 11:45:46,491 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1066606385] [2024-11-22 11:45:46,492 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 11:45:46,492 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 11:45:46,492 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 11:45:46,495 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-22 11:45:46,498 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-22 11:45:46,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 11:45:46,710 INFO L255 TraceCheckSpWp]: Trace formula consists of 887 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-22 11:45:46,719 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 11:45:46,881 INFO L134 CoverageAnalysis]: Checked inductivity of 5304 backedges. 1891 proven. 33 refuted. 0 times theorem prover too weak. 3380 trivial. 0 not checked. [2024-11-22 11:45:46,882 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-22 11:45:47,123 INFO L134 CoverageAnalysis]: Checked inductivity of 5304 backedges. 120 proven. 33 refuted. 0 times theorem prover too weak. 5151 trivial. 0 not checked. [2024-11-22 11:45:47,125 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1066606385] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-22 11:45:47,125 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-22 11:45:47,125 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 7 [2024-11-22 11:45:47,126 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [794309312] [2024-11-22 11:45:47,126 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-22 11:45:47,126 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-22 11:45:47,126 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 11:45:47,127 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-22 11:45:47,127 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-22 11:45:47,127 INFO L87 Difference]: Start difference. First operand 2219 states and 3432 transitions. Second operand has 7 states, 7 states have (on average 14.714285714285714) internal successors, (103), 7 states have internal predecessors, (103), 2 states have call successors, (63), 2 states have call predecessors, (63), 4 states have return successors, (64), 2 states have call predecessors, (64), 2 states have call successors, (64) [2024-11-22 11:45:47,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 11:45:47,438 INFO L93 Difference]: Finished difference Result 4322 states and 6650 transitions. [2024-11-22 11:45:47,439 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-22 11:45:47,440 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 14.714285714285714) internal successors, (103), 7 states have internal predecessors, (103), 2 states have call successors, (63), 2 states have call predecessors, (63), 4 states have return successors, (64), 2 states have call predecessors, (64), 2 states have call successors, (64) Word has length 351 [2024-11-22 11:45:47,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 11:45:47,448 INFO L225 Difference]: With dead ends: 4322 [2024-11-22 11:45:47,448 INFO L226 Difference]: Without dead ends: 2259 [2024-11-22 11:45:47,451 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 708 GetRequests, 699 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2024-11-22 11:45:47,451 INFO L432 NwaCegarLoop]: 245 mSDtfsCounter, 385 mSDsluCounter, 383 mSDsCounter, 0 mSdLazyCounter, 277 mSolverCounterSat, 85 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 425 SdHoareTripleChecker+Valid, 628 SdHoareTripleChecker+Invalid, 362 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 85 IncrementalHoareTripleChecker+Valid, 277 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-22 11:45:47,452 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [425 Valid, 628 Invalid, 362 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [85 Valid, 277 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-22 11:45:47,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2259 states. [2024-11-22 11:45:47,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2259 to 2231. [2024-11-22 11:45:47,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2231 states, 1922 states have (on average 1.4812695109261187) internal successors, (2847), 1929 states have internal predecessors, (2847), 291 states have call successors, (291), 17 states have call predecessors, (291), 17 states have return successors, (291), 284 states have call predecessors, (291), 291 states have call successors, (291) [2024-11-22 11:45:47,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2231 states to 2231 states and 3429 transitions. [2024-11-22 11:45:47,534 INFO L78 Accepts]: Start accepts. Automaton has 2231 states and 3429 transitions. Word has length 351 [2024-11-22 11:45:47,535 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 11:45:47,535 INFO L471 AbstractCegarLoop]: Abstraction has 2231 states and 3429 transitions. [2024-11-22 11:45:47,535 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 14.714285714285714) internal successors, (103), 7 states have internal predecessors, (103), 2 states have call successors, (63), 2 states have call predecessors, (63), 4 states have return successors, (64), 2 states have call predecessors, (64), 2 states have call successors, (64) [2024-11-22 11:45:47,535 INFO L276 IsEmpty]: Start isEmpty. Operand 2231 states and 3429 transitions. [2024-11-22 11:45:47,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 354 [2024-11-22 11:45:47,538 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 11:45:47,538 INFO L215 NwaCegarLoop]: trace histogram [52, 52, 52, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-22 11:45:47,550 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-22 11:45:47,738 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2024-11-22 11:45:47,739 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 11:45:47,739 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 11:45:47,740 INFO L85 PathProgramCache]: Analyzing trace with hash -1185796060, now seen corresponding path program 1 times [2024-11-22 11:45:47,740 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 11:45:47,740 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [870474819] [2024-11-22 11:45:47,740 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 11:45:47,740 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 11:45:48,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 11:45:49,234 INFO L134 CoverageAnalysis]: Checked inductivity of 5304 backedges. 51 proven. 249 refuted. 0 times theorem prover too weak. 5004 trivial. 0 not checked. [2024-11-22 11:45:49,235 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 11:45:49,235 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [870474819] [2024-11-22 11:45:49,235 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [870474819] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-22 11:45:49,235 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1696453536] [2024-11-22 11:45:49,235 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 11:45:49,235 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 11:45:49,235 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 11:45:49,237 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-22 11:45:49,239 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-22 11:45:49,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 11:45:49,472 INFO L255 TraceCheckSpWp]: Trace formula consists of 886 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-11-22 11:45:49,480 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 11:45:50,828 INFO L134 CoverageAnalysis]: Checked inductivity of 5304 backedges. 2344 proven. 249 refuted. 0 times theorem prover too weak. 2711 trivial. 0 not checked. [2024-11-22 11:45:50,829 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-22 11:45:51,789 INFO L134 CoverageAnalysis]: Checked inductivity of 5304 backedges. 51 proven. 252 refuted. 0 times theorem prover too weak. 5001 trivial. 0 not checked. [2024-11-22 11:45:51,789 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1696453536] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-22 11:45:51,789 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-22 11:45:51,789 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10, 11] total 23 [2024-11-22 11:45:51,790 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [893197863] [2024-11-22 11:45:51,790 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-22 11:45:51,790 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2024-11-22 11:45:51,791 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 11:45:51,791 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2024-11-22 11:45:51,792 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=118, Invalid=388, Unknown=0, NotChecked=0, Total=506 [2024-11-22 11:45:51,792 INFO L87 Difference]: Start difference. First operand 2231 states and 3429 transitions. Second operand has 23 states, 23 states have (on average 8.869565217391305) internal successors, (204), 23 states have internal predecessors, (204), 6 states have call successors, (156), 4 states have call predecessors, (156), 9 states have return successors, (156), 6 states have call predecessors, (156), 6 states have call successors, (156) [2024-11-22 11:45:55,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 11:45:55,624 INFO L93 Difference]: Finished difference Result 13474 states and 20527 transitions. [2024-11-22 11:45:55,624 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2024-11-22 11:45:55,625 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 8.869565217391305) internal successors, (204), 23 states have internal predecessors, (204), 6 states have call successors, (156), 4 states have call predecessors, (156), 9 states have return successors, (156), 6 states have call predecessors, (156), 6 states have call successors, (156) Word has length 353 [2024-11-22 11:45:55,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 11:45:55,671 INFO L225 Difference]: With dead ends: 13474 [2024-11-22 11:45:55,671 INFO L226 Difference]: Without dead ends: 11499 [2024-11-22 11:45:55,680 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 767 GetRequests, 702 SyntacticMatches, 0 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1336 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=989, Invalid=3433, Unknown=0, NotChecked=0, Total=4422 [2024-11-22 11:45:55,681 INFO L432 NwaCegarLoop]: 237 mSDtfsCounter, 3497 mSDsluCounter, 3158 mSDsCounter, 0 mSdLazyCounter, 2145 mSolverCounterSat, 843 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3514 SdHoareTripleChecker+Valid, 3395 SdHoareTripleChecker+Invalid, 2988 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 843 IncrementalHoareTripleChecker+Valid, 2145 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2024-11-22 11:45:55,681 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3514 Valid, 3395 Invalid, 2988 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [843 Valid, 2145 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2024-11-22 11:45:55,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11499 states. [2024-11-22 11:45:56,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11499 to 7255. [2024-11-22 11:45:56,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7255 states, 6676 states have (on average 1.5100359496704614) internal successors, (10081), 6690 states have internal predecessors, (10081), 530 states have call successors, (530), 48 states have call predecessors, (530), 48 states have return successors, (530), 516 states have call predecessors, (530), 530 states have call successors, (530) [2024-11-22 11:45:56,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7255 states to 7255 states and 11141 transitions. [2024-11-22 11:45:56,067 INFO L78 Accepts]: Start accepts. Automaton has 7255 states and 11141 transitions. Word has length 353 [2024-11-22 11:45:56,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 11:45:56,068 INFO L471 AbstractCegarLoop]: Abstraction has 7255 states and 11141 transitions. [2024-11-22 11:45:56,072 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 8.869565217391305) internal successors, (204), 23 states have internal predecessors, (204), 6 states have call successors, (156), 4 states have call predecessors, (156), 9 states have return successors, (156), 6 states have call predecessors, (156), 6 states have call successors, (156) [2024-11-22 11:45:56,072 INFO L276 IsEmpty]: Start isEmpty. Operand 7255 states and 11141 transitions. [2024-11-22 11:45:56,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 355 [2024-11-22 11:45:56,082 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 11:45:56,083 INFO L215 NwaCegarLoop]: trace histogram [52, 52, 52, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-22 11:45:56,097 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-22 11:45:56,284 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 11:45:56,284 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 11:45:56,285 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 11:45:56,285 INFO L85 PathProgramCache]: Analyzing trace with hash 907549069, now seen corresponding path program 1 times [2024-11-22 11:45:56,286 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 11:45:56,286 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [774608376] [2024-11-22 11:45:56,286 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 11:45:56,286 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 11:45:56,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 11:45:58,204 INFO L134 CoverageAnalysis]: Checked inductivity of 5304 backedges. 15 proven. 138 refuted. 0 times theorem prover too weak. 5151 trivial. 0 not checked. [2024-11-22 11:45:58,205 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 11:45:58,205 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [774608376] [2024-11-22 11:45:58,205 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [774608376] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-22 11:45:58,205 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [70518748] [2024-11-22 11:45:58,205 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 11:45:58,205 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 11:45:58,206 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 11:45:58,208 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-22 11:45:58,212 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-22 11:45:58,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 11:45:58,510 INFO L255 TraceCheckSpWp]: Trace formula consists of 886 conjuncts, 31 conjuncts are in the unsatisfiable core [2024-11-22 11:45:58,523 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 11:46:01,485 INFO L134 CoverageAnalysis]: Checked inductivity of 5304 backedges. 1539 proven. 261 refuted. 0 times theorem prover too weak. 3504 trivial. 0 not checked. [2024-11-22 11:46:01,486 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-22 11:46:16,339 WARN L249 Executor]: External (MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1) with exit command (exit)) stderr output: (error "out of memory") [2024-11-22 11:46:16,340 WARN L320 FreeRefinementEngine]: Global settings require throwing the following exception [2024-11-22 11:46:16,341 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 101 [2024-11-22 11:46:16,351 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-11-22 11:46:16,540 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 11:46:16,541 FATAL L? ?]: An unrecoverable error occured during an interaction with an SMT solver: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: External (MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:262) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parseCheckSatResult(Executor.java:281) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Scriptor.checkSat(Scriptor.java:155) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.checkSat(WrapperScript.java:163) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.checkSat(WrapperScript.java:163) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.ManagedScript.checkSat(ManagedScript.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.MonolithicImplicationChecker.checkImplication(MonolithicImplicationChecker.java:85) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier$PredicateComparison.compare(PredicateUnifier.java:912) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier$PredicateComparison.(PredicateUnifier.java:786) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate(PredicateUnifier.java:374) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate(PredicateUnifier.java:323) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp$UnifyPostprocessor.postprocess(TraceCheckSpWp.java:553) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:416) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeBackwardSequence(IterativePredicateTransformer.java:395) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeWeakestPreconditionSequence(IterativePredicateTransformer.java:267) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:324) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:180) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:159) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:108) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:267) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:407) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:342) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:324) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:426) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:312) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:273) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:167) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:143) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:167) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:150) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:127) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:233) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:227) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:144) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:319) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) Caused by: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: EOF at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser$Action$.CUP$do_action(Parser.java:1518) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser.do_action(Parser.java:701) at com.github.jhoenicke.javacup.runtime.LRParser.parse(LRParser.java:383) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:258) ... 46 more [2024-11-22 11:46:16,547 INFO L158 Benchmark]: Toolchain (without parser) took 39998.12ms. Allocated memory was 178.3MB in the beginning and 1.2GB in the end (delta: 1.0GB). Free memory was 107.1MB in the beginning and 507.1MB in the end (delta: -400.0MB). Peak memory consumption was 612.7MB. Max. memory is 16.1GB. [2024-11-22 11:46:16,547 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 178.3MB. Free memory is still 136.6MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-22 11:46:16,547 INFO L158 Benchmark]: CACSL2BoogieTranslator took 514.03ms. Allocated memory is still 178.3MB. Free memory was 107.1MB in the beginning and 142.9MB in the end (delta: -35.8MB). Peak memory consumption was 31.5MB. Max. memory is 16.1GB. [2024-11-22 11:46:16,548 INFO L158 Benchmark]: Boogie Procedure Inliner took 143.97ms. Allocated memory is still 178.3MB. Free memory was 142.9MB in the beginning and 131.5MB in the end (delta: 11.3MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2024-11-22 11:46:16,548 INFO L158 Benchmark]: Boogie Preprocessor took 124.29ms. Allocated memory is still 178.3MB. Free memory was 131.5MB in the beginning and 112.7MB in the end (delta: 18.9MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2024-11-22 11:46:16,548 INFO L158 Benchmark]: RCFGBuilder took 842.60ms. Allocated memory is still 178.3MB. Free memory was 112.7MB in the beginning and 125.3MB in the end (delta: -12.7MB). Peak memory consumption was 66.7MB. Max. memory is 16.1GB. [2024-11-22 11:46:16,548 INFO L158 Benchmark]: TraceAbstraction took 38364.95ms. Allocated memory was 178.3MB in the beginning and 1.2GB in the end (delta: 1.0GB). Free memory was 124.2MB in the beginning and 507.1MB in the end (delta: -382.9MB). Peak memory consumption was 626.8MB. Max. memory is 16.1GB. [2024-11-22 11:46:16,550 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.14ms. Allocated memory is still 178.3MB. Free memory is still 136.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 514.03ms. Allocated memory is still 178.3MB. Free memory was 107.1MB in the beginning and 142.9MB in the end (delta: -35.8MB). Peak memory consumption was 31.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 143.97ms. Allocated memory is still 178.3MB. Free memory was 142.9MB in the beginning and 131.5MB in the end (delta: 11.3MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Preprocessor took 124.29ms. Allocated memory is still 178.3MB. Free memory was 131.5MB in the beginning and 112.7MB in the end (delta: 18.9MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * RCFGBuilder took 842.60ms. Allocated memory is still 178.3MB. Free memory was 112.7MB in the beginning and 125.3MB in the end (delta: -12.7MB). Peak memory consumption was 66.7MB. Max. memory is 16.1GB. * TraceAbstraction took 38364.95ms. Allocated memory was 178.3MB in the beginning and 1.2GB in the end (delta: 1.0GB). Free memory was 124.2MB in the beginning and 507.1MB in the end (delta: -382.9MB). Peak memory consumption was 626.8MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: SMTLIBException: External (MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMTLIBException: External (MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") : de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:262) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### 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 ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount250_file-85.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.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 ca6e4c9424ce788edffc7e38265d581995e88f82a3064eb9de3661dcf45cf369 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-803cd42-m [2024-11-22 11:46:18,790 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-22 11:46:18,867 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-22 11:46:18,873 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-22 11:46:18,874 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-22 11:46:18,903 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-22 11:46:18,906 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-22 11:46:18,906 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-22 11:46:18,906 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-22 11:46:18,907 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-22 11:46:18,907 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-22 11:46:18,907 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-22 11:46:18,908 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-22 11:46:18,908 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-22 11:46:18,908 INFO L153 SettingsManager]: * Use SBE=true [2024-11-22 11:46:18,908 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-22 11:46:18,909 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-22 11:46:18,909 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-22 11:46:18,909 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-22 11:46:18,909 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-22 11:46:18,910 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-22 11:46:18,910 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-22 11:46:18,910 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-22 11:46:18,911 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-22 11:46:18,911 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-22 11:46:18,911 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-22 11:46:18,911 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-22 11:46:18,912 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-22 11:46:18,912 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-22 11:46:18,912 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-22 11:46:18,912 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-22 11:46:18,912 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-22 11:46:18,913 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-22 11:46:18,913 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-22 11:46:18,913 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-22 11:46:18,913 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-22 11:46:18,913 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-22 11:46:18,914 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-22 11:46:18,914 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-22 11:46:18,914 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-22 11:46:18,914 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-22 11:46:18,917 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-22 11:46:18,917 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-22 11:46:18,917 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-22 11:46:18,917 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 -> ca6e4c9424ce788edffc7e38265d581995e88f82a3064eb9de3661dcf45cf369 [2024-11-22 11:46:19,241 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-22 11:46:19,272 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-22 11:46:19,274 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-22 11:46:19,275 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-22 11:46:19,276 INFO L274 PluginConnector]: CDTParser initialized [2024-11-22 11:46:19,277 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount250_file-85.i [2024-11-22 11:46:20,814 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-22 11:46:21,097 INFO L384 CDTParser]: Found 1 translation units. [2024-11-22 11:46:21,098 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount250_file-85.i [2024-11-22 11:46:21,120 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/717133d97/ad78ec103341404b99ae7c8c3879a151/FLAG5d289295c [2024-11-22 11:46:21,379 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/717133d97/ad78ec103341404b99ae7c8c3879a151 [2024-11-22 11:46:21,382 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-22 11:46:21,384 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-22 11:46:21,385 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-22 11:46:21,386 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-22 11:46:21,391 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-22 11:46:21,392 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 11:46:21" (1/1) ... [2024-11-22 11:46:21,395 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6c3b0d08 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:46:21, skipping insertion in model container [2024-11-22 11:46:21,395 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 11:46:21" (1/1) ... [2024-11-22 11:46:21,437 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-22 11:46:21,608 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_operatoramount_amount250_file-85.i[916,929] [2024-11-22 11:46:21,740 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-22 11:46:21,766 INFO L200 MainTranslator]: Completed pre-run [2024-11-22 11:46:21,786 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_operatoramount_amount250_file-85.i[916,929] [2024-11-22 11:46:21,872 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-22 11:46:21,890 INFO L204 MainTranslator]: Completed translation [2024-11-22 11:46:21,891 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:46:21 WrapperNode [2024-11-22 11:46:21,891 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-22 11:46:21,892 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-22 11:46:21,892 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-22 11:46:21,892 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-22 11:46:21,897 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:46:21" (1/1) ... [2024-11-22 11:46:21,914 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:46:21" (1/1) ... [2024-11-22 11:46:21,961 INFO L138 Inliner]: procedures = 27, calls = 65, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 398 [2024-11-22 11:46:21,962 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-22 11:46:21,962 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-22 11:46:21,963 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-22 11:46:21,963 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-22 11:46:21,975 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:46:21" (1/1) ... [2024-11-22 11:46:21,975 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:46:21" (1/1) ... [2024-11-22 11:46:21,987 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:46:21" (1/1) ... [2024-11-22 11:46:22,010 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-22 11:46:22,011 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:46:21" (1/1) ... [2024-11-22 11:46:22,011 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:46:21" (1/1) ... [2024-11-22 11:46:22,032 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:46:21" (1/1) ... [2024-11-22 11:46:22,036 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:46:21" (1/1) ... [2024-11-22 11:46:22,042 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:46:21" (1/1) ... [2024-11-22 11:46:22,045 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:46:21" (1/1) ... [2024-11-22 11:46:22,052 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-22 11:46:22,053 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-22 11:46:22,053 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-22 11:46:22,053 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-22 11:46:22,054 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:46:21" (1/1) ... [2024-11-22 11:46:22,062 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-22 11:46:22,073 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 11:46:22,089 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-22 11:46:22,094 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-22 11:46:22,147 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-22 11:46:22,148 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-22 11:46:22,148 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-22 11:46:22,148 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-22 11:46:22,149 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-22 11:46:22,149 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-22 11:46:22,266 INFO L238 CfgBuilder]: Building ICFG [2024-11-22 11:46:22,268 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-22 11:46:57,996 INFO L? ?]: Removed 40 outVars from TransFormulas that were not future-live. [2024-11-22 11:46:57,996 INFO L287 CfgBuilder]: Performing block encoding [2024-11-22 11:46:58,007 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-22 11:46:58,007 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-22 11:46:58,007 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 11:46:58 BoogieIcfgContainer [2024-11-22 11:46:58,008 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-22 11:46:58,009 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-22 11:46:58,009 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-22 11:46:58,011 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-22 11:46:58,012 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.11 11:46:21" (1/3) ... [2024-11-22 11:46:58,012 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1a708da5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 11:46:58, skipping insertion in model container [2024-11-22 11:46:58,012 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:46:21" (2/3) ... [2024-11-22 11:46:58,012 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1a708da5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 11:46:58, skipping insertion in model container [2024-11-22 11:46:58,012 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 11:46:58" (3/3) ... [2024-11-22 11:46:58,013 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount250_file-85.i [2024-11-22 11:46:58,025 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-22 11:46:58,025 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-22 11:46:58,070 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-22 11:46:58,075 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;@5cb99537, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-22 11:46:58,076 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-22 11:46:58,080 INFO L276 IsEmpty]: Start isEmpty. Operand has 158 states, 103 states have (on average 1.4563106796116505) internal successors, (150), 104 states have internal predecessors, (150), 52 states have call successors, (52), 1 states have call predecessors, (52), 1 states have return successors, (52), 52 states have call predecessors, (52), 52 states have call successors, (52) [2024-11-22 11:46:58,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 340 [2024-11-22 11:46:58,109 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 11:46:58,109 INFO L215 NwaCegarLoop]: trace histogram [52, 52, 52, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-22 11:46:58,110 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 11:46:58,114 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 11:46:58,114 INFO L85 PathProgramCache]: Analyzing trace with hash 674360572, now seen corresponding path program 1 times [2024-11-22 11:46:58,124 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 11:46:58,125 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [378677549] [2024-11-22 11:46:58,125 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 11:46:58,125 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-22 11:46:58,126 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 11:46:58,131 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-22 11:46:58,132 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-11-22 11:47:00,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 11:47:00,961 INFO L255 TraceCheckSpWp]: Trace formula consists of 591 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-22 11:47:00,980 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 11:47:01,048 INFO L134 CoverageAnalysis]: Checked inductivity of 5304 backedges. 1182 proven. 0 refuted. 0 times theorem prover too weak. 4122 trivial. 0 not checked. [2024-11-22 11:47:01,049 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-22 11:47:01,051 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-22 11:47:01,051 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [378677549] [2024-11-22 11:47:01,052 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [378677549] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 11:47:01,052 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 11:47:01,052 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-22 11:47:01,054 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [801500978] [2024-11-22 11:47:01,055 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 11:47:01,059 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-22 11:47:01,060 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-22 11:47:01,086 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-22 11:47:01,087 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-22 11:47:01,090 INFO L87 Difference]: Start difference. First operand has 158 states, 103 states have (on average 1.4563106796116505) internal successors, (150), 104 states have internal predecessors, (150), 52 states have call successors, (52), 1 states have call predecessors, (52), 1 states have return successors, (52), 52 states have call predecessors, (52), 52 states have call successors, (52) Second operand has 2 states, 2 states have (on average 43.0) internal successors, (86), 2 states have internal predecessors, (86), 2 states have call successors, (52), 2 states have call predecessors, (52), 2 states have return successors, (52), 2 states have call predecessors, (52), 2 states have call successors, (52) [2024-11-22 11:47:01,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 11:47:01,135 INFO L93 Difference]: Finished difference Result 309 states and 554 transitions. [2024-11-22 11:47:01,136 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-22 11:47:01,137 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 43.0) internal successors, (86), 2 states have internal predecessors, (86), 2 states have call successors, (52), 2 states have call predecessors, (52), 2 states have return successors, (52), 2 states have call predecessors, (52), 2 states have call successors, (52) Word has length 339 [2024-11-22 11:47:01,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 11:47:01,147 INFO L225 Difference]: With dead ends: 309 [2024-11-22 11:47:01,147 INFO L226 Difference]: Without dead ends: 154 [2024-11-22 11:47:01,151 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 338 GetRequests, 338 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-22 11:47:01,153 INFO L432 NwaCegarLoop]: 247 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 247 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-22 11:47:01,153 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 247 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-22 11:47:01,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2024-11-22 11:47:01,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 154. [2024-11-22 11:47:01,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 154 states, 100 states have (on average 1.43) internal successors, (143), 100 states have internal predecessors, (143), 52 states have call successors, (52), 1 states have call predecessors, (52), 1 states have return successors, (52), 52 states have call predecessors, (52), 52 states have call successors, (52) [2024-11-22 11:47:01,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 247 transitions. [2024-11-22 11:47:01,193 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 247 transitions. Word has length 339 [2024-11-22 11:47:01,193 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 11:47:01,194 INFO L471 AbstractCegarLoop]: Abstraction has 154 states and 247 transitions. [2024-11-22 11:47:01,194 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 43.0) internal successors, (86), 2 states have internal predecessors, (86), 2 states have call successors, (52), 2 states have call predecessors, (52), 2 states have return successors, (52), 2 states have call predecessors, (52), 2 states have call successors, (52) [2024-11-22 11:47:01,194 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 247 transitions. [2024-11-22 11:47:01,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 340 [2024-11-22 11:47:01,198 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 11:47:01,199 INFO L215 NwaCegarLoop]: trace histogram [52, 52, 52, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-22 11:47:01,271 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2024-11-22 11:47:01,402 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-22 11:47:01,403 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 11:47:01,403 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 11:47:01,403 INFO L85 PathProgramCache]: Analyzing trace with hash 1164952692, now seen corresponding path program 1 times [2024-11-22 11:47:01,404 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 11:47:01,404 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1099365398] [2024-11-22 11:47:01,405 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 11:47:01,405 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-22 11:47:01,405 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 11:47:01,407 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-22 11:47:01,408 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process