./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-18.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 3289d67d Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-18.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 20590a3b952f77870c005ea22da4ee2c3e5fa42d319fcea291376108e5b76f76 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-3289d67-m [2024-11-16 15:36:02,660 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-16 15:36:02,739 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-16 15:36:02,744 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-16 15:36:02,744 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-16 15:36:02,775 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-16 15:36:02,778 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-16 15:36:02,779 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-16 15:36:02,779 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-16 15:36:02,779 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-16 15:36:02,780 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-16 15:36:02,780 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-16 15:36:02,780 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-16 15:36:02,781 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-16 15:36:02,781 INFO L153 SettingsManager]: * Use SBE=true [2024-11-16 15:36:02,781 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-16 15:36:02,782 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-16 15:36:02,785 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-16 15:36:02,785 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-16 15:36:02,786 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-16 15:36:02,786 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-16 15:36:02,787 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-16 15:36:02,788 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-16 15:36:02,788 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-16 15:36:02,788 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-16 15:36:02,789 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-16 15:36:02,789 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-16 15:36:02,789 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-16 15:36:02,790 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-16 15:36:02,790 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-16 15:36:02,800 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-16 15:36:02,801 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-16 15:36:02,801 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 15:36:02,802 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-16 15:36:02,802 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-16 15:36:02,802 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-16 15:36:02,802 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-16 15:36:02,803 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-16 15:36:02,803 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-16 15:36:02,803 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-16 15:36:02,804 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-16 15:36:02,804 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-16 15:36:02,804 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 -> 20590a3b952f77870c005ea22da4ee2c3e5fa42d319fcea291376108e5b76f76 [2024-11-16 15:36:03,022 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-16 15:36:03,044 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-16 15:36:03,049 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-16 15:36:03,050 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-16 15:36:03,050 INFO L274 PluginConnector]: CDTParser initialized [2024-11-16 15:36:03,051 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-18.i [2024-11-16 15:36:04,480 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-16 15:36:04,671 INFO L384 CDTParser]: Found 1 translation units. [2024-11-16 15:36:04,672 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-18.i [2024-11-16 15:36:04,682 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2174c1b88/e34c06c82e6244828e2c9e4578fc6b6f/FLAG6a0da1f1d [2024-11-16 15:36:05,063 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2174c1b88/e34c06c82e6244828e2c9e4578fc6b6f [2024-11-16 15:36:05,066 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-16 15:36:05,067 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-16 15:36:05,068 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-16 15:36:05,068 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-16 15:36:05,073 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-16 15:36:05,074 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 03:36:05" (1/1) ... [2024-11-16 15:36:05,074 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6ffa53c1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:36:05, skipping insertion in model container [2024-11-16 15:36:05,074 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 03:36:05" (1/1) ... [2024-11-16 15:36:05,095 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-16 15:36:05,276 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_has-floats_file-18.i[917,930] [2024-11-16 15:36:05,327 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 15:36:05,347 INFO L200 MainTranslator]: Completed pre-run [2024-11-16 15:36:05,358 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_has-floats_file-18.i[917,930] [2024-11-16 15:36:05,376 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 15:36:05,393 INFO L204 MainTranslator]: Completed translation [2024-11-16 15:36:05,394 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:36:05 WrapperNode [2024-11-16 15:36:05,394 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-16 15:36:05,395 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-16 15:36:05,396 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-16 15:36:05,396 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-16 15:36:05,402 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:36:05" (1/1) ... [2024-11-16 15:36:05,413 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:36:05" (1/1) ... [2024-11-16 15:36:05,473 INFO L138 Inliner]: procedures = 26, calls = 25, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 142 [2024-11-16 15:36:05,474 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-16 15:36:05,475 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-16 15:36:05,475 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-16 15:36:05,475 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-16 15:36:05,485 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:36:05" (1/1) ... [2024-11-16 15:36:05,485 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:36:05" (1/1) ... [2024-11-16 15:36:05,488 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:36:05" (1/1) ... [2024-11-16 15:36:05,509 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-16 15:36:05,509 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:36:05" (1/1) ... [2024-11-16 15:36:05,509 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:36:05" (1/1) ... [2024-11-16 15:36:05,516 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:36:05" (1/1) ... [2024-11-16 15:36:05,517 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:36:05" (1/1) ... [2024-11-16 15:36:05,518 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:36:05" (1/1) ... [2024-11-16 15:36:05,519 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:36:05" (1/1) ... [2024-11-16 15:36:05,522 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-16 15:36:05,523 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-16 15:36:05,524 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-16 15:36:05,524 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-16 15:36:05,524 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:36:05" (1/1) ... [2024-11-16 15:36:05,534 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 15:36:05,554 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 15:36:05,570 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-16 15:36:05,572 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-16 15:36:05,617 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-16 15:36:05,618 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-16 15:36:05,618 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-16 15:36:05,618 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-16 15:36:05,618 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-16 15:36:05,618 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-16 15:36:05,690 INFO L256 CfgBuilder]: Building ICFG [2024-11-16 15:36:05,692 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-16 15:36:05,986 INFO L1250 $ProcedureCfgBuilder]: dead code at ProgramPoint L89: havoc property_#t~bitwise13#1;havoc property_#t~bitwise14#1;havoc property_#t~short15#1; [2024-11-16 15:36:06,022 INFO L? ?]: Removed 19 outVars from TransFormulas that were not future-live. [2024-11-16 15:36:06,022 INFO L307 CfgBuilder]: Performing block encoding [2024-11-16 15:36:06,066 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-16 15:36:06,066 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-16 15:36:06,067 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 03:36:06 BoogieIcfgContainer [2024-11-16 15:36:06,067 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-16 15:36:06,071 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-16 15:36:06,072 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-16 15:36:06,075 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-16 15:36:06,075 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.11 03:36:05" (1/3) ... [2024-11-16 15:36:06,077 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4270339b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 03:36:06, skipping insertion in model container [2024-11-16 15:36:06,077 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:36:05" (2/3) ... [2024-11-16 15:36:06,077 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4270339b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 03:36:06, skipping insertion in model container [2024-11-16 15:36:06,077 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 03:36:06" (3/3) ... [2024-11-16 15:36:06,079 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_floatingpointinfluence_has-floats_file-18.i [2024-11-16 15:36:06,097 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-16 15:36:06,098 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-16 15:36:06,158 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-16 15:36:06,169 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;@6f9b8b83, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-16 15:36:06,169 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-16 15:36:06,175 INFO L276 IsEmpty]: Start isEmpty. Operand has 67 states, 52 states have (on average 1.4230769230769231) internal successors, (74), 53 states have internal predecessors, (74), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-16 15:36:06,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2024-11-16 15:36:06,187 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 15:36:06,188 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 15:36:06,189 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 15:36:06,194 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 15:36:06,195 INFO L85 PathProgramCache]: Analyzing trace with hash -1157111820, now seen corresponding path program 1 times [2024-11-16 15:36:06,205 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 15:36:06,205 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [192143102] [2024-11-16 15:36:06,205 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 15:36:06,206 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 15:36:06,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:36:06,432 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 15:36:06,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:36:06,440 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-16 15:36:06,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:36:06,445 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-16 15:36:06,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:36:06,450 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-16 15:36:06,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:36:06,454 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-16 15:36:06,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:36:06,458 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-16 15:36:06,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:36:06,463 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-16 15:36:06,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:36:06,467 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-16 15:36:06,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:36:06,472 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-16 15:36:06,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:36:06,479 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-16 15:36:06,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:36:06,485 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-16 15:36:06,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:36:06,489 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-16 15:36:06,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:36:06,495 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-16 15:36:06,495 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 15:36:06,496 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [192143102] [2024-11-16 15:36:06,496 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [192143102] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 15:36:06,497 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 15:36:06,497 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-16 15:36:06,498 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1546491493] [2024-11-16 15:36:06,501 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 15:36:06,506 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-16 15:36:06,506 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 15:36:06,546 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-16 15:36:06,547 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-16 15:36:06,550 INFO L87 Difference]: Start difference. First operand has 67 states, 52 states have (on average 1.4230769230769231) internal successors, (74), 53 states have internal predecessors, (74), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Second operand has 2 states, 2 states have (on average 16.0) internal successors, (32), 2 states have internal predecessors, (32), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-16 15:36:06,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 15:36:06,599 INFO L93 Difference]: Finished difference Result 126 states and 201 transitions. [2024-11-16 15:36:06,601 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-16 15:36:06,603 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 16.0) internal successors, (32), 2 states have internal predecessors, (32), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) Word has length 89 [2024-11-16 15:36:06,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 15:36:06,611 INFO L225 Difference]: With dead ends: 126 [2024-11-16 15:36:06,612 INFO L226 Difference]: Without dead ends: 62 [2024-11-16 15:36:06,616 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-16 15:36:06,619 INFO L432 NwaCegarLoop]: 86 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 86 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-16 15:36:06,621 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 86 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-16 15:36:06,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2024-11-16 15:36:06,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2024-11-16 15:36:06,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 48 states have (on average 1.375) internal successors, (66), 48 states have internal predecessors, (66), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-16 15:36:06,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 90 transitions. [2024-11-16 15:36:06,673 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 90 transitions. Word has length 89 [2024-11-16 15:36:06,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 15:36:06,675 INFO L471 AbstractCegarLoop]: Abstraction has 62 states and 90 transitions. [2024-11-16 15:36:06,675 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 16.0) internal successors, (32), 2 states have internal predecessors, (32), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-16 15:36:06,676 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 90 transitions. [2024-11-16 15:36:06,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2024-11-16 15:36:06,681 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 15:36:06,681 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 15:36:06,682 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-16 15:36:06,682 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 15:36:06,683 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 15:36:06,683 INFO L85 PathProgramCache]: Analyzing trace with hash 1946302870, now seen corresponding path program 1 times [2024-11-16 15:36:06,683 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 15:36:06,684 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1667065560] [2024-11-16 15:36:06,684 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 15:36:06,684 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 15:36:06,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:36:07,088 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 15:36:07,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:36:07,099 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-16 15:36:07,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:36:07,115 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-16 15:36:07,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:36:07,132 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-16 15:36:07,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:36:07,144 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-16 15:36:07,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:36:07,158 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-16 15:36:07,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:36:07,169 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-16 15:36:07,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:36:07,179 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-16 15:36:07,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:36:07,193 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-16 15:36:07,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:36:07,202 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-16 15:36:07,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:36:07,210 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-16 15:36:07,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:36:07,217 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-16 15:36:07,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:36:07,232 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-16 15:36:07,233 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 15:36:07,236 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1667065560] [2024-11-16 15:36:07,236 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1667065560] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 15:36:07,237 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 15:36:07,237 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-16 15:36:07,237 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1318348544] [2024-11-16 15:36:07,237 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 15:36:07,239 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 15:36:07,239 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 15:36:07,240 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 15:36:07,240 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 15:36:07,240 INFO L87 Difference]: Start difference. First operand 62 states and 90 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, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-16 15:36:07,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 15:36:07,416 INFO L93 Difference]: Finished difference Result 180 states and 264 transitions. [2024-11-16 15:36:07,417 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 15:36:07,417 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, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 89 [2024-11-16 15:36:07,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 15:36:07,419 INFO L225 Difference]: With dead ends: 180 [2024-11-16 15:36:07,420 INFO L226 Difference]: Without dead ends: 121 [2024-11-16 15:36:07,420 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 15:36:07,422 INFO L432 NwaCegarLoop]: 85 mSDtfsCounter, 55 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 136 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-16 15:36:07,422 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 136 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-16 15:36:07,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2024-11-16 15:36:07,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 117. [2024-11-16 15:36:07,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117 states, 90 states have (on average 1.3444444444444446) internal successors, (121), 90 states have internal predecessors, (121), 24 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-11-16 15:36:07,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 169 transitions. [2024-11-16 15:36:07,452 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 169 transitions. Word has length 89 [2024-11-16 15:36:07,452 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 15:36:07,453 INFO L471 AbstractCegarLoop]: Abstraction has 117 states and 169 transitions. [2024-11-16 15:36:07,453 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, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-16 15:36:07,453 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 169 transitions. [2024-11-16 15:36:07,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2024-11-16 15:36:07,456 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 15:36:07,456 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 15:36:07,456 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-16 15:36:07,456 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 15:36:07,457 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 15:36:07,457 INFO L85 PathProgramCache]: Analyzing trace with hash -1220926899, now seen corresponding path program 1 times [2024-11-16 15:36:07,457 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 15:36:07,457 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1405694288] [2024-11-16 15:36:07,457 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 15:36:07,458 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 15:36:07,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:36:08,024 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 15:36:08,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:36:08,054 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-16 15:36:08,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:36:08,062 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-16 15:36:08,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:36:08,068 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-16 15:36:08,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:36:08,077 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-16 15:36:08,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:36:08,083 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-16 15:36:08,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:36:08,088 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-16 15:36:08,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:36:08,093 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-16 15:36:08,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:36:08,100 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-16 15:36:08,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:36:08,107 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-16 15:36:08,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:36:08,111 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-16 15:36:08,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:36:08,117 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-16 15:36:08,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:36:08,123 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 33 refuted. 0 times theorem prover too weak. 231 trivial. 0 not checked. [2024-11-16 15:36:08,125 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 15:36:08,125 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1405694288] [2024-11-16 15:36:08,126 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1405694288] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-16 15:36:08,126 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1197737781] [2024-11-16 15:36:08,126 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 15:36:08,127 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 15:36:08,127 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 15:36:08,129 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-16 15:36:08,131 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-16 15:36:08,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:36:08,230 INFO L255 TraceCheckSpWp]: Trace formula consists of 219 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-11-16 15:36:08,237 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 15:36:08,746 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 11 proven. 33 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-11-16 15:36:08,748 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-16 15:36:09,135 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 33 refuted. 0 times theorem prover too weak. 231 trivial. 0 not checked. [2024-11-16 15:36:09,136 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1197737781] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-16 15:36:09,136 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-16 15:36:09,136 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 9] total 22 [2024-11-16 15:36:09,136 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1689203552] [2024-11-16 15:36:09,136 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-16 15:36:09,137 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2024-11-16 15:36:09,137 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 15:36:09,138 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2024-11-16 15:36:09,139 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=384, Unknown=0, NotChecked=0, Total=462 [2024-11-16 15:36:09,140 INFO L87 Difference]: Start difference. First operand 117 states and 169 transitions. Second operand has 22 states, 21 states have (on average 3.1904761904761907) internal successors, (67), 22 states have internal predecessors, (67), 4 states have call successors, (36), 3 states have call predecessors, (36), 5 states have return successors, (36), 2 states have call predecessors, (36), 4 states have call successors, (36) [2024-11-16 15:36:10,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 15:36:10,150 INFO L93 Difference]: Finished difference Result 375 states and 530 transitions. [2024-11-16 15:36:10,151 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-11-16 15:36:10,151 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 21 states have (on average 3.1904761904761907) internal successors, (67), 22 states have internal predecessors, (67), 4 states have call successors, (36), 3 states have call predecessors, (36), 5 states have return successors, (36), 2 states have call predecessors, (36), 4 states have call successors, (36) Word has length 90 [2024-11-16 15:36:10,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 15:36:10,156 INFO L225 Difference]: With dead ends: 375 [2024-11-16 15:36:10,156 INFO L226 Difference]: Without dead ends: 261 [2024-11-16 15:36:10,158 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 233 GetRequests, 195 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 252 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=350, Invalid=1210, Unknown=0, NotChecked=0, Total=1560 [2024-11-16 15:36:10,161 INFO L432 NwaCegarLoop]: 73 mSDtfsCounter, 605 mSDsluCounter, 335 mSDsCounter, 0 mSdLazyCounter, 650 mSolverCounterSat, 101 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 605 SdHoareTripleChecker+Valid, 408 SdHoareTripleChecker+Invalid, 751 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 101 IncrementalHoareTripleChecker+Valid, 650 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-16 15:36:10,161 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [605 Valid, 408 Invalid, 751 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [101 Valid, 650 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-16 15:36:10,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 261 states. [2024-11-16 15:36:10,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 261 to 250. [2024-11-16 15:36:10,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 250 states, 193 states have (on average 1.217616580310881) internal successors, (235), 193 states have internal predecessors, (235), 48 states have call successors, (48), 8 states have call predecessors, (48), 8 states have return successors, (48), 48 states have call predecessors, (48), 48 states have call successors, (48) [2024-11-16 15:36:10,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 331 transitions. [2024-11-16 15:36:10,217 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 331 transitions. Word has length 90 [2024-11-16 15:36:10,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 15:36:10,218 INFO L471 AbstractCegarLoop]: Abstraction has 250 states and 331 transitions. [2024-11-16 15:36:10,219 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 21 states have (on average 3.1904761904761907) internal successors, (67), 22 states have internal predecessors, (67), 4 states have call successors, (36), 3 states have call predecessors, (36), 5 states have return successors, (36), 2 states have call predecessors, (36), 4 states have call successors, (36) [2024-11-16 15:36:10,219 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 331 transitions. [2024-11-16 15:36:10,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2024-11-16 15:36:10,221 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 15:36:10,221 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 15:36:10,239 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-16 15:36:10,421 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 15:36:10,422 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 15:36:10,422 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 15:36:10,423 INFO L85 PathProgramCache]: Analyzing trace with hash -67932871, now seen corresponding path program 1 times [2024-11-16 15:36:10,423 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 15:36:10,423 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1489549659] [2024-11-16 15:36:10,423 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 15:36:10,423 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 15:36:10,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:36:13,242 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 15:36:13,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:36:13,248 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-16 15:36:13,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:36:13,251 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-16 15:36:13,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:36:13,256 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-16 15:36:13,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:36:13,260 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-16 15:36:13,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:36:13,265 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-16 15:36:13,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:36:13,269 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-16 15:36:13,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:36:13,274 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-16 15:36:13,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:36:13,280 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-16 15:36:13,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:36:13,297 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-16 15:36:13,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:36:13,305 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-16 15:36:13,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:36:13,309 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-16 15:36:13,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:36:13,315 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-16 15:36:13,315 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 15:36:13,318 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1489549659] [2024-11-16 15:36:13,319 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1489549659] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 15:36:13,319 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 15:36:13,319 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2024-11-16 15:36:13,320 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1606379300] [2024-11-16 15:36:13,320 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 15:36:13,320 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-16 15:36:13,320 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 15:36:13,321 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-16 15:36:13,321 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2024-11-16 15:36:13,321 INFO L87 Difference]: Start difference. First operand 250 states and 331 transitions. Second operand has 13 states, 13 states have (on average 2.6153846153846154) internal successors, (34), 13 states have internal predecessors, (34), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-16 15:36:16,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 15:36:16,445 INFO L93 Difference]: Finished difference Result 705 states and 912 transitions. [2024-11-16 15:36:16,446 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2024-11-16 15:36:16,446 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.6153846153846154) internal successors, (34), 13 states have internal predecessors, (34), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 91 [2024-11-16 15:36:16,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 15:36:16,450 INFO L225 Difference]: With dead ends: 705 [2024-11-16 15:36:16,450 INFO L226 Difference]: Without dead ends: 458 [2024-11-16 15:36:16,453 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 237 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=277, Invalid=983, Unknown=0, NotChecked=0, Total=1260 [2024-11-16 15:36:16,454 INFO L432 NwaCegarLoop]: 103 mSDtfsCounter, 282 mSDsluCounter, 609 mSDsCounter, 0 mSdLazyCounter, 1215 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 282 SdHoareTripleChecker+Valid, 712 SdHoareTripleChecker+Invalid, 1261 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 1215 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2024-11-16 15:36:16,454 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [282 Valid, 712 Invalid, 1261 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 1215 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2024-11-16 15:36:16,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 458 states. [2024-11-16 15:36:16,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 458 to 285. [2024-11-16 15:36:16,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 285 states, 228 states have (on average 1.219298245614035) internal successors, (278), 228 states have internal predecessors, (278), 48 states have call successors, (48), 8 states have call predecessors, (48), 8 states have return successors, (48), 48 states have call predecessors, (48), 48 states have call successors, (48) [2024-11-16 15:36:16,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 285 states to 285 states and 374 transitions. [2024-11-16 15:36:16,497 INFO L78 Accepts]: Start accepts. Automaton has 285 states and 374 transitions. Word has length 91 [2024-11-16 15:36:16,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 15:36:16,498 INFO L471 AbstractCegarLoop]: Abstraction has 285 states and 374 transitions. [2024-11-16 15:36:16,498 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.6153846153846154) internal successors, (34), 13 states have internal predecessors, (34), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-16 15:36:16,498 INFO L276 IsEmpty]: Start isEmpty. Operand 285 states and 374 transitions. [2024-11-16 15:36:16,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2024-11-16 15:36:16,500 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 15:36:16,500 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 15:36:16,501 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-16 15:36:16,501 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 15:36:16,501 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 15:36:16,501 INFO L85 PathProgramCache]: Analyzing trace with hash 1285376826, now seen corresponding path program 1 times [2024-11-16 15:36:16,502 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 15:36:16,502 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1514172230] [2024-11-16 15:36:16,502 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 15:36:16,502 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 15:36:16,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:36:19,976 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 15:36:19,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:36:19,984 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-16 15:36:19,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:36:19,987 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-16 15:36:19,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:36:19,992 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-16 15:36:19,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:36:19,998 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-16 15:36:19,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:36:20,006 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-16 15:36:20,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:36:20,012 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-16 15:36:20,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:36:20,016 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-16 15:36:20,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:36:20,021 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-16 15:36:20,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:36:20,027 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-16 15:36:20,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:36:20,031 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-16 15:36:20,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:36:20,036 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-16 15:36:20,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:36:20,041 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-16 15:36:20,042 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 15:36:20,042 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1514172230] [2024-11-16 15:36:20,042 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1514172230] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 15:36:20,042 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 15:36:20,042 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2024-11-16 15:36:20,043 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1989953206] [2024-11-16 15:36:20,043 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 15:36:20,043 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-16 15:36:20,043 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 15:36:20,044 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-16 15:36:20,044 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2024-11-16 15:36:20,044 INFO L87 Difference]: Start difference. First operand 285 states and 374 transitions. Second operand has 13 states, 13 states have (on average 2.6153846153846154) internal successors, (34), 13 states have internal predecessors, (34), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-16 15:36:25,835 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-11-16 15:36:26,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 15:36:26,027 INFO L93 Difference]: Finished difference Result 490 states and 630 transitions. [2024-11-16 15:36:26,028 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-16 15:36:26,029 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.6153846153846154) internal successors, (34), 13 states have internal predecessors, (34), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 91 [2024-11-16 15:36:26,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 15:36:26,031 INFO L225 Difference]: With dead ends: 490 [2024-11-16 15:36:26,031 INFO L226 Difference]: Without dead ends: 425 [2024-11-16 15:36:26,034 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 29 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=94, Invalid=326, Unknown=0, NotChecked=0, Total=420 [2024-11-16 15:36:26,035 INFO L432 NwaCegarLoop]: 78 mSDtfsCounter, 204 mSDsluCounter, 295 mSDsCounter, 0 mSdLazyCounter, 790 mSolverCounterSat, 5 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 204 SdHoareTripleChecker+Valid, 373 SdHoareTripleChecker+Invalid, 796 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 790 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.0s IncrementalHoareTripleChecker+Time [2024-11-16 15:36:26,036 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [204 Valid, 373 Invalid, 796 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 790 Invalid, 1 Unknown, 0 Unchecked, 5.0s Time] [2024-11-16 15:36:26,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 425 states. [2024-11-16 15:36:26,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 425 to 295. [2024-11-16 15:36:26,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 295 states, 238 states have (on average 1.2352941176470589) internal successors, (294), 238 states have internal predecessors, (294), 48 states have call successors, (48), 8 states have call predecessors, (48), 8 states have return successors, (48), 48 states have call predecessors, (48), 48 states have call successors, (48) [2024-11-16 15:36:26,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 295 states to 295 states and 390 transitions. [2024-11-16 15:36:26,069 INFO L78 Accepts]: Start accepts. Automaton has 295 states and 390 transitions. Word has length 91 [2024-11-16 15:36:26,071 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 15:36:26,071 INFO L471 AbstractCegarLoop]: Abstraction has 295 states and 390 transitions. [2024-11-16 15:36:26,071 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.6153846153846154) internal successors, (34), 13 states have internal predecessors, (34), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-16 15:36:26,072 INFO L276 IsEmpty]: Start isEmpty. Operand 295 states and 390 transitions. [2024-11-16 15:36:26,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2024-11-16 15:36:26,074 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 15:36:26,074 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 15:36:26,075 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-16 15:36:26,075 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 15:36:26,075 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 15:36:26,075 INFO L85 PathProgramCache]: Analyzing trace with hash 2132935720, now seen corresponding path program 1 times [2024-11-16 15:36:26,076 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 15:36:26,076 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [828446696] [2024-11-16 15:36:26,076 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 15:36:26,076 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 15:36:26,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:36:26,147 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 15:36:26,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:36:26,149 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-16 15:36:26,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:36:26,150 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-16 15:36:26,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:36:26,152 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-16 15:36:26,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:36:26,154 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-16 15:36:26,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:36:26,158 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-16 15:36:26,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:36:26,160 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-16 15:36:26,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:36:26,162 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-16 15:36:26,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:36:26,165 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-16 15:36:26,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:36:26,166 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-16 15:36:26,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:36:26,168 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-16 15:36:26,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:36:26,169 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-16 15:36:26,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:36:26,171 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-16 15:36:26,171 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 15:36:26,171 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [828446696] [2024-11-16 15:36:26,172 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [828446696] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 15:36:26,172 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 15:36:26,172 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-16 15:36:26,172 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [28336774] [2024-11-16 15:36:26,172 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 15:36:26,174 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 15:36:26,174 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 15:36:26,175 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 15:36:26,175 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 15:36:26,175 INFO L87 Difference]: Start difference. First operand 295 states and 390 transitions. Second operand has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-16 15:36:26,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 15:36:26,212 INFO L93 Difference]: Finished difference Result 585 states and 778 transitions. [2024-11-16 15:36:26,212 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 15:36:26,213 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 92 [2024-11-16 15:36:26,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 15:36:26,216 INFO L225 Difference]: With dead ends: 585 [2024-11-16 15:36:26,216 INFO L226 Difference]: Without dead ends: 293 [2024-11-16 15:36:26,217 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 15:36:26,218 INFO L432 NwaCegarLoop]: 78 mSDtfsCounter, 0 mSDsluCounter, 74 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 152 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-16 15:36:26,219 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 152 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-16 15:36:26,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 293 states. [2024-11-16 15:36:26,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 293 to 289. [2024-11-16 15:36:26,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 289 states, 232 states have (on average 1.2241379310344827) internal successors, (284), 232 states have internal predecessors, (284), 48 states have call successors, (48), 8 states have call predecessors, (48), 8 states have return successors, (48), 48 states have call predecessors, (48), 48 states have call successors, (48) [2024-11-16 15:36:26,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 289 states to 289 states and 380 transitions. [2024-11-16 15:36:26,243 INFO L78 Accepts]: Start accepts. Automaton has 289 states and 380 transitions. Word has length 92 [2024-11-16 15:36:26,244 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 15:36:26,244 INFO L471 AbstractCegarLoop]: Abstraction has 289 states and 380 transitions. [2024-11-16 15:36:26,245 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-16 15:36:26,245 INFO L276 IsEmpty]: Start isEmpty. Operand 289 states and 380 transitions. [2024-11-16 15:36:26,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2024-11-16 15:36:26,246 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 15:36:26,246 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 15:36:26,246 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-16 15:36:26,247 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 15:36:26,247 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 15:36:26,247 INFO L85 PathProgramCache]: Analyzing trace with hash -707556805, now seen corresponding path program 1 times [2024-11-16 15:36:26,247 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 15:36:26,247 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1858646858] [2024-11-16 15:36:26,248 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 15:36:26,248 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 15:36:26,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:36:26,626 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 15:36:26,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:36:26,629 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-16 15:36:26,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:36:26,630 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-16 15:36:26,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:36:26,631 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-16 15:36:26,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:36:26,633 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-16 15:36:26,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:36:26,639 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-16 15:36:26,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:36:26,641 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-16 15:36:26,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:36:26,646 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-16 15:36:26,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:36:26,648 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-16 15:36:26,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:36:26,651 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-16 15:36:26,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:36:26,653 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-16 15:36:26,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:36:26,654 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-16 15:36:26,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:36:26,656 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-16 15:36:26,656 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 15:36:26,656 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1858646858] [2024-11-16 15:36:26,656 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1858646858] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 15:36:26,656 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 15:36:26,656 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-16 15:36:26,657 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [105373526] [2024-11-16 15:36:26,657 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 15:36:26,658 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-16 15:36:26,658 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 15:36:26,658 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-16 15:36:26,659 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-16 15:36:26,659 INFO L87 Difference]: Start difference. First operand 289 states and 380 transitions. Second operand has 6 states, 6 states have (on average 6.0) internal successors, (36), 6 states have internal predecessors, (36), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-16 15:36:26,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 15:36:26,843 INFO L93 Difference]: Finished difference Result 355 states and 456 transitions. [2024-11-16 15:36:26,844 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-16 15:36:26,844 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.0) internal successors, (36), 6 states have internal predecessors, (36), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 93 [2024-11-16 15:36:26,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 15:36:26,847 INFO L225 Difference]: With dead ends: 355 [2024-11-16 15:36:26,848 INFO L226 Difference]: Without dead ends: 352 [2024-11-16 15:36:26,849 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 26 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-11-16 15:36:26,850 INFO L432 NwaCegarLoop]: 66 mSDtfsCounter, 26 mSDsluCounter, 247 mSDsCounter, 0 mSdLazyCounter, 113 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 313 SdHoareTripleChecker+Invalid, 114 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 113 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-16 15:36:26,850 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 313 Invalid, 114 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 113 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-16 15:36:26,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 352 states. [2024-11-16 15:36:26,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 352 to 335. [2024-11-16 15:36:26,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 335 states, 278 states have (on average 1.2158273381294964) internal successors, (338), 278 states have internal predecessors, (338), 48 states have call successors, (48), 8 states have call predecessors, (48), 8 states have return successors, (48), 48 states have call predecessors, (48), 48 states have call successors, (48) [2024-11-16 15:36:26,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 335 states to 335 states and 434 transitions. [2024-11-16 15:36:26,877 INFO L78 Accepts]: Start accepts. Automaton has 335 states and 434 transitions. Word has length 93 [2024-11-16 15:36:26,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 15:36:26,877 INFO L471 AbstractCegarLoop]: Abstraction has 335 states and 434 transitions. [2024-11-16 15:36:26,878 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.0) internal successors, (36), 6 states have internal predecessors, (36), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-16 15:36:26,878 INFO L276 IsEmpty]: Start isEmpty. Operand 335 states and 434 transitions. [2024-11-16 15:36:26,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2024-11-16 15:36:26,879 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 15:36:26,879 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 15:36:26,879 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-16 15:36:26,879 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 15:36:26,879 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 15:36:26,879 INFO L85 PathProgramCache]: Analyzing trace with hash 626769131, now seen corresponding path program 1 times [2024-11-16 15:36:26,880 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 15:36:26,880 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [460230076] [2024-11-16 15:36:26,880 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 15:36:26,880 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 15:36:26,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:36:26,917 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 15:36:26,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:36:26,918 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-16 15:36:26,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:36:26,920 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-16 15:36:26,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:36:26,921 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-16 15:36:26,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:36:26,922 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-16 15:36:26,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:36:26,924 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-16 15:36:26,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:36:26,926 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-16 15:36:26,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:36:26,927 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-16 15:36:26,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:36:26,929 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-16 15:36:26,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:36:26,930 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-16 15:36:26,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:36:26,932 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-16 15:36:26,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:36:26,933 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-16 15:36:26,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:36:26,936 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-16 15:36:26,936 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 15:36:26,936 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [460230076] [2024-11-16 15:36:26,936 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [460230076] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 15:36:26,936 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 15:36:26,936 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-16 15:36:26,936 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [822810169] [2024-11-16 15:36:26,937 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 15:36:26,937 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 15:36:26,939 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 15:36:26,940 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 15:36:26,940 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 15:36:26,940 INFO L87 Difference]: Start difference. First operand 335 states and 434 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, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-16 15:36:27,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 15:36:27,038 INFO L93 Difference]: Finished difference Result 573 states and 750 transitions. [2024-11-16 15:36:27,038 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 15:36:27,038 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, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 93 [2024-11-16 15:36:27,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 15:36:27,040 INFO L225 Difference]: With dead ends: 573 [2024-11-16 15:36:27,040 INFO L226 Difference]: Without dead ends: 382 [2024-11-16 15:36:27,041 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 15:36:27,043 INFO L432 NwaCegarLoop]: 72 mSDtfsCounter, 69 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 121 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-16 15:36:27,045 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 121 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-16 15:36:27,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 382 states. [2024-11-16 15:36:27,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 382 to 212. [2024-11-16 15:36:27,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 212 states, 169 states have (on average 1.1893491124260356) internal successors, (201), 169 states have internal predecessors, (201), 36 states have call successors, (36), 6 states have call predecessors, (36), 6 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2024-11-16 15:36:27,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 212 states and 273 transitions. [2024-11-16 15:36:27,067 INFO L78 Accepts]: Start accepts. Automaton has 212 states and 273 transitions. Word has length 93 [2024-11-16 15:36:27,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 15:36:27,068 INFO L471 AbstractCegarLoop]: Abstraction has 212 states and 273 transitions. [2024-11-16 15:36:27,068 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, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-16 15:36:27,068 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 273 transitions. [2024-11-16 15:36:27,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2024-11-16 15:36:27,069 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 15:36:27,069 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 15:36:27,069 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-16 15:36:27,069 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 15:36:27,069 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 15:36:27,070 INFO L85 PathProgramCache]: Analyzing trace with hash -838959668, now seen corresponding path program 1 times [2024-11-16 15:36:27,070 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 15:36:27,070 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [418349784] [2024-11-16 15:36:27,070 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 15:36:27,070 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 15:36:27,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:36:27,112 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 15:36:27,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:36:27,115 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-16 15:36:27,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:36:27,116 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-16 15:36:27,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:36:27,117 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-16 15:36:27,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:36:27,118 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-16 15:36:27,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:36:27,120 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-16 15:36:27,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:36:27,123 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-16 15:36:27,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:36:27,124 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-16 15:36:27,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:36:27,126 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-16 15:36:27,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:36:27,127 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-16 15:36:27,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:36:27,129 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-16 15:36:27,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:36:27,130 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-16 15:36:27,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:36:27,132 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-16 15:36:27,132 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 15:36:27,132 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [418349784] [2024-11-16 15:36:27,133 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [418349784] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 15:36:27,133 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 15:36:27,133 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-16 15:36:27,133 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [195474198] [2024-11-16 15:36:27,133 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 15:36:27,133 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 15:36:27,134 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 15:36:27,135 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 15:36:27,135 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 15:36:27,135 INFO L87 Difference]: Start difference. First operand 212 states and 273 transitions. Second operand has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-16 15:36:27,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 15:36:27,224 INFO L93 Difference]: Finished difference Result 368 states and 472 transitions. [2024-11-16 15:36:27,225 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 15:36:27,225 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 94 [2024-11-16 15:36:27,226 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 15:36:27,227 INFO L225 Difference]: With dead ends: 368 [2024-11-16 15:36:27,227 INFO L226 Difference]: Without dead ends: 220 [2024-11-16 15:36:27,228 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 15:36:27,228 INFO L432 NwaCegarLoop]: 117 mSDtfsCounter, 55 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 170 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-16 15:36:27,229 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 170 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-16 15:36:27,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 220 states. [2024-11-16 15:36:27,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 220 to 216. [2024-11-16 15:36:27,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 216 states, 173 states have (on average 1.1676300578034682) internal successors, (202), 173 states have internal predecessors, (202), 36 states have call successors, (36), 6 states have call predecessors, (36), 6 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2024-11-16 15:36:27,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 274 transitions. [2024-11-16 15:36:27,250 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 274 transitions. Word has length 94 [2024-11-16 15:36:27,250 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 15:36:27,250 INFO L471 AbstractCegarLoop]: Abstraction has 216 states and 274 transitions. [2024-11-16 15:36:27,250 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-16 15:36:27,251 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 274 transitions. [2024-11-16 15:36:27,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2024-11-16 15:36:27,251 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 15:36:27,251 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 15:36:27,251 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-16 15:36:27,252 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 15:36:27,252 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 15:36:27,252 INFO L85 PathProgramCache]: Analyzing trace with hash 999454051, now seen corresponding path program 1 times [2024-11-16 15:36:27,252 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 15:36:27,253 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [963983809] [2024-11-16 15:36:27,253 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 15:36:27,253 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 15:36:27,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:36:27,745 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 15:36:27,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:36:27,747 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-16 15:36:27,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:36:27,749 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-16 15:36:27,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:36:27,751 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-16 15:36:27,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:36:27,753 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-16 15:36:27,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:36:27,755 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-16 15:36:27,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:36:27,757 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-16 15:36:27,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:36:27,758 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-16 15:36:27,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:36:27,760 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-16 15:36:27,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:36:27,763 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-16 15:36:27,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:36:27,765 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-16 15:36:27,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:36:27,767 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-16 15:36:27,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:36:27,769 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-16 15:36:27,769 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 15:36:27,769 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [963983809] [2024-11-16 15:36:27,769 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [963983809] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 15:36:27,769 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 15:36:27,770 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-16 15:36:27,770 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [954367060] [2024-11-16 15:36:27,770 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 15:36:27,770 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-16 15:36:27,770 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 15:36:27,771 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-16 15:36:27,771 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-16 15:36:27,771 INFO L87 Difference]: Start difference. First operand 216 states and 274 transitions. Second operand has 6 states, 6 states have (on average 6.333333333333333) internal successors, (38), 6 states have internal predecessors, (38), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-16 15:36:28,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 15:36:28,110 INFO L93 Difference]: Finished difference Result 399 states and 496 transitions. [2024-11-16 15:36:28,110 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-16 15:36:28,111 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.333333333333333) internal successors, (38), 6 states have internal predecessors, (38), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 95 [2024-11-16 15:36:28,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 15:36:28,114 INFO L225 Difference]: With dead ends: 399 [2024-11-16 15:36:28,115 INFO L226 Difference]: Without dead ends: 242 [2024-11-16 15:36:28,115 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2024-11-16 15:36:28,116 INFO L432 NwaCegarLoop]: 115 mSDtfsCounter, 90 mSDsluCounter, 268 mSDsCounter, 0 mSdLazyCounter, 227 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 90 SdHoareTripleChecker+Valid, 383 SdHoareTripleChecker+Invalid, 229 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 227 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-16 15:36:28,116 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [90 Valid, 383 Invalid, 229 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 227 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-16 15:36:28,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 242 states. [2024-11-16 15:36:28,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 242 to 212. [2024-11-16 15:36:28,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 212 states, 169 states have (on average 1.1479289940828403) internal successors, (194), 169 states have internal predecessors, (194), 36 states have call successors, (36), 6 states have call predecessors, (36), 6 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2024-11-16 15:36:28,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 212 states and 266 transitions. [2024-11-16 15:36:28,136 INFO L78 Accepts]: Start accepts. Automaton has 212 states and 266 transitions. Word has length 95 [2024-11-16 15:36:28,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 15:36:28,137 INFO L471 AbstractCegarLoop]: Abstraction has 212 states and 266 transitions. [2024-11-16 15:36:28,137 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.333333333333333) internal successors, (38), 6 states have internal predecessors, (38), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-16 15:36:28,137 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 266 transitions. [2024-11-16 15:36:28,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2024-11-16 15:36:28,139 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 15:36:28,139 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 15:36:28,139 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-16 15:36:28,139 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 15:36:28,140 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 15:36:28,140 INFO L85 PathProgramCache]: Analyzing trace with hash 817697963, now seen corresponding path program 1 times [2024-11-16 15:36:28,140 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 15:36:28,140 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [979687607] [2024-11-16 15:36:28,140 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 15:36:28,140 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 15:36:28,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-16 15:36:28,195 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1381593039] [2024-11-16 15:36:28,195 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 15:36:28,195 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 15:36:28,196 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 15:36:28,197 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-16 15:36:28,199 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-16 15:36:28,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-16 15:36:28,300 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-16 15:36:28,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-16 15:36:28,381 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-16 15:36:28,382 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-16 15:36:28,383 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-16 15:36:28,402 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-16 15:36:28,585 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,SelfDestructingSolverStorable10 [2024-11-16 15:36:28,588 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 15:36:28,653 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-16 15:36:28,656 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.11 03:36:28 BoogieIcfgContainer [2024-11-16 15:36:28,656 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-16 15:36:28,657 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-16 15:36:28,657 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-16 15:36:28,657 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-16 15:36:28,658 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 03:36:06" (3/4) ... [2024-11-16 15:36:28,660 INFO L146 WitnessPrinter]: No result that supports witness generation found [2024-11-16 15:36:28,661 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-16 15:36:28,661 INFO L158 Benchmark]: Toolchain (without parser) took 23594.07ms. Allocated memory was 180.4MB in the beginning and 346.0MB in the end (delta: 165.7MB). Free memory was 121.8MB in the beginning and 159.6MB in the end (delta: -37.9MB). Peak memory consumption was 130.5MB. Max. memory is 16.1GB. [2024-11-16 15:36:28,661 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 180.4MB. Free memory is still 145.4MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-16 15:36:28,662 INFO L158 Benchmark]: CACSL2BoogieTranslator took 326.42ms. Allocated memory is still 180.4MB. Free memory was 121.8MB in the beginning and 107.1MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-11-16 15:36:28,662 INFO L158 Benchmark]: Boogie Procedure Inliner took 78.86ms. Allocated memory is still 180.4MB. Free memory was 107.1MB in the beginning and 104.2MB in the end (delta: 2.9MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-16 15:36:28,662 INFO L158 Benchmark]: Boogie Preprocessor took 47.78ms. Allocated memory is still 180.4MB. Free memory was 104.2MB in the beginning and 100.7MB in the end (delta: 3.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-16 15:36:28,662 INFO L158 Benchmark]: IcfgBuilder took 545.22ms. Allocated memory is still 180.4MB. Free memory was 100.7MB in the beginning and 77.3MB in the end (delta: 23.4MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2024-11-16 15:36:28,662 INFO L158 Benchmark]: TraceAbstraction took 22585.39ms. Allocated memory was 180.4MB in the beginning and 346.0MB in the end (delta: 165.7MB). Free memory was 76.5MB in the beginning and 159.6MB in the end (delta: -83.1MB). Peak memory consumption was 84.4MB. Max. memory is 16.1GB. [2024-11-16 15:36:28,663 INFO L158 Benchmark]: Witness Printer took 4.01ms. Allocated memory is still 346.0MB. Free memory is still 159.6MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-16 15:36:28,664 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.12ms. Allocated memory is still 180.4MB. Free memory is still 145.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 326.42ms. Allocated memory is still 180.4MB. Free memory was 121.8MB in the beginning and 107.1MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 78.86ms. Allocated memory is still 180.4MB. Free memory was 107.1MB in the beginning and 104.2MB in the end (delta: 2.9MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 47.78ms. Allocated memory is still 180.4MB. Free memory was 104.2MB in the beginning and 100.7MB in the end (delta: 3.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * IcfgBuilder took 545.22ms. Allocated memory is still 180.4MB. Free memory was 100.7MB in the beginning and 77.3MB in the end (delta: 23.4MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. * TraceAbstraction took 22585.39ms. Allocated memory was 180.4MB in the beginning and 346.0MB in the end (delta: 165.7MB). Free memory was 76.5MB in the beginning and 159.6MB in the end (delta: -83.1MB). Peak memory consumption was 84.4MB. Max. memory is 16.1GB. * Witness Printer took 4.01ms. Allocated memory is still 346.0MB. Free memory is still 159.6MB. 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 someBinaryFLOATComparisonOperation at line 89, overapproximation of bitwiseOr at line 89, overapproximation of bitwiseAnd at line 46. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] float var_1_1 = 99.25; [L23] signed short int var_1_7 = 18477; [L24] signed short int var_1_8 = 5; [L25] float var_1_9 = 5.8; [L26] float var_1_10 = 0.5; [L27] unsigned char var_1_11 = 16; [L28] unsigned char var_1_12 = 50; [L29] unsigned char var_1_13 = 1; [L30] unsigned long int var_1_14 = 256; [L31] unsigned char var_1_15 = 0; [L32] unsigned char last_1_var_1_11 = 16; [L33] unsigned long int last_1_var_1_14 = 256; VAL [isInitial=0, last_1_var_1_11=16, last_1_var_1_14=256, var_1_10=1/2, var_1_11=16, var_1_12=50, var_1_13=1, var_1_14=256, var_1_15=0, var_1_1=397/4, var_1_7=18477, var_1_8=5, var_1_9=29/5] [L93] isInitial = 1 [L94] FCALL initially() [L95] COND TRUE 1 [L96] CALL updateLastVariables() [L85] last_1_var_1_11 = var_1_11 [L86] last_1_var_1_14 = var_1_14 VAL [isInitial=1, last_1_var_1_11=16, last_1_var_1_14=256, var_1_10=1/2, var_1_11=16, var_1_12=50, var_1_13=1, var_1_14=256, var_1_15=0, var_1_1=397/4, var_1_7=18477, var_1_8=5, var_1_9=29/5] [L96] RET updateLastVariables() [L97] CALL updateVariables() [L64] var_1_7 = __VERIFIER_nondet_short() [L65] CALL assume_abort_if_not(var_1_7 >= 16383) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=16, last_1_var_1_14=256, var_1_10=1/2, var_1_11=16, var_1_12=50, var_1_13=1, var_1_14=256, var_1_15=0, var_1_1=397/4, var_1_7=32767, var_1_8=5, var_1_9=29/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=16, last_1_var_1_14=256, var_1_10=1/2, var_1_11=16, var_1_12=50, var_1_13=1, var_1_14=256, var_1_15=0, var_1_1=397/4, var_1_7=32767, var_1_8=5, var_1_9=29/5] [L65] RET assume_abort_if_not(var_1_7 >= 16383) VAL [isInitial=1, last_1_var_1_11=16, last_1_var_1_14=256, var_1_10=1/2, var_1_11=16, var_1_12=50, var_1_13=1, var_1_14=256, var_1_15=0, var_1_1=397/4, var_1_7=32767, var_1_8=5, var_1_9=29/5] [L66] CALL assume_abort_if_not(var_1_7 <= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=16, last_1_var_1_14=256, var_1_10=1/2, var_1_11=16, var_1_12=50, var_1_13=1, var_1_14=256, var_1_15=0, var_1_1=397/4, var_1_7=32767, var_1_8=5, var_1_9=29/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=16, last_1_var_1_14=256, var_1_10=1/2, var_1_11=16, var_1_12=50, var_1_13=1, var_1_14=256, var_1_15=0, var_1_1=397/4, var_1_7=32767, var_1_8=5, var_1_9=29/5] [L66] RET assume_abort_if_not(var_1_7 <= 32767) VAL [isInitial=1, last_1_var_1_11=16, last_1_var_1_14=256, var_1_10=1/2, var_1_11=16, var_1_12=50, var_1_13=1, var_1_14=256, var_1_15=0, var_1_1=397/4, var_1_7=32767, var_1_8=5, var_1_9=29/5] [L67] var_1_8 = __VERIFIER_nondet_short() [L68] CALL assume_abort_if_not(var_1_8 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=16, last_1_var_1_14=256, var_1_10=1/2, var_1_11=16, var_1_12=50, var_1_13=1, var_1_14=256, var_1_15=0, var_1_1=397/4, var_1_7=32767, var_1_8=256, var_1_9=29/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=16, last_1_var_1_14=256, var_1_10=1/2, var_1_11=16, var_1_12=50, var_1_13=1, var_1_14=256, var_1_15=0, var_1_1=397/4, var_1_7=32767, var_1_8=256, var_1_9=29/5] [L68] RET assume_abort_if_not(var_1_8 >= 0) VAL [isInitial=1, last_1_var_1_11=16, last_1_var_1_14=256, var_1_10=1/2, var_1_11=16, var_1_12=50, var_1_13=1, var_1_14=256, var_1_15=0, var_1_1=397/4, var_1_7=32767, var_1_8=256, var_1_9=29/5] [L69] CALL assume_abort_if_not(var_1_8 <= 16383) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=16, last_1_var_1_14=256, var_1_10=1/2, var_1_11=16, var_1_12=50, var_1_13=1, var_1_14=256, var_1_15=0, var_1_1=397/4, var_1_7=32767, var_1_8=256, var_1_9=29/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=16, last_1_var_1_14=256, var_1_10=1/2, var_1_11=16, var_1_12=50, var_1_13=1, var_1_14=256, var_1_15=0, var_1_1=397/4, var_1_7=32767, var_1_8=256, var_1_9=29/5] [L69] RET assume_abort_if_not(var_1_8 <= 16383) VAL [isInitial=1, last_1_var_1_11=16, last_1_var_1_14=256, var_1_10=1/2, var_1_11=16, var_1_12=50, var_1_13=1, var_1_14=256, var_1_15=0, var_1_1=397/4, var_1_7=32767, var_1_8=256, var_1_9=29/5] [L70] var_1_9 = __VERIFIER_nondet_float() [L71] CALL assume_abort_if_not((var_1_9 >= -922337.2036854765600e+13F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 9223372.036854765600e+12F && var_1_9 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=16, last_1_var_1_14=256, var_1_10=1/2, var_1_11=16, var_1_12=50, var_1_13=1, var_1_14=256, var_1_15=0, var_1_1=397/4, var_1_7=32767, var_1_8=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=16, last_1_var_1_14=256, var_1_10=1/2, var_1_11=16, var_1_12=50, var_1_13=1, var_1_14=256, var_1_15=0, var_1_1=397/4, var_1_7=32767, var_1_8=256] [L71] RET assume_abort_if_not((var_1_9 >= -922337.2036854765600e+13F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 9223372.036854765600e+12F && var_1_9 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_11=16, last_1_var_1_14=256, var_1_10=1/2, var_1_11=16, var_1_12=50, var_1_13=1, var_1_14=256, var_1_15=0, var_1_1=397/4, var_1_7=32767, var_1_8=256] [L72] var_1_10 = __VERIFIER_nondet_float() [L73] CALL assume_abort_if_not((var_1_10 >= -922337.2036854765600e+13F && var_1_10 <= -1.0e-20F) || (var_1_10 <= 9223372.036854765600e+12F && var_1_10 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=16, last_1_var_1_14=256, var_1_11=16, var_1_12=50, var_1_13=1, var_1_14=256, var_1_15=0, var_1_1=397/4, var_1_7=32767, var_1_8=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=16, last_1_var_1_14=256, var_1_11=16, var_1_12=50, var_1_13=1, var_1_14=256, var_1_15=0, var_1_1=397/4, var_1_7=32767, var_1_8=256] [L73] RET assume_abort_if_not((var_1_10 >= -922337.2036854765600e+13F && var_1_10 <= -1.0e-20F) || (var_1_10 <= 9223372.036854765600e+12F && var_1_10 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_11=16, last_1_var_1_14=256, var_1_11=16, var_1_12=50, var_1_13=1, var_1_14=256, var_1_15=0, var_1_1=397/4, var_1_7=32767, var_1_8=256] [L74] var_1_12 = __VERIFIER_nondet_uchar() [L75] CALL assume_abort_if_not(var_1_12 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=16, last_1_var_1_14=256, var_1_11=16, var_1_13=1, var_1_14=256, var_1_15=0, var_1_1=397/4, var_1_7=32767, var_1_8=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=16, last_1_var_1_14=256, var_1_11=16, var_1_13=1, var_1_14=256, var_1_15=0, var_1_1=397/4, var_1_7=32767, var_1_8=256] [L75] RET assume_abort_if_not(var_1_12 >= 0) VAL [isInitial=1, last_1_var_1_11=16, last_1_var_1_14=256, var_1_11=16, var_1_13=1, var_1_14=256, var_1_15=0, var_1_1=397/4, var_1_7=32767, var_1_8=256] [L76] CALL assume_abort_if_not(var_1_12 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=16, last_1_var_1_14=256, var_1_11=16, var_1_12=0, var_1_13=1, var_1_14=256, var_1_15=0, var_1_1=397/4, var_1_7=32767, var_1_8=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=16, last_1_var_1_14=256, var_1_11=16, var_1_12=0, var_1_13=1, var_1_14=256, var_1_15=0, var_1_1=397/4, var_1_7=32767, var_1_8=256] [L76] RET assume_abort_if_not(var_1_12 <= 254) VAL [isInitial=1, last_1_var_1_11=16, last_1_var_1_14=256, var_1_11=16, var_1_12=0, var_1_13=1, var_1_14=256, var_1_15=0, var_1_1=397/4, var_1_7=32767, var_1_8=256] [L77] var_1_13 = __VERIFIER_nondet_uchar() [L78] CALL assume_abort_if_not(var_1_13 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=16, last_1_var_1_14=256, var_1_11=16, var_1_12=0, var_1_14=256, var_1_15=0, var_1_1=397/4, var_1_7=32767, var_1_8=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=16, last_1_var_1_14=256, var_1_11=16, var_1_12=0, var_1_14=256, var_1_15=0, var_1_1=397/4, var_1_7=32767, var_1_8=256] [L78] RET assume_abort_if_not(var_1_13 >= 0) VAL [isInitial=1, last_1_var_1_11=16, last_1_var_1_14=256, var_1_11=16, var_1_12=0, var_1_14=256, var_1_15=0, var_1_1=397/4, var_1_7=32767, var_1_8=256] [L79] CALL assume_abort_if_not(var_1_13 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=16, last_1_var_1_14=256, var_1_11=16, var_1_12=0, var_1_13=0, var_1_14=256, var_1_15=0, var_1_1=397/4, var_1_7=32767, var_1_8=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=16, last_1_var_1_14=256, var_1_11=16, var_1_12=0, var_1_13=0, var_1_14=256, var_1_15=0, var_1_1=397/4, var_1_7=32767, var_1_8=256] [L79] RET assume_abort_if_not(var_1_13 <= 254) VAL [isInitial=1, last_1_var_1_11=16, last_1_var_1_14=256, var_1_11=16, var_1_12=0, var_1_13=0, var_1_14=256, var_1_15=0, var_1_1=397/4, var_1_7=32767, var_1_8=256] [L80] var_1_15 = __VERIFIER_nondet_uchar() [L81] CALL assume_abort_if_not(var_1_15 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=16, last_1_var_1_14=256, var_1_11=16, var_1_12=0, var_1_13=0, var_1_14=256, var_1_1=397/4, var_1_7=32767, var_1_8=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=16, last_1_var_1_14=256, var_1_11=16, var_1_12=0, var_1_13=0, var_1_14=256, var_1_1=397/4, var_1_7=32767, var_1_8=256] [L81] RET assume_abort_if_not(var_1_15 >= 0) VAL [isInitial=1, last_1_var_1_11=16, last_1_var_1_14=256, var_1_11=16, var_1_12=0, var_1_13=0, var_1_14=256, var_1_1=397/4, var_1_7=32767, var_1_8=256] [L82] CALL assume_abort_if_not(var_1_15 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=16, last_1_var_1_14=256, var_1_11=16, var_1_12=0, var_1_13=0, var_1_14=256, var_1_15=0, var_1_1=397/4, var_1_7=32767, var_1_8=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=16, last_1_var_1_14=256, var_1_11=16, var_1_12=0, var_1_13=0, var_1_14=256, var_1_15=0, var_1_1=397/4, var_1_7=32767, var_1_8=256] [L82] RET assume_abort_if_not(var_1_15 <= 1) VAL [isInitial=1, last_1_var_1_11=16, last_1_var_1_14=256, var_1_11=16, var_1_12=0, var_1_13=0, var_1_14=256, var_1_15=0, var_1_1=397/4, var_1_7=32767, var_1_8=256] [L97] RET updateVariables() [L98] CALL step() [L37] signed short int stepLocal_3 = var_1_8; [L38] unsigned long int stepLocal_2 = last_1_var_1_14; VAL [isInitial=1, last_1_var_1_11=16, last_1_var_1_14=256, stepLocal_2=256, stepLocal_3=256, var_1_11=16, var_1_12=0, var_1_13=0, var_1_14=256, var_1_15=0, var_1_1=397/4, var_1_7=32767, var_1_8=256] [L39] COND FALSE !(last_1_var_1_14 > stepLocal_3) VAL [isInitial=1, last_1_var_1_11=16, last_1_var_1_14=256, stepLocal_2=256, var_1_11=16, var_1_12=0, var_1_13=0, var_1_14=256, var_1_15=0, var_1_1=397/4, var_1_7=32767, var_1_8=256] [L46] EXPR var_1_11 & var_1_7 VAL [isInitial=1, last_1_var_1_11=16, last_1_var_1_14=256, stepLocal_2=256, var_1_11=16, var_1_12=0, var_1_13=0, var_1_14=256, var_1_15=0, var_1_1=397/4, var_1_7=32767, var_1_8=256] [L46] COND FALSE !((var_1_11 & var_1_7) > ((var_1_12 * last_1_var_1_14) * (var_1_11 + var_1_11))) [L51] var_1_14 = var_1_7 VAL [isInitial=1, last_1_var_1_11=16, last_1_var_1_14=256, stepLocal_2=256, var_1_11=16, var_1_12=0, var_1_13=0, var_1_14=32767, var_1_15=0, var_1_1=397/4, var_1_7=32767, var_1_8=256] [L53] unsigned char stepLocal_1 = var_1_11; VAL [isInitial=1, last_1_var_1_11=16, last_1_var_1_14=256, stepLocal_1=16, stepLocal_2=256, var_1_11=16, var_1_12=0, var_1_13=0, var_1_14=32767, var_1_15=0, var_1_1=397/4, var_1_7=32767, var_1_8=256] [L54] EXPR var_1_11 ^ ((((var_1_11) > (var_1_14)) ? (var_1_11) : (var_1_14))) VAL [isInitial=1, last_1_var_1_11=16, last_1_var_1_14=256, stepLocal_1=16, stepLocal_2=256, var_1_11=16, var_1_12=0, var_1_13=0, var_1_14=32767, var_1_15=0, var_1_1=397/4, var_1_7=32767, var_1_8=256] [L54] unsigned long int stepLocal_0 = var_1_11 ^ ((((var_1_11) > (var_1_14)) ? (var_1_11) : (var_1_14))); [L55] COND FALSE !(stepLocal_0 != var_1_11) [L60] var_1_1 = 10.5f VAL [isInitial=1, last_1_var_1_11=16, last_1_var_1_14=256, stepLocal_1=16, stepLocal_2=256, var_1_11=16, var_1_12=0, var_1_13=0, var_1_14=32767, var_1_15=0, var_1_1=21/2, var_1_7=32767, var_1_8=256] [L98] RET step() [L99] CALL, EXPR property() [L89] EXPR var_1_11 ^ ((((var_1_11) > (var_1_14)) ? (var_1_11) : (var_1_14))) VAL [isInitial=1, last_1_var_1_11=16, last_1_var_1_14=256, var_1_11=16, var_1_12=0, var_1_13=0, var_1_14=32767, var_1_15=0, var_1_1=21/2, var_1_7=32767, var_1_8=256] [L89] EXPR ((((var_1_11 ^ ((((var_1_11) > (var_1_14)) ? (var_1_11) : (var_1_14)))) != var_1_11) ? ((var_1_11 == (var_1_11 - (var_1_7 - var_1_11))) ? (var_1_1 == ((float) ((((var_1_9) < (var_1_10)) ? (var_1_9) : (var_1_10))))) : 1) : (var_1_1 == ((float) 10.5f))) && ((last_1_var_1_14 > var_1_8) ? ((((last_1_var_1_11 - var_1_8) + var_1_7) > last_1_var_1_14) ? (var_1_11 == ((unsigned char) ((((var_1_12) < (var_1_13)) ? (var_1_12) : (var_1_13))))) : (var_1_11 == ((unsigned char) var_1_12))) : 1)) && (((var_1_11 & var_1_7) > ((var_1_12 * last_1_var_1_14) * (var_1_11 + var_1_11))) ? ((var_1_15 && (var_1_9 > var_1_10)) ? (var_1_14 == ((unsigned long int) var_1_7)) : 1) : (var_1_14 == ((unsigned long int) var_1_7))) VAL [isInitial=1, last_1_var_1_11=16, last_1_var_1_14=256, var_1_11=16, var_1_12=0, var_1_13=0, var_1_14=32767, var_1_15=0, var_1_1=21/2, var_1_7=32767, var_1_8=256] [L89-L90] return ((((var_1_11 ^ ((((var_1_11) > (var_1_14)) ? (var_1_11) : (var_1_14)))) != var_1_11) ? ((var_1_11 == (var_1_11 - (var_1_7 - var_1_11))) ? (var_1_1 == ((float) ((((var_1_9) < (var_1_10)) ? (var_1_9) : (var_1_10))))) : 1) : (var_1_1 == ((float) 10.5f))) && ((last_1_var_1_14 > var_1_8) ? ((((last_1_var_1_11 - var_1_8) + var_1_7) > last_1_var_1_14) ? (var_1_11 == ((unsigned char) ((((var_1_12) < (var_1_13)) ? (var_1_12) : (var_1_13))))) : (var_1_11 == ((unsigned char) var_1_12))) : 1)) && (((var_1_11 & var_1_7) > ((var_1_12 * last_1_var_1_14) * (var_1_11 + var_1_11))) ? ((var_1_15 && (var_1_9 > var_1_10)) ? (var_1_14 == ((unsigned long int) var_1_7)) : 1) : (var_1_14 == ((unsigned long int) var_1_7))) ; [L99] RET, EXPR property() [L99] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_11=16, last_1_var_1_14=256, var_1_11=16, var_1_12=0, var_1_13=0, var_1_14=32767, var_1_15=0, var_1_1=21/2, var_1_7=32767, var_1_8=256] [L19] reach_error() VAL [isInitial=1, last_1_var_1_11=16, last_1_var_1_14=256, var_1_11=16, var_1_12=0, var_1_13=0, var_1_14=32767, var_1_15=0, var_1_1=21/2, var_1_7=32767, var_1_8=256] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 67 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 22.5s, OverallIterations: 11, TraceHistogramMax: 12, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 11.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 1 mSolverCounterUnknown, 1386 SdHoareTripleChecker+Valid, 7.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1386 mSDsluCounter, 2854 SdHoareTripleChecker+Invalid, 7.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1981 mSDsCounter, 166 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3163 IncrementalHoareTripleChecker+Invalid, 3330 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 166 mSolverCounterUnsat, 873 mSDtfsCounter, 3163 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 559 GetRequests, 449 SyntacticMatches, 2 SemanticMatches, 108 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 556 ImplicationChecksByTransitivity, 4.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=335occurred in iteration=7, InterpolantAutomatonStates: 86, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 10 MinimizatonAttempts, 543 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 9.4s InterpolantComputationTime, 1201 NumberOfCodeBlocks, 1201 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 1085 ConstructedInterpolants, 0 QuantifiedInterpolants, 5146 SizeOfPredicates, 4 NumberOfNonLiveVariables, 219 ConjunctsInSsa, 15 ConjunctsInUnsatCore, 12 InterpolantComputations, 9 PerfectInterpolantSequences, 3069/3168 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-16 15:36:28,761 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 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/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-18.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 20590a3b952f77870c005ea22da4ee2c3e5fa42d319fcea291376108e5b76f76 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-3289d67-m [2024-11-16 15:36:30,955 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-16 15:36:31,041 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-16 15:36:31,046 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-16 15:36:31,046 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-16 15:36:31,072 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-16 15:36:31,073 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-16 15:36:31,073 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-16 15:36:31,074 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-16 15:36:31,074 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-16 15:36:31,074 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-16 15:36:31,075 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-16 15:36:31,076 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-16 15:36:31,079 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-16 15:36:31,079 INFO L153 SettingsManager]: * Use SBE=true [2024-11-16 15:36:31,080 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-16 15:36:31,080 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-16 15:36:31,080 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-16 15:36:31,080 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-16 15:36:31,081 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-16 15:36:31,081 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-16 15:36:31,083 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-16 15:36:31,084 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-16 15:36:31,084 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-16 15:36:31,084 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-16 15:36:31,084 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-16 15:36:31,085 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-16 15:36:31,085 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-16 15:36:31,085 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-16 15:36:31,085 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-16 15:36:31,085 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-16 15:36:31,086 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-16 15:36:31,086 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-16 15:36:31,086 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-16 15:36:31,086 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 15:36:31,086 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-16 15:36:31,087 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-16 15:36:31,087 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-16 15:36:31,087 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-16 15:36:31,088 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-16 15:36:31,089 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-16 15:36:31,089 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-16 15:36:31,089 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-16 15:36:31,089 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-16 15:36:31,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 -> 20590a3b952f77870c005ea22da4ee2c3e5fa42d319fcea291376108e5b76f76 [2024-11-16 15:36:31,420 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-16 15:36:31,441 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-16 15:36:31,445 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-16 15:36:31,446 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-16 15:36:31,446 INFO L274 PluginConnector]: CDTParser initialized [2024-11-16 15:36:31,448 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-18.i [2024-11-16 15:36:32,919 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-16 15:36:33,131 INFO L384 CDTParser]: Found 1 translation units. [2024-11-16 15:36:33,131 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-18.i [2024-11-16 15:36:33,145 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/48c1a8165/cb0a93c595cc4853912c78d1c40702dc/FLAG4f227bd5e [2024-11-16 15:36:33,161 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/48c1a8165/cb0a93c595cc4853912c78d1c40702dc [2024-11-16 15:36:33,164 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-16 15:36:33,166 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-16 15:36:33,170 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-16 15:36:33,170 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-16 15:36:33,176 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-16 15:36:33,177 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 03:36:33" (1/1) ... [2024-11-16 15:36:33,178 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@39ed1f32 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:36:33, skipping insertion in model container [2024-11-16 15:36:33,178 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 03:36:33" (1/1) ... [2024-11-16 15:36:33,204 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-16 15:36:33,401 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_has-floats_file-18.i[917,930] [2024-11-16 15:36:33,455 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 15:36:33,475 INFO L200 MainTranslator]: Completed pre-run [2024-11-16 15:36:33,487 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_has-floats_file-18.i[917,930] [2024-11-16 15:36:33,517 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 15:36:33,539 INFO L204 MainTranslator]: Completed translation [2024-11-16 15:36:33,539 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:36:33 WrapperNode [2024-11-16 15:36:33,539 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-16 15:36:33,540 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-16 15:36:33,541 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-16 15:36:33,541 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-16 15:36:33,547 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:36:33" (1/1) ... [2024-11-16 15:36:33,563 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:36:33" (1/1) ... [2024-11-16 15:36:33,594 INFO L138 Inliner]: procedures = 27, calls = 25, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 96 [2024-11-16 15:36:33,595 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-16 15:36:33,596 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-16 15:36:33,596 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-16 15:36:33,596 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-16 15:36:33,607 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:36:33" (1/1) ... [2024-11-16 15:36:33,607 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:36:33" (1/1) ... [2024-11-16 15:36:33,611 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:36:33" (1/1) ... [2024-11-16 15:36:33,624 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-16 15:36:33,628 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:36:33" (1/1) ... [2024-11-16 15:36:33,629 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:36:33" (1/1) ... [2024-11-16 15:36:33,636 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:36:33" (1/1) ... [2024-11-16 15:36:33,636 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:36:33" (1/1) ... [2024-11-16 15:36:33,642 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:36:33" (1/1) ... [2024-11-16 15:36:33,643 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:36:33" (1/1) ... [2024-11-16 15:36:33,646 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-16 15:36:33,647 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-16 15:36:33,647 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-16 15:36:33,647 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-16 15:36:33,648 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:36:33" (1/1) ... [2024-11-16 15:36:33,657 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 15:36:33,673 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 15:36:33,686 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-16 15:36:33,688 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-16 15:36:33,730 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-16 15:36:33,730 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-16 15:36:33,730 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-16 15:36:33,730 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-16 15:36:33,730 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-16 15:36:33,730 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-16 15:36:33,817 INFO L256 CfgBuilder]: Building ICFG [2024-11-16 15:36:33,819 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-16 15:36:34,141 INFO L? ?]: Removed 16 outVars from TransFormulas that were not future-live. [2024-11-16 15:36:34,141 INFO L307 CfgBuilder]: Performing block encoding [2024-11-16 15:36:34,160 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-16 15:36:34,160 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-16 15:36:34,161 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 03:36:34 BoogieIcfgContainer [2024-11-16 15:36:34,161 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-16 15:36:34,176 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-16 15:36:34,177 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-16 15:36:34,180 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-16 15:36:34,181 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.11 03:36:33" (1/3) ... [2024-11-16 15:36:34,182 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@c39d48d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 03:36:34, skipping insertion in model container [2024-11-16 15:36:34,183 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:36:33" (2/3) ... [2024-11-16 15:36:34,184 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@c39d48d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 03:36:34, skipping insertion in model container [2024-11-16 15:36:34,184 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 03:36:34" (3/3) ... [2024-11-16 15:36:34,185 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_floatingpointinfluence_has-floats_file-18.i [2024-11-16 15:36:34,202 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-16 15:36:34,203 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-16 15:36:34,269 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-16 15:36:34,276 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;@18a27d02, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-16 15:36:34,277 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-16 15:36:34,281 INFO L276 IsEmpty]: Start isEmpty. Operand has 48 states, 33 states have (on average 1.3333333333333333) internal successors, (44), 34 states have internal predecessors, (44), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-16 15:36:34,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2024-11-16 15:36:34,292 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 15:36:34,293 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 15:36:34,294 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 15:36:34,299 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 15:36:34,300 INFO L85 PathProgramCache]: Analyzing trace with hash 353217602, now seen corresponding path program 1 times [2024-11-16 15:36:34,313 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-16 15:36:34,313 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1985492668] [2024-11-16 15:36:34,314 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 15:36:34,314 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-16 15:36:34,314 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-16 15:36:34,317 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-16 15:36:34,318 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-16 15:36:34,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:36:34,488 INFO L255 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-16 15:36:34,496 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 15:36:34,535 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 94 proven. 0 refuted. 0 times theorem prover too weak. 170 trivial. 0 not checked. [2024-11-16 15:36:34,535 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-16 15:36:34,536 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-16 15:36:34,536 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1985492668] [2024-11-16 15:36:34,537 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1985492668] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 15:36:34,537 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 15:36:34,537 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-16 15:36:34,540 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [682639403] [2024-11-16 15:36:34,541 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 15:36:34,546 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-16 15:36:34,546 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-16 15:36:34,569 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-16 15:36:34,569 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-16 15:36:34,572 INFO L87 Difference]: Start difference. First operand has 48 states, 33 states have (on average 1.3333333333333333) internal successors, (44), 34 states have internal predecessors, (44), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Second operand has 2 states, 2 states have (on average 14.5) internal successors, (29), 2 states have internal predecessors, (29), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-16 15:36:34,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 15:36:34,598 INFO L93 Difference]: Finished difference Result 88 states and 141 transitions. [2024-11-16 15:36:34,599 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-16 15:36:34,601 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 14.5) internal successors, (29), 2 states have internal predecessors, (29), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 82 [2024-11-16 15:36:34,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 15:36:34,610 INFO L225 Difference]: With dead ends: 88 [2024-11-16 15:36:34,610 INFO L226 Difference]: Without dead ends: 43 [2024-11-16 15:36:34,613 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 81 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-16 15:36:34,618 INFO L432 NwaCegarLoop]: 60 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, 60 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-16 15:36:34,620 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-16 15:36:34,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2024-11-16 15:36:34,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2024-11-16 15:36:34,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 29 states have (on average 1.2413793103448276) internal successors, (36), 29 states have internal predecessors, (36), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-16 15:36:34,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 60 transitions. [2024-11-16 15:36:34,664 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 60 transitions. Word has length 82 [2024-11-16 15:36:34,664 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 15:36:34,664 INFO L471 AbstractCegarLoop]: Abstraction has 43 states and 60 transitions. [2024-11-16 15:36:34,665 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 14.5) internal successors, (29), 2 states have internal predecessors, (29), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-16 15:36:34,665 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 60 transitions. [2024-11-16 15:36:34,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2024-11-16 15:36:34,670 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 15:36:34,670 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 15:36:34,677 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-16 15:36:34,871 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-16 15:36:34,872 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 15:36:34,873 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 15:36:34,874 INFO L85 PathProgramCache]: Analyzing trace with hash 519701728, now seen corresponding path program 1 times [2024-11-16 15:36:34,874 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-16 15:36:34,875 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2005586768] [2024-11-16 15:36:34,892 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 15:36:34,892 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-16 15:36:34,893 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-16 15:36:34,896 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-16 15:36:34,898 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-16 15:36:35,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:36:35,043 INFO L255 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-16 15:36:35,052 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 15:36:35,706 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 11 proven. 33 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-11-16 15:36:35,707 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-16 15:36:36,096 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 33 refuted. 0 times theorem prover too weak. 231 trivial. 0 not checked. [2024-11-16 15:36:36,097 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-16 15:36:36,097 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2005586768] [2024-11-16 15:36:36,097 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2005586768] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-16 15:36:36,097 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-16 15:36:36,097 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 13 [2024-11-16 15:36:36,098 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [491926422] [2024-11-16 15:36:36,098 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-16 15:36:36,099 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-16 15:36:36,099 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-16 15:36:36,100 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-16 15:36:36,100 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=100, Unknown=0, NotChecked=0, Total=156 [2024-11-16 15:36:36,101 INFO L87 Difference]: Start difference. First operand 43 states and 60 transitions. Second operand has 13 states, 13 states have (on average 3.923076923076923) internal successors, (51), 13 states have internal predecessors, (51), 4 states have call successors, (24), 3 states have call predecessors, (24), 4 states have return successors, (24), 2 states have call predecessors, (24), 4 states have call successors, (24) [2024-11-16 15:36:37,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 15:36:37,656 INFO L93 Difference]: Finished difference Result 223 states and 304 transitions. [2024-11-16 15:36:37,657 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2024-11-16 15:36:37,657 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 3.923076923076923) internal successors, (51), 13 states have internal predecessors, (51), 4 states have call successors, (24), 3 states have call predecessors, (24), 4 states have return successors, (24), 2 states have call predecessors, (24), 4 states have call successors, (24) Word has length 82 [2024-11-16 15:36:37,658 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 15:36:37,663 INFO L225 Difference]: With dead ends: 223 [2024-11-16 15:36:37,664 INFO L226 Difference]: Without dead ends: 183 [2024-11-16 15:36:37,665 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 179 GetRequests, 153 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 176 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=262, Invalid=494, Unknown=0, NotChecked=0, Total=756 [2024-11-16 15:36:37,667 INFO L432 NwaCegarLoop]: 64 mSDtfsCounter, 167 mSDsluCounter, 230 mSDsCounter, 0 mSdLazyCounter, 477 mSolverCounterSat, 96 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 169 SdHoareTripleChecker+Valid, 294 SdHoareTripleChecker+Invalid, 573 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 96 IncrementalHoareTripleChecker+Valid, 477 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-16 15:36:37,667 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [169 Valid, 294 Invalid, 573 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [96 Valid, 477 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-11-16 15:36:37,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2024-11-16 15:36:37,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 91. [2024-11-16 15:36:37,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 62 states have (on average 1.2096774193548387) internal successors, (75), 62 states have internal predecessors, (75), 24 states have call successors, (24), 4 states have call predecessors, (24), 4 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-11-16 15:36:37,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 123 transitions. [2024-11-16 15:36:37,702 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 123 transitions. Word has length 82 [2024-11-16 15:36:37,702 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 15:36:37,702 INFO L471 AbstractCegarLoop]: Abstraction has 91 states and 123 transitions. [2024-11-16 15:36:37,703 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 3.923076923076923) internal successors, (51), 13 states have internal predecessors, (51), 4 states have call successors, (24), 3 states have call predecessors, (24), 4 states have return successors, (24), 2 states have call predecessors, (24), 4 states have call successors, (24) [2024-11-16 15:36:37,703 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 123 transitions. [2024-11-16 15:36:37,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2024-11-16 15:36:37,711 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 15:36:37,711 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 15:36:37,720 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2024-11-16 15:36:37,912 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /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-16 15:36:37,912 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 15:36:37,913 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 15:36:37,913 INFO L85 PathProgramCache]: Analyzing trace with hash -122446010, now seen corresponding path program 1 times [2024-11-16 15:36:37,914 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-16 15:36:37,914 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1008332892] [2024-11-16 15:36:37,914 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 15:36:37,914 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-16 15:36:37,915 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-16 15:36:37,916 INFO L229 MonitoredProcess]: Starting monitored process 4 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-16 15:36:37,917 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 (4)] Waiting until timeout for monitored process [2024-11-16 15:36:38,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 15:36:38,033 INFO L255 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 21 conjuncts are in the unsatisfiable core [2024-11-16 15:36:38,047 INFO L278 TraceCheckSpWp]: Computing forward predicates...