./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/float-benchs/Muller_Kahan.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version eb692b52 Calling Ultimate with: /usr/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/float-benchs/Muller_Kahan.c -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.graphml --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 61ce2c272542663cace3442e405f7ab093d2a72e636da199b8b44596c79af6c9 --- Real Ultimate output --- This is Ultimate 0.2.2-?-eb692b5 [2022-07-19 13:31:57,465 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-19 13:31:57,488 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-19 13:31:57,526 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-19 13:31:57,526 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-19 13:31:57,527 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-19 13:31:57,529 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-19 13:31:57,532 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-19 13:31:57,534 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-19 13:31:57,537 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-19 13:31:57,537 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-19 13:31:57,539 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-19 13:31:57,539 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-19 13:31:57,540 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-19 13:31:57,541 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-19 13:31:57,543 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-19 13:31:57,544 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-19 13:31:57,545 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-19 13:31:57,546 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-19 13:31:57,550 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-19 13:31:57,551 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-19 13:31:57,552 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-19 13:31:57,552 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-19 13:31:57,553 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-19 13:31:57,554 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-19 13:31:57,559 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-19 13:31:57,559 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-19 13:31:57,559 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-19 13:31:57,560 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-19 13:31:57,560 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-19 13:31:57,561 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-19 13:31:57,561 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-19 13:31:57,562 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-19 13:31:57,563 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-19 13:31:57,563 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-19 13:31:57,564 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-19 13:31:57,565 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-19 13:31:57,565 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-19 13:31:57,565 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-19 13:31:57,565 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-19 13:31:57,566 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-19 13:31:57,567 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-19 13:31:57,568 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-07-19 13:31:57,596 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-19 13:31:57,597 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-19 13:31:57,597 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-19 13:31:57,597 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-19 13:31:57,598 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-19 13:31:57,598 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-19 13:31:57,598 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-19 13:31:57,598 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-19 13:31:57,598 INFO L138 SettingsManager]: * Use SBE=true [2022-07-19 13:31:57,599 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-19 13:31:57,599 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-19 13:31:57,600 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-19 13:31:57,600 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-19 13:31:57,600 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-19 13:31:57,600 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-19 13:31:57,600 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-19 13:31:57,600 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-19 13:31:57,600 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-19 13:31:57,601 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-19 13:31:57,601 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-19 13:31:57,601 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-19 13:31:57,601 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-19 13:31:57,601 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-19 13:31:57,602 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-19 13:31:57,602 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-19 13:31:57,602 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-19 13:31:57,602 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-19 13:31:57,603 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-19 13:31:57,603 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-19 13:31:57,603 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-19 13:31:57,603 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-19 13:31:57,603 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-19 13:31:57,603 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-19 13:31:57,604 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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.graphml 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 -> 61ce2c272542663cace3442e405f7ab093d2a72e636da199b8b44596c79af6c9 [2022-07-19 13:31:57,767 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-19 13:31:57,785 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-19 13:31:57,787 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-19 13:31:57,788 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-19 13:31:57,788 INFO L275 PluginConnector]: CDTParser initialized [2022-07-19 13:31:57,789 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/float-benchs/Muller_Kahan.c [2022-07-19 13:31:57,839 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d665563e6/99908c0786e744f2b5c783a589a496c8/FLAG68d037151 [2022-07-19 13:31:58,207 INFO L306 CDTParser]: Found 1 translation units. [2022-07-19 13:31:58,207 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-benchs/Muller_Kahan.c [2022-07-19 13:31:58,211 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d665563e6/99908c0786e744f2b5c783a589a496c8/FLAG68d037151 [2022-07-19 13:31:58,219 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d665563e6/99908c0786e744f2b5c783a589a496c8 [2022-07-19 13:31:58,221 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-19 13:31:58,222 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-19 13:31:58,223 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-19 13:31:58,223 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-19 13:31:58,225 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-19 13:31:58,225 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.07 01:31:58" (1/1) ... [2022-07-19 13:31:58,226 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4289fcdd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 01:31:58, skipping insertion in model container [2022-07-19 13:31:58,226 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.07 01:31:58" (1/1) ... [2022-07-19 13:31:58,231 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-19 13:31:58,239 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-19 13:31:58,343 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-benchs/Muller_Kahan.c[631,644] [2022-07-19 13:31:58,354 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-19 13:31:58,358 INFO L203 MainTranslator]: Completed pre-run [2022-07-19 13:31:58,366 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-benchs/Muller_Kahan.c[631,644] [2022-07-19 13:31:58,368 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-19 13:31:58,375 INFO L208 MainTranslator]: Completed translation [2022-07-19 13:31:58,376 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 01:31:58 WrapperNode [2022-07-19 13:31:58,376 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-19 13:31:58,377 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-19 13:31:58,377 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-19 13:31:58,377 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-19 13:31:58,382 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 01:31:58" (1/1) ... [2022-07-19 13:31:58,388 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 01:31:58" (1/1) ... [2022-07-19 13:31:58,402 INFO L137 Inliner]: procedures = 12, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 36 [2022-07-19 13:31:58,402 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-19 13:31:58,404 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-19 13:31:58,404 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-19 13:31:58,404 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-19 13:31:58,409 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 01:31:58" (1/1) ... [2022-07-19 13:31:58,409 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 01:31:58" (1/1) ... [2022-07-19 13:31:58,410 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 01:31:58" (1/1) ... [2022-07-19 13:31:58,410 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 01:31:58" (1/1) ... [2022-07-19 13:31:58,412 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 01:31:58" (1/1) ... [2022-07-19 13:31:58,414 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 01:31:58" (1/1) ... [2022-07-19 13:31:58,415 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 01:31:58" (1/1) ... [2022-07-19 13:31:58,415 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-19 13:31:58,416 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-19 13:31:58,416 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-19 13:31:58,416 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-19 13:31:58,417 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 01:31:58" (1/1) ... [2022-07-19 13:31:58,422 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-19 13:31:58,428 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 13:31:58,437 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-07-19 13:31:58,439 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-07-19 13:31:58,476 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-19 13:31:58,476 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-19 13:31:58,477 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-19 13:31:58,477 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-19 13:31:58,512 INFO L234 CfgBuilder]: Building ICFG [2022-07-19 13:31:58,513 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-19 13:31:58,572 INFO L275 CfgBuilder]: Performing block encoding [2022-07-19 13:31:58,576 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-19 13:31:58,576 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-07-19 13:31:58,577 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.07 01:31:58 BoogieIcfgContainer [2022-07-19 13:31:58,577 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-19 13:31:58,578 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-19 13:31:58,578 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-19 13:31:58,585 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-19 13:31:58,585 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.07 01:31:58" (1/3) ... [2022-07-19 13:31:58,586 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2d4a2191 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.07 01:31:58, skipping insertion in model container [2022-07-19 13:31:58,586 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 01:31:58" (2/3) ... [2022-07-19 13:31:58,586 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2d4a2191 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.07 01:31:58, skipping insertion in model container [2022-07-19 13:31:58,587 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.07 01:31:58" (3/3) ... [2022-07-19 13:31:58,587 INFO L111 eAbstractionObserver]: Analyzing ICFG Muller_Kahan.c [2022-07-19 13:31:58,597 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-19 13:31:58,597 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-19 13:31:58,627 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-19 13:31:58,631 INFO L357 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, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, 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=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@47f6e16, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@3b958fb1 [2022-07-19 13:31:58,632 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-07-19 13:31:58,635 INFO L276 IsEmpty]: Start isEmpty. Operand has 12 states, 10 states have (on average 1.4) internal successors, (14), 11 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 13:31:58,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-07-19 13:31:58,639 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 13:31:58,639 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-07-19 13:31:58,640 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 13:31:58,643 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 13:31:58,643 INFO L85 PathProgramCache]: Analyzing trace with hash 889605037, now seen corresponding path program 1 times [2022-07-19 13:31:58,649 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 13:31:58,649 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1807419811] [2022-07-19 13:31:58,650 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 13:31:58,650 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 13:31:58,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 13:31:58,732 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 13:31:58,732 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 13:31:58,733 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1807419811] [2022-07-19 13:31:58,733 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1807419811] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 13:31:58,733 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 13:31:58,734 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-19 13:31:58,735 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1994644652] [2022-07-19 13:31:58,735 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 13:31:58,738 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-19 13:31:58,738 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 13:31:58,754 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-19 13:31:58,755 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-19 13:31:58,757 INFO L87 Difference]: Start difference. First operand has 12 states, 10 states have (on average 1.4) internal successors, (14), 11 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 13:31:58,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 13:31:58,771 INFO L93 Difference]: Finished difference Result 22 states and 26 transitions. [2022-07-19 13:31:58,772 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-19 13:31:58,773 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2022-07-19 13:31:58,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 13:31:58,777 INFO L225 Difference]: With dead ends: 22 [2022-07-19 13:31:58,778 INFO L226 Difference]: Without dead ends: 10 [2022-07-19 13:31:58,780 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-19 13:31:58,782 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 1 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 18 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-19 13:31:58,783 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 18 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-19 13:31:58,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2022-07-19 13:31:58,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 9. [2022-07-19 13:31:58,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 8 states have (on average 1.125) internal successors, (9), 8 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 13:31:58,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 9 transitions. [2022-07-19 13:31:58,812 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 9 transitions. Word has length 6 [2022-07-19 13:31:58,812 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 13:31:58,812 INFO L495 AbstractCegarLoop]: Abstraction has 9 states and 9 transitions. [2022-07-19 13:31:58,812 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 13:31:58,813 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 9 transitions. [2022-07-19 13:31:58,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-07-19 13:31:58,813 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 13:31:58,813 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 13:31:58,813 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-19 13:31:58,814 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 13:31:58,814 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 13:31:58,814 INFO L85 PathProgramCache]: Analyzing trace with hash 265180975, now seen corresponding path program 1 times [2022-07-19 13:31:58,814 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 13:31:58,815 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1095243471] [2022-07-19 13:31:58,815 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 13:31:58,815 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 13:31:58,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 13:31:58,851 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 13:31:58,851 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 13:31:58,851 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1095243471] [2022-07-19 13:31:58,852 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1095243471] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 13:31:58,852 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [800483231] [2022-07-19 13:31:58,852 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 13:31:58,852 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 13:31:58,852 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 13:31:58,854 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) [2022-07-19 13:31:58,855 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-07-19 13:31:58,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 13:31:58,901 INFO L263 TraceCheckSpWp]: Trace formula consists of 42 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-19 13:31:58,904 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 13:31:58,932 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 13:31:58,932 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-19 13:31:58,964 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 13:31:58,964 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [800483231] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-19 13:31:58,965 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-19 13:31:58,965 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2022-07-19 13:31:58,965 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1355868569] [2022-07-19 13:31:58,966 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-19 13:31:58,966 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-19 13:31:58,966 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 13:31:58,967 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-19 13:31:58,967 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2022-07-19 13:31:58,967 INFO L87 Difference]: Start difference. First operand 9 states and 9 transitions. Second operand has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 7 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 13:31:58,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 13:31:58,984 INFO L93 Difference]: Finished difference Result 19 states and 21 transitions. [2022-07-19 13:31:58,984 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-19 13:31:58,984 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 7 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2022-07-19 13:31:58,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 13:31:58,985 INFO L225 Difference]: With dead ends: 19 [2022-07-19 13:31:58,985 INFO L226 Difference]: Without dead ends: 15 [2022-07-19 13:31:58,986 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2022-07-19 13:31:58,987 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 4 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 18 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-19 13:31:58,987 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 18 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-19 13:31:58,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2022-07-19 13:31:58,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2022-07-19 13:31:58,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 14 states have (on average 1.0714285714285714) internal successors, (15), 14 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 13:31:58,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 15 transitions. [2022-07-19 13:31:58,995 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 15 transitions. Word has length 8 [2022-07-19 13:31:58,995 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 13:31:58,995 INFO L495 AbstractCegarLoop]: Abstraction has 15 states and 15 transitions. [2022-07-19 13:31:58,996 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 7 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 13:31:58,996 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2022-07-19 13:31:58,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-07-19 13:31:58,996 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 13:31:58,997 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 1, 1, 1, 1, 1, 1] [2022-07-19 13:31:59,014 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-07-19 13:31:59,206 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 13:31:59,206 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 13:31:59,207 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 13:31:59,208 INFO L85 PathProgramCache]: Analyzing trace with hash -1745754443, now seen corresponding path program 2 times [2022-07-19 13:31:59,208 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 13:31:59,208 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [717778709] [2022-07-19 13:31:59,208 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 13:31:59,209 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 13:31:59,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 13:31:59,281 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 13:31:59,282 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 13:31:59,282 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [717778709] [2022-07-19 13:31:59,282 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [717778709] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 13:31:59,285 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1532910616] [2022-07-19 13:31:59,286 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-19 13:31:59,286 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 13:31:59,286 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 13:31:59,288 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) [2022-07-19 13:31:59,289 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-07-19 13:31:59,335 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-19 13:31:59,338 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-19 13:31:59,339 INFO L263 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 6 conjunts are in the unsatisfiable core [2022-07-19 13:31:59,340 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 13:31:59,373 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 13:31:59,374 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-19 13:31:59,444 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 13:31:59,446 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1532910616] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-19 13:31:59,446 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-19 13:31:59,446 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2022-07-19 13:31:59,446 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [140821427] [2022-07-19 13:31:59,447 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-19 13:31:59,447 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-07-19 13:31:59,448 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 13:31:59,448 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-07-19 13:31:59,449 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2022-07-19 13:31:59,449 INFO L87 Difference]: Start difference. First operand 15 states and 15 transitions. Second operand has 13 states, 13 states have (on average 2.076923076923077) internal successors, (27), 13 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 13:31:59,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 13:31:59,489 INFO L93 Difference]: Finished difference Result 31 states and 36 transitions. [2022-07-19 13:31:59,489 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-07-19 13:31:59,489 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.076923076923077) internal successors, (27), 13 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2022-07-19 13:31:59,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 13:31:59,490 INFO L225 Difference]: With dead ends: 31 [2022-07-19 13:31:59,490 INFO L226 Difference]: Without dead ends: 27 [2022-07-19 13:31:59,491 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2022-07-19 13:31:59,494 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 10 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 18 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-19 13:31:59,495 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 18 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-19 13:31:59,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2022-07-19 13:31:59,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2022-07-19 13:31:59,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 26 states have (on average 1.0384615384615385) internal successors, (27), 26 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 13:31:59,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 27 transitions. [2022-07-19 13:31:59,502 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 27 transitions. Word has length 14 [2022-07-19 13:31:59,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 13:31:59,502 INFO L495 AbstractCegarLoop]: Abstraction has 27 states and 27 transitions. [2022-07-19 13:31:59,502 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.076923076923077) internal successors, (27), 13 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 13:31:59,503 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 27 transitions. [2022-07-19 13:31:59,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-07-19 13:31:59,503 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 13:31:59,503 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 1, 1, 1, 1, 1, 1] [2022-07-19 13:31:59,523 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-07-19 13:31:59,724 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2022-07-19 13:31:59,724 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 13:31:59,725 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 13:31:59,725 INFO L85 PathProgramCache]: Analyzing trace with hash -95702975, now seen corresponding path program 3 times [2022-07-19 13:31:59,725 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 13:31:59,725 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1483656681] [2022-07-19 13:31:59,725 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 13:31:59,725 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 13:31:59,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 13:31:59,853 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 13:31:59,853 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 13:31:59,854 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1483656681] [2022-07-19 13:31:59,854 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1483656681] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 13:31:59,854 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [571361271] [2022-07-19 13:31:59,854 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-07-19 13:31:59,854 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 13:31:59,854 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 13:31:59,856 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-19 13:31:59,857 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-07-19 13:31:59,894 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2022-07-19 13:31:59,895 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-19 13:31:59,895 INFO L263 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 12 conjunts are in the unsatisfiable core [2022-07-19 13:31:59,897 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 13:31:59,944 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 13:31:59,944 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-19 13:32:00,128 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 13:32:00,128 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [571361271] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-19 13:32:00,128 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-19 13:32:00,128 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 25 [2022-07-19 13:32:00,129 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1445697784] [2022-07-19 13:32:00,129 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-19 13:32:00,129 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-07-19 13:32:00,129 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 13:32:00,130 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-07-19 13:32:00,130 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=300, Invalid=300, Unknown=0, NotChecked=0, Total=600 [2022-07-19 13:32:00,130 INFO L87 Difference]: Start difference. First operand 27 states and 27 transitions. Second operand has 25 states, 25 states have (on average 2.04) internal successors, (51), 25 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 13:32:00,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 13:32:00,186 INFO L93 Difference]: Finished difference Result 55 states and 66 transitions. [2022-07-19 13:32:00,187 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-07-19 13:32:00,187 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 2.04) internal successors, (51), 25 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2022-07-19 13:32:00,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 13:32:00,188 INFO L225 Difference]: With dead ends: 55 [2022-07-19 13:32:00,188 INFO L226 Difference]: Without dead ends: 51 [2022-07-19 13:32:00,188 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=300, Invalid=300, Unknown=0, NotChecked=0, Total=600 [2022-07-19 13:32:00,189 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 33 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 22 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-19 13:32:00,189 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 22 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-19 13:32:00,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2022-07-19 13:32:00,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2022-07-19 13:32:00,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 50 states have (on average 1.02) internal successors, (51), 50 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 13:32:00,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 51 transitions. [2022-07-19 13:32:00,194 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 51 transitions. Word has length 26 [2022-07-19 13:32:00,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 13:32:00,194 INFO L495 AbstractCegarLoop]: Abstraction has 51 states and 51 transitions. [2022-07-19 13:32:00,194 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 2.04) internal successors, (51), 25 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 13:32:00,195 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 51 transitions. [2022-07-19 13:32:00,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2022-07-19 13:32:00,195 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 13:32:00,195 INFO L195 NwaCegarLoop]: trace histogram [22, 22, 1, 1, 1, 1, 1, 1] [2022-07-19 13:32:00,215 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-07-19 13:32:00,413 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 13:32:00,414 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 13:32:00,414 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 13:32:00,414 INFO L85 PathProgramCache]: Analyzing trace with hash 1293970777, now seen corresponding path program 4 times [2022-07-19 13:32:00,414 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 13:32:00,414 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1153749391] [2022-07-19 13:32:00,414 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 13:32:00,414 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 13:32:00,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 13:32:00,709 INFO L134 CoverageAnalysis]: Checked inductivity of 484 backedges. 0 proven. 484 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 13:32:00,709 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 13:32:00,709 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1153749391] [2022-07-19 13:32:00,710 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1153749391] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 13:32:00,710 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [174641539] [2022-07-19 13:32:00,710 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-07-19 13:32:00,710 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 13:32:00,710 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 13:32:00,711 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-19 13:32:00,712 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-07-19 13:32:00,755 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-07-19 13:32:00,755 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-19 13:32:00,756 INFO L263 TraceCheckSpWp]: Trace formula consists of 189 conjuncts, 24 conjunts are in the unsatisfiable core [2022-07-19 13:32:00,759 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 13:32:00,833 INFO L134 CoverageAnalysis]: Checked inductivity of 484 backedges. 0 proven. 484 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 13:32:00,833 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-19 13:32:01,423 INFO L134 CoverageAnalysis]: Checked inductivity of 484 backedges. 0 proven. 484 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 13:32:01,423 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [174641539] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-19 13:32:01,423 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-19 13:32:01,423 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25, 25] total 49 [2022-07-19 13:32:01,424 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [983542620] [2022-07-19 13:32:01,424 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-19 13:32:01,424 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 49 states [2022-07-19 13:32:01,424 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 13:32:01,425 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2022-07-19 13:32:01,426 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1176, Invalid=1176, Unknown=0, NotChecked=0, Total=2352 [2022-07-19 13:32:01,426 INFO L87 Difference]: Start difference. First operand 51 states and 51 transitions. Second operand has 49 states, 49 states have (on average 2.020408163265306) internal successors, (99), 49 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 13:32:01,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 13:32:01,550 INFO L93 Difference]: Finished difference Result 103 states and 126 transitions. [2022-07-19 13:32:01,550 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2022-07-19 13:32:01,550 INFO L78 Accepts]: Start accepts. Automaton has has 49 states, 49 states have (on average 2.020408163265306) internal successors, (99), 49 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 50 [2022-07-19 13:32:01,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 13:32:01,551 INFO L225 Difference]: With dead ends: 103 [2022-07-19 13:32:01,551 INFO L226 Difference]: Without dead ends: 99 [2022-07-19 13:32:01,552 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 76 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 88 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=1176, Invalid=1176, Unknown=0, NotChecked=0, Total=2352 [2022-07-19 13:32:01,552 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 46 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 97 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 22 SdHoareTripleChecker+Invalid, 128 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 97 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-19 13:32:01,553 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 22 Invalid, 128 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 97 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-19 13:32:01,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2022-07-19 13:32:01,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 99. [2022-07-19 13:32:01,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 98 states have (on average 1.010204081632653) internal successors, (99), 98 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 13:32:01,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 99 transitions. [2022-07-19 13:32:01,560 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 99 transitions. Word has length 50 [2022-07-19 13:32:01,560 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 13:32:01,560 INFO L495 AbstractCegarLoop]: Abstraction has 99 states and 99 transitions. [2022-07-19 13:32:01,560 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 49 states, 49 states have (on average 2.020408163265306) internal successors, (99), 49 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 13:32:01,560 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 99 transitions. [2022-07-19 13:32:01,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2022-07-19 13:32:01,562 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 13:32:01,562 INFO L195 NwaCegarLoop]: trace histogram [46, 46, 1, 1, 1, 1, 1, 1] [2022-07-19 13:32:01,578 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2022-07-19 13:32:01,770 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 13:32:01,771 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 13:32:01,771 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 13:32:01,771 INFO L85 PathProgramCache]: Analyzing trace with hash -675115127, now seen corresponding path program 5 times [2022-07-19 13:32:01,771 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 13:32:01,771 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [3802564] [2022-07-19 13:32:01,771 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 13:32:01,772 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 13:32:01,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 13:32:02,587 INFO L134 CoverageAnalysis]: Checked inductivity of 2116 backedges. 0 proven. 2116 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 13:32:02,588 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 13:32:02,588 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [3802564] [2022-07-19 13:32:02,588 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [3802564] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 13:32:02,588 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1542286317] [2022-07-19 13:32:02,588 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-07-19 13:32:02,588 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 13:32:02,588 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 13:32:02,589 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-19 13:32:02,590 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-07-19 13:32:02,674 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 47 check-sat command(s) [2022-07-19 13:32:02,674 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-19 13:32:02,675 INFO L263 TraceCheckSpWp]: Trace formula consists of 357 conjuncts, 48 conjunts are in the unsatisfiable core [2022-07-19 13:32:02,679 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 13:32:02,787 INFO L134 CoverageAnalysis]: Checked inductivity of 2116 backedges. 0 proven. 2116 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 13:32:02,787 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-19 13:32:04,841 INFO L134 CoverageAnalysis]: Checked inductivity of 2116 backedges. 0 proven. 2116 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 13:32:04,841 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1542286317] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-19 13:32:04,841 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-19 13:32:04,842 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [49, 49, 49] total 97 [2022-07-19 13:32:04,842 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [157925710] [2022-07-19 13:32:04,842 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-19 13:32:04,842 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 97 states [2022-07-19 13:32:04,843 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 13:32:04,844 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 97 interpolants. [2022-07-19 13:32:04,846 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=4656, Invalid=4656, Unknown=0, NotChecked=0, Total=9312 [2022-07-19 13:32:04,847 INFO L87 Difference]: Start difference. First operand 99 states and 99 transitions. Second operand has 97 states, 97 states have (on average 2.0103092783505154) internal successors, (195), 97 states have internal predecessors, (195), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 13:32:05,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 13:32:05,076 INFO L93 Difference]: Finished difference Result 199 states and 246 transitions. [2022-07-19 13:32:05,076 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 96 states. [2022-07-19 13:32:05,076 INFO L78 Accepts]: Start accepts. Automaton has has 97 states, 97 states have (on average 2.0103092783505154) internal successors, (195), 97 states have internal predecessors, (195), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 98 [2022-07-19 13:32:05,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 13:32:05,078 INFO L225 Difference]: With dead ends: 199 [2022-07-19 13:32:05,078 INFO L226 Difference]: Without dead ends: 195 [2022-07-19 13:32:05,080 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 243 GetRequests, 148 SyntacticMatches, 0 SemanticMatches, 95 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 184 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=4656, Invalid=4656, Unknown=0, NotChecked=0, Total=9312 [2022-07-19 13:32:05,080 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 141 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 193 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 141 SdHoareTripleChecker+Valid, 22 SdHoareTripleChecker+Invalid, 245 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 193 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-19 13:32:05,081 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [141 Valid, 22 Invalid, 245 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 193 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-19 13:32:05,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2022-07-19 13:32:05,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 195. [2022-07-19 13:32:05,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 195 states, 194 states have (on average 1.0051546391752577) internal successors, (195), 194 states have internal predecessors, (195), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 13:32:05,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 195 transitions. [2022-07-19 13:32:05,105 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 195 transitions. Word has length 98 [2022-07-19 13:32:05,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 13:32:05,106 INFO L495 AbstractCegarLoop]: Abstraction has 195 states and 195 transitions. [2022-07-19 13:32:05,106 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 97 states, 97 states have (on average 2.0103092783505154) internal successors, (195), 97 states have internal predecessors, (195), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 13:32:05,106 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 195 transitions. [2022-07-19 13:32:05,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2022-07-19 13:32:05,108 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 13:32:05,109 INFO L195 NwaCegarLoop]: trace histogram [94, 94, 1, 1, 1, 1, 1, 1] [2022-07-19 13:32:05,126 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-07-19 13:32:05,315 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 13:32:05,315 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 13:32:05,315 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 13:32:05,315 INFO L85 PathProgramCache]: Analyzing trace with hash -1064733719, now seen corresponding path program 6 times [2022-07-19 13:32:05,316 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 13:32:05,316 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1983561701] [2022-07-19 13:32:05,316 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 13:32:05,316 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 13:32:05,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 13:32:07,906 INFO L134 CoverageAnalysis]: Checked inductivity of 8836 backedges. 0 proven. 8836 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 13:32:07,907 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 13:32:07,907 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1983561701] [2022-07-19 13:32:07,907 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1983561701] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 13:32:07,907 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [178966146] [2022-07-19 13:32:07,907 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-07-19 13:32:07,907 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 13:32:07,907 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 13:32:07,908 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-19 13:32:07,909 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-07-19 13:32:08,077 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 95 check-sat command(s) [2022-07-19 13:32:08,077 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-19 13:32:08,080 INFO L263 TraceCheckSpWp]: Trace formula consists of 693 conjuncts, 96 conjunts are in the unsatisfiable core [2022-07-19 13:32:08,085 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 13:32:08,286 INFO L134 CoverageAnalysis]: Checked inductivity of 8836 backedges. 0 proven. 8836 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 13:32:08,286 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-19 13:32:08,818 INFO L134 CoverageAnalysis]: Checked inductivity of 8836 backedges. 0 proven. 8836 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 13:32:08,818 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [178966146] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-19 13:32:08,818 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-19 13:32:08,818 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [97, 97, 97] total 103 [2022-07-19 13:32:08,819 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [467969300] [2022-07-19 13:32:08,819 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-19 13:32:08,820 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 103 states [2022-07-19 13:32:08,820 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 13:32:08,821 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 103 interpolants. [2022-07-19 13:32:08,823 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5253, Invalid=5253, Unknown=0, NotChecked=0, Total=10506 [2022-07-19 13:32:08,823 INFO L87 Difference]: Start difference. First operand 195 states and 195 transitions. Second operand has 103 states, 103 states have (on average 2.029126213592233) internal successors, (209), 103 states have internal predecessors, (209), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 13:32:08,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 13:32:08,982 INFO L93 Difference]: Finished difference Result 211 states and 216 transitions. [2022-07-19 13:32:08,982 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 102 states. [2022-07-19 13:32:08,982 INFO L78 Accepts]: Start accepts. Automaton has has 103 states, 103 states have (on average 2.029126213592233) internal successors, (209), 103 states have internal predecessors, (209), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 194 [2022-07-19 13:32:08,983 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 13:32:08,984 INFO L225 Difference]: With dead ends: 211 [2022-07-19 13:32:08,984 INFO L226 Difference]: Without dead ends: 207 [2022-07-19 13:32:08,986 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 483 GetRequests, 381 SyntacticMatches, 1 SemanticMatches, 101 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 203 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=5253, Invalid=5253, Unknown=0, NotChecked=0, Total=10506 [2022-07-19 13:32:08,986 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 100 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 205 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 100 SdHoareTripleChecker+Valid, 22 SdHoareTripleChecker+Invalid, 211 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 205 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-19 13:32:08,986 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [100 Valid, 22 Invalid, 211 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 205 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-19 13:32:08,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2022-07-19 13:32:08,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 207. [2022-07-19 13:32:08,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 207 states, 206 states have (on average 1.0048543689320388) internal successors, (207), 206 states have internal predecessors, (207), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 13:32:08,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 207 transitions. [2022-07-19 13:32:08,995 INFO L78 Accepts]: Start accepts. Automaton has 207 states and 207 transitions. Word has length 194 [2022-07-19 13:32:08,995 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 13:32:08,996 INFO L495 AbstractCegarLoop]: Abstraction has 207 states and 207 transitions. [2022-07-19 13:32:08,996 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 103 states, 103 states have (on average 2.029126213592233) internal successors, (209), 103 states have internal predecessors, (209), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 13:32:08,996 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 207 transitions. [2022-07-19 13:32:08,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2022-07-19 13:32:09,000 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 13:32:09,000 INFO L195 NwaCegarLoop]: trace histogram [100, 100, 1, 1, 1, 1, 1, 1] [2022-07-19 13:32:09,021 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-07-19 13:32:09,219 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 13:32:09,220 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 13:32:09,220 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 13:32:09,220 INFO L85 PathProgramCache]: Analyzing trace with hash -1785393291, now seen corresponding path program 7 times [2022-07-19 13:32:09,220 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 13:32:09,220 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1612969757] [2022-07-19 13:32:09,220 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 13:32:09,220 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 13:32:09,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-19 13:32:09,268 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-19 13:32:09,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-19 13:32:09,353 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-19 13:32:09,353 INFO L271 BasicCegarLoop]: Counterexample is feasible [2022-07-19 13:32:09,354 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-07-19 13:32:09,355 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-07-19 13:32:09,357 INFO L356 BasicCegarLoop]: Path program histogram: [7, 1] [2022-07-19 13:32:09,360 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-07-19 13:32:09,433 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.07 01:32:09 BoogieIcfgContainer [2022-07-19 13:32:09,433 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-07-19 13:32:09,433 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-07-19 13:32:09,434 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-07-19 13:32:09,434 INFO L275 PluginConnector]: Witness Printer initialized [2022-07-19 13:32:09,434 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.07 01:31:58" (3/4) ... [2022-07-19 13:32:09,436 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-07-19 13:32:09,436 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-07-19 13:32:09,436 INFO L158 Benchmark]: Toolchain (without parser) took 11214.42ms. Allocated memory was 96.5MB in the beginning and 151.0MB in the end (delta: 54.5MB). Free memory was 65.3MB in the beginning and 109.2MB in the end (delta: -43.9MB). Peak memory consumption was 10.6MB. Max. memory is 16.1GB. [2022-07-19 13:32:09,437 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 96.5MB. Free memory was 53.0MB in the beginning and 52.9MB in the end (delta: 84.1kB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-19 13:32:09,437 INFO L158 Benchmark]: CACSL2BoogieTranslator took 153.37ms. Allocated memory was 96.5MB in the beginning and 125.8MB in the end (delta: 29.4MB). Free memory was 65.1MB in the beginning and 101.1MB in the end (delta: -36.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-07-19 13:32:09,437 INFO L158 Benchmark]: Boogie Procedure Inliner took 25.89ms. Allocated memory is still 125.8MB. Free memory was 101.1MB in the beginning and 99.9MB in the end (delta: 1.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-19 13:32:09,437 INFO L158 Benchmark]: Boogie Preprocessor took 11.91ms. Allocated memory is still 125.8MB. Free memory was 99.9MB in the beginning and 98.6MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-19 13:32:09,437 INFO L158 Benchmark]: RCFGBuilder took 161.14ms. Allocated memory is still 125.8MB. Free memory was 98.6MB in the beginning and 90.2MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-07-19 13:32:09,438 INFO L158 Benchmark]: TraceAbstraction took 10854.83ms. Allocated memory was 125.8MB in the beginning and 151.0MB in the end (delta: 25.2MB). Free memory was 89.4MB in the beginning and 109.2MB in the end (delta: -19.8MB). Peak memory consumption was 79.4MB. Max. memory is 16.1GB. [2022-07-19 13:32:09,438 INFO L158 Benchmark]: Witness Printer took 2.50ms. Allocated memory is still 151.0MB. Free memory is still 109.2MB. There was no memory consumed. Max. memory is 16.1GB. [2022-07-19 13:32:09,439 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15ms. Allocated memory is still 96.5MB. Free memory was 53.0MB in the beginning and 52.9MB in the end (delta: 84.1kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 153.37ms. Allocated memory was 96.5MB in the beginning and 125.8MB in the end (delta: 29.4MB). Free memory was 65.1MB in the beginning and 101.1MB in the end (delta: -36.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 25.89ms. Allocated memory is still 125.8MB. Free memory was 101.1MB in the beginning and 99.9MB in the end (delta: 1.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 11.91ms. Allocated memory is still 125.8MB. Free memory was 99.9MB in the beginning and 98.6MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 161.14ms. Allocated memory is still 125.8MB. Free memory was 98.6MB in the beginning and 90.2MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 10854.83ms. Allocated memory was 125.8MB in the beginning and 151.0MB in the end (delta: 25.2MB). Free memory was 89.4MB in the beginning and 109.2MB in the end (delta: -19.8MB). Peak memory consumption was 79.4MB. Max. memory is 16.1GB. * Witness Printer took 2.50ms. Allocated memory is still 151.0MB. Free memory is still 109.2MB. 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: 12]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: overapproximation of someBinaryDOUBLEComparisonOperation at line 27, overapproximation of someBinaryArithmeticDOUBLEoperation at line 22. Possible FailurePath: [L16] double x0, x1, x2; [L17] int i; [L19] x0 = 11. / 2. [L20] x1 = 61. / 11. [L21] i = 0 VAL [i=0] [L21] COND TRUE i < 100 [L22] x2 = 111. - (1130. - 3000. / x0) / x1 [L23] x0 = x1 [L24] x1 = x2 VAL [i=0, x0=188, x1=112, x2=112] [L21] i++ VAL [i=1, x0=188, x1=112, x2=112] [L21] COND TRUE i < 100 [L22] x2 = 111. - (1130. - 3000. / x0) / x1 [L23] x0 = x1 [L24] x1 = x2 VAL [i=1, x0=112, x1=122, x2=122] [L21] i++ VAL [i=2, x0=112, x1=122, x2=122] [L21] COND TRUE i < 100 [L22] x2 = 111. - (1130. - 3000. / x0) / x1 [L23] x0 = x1 [L24] x1 = x2 VAL [i=2, x0=122, x1=192, x2=192] [L21] i++ VAL [i=3, x0=122, x1=192, x2=192] [L21] COND TRUE i < 100 [L22] x2 = 111. - (1130. - 3000. / x0) / x1 [L23] x0 = x1 [L24] x1 = x2 VAL [i=3, x0=192, x1=133, x2=133] [L21] i++ VAL [i=4, x0=192, x1=133, x2=133] [L21] COND TRUE i < 100 [L22] x2 = 111. - (1130. - 3000. / x0) / x1 [L23] x0 = x1 [L24] x1 = x2 VAL [i=4, x0=133, x1=141, x2=141] [L21] i++ VAL [i=5, x0=133, x1=141, x2=141] [L21] COND TRUE i < 100 [L22] x2 = 111. - (1130. - 3000. / x0) / x1 [L23] x0 = x1 [L24] x1 = x2 VAL [i=5, x0=141, x1=145, x2=145] [L21] i++ VAL [i=6, x0=141, x1=145, x2=145] [L21] COND TRUE i < 100 [L22] x2 = 111. - (1130. - 3000. / x0) / x1 [L23] x0 = x1 [L24] x1 = x2 VAL [i=6, x0=145, x1=155, x2=155] [L21] i++ VAL [i=7, x0=145, x1=155, x2=155] [L21] COND TRUE i < 100 [L22] x2 = 111. - (1130. - 3000. / x0) / x1 [L23] x0 = x1 [L24] x1 = x2 VAL [i=7, x0=155, x1=198, x2=198] [L21] i++ VAL [i=8, x0=155, x1=198, x2=198] [L21] COND TRUE i < 100 [L22] x2 = 111. - (1130. - 3000. / x0) / x1 [L23] x0 = x1 [L24] x1 = x2 VAL [i=8, x0=198, x1=178, x2=178] [L21] i++ VAL [i=9, x0=198, x1=178, x2=178] [L21] COND TRUE i < 100 [L22] x2 = 111. - (1130. - 3000. / x0) / x1 [L23] x0 = x1 [L24] x1 = x2 VAL [i=9, x0=178, x1=200, x2=200] [L21] i++ VAL [i=10, x0=178, x1=200, x2=200] [L21] COND TRUE i < 100 [L22] x2 = 111. - (1130. - 3000. / x0) / x1 [L23] x0 = x1 [L24] x1 = x2 VAL [i=10, x0=200, x1=172, x2=172] [L21] i++ VAL [i=11, x0=200, x1=172, x2=172] [L21] COND TRUE i < 100 [L22] x2 = 111. - (1130. - 3000. / x0) / x1 [L23] x0 = x1 [L24] x1 = x2 VAL [i=11, x0=172, x1=149, x2=149] [L21] i++ VAL [i=12, x0=172, x1=149, x2=149] [L21] COND TRUE i < 100 [L22] x2 = 111. - (1130. - 3000. / x0) / x1 [L23] x0 = x1 [L24] x1 = x2 VAL [i=12, x0=149, x1=194, x2=194] [L21] i++ VAL [i=13, x0=149, x1=194, x2=194] [L21] COND TRUE i < 100 [L22] x2 = 111. - (1130. - 3000. / x0) / x1 [L23] x0 = x1 [L24] x1 = x2 VAL [i=13, x0=194, x1=130, x2=130] [L21] i++ VAL [i=14, x0=194, x1=130, x2=130] [L21] COND TRUE i < 100 [L22] x2 = 111. - (1130. - 3000. / x0) / x1 [L23] x0 = x1 [L24] x1 = x2 VAL [i=14, x0=130, x1=173, x2=173] [L21] i++ VAL [i=15, x0=130, x1=173, x2=173] [L21] COND TRUE i < 100 [L22] x2 = 111. - (1130. - 3000. / x0) / x1 [L23] x0 = x1 [L24] x1 = x2 VAL [i=15, x0=173, x1=121, x2=121] [L21] i++ VAL [i=16, x0=173, x1=121, x2=121] [L21] COND TRUE i < 100 [L22] x2 = 111. - (1130. - 3000. / x0) / x1 [L23] x0 = x1 [L24] x1 = x2 VAL [i=16, x0=121, x1=143, x2=143] [L21] i++ VAL [i=17, x0=121, x1=143, x2=143] [L21] COND TRUE i < 100 [L22] x2 = 111. - (1130. - 3000. / x0) / x1 [L23] x0 = x1 [L24] x1 = x2 VAL [i=17, x0=143, x1=165, x2=165] [L21] i++ VAL [i=18, x0=143, x1=165, x2=165] [L21] COND TRUE i < 100 [L22] x2 = 111. - (1130. - 3000. / x0) / x1 [L23] x0 = x1 [L24] x1 = x2 VAL [i=18, x0=165, x1=193, x2=193] [L21] i++ VAL [i=19, x0=165, x1=193, x2=193] [L21] COND TRUE i < 100 [L22] x2 = 111. - (1130. - 3000. / x0) / x1 [L23] x0 = x1 [L24] x1 = x2 VAL [i=19, x0=193, x1=156, x2=156] [L21] i++ VAL [i=20, x0=193, x1=156, x2=156] [L21] COND TRUE i < 100 [L22] x2 = 111. - (1130. - 3000. / x0) / x1 [L23] x0 = x1 [L24] x1 = x2 VAL [i=20, x0=156, x1=168, x2=168] [L21] i++ VAL [i=21, x0=156, x1=168, x2=168] [L21] COND TRUE i < 100 [L22] x2 = 111. - (1130. - 3000. / x0) / x1 [L23] x0 = x1 [L24] x1 = x2 VAL [i=21, x0=168, x1=151, x2=151] [L21] i++ VAL [i=22, x0=168, x1=151, x2=151] [L21] COND TRUE i < 100 [L22] x2 = 111. - (1130. - 3000. / x0) / x1 [L23] x0 = x1 [L24] x1 = x2 VAL [i=22, x0=151, x1=134, x2=134] [L21] i++ VAL [i=23, x0=151, x1=134, x2=134] [L21] COND TRUE i < 100 [L22] x2 = 111. - (1130. - 3000. / x0) / x1 [L23] x0 = x1 [L24] x1 = x2 VAL [i=23, x0=134, x1=147, x2=147] [L21] i++ VAL [i=24, x0=134, x1=147, x2=147] [L21] COND TRUE i < 100 [L22] x2 = 111. - (1130. - 3000. / x0) / x1 [L23] x0 = x1 [L24] x1 = x2 VAL [i=24, x0=147, x1=190, x2=190] [L21] i++ VAL [i=25, x0=147, x1=190, x2=190] [L21] COND TRUE i < 100 [L22] x2 = 111. - (1130. - 3000. / x0) / x1 [L23] x0 = x1 [L24] x1 = x2 VAL [i=25, x0=190, x1=164, x2=164] [L21] i++ VAL [i=26, x0=190, x1=164, x2=164] [L21] COND TRUE i < 100 [L22] x2 = 111. - (1130. - 3000. / x0) / x1 [L23] x0 = x1 [L24] x1 = x2 VAL [i=26, x0=164, x1=138, x2=138] [L21] i++ VAL [i=27, x0=164, x1=138, x2=138] [L21] COND TRUE i < 100 [L22] x2 = 111. - (1130. - 3000. / x0) / x1 [L23] x0 = x1 [L24] x1 = x2 VAL [i=27, x0=138, x1=179, x2=179] [L21] i++ VAL [i=28, x0=138, x1=179, x2=179] [L21] COND TRUE i < 100 [L22] x2 = 111. - (1130. - 3000. / x0) / x1 [L23] x0 = x1 [L24] x1 = x2 VAL [i=28, x0=179, x1=144, x2=144] [L21] i++ VAL [i=29, x0=179, x1=144, x2=144] [L21] COND TRUE i < 100 [L22] x2 = 111. - (1130. - 3000. / x0) / x1 [L23] x0 = x1 [L24] x1 = x2 VAL [i=29, x0=144, x1=115, x2=115] [L21] i++ VAL [i=30, x0=144, x1=115, x2=115] [L21] COND TRUE i < 100 [L22] x2 = 111. - (1130. - 3000. / x0) / x1 [L23] x0 = x1 [L24] x1 = x2 VAL [i=30, x0=115, x1=119, x2=119] [L21] i++ VAL [i=31, x0=115, x1=119, x2=119] [L21] COND TRUE i < 100 [L22] x2 = 111. - (1130. - 3000. / x0) / x1 [L23] x0 = x1 [L24] x1 = x2 VAL [i=31, x0=119, x1=150, x2=150] [L21] i++ VAL [i=32, x0=119, x1=150, x2=150] [L21] COND TRUE i < 100 [L22] x2 = 111. - (1130. - 3000. / x0) / x1 [L23] x0 = x1 [L24] x1 = x2 VAL [i=32, x0=150, x1=196, x2=196] [L21] i++ VAL [i=33, x0=150, x1=196, x2=196] [L21] COND TRUE i < 100 [L22] x2 = 111. - (1130. - 3000. / x0) / x1 [L23] x0 = x1 [L24] x1 = x2 VAL [i=33, x0=196, x1=136, x2=136] [L21] i++ VAL [i=34, x0=196, x1=136, x2=136] [L21] COND TRUE i < 100 [L22] x2 = 111. - (1130. - 3000. / x0) / x1 [L23] x0 = x1 [L24] x1 = x2 VAL [i=34, x0=136, x1=105, x2=105] [L21] i++ VAL [i=35, x0=136, x1=105, x2=105] [L21] COND TRUE i < 100 [L22] x2 = 111. - (1130. - 3000. / x0) / x1 [L23] x0 = x1 [L24] x1 = x2 VAL [i=35, x0=105, x1=185, x2=185] [L21] i++ VAL [i=36, x0=105, x1=185, x2=185] [L21] COND TRUE i < 100 [L22] x2 = 111. - (1130. - 3000. / x0) / x1 [L23] x0 = x1 [L24] x1 = x2 VAL [i=36, x0=185, x1=102, x2=102] [L21] i++ VAL [i=37, x0=185, x1=102, x2=102] [L21] COND TRUE i < 100 [L22] x2 = 111. - (1130. - 3000. / x0) / x1 [L23] x0 = x1 [L24] x1 = x2 VAL [i=37, x0=102, x1=174, x2=174] [L21] i++ VAL [i=38, x0=102, x1=174, x2=174] [L21] COND TRUE i < 100 [L22] x2 = 111. - (1130. - 3000. / x0) / x1 [L23] x0 = x1 [L24] x1 = x2 VAL [i=38, x0=174, x1=120, x2=120] [L21] i++ VAL [i=39, x0=174, x1=120, x2=120] [L21] COND TRUE i < 100 [L22] x2 = 111. - (1130. - 3000. / x0) / x1 [L23] x0 = x1 [L24] x1 = x2 VAL [i=39, x0=120, x1=152, x2=152] [L21] i++ VAL [i=40, x0=120, x1=152, x2=152] [L21] COND TRUE i < 100 [L22] x2 = 111. - (1130. - 3000. / x0) / x1 [L23] x0 = x1 [L24] x1 = x2 VAL [i=40, x0=152, x1=176, x2=176] [L21] i++ VAL [i=41, x0=152, x1=176, x2=176] [L21] COND TRUE i < 100 [L22] x2 = 111. - (1130. - 3000. / x0) / x1 [L23] x0 = x1 [L24] x1 = x2 VAL [i=41, x0=176, x1=111, x2=111] [L21] i++ VAL [i=42, x0=176, x1=111, x2=111] [L21] COND TRUE i < 100 [L22] x2 = 111. - (1130. - 3000. / x0) / x1 [L23] x0 = x1 [L24] x1 = x2 VAL [i=42, x0=111, x1=127, x2=127] [L21] i++ VAL [i=43, x0=111, x1=127, x2=127] [L21] COND TRUE i < 100 [L22] x2 = 111. - (1130. - 3000. / x0) / x1 [L23] x0 = x1 [L24] x1 = x2 VAL [i=43, x0=127, x1=184, x2=184] [L21] i++ VAL [i=44, x0=127, x1=184, x2=184] [L21] COND TRUE i < 100 [L22] x2 = 111. - (1130. - 3000. / x0) / x1 [L23] x0 = x1 [L24] x1 = x2 VAL [i=44, x0=184, x1=124, x2=124] [L21] i++ VAL [i=45, x0=184, x1=124, x2=124] [L21] COND TRUE i < 100 [L22] x2 = 111. - (1130. - 3000. / x0) / x1 [L23] x0 = x1 [L24] x1 = x2 VAL [i=45, x0=124, x1=117, x2=117] [L21] i++ VAL [i=46, x0=124, x1=117, x2=117] [L21] COND TRUE i < 100 [L22] x2 = 111. - (1130. - 3000. / x0) / x1 [L23] x0 = x1 [L24] x1 = x2 VAL [i=46, x0=117, x1=201, x2=201] [L21] i++ VAL [i=47, x0=117, x1=201, x2=201] [L21] COND TRUE i < 100 [L22] x2 = 111. - (1130. - 3000. / x0) / x1 [L23] x0 = x1 [L24] x1 = x2 VAL [i=47, x0=201, x1=142, x2=142] [L21] i++ VAL [i=48, x0=201, x1=142, x2=142] [L21] COND TRUE i < 100 [L22] x2 = 111. - (1130. - 3000. / x0) / x1 [L23] x0 = x1 [L24] x1 = x2 VAL [i=48, x0=142, x1=180, x2=180] [L21] i++ VAL [i=49, x0=142, x1=180, x2=180] [L21] COND TRUE i < 100 [L22] x2 = 111. - (1130. - 3000. / x0) / x1 [L23] x0 = x1 [L24] x1 = x2 VAL [i=49, x0=180, x1=146, x2=146] [L21] i++ VAL [i=50, x0=180, x1=146, x2=146] [L21] COND TRUE i < 100 [L22] x2 = 111. - (1130. - 3000. / x0) / x1 [L23] x0 = x1 [L24] x1 = x2 VAL [i=50, x0=146, x1=103, x2=103] [L21] i++ VAL [i=51, x0=146, x1=103, x2=103] [L21] COND TRUE i < 100 [L22] x2 = 111. - (1130. - 3000. / x0) / x1 [L23] x0 = x1 [L24] x1 = x2 VAL [i=51, x0=103, x1=170, x2=170] [L21] i++ VAL [i=52, x0=103, x1=170, x2=170] [L21] COND TRUE i < 100 [L22] x2 = 111. - (1130. - 3000. / x0) / x1 [L23] x0 = x1 [L24] x1 = x2 VAL [i=52, x0=170, x1=118, x2=118] [L21] i++ VAL [i=53, x0=170, x1=118, x2=118] [L21] COND TRUE i < 100 [L22] x2 = 111. - (1130. - 3000. / x0) / x1 [L23] x0 = x1 [L24] x1 = x2 VAL [i=53, x0=118, x1=189, x2=189] [L21] i++ VAL [i=54, x0=118, x1=189, x2=189] [L21] COND TRUE i < 100 [L22] x2 = 111. - (1130. - 3000. / x0) / x1 [L23] x0 = x1 [L24] x1 = x2 VAL [i=54, x0=189, x1=125, x2=125] [L21] i++ VAL [i=55, x0=189, x1=125, x2=125] [L21] COND TRUE i < 100 [L22] x2 = 111. - (1130. - 3000. / x0) / x1 [L23] x0 = x1 [L24] x1 = x2 VAL [i=55, x0=125, x1=187, x2=187] [L21] i++ VAL [i=56, x0=125, x1=187, x2=187] [L21] COND TRUE i < 100 [L22] x2 = 111. - (1130. - 3000. / x0) / x1 [L23] x0 = x1 [L24] x1 = x2 VAL [i=56, x0=187, x1=123, x2=123] [L21] i++ VAL [i=57, x0=187, x1=123, x2=123] [L21] COND TRUE i < 100 [L22] x2 = 111. - (1130. - 3000. / x0) / x1 [L23] x0 = x1 [L24] x1 = x2 VAL [i=57, x0=123, x1=135, x2=135] [L21] i++ VAL [i=58, x0=123, x1=135, x2=135] [L21] COND TRUE i < 100 [L22] x2 = 111. - (1130. - 3000. / x0) / x1 [L23] x0 = x1 [L24] x1 = x2 VAL [i=58, x0=135, x1=114, x2=114] [L21] i++ VAL [i=59, x0=135, x1=114, x2=114] [L21] COND TRUE i < 100 [L22] x2 = 111. - (1130. - 3000. / x0) / x1 [L23] x0 = x1 [L24] x1 = x2 VAL [i=59, x0=114, x1=162, x2=162] [L21] i++ VAL [i=60, x0=114, x1=162, x2=162] [L21] COND TRUE i < 100 [L22] x2 = 111. - (1130. - 3000. / x0) / x1 [L23] x0 = x1 [L24] x1 = x2 VAL [i=60, x0=162, x1=195, x2=195] [L21] i++ VAL [i=61, x0=162, x1=195, x2=195] [L21] COND TRUE i < 100 [L22] x2 = 111. - (1130. - 3000. / x0) / x1 [L23] x0 = x1 [L24] x1 = x2 VAL [i=61, x0=195, x1=154, x2=154] [L21] i++ VAL [i=62, x0=195, x1=154, x2=154] [L21] COND TRUE i < 100 [L22] x2 = 111. - (1130. - 3000. / x0) / x1 [L23] x0 = x1 [L24] x1 = x2 VAL [i=62, x0=154, x1=139, x2=139] [L21] i++ VAL [i=63, x0=154, x1=139, x2=139] [L21] COND TRUE i < 100 [L22] x2 = 111. - (1130. - 3000. / x0) / x1 [L23] x0 = x1 [L24] x1 = x2 VAL [i=63, x0=139, x1=169, x2=169] [L21] i++ VAL [i=64, x0=139, x1=169, x2=169] [L21] COND TRUE i < 100 [L22] x2 = 111. - (1130. - 3000. / x0) / x1 [L23] x0 = x1 [L24] x1 = x2 VAL [i=64, x0=169, x1=181, x2=181] [L21] i++ VAL [i=65, x0=169, x1=181, x2=181] [L21] COND TRUE i < 100 [L22] x2 = 111. - (1130. - 3000. / x0) / x1 [L23] x0 = x1 [L24] x1 = x2 VAL [i=65, x0=181, x1=186, x2=186] [L21] i++ VAL [i=66, x0=181, x1=186, x2=186] [L21] COND TRUE i < 100 [L22] x2 = 111. - (1130. - 3000. / x0) / x1 [L23] x0 = x1 [L24] x1 = x2 VAL [i=66, x0=186, x1=166, x2=166] [L21] i++ VAL [i=67, x0=186, x1=166, x2=166] [L21] COND TRUE i < 100 [L22] x2 = 111. - (1130. - 3000. / x0) / x1 [L23] x0 = x1 [L24] x1 = x2 VAL [i=67, x0=166, x1=157, x2=157] [L21] i++ VAL [i=68, x0=166, x1=157, x2=157] [L21] COND TRUE i < 100 [L22] x2 = 111. - (1130. - 3000. / x0) / x1 [L23] x0 = x1 [L24] x1 = x2 VAL [i=68, x0=157, x1=137, x2=137] [L21] i++ VAL [i=69, x0=157, x1=137, x2=137] [L21] COND TRUE i < 100 [L22] x2 = 111. - (1130. - 3000. / x0) / x1 [L23] x0 = x1 [L24] x1 = x2 VAL [i=69, x0=137, x1=129, x2=129] [L21] i++ VAL [i=70, x0=137, x1=129, x2=129] [L21] COND TRUE i < 100 [L22] x2 = 111. - (1130. - 3000. / x0) / x1 [L23] x0 = x1 [L24] x1 = x2 VAL [i=70, x0=129, x1=175, x2=175] [L21] i++ VAL [i=71, x0=129, x1=175, x2=175] [L21] COND TRUE i < 100 [L22] x2 = 111. - (1130. - 3000. / x0) / x1 [L23] x0 = x1 [L24] x1 = x2 VAL [i=71, x0=175, x1=197, x2=197] [L21] i++ VAL [i=72, x0=175, x1=197, x2=197] [L21] COND TRUE i < 100 [L22] x2 = 111. - (1130. - 3000. / x0) / x1 [L23] x0 = x1 [L24] x1 = x2 VAL [i=72, x0=197, x1=101, x2=101] [L21] i++ VAL [i=73, x0=197, x1=101, x2=101] [L21] COND TRUE i < 100 [L22] x2 = 111. - (1130. - 3000. / x0) / x1 [L23] x0 = x1 [L24] x1 = x2 VAL [i=73, x0=101, x1=148, x2=148] [L21] i++ VAL [i=74, x0=101, x1=148, x2=148] [L21] COND TRUE i < 100 [L22] x2 = 111. - (1130. - 3000. / x0) / x1 [L23] x0 = x1 [L24] x1 = x2 VAL [i=74, x0=148, x1=106, x2=106] [L21] i++ VAL [i=75, x0=148, x1=106, x2=106] [L21] COND TRUE i < 100 [L22] x2 = 111. - (1130. - 3000. / x0) / x1 [L23] x0 = x1 [L24] x1 = x2 VAL [i=75, x0=106, x1=161, x2=161] [L21] i++ VAL [i=76, x0=106, x1=161, x2=161] [L21] COND TRUE i < 100 [L22] x2 = 111. - (1130. - 3000. / x0) / x1 [L23] x0 = x1 [L24] x1 = x2 VAL [i=76, x0=161, x1=167, x2=167] [L21] i++ VAL [i=77, x0=161, x1=167, x2=167] [L21] COND TRUE i < 100 [L22] x2 = 111. - (1130. - 3000. / x0) / x1 [L23] x0 = x1 [L24] x1 = x2 VAL [i=77, x0=167, x1=171, x2=171] [L21] i++ VAL [i=78, x0=167, x1=171, x2=171] [L21] COND TRUE i < 100 [L22] x2 = 111. - (1130. - 3000. / x0) / x1 [L23] x0 = x1 [L24] x1 = x2 VAL [i=78, x0=171, x1=113, x2=113] [L21] i++ VAL [i=79, x0=171, x1=113, x2=113] [L21] COND TRUE i < 100 [L22] x2 = 111. - (1130. - 3000. / x0) / x1 [L23] x0 = x1 [L24] x1 = x2 VAL [i=79, x0=113, x1=109, x2=109] [L21] i++ VAL [i=80, x0=113, x1=109, x2=109] [L21] COND TRUE i < 100 [L22] x2 = 111. - (1130. - 3000. / x0) / x1 [L23] x0 = x1 [L24] x1 = x2 VAL [i=80, x0=109, x1=140, x2=140] [L21] i++ VAL [i=81, x0=109, x1=140, x2=140] [L21] COND TRUE i < 100 [L22] x2 = 111. - (1130. - 3000. / x0) / x1 [L23] x0 = x1 [L24] x1 = x2 VAL [i=81, x0=140, x1=199, x2=199] [L21] i++ VAL [i=82, x0=140, x1=199, x2=199] [L21] COND TRUE i < 100 [L22] x2 = 111. - (1130. - 3000. / x0) / x1 [L23] x0 = x1 [L24] x1 = x2 VAL [i=82, x0=199, x1=182, x2=182] [L21] i++ VAL [i=83, x0=199, x1=182, x2=182] [L21] COND TRUE i < 100 [L22] x2 = 111. - (1130. - 3000. / x0) / x1 [L23] x0 = x1 [L24] x1 = x2 VAL [i=83, x0=182, x1=131, x2=131] [L21] i++ VAL [i=84, x0=182, x1=131, x2=131] [L21] COND TRUE i < 100 [L22] x2 = 111. - (1130. - 3000. / x0) / x1 [L23] x0 = x1 [L24] x1 = x2 VAL [i=84, x0=131, x1=177, x2=177] [L21] i++ VAL [i=85, x0=131, x1=177, x2=177] [L21] COND TRUE i < 100 [L22] x2 = 111. - (1130. - 3000. / x0) / x1 [L23] x0 = x1 [L24] x1 = x2 VAL [i=85, x0=177, x1=110, x2=110] [L21] i++ VAL [i=86, x0=177, x1=110, x2=110] [L21] COND TRUE i < 100 [L22] x2 = 111. - (1130. - 3000. / x0) / x1 [L23] x0 = x1 [L24] x1 = x2 VAL [i=86, x0=110, x1=159, x2=159] [L21] i++ VAL [i=87, x0=110, x1=159, x2=159] [L21] COND TRUE i < 100 [L22] x2 = 111. - (1130. - 3000. / x0) / x1 [L23] x0 = x1 [L24] x1 = x2 VAL [i=87, x0=159, x1=160, x2=160] [L21] i++ VAL [i=88, x0=159, x1=160, x2=160] [L21] COND TRUE i < 100 [L22] x2 = 111. - (1130. - 3000. / x0) / x1 [L23] x0 = x1 [L24] x1 = x2 VAL [i=88, x0=160, x1=116, x2=116] [L21] i++ VAL [i=89, x0=160, x1=116, x2=116] [L21] COND TRUE i < 100 [L22] x2 = 111. - (1130. - 3000. / x0) / x1 [L23] x0 = x1 [L24] x1 = x2 VAL [i=89, x0=116, x1=128, x2=128] [L21] i++ VAL [i=90, x0=116, x1=128, x2=128] [L21] COND TRUE i < 100 [L22] x2 = 111. - (1130. - 3000. / x0) / x1 [L23] x0 = x1 [L24] x1 = x2 VAL [i=90, x0=128, x1=132, x2=132] [L21] i++ VAL [i=91, x0=128, x1=132, x2=132] [L21] COND TRUE i < 100 [L22] x2 = 111. - (1130. - 3000. / x0) / x1 [L23] x0 = x1 [L24] x1 = x2 VAL [i=91, x0=132, x1=183, x2=183] [L21] i++ VAL [i=92, x0=132, x1=183, x2=183] [L21] COND TRUE i < 100 [L22] x2 = 111. - (1130. - 3000. / x0) / x1 [L23] x0 = x1 [L24] x1 = x2 VAL [i=92, x0=183, x1=126, x2=126] [L21] i++ VAL [i=93, x0=183, x1=126, x2=126] [L21] COND TRUE i < 100 [L22] x2 = 111. - (1130. - 3000. / x0) / x1 [L23] x0 = x1 [L24] x1 = x2 VAL [i=93, x0=126, x1=107, x2=107] [L21] i++ VAL [i=94, x0=126, x1=107, x2=107] [L21] COND TRUE i < 100 [L22] x2 = 111. - (1130. - 3000. / x0) / x1 [L23] x0 = x1 [L24] x1 = x2 VAL [i=94, x0=107, x1=104, x2=104] [L21] i++ VAL [i=95, x0=107, x1=104, x2=104] [L21] COND TRUE i < 100 [L22] x2 = 111. - (1130. - 3000. / x0) / x1 [L23] x0 = x1 [L24] x1 = x2 VAL [i=95, x0=104, x1=108, x2=108] [L21] i++ VAL [i=96, x0=104, x1=108, x2=108] [L21] COND TRUE i < 100 [L22] x2 = 111. - (1130. - 3000. / x0) / x1 [L23] x0 = x1 [L24] x1 = x2 VAL [i=96, x0=108, x1=158, x2=158] [L21] i++ VAL [i=97, x0=108, x1=158, x2=158] [L21] COND TRUE i < 100 [L22] x2 = 111. - (1130. - 3000. / x0) / x1 [L23] x0 = x1 [L24] x1 = x2 VAL [i=97, x0=158, x1=191, x2=191] [L21] i++ VAL [i=98, x0=158, x1=191, x2=191] [L21] COND TRUE i < 100 [L22] x2 = 111. - (1130. - 3000. / x0) / x1 [L23] x0 = x1 [L24] x1 = x2 VAL [i=98, x0=191, x1=153, x2=153] [L21] i++ VAL [i=99, x0=191, x1=153, x2=153] [L21] COND TRUE i < 100 [L22] x2 = 111. - (1130. - 3000. / x0) / x1 [L23] x0 = x1 [L24] x1 = x2 VAL [i=99, x0=153, x1=163, x2=163] [L21] i++ VAL [i=100, x0=153, x1=163, x2=163] [L21] COND FALSE !(i < 100) VAL [i=100, x0=153, x1=163, x2=163] [L27] CALL __VERIFIER_assert(x0 >= 99. && x0 <= 101.) [L12] COND TRUE !(cond) VAL [\old(cond)=0, cond=0] [L12] reach_error() VAL [\old(cond)=0, cond=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 12 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 10.7s, OverallIterations: 8, TraceHistogramMax: 100, PathProgramHistogramMax: 7, EmptinessCheckTime: 0.0s, AutomataDifference: 0.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 335 SdHoareTripleChecker+Valid, 0.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 335 mSDsluCounter, 142 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 96 mSDsCounter, 117 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 591 IncrementalHoareTripleChecker+Invalid, 708 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 117 mSolverCounterUnsat, 46 mSDtfsCounter, 591 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 966 GetRequests, 682 SyntacticMatches, 1 SemanticMatches, 283 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 535 ImplicationChecksByTransitivity, 6.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=207occurred in iteration=7, InterpolantAutomatonStates: 291, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 7 MinimizatonAttempts, 1 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 7.7s InterpolantComputationTime, 992 NumberOfCodeBlocks, 992 NumberOfCodeBlocksAsserted, 166 NumberOfCheckSat, 1157 ConstructedInterpolants, 0 QuantifiedInterpolants, 3319 SizeOfPredicates, 0 NumberOfNonLiveVariables, 1449 ConjunctsInSsa, 189 ConjunctsInUnsatCore, 19 InterpolantComputations, 1 PerfectInterpolantSequences, 0/34659 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 [2022-07-19 13:32:09,467 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/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/float-benchs/Muller_Kahan.c -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.graphml --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 61ce2c272542663cace3442e405f7ab093d2a72e636da199b8b44596c79af6c9 --- Real Ultimate output --- This is Ultimate 0.2.2-?-eb692b5 [2022-07-19 13:32:11,048 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-19 13:32:11,050 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-19 13:32:11,080 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-19 13:32:11,080 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-19 13:32:11,081 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-19 13:32:11,084 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-19 13:32:11,087 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-19 13:32:11,088 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-19 13:32:11,091 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-19 13:32:11,092 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-19 13:32:11,095 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-19 13:32:11,096 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-19 13:32:11,097 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-19 13:32:11,098 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-19 13:32:11,100 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-19 13:32:11,100 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-19 13:32:11,101 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-19 13:32:11,102 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-19 13:32:11,107 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-19 13:32:11,108 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-19 13:32:11,108 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-19 13:32:11,110 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-19 13:32:11,110 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-19 13:32:11,111 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-19 13:32:11,116 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-19 13:32:11,116 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-19 13:32:11,117 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-19 13:32:11,117 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-19 13:32:11,117 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-19 13:32:11,118 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-19 13:32:11,118 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-19 13:32:11,119 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-19 13:32:11,120 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-19 13:32:11,121 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-19 13:32:11,122 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-19 13:32:11,122 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-19 13:32:11,122 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-19 13:32:11,122 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-19 13:32:11,123 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-19 13:32:11,123 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-19 13:32:11,124 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-19 13:32:11,130 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2022-07-19 13:32:11,155 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-19 13:32:11,156 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-19 13:32:11,156 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-19 13:32:11,156 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-19 13:32:11,157 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-19 13:32:11,157 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-19 13:32:11,157 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-19 13:32:11,158 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-19 13:32:11,158 INFO L138 SettingsManager]: * Use SBE=true [2022-07-19 13:32:11,158 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-19 13:32:11,159 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-19 13:32:11,159 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-19 13:32:11,159 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-19 13:32:11,159 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-19 13:32:11,163 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-19 13:32:11,163 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-19 13:32:11,163 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-07-19 13:32:11,164 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-07-19 13:32:11,164 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-07-19 13:32:11,164 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-19 13:32:11,164 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-19 13:32:11,164 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-19 13:32:11,164 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-19 13:32:11,165 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-19 13:32:11,165 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-19 13:32:11,165 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-19 13:32:11,165 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-19 13:32:11,165 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-19 13:32:11,166 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-19 13:32:11,166 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-19 13:32:11,166 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2022-07-19 13:32:11,166 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-07-19 13:32:11,166 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-19 13:32:11,167 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-19 13:32:11,167 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-19 13:32:11,167 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-07-19 13:32:11,167 INFO L138 SettingsManager]: * Logic for external solver=AUFBV 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.graphml 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 -> 61ce2c272542663cace3442e405f7ab093d2a72e636da199b8b44596c79af6c9 [2022-07-19 13:32:11,413 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-19 13:32:11,431 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-19 13:32:11,432 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-19 13:32:11,433 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-19 13:32:11,434 INFO L275 PluginConnector]: CDTParser initialized [2022-07-19 13:32:11,434 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/float-benchs/Muller_Kahan.c [2022-07-19 13:32:11,487 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4d90adcaa/45f465f3a6c24c809fb755eb6d4ee392/FLAGd7a6fdebc [2022-07-19 13:32:11,846 INFO L306 CDTParser]: Found 1 translation units. [2022-07-19 13:32:11,847 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-benchs/Muller_Kahan.c [2022-07-19 13:32:11,851 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4d90adcaa/45f465f3a6c24c809fb755eb6d4ee392/FLAGd7a6fdebc [2022-07-19 13:32:11,863 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4d90adcaa/45f465f3a6c24c809fb755eb6d4ee392 [2022-07-19 13:32:11,865 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-19 13:32:11,866 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-19 13:32:11,868 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-19 13:32:11,869 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-19 13:32:11,871 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-19 13:32:11,872 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.07 01:32:11" (1/1) ... [2022-07-19 13:32:11,873 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@67b7e49a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 01:32:11, skipping insertion in model container [2022-07-19 13:32:11,873 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.07 01:32:11" (1/1) ... [2022-07-19 13:32:11,877 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-19 13:32:11,885 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-19 13:32:11,986 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-benchs/Muller_Kahan.c[631,644] [2022-07-19 13:32:11,994 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-19 13:32:12,000 INFO L203 MainTranslator]: Completed pre-run [2022-07-19 13:32:12,042 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-benchs/Muller_Kahan.c[631,644] [2022-07-19 13:32:12,044 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-19 13:32:12,052 INFO L208 MainTranslator]: Completed translation [2022-07-19 13:32:12,053 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 01:32:12 WrapperNode [2022-07-19 13:32:12,053 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-19 13:32:12,054 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-19 13:32:12,054 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-19 13:32:12,054 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-19 13:32:12,058 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 01:32:12" (1/1) ... [2022-07-19 13:32:12,063 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 01:32:12" (1/1) ... [2022-07-19 13:32:12,073 INFO L137 Inliner]: procedures = 13, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 37 [2022-07-19 13:32:12,073 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-19 13:32:12,074 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-19 13:32:12,074 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-19 13:32:12,074 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-19 13:32:12,078 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 01:32:12" (1/1) ... [2022-07-19 13:32:12,079 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 01:32:12" (1/1) ... [2022-07-19 13:32:12,080 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 01:32:12" (1/1) ... [2022-07-19 13:32:12,080 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 01:32:12" (1/1) ... [2022-07-19 13:32:12,084 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 01:32:12" (1/1) ... [2022-07-19 13:32:12,086 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 01:32:12" (1/1) ... [2022-07-19 13:32:12,086 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 01:32:12" (1/1) ... [2022-07-19 13:32:12,088 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-19 13:32:12,088 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-19 13:32:12,089 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-19 13:32:12,089 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-19 13:32:12,089 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 01:32:12" (1/1) ... [2022-07-19 13:32:12,093 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-19 13:32:12,102 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 13:32:12,111 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-07-19 13:32:12,147 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-19 13:32:12,123 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-07-19 13:32:12,147 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-19 13:32:12,151 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-19 13:32:12,151 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-07-19 13:32:12,200 INFO L234 CfgBuilder]: Building ICFG [2022-07-19 13:32:12,201 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-19 13:32:14,747 INFO L275 CfgBuilder]: Performing block encoding [2022-07-19 13:32:14,751 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-19 13:32:14,752 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-07-19 13:32:14,766 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.07 01:32:14 BoogieIcfgContainer [2022-07-19 13:32:14,766 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-19 13:32:14,767 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-19 13:32:14,767 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-19 13:32:14,769 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-19 13:32:14,769 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.07 01:32:11" (1/3) ... [2022-07-19 13:32:14,770 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2ce21d5d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.07 01:32:14, skipping insertion in model container [2022-07-19 13:32:14,770 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 01:32:12" (2/3) ... [2022-07-19 13:32:14,770 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2ce21d5d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.07 01:32:14, skipping insertion in model container [2022-07-19 13:32:14,770 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.07 01:32:14" (3/3) ... [2022-07-19 13:32:14,771 INFO L111 eAbstractionObserver]: Analyzing ICFG Muller_Kahan.c [2022-07-19 13:32:14,795 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-19 13:32:14,796 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-19 13:32:14,835 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-19 13:32:14,843 INFO L357 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, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, 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=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@7a124b4e, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@7f0e7cfd [2022-07-19 13:32:14,843 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-07-19 13:32:14,845 INFO L276 IsEmpty]: Start isEmpty. Operand has 12 states, 10 states have (on average 1.4) internal successors, (14), 11 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 13:32:14,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-07-19 13:32:14,849 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 13:32:14,849 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-07-19 13:32:14,850 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 13:32:14,854 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 13:32:14,855 INFO L85 PathProgramCache]: Analyzing trace with hash 889605037, now seen corresponding path program 1 times [2022-07-19 13:32:14,863 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-19 13:32:14,863 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1108050652] [2022-07-19 13:32:14,863 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 13:32:14,864 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-19 13:32:14,864 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-19 13:32:14,870 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-19 13:32:14,870 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2022-07-19 13:32:14,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 13:32:14,926 INFO L263 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-19 13:32:14,928 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 13:32:15,018 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 13:32:15,018 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-19 13:32:15,019 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-19 13:32:15,019 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1108050652] [2022-07-19 13:32:15,019 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1108050652] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 13:32:15,019 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 13:32:15,020 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-19 13:32:15,021 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1080228502] [2022-07-19 13:32:15,021 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 13:32:15,023 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-19 13:32:15,024 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-19 13:32:15,038 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-19 13:32:15,039 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-19 13:32:15,040 INFO L87 Difference]: Start difference. First operand has 12 states, 10 states have (on average 1.4) internal successors, (14), 11 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 13:32:18,050 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-07-19 13:32:18,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 13:32:18,434 INFO L93 Difference]: Finished difference Result 21 states and 25 transitions. [2022-07-19 13:32:18,435 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-19 13:32:18,436 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2022-07-19 13:32:18,436 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 13:32:18,440 INFO L225 Difference]: With dead ends: 21 [2022-07-19 13:32:18,441 INFO L226 Difference]: Without dead ends: 9 [2022-07-19 13:32:18,442 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-19 13:32:18,444 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 0 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 19 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.4s IncrementalHoareTripleChecker+Time [2022-07-19 13:32:18,445 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 19 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 1 Unknown, 0 Unchecked, 3.4s Time] [2022-07-19 13:32:18,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2022-07-19 13:32:18,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2022-07-19 13:32:18,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 8 states have (on average 1.125) internal successors, (9), 8 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 13:32:18,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 9 transitions. [2022-07-19 13:32:18,462 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 9 transitions. Word has length 6 [2022-07-19 13:32:18,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 13:32:18,462 INFO L495 AbstractCegarLoop]: Abstraction has 9 states and 9 transitions. [2022-07-19 13:32:18,462 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 13:32:18,462 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 9 transitions. [2022-07-19 13:32:18,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-07-19 13:32:18,463 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 13:32:18,463 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 13:32:18,470 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Ended with exit code 0 [2022-07-19 13:32:18,663 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-19 13:32:18,663 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 13:32:18,664 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 13:32:18,664 INFO L85 PathProgramCache]: Analyzing trace with hash 265180975, now seen corresponding path program 1 times [2022-07-19 13:32:18,664 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-19 13:32:18,664 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [130472149] [2022-07-19 13:32:18,665 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 13:32:18,665 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-19 13:32:18,665 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-19 13:32:18,666 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-19 13:32:18,667 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2022-07-19 13:32:19,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 13:32:19,869 INFO L263 TraceCheckSpWp]: Trace formula consists of 28 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-19 13:32:19,870 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 13:32:20,075 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 13:32:20,075 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-19 13:32:20,319 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 13:32:20,320 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-19 13:32:20,320 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [130472149] [2022-07-19 13:32:20,320 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [130472149] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-19 13:32:20,320 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-19 13:32:20,320 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2022-07-19 13:32:20,320 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [374956707] [2022-07-19 13:32:20,321 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-19 13:32:20,321 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-19 13:32:20,321 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-19 13:32:20,322 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-19 13:32:20,322 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2022-07-19 13:32:20,322 INFO L87 Difference]: Start difference. First operand 9 states and 9 transitions. Second operand has 6 states, 6 states have (on average 2.0) internal successors, (12), 6 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 13:32:23,401 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.06s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-07-19 13:32:26,903 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.07s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-07-19 13:32:27,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 13:32:27,351 INFO L93 Difference]: Finished difference Result 17 states and 18 transitions. [2022-07-19 13:32:27,352 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-19 13:32:27,352 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.0) internal successors, (12), 6 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2022-07-19 13:32:27,352 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 13:32:27,352 INFO L225 Difference]: With dead ends: 17 [2022-07-19 13:32:27,352 INFO L226 Difference]: Without dead ends: 13 [2022-07-19 13:32:27,353 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2022-07-19 13:32:27,354 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 0 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 2 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 14 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.0s IncrementalHoareTripleChecker+Time [2022-07-19 13:32:27,354 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 14 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 7 Invalid, 2 Unknown, 0 Unchecked, 7.0s Time] [2022-07-19 13:32:27,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2022-07-19 13:32:27,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2022-07-19 13:32:27,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 12 states have (on average 1.0833333333333333) internal successors, (13), 12 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 13:32:27,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 13 transitions. [2022-07-19 13:32:27,356 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 13 transitions. Word has length 8 [2022-07-19 13:32:27,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 13:32:27,357 INFO L495 AbstractCegarLoop]: Abstraction has 13 states and 13 transitions. [2022-07-19 13:32:27,357 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.0) internal successors, (12), 6 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 13:32:27,358 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2022-07-19 13:32:27,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-07-19 13:32:27,358 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 13:32:27,358 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1] [2022-07-19 13:32:27,390 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2022-07-19 13:32:27,565 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-19 13:32:27,565 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 13:32:27,565 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 13:32:27,566 INFO L85 PathProgramCache]: Analyzing trace with hash 833881267, now seen corresponding path program 2 times [2022-07-19 13:32:27,566 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-19 13:32:27,566 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1879319989] [2022-07-19 13:32:27,566 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-19 13:32:27,566 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-19 13:32:27,567 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-19 13:32:27,568 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-19 13:32:27,569 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2022-07-19 13:32:31,449 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-19 13:32:31,449 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-19 13:32:31,667 INFO L263 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 5 conjunts are in the unsatisfiable core [2022-07-19 13:32:31,668 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 13:32:32,167 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 13:32:32,167 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-19 13:32:32,886 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 13:32:32,887 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-19 13:32:32,887 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1879319989] [2022-07-19 13:32:32,887 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1879319989] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-19 13:32:32,887 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-19 13:32:32,887 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2022-07-19 13:32:32,887 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [341026246] [2022-07-19 13:32:32,888 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-19 13:32:32,888 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-19 13:32:32,888 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-19 13:32:32,888 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-19 13:32:32,889 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-07-19 13:32:32,889 INFO L87 Difference]: Start difference. First operand 13 states and 13 transitions. Second operand has 10 states, 10 states have (on average 2.0) internal successors, (20), 10 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 13:32:36,042 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.11s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-07-19 13:32:39,606 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.12s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-07-19 13:32:43,155 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.10s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-07-19 13:32:46,711 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.09s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-07-19 13:32:47,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 13:32:47,990 INFO L93 Difference]: Finished difference Result 25 states and 28 transitions. [2022-07-19 13:32:47,990 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-07-19 13:32:47,990 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.0) internal successors, (20), 10 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2022-07-19 13:32:47,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 13:32:47,991 INFO L225 Difference]: With dead ends: 25 [2022-07-19 13:32:47,991 INFO L226 Difference]: Without dead ends: 21 [2022-07-19 13:32:47,991 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=70, Invalid=112, Unknown=0, NotChecked=0, Total=182 [2022-07-19 13:32:47,992 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 0 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 6 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 12.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 22 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 13.9s IncrementalHoareTripleChecker+Time [2022-07-19 13:32:47,992 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 22 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 23 Invalid, 4 Unknown, 0 Unchecked, 13.9s Time] [2022-07-19 13:32:47,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2022-07-19 13:32:48,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2022-07-19 13:32:48,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 20 states have (on average 1.05) internal successors, (21), 20 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 13:32:48,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 21 transitions. [2022-07-19 13:32:48,001 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 21 transitions. Word has length 12 [2022-07-19 13:32:48,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 13:32:48,001 INFO L495 AbstractCegarLoop]: Abstraction has 21 states and 21 transitions. [2022-07-19 13:32:48,001 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.0) internal successors, (20), 10 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 13:32:48,001 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 21 transitions. [2022-07-19 13:32:48,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-07-19 13:32:48,002 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 13:32:48,002 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 1, 1, 1, 1, 1, 1] [2022-07-19 13:32:48,090 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2022-07-19 13:32:48,203 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-19 13:32:48,204 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 13:32:48,204 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 13:32:48,204 INFO L85 PathProgramCache]: Analyzing trace with hash -2056177221, now seen corresponding path program 3 times [2022-07-19 13:32:48,204 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-19 13:32:48,204 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1341665891] [2022-07-19 13:32:48,204 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-07-19 13:32:48,205 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-19 13:32:48,205 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-19 13:32:48,206 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-19 13:32:48,208 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2022-07-19 13:33:17,089 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2022-07-19 13:33:17,089 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-19 13:33:17,613 INFO L263 TraceCheckSpWp]: Trace formula consists of 58 conjuncts, 9 conjunts are in the unsatisfiable core [2022-07-19 13:33:17,614 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 13:33:18,965 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 13:33:18,966 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-19 13:33:21,156 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 13:33:21,157 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-19 13:33:21,158 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1341665891] [2022-07-19 13:33:21,158 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1341665891] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-19 13:33:21,158 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-19 13:33:21,158 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 18 [2022-07-19 13:33:21,159 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [788094402] [2022-07-19 13:33:21,159 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-19 13:33:21,159 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-07-19 13:33:21,159 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-19 13:33:21,160 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-07-19 13:33:21,161 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=209, Unknown=0, NotChecked=0, Total=306 [2022-07-19 13:33:21,162 INFO L87 Difference]: Start difference. First operand 21 states and 21 transitions. Second operand has 18 states, 18 states have (on average 2.0) internal successors, (36), 18 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 13:33:24,337 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.08s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-07-19 13:33:27,955 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.13s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-07-19 13:33:31,529 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.08s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-07-19 13:33:35,107 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.08s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-07-19 13:33:38,703 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.10s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-07-19 13:33:42,292 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.09s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-07-19 13:33:45,895 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.10s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-07-19 13:33:49,502 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.09s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-07-19 13:33:53,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 13:33:53,929 INFO L93 Difference]: Finished difference Result 41 states and 48 transitions. [2022-07-19 13:33:53,929 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-07-19 13:33:53,930 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 2.0) internal successors, (36), 18 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2022-07-19 13:33:53,930 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 13:33:53,930 INFO L225 Difference]: With dead ends: 41 [2022-07-19 13:33:53,930 INFO L226 Difference]: Without dead ends: 37 [2022-07-19 13:33:53,930 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 6.9s TimeCoverageRelationStatistics Valid=316, Invalid=554, Unknown=0, NotChecked=0, Total=870 [2022-07-19 13:33:53,931 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 0 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 79 mSolverCounterSat, 14 mSolverCounterUnsat, 8 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 25.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 38 SdHoareTripleChecker+Invalid, 101 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 79 IncrementalHoareTripleChecker+Invalid, 8 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 28.5s IncrementalHoareTripleChecker+Time [2022-07-19 13:33:53,931 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 38 Invalid, 101 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 79 Invalid, 8 Unknown, 0 Unchecked, 28.5s Time] [2022-07-19 13:33:53,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2022-07-19 13:33:53,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2022-07-19 13:33:53,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 36 states have (on average 1.0277777777777777) internal successors, (37), 36 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 13:33:53,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 37 transitions. [2022-07-19 13:33:53,935 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 37 transitions. Word has length 20 [2022-07-19 13:33:53,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 13:33:53,935 INFO L495 AbstractCegarLoop]: Abstraction has 37 states and 37 transitions. [2022-07-19 13:33:53,935 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 2.0) internal successors, (36), 18 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 13:33:53,935 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 37 transitions. [2022-07-19 13:33:53,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-07-19 13:33:53,936 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 13:33:53,936 INFO L195 NwaCegarLoop]: trace histogram [15, 15, 1, 1, 1, 1, 1, 1] [2022-07-19 13:33:54,137 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2022-07-19 13:33:54,159 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-19 13:33:54,159 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 13:33:54,160 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 13:33:54,160 INFO L85 PathProgramCache]: Analyzing trace with hash -2091971637, now seen corresponding path program 4 times [2022-07-19 13:33:54,160 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-19 13:33:54,160 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1028507479] [2022-07-19 13:33:54,160 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-07-19 13:33:54,160 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-19 13:33:54,160 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-19 13:33:54,161 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-19 13:33:54,162 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2022-07-19 13:34:12,104 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-07-19 13:34:12,104 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-19 13:34:13,098 INFO L263 TraceCheckSpWp]: Trace formula consists of 98 conjuncts, 17 conjunts are in the unsatisfiable core [2022-07-19 13:34:13,100 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 13:34:17,277 INFO L134 CoverageAnalysis]: Checked inductivity of 225 backedges. 0 proven. 225 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 13:34:17,277 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-19 13:34:25,059 INFO L134 CoverageAnalysis]: Checked inductivity of 225 backedges. 0 proven. 225 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 13:34:25,060 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-19 13:34:25,060 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1028507479] [2022-07-19 13:34:25,060 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1028507479] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-19 13:34:25,060 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-19 13:34:25,060 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 34 [2022-07-19 13:34:25,060 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [370200144] [2022-07-19 13:34:25,060 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-19 13:34:25,061 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2022-07-19 13:34:25,061 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-19 13:34:25,061 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2022-07-19 13:34:25,062 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=321, Invalid=801, Unknown=0, NotChecked=0, Total=1122 [2022-07-19 13:34:25,062 INFO L87 Difference]: Start difference. First operand 37 states and 37 transitions. Second operand has 34 states, 34 states have (on average 2.0) internal successors, (68), 34 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 13:34:28,343 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.10s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-07-19 13:34:32,106 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.14s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-07-19 13:34:35,838 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.12s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-07-19 13:34:39,584 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.13s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-07-19 13:34:43,315 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.12s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-07-19 13:34:47,044 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.11s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-07-19 13:34:50,748 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.11s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-07-19 13:34:54,472 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.12s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-07-19 13:34:58,230 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.13s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-07-19 13:35:02,005 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.13s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-07-19 13:35:05,786 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.13s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-07-19 13:35:09,563 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.14s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-07-19 13:35:13,329 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.14s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-07-19 13:35:17,129 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.16s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-07-19 13:35:20,969 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.20s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-07-19 13:35:24,748 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.15s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-07-19 13:35:40,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 13:35:40,839 INFO L93 Difference]: Finished difference Result 73 states and 88 transitions. [2022-07-19 13:35:40,840 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2022-07-19 13:35:40,840 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 34 states have (on average 2.0) internal successors, (68), 34 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2022-07-19 13:35:40,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 13:35:40,841 INFO L225 Difference]: With dead ends: 73 [2022-07-19 13:35:40,841 INFO L226 Difference]: Without dead ends: 69 [2022-07-19 13:35:40,843 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 378 ImplicationChecksByTransitivity, 26.0s TimeCoverageRelationStatistics Valid=1336, Invalid=2446, Unknown=0, NotChecked=0, Total=3782 [2022-07-19 13:35:40,843 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 0 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 287 mSolverCounterSat, 30 mSolverCounterUnsat, 16 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 53.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 70 SdHoareTripleChecker+Invalid, 333 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 287 IncrementalHoareTripleChecker+Invalid, 16 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 60.1s IncrementalHoareTripleChecker+Time [2022-07-19 13:35:40,843 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 70 Invalid, 333 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 287 Invalid, 16 Unknown, 0 Unchecked, 60.1s Time] [2022-07-19 13:35:40,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2022-07-19 13:35:40,851 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2022-07-19 13:35:40,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 68 states have (on average 1.0147058823529411) internal successors, (69), 68 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 13:35:40,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 69 transitions. [2022-07-19 13:35:40,852 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 69 transitions. Word has length 36 [2022-07-19 13:35:40,852 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 13:35:40,852 INFO L495 AbstractCegarLoop]: Abstraction has 69 states and 69 transitions. [2022-07-19 13:35:40,852 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 2.0) internal successors, (68), 34 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 13:35:40,852 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 69 transitions. [2022-07-19 13:35:40,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2022-07-19 13:35:40,853 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 13:35:40,854 INFO L195 NwaCegarLoop]: trace histogram [31, 31, 1, 1, 1, 1, 1, 1] [2022-07-19 13:35:41,067 WARN L435 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Forcibly destroying the process [2022-07-19 13:35:41,184 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 137 [2022-07-19 13:35:41,184 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-19 13:35:41,184 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 13:35:41,184 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 13:35:41,185 INFO L85 PathProgramCache]: Analyzing trace with hash -1451733013, now seen corresponding path program 5 times [2022-07-19 13:35:41,185 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-19 13:35:41,185 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1626847656] [2022-07-19 13:35:41,185 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-07-19 13:35:41,185 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-19 13:35:41,185 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-19 13:35:41,186 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-19 13:35:41,187 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Waiting until timeout for monitored process