./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-56.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_floatingpointinfluence_no-floats_file-56.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 97d791cbaec134197a8e3d1f03f35ec97aa0c52c94b35e8b29d7fd873617c9b5 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-803cd42-m [2024-11-22 10:09:08,962 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-22 10:09:09,037 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-22 10:09:09,043 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-22 10:09:09,044 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-22 10:09:09,068 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-22 10:09:09,070 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-22 10:09:09,070 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-22 10:09:09,071 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-22 10:09:09,072 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-22 10:09:09,073 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-22 10:09:09,073 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-22 10:09:09,074 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-22 10:09:09,074 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-22 10:09:09,075 INFO L153 SettingsManager]: * Use SBE=true [2024-11-22 10:09:09,076 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-22 10:09:09,076 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-22 10:09:09,078 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-22 10:09:09,079 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-22 10:09:09,079 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-22 10:09:09,079 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-22 10:09:09,083 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-22 10:09:09,083 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-22 10:09:09,084 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-22 10:09:09,084 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-22 10:09:09,084 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-22 10:09:09,084 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-22 10:09:09,084 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-22 10:09:09,085 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-22 10:09:09,085 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-22 10:09:09,085 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-22 10:09:09,085 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-22 10:09:09,085 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-22 10:09:09,086 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-22 10:09:09,086 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-22 10:09:09,086 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-22 10:09:09,088 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-22 10:09:09,088 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-22 10:09:09,088 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-22 10:09:09,089 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-22 10:09:09,089 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-22 10:09:09,089 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-22 10:09:09,090 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 -> 97d791cbaec134197a8e3d1f03f35ec97aa0c52c94b35e8b29d7fd873617c9b5 [2024-11-22 10:09:09,333 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-22 10:09:09,358 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-22 10:09:09,361 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-22 10:09:09,362 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-22 10:09:09,363 INFO L274 PluginConnector]: CDTParser initialized [2024-11-22 10:09:09,364 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-56.i [2024-11-22 10:09:10,819 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-22 10:09:11,043 INFO L384 CDTParser]: Found 1 translation units. [2024-11-22 10:09:11,044 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-56.i [2024-11-22 10:09:11,056 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b5cd6f4fb/28c08e90a0744dec83ace0472488e3ae/FLAGbb8fcd901 [2024-11-22 10:09:11,075 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b5cd6f4fb/28c08e90a0744dec83ace0472488e3ae [2024-11-22 10:09:11,078 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-22 10:09:11,079 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-22 10:09:11,082 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-22 10:09:11,082 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-22 10:09:11,088 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-22 10:09:11,089 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 10:09:11" (1/1) ... [2024-11-22 10:09:11,092 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2719e741 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:09:11, skipping insertion in model container [2024-11-22 10:09:11,092 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 10:09:11" (1/1) ... [2024-11-22 10:09:11,118 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-22 10:09:11,268 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_floatingpointinfluence_no-floats_file-56.i[916,929] [2024-11-22 10:09:11,322 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-22 10:09:11,330 INFO L200 MainTranslator]: Completed pre-run [2024-11-22 10:09:11,342 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_floatingpointinfluence_no-floats_file-56.i[916,929] [2024-11-22 10:09:11,366 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-22 10:09:11,390 INFO L204 MainTranslator]: Completed translation [2024-11-22 10:09:11,391 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:09:11 WrapperNode [2024-11-22 10:09:11,391 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-22 10:09:11,392 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-22 10:09:11,393 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-22 10:09:11,393 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-22 10:09:11,433 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:09:11" (1/1) ... [2024-11-22 10:09:11,460 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:09:11" (1/1) ... [2024-11-22 10:09:11,556 INFO L138 Inliner]: procedures = 26, calls = 33, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 158 [2024-11-22 10:09:11,560 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-22 10:09:11,561 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-22 10:09:11,561 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-22 10:09:11,562 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-22 10:09:11,573 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:09:11" (1/1) ... [2024-11-22 10:09:11,574 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:09:11" (1/1) ... [2024-11-22 10:09:11,577 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:09:11" (1/1) ... [2024-11-22 10:09:11,606 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 10:09:11,607 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:09:11" (1/1) ... [2024-11-22 10:09:11,607 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:09:11" (1/1) ... [2024-11-22 10:09:11,616 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:09:11" (1/1) ... [2024-11-22 10:09:11,620 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:09:11" (1/1) ... [2024-11-22 10:09:11,622 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:09:11" (1/1) ... [2024-11-22 10:09:11,624 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:09:11" (1/1) ... [2024-11-22 10:09:11,629 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-22 10:09:11,630 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-22 10:09:11,630 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-22 10:09:11,630 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-22 10:09:11,631 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:09:11" (1/1) ... [2024-11-22 10:09:11,643 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-22 10:09:11,655 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 10:09:11,672 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 10:09:11,676 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 10:09:11,725 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-22 10:09:11,726 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-22 10:09:11,727 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-22 10:09:11,727 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-22 10:09:11,727 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-22 10:09:11,727 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-22 10:09:11,802 INFO L238 CfgBuilder]: Building ICFG [2024-11-22 10:09:11,805 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-22 10:09:12,243 INFO L? ?]: Removed 16 outVars from TransFormulas that were not future-live. [2024-11-22 10:09:12,244 INFO L287 CfgBuilder]: Performing block encoding [2024-11-22 10:09:12,256 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-22 10:09:12,258 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-22 10:09:12,258 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 10:09:12 BoogieIcfgContainer [2024-11-22 10:09:12,259 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-22 10:09:12,261 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-22 10:09:12,262 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-22 10:09:12,266 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-22 10:09:12,266 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.11 10:09:11" (1/3) ... [2024-11-22 10:09:12,267 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5f0d288a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 10:09:12, skipping insertion in model container [2024-11-22 10:09:12,268 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:09:11" (2/3) ... [2024-11-22 10:09:12,268 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5f0d288a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 10:09:12, skipping insertion in model container [2024-11-22 10:09:12,269 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 10:09:12" (3/3) ... [2024-11-22 10:09:12,270 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_floatingpointinfluence_no-floats_file-56.i [2024-11-22 10:09:12,283 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-22 10:09:12,283 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-22 10:09:12,345 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-22 10:09:12,351 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;@6b0ea290, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-22 10:09:12,351 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-22 10:09:12,355 INFO L276 IsEmpty]: Start isEmpty. Operand has 72 states, 49 states have (on average 1.3877551020408163) internal successors, (68), 50 states have internal predecessors, (68), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-11-22 10:09:12,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2024-11-22 10:09:12,367 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 10:09:12,368 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 10:09:12,368 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 10:09:12,373 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 10:09:12,373 INFO L85 PathProgramCache]: Analyzing trace with hash 1263507775, now seen corresponding path program 1 times [2024-11-22 10:09:12,383 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 10:09:12,383 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1338003259] [2024-11-22 10:09:12,384 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 10:09:12,384 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 10:09:12,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 10:09:12,720 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 38 refuted. 0 times theorem prover too weak. 722 trivial. 0 not checked. [2024-11-22 10:09:12,721 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 10:09:12,722 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1338003259] [2024-11-22 10:09:12,723 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1338003259] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-22 10:09:12,723 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1759888887] [2024-11-22 10:09:12,723 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 10:09:12,724 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 10:09:12,724 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 10:09:12,727 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 10:09:12,729 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 10:09:12,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 10:09:12,874 INFO L255 TraceCheckSpWp]: Trace formula consists of 289 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-22 10:09:12,890 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 10:09:12,933 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 38 proven. 0 refuted. 0 times theorem prover too weak. 722 trivial. 0 not checked. [2024-11-22 10:09:12,936 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-22 10:09:12,937 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1759888887] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 10:09:12,937 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-22 10:09:12,937 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2024-11-22 10:09:12,939 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1486736152] [2024-11-22 10:09:12,940 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 10:09:12,945 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-22 10:09:12,946 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 10:09:12,973 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-22 10:09:12,974 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-22 10:09:12,976 INFO L87 Difference]: Start difference. First operand has 72 states, 49 states have (on average 1.3877551020408163) internal successors, (68), 50 states have internal predecessors, (68), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) Second operand has 2 states, 2 states have (on average 17.0) internal successors, (34), 2 states have internal predecessors, (34), 2 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) [2024-11-22 10:09:13,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 10:09:13,013 INFO L93 Difference]: Finished difference Result 137 states and 230 transitions. [2024-11-22 10:09:13,014 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-22 10:09:13,016 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 17.0) internal successors, (34), 2 states have internal predecessors, (34), 2 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) Word has length 129 [2024-11-22 10:09:13,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 10:09:13,024 INFO L225 Difference]: With dead ends: 137 [2024-11-22 10:09:13,025 INFO L226 Difference]: Without dead ends: 68 [2024-11-22 10:09:13,029 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 130 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 10:09:13,034 INFO L432 NwaCegarLoop]: 101 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, 101 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 10:09:13,035 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 101 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-22 10:09:13,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2024-11-22 10:09:13,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2024-11-22 10:09:13,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 46 states have (on average 1.326086956521739) internal successors, (61), 46 states have internal predecessors, (61), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-11-22 10:09:13,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 101 transitions. [2024-11-22 10:09:13,080 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 101 transitions. Word has length 129 [2024-11-22 10:09:13,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 10:09:13,080 INFO L471 AbstractCegarLoop]: Abstraction has 68 states and 101 transitions. [2024-11-22 10:09:13,081 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 17.0) internal successors, (34), 2 states have internal predecessors, (34), 2 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) [2024-11-22 10:09:13,081 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 101 transitions. [2024-11-22 10:09:13,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2024-11-22 10:09:13,084 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 10:09:13,084 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 10:09:13,092 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-11-22 10:09:13,285 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 10:09:13,286 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 10:09:13,286 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 10:09:13,287 INFO L85 PathProgramCache]: Analyzing trace with hash -28114625, now seen corresponding path program 1 times [2024-11-22 10:09:13,287 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 10:09:13,287 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1511311391] [2024-11-22 10:09:13,287 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 10:09:13,287 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 10:09:13,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 10:09:15,440 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-22 10:09:15,440 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 10:09:15,441 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1511311391] [2024-11-22 10:09:15,441 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1511311391] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 10:09:15,441 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 10:09:15,441 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-22 10:09:15,442 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [276892989] [2024-11-22 10:09:15,442 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 10:09:15,443 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-22 10:09:15,443 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 10:09:15,444 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-22 10:09:15,444 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2024-11-22 10:09:15,444 INFO L87 Difference]: Start difference. First operand 68 states and 101 transitions. Second operand has 8 states, 8 states have (on average 4.0) internal successors, (32), 8 states have internal predecessors, (32), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-22 10:09:15,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 10:09:15,834 INFO L93 Difference]: Finished difference Result 208 states and 302 transitions. [2024-11-22 10:09:15,837 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-22 10:09:15,838 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.0) internal successors, (32), 8 states have internal predecessors, (32), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 129 [2024-11-22 10:09:15,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 10:09:15,840 INFO L225 Difference]: With dead ends: 208 [2024-11-22 10:09:15,840 INFO L226 Difference]: Without dead ends: 143 [2024-11-22 10:09:15,844 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2024-11-22 10:09:15,845 INFO L432 NwaCegarLoop]: 92 mSDtfsCounter, 116 mSDsluCounter, 293 mSDsCounter, 0 mSdLazyCounter, 176 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 116 SdHoareTripleChecker+Valid, 385 SdHoareTripleChecker+Invalid, 177 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 176 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-22 10:09:15,845 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [116 Valid, 385 Invalid, 177 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 176 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-22 10:09:15,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2024-11-22 10:09:15,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 81. [2024-11-22 10:09:15,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 59 states have (on average 1.3898305084745763) internal successors, (82), 59 states have internal predecessors, (82), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-11-22 10:09:15,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 122 transitions. [2024-11-22 10:09:15,867 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 122 transitions. Word has length 129 [2024-11-22 10:09:15,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 10:09:15,868 INFO L471 AbstractCegarLoop]: Abstraction has 81 states and 122 transitions. [2024-11-22 10:09:15,869 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.0) internal successors, (32), 8 states have internal predecessors, (32), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-22 10:09:15,869 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 122 transitions. [2024-11-22 10:09:15,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2024-11-22 10:09:15,871 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 10:09:15,871 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 10:09:15,871 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-22 10:09:15,872 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 10:09:15,872 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 10:09:15,872 INFO L85 PathProgramCache]: Analyzing trace with hash -286280063, now seen corresponding path program 1 times [2024-11-22 10:09:15,873 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 10:09:15,873 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1836230620] [2024-11-22 10:09:15,873 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 10:09:15,873 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 10:09:15,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 10:09:27,395 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-22 10:09:27,396 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 10:09:27,396 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1836230620] [2024-11-22 10:09:27,396 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1836230620] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 10:09:27,397 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 10:09:27,397 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-22 10:09:27,398 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [964306726] [2024-11-22 10:09:27,398 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 10:09:27,398 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-22 10:09:27,401 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 10:09:27,401 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-22 10:09:27,402 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-22 10:09:27,402 INFO L87 Difference]: Start difference. First operand 81 states and 122 transitions. Second operand has 7 states, 7 states have (on average 4.571428571428571) internal successors, (32), 7 states have internal predecessors, (32), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-22 10:09:27,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 10:09:27,697 INFO L93 Difference]: Finished difference Result 206 states and 304 transitions. [2024-11-22 10:09:27,703 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-22 10:09:27,704 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.571428571428571) internal successors, (32), 7 states have internal predecessors, (32), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 129 [2024-11-22 10:09:27,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 10:09:27,706 INFO L225 Difference]: With dead ends: 206 [2024-11-22 10:09:27,706 INFO L226 Difference]: Without dead ends: 128 [2024-11-22 10:09:27,707 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2024-11-22 10:09:27,711 INFO L432 NwaCegarLoop]: 90 mSDtfsCounter, 114 mSDsluCounter, 173 mSDsCounter, 0 mSdLazyCounter, 147 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 114 SdHoareTripleChecker+Valid, 263 SdHoareTripleChecker+Invalid, 151 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 147 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-22 10:09:27,712 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [114 Valid, 263 Invalid, 151 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 147 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-22 10:09:27,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2024-11-22 10:09:27,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 82. [2024-11-22 10:09:27,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 60 states have (on average 1.4) internal successors, (84), 60 states have internal predecessors, (84), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-11-22 10:09:27,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 124 transitions. [2024-11-22 10:09:27,730 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 124 transitions. Word has length 129 [2024-11-22 10:09:27,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 10:09:27,731 INFO L471 AbstractCegarLoop]: Abstraction has 82 states and 124 transitions. [2024-11-22 10:09:27,731 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.571428571428571) internal successors, (32), 7 states have internal predecessors, (32), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-22 10:09:27,731 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 124 transitions. [2024-11-22 10:09:27,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2024-11-22 10:09:27,733 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 10:09:27,733 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 10:09:27,735 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-22 10:09:27,735 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 10:09:27,736 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 10:09:27,736 INFO L85 PathProgramCache]: Analyzing trace with hash -614920639, now seen corresponding path program 1 times [2024-11-22 10:09:27,736 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 10:09:27,737 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1589117395] [2024-11-22 10:09:27,737 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 10:09:27,737 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 10:09:27,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 10:09:27,804 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-22 10:09:27,805 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 10:09:27,805 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1589117395] [2024-11-22 10:09:27,805 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1589117395] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 10:09:27,805 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 10:09:27,805 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-22 10:09:27,805 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1898124479] [2024-11-22 10:09:27,805 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 10:09:27,806 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-22 10:09:27,806 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 10:09:27,807 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-22 10:09:27,807 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-22 10:09:27,810 INFO L87 Difference]: Start difference. First operand 82 states and 124 transitions. Second operand has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-22 10:09:27,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 10:09:27,838 INFO L93 Difference]: Finished difference Result 162 states and 247 transitions. [2024-11-22 10:09:27,838 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-22 10:09:27,839 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 129 [2024-11-22 10:09:27,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 10:09:27,840 INFO L225 Difference]: With dead ends: 162 [2024-11-22 10:09:27,840 INFO L226 Difference]: Without dead ends: 83 [2024-11-22 10:09:27,841 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 10:09:27,842 INFO L432 NwaCegarLoop]: 100 mSDtfsCounter, 0 mSDsluCounter, 88 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 188 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-22 10:09:27,842 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 188 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-22 10:09:27,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2024-11-22 10:09:27,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2024-11-22 10:09:27,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 61 states have (on average 1.3934426229508197) internal successors, (85), 61 states have internal predecessors, (85), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-11-22 10:09:27,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 125 transitions. [2024-11-22 10:09:27,856 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 125 transitions. Word has length 129 [2024-11-22 10:09:27,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 10:09:27,858 INFO L471 AbstractCegarLoop]: Abstraction has 83 states and 125 transitions. [2024-11-22 10:09:27,858 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-22 10:09:27,858 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 125 transitions. [2024-11-22 10:09:27,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2024-11-22 10:09:27,861 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 10:09:27,861 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 10:09:27,861 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-22 10:09:27,861 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 10:09:27,862 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 10:09:27,862 INFO L85 PathProgramCache]: Analyzing trace with hash 264567491, now seen corresponding path program 1 times [2024-11-22 10:09:27,862 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 10:09:27,862 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [540859438] [2024-11-22 10:09:27,862 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 10:09:27,863 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 10:09:27,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 10:09:27,931 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-22 10:09:27,932 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 10:09:27,932 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [540859438] [2024-11-22 10:09:27,932 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [540859438] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 10:09:27,932 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 10:09:27,933 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-22 10:09:27,933 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1916543024] [2024-11-22 10:09:27,933 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 10:09:27,934 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-22 10:09:27,935 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 10:09:27,936 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-22 10:09:27,936 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-22 10:09:27,936 INFO L87 Difference]: Start difference. First operand 83 states and 125 transitions. Second operand has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-22 10:09:27,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 10:09:27,975 INFO L93 Difference]: Finished difference Result 191 states and 288 transitions. [2024-11-22 10:09:27,976 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-22 10:09:27,976 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 130 [2024-11-22 10:09:27,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 10:09:27,978 INFO L225 Difference]: With dead ends: 191 [2024-11-22 10:09:27,979 INFO L226 Difference]: Without dead ends: 111 [2024-11-22 10:09:27,980 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 10:09:27,983 INFO L432 NwaCegarLoop]: 94 mSDtfsCounter, 33 mSDsluCounter, 81 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 175 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-22 10:09:27,983 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 175 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-22 10:09:27,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2024-11-22 10:09:27,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 97. [2024-11-22 10:09:27,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 75 states have (on average 1.4266666666666667) internal successors, (107), 75 states have internal predecessors, (107), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-11-22 10:09:27,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 147 transitions. [2024-11-22 10:09:27,991 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 147 transitions. Word has length 130 [2024-11-22 10:09:27,991 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 10:09:27,991 INFO L471 AbstractCegarLoop]: Abstraction has 97 states and 147 transitions. [2024-11-22 10:09:27,991 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-22 10:09:27,991 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 147 transitions. [2024-11-22 10:09:27,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2024-11-22 10:09:27,993 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 10:09:27,993 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 10:09:27,993 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-22 10:09:27,994 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 10:09:27,994 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 10:09:27,994 INFO L85 PathProgramCache]: Analyzing trace with hash -1286733109, now seen corresponding path program 1 times [2024-11-22 10:09:27,994 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 10:09:27,995 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1029347001] [2024-11-22 10:09:27,995 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 10:09:27,995 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 10:09:28,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 10:09:28,060 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-22 10:09:28,060 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 10:09:28,060 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1029347001] [2024-11-22 10:09:28,063 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1029347001] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 10:09:28,065 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 10:09:28,065 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-22 10:09:28,065 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [992234482] [2024-11-22 10:09:28,066 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 10:09:28,066 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-22 10:09:28,066 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 10:09:28,067 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-22 10:09:28,067 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-22 10:09:28,067 INFO L87 Difference]: Start difference. First operand 97 states and 147 transitions. Second operand has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-22 10:09:28,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 10:09:28,112 INFO L93 Difference]: Finished difference Result 205 states and 308 transitions. [2024-11-22 10:09:28,113 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-22 10:09:28,114 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 130 [2024-11-22 10:09:28,114 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 10:09:28,115 INFO L225 Difference]: With dead ends: 205 [2024-11-22 10:09:28,115 INFO L226 Difference]: Without dead ends: 111 [2024-11-22 10:09:28,116 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 10:09:28,117 INFO L432 NwaCegarLoop]: 128 mSDtfsCounter, 33 mSDsluCounter, 83 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 211 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-22 10:09:28,117 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 211 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-22 10:09:28,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2024-11-22 10:09:28,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 85. [2024-11-22 10:09:28,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 63 states have (on average 1.3492063492063493) internal successors, (85), 63 states have internal predecessors, (85), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-11-22 10:09:28,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 125 transitions. [2024-11-22 10:09:28,127 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 125 transitions. Word has length 130 [2024-11-22 10:09:28,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 10:09:28,128 INFO L471 AbstractCegarLoop]: Abstraction has 85 states and 125 transitions. [2024-11-22 10:09:28,128 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-22 10:09:28,128 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 125 transitions. [2024-11-22 10:09:28,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2024-11-22 10:09:28,130 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 10:09:28,130 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 10:09:28,130 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-22 10:09:28,131 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 10:09:28,131 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 10:09:28,131 INFO L85 PathProgramCache]: Analyzing trace with hash 666490608, now seen corresponding path program 1 times [2024-11-22 10:09:28,131 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 10:09:28,132 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [457003323] [2024-11-22 10:09:28,132 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 10:09:28,132 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 10:09:28,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 10:09:28,502 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-22 10:09:28,502 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 10:09:28,502 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [457003323] [2024-11-22 10:09:28,503 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [457003323] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 10:09:28,503 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 10:09:28,503 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-22 10:09:28,503 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1096731248] [2024-11-22 10:09:28,503 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 10:09:28,504 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-22 10:09:28,504 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 10:09:28,504 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-22 10:09:28,504 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-11-22 10:09:28,505 INFO L87 Difference]: Start difference. First operand 85 states and 125 transitions. Second operand has 8 states, 8 states have (on average 4.25) internal successors, (34), 8 states have internal predecessors, (34), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-22 10:09:28,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 10:09:28,748 INFO L93 Difference]: Finished difference Result 201 states and 283 transitions. [2024-11-22 10:09:28,749 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-22 10:09:28,749 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.25) internal successors, (34), 8 states have internal predecessors, (34), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 131 [2024-11-22 10:09:28,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 10:09:28,751 INFO L225 Difference]: With dead ends: 201 [2024-11-22 10:09:28,751 INFO L226 Difference]: Without dead ends: 199 [2024-11-22 10:09:28,751 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2024-11-22 10:09:28,752 INFO L432 NwaCegarLoop]: 92 mSDtfsCounter, 163 mSDsluCounter, 474 mSDsCounter, 0 mSdLazyCounter, 125 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 163 SdHoareTripleChecker+Valid, 566 SdHoareTripleChecker+Invalid, 161 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 125 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-22 10:09:28,753 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [163 Valid, 566 Invalid, 161 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 125 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-22 10:09:28,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states. [2024-11-22 10:09:28,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 156. [2024-11-22 10:09:28,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 156 states, 117 states have (on average 1.2905982905982907) internal successors, (151), 118 states have internal predecessors, (151), 36 states have call successors, (36), 2 states have call predecessors, (36), 2 states have return successors, (36), 35 states have call predecessors, (36), 36 states have call successors, (36) [2024-11-22 10:09:28,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 223 transitions. [2024-11-22 10:09:28,767 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 223 transitions. Word has length 131 [2024-11-22 10:09:28,767 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 10:09:28,767 INFO L471 AbstractCegarLoop]: Abstraction has 156 states and 223 transitions. [2024-11-22 10:09:28,767 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.25) internal successors, (34), 8 states have internal predecessors, (34), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-22 10:09:28,768 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 223 transitions. [2024-11-22 10:09:28,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2024-11-22 10:09:28,769 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 10:09:28,769 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 10:09:28,770 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-22 10:09:28,770 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 10:09:28,770 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 10:09:28,770 INFO L85 PathProgramCache]: Analyzing trace with hash 991949014, now seen corresponding path program 1 times [2024-11-22 10:09:28,771 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 10:09:28,771 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1147836972] [2024-11-22 10:09:28,771 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 10:09:28,771 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 10:09:28,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 10:09:38,756 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-22 10:09:38,756 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 10:09:38,756 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1147836972] [2024-11-22 10:09:38,756 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1147836972] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 10:09:38,756 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 10:09:38,756 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-22 10:09:38,757 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1406648576] [2024-11-22 10:09:38,757 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 10:09:38,757 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-22 10:09:38,757 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 10:09:38,758 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-22 10:09:38,758 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2024-11-22 10:09:38,758 INFO L87 Difference]: Start difference. First operand 156 states and 223 transitions. Second operand has 10 states, 10 states have (on average 3.4) internal successors, (34), 10 states have internal predecessors, (34), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-22 10:09:39,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 10:09:39,546 INFO L93 Difference]: Finished difference Result 534 states and 765 transitions. [2024-11-22 10:09:39,547 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-22 10:09:39,547 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.4) internal successors, (34), 10 states have internal predecessors, (34), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 131 [2024-11-22 10:09:39,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 10:09:39,555 INFO L225 Difference]: With dead ends: 534 [2024-11-22 10:09:39,555 INFO L226 Difference]: Without dead ends: 381 [2024-11-22 10:09:39,556 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=64, Invalid=118, Unknown=0, NotChecked=0, Total=182 [2024-11-22 10:09:39,560 INFO L432 NwaCegarLoop]: 81 mSDtfsCounter, 232 mSDsluCounter, 273 mSDsCounter, 0 mSdLazyCounter, 375 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 232 SdHoareTripleChecker+Valid, 354 SdHoareTripleChecker+Invalid, 381 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 375 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-22 10:09:39,561 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [232 Valid, 354 Invalid, 381 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 375 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-22 10:09:39,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 381 states. [2024-11-22 10:09:39,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 381 to 303. [2024-11-22 10:09:39,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 303 states, 226 states have (on average 1.3008849557522124) internal successors, (294), 228 states have internal predecessors, (294), 72 states have call successors, (72), 4 states have call predecessors, (72), 4 states have return successors, (72), 70 states have call predecessors, (72), 72 states have call successors, (72) [2024-11-22 10:09:39,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 303 states to 303 states and 438 transitions. [2024-11-22 10:09:39,604 INFO L78 Accepts]: Start accepts. Automaton has 303 states and 438 transitions. Word has length 131 [2024-11-22 10:09:39,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 10:09:39,605 INFO L471 AbstractCegarLoop]: Abstraction has 303 states and 438 transitions. [2024-11-22 10:09:39,605 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.4) internal successors, (34), 10 states have internal predecessors, (34), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-22 10:09:39,605 INFO L276 IsEmpty]: Start isEmpty. Operand 303 states and 438 transitions. [2024-11-22 10:09:39,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2024-11-22 10:09:39,607 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 10:09:39,607 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 10:09:39,607 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-22 10:09:39,607 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 10:09:39,608 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 10:09:39,608 INFO L85 PathProgramCache]: Analyzing trace with hash 2003066264, now seen corresponding path program 1 times [2024-11-22 10:09:39,608 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 10:09:39,608 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1041692185] [2024-11-22 10:09:39,609 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 10:09:39,609 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 10:09:39,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 10:09:43,125 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-22 10:09:43,125 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 10:09:43,126 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1041692185] [2024-11-22 10:09:43,126 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1041692185] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 10:09:43,126 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 10:09:43,126 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-22 10:09:43,126 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1680196398] [2024-11-22 10:09:43,126 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 10:09:43,127 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-22 10:09:43,127 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 10:09:43,127 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-22 10:09:43,128 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2024-11-22 10:09:43,128 INFO L87 Difference]: Start difference. First operand 303 states and 438 transitions. Second operand has 11 states, 11 states have (on average 3.090909090909091) internal successors, (34), 11 states have internal predecessors, (34), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-22 10:09:44,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 10:09:44,131 INFO L93 Difference]: Finished difference Result 635 states and 884 transitions. [2024-11-22 10:09:44,131 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-22 10:09:44,131 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.090909090909091) internal successors, (34), 11 states have internal predecessors, (34), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 131 [2024-11-22 10:09:44,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 10:09:44,135 INFO L225 Difference]: With dead ends: 635 [2024-11-22 10:09:44,135 INFO L226 Difference]: Without dead ends: 482 [2024-11-22 10:09:44,137 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=96, Invalid=284, Unknown=0, NotChecked=0, Total=380 [2024-11-22 10:09:44,138 INFO L432 NwaCegarLoop]: 106 mSDtfsCounter, 390 mSDsluCounter, 550 mSDsCounter, 0 mSdLazyCounter, 438 mSolverCounterSat, 65 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 390 SdHoareTripleChecker+Valid, 656 SdHoareTripleChecker+Invalid, 503 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Valid, 438 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-22 10:09:44,139 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [390 Valid, 656 Invalid, 503 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [65 Valid, 438 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-22 10:09:44,139 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 482 states. [2024-11-22 10:09:44,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 482 to 318. [2024-11-22 10:09:44,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 318 states, 241 states have (on average 1.3153526970954357) internal successors, (317), 243 states have internal predecessors, (317), 72 states have call successors, (72), 4 states have call predecessors, (72), 4 states have return successors, (72), 70 states have call predecessors, (72), 72 states have call successors, (72) [2024-11-22 10:09:44,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 318 states to 318 states and 461 transitions. [2024-11-22 10:09:44,174 INFO L78 Accepts]: Start accepts. Automaton has 318 states and 461 transitions. Word has length 131 [2024-11-22 10:09:44,174 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 10:09:44,175 INFO L471 AbstractCegarLoop]: Abstraction has 318 states and 461 transitions. [2024-11-22 10:09:44,175 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.090909090909091) internal successors, (34), 11 states have internal predecessors, (34), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-22 10:09:44,175 INFO L276 IsEmpty]: Start isEmpty. Operand 318 states and 461 transitions. [2024-11-22 10:09:44,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2024-11-22 10:09:44,176 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 10:09:44,177 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 10:09:44,177 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-22 10:09:44,177 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 10:09:44,177 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 10:09:44,178 INFO L85 PathProgramCache]: Analyzing trace with hash 913217401, now seen corresponding path program 1 times [2024-11-22 10:09:44,178 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 10:09:44,178 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1301339209] [2024-11-22 10:09:44,178 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 10:09:44,178 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 10:09:44,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 10:09:44,224 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-22 10:09:44,224 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 10:09:44,224 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1301339209] [2024-11-22 10:09:44,224 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1301339209] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 10:09:44,225 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 10:09:44,225 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-22 10:09:44,225 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1854452448] [2024-11-22 10:09:44,225 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 10:09:44,226 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-22 10:09:44,226 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 10:09:44,227 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-22 10:09:44,227 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-22 10:09:44,227 INFO L87 Difference]: Start difference. First operand 318 states and 461 transitions. Second operand has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-22 10:09:44,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 10:09:44,262 INFO L93 Difference]: Finished difference Result 633 states and 919 transitions. [2024-11-22 10:09:44,263 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-22 10:09:44,263 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 131 [2024-11-22 10:09:44,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 10:09:44,265 INFO L225 Difference]: With dead ends: 633 [2024-11-22 10:09:44,266 INFO L226 Difference]: Without dead ends: 318 [2024-11-22 10:09:44,267 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 10:09:44,267 INFO L432 NwaCegarLoop]: 100 mSDtfsCounter, 0 mSDsluCounter, 88 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 188 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-22 10:09:44,267 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 188 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-22 10:09:44,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 318 states. [2024-11-22 10:09:44,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 318 to 318. [2024-11-22 10:09:44,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 318 states, 241 states have (on average 1.3070539419087137) internal successors, (315), 243 states have internal predecessors, (315), 72 states have call successors, (72), 4 states have call predecessors, (72), 4 states have return successors, (72), 70 states have call predecessors, (72), 72 states have call successors, (72) [2024-11-22 10:09:44,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 318 states to 318 states and 459 transitions. [2024-11-22 10:09:44,297 INFO L78 Accepts]: Start accepts. Automaton has 318 states and 459 transitions. Word has length 131 [2024-11-22 10:09:44,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 10:09:44,298 INFO L471 AbstractCegarLoop]: Abstraction has 318 states and 459 transitions. [2024-11-22 10:09:44,298 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-22 10:09:44,298 INFO L276 IsEmpty]: Start isEmpty. Operand 318 states and 459 transitions. [2024-11-22 10:09:44,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2024-11-22 10:09:44,299 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 10:09:44,299 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 10:09:44,300 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-22 10:09:44,300 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 10:09:44,300 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 10:09:44,300 INFO L85 PathProgramCache]: Analyzing trace with hash -97899849, now seen corresponding path program 1 times [2024-11-22 10:09:44,301 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 10:09:44,301 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1154636103] [2024-11-22 10:09:44,301 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 10:09:44,301 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 10:09:44,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 10:09:50,555 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-22 10:09:50,555 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 10:09:50,555 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1154636103] [2024-11-22 10:09:50,556 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1154636103] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 10:09:50,556 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 10:09:50,556 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-22 10:09:50,556 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [767568396] [2024-11-22 10:09:50,556 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 10:09:50,557 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-22 10:09:50,557 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 10:09:50,557 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-22 10:09:50,558 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-22 10:09:50,558 INFO L87 Difference]: Start difference. First operand 318 states and 459 transitions. Second operand has 7 states, 7 states have (on average 4.857142857142857) internal successors, (34), 7 states have internal predecessors, (34), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-22 10:09:50,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 10:09:50,980 INFO L93 Difference]: Finished difference Result 764 states and 1080 transitions. [2024-11-22 10:09:50,981 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-22 10:09:50,981 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.857142857142857) internal successors, (34), 7 states have internal predecessors, (34), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 131 [2024-11-22 10:09:50,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 10:09:50,985 INFO L225 Difference]: With dead ends: 764 [2024-11-22 10:09:50,985 INFO L226 Difference]: Without dead ends: 449 [2024-11-22 10:09:50,986 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2024-11-22 10:09:50,986 INFO L432 NwaCegarLoop]: 120 mSDtfsCounter, 52 mSDsluCounter, 319 mSDsCounter, 0 mSdLazyCounter, 220 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 439 SdHoareTripleChecker+Invalid, 223 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 220 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-22 10:09:50,986 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 439 Invalid, 223 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 220 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-22 10:09:50,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 449 states. [2024-11-22 10:09:51,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 449 to 326. [2024-11-22 10:09:51,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 326 states, 249 states have (on average 1.2891566265060241) internal successors, (321), 251 states have internal predecessors, (321), 72 states have call successors, (72), 4 states have call predecessors, (72), 4 states have return successors, (72), 70 states have call predecessors, (72), 72 states have call successors, (72) [2024-11-22 10:09:51,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 326 states to 326 states and 465 transitions. [2024-11-22 10:09:51,013 INFO L78 Accepts]: Start accepts. Automaton has 326 states and 465 transitions. Word has length 131 [2024-11-22 10:09:51,014 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 10:09:51,014 INFO L471 AbstractCegarLoop]: Abstraction has 326 states and 465 transitions. [2024-11-22 10:09:51,014 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.857142857142857) internal successors, (34), 7 states have internal predecessors, (34), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-22 10:09:51,014 INFO L276 IsEmpty]: Start isEmpty. Operand 326 states and 465 transitions. [2024-11-22 10:09:51,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2024-11-22 10:09:51,015 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 10:09:51,016 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 10:09:51,016 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-22 10:09:51,016 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 10:09:51,016 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 10:09:51,017 INFO L85 PathProgramCache]: Analyzing trace with hash 1003479370, now seen corresponding path program 1 times [2024-11-22 10:09:51,017 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 10:09:51,017 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [820850167] [2024-11-22 10:09:51,017 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 10:09:51,017 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 10:09:51,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 10:09:51,093 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-22 10:09:51,093 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 10:09:51,093 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [820850167] [2024-11-22 10:09:51,093 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [820850167] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 10:09:51,093 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 10:09:51,094 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-22 10:09:51,094 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [317830284] [2024-11-22 10:09:51,094 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 10:09:51,094 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-22 10:09:51,095 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 10:09:51,095 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-22 10:09:51,095 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-22 10:09:51,095 INFO L87 Difference]: Start difference. First operand 326 states and 465 transitions. Second operand has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-22 10:09:51,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 10:09:51,137 INFO L93 Difference]: Finished difference Result 775 states and 1090 transitions. [2024-11-22 10:09:51,138 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-22 10:09:51,138 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 133 [2024-11-22 10:09:51,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 10:09:51,141 INFO L225 Difference]: With dead ends: 775 [2024-11-22 10:09:51,141 INFO L226 Difference]: Without dead ends: 452 [2024-11-22 10:09:51,142 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 10:09:51,142 INFO L432 NwaCegarLoop]: 150 mSDtfsCounter, 53 mSDsluCounter, 81 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 231 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-22 10:09:51,143 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 231 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-22 10:09:51,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 452 states. [2024-11-22 10:09:51,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 452 to 432. [2024-11-22 10:09:51,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 432 states, 331 states have (on average 1.2658610271903323) internal successors, (419), 335 states have internal predecessors, (419), 92 states have call successors, (92), 8 states have call predecessors, (92), 8 states have return successors, (92), 88 states have call predecessors, (92), 92 states have call successors, (92) [2024-11-22 10:09:51,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 432 states to 432 states and 603 transitions. [2024-11-22 10:09:51,177 INFO L78 Accepts]: Start accepts. Automaton has 432 states and 603 transitions. Word has length 133 [2024-11-22 10:09:51,178 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 10:09:51,178 INFO L471 AbstractCegarLoop]: Abstraction has 432 states and 603 transitions. [2024-11-22 10:09:51,178 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-22 10:09:51,178 INFO L276 IsEmpty]: Start isEmpty. Operand 432 states and 603 transitions. [2024-11-22 10:09:51,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2024-11-22 10:09:51,180 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 10:09:51,181 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 10:09:51,181 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-22 10:09:51,181 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 10:09:51,181 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 10:09:51,181 INFO L85 PathProgramCache]: Analyzing trace with hash 666791029, now seen corresponding path program 1 times [2024-11-22 10:09:51,182 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 10:09:51,182 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1140820895] [2024-11-22 10:09:51,182 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 10:09:51,182 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 10:09:51,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 10:09:51,238 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-22 10:09:51,238 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 10:09:51,239 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1140820895] [2024-11-22 10:09:51,239 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1140820895] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 10:09:51,239 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 10:09:51,239 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-22 10:09:51,239 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [623798818] [2024-11-22 10:09:51,239 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 10:09:51,240 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-22 10:09:51,240 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 10:09:51,241 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-22 10:09:51,241 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-22 10:09:51,242 INFO L87 Difference]: Start difference. First operand 432 states and 603 transitions. Second operand has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-22 10:09:51,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 10:09:51,282 INFO L93 Difference]: Finished difference Result 873 states and 1212 transitions. [2024-11-22 10:09:51,283 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-22 10:09:51,283 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 133 [2024-11-22 10:09:51,283 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 10:09:51,286 INFO L225 Difference]: With dead ends: 873 [2024-11-22 10:09:51,286 INFO L226 Difference]: Without dead ends: 444 [2024-11-22 10:09:51,290 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 10:09:51,291 INFO L432 NwaCegarLoop]: 100 mSDtfsCounter, 47 mSDsluCounter, 90 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 190 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-22 10:09:51,291 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 190 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-22 10:09:51,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 444 states. [2024-11-22 10:09:51,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 444 to 390. [2024-11-22 10:09:51,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 390 states, 309 states have (on average 1.2653721682847896) internal successors, (391), 311 states have internal predecessors, (391), 72 states have call successors, (72), 8 states have call predecessors, (72), 8 states have return successors, (72), 70 states have call predecessors, (72), 72 states have call successors, (72) [2024-11-22 10:09:51,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 390 states to 390 states and 535 transitions. [2024-11-22 10:09:51,319 INFO L78 Accepts]: Start accepts. Automaton has 390 states and 535 transitions. Word has length 133 [2024-11-22 10:09:51,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 10:09:51,319 INFO L471 AbstractCegarLoop]: Abstraction has 390 states and 535 transitions. [2024-11-22 10:09:51,320 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-22 10:09:51,320 INFO L276 IsEmpty]: Start isEmpty. Operand 390 states and 535 transitions. [2024-11-22 10:09:51,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2024-11-22 10:09:51,322 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 10:09:51,322 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 10:09:51,322 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-22 10:09:51,323 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 10:09:51,323 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 10:09:51,323 INFO L85 PathProgramCache]: Analyzing trace with hash 994039621, now seen corresponding path program 1 times [2024-11-22 10:09:51,324 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 10:09:51,324 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1488541744] [2024-11-22 10:09:51,324 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 10:09:51,324 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 10:09:51,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 10:09:51,633 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-22 10:09:51,634 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 10:09:51,634 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1488541744] [2024-11-22 10:09:51,634 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1488541744] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 10:09:51,634 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 10:09:51,634 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-22 10:09:51,634 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [772503504] [2024-11-22 10:09:51,634 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 10:09:51,635 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-22 10:09:51,635 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 10:09:51,635 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-22 10:09:51,635 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-22 10:09:51,636 INFO L87 Difference]: Start difference. First operand 390 states and 535 transitions. Second operand has 7 states, 7 states have (on average 5.142857142857143) internal successors, (36), 7 states have internal predecessors, (36), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-22 10:09:51,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 10:09:51,760 INFO L93 Difference]: Finished difference Result 404 states and 549 transitions. [2024-11-22 10:09:51,761 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-22 10:09:51,761 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.142857142857143) internal successors, (36), 7 states have internal predecessors, (36), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 133 [2024-11-22 10:09:51,761 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 10:09:51,764 INFO L225 Difference]: With dead ends: 404 [2024-11-22 10:09:51,764 INFO L226 Difference]: Without dead ends: 402 [2024-11-22 10:09:51,765 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2024-11-22 10:09:51,765 INFO L432 NwaCegarLoop]: 94 mSDtfsCounter, 69 mSDsluCounter, 452 mSDsCounter, 0 mSdLazyCounter, 79 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 546 SdHoareTripleChecker+Invalid, 81 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 79 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-22 10:09:51,766 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 546 Invalid, 81 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 79 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-22 10:09:51,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 402 states. [2024-11-22 10:09:51,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 402 to 374. [2024-11-22 10:09:51,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 374 states, 293 states have (on average 1.2798634812286689) internal successors, (375), 295 states have internal predecessors, (375), 72 states have call successors, (72), 8 states have call predecessors, (72), 8 states have return successors, (72), 70 states have call predecessors, (72), 72 states have call successors, (72) [2024-11-22 10:09:51,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 374 states to 374 states and 519 transitions. [2024-11-22 10:09:51,796 INFO L78 Accepts]: Start accepts. Automaton has 374 states and 519 transitions. Word has length 133 [2024-11-22 10:09:51,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 10:09:51,797 INFO L471 AbstractCegarLoop]: Abstraction has 374 states and 519 transitions. [2024-11-22 10:09:51,798 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.142857142857143) internal successors, (36), 7 states have internal predecessors, (36), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-22 10:09:51,798 INFO L276 IsEmpty]: Start isEmpty. Operand 374 states and 519 transitions. [2024-11-22 10:09:51,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2024-11-22 10:09:51,799 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 10:09:51,799 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 10:09:51,799 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-22 10:09:51,799 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 10:09:51,800 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 10:09:51,800 INFO L85 PathProgramCache]: Analyzing trace with hash 1383006464, now seen corresponding path program 1 times [2024-11-22 10:09:51,800 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 10:09:51,800 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [699173597] [2024-11-22 10:09:51,800 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 10:09:51,800 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 10:09:51,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 10:09:54,867 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-22 10:09:54,868 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 10:09:54,868 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [699173597] [2024-11-22 10:09:54,868 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [699173597] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 10:09:54,868 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 10:09:54,868 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-11-22 10:09:54,869 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1853549077] [2024-11-22 10:09:54,869 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 10:09:54,869 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-22 10:09:54,869 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 10:09:54,870 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-22 10:09:54,870 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2024-11-22 10:09:54,870 INFO L87 Difference]: Start difference. First operand 374 states and 519 transitions. Second operand has 12 states, 12 states have (on average 3.0) internal successors, (36), 12 states have internal predecessors, (36), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-22 10:09:55,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 10:09:55,991 INFO L93 Difference]: Finished difference Result 814 states and 1109 transitions. [2024-11-22 10:09:55,992 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-22 10:09:55,992 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.0) internal successors, (36), 12 states have internal predecessors, (36), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 133 [2024-11-22 10:09:55,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 10:09:55,995 INFO L225 Difference]: With dead ends: 814 [2024-11-22 10:09:55,995 INFO L226 Difference]: Without dead ends: 443 [2024-11-22 10:09:55,997 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=62, Invalid=210, Unknown=0, NotChecked=0, Total=272 [2024-11-22 10:09:55,997 INFO L432 NwaCegarLoop]: 126 mSDtfsCounter, 146 mSDsluCounter, 608 mSDsCounter, 0 mSdLazyCounter, 562 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 146 SdHoareTripleChecker+Valid, 734 SdHoareTripleChecker+Invalid, 563 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 562 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-22 10:09:55,997 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [146 Valid, 734 Invalid, 563 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 562 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-22 10:09:55,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 443 states. [2024-11-22 10:09:56,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 443 to 359. [2024-11-22 10:09:56,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 359 states, 278 states have (on average 1.2733812949640289) internal successors, (354), 280 states have internal predecessors, (354), 72 states have call successors, (72), 8 states have call predecessors, (72), 8 states have return successors, (72), 70 states have call predecessors, (72), 72 states have call successors, (72) [2024-11-22 10:09:56,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 359 states to 359 states and 498 transitions. [2024-11-22 10:09:56,027 INFO L78 Accepts]: Start accepts. Automaton has 359 states and 498 transitions. Word has length 133 [2024-11-22 10:09:56,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 10:09:56,028 INFO L471 AbstractCegarLoop]: Abstraction has 359 states and 498 transitions. [2024-11-22 10:09:56,028 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.0) internal successors, (36), 12 states have internal predecessors, (36), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-22 10:09:56,028 INFO L276 IsEmpty]: Start isEmpty. Operand 359 states and 498 transitions. [2024-11-22 10:09:56,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2024-11-22 10:09:56,029 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 10:09:56,029 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 10:09:56,030 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-22 10:09:56,030 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 10:09:56,030 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 10:09:56,030 INFO L85 PathProgramCache]: Analyzing trace with hash -1632097154, now seen corresponding path program 1 times [2024-11-22 10:09:56,030 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 10:09:56,031 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1254963312] [2024-11-22 10:09:56,031 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 10:09:56,031 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 10:09:56,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 10:09:58,479 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-22 10:09:58,479 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 10:09:58,479 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1254963312] [2024-11-22 10:09:58,479 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1254963312] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 10:09:58,480 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 10:09:58,480 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-22 10:09:58,480 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1525531901] [2024-11-22 10:09:58,480 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 10:09:58,481 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-22 10:09:58,481 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 10:09:58,482 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-22 10:09:58,482 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-11-22 10:09:58,482 INFO L87 Difference]: Start difference. First operand 359 states and 498 transitions. Second operand has 9 states, 9 states have (on average 4.0) internal successors, (36), 9 states have internal predecessors, (36), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-22 10:09:59,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 10:09:59,189 INFO L93 Difference]: Finished difference Result 735 states and 974 transitions. [2024-11-22 10:09:59,189 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-22 10:09:59,189 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.0) internal successors, (36), 9 states have internal predecessors, (36), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 133 [2024-11-22 10:09:59,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 10:09:59,193 INFO L225 Difference]: With dead ends: 735 [2024-11-22 10:09:59,193 INFO L226 Difference]: Without dead ends: 555 [2024-11-22 10:09:59,194 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2024-11-22 10:09:59,194 INFO L432 NwaCegarLoop]: 149 mSDtfsCounter, 82 mSDsluCounter, 588 mSDsCounter, 0 mSdLazyCounter, 443 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 737 SdHoareTripleChecker+Invalid, 446 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 443 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-22 10:09:59,194 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [82 Valid, 737 Invalid, 446 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 443 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-22 10:09:59,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 555 states. [2024-11-22 10:09:59,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 555 to 378. [2024-11-22 10:09:59,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 378 states, 297 states have (on average 1.2895622895622896) internal successors, (383), 299 states have internal predecessors, (383), 72 states have call successors, (72), 8 states have call predecessors, (72), 8 states have return successors, (72), 70 states have call predecessors, (72), 72 states have call successors, (72) [2024-11-22 10:09:59,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 378 states to 378 states and 527 transitions. [2024-11-22 10:09:59,226 INFO L78 Accepts]: Start accepts. Automaton has 378 states and 527 transitions. Word has length 133 [2024-11-22 10:09:59,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 10:09:59,227 INFO L471 AbstractCegarLoop]: Abstraction has 378 states and 527 transitions. [2024-11-22 10:09:59,227 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.0) internal successors, (36), 9 states have internal predecessors, (36), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-22 10:09:59,227 INFO L276 IsEmpty]: Start isEmpty. Operand 378 states and 527 transitions. [2024-11-22 10:09:59,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2024-11-22 10:09:59,228 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 10:09:59,228 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 10:09:59,228 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-22 10:09:59,228 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 10:09:59,229 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 10:09:59,229 INFO L85 PathProgramCache]: Analyzing trace with hash -1904523185, now seen corresponding path program 1 times [2024-11-22 10:09:59,229 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 10:09:59,229 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [489440933] [2024-11-22 10:09:59,229 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 10:09:59,230 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 10:09:59,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 10:09:59,604 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-22 10:09:59,604 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 10:09:59,604 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [489440933] [2024-11-22 10:09:59,605 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [489440933] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 10:09:59,605 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 10:09:59,605 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-22 10:09:59,605 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [998465955] [2024-11-22 10:09:59,605 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 10:09:59,605 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-22 10:09:59,605 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 10:09:59,606 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-22 10:09:59,606 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2024-11-22 10:09:59,606 INFO L87 Difference]: Start difference. First operand 378 states and 527 transitions. Second operand has 10 states, 10 states have (on average 3.8) internal successors, (38), 10 states have internal predecessors, (38), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-22 10:09:59,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 10:09:59,969 INFO L93 Difference]: Finished difference Result 555 states and 760 transitions. [2024-11-22 10:09:59,969 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-22 10:09:59,970 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.8) internal successors, (38), 10 states have internal predecessors, (38), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 135 [2024-11-22 10:09:59,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 10:09:59,974 INFO L225 Difference]: With dead ends: 555 [2024-11-22 10:09:59,974 INFO L226 Difference]: Without dead ends: 553 [2024-11-22 10:09:59,977 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=167, Unknown=0, NotChecked=0, Total=210 [2024-11-22 10:09:59,977 INFO L432 NwaCegarLoop]: 131 mSDtfsCounter, 102 mSDsluCounter, 788 mSDsCounter, 0 mSdLazyCounter, 263 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 102 SdHoareTripleChecker+Valid, 919 SdHoareTripleChecker+Invalid, 281 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 263 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-22 10:09:59,977 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [102 Valid, 919 Invalid, 281 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 263 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-22 10:09:59,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 553 states. [2024-11-22 10:10:00,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 553 to 511. [2024-11-22 10:10:00,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 511 states, 412 states have (on average 1.2766990291262137) internal successors, (526), 416 states have internal predecessors, (526), 88 states have call successors, (88), 10 states have call predecessors, (88), 10 states have return successors, (88), 84 states have call predecessors, (88), 88 states have call successors, (88) [2024-11-22 10:10:00,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 511 states to 511 states and 702 transitions. [2024-11-22 10:10:00,040 INFO L78 Accepts]: Start accepts. Automaton has 511 states and 702 transitions. Word has length 135 [2024-11-22 10:10:00,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 10:10:00,041 INFO L471 AbstractCegarLoop]: Abstraction has 511 states and 702 transitions. [2024-11-22 10:10:00,041 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.8) internal successors, (38), 10 states have internal predecessors, (38), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-22 10:10:00,041 INFO L276 IsEmpty]: Start isEmpty. Operand 511 states and 702 transitions. [2024-11-22 10:10:00,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2024-11-22 10:10:00,043 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 10:10:00,043 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 10:10:00,043 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-22 10:10:00,044 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 10:10:00,044 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 10:10:00,044 INFO L85 PathProgramCache]: Analyzing trace with hash -190395858, now seen corresponding path program 1 times [2024-11-22 10:10:00,044 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 10:10:00,045 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [73229532] [2024-11-22 10:10:00,045 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 10:10:00,045 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 10:10:00,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 10:10:00,546 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-22 10:10:00,546 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 10:10:00,546 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [73229532] [2024-11-22 10:10:00,546 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [73229532] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 10:10:00,546 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 10:10:00,546 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-22 10:10:00,546 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [258085176] [2024-11-22 10:10:00,546 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 10:10:00,547 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-22 10:10:00,547 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 10:10:00,547 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-22 10:10:00,547 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2024-11-22 10:10:00,548 INFO L87 Difference]: Start difference. First operand 511 states and 702 transitions. Second operand has 11 states, 11 states have (on average 3.5454545454545454) internal successors, (39), 11 states have internal predecessors, (39), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-22 10:10:00,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 10:10:00,939 INFO L93 Difference]: Finished difference Result 729 states and 973 transitions. [2024-11-22 10:10:00,940 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-22 10:10:00,940 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.5454545454545454) internal successors, (39), 11 states have internal predecessors, (39), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 136 [2024-11-22 10:10:00,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 10:10:00,945 INFO L225 Difference]: With dead ends: 729 [2024-11-22 10:10:00,945 INFO L226 Difference]: Without dead ends: 727 [2024-11-22 10:10:00,946 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=52, Invalid=188, Unknown=0, NotChecked=0, Total=240 [2024-11-22 10:10:00,946 INFO L432 NwaCegarLoop]: 134 mSDtfsCounter, 146 mSDsluCounter, 883 mSDsCounter, 0 mSdLazyCounter, 337 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 146 SdHoareTripleChecker+Valid, 1017 SdHoareTripleChecker+Invalid, 347 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 337 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-22 10:10:00,946 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [146 Valid, 1017 Invalid, 347 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 337 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-22 10:10:00,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 727 states. [2024-11-22 10:10:00,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 727 to 597. [2024-11-22 10:10:00,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 597 states, 478 states have (on average 1.2594142259414225) internal successors, (602), 484 states have internal predecessors, (602), 104 states have call successors, (104), 14 states have call predecessors, (104), 14 states have return successors, (104), 98 states have call predecessors, (104), 104 states have call successors, (104) [2024-11-22 10:10:01,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 597 states to 597 states and 810 transitions. [2024-11-22 10:10:01,001 INFO L78 Accepts]: Start accepts. Automaton has 597 states and 810 transitions. Word has length 136 [2024-11-22 10:10:01,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 10:10:01,002 INFO L471 AbstractCegarLoop]: Abstraction has 597 states and 810 transitions. [2024-11-22 10:10:01,002 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.5454545454545454) internal successors, (39), 11 states have internal predecessors, (39), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-22 10:10:01,002 INFO L276 IsEmpty]: Start isEmpty. Operand 597 states and 810 transitions. [2024-11-22 10:10:01,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2024-11-22 10:10:01,003 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 10:10:01,003 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 10:10:01,004 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-22 10:10:01,004 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 10:10:01,004 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 10:10:01,004 INFO L85 PathProgramCache]: Analyzing trace with hash -1470259536, now seen corresponding path program 1 times [2024-11-22 10:10:01,004 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 10:10:01,004 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [405572127] [2024-11-22 10:10:01,005 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 10:10:01,005 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 10:10:01,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 10:10:01,075 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-22 10:10:01,075 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 10:10:01,075 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [405572127] [2024-11-22 10:10:01,075 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [405572127] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 10:10:01,075 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 10:10:01,075 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-22 10:10:01,075 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [884857118] [2024-11-22 10:10:01,075 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 10:10:01,076 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-22 10:10:01,076 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 10:10:01,076 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-22 10:10:01,076 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-22 10:10:01,076 INFO L87 Difference]: Start difference. First operand 597 states and 810 transitions. Second operand has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-22 10:10:01,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 10:10:01,162 INFO L93 Difference]: Finished difference Result 1377 states and 1883 transitions. [2024-11-22 10:10:01,163 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-22 10:10:01,163 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 136 [2024-11-22 10:10:01,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 10:10:01,168 INFO L225 Difference]: With dead ends: 1377 [2024-11-22 10:10:01,168 INFO L226 Difference]: Without dead ends: 783 [2024-11-22 10:10:01,169 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 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 10:10:01,170 INFO L432 NwaCegarLoop]: 191 mSDtfsCounter, 90 mSDsluCounter, 88 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 90 SdHoareTripleChecker+Valid, 279 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-22 10:10:01,170 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [90 Valid, 279 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-22 10:10:01,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 783 states. [2024-11-22 10:10:01,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 783 to 693. [2024-11-22 10:10:01,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 693 states, 550 states have (on average 1.2327272727272727) internal successors, (678), 558 states have internal predecessors, (678), 124 states have call successors, (124), 18 states have call predecessors, (124), 18 states have return successors, (124), 116 states have call predecessors, (124), 124 states have call successors, (124) [2024-11-22 10:10:01,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 693 states to 693 states and 926 transitions. [2024-11-22 10:10:01,237 INFO L78 Accepts]: Start accepts. Automaton has 693 states and 926 transitions. Word has length 136 [2024-11-22 10:10:01,238 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 10:10:01,238 INFO L471 AbstractCegarLoop]: Abstraction has 693 states and 926 transitions. [2024-11-22 10:10:01,238 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-22 10:10:01,238 INFO L276 IsEmpty]: Start isEmpty. Operand 693 states and 926 transitions. [2024-11-22 10:10:01,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2024-11-22 10:10:01,239 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 10:10:01,239 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 10:10:01,240 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-22 10:10:01,240 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 10:10:01,240 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 10:10:01,240 INFO L85 PathProgramCache]: Analyzing trace with hash -788782599, now seen corresponding path program 1 times [2024-11-22 10:10:01,240 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 10:10:01,240 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [385393195] [2024-11-22 10:10:01,241 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 10:10:01,241 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 10:10:01,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 10:10:01,289 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-22 10:10:01,289 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 10:10:01,290 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [385393195] [2024-11-22 10:10:01,290 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [385393195] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 10:10:01,290 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 10:10:01,290 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-22 10:10:01,290 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1689385006] [2024-11-22 10:10:01,290 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 10:10:01,291 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-22 10:10:01,291 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 10:10:01,291 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-22 10:10:01,291 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-22 10:10:01,292 INFO L87 Difference]: Start difference. First operand 693 states and 926 transitions. Second operand has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-22 10:10:01,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 10:10:01,386 INFO L93 Difference]: Finished difference Result 1565 states and 2071 transitions. [2024-11-22 10:10:01,387 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-22 10:10:01,387 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 136 [2024-11-22 10:10:01,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 10:10:01,391 INFO L225 Difference]: With dead ends: 1565 [2024-11-22 10:10:01,391 INFO L226 Difference]: Without dead ends: 875 [2024-11-22 10:10:01,393 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 10:10:01,394 INFO L432 NwaCegarLoop]: 125 mSDtfsCounter, 21 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 205 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-22 10:10:01,394 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 205 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-22 10:10:01,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 875 states. [2024-11-22 10:10:01,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 875 to 797. [2024-11-22 10:10:01,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 797 states, 654 states have (on average 1.2370030581039755) internal successors, (809), 662 states have internal predecessors, (809), 124 states have call successors, (124), 18 states have call predecessors, (124), 18 states have return successors, (124), 116 states have call predecessors, (124), 124 states have call successors, (124) [2024-11-22 10:10:01,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 797 states to 797 states and 1057 transitions. [2024-11-22 10:10:01,461 INFO L78 Accepts]: Start accepts. Automaton has 797 states and 1057 transitions. Word has length 136 [2024-11-22 10:10:01,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 10:10:01,462 INFO L471 AbstractCegarLoop]: Abstraction has 797 states and 1057 transitions. [2024-11-22 10:10:01,463 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-22 10:10:01,463 INFO L276 IsEmpty]: Start isEmpty. Operand 797 states and 1057 transitions. [2024-11-22 10:10:01,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2024-11-22 10:10:01,464 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 10:10:01,465 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 10:10:01,465 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-11-22 10:10:01,465 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 10:10:01,465 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 10:10:01,465 INFO L85 PathProgramCache]: Analyzing trace with hash 482015460, now seen corresponding path program 1 times [2024-11-22 10:10:01,466 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 10:10:01,466 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1926961301] [2024-11-22 10:10:01,466 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 10:10:01,466 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 10:10:01,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 10:10:01,915 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-22 10:10:01,915 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 10:10:01,915 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1926961301] [2024-11-22 10:10:01,915 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1926961301] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 10:10:01,915 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 10:10:01,916 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-22 10:10:01,916 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1445070630] [2024-11-22 10:10:01,916 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 10:10:01,918 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-22 10:10:01,918 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 10:10:01,918 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-22 10:10:01,918 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-22 10:10:01,919 INFO L87 Difference]: Start difference. First operand 797 states and 1057 transitions. Second operand has 9 states, 9 states have (on average 4.444444444444445) internal successors, (40), 9 states have internal predecessors, (40), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-22 10:10:02,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 10:10:02,212 INFO L93 Difference]: Finished difference Result 806 states and 1065 transitions. [2024-11-22 10:10:02,212 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-22 10:10:02,213 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.444444444444445) internal successors, (40), 9 states have internal predecessors, (40), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 137 [2024-11-22 10:10:02,213 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 10:10:02,217 INFO L225 Difference]: With dead ends: 806 [2024-11-22 10:10:02,218 INFO L226 Difference]: Without dead ends: 804 [2024-11-22 10:10:02,218 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2024-11-22 10:10:02,219 INFO L432 NwaCegarLoop]: 131 mSDtfsCounter, 44 mSDsluCounter, 764 mSDsCounter, 0 mSdLazyCounter, 234 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 895 SdHoareTripleChecker+Invalid, 235 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 234 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-22 10:10:02,219 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 895 Invalid, 235 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 234 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-22 10:10:02,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 804 states. [2024-11-22 10:10:02,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 804 to 770. [2024-11-22 10:10:02,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 770 states, 627 states have (on average 1.2424242424242424) internal successors, (779), 635 states have internal predecessors, (779), 124 states have call successors, (124), 18 states have call predecessors, (124), 18 states have return successors, (124), 116 states have call predecessors, (124), 124 states have call successors, (124) [2024-11-22 10:10:02,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 770 states to 770 states and 1027 transitions. [2024-11-22 10:10:02,287 INFO L78 Accepts]: Start accepts. Automaton has 770 states and 1027 transitions. Word has length 137 [2024-11-22 10:10:02,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 10:10:02,288 INFO L471 AbstractCegarLoop]: Abstraction has 770 states and 1027 transitions. [2024-11-22 10:10:02,288 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.444444444444445) internal successors, (40), 9 states have internal predecessors, (40), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-22 10:10:02,288 INFO L276 IsEmpty]: Start isEmpty. Operand 770 states and 1027 transitions. [2024-11-22 10:10:02,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2024-11-22 10:10:02,289 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 10:10:02,289 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 10:10:02,289 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-11-22 10:10:02,290 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 10:10:02,290 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 10:10:02,290 INFO L85 PathProgramCache]: Analyzing trace with hash -14964062, now seen corresponding path program 1 times [2024-11-22 10:10:02,290 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 10:10:02,290 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1697691999] [2024-11-22 10:10:02,291 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 10:10:02,291 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 10:10:02,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 10:10:02,340 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-22 10:10:02,340 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 10:10:02,340 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1697691999] [2024-11-22 10:10:02,340 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1697691999] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 10:10:02,340 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 10:10:02,341 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-22 10:10:02,342 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [183574088] [2024-11-22 10:10:02,343 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 10:10:02,343 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-22 10:10:02,343 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 10:10:02,344 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-22 10:10:02,344 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-22 10:10:02,344 INFO L87 Difference]: Start difference. First operand 770 states and 1027 transitions. Second operand has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-22 10:10:02,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 10:10:02,437 INFO L93 Difference]: Finished difference Result 1571 states and 2088 transitions. [2024-11-22 10:10:02,437 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-22 10:10:02,437 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 137 [2024-11-22 10:10:02,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 10:10:02,441 INFO L225 Difference]: With dead ends: 1571 [2024-11-22 10:10:02,441 INFO L226 Difference]: Without dead ends: 804 [2024-11-22 10:10:02,443 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 10:10:02,444 INFO L432 NwaCegarLoop]: 118 mSDtfsCounter, 22 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 196 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-22 10:10:02,444 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 196 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-22 10:10:02,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 804 states. [2024-11-22 10:10:02,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 804 to 768. [2024-11-22 10:10:02,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 768 states, 625 states have (on average 1.2304) internal successors, (769), 633 states have internal predecessors, (769), 124 states have call successors, (124), 18 states have call predecessors, (124), 18 states have return successors, (124), 116 states have call predecessors, (124), 124 states have call successors, (124) [2024-11-22 10:10:02,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 768 states to 768 states and 1017 transitions. [2024-11-22 10:10:02,515 INFO L78 Accepts]: Start accepts. Automaton has 768 states and 1017 transitions. Word has length 137 [2024-11-22 10:10:02,515 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 10:10:02,515 INFO L471 AbstractCegarLoop]: Abstraction has 768 states and 1017 transitions. [2024-11-22 10:10:02,516 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-22 10:10:02,516 INFO L276 IsEmpty]: Start isEmpty. Operand 768 states and 1017 transitions. [2024-11-22 10:10:02,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2024-11-22 10:10:02,517 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 10:10:02,517 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 10:10:02,517 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-11-22 10:10:02,518 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 10:10:02,518 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 10:10:02,518 INFO L85 PathProgramCache]: Analyzing trace with hash -1385083849, now seen corresponding path program 1 times [2024-11-22 10:10:02,518 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 10:10:02,518 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [695186674] [2024-11-22 10:10:02,518 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 10:10:02,519 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 10:10:02,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 10:10:02,620 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-22 10:10:02,620 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 10:10:02,620 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [695186674] [2024-11-22 10:10:02,621 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [695186674] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 10:10:02,621 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 10:10:02,621 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-22 10:10:02,621 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [387300060] [2024-11-22 10:10:02,621 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 10:10:02,622 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-22 10:10:02,622 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 10:10:02,623 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-22 10:10:02,624 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-22 10:10:02,625 INFO L87 Difference]: Start difference. First operand 768 states and 1017 transitions. Second operand has 5 states, 5 states have (on average 8.0) internal successors, (40), 5 states have internal predecessors, (40), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-22 10:10:02,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 10:10:02,844 INFO L93 Difference]: Finished difference Result 1753 states and 2256 transitions. [2024-11-22 10:10:02,845 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-22 10:10:02,845 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.0) internal successors, (40), 5 states have internal predecessors, (40), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 137 [2024-11-22 10:10:02,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 10:10:02,850 INFO L225 Difference]: With dead ends: 1753 [2024-11-22 10:10:02,850 INFO L226 Difference]: Without dead ends: 988 [2024-11-22 10:10:02,853 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-11-22 10:10:02,853 INFO L432 NwaCegarLoop]: 88 mSDtfsCounter, 281 mSDsluCounter, 219 mSDsCounter, 0 mSdLazyCounter, 89 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 281 SdHoareTripleChecker+Valid, 307 SdHoareTripleChecker+Invalid, 152 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 89 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-22 10:10:02,853 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [281 Valid, 307 Invalid, 152 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 89 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-22 10:10:02,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 988 states. [2024-11-22 10:10:02,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 988 to 732. [2024-11-22 10:10:02,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 732 states, 589 states have (on average 1.2139219015280136) internal successors, (715), 597 states have internal predecessors, (715), 124 states have call successors, (124), 18 states have call predecessors, (124), 18 states have return successors, (124), 116 states have call predecessors, (124), 124 states have call successors, (124) [2024-11-22 10:10:02,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 732 states to 732 states and 963 transitions. [2024-11-22 10:10:02,925 INFO L78 Accepts]: Start accepts. Automaton has 732 states and 963 transitions. Word has length 137 [2024-11-22 10:10:02,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 10:10:02,926 INFO L471 AbstractCegarLoop]: Abstraction has 732 states and 963 transitions. [2024-11-22 10:10:02,926 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.0) internal successors, (40), 5 states have internal predecessors, (40), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-22 10:10:02,926 INFO L276 IsEmpty]: Start isEmpty. Operand 732 states and 963 transitions. [2024-11-22 10:10:02,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2024-11-22 10:10:02,927 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 10:10:02,927 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 10:10:02,928 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-11-22 10:10:02,928 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 10:10:02,928 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 10:10:02,928 INFO L85 PathProgramCache]: Analyzing trace with hash -1509064957, now seen corresponding path program 1 times [2024-11-22 10:10:02,928 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 10:10:02,928 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [352021445] [2024-11-22 10:10:02,928 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 10:10:02,929 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 10:10:02,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 10:10:03,313 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-22 10:10:03,313 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 10:10:03,313 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [352021445] [2024-11-22 10:10:03,314 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [352021445] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 10:10:03,314 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 10:10:03,314 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-22 10:10:03,314 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1392967129] [2024-11-22 10:10:03,314 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 10:10:03,314 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-22 10:10:03,315 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 10:10:03,315 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-22 10:10:03,315 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2024-11-22 10:10:03,315 INFO L87 Difference]: Start difference. First operand 732 states and 963 transitions. Second operand has 10 states, 10 states have (on average 4.1) internal successors, (41), 10 states have internal predecessors, (41), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-22 10:10:03,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 10:10:03,626 INFO L93 Difference]: Finished difference Result 750 states and 980 transitions. [2024-11-22 10:10:03,627 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-22 10:10:03,627 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.1) internal successors, (41), 10 states have internal predecessors, (41), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 138 [2024-11-22 10:10:03,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 10:10:03,631 INFO L225 Difference]: With dead ends: 750 [2024-11-22 10:10:03,631 INFO L226 Difference]: Without dead ends: 748 [2024-11-22 10:10:03,632 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=167, Unknown=0, NotChecked=0, Total=210 [2024-11-22 10:10:03,633 INFO L432 NwaCegarLoop]: 134 mSDtfsCounter, 86 mSDsluCounter, 863 mSDsCounter, 0 mSdLazyCounter, 315 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 86 SdHoareTripleChecker+Valid, 997 SdHoareTripleChecker+Invalid, 316 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 315 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-22 10:10:03,633 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [86 Valid, 997 Invalid, 316 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 315 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-22 10:10:03,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 748 states. [2024-11-22 10:10:03,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 748 to 714. [2024-11-22 10:10:03,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 714 states, 571 states have (on average 1.2206654991243433) internal successors, (697), 579 states have internal predecessors, (697), 124 states have call successors, (124), 18 states have call predecessors, (124), 18 states have return successors, (124), 116 states have call predecessors, (124), 124 states have call successors, (124) [2024-11-22 10:10:03,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 714 states to 714 states and 945 transitions. [2024-11-22 10:10:03,714 INFO L78 Accepts]: Start accepts. Automaton has 714 states and 945 transitions. Word has length 138 [2024-11-22 10:10:03,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 10:10:03,715 INFO L471 AbstractCegarLoop]: Abstraction has 714 states and 945 transitions. [2024-11-22 10:10:03,715 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.1) internal successors, (41), 10 states have internal predecessors, (41), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-22 10:10:03,715 INFO L276 IsEmpty]: Start isEmpty. Operand 714 states and 945 transitions. [2024-11-22 10:10:03,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2024-11-22 10:10:03,716 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 10:10:03,716 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 10:10:03,717 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-11-22 10:10:03,717 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 10:10:03,717 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 10:10:03,717 INFO L85 PathProgramCache]: Analyzing trace with hash 1197554437, now seen corresponding path program 1 times [2024-11-22 10:10:03,718 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 10:10:03,718 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1332614827] [2024-11-22 10:10:03,718 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 10:10:03,718 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 10:10:03,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 10:10:04,068 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-22 10:10:04,069 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 10:10:04,069 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1332614827] [2024-11-22 10:10:04,069 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1332614827] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 10:10:04,069 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 10:10:04,069 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-22 10:10:04,070 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1852633603] [2024-11-22 10:10:04,070 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 10:10:04,070 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-22 10:10:04,070 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 10:10:04,071 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-22 10:10:04,071 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2024-11-22 10:10:04,071 INFO L87 Difference]: Start difference. First operand 714 states and 945 transitions. Second operand has 10 states, 10 states have (on average 4.1) internal successors, (41), 10 states have internal predecessors, (41), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-22 10:10:04,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 10:10:04,395 INFO L93 Difference]: Finished difference Result 740 states and 968 transitions. [2024-11-22 10:10:04,395 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-22 10:10:04,395 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.1) internal successors, (41), 10 states have internal predecessors, (41), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 138 [2024-11-22 10:10:04,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 10:10:04,399 INFO L225 Difference]: With dead ends: 740 [2024-11-22 10:10:04,400 INFO L226 Difference]: Without dead ends: 738 [2024-11-22 10:10:04,400 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=167, Unknown=0, NotChecked=0, Total=210 [2024-11-22 10:10:04,401 INFO L432 NwaCegarLoop]: 170 mSDtfsCounter, 85 mSDsluCounter, 971 mSDsCounter, 0 mSdLazyCounter, 345 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 1141 SdHoareTripleChecker+Invalid, 346 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 345 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-22 10:10:04,401 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [85 Valid, 1141 Invalid, 346 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 345 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-22 10:10:04,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 738 states. [2024-11-22 10:10:04,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 738 to 732. [2024-11-22 10:10:04,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 732 states, 587 states have (on average 1.2146507666098807) internal successors, (713), 595 states have internal predecessors, (713), 124 states have call successors, (124), 20 states have call predecessors, (124), 20 states have return successors, (124), 116 states have call predecessors, (124), 124 states have call successors, (124) [2024-11-22 10:10:04,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 732 states to 732 states and 961 transitions. [2024-11-22 10:10:04,470 INFO L78 Accepts]: Start accepts. Automaton has 732 states and 961 transitions. Word has length 138 [2024-11-22 10:10:04,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 10:10:04,471 INFO L471 AbstractCegarLoop]: Abstraction has 732 states and 961 transitions. [2024-11-22 10:10:04,471 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.1) internal successors, (41), 10 states have internal predecessors, (41), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-22 10:10:04,471 INFO L276 IsEmpty]: Start isEmpty. Operand 732 states and 961 transitions. [2024-11-22 10:10:04,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2024-11-22 10:10:04,472 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 10:10:04,472 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 10:10:04,473 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-11-22 10:10:04,473 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 10:10:04,473 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 10:10:04,473 INFO L85 PathProgramCache]: Analyzing trace with hash 197135023, now seen corresponding path program 1 times [2024-11-22 10:10:04,473 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 10:10:04,474 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1320123373] [2024-11-22 10:10:04,474 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 10:10:04,474 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 10:10:04,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 10:10:04,716 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 54 proven. 3 refuted. 0 times theorem prover too weak. 703 trivial. 0 not checked. [2024-11-22 10:10:04,716 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 10:10:04,716 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1320123373] [2024-11-22 10:10:04,717 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1320123373] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-22 10:10:04,717 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1412622505] [2024-11-22 10:10:04,717 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 10:10:04,717 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 10:10:04,717 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 10:10:04,720 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 10:10:04,721 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 10:10:04,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 10:10:04,803 INFO L255 TraceCheckSpWp]: Trace formula consists of 297 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-11-22 10:10:04,811 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 10:10:04,926 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 130 proven. 0 refuted. 0 times theorem prover too weak. 630 trivial. 0 not checked. [2024-11-22 10:10:04,927 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-22 10:10:04,928 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1412622505] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 10:10:04,928 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-22 10:10:04,928 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [6] total 10 [2024-11-22 10:10:04,928 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1408385005] [2024-11-22 10:10:04,928 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 10:10:04,929 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-22 10:10:04,929 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 10:10:04,929 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-22 10:10:04,929 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-11-22 10:10:04,930 INFO L87 Difference]: Start difference. First operand 732 states and 961 transitions. Second operand has 9 states, 9 states have (on average 5.333333333333333) internal successors, (48), 8 states have internal predecessors, (48), 2 states have call successors, (20), 2 states have call predecessors, (20), 3 states have return successors, (20), 3 states have call predecessors, (20), 2 states have call successors, (20) [2024-11-22 10:10:05,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 10:10:05,418 INFO L93 Difference]: Finished difference Result 1601 states and 2092 transitions. [2024-11-22 10:10:05,419 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-11-22 10:10:05,419 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.333333333333333) internal successors, (48), 8 states have internal predecessors, (48), 2 states have call successors, (20), 2 states have call predecessors, (20), 3 states have return successors, (20), 3 states have call predecessors, (20), 2 states have call successors, (20) Word has length 139 [2024-11-22 10:10:05,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 10:10:05,424 INFO L225 Difference]: With dead ends: 1601 [2024-11-22 10:10:05,424 INFO L226 Difference]: Without dead ends: 872 [2024-11-22 10:10:05,426 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 158 GetRequests, 138 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 82 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=127, Invalid=335, Unknown=0, NotChecked=0, Total=462 [2024-11-22 10:10:05,427 INFO L432 NwaCegarLoop]: 146 mSDtfsCounter, 124 mSDsluCounter, 486 mSDsCounter, 0 mSdLazyCounter, 459 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 143 SdHoareTripleChecker+Valid, 632 SdHoareTripleChecker+Invalid, 506 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 459 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-22 10:10:05,427 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [143 Valid, 632 Invalid, 506 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 459 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-22 10:10:05,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 872 states. [2024-11-22 10:10:05,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 872 to 762. [2024-11-22 10:10:05,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 762 states, 607 states have (on average 1.1828665568369028) internal successors, (718), 615 states have internal predecessors, (718), 128 states have call successors, (128), 26 states have call predecessors, (128), 26 states have return successors, (128), 120 states have call predecessors, (128), 128 states have call successors, (128) [2024-11-22 10:10:05,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 762 states to 762 states and 974 transitions. [2024-11-22 10:10:05,506 INFO L78 Accepts]: Start accepts. Automaton has 762 states and 974 transitions. Word has length 139 [2024-11-22 10:10:05,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 10:10:05,507 INFO L471 AbstractCegarLoop]: Abstraction has 762 states and 974 transitions. [2024-11-22 10:10:05,507 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.333333333333333) internal successors, (48), 8 states have internal predecessors, (48), 2 states have call successors, (20), 2 states have call predecessors, (20), 3 states have return successors, (20), 3 states have call predecessors, (20), 2 states have call successors, (20) [2024-11-22 10:10:05,507 INFO L276 IsEmpty]: Start isEmpty. Operand 762 states and 974 transitions. [2024-11-22 10:10:05,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2024-11-22 10:10:05,508 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 10:10:05,508 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 10:10:05,517 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-11-22 10:10:05,709 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,SelfDestructingSolverStorable25 [2024-11-22 10:10:05,709 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 10:10:05,710 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 10:10:05,710 INFO L85 PathProgramCache]: Analyzing trace with hash -1311584686, now seen corresponding path program 1 times [2024-11-22 10:10:05,710 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 10:10:05,710 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [484907119] [2024-11-22 10:10:05,710 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 10:10:05,710 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 10:10:05,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-22 10:10:05,744 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-22 10:10:05,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-22 10:10:05,819 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-22 10:10:05,819 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-22 10:10:05,820 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-22 10:10:05,822 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-11-22 10:10:05,827 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 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 10:10:05,898 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-22 10:10:05,900 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.11 10:10:05 BoogieIcfgContainer [2024-11-22 10:10:05,900 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-22 10:10:05,901 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-22 10:10:05,901 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-22 10:10:05,901 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-22 10:10:05,902 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 10:09:12" (3/4) ... [2024-11-22 10:10:05,907 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-22 10:10:05,908 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-22 10:10:05,909 INFO L158 Benchmark]: Toolchain (without parser) took 54829.43ms. Allocated memory was 188.7MB in the beginning and 1.4GB in the end (delta: 1.2GB). Free memory was 121.3MB in the beginning and 706.1MB in the end (delta: -584.8MB). Peak memory consumption was 617.3MB. Max. memory is 16.1GB. [2024-11-22 10:10:05,909 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 109.1MB. Free memory is still 69.7MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-22 10:10:05,909 INFO L158 Benchmark]: CACSL2BoogieTranslator took 309.45ms. Allocated memory is still 188.7MB. Free memory was 121.0MB in the beginning and 106.1MB in the end (delta: 14.9MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-11-22 10:10:05,909 INFO L158 Benchmark]: Boogie Procedure Inliner took 168.39ms. Allocated memory is still 188.7MB. Free memory was 106.0MB in the beginning and 158.4MB in the end (delta: -52.4MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-22 10:10:05,910 INFO L158 Benchmark]: Boogie Preprocessor took 68.16ms. Allocated memory is still 188.7MB. Free memory was 158.4MB in the beginning and 152.7MB in the end (delta: 5.7MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-11-22 10:10:05,910 INFO L158 Benchmark]: RCFGBuilder took 628.64ms. Allocated memory is still 188.7MB. Free memory was 152.7MB in the beginning and 129.6MB in the end (delta: 23.1MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2024-11-22 10:10:05,910 INFO L158 Benchmark]: TraceAbstraction took 53639.54ms. Allocated memory was 188.7MB in the beginning and 1.4GB in the end (delta: 1.2GB). Free memory was 129.1MB in the beginning and 707.2MB in the end (delta: -578.1MB). Peak memory consumption was 623.5MB. Max. memory is 16.1GB. [2024-11-22 10:10:05,910 INFO L158 Benchmark]: Witness Printer took 7.50ms. Allocated memory is still 1.4GB. Free memory is still 706.1MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-22 10:10:05,911 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.19ms. Allocated memory is still 109.1MB. Free memory is still 69.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 309.45ms. Allocated memory is still 188.7MB. Free memory was 121.0MB in the beginning and 106.1MB in the end (delta: 14.9MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 168.39ms. Allocated memory is still 188.7MB. Free memory was 106.0MB in the beginning and 158.4MB in the end (delta: -52.4MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 68.16ms. Allocated memory is still 188.7MB. Free memory was 158.4MB in the beginning and 152.7MB in the end (delta: 5.7MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * RCFGBuilder took 628.64ms. Allocated memory is still 188.7MB. Free memory was 152.7MB in the beginning and 129.6MB in the end (delta: 23.1MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. * TraceAbstraction took 53639.54ms. Allocated memory was 188.7MB in the beginning and 1.4GB in the end (delta: 1.2GB). Free memory was 129.1MB in the beginning and 707.2MB in the end (delta: -578.1MB). Peak memory consumption was 623.5MB. Max. memory is 16.1GB. * Witness Printer took 7.50ms. Allocated memory is still 1.4GB. Free memory is still 706.1MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of shiftRight at line 107, overapproximation of shiftLeft at line 107. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned char var_1_1 = 1; [L23] signed char var_1_3 = 0; [L24] unsigned char var_1_5 = 128; [L25] unsigned char var_1_6 = 16; [L26] unsigned char var_1_7 = 2; [L27] unsigned char var_1_8 = 8; [L28] signed long int var_1_9 = 10; [L29] unsigned char var_1_10 = 0; [L30] unsigned char var_1_12 = 0; [L31] signed long int var_1_13 = 99; [L32] unsigned char var_1_14 = 64; [L33] unsigned char var_1_16 = 0; [L34] unsigned char var_1_17 = 0; [L35] unsigned char var_1_18 = 1; [L36] unsigned char last_1_var_1_14 = 64; VAL [isInitial=0, last_1_var_1_14=64, var_1_10=0, var_1_12=0, var_1_13=99, var_1_14=64, var_1_16=0, var_1_17=0, var_1_18=1, var_1_1=1, var_1_3=0, var_1_5=128, var_1_6=16, var_1_7=2, var_1_8=8, var_1_9=10] [L111] isInitial = 1 [L112] FCALL initially() [L113] COND TRUE 1 [L114] CALL updateLastVariables() [L104] last_1_var_1_14 = var_1_14 VAL [isInitial=1, last_1_var_1_14=64, var_1_10=0, var_1_12=0, var_1_13=99, var_1_14=64, var_1_16=0, var_1_17=0, var_1_18=1, var_1_1=1, var_1_3=0, var_1_5=128, var_1_6=16, var_1_7=2, var_1_8=8, var_1_9=10] [L114] RET updateLastVariables() [L115] CALL updateVariables() [L72] var_1_3 = __VERIFIER_nondet_char() [L73] CALL assume_abort_if_not(var_1_3 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=64, var_1_10=0, var_1_12=0, var_1_13=99, var_1_14=64, var_1_16=0, var_1_17=0, var_1_18=1, var_1_1=1, var_1_3=2, var_1_5=128, var_1_6=16, var_1_7=2, var_1_8=8, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=64, var_1_10=0, var_1_12=0, var_1_13=99, var_1_14=64, var_1_16=0, var_1_17=0, var_1_18=1, var_1_1=1, var_1_3=2, var_1_5=128, var_1_6=16, var_1_7=2, var_1_8=8, var_1_9=10] [L73] RET assume_abort_if_not(var_1_3 >= 0) VAL [isInitial=1, last_1_var_1_14=64, var_1_10=0, var_1_12=0, var_1_13=99, var_1_14=64, var_1_16=0, var_1_17=0, var_1_18=1, var_1_1=1, var_1_3=2, var_1_5=128, var_1_6=16, var_1_7=2, var_1_8=8, var_1_9=10] [L74] CALL assume_abort_if_not(var_1_3 <= 16) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=64, var_1_10=0, var_1_12=0, var_1_13=99, var_1_14=64, var_1_16=0, var_1_17=0, var_1_18=1, var_1_1=1, var_1_3=2, var_1_5=128, var_1_6=16, var_1_7=2, var_1_8=8, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=64, var_1_10=0, var_1_12=0, var_1_13=99, var_1_14=64, var_1_16=0, var_1_17=0, var_1_18=1, var_1_1=1, var_1_3=2, var_1_5=128, var_1_6=16, var_1_7=2, var_1_8=8, var_1_9=10] [L74] RET assume_abort_if_not(var_1_3 <= 16) VAL [isInitial=1, last_1_var_1_14=64, var_1_10=0, var_1_12=0, var_1_13=99, var_1_14=64, var_1_16=0, var_1_17=0, var_1_18=1, var_1_1=1, var_1_3=2, var_1_5=128, var_1_6=16, var_1_7=2, var_1_8=8, var_1_9=10] [L75] var_1_5 = __VERIFIER_nondet_uchar() [L76] CALL assume_abort_if_not(var_1_5 >= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=64, var_1_10=0, var_1_12=0, var_1_13=99, var_1_14=64, var_1_16=0, var_1_17=0, var_1_18=1, var_1_1=1, var_1_3=2, var_1_5=129, var_1_6=16, var_1_7=2, var_1_8=8, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=64, var_1_10=0, var_1_12=0, var_1_13=99, var_1_14=64, var_1_16=0, var_1_17=0, var_1_18=1, var_1_1=1, var_1_3=2, var_1_5=129, var_1_6=16, var_1_7=2, var_1_8=8, var_1_9=10] [L76] RET assume_abort_if_not(var_1_5 >= 127) VAL [isInitial=1, last_1_var_1_14=64, var_1_10=0, var_1_12=0, var_1_13=99, var_1_14=64, var_1_16=0, var_1_17=0, var_1_18=1, var_1_1=1, var_1_3=2, var_1_5=129, var_1_6=16, var_1_7=2, var_1_8=8, var_1_9=10] [L77] CALL assume_abort_if_not(var_1_5 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=64, var_1_10=0, var_1_12=0, var_1_13=99, var_1_14=64, var_1_16=0, var_1_17=0, var_1_18=1, var_1_1=1, var_1_3=2, var_1_5=129, var_1_6=16, var_1_7=2, var_1_8=8, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=64, var_1_10=0, var_1_12=0, var_1_13=99, var_1_14=64, var_1_16=0, var_1_17=0, var_1_18=1, var_1_1=1, var_1_3=2, var_1_5=129, var_1_6=16, var_1_7=2, var_1_8=8, var_1_9=10] [L77] RET assume_abort_if_not(var_1_5 <= 254) VAL [isInitial=1, last_1_var_1_14=64, var_1_10=0, var_1_12=0, var_1_13=99, var_1_14=64, var_1_16=0, var_1_17=0, var_1_18=1, var_1_1=1, var_1_3=2, var_1_5=129, var_1_6=16, var_1_7=2, var_1_8=8, var_1_9=10] [L78] var_1_6 = __VERIFIER_nondet_uchar() [L79] CALL assume_abort_if_not(var_1_6 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=64, var_1_10=0, var_1_12=0, var_1_13=99, var_1_14=64, var_1_16=0, var_1_17=0, var_1_18=1, var_1_1=1, var_1_3=2, var_1_5=129, var_1_7=2, var_1_8=8, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=64, var_1_10=0, var_1_12=0, var_1_13=99, var_1_14=64, var_1_16=0, var_1_17=0, var_1_18=1, var_1_1=1, var_1_3=2, var_1_5=129, var_1_7=2, var_1_8=8, var_1_9=10] [L79] RET assume_abort_if_not(var_1_6 >= 0) VAL [isInitial=1, last_1_var_1_14=64, var_1_10=0, var_1_12=0, var_1_13=99, var_1_14=64, var_1_16=0, var_1_17=0, var_1_18=1, var_1_1=1, var_1_3=2, var_1_5=129, var_1_7=2, var_1_8=8, var_1_9=10] [L80] CALL assume_abort_if_not(var_1_6 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=64, var_1_10=0, var_1_12=0, var_1_13=99, var_1_14=64, var_1_16=0, var_1_17=0, var_1_18=1, var_1_1=1, var_1_3=2, var_1_5=129, var_1_6=127, var_1_7=2, var_1_8=8, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=64, var_1_10=0, var_1_12=0, var_1_13=99, var_1_14=64, var_1_16=0, var_1_17=0, var_1_18=1, var_1_1=1, var_1_3=2, var_1_5=129, var_1_6=127, var_1_7=2, var_1_8=8, var_1_9=10] [L80] RET assume_abort_if_not(var_1_6 <= 127) VAL [isInitial=1, last_1_var_1_14=64, var_1_10=0, var_1_12=0, var_1_13=99, var_1_14=64, var_1_16=0, var_1_17=0, var_1_18=1, var_1_1=1, var_1_3=2, var_1_5=129, var_1_6=127, var_1_7=2, var_1_8=8, var_1_9=10] [L81] var_1_7 = __VERIFIER_nondet_uchar() [L82] CALL assume_abort_if_not(var_1_7 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=64, var_1_10=0, var_1_12=0, var_1_13=99, var_1_14=64, var_1_16=0, var_1_17=0, var_1_18=1, var_1_1=1, var_1_3=2, var_1_5=129, var_1_6=127, var_1_8=8, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=64, var_1_10=0, var_1_12=0, var_1_13=99, var_1_14=64, var_1_16=0, var_1_17=0, var_1_18=1, var_1_1=1, var_1_3=2, var_1_5=129, var_1_6=127, var_1_8=8, var_1_9=10] [L82] RET assume_abort_if_not(var_1_7 >= 0) VAL [isInitial=1, last_1_var_1_14=64, var_1_10=0, var_1_12=0, var_1_13=99, var_1_14=64, var_1_16=0, var_1_17=0, var_1_18=1, var_1_1=1, var_1_3=2, var_1_5=129, var_1_6=127, var_1_8=8, var_1_9=10] [L83] CALL assume_abort_if_not(var_1_7 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=64, var_1_10=0, var_1_12=0, var_1_13=99, var_1_14=64, var_1_16=0, var_1_17=0, var_1_18=1, var_1_1=1, var_1_3=2, var_1_5=129, var_1_6=127, var_1_7=126, var_1_8=8, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=64, var_1_10=0, var_1_12=0, var_1_13=99, var_1_14=64, var_1_16=0, var_1_17=0, var_1_18=1, var_1_1=1, var_1_3=2, var_1_5=129, var_1_6=127, var_1_7=126, var_1_8=8, var_1_9=10] [L83] RET assume_abort_if_not(var_1_7 <= 127) VAL [isInitial=1, last_1_var_1_14=64, var_1_10=0, var_1_12=0, var_1_13=99, var_1_14=64, var_1_16=0, var_1_17=0, var_1_18=1, var_1_1=1, var_1_3=2, var_1_5=129, var_1_6=127, var_1_7=126, var_1_8=8, var_1_9=10] [L84] var_1_8 = __VERIFIER_nondet_uchar() [L85] CALL assume_abort_if_not(var_1_8 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=64, var_1_10=0, var_1_12=0, var_1_13=99, var_1_14=64, var_1_16=0, var_1_17=0, var_1_18=1, var_1_1=1, var_1_3=2, var_1_5=129, var_1_6=127, var_1_7=126, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=64, var_1_10=0, var_1_12=0, var_1_13=99, var_1_14=64, var_1_16=0, var_1_17=0, var_1_18=1, var_1_1=1, var_1_3=2, var_1_5=129, var_1_6=127, var_1_7=126, var_1_9=10] [L85] RET assume_abort_if_not(var_1_8 >= 0) VAL [isInitial=1, last_1_var_1_14=64, var_1_10=0, var_1_12=0, var_1_13=99, var_1_14=64, var_1_16=0, var_1_17=0, var_1_18=1, var_1_1=1, var_1_3=2, var_1_5=129, var_1_6=127, var_1_7=126, var_1_9=10] [L86] CALL assume_abort_if_not(var_1_8 <= 64) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=64, var_1_10=0, var_1_12=0, var_1_13=99, var_1_14=64, var_1_16=0, var_1_17=0, var_1_18=1, var_1_1=1, var_1_3=2, var_1_5=129, var_1_6=127, var_1_7=126, var_1_8=61, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=64, var_1_10=0, var_1_12=0, var_1_13=99, var_1_14=64, var_1_16=0, var_1_17=0, var_1_18=1, var_1_1=1, var_1_3=2, var_1_5=129, var_1_6=127, var_1_7=126, var_1_8=61, var_1_9=10] [L86] RET assume_abort_if_not(var_1_8 <= 64) VAL [isInitial=1, last_1_var_1_14=64, var_1_10=0, var_1_12=0, var_1_13=99, var_1_14=64, var_1_16=0, var_1_17=0, var_1_18=1, var_1_1=1, var_1_3=2, var_1_5=129, var_1_6=127, var_1_7=126, var_1_8=61, var_1_9=10] [L87] var_1_10 = __VERIFIER_nondet_uchar() [L88] CALL assume_abort_if_not(var_1_10 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=64, var_1_12=0, var_1_13=99, var_1_14=64, var_1_16=0, var_1_17=0, var_1_18=1, var_1_1=1, var_1_3=2, var_1_5=129, var_1_6=127, var_1_7=126, var_1_8=61, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=64, var_1_12=0, var_1_13=99, var_1_14=64, var_1_16=0, var_1_17=0, var_1_18=1, var_1_1=1, var_1_3=2, var_1_5=129, var_1_6=127, var_1_7=126, var_1_8=61, var_1_9=10] [L88] RET assume_abort_if_not(var_1_10 >= 0) VAL [isInitial=1, last_1_var_1_14=64, var_1_12=0, var_1_13=99, var_1_14=64, var_1_16=0, var_1_17=0, var_1_18=1, var_1_1=1, var_1_3=2, var_1_5=129, var_1_6=127, var_1_7=126, var_1_8=61, var_1_9=10] [L89] CALL assume_abort_if_not(var_1_10 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=64, var_1_10=1, var_1_12=0, var_1_13=99, var_1_14=64, var_1_16=0, var_1_17=0, var_1_18=1, var_1_1=1, var_1_3=2, var_1_5=129, var_1_6=127, var_1_7=126, var_1_8=61, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=64, var_1_10=1, var_1_12=0, var_1_13=99, var_1_14=64, var_1_16=0, var_1_17=0, var_1_18=1, var_1_1=1, var_1_3=2, var_1_5=129, var_1_6=127, var_1_7=126, var_1_8=61, var_1_9=10] [L89] RET assume_abort_if_not(var_1_10 <= 1) VAL [isInitial=1, last_1_var_1_14=64, var_1_10=1, var_1_12=0, var_1_13=99, var_1_14=64, var_1_16=0, var_1_17=0, var_1_18=1, var_1_1=1, var_1_3=2, var_1_5=129, var_1_6=127, var_1_7=126, var_1_8=61, var_1_9=10] [L90] var_1_12 = __VERIFIER_nondet_uchar() [L91] CALL assume_abort_if_not(var_1_12 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=64, var_1_10=1, var_1_13=99, var_1_14=64, var_1_16=0, var_1_17=0, var_1_18=1, var_1_1=1, var_1_3=2, var_1_5=129, var_1_6=127, var_1_7=126, var_1_8=61, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=64, var_1_10=1, var_1_13=99, var_1_14=64, var_1_16=0, var_1_17=0, var_1_18=1, var_1_1=1, var_1_3=2, var_1_5=129, var_1_6=127, var_1_7=126, var_1_8=61, var_1_9=10] [L91] RET assume_abort_if_not(var_1_12 >= 0) VAL [isInitial=1, last_1_var_1_14=64, var_1_10=1, var_1_13=99, var_1_14=64, var_1_16=0, var_1_17=0, var_1_18=1, var_1_1=1, var_1_3=2, var_1_5=129, var_1_6=127, var_1_7=126, var_1_8=61, var_1_9=10] [L92] CALL assume_abort_if_not(var_1_12 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=64, var_1_10=1, var_1_12=1, var_1_13=99, var_1_14=64, var_1_16=0, var_1_17=0, var_1_18=1, var_1_1=1, var_1_3=2, var_1_5=129, var_1_6=127, var_1_7=126, var_1_8=61, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=64, var_1_10=1, var_1_12=1, var_1_13=99, var_1_14=64, var_1_16=0, var_1_17=0, var_1_18=1, var_1_1=1, var_1_3=2, var_1_5=129, var_1_6=127, var_1_7=126, var_1_8=61, var_1_9=10] [L92] RET assume_abort_if_not(var_1_12 <= 1) VAL [isInitial=1, last_1_var_1_14=64, var_1_10=1, var_1_12=1, var_1_13=99, var_1_14=64, var_1_16=0, var_1_17=0, var_1_18=1, var_1_1=1, var_1_3=2, var_1_5=129, var_1_6=127, var_1_7=126, var_1_8=61, var_1_9=10] [L93] var_1_13 = __VERIFIER_nondet_long() [L94] CALL assume_abort_if_not(var_1_13 >= -2147483648) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=64, var_1_10=1, var_1_12=1, var_1_13=0, var_1_14=64, var_1_16=0, var_1_17=0, var_1_18=1, var_1_1=1, var_1_3=2, var_1_5=129, var_1_6=127, var_1_7=126, var_1_8=61, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=64, var_1_10=1, var_1_12=1, var_1_13=0, var_1_14=64, var_1_16=0, var_1_17=0, var_1_18=1, var_1_1=1, var_1_3=2, var_1_5=129, var_1_6=127, var_1_7=126, var_1_8=61, var_1_9=10] [L94] RET assume_abort_if_not(var_1_13 >= -2147483648) VAL [isInitial=1, last_1_var_1_14=64, var_1_10=1, var_1_12=1, var_1_13=0, var_1_14=64, var_1_16=0, var_1_17=0, var_1_18=1, var_1_1=1, var_1_3=2, var_1_5=129, var_1_6=127, var_1_7=126, var_1_8=61, var_1_9=10] [L95] CALL assume_abort_if_not(var_1_13 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=64, var_1_10=1, var_1_12=1, var_1_13=0, var_1_14=64, var_1_16=0, var_1_17=0, var_1_18=1, var_1_1=1, var_1_3=2, var_1_5=129, var_1_6=127, var_1_7=126, var_1_8=61, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=64, var_1_10=1, var_1_12=1, var_1_13=0, var_1_14=64, var_1_16=0, var_1_17=0, var_1_18=1, var_1_1=1, var_1_3=2, var_1_5=129, var_1_6=127, var_1_7=126, var_1_8=61, var_1_9=10] [L95] RET assume_abort_if_not(var_1_13 <= 2147483647) VAL [isInitial=1, last_1_var_1_14=64, var_1_10=1, var_1_12=1, var_1_13=0, var_1_14=64, var_1_16=0, var_1_17=0, var_1_18=1, var_1_1=1, var_1_3=2, var_1_5=129, var_1_6=127, var_1_7=126, var_1_8=61, var_1_9=10] [L96] var_1_17 = __VERIFIER_nondet_uchar() [L97] CALL assume_abort_if_not(var_1_17 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=64, var_1_10=1, var_1_12=1, var_1_13=0, var_1_14=64, var_1_16=0, var_1_18=1, var_1_1=1, var_1_3=2, var_1_5=129, var_1_6=127, var_1_7=126, var_1_8=61, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=64, var_1_10=1, var_1_12=1, var_1_13=0, var_1_14=64, var_1_16=0, var_1_18=1, var_1_1=1, var_1_3=2, var_1_5=129, var_1_6=127, var_1_7=126, var_1_8=61, var_1_9=10] [L97] RET assume_abort_if_not(var_1_17 >= 0) VAL [isInitial=1, last_1_var_1_14=64, var_1_10=1, var_1_12=1, var_1_13=0, var_1_14=64, var_1_16=0, var_1_18=1, var_1_1=1, var_1_3=2, var_1_5=129, var_1_6=127, var_1_7=126, var_1_8=61, var_1_9=10] [L98] CALL assume_abort_if_not(var_1_17 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=64, var_1_10=1, var_1_12=1, var_1_13=0, var_1_14=64, var_1_16=0, var_1_17=0, var_1_18=1, var_1_1=1, var_1_3=2, var_1_5=129, var_1_6=127, var_1_7=126, var_1_8=61, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=64, var_1_10=1, var_1_12=1, var_1_13=0, var_1_14=64, var_1_16=0, var_1_17=0, var_1_18=1, var_1_1=1, var_1_3=2, var_1_5=129, var_1_6=127, var_1_7=126, var_1_8=61, var_1_9=10] [L98] RET assume_abort_if_not(var_1_17 <= 0) VAL [isInitial=1, last_1_var_1_14=64, var_1_10=1, var_1_12=1, var_1_13=0, var_1_14=64, var_1_16=0, var_1_17=0, var_1_18=1, var_1_1=1, var_1_3=2, var_1_5=129, var_1_6=127, var_1_7=126, var_1_8=61, var_1_9=10] [L99] var_1_18 = __VERIFIER_nondet_uchar() [L100] CALL assume_abort_if_not(var_1_18 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=64, var_1_10=1, var_1_12=1, var_1_13=0, var_1_14=64, var_1_16=0, var_1_17=0, var_1_18=1, var_1_1=1, var_1_3=2, var_1_5=129, var_1_6=127, var_1_7=126, var_1_8=61, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=64, var_1_10=1, var_1_12=1, var_1_13=0, var_1_14=64, var_1_16=0, var_1_17=0, var_1_18=1, var_1_1=1, var_1_3=2, var_1_5=129, var_1_6=127, var_1_7=126, var_1_8=61, var_1_9=10] [L100] RET assume_abort_if_not(var_1_18 >= 1) VAL [isInitial=1, last_1_var_1_14=64, var_1_10=1, var_1_12=1, var_1_13=0, var_1_14=64, var_1_16=0, var_1_17=0, var_1_18=1, var_1_1=1, var_1_3=2, var_1_5=129, var_1_6=127, var_1_7=126, var_1_8=61, var_1_9=10] [L101] CALL assume_abort_if_not(var_1_18 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=64, var_1_10=1, var_1_12=1, var_1_13=0, var_1_14=64, var_1_16=0, var_1_17=0, var_1_18=1, var_1_1=1, var_1_3=2, var_1_5=129, var_1_6=127, var_1_7=126, var_1_8=61, var_1_9=10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=64, var_1_10=1, var_1_12=1, var_1_13=0, var_1_14=64, var_1_16=0, var_1_17=0, var_1_18=1, var_1_1=1, var_1_3=2, var_1_5=129, var_1_6=127, var_1_7=126, var_1_8=61, var_1_9=10] [L101] RET assume_abort_if_not(var_1_18 <= 1) VAL [isInitial=1, last_1_var_1_14=64, var_1_10=1, var_1_12=1, var_1_13=0, var_1_14=64, var_1_16=0, var_1_17=0, var_1_18=1, var_1_1=1, var_1_3=2, var_1_5=129, var_1_6=127, var_1_7=126, var_1_8=61, var_1_9=10] [L115] RET updateVariables() [L116] CALL step() [L40] EXPR last_1_var_1_14 >> var_1_3 VAL [isInitial=1, last_1_var_1_14=64, var_1_10=1, var_1_12=1, var_1_13=0, var_1_14=64, var_1_16=0, var_1_17=0, var_1_18=1, var_1_1=1, var_1_3=2, var_1_5=129, var_1_6=127, var_1_7=126, var_1_8=61, var_1_9=10] [L40] COND FALSE !((last_1_var_1_14 >> var_1_3) >= last_1_var_1_14) [L43] var_1_1 = (((((var_1_6) < (var_1_3)) ? (var_1_6) : (var_1_3))) + (((((var_1_8 + 1)) < (var_1_7)) ? ((var_1_8 + 1)) : (var_1_7)))) VAL [isInitial=1, last_1_var_1_14=64, var_1_10=1, var_1_12=1, var_1_13=0, var_1_14=64, var_1_16=0, var_1_17=0, var_1_18=1, var_1_1=64, var_1_3=2, var_1_5=129, var_1_6=127, var_1_7=126, var_1_8=61, var_1_9=10] [L45] COND FALSE !((var_1_8 + var_1_1) >= var_1_7) VAL [isInitial=1, last_1_var_1_14=64, var_1_10=1, var_1_12=1, var_1_13=0, var_1_14=64, var_1_16=0, var_1_17=0, var_1_18=1, var_1_1=64, var_1_3=2, var_1_5=129, var_1_6=127, var_1_7=126, var_1_8=61, var_1_9=10] [L48] COND TRUE var_1_12 || var_1_10 VAL [isInitial=1, last_1_var_1_14=64, var_1_10=1, var_1_12=1, var_1_13=0, var_1_14=64, var_1_16=0, var_1_17=0, var_1_18=1, var_1_1=64, var_1_3=2, var_1_5=129, var_1_6=127, var_1_7=126, var_1_8=61, var_1_9=10] [L49] EXPR var_1_8 << var_1_3 VAL [isInitial=1, last_1_var_1_14=64, var_1_10=1, var_1_12=1, var_1_13=0, var_1_14=64, var_1_16=0, var_1_17=0, var_1_18=1, var_1_1=64, var_1_3=2, var_1_5=129, var_1_6=127, var_1_7=126, var_1_8=61, var_1_9=10] [L49] COND TRUE var_1_1 >= (var_1_8 << var_1_3) [L50] COND TRUE var_1_6 > var_1_7 [L51] var_1_16 = var_1_17 VAL [isInitial=1, last_1_var_1_14=64, var_1_10=1, var_1_12=1, var_1_13=0, var_1_14=64, var_1_16=0, var_1_17=0, var_1_18=1, var_1_1=64, var_1_3=2, var_1_5=129, var_1_6=127, var_1_7=126, var_1_8=61, var_1_9=10] [L61] unsigned char stepLocal_1 = var_1_14; [L62] unsigned char stepLocal_0 = var_1_16; VAL [isInitial=1, last_1_var_1_14=64, stepLocal_0=0, stepLocal_1=64, var_1_10=1, var_1_12=1, var_1_13=0, var_1_14=64, var_1_16=0, var_1_17=0, var_1_18=1, var_1_1=64, var_1_3=2, var_1_5=129, var_1_6=127, var_1_7=126, var_1_8=61, var_1_9=10] [L63] COND FALSE !(\read(var_1_16)) VAL [isInitial=1, last_1_var_1_14=64, stepLocal_0=0, stepLocal_1=64, var_1_10=1, var_1_12=1, var_1_13=0, var_1_14=64, var_1_16=0, var_1_17=0, var_1_18=1, var_1_1=64, var_1_3=2, var_1_5=129, var_1_6=127, var_1_7=126, var_1_8=61, var_1_9=10] [L116] RET step() [L117] CALL, EXPR property() [L107] EXPR last_1_var_1_14 >> var_1_3 VAL [isInitial=1, last_1_var_1_14=64, var_1_10=1, var_1_12=1, var_1_13=0, var_1_14=64, var_1_16=0, var_1_17=0, var_1_18=1, var_1_1=64, var_1_3=2, var_1_5=129, var_1_6=127, var_1_7=126, var_1_8=61, var_1_9=10] [L107] EXPR (((((last_1_var_1_14 >> var_1_3) >= last_1_var_1_14) ? (var_1_1 == ((unsigned char) ((((var_1_3) < ((var_1_5 - ((((var_1_6) > (var_1_7)) ? (var_1_6) : (var_1_7)))))) ? (var_1_3) : ((var_1_5 - ((((var_1_6) > (var_1_7)) ? (var_1_6) : (var_1_7))))))))) : (var_1_1 == ((unsigned char) (((((var_1_6) < (var_1_3)) ? (var_1_6) : (var_1_3))) + (((((var_1_8 + 1)) < (var_1_7)) ? ((var_1_8 + 1)) : (var_1_7))))))) && (var_1_16 ? ((var_1_16 || var_1_16) ? ((var_1_14 > var_1_6) ? (var_1_9 == ((signed long int) var_1_13)) : 1) : 1) : 1)) && (((var_1_8 + var_1_1) >= var_1_7) ? (var_1_14 == ((unsigned char) var_1_6)) : 1)) && ((var_1_12 || var_1_10) ? ((var_1_1 >= (var_1_8 << var_1_3)) ? ((var_1_6 > var_1_7) ? (var_1_16 == ((unsigned char) var_1_17)) : (var_1_16 == ((unsigned char) 1))) : (var_1_16 == ((unsigned char) var_1_18))) : (var_1_16 == ((unsigned char) var_1_17))) VAL [isInitial=1, last_1_var_1_14=64, var_1_10=1, var_1_12=1, var_1_13=0, var_1_14=64, var_1_16=0, var_1_17=0, var_1_18=1, var_1_1=64, var_1_3=2, var_1_5=129, var_1_6=127, var_1_7=126, var_1_8=61, var_1_9=10] [L107] EXPR (var_1_12 || var_1_10) ? ((var_1_1 >= (var_1_8 << var_1_3)) ? ((var_1_6 > var_1_7) ? (var_1_16 == ((unsigned char) var_1_17)) : (var_1_16 == ((unsigned char) 1))) : (var_1_16 == ((unsigned char) var_1_18))) : (var_1_16 == ((unsigned char) var_1_17)) VAL [isInitial=1, last_1_var_1_14=64, var_1_10=1, var_1_12=1, var_1_13=0, var_1_14=64, var_1_16=0, var_1_17=0, var_1_18=1, var_1_1=64, var_1_3=2, var_1_5=129, var_1_6=127, var_1_7=126, var_1_8=61, var_1_9=10] [L107] EXPR var_1_8 << var_1_3 VAL [isInitial=1, last_1_var_1_14=64, var_1_10=1, var_1_12=1, var_1_13=0, var_1_14=64, var_1_16=0, var_1_17=0, var_1_18=1, var_1_1=64, var_1_3=2, var_1_5=129, var_1_6=127, var_1_7=126, var_1_8=61, var_1_9=10] [L107] EXPR (var_1_12 || var_1_10) ? ((var_1_1 >= (var_1_8 << var_1_3)) ? ((var_1_6 > var_1_7) ? (var_1_16 == ((unsigned char) var_1_17)) : (var_1_16 == ((unsigned char) 1))) : (var_1_16 == ((unsigned char) var_1_18))) : (var_1_16 == ((unsigned char) var_1_17)) VAL [isInitial=1, last_1_var_1_14=64, var_1_10=1, var_1_12=1, var_1_13=0, var_1_14=64, var_1_16=0, var_1_17=0, var_1_18=1, var_1_1=64, var_1_3=2, var_1_5=129, var_1_6=127, var_1_7=126, var_1_8=61, var_1_9=10] [L107] EXPR (((((last_1_var_1_14 >> var_1_3) >= last_1_var_1_14) ? (var_1_1 == ((unsigned char) ((((var_1_3) < ((var_1_5 - ((((var_1_6) > (var_1_7)) ? (var_1_6) : (var_1_7)))))) ? (var_1_3) : ((var_1_5 - ((((var_1_6) > (var_1_7)) ? (var_1_6) : (var_1_7))))))))) : (var_1_1 == ((unsigned char) (((((var_1_6) < (var_1_3)) ? (var_1_6) : (var_1_3))) + (((((var_1_8 + 1)) < (var_1_7)) ? ((var_1_8 + 1)) : (var_1_7))))))) && (var_1_16 ? ((var_1_16 || var_1_16) ? ((var_1_14 > var_1_6) ? (var_1_9 == ((signed long int) var_1_13)) : 1) : 1) : 1)) && (((var_1_8 + var_1_1) >= var_1_7) ? (var_1_14 == ((unsigned char) var_1_6)) : 1)) && ((var_1_12 || var_1_10) ? ((var_1_1 >= (var_1_8 << var_1_3)) ? ((var_1_6 > var_1_7) ? (var_1_16 == ((unsigned char) var_1_17)) : (var_1_16 == ((unsigned char) 1))) : (var_1_16 == ((unsigned char) var_1_18))) : (var_1_16 == ((unsigned char) var_1_17))) VAL [isInitial=1, last_1_var_1_14=64, var_1_10=1, var_1_12=1, var_1_13=0, var_1_14=64, var_1_16=0, var_1_17=0, var_1_18=1, var_1_1=64, var_1_3=2, var_1_5=129, var_1_6=127, var_1_7=126, var_1_8=61, var_1_9=10] [L107-L108] return (((((last_1_var_1_14 >> var_1_3) >= last_1_var_1_14) ? (var_1_1 == ((unsigned char) ((((var_1_3) < ((var_1_5 - ((((var_1_6) > (var_1_7)) ? (var_1_6) : (var_1_7)))))) ? (var_1_3) : ((var_1_5 - ((((var_1_6) > (var_1_7)) ? (var_1_6) : (var_1_7))))))))) : (var_1_1 == ((unsigned char) (((((var_1_6) < (var_1_3)) ? (var_1_6) : (var_1_3))) + (((((var_1_8 + 1)) < (var_1_7)) ? ((var_1_8 + 1)) : (var_1_7))))))) && (var_1_16 ? ((var_1_16 || var_1_16) ? ((var_1_14 > var_1_6) ? (var_1_9 == ((signed long int) var_1_13)) : 1) : 1) : 1)) && (((var_1_8 + var_1_1) >= var_1_7) ? (var_1_14 == ((unsigned char) var_1_6)) : 1)) && ((var_1_12 || var_1_10) ? ((var_1_1 >= (var_1_8 << var_1_3)) ? ((var_1_6 > var_1_7) ? (var_1_16 == ((unsigned char) var_1_17)) : (var_1_16 == ((unsigned char) 1))) : (var_1_16 == ((unsigned char) var_1_18))) : (var_1_16 == ((unsigned char) var_1_17))) ; [L117] RET, EXPR property() [L117] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_14=64, var_1_10=1, var_1_12=1, var_1_13=0, var_1_14=64, var_1_16=0, var_1_17=0, var_1_18=1, var_1_1=64, var_1_3=2, var_1_5=129, var_1_6=127, var_1_7=126, var_1_8=61, var_1_9=10] [L19] reach_error() VAL [isInitial=1, last_1_var_1_14=64, var_1_10=1, var_1_12=1, var_1_13=0, var_1_14=64, var_1_16=0, var_1_17=0, var_1_18=1, var_1_1=64, var_1_3=2, var_1_5=129, var_1_6=127, var_1_7=126, var_1_8=61, var_1_9=10] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 72 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 53.5s, OverallIterations: 27, TraceHistogramMax: 20, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 8.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2550 SdHoareTripleChecker+Valid, 4.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2531 mSDsluCounter, 12552 SdHoareTripleChecker+Invalid, 4.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 9461 mSDsCounter, 269 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 4761 IncrementalHoareTripleChecker+Invalid, 5030 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 269 mSolverCounterUnsat, 3091 mSDtfsCounter, 4761 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 531 GetRequests, 339 SyntacticMatches, 1 SemanticMatches, 191 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 299 ImplicationChecksByTransitivity, 4.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=797occurred in iteration=20, InterpolantAutomatonStates: 181, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.1s AutomataMinimizationTime, 26 MinimizatonAttempts, 1735 StatesRemovedByMinimization, 23 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 42.3s InterpolantComputationTime, 3873 NumberOfCodeBlocks, 3873 NumberOfCodeBlocksAsserted, 29 NumberOfCheckSat, 3705 ConstructedInterpolants, 0 QuantifiedInterpolants, 17076 SizeOfPredicates, 1 NumberOfNonLiveVariables, 586 ConjunctsInSsa, 14 ConjunctsInUnsatCore, 28 InterpolantComputations, 26 PerfectInterpolantSequences, 21239/21280 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-11-22 10:10:05,954 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 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_floatingpointinfluence_no-floats_file-56.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 97d791cbaec134197a8e3d1f03f35ec97aa0c52c94b35e8b29d7fd873617c9b5 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-803cd42-m [2024-11-22 10:10:08,176 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-22 10:10:08,251 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-22 10:10:08,257 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-22 10:10:08,257 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-22 10:10:08,286 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-22 10:10:08,290 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-22 10:10:08,290 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-22 10:10:08,291 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-22 10:10:08,291 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-22 10:10:08,291 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-22 10:10:08,292 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-22 10:10:08,292 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-22 10:10:08,293 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-22 10:10:08,293 INFO L153 SettingsManager]: * Use SBE=true [2024-11-22 10:10:08,293 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-22 10:10:08,294 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-22 10:10:08,294 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-22 10:10:08,297 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-22 10:10:08,297 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-22 10:10:08,297 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-22 10:10:08,300 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-22 10:10:08,300 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-22 10:10:08,301 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-22 10:10:08,301 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-22 10:10:08,301 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-22 10:10:08,301 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-22 10:10:08,301 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-22 10:10:08,302 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-22 10:10:08,302 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-22 10:10:08,302 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-22 10:10:08,302 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-22 10:10:08,303 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-22 10:10:08,303 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-22 10:10:08,303 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-22 10:10:08,310 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-22 10:10:08,311 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-22 10:10:08,312 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-22 10:10:08,312 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-22 10:10:08,313 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-22 10:10:08,313 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-22 10:10:08,314 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-22 10:10:08,314 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-22 10:10:08,314 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-22 10:10:08,315 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 -> 97d791cbaec134197a8e3d1f03f35ec97aa0c52c94b35e8b29d7fd873617c9b5 [2024-11-22 10:10:08,636 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-22 10:10:08,659 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-22 10:10:08,661 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-22 10:10:08,662 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-22 10:10:08,663 INFO L274 PluginConnector]: CDTParser initialized [2024-11-22 10:10:08,664 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-56.i [2024-11-22 10:10:10,196 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-22 10:10:10,416 INFO L384 CDTParser]: Found 1 translation units. [2024-11-22 10:10:10,417 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-56.i [2024-11-22 10:10:10,430 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2e929845e/801bcfce855d45559ea63f2cd1717c1f/FLAGbcd6a00a6 [2024-11-22 10:10:10,787 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2e929845e/801bcfce855d45559ea63f2cd1717c1f [2024-11-22 10:10:10,790 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-22 10:10:10,791 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-22 10:10:10,792 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-22 10:10:10,792 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-22 10:10:10,797 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-22 10:10:10,798 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 10:10:10" (1/1) ... [2024-11-22 10:10:10,801 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2ccd4b93 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:10:10, skipping insertion in model container [2024-11-22 10:10:10,801 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 10:10:10" (1/1) ... [2024-11-22 10:10:10,828 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-22 10:10:11,008 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_floatingpointinfluence_no-floats_file-56.i[916,929] [2024-11-22 10:10:11,074 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-22 10:10:11,093 INFO L200 MainTranslator]: Completed pre-run [2024-11-22 10:10:11,108 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_floatingpointinfluence_no-floats_file-56.i[916,929] [2024-11-22 10:10:11,142 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-22 10:10:11,165 INFO L204 MainTranslator]: Completed translation [2024-11-22 10:10:11,166 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:10:11 WrapperNode [2024-11-22 10:10:11,166 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-22 10:10:11,167 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-22 10:10:11,167 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-22 10:10:11,167 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-22 10:10:11,174 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:10:11" (1/1) ... [2024-11-22 10:10:11,189 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:10:11" (1/1) ... [2024-11-22 10:10:11,226 INFO L138 Inliner]: procedures = 27, calls = 33, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 118 [2024-11-22 10:10:11,227 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-22 10:10:11,229 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-22 10:10:11,229 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-22 10:10:11,229 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-22 10:10:11,240 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:10:11" (1/1) ... [2024-11-22 10:10:11,240 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:10:11" (1/1) ... [2024-11-22 10:10:11,245 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:10:11" (1/1) ... [2024-11-22 10:10:11,266 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 10:10:11,267 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:10:11" (1/1) ... [2024-11-22 10:10:11,267 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:10:11" (1/1) ... [2024-11-22 10:10:11,277 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:10:11" (1/1) ... [2024-11-22 10:10:11,280 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:10:11" (1/1) ... [2024-11-22 10:10:11,285 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:10:11" (1/1) ... [2024-11-22 10:10:11,289 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:10:11" (1/1) ... [2024-11-22 10:10:11,292 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-22 10:10:11,297 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-22 10:10:11,297 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-22 10:10:11,297 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-22 10:10:11,298 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:10:11" (1/1) ... [2024-11-22 10:10:11,303 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-22 10:10:11,318 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 10:10:11,334 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 10:10:11,340 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 10:10:11,387 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-22 10:10:11,387 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-22 10:10:11,387 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-22 10:10:11,387 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-22 10:10:11,387 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-22 10:10:11,389 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-22 10:10:11,472 INFO L238 CfgBuilder]: Building ICFG [2024-11-22 10:10:11,476 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-22 10:10:11,768 INFO L? ?]: Removed 12 outVars from TransFormulas that were not future-live. [2024-11-22 10:10:11,769 INFO L287 CfgBuilder]: Performing block encoding [2024-11-22 10:10:11,785 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-22 10:10:11,785 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-22 10:10:11,786 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 10:10:11 BoogieIcfgContainer [2024-11-22 10:10:11,786 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-22 10:10:11,788 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-22 10:10:11,788 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-22 10:10:11,791 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-22 10:10:11,791 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.11 10:10:10" (1/3) ... [2024-11-22 10:10:11,791 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5bf9251d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 10:10:11, skipping insertion in model container [2024-11-22 10:10:11,792 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:10:11" (2/3) ... [2024-11-22 10:10:11,792 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5bf9251d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 10:10:11, skipping insertion in model container [2024-11-22 10:10:11,792 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 10:10:11" (3/3) ... [2024-11-22 10:10:11,793 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_floatingpointinfluence_no-floats_file-56.i [2024-11-22 10:10:11,804 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-22 10:10:11,804 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-22 10:10:11,864 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-22 10:10:11,870 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;@779e99f9, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-22 10:10:11,870 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-22 10:10:11,873 INFO L276 IsEmpty]: Start isEmpty. Operand has 58 states, 35 states have (on average 1.3714285714285714) internal successors, (48), 36 states have internal predecessors, (48), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-11-22 10:10:11,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2024-11-22 10:10:11,885 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 10:10:11,886 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 10:10:11,886 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 10:10:11,890 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 10:10:11,890 INFO L85 PathProgramCache]: Analyzing trace with hash 1379963335, now seen corresponding path program 1 times [2024-11-22 10:10:11,901 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 10:10:11,901 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [829013992] [2024-11-22 10:10:11,902 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 10:10:11,902 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 10:10:11,902 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 10:10:11,918 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 10:10:11,920 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 10:10:12,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 10:10:12,057 INFO L255 TraceCheckSpWp]: Trace formula consists of 199 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-22 10:10:12,072 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 10:10:12,123 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 398 proven. 0 refuted. 0 times theorem prover too weak. 362 trivial. 0 not checked. [2024-11-22 10:10:12,123 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-22 10:10:12,124 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-22 10:10:12,125 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [829013992] [2024-11-22 10:10:12,126 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [829013992] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 10:10:12,126 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 10:10:12,126 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-22 10:10:12,128 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [795813030] [2024-11-22 10:10:12,128 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 10:10:12,132 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-22 10:10:12,133 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-22 10:10:12,153 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-22 10:10:12,154 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-22 10:10:12,156 INFO L87 Difference]: Start difference. First operand has 58 states, 35 states have (on average 1.3714285714285714) internal successors, (48), 36 states have internal predecessors, (48), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) Second operand has 2 states, 2 states have (on average 15.5) internal successors, (31), 2 states have internal predecessors, (31), 2 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2024-11-22 10:10:12,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 10:10:12,189 INFO L93 Difference]: Finished difference Result 109 states and 190 transitions. [2024-11-22 10:10:12,190 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-22 10:10:12,192 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 15.5) internal successors, (31), 2 states have internal predecessors, (31), 2 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) Word has length 124 [2024-11-22 10:10:12,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 10:10:12,197 INFO L225 Difference]: With dead ends: 109 [2024-11-22 10:10:12,197 INFO L226 Difference]: Without dead ends: 54 [2024-11-22 10:10:12,200 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 123 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 10:10:12,202 INFO L432 NwaCegarLoop]: 81 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, 81 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 10:10:12,203 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-22 10:10:12,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2024-11-22 10:10:12,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2024-11-22 10:10:12,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 32 states have (on average 1.28125) internal successors, (41), 32 states have internal predecessors, (41), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-11-22 10:10:12,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 81 transitions. [2024-11-22 10:10:12,241 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 81 transitions. Word has length 124 [2024-11-22 10:10:12,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 10:10:12,243 INFO L471 AbstractCegarLoop]: Abstraction has 54 states and 81 transitions. [2024-11-22 10:10:12,243 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 15.5) internal successors, (31), 2 states have internal predecessors, (31), 2 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2024-11-22 10:10:12,243 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 81 transitions. [2024-11-22 10:10:12,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2024-11-22 10:10:12,246 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 10:10:12,246 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 10:10:12,250 INFO L552 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)] Ended with exit code 0 [2024-11-22 10:10:12,447 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 10:10:12,447 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 10:10:12,448 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 10:10:12,448 INFO L85 PathProgramCache]: Analyzing trace with hash 1421617607, now seen corresponding path program 1 times [2024-11-22 10:10:12,449 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 10:10:12,449 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1169593372] [2024-11-22 10:10:12,449 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 10:10:12,449 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 10:10:12,450 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 10:10:12,453 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 10:10:12,454 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 [2024-11-22 10:10:12,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 10:10:12,577 INFO L255 TraceCheckSpWp]: Trace formula consists of 199 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-22 10:10:12,586 INFO L278 TraceCheckSpWp]: Computing forward predicates...