./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/nla-digbench-scaling/freire1_unwindbound100.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version f4b24e32 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/nla-digbench-scaling/freire1_unwindbound100.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 f78eb3bd6243e56025d38ea44716c81630a57505e69e1c5e81a8ab68f6ac9a28 --- Real Ultimate output --- This is Ultimate 0.2.2-?-f4b24e3 [2022-07-13 16:29:29,310 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-13 16:29:29,312 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-13 16:29:29,357 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-13 16:29:29,358 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-13 16:29:29,359 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-13 16:29:29,360 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-13 16:29:29,363 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-13 16:29:29,365 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-13 16:29:29,368 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-13 16:29:29,369 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-13 16:29:29,371 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-13 16:29:29,372 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-13 16:29:29,373 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-13 16:29:29,374 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-13 16:29:29,377 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-13 16:29:29,378 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-13 16:29:29,379 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-13 16:29:29,381 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-13 16:29:29,385 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-13 16:29:29,387 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-13 16:29:29,388 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-13 16:29:29,389 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-13 16:29:29,390 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-13 16:29:29,391 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-13 16:29:29,393 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-13 16:29:29,394 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-13 16:29:29,394 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-13 16:29:29,395 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-13 16:29:29,395 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-13 16:29:29,396 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-13 16:29:29,396 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-13 16:29:29,398 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-13 16:29:29,399 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-13 16:29:29,400 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-13 16:29:29,400 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-13 16:29:29,401 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-13 16:29:29,401 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-13 16:29:29,401 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-13 16:29:29,402 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-13 16:29:29,403 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-13 16:29:29,405 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-13 16:29:29,406 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-07-13 16:29:29,433 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-13 16:29:29,434 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-13 16:29:29,434 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-13 16:29:29,434 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-13 16:29:29,435 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-13 16:29:29,435 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-13 16:29:29,435 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-13 16:29:29,436 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-13 16:29:29,436 INFO L138 SettingsManager]: * Use SBE=true [2022-07-13 16:29:29,437 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-13 16:29:29,437 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-13 16:29:29,437 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-13 16:29:29,437 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-13 16:29:29,437 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-13 16:29:29,437 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-13 16:29:29,438 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-13 16:29:29,438 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-13 16:29:29,438 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-13 16:29:29,438 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-13 16:29:29,438 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-13 16:29:29,439 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-13 16:29:29,439 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-13 16:29:29,439 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-13 16:29:29,439 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-13 16:29:29,439 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-13 16:29:29,440 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-13 16:29:29,440 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-13 16:29:29,440 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-13 16:29:29,440 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-13 16:29:29,440 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-13 16:29:29,441 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-13 16:29:29,441 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-13 16:29:29,441 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-13 16:29:29,441 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 -> f78eb3bd6243e56025d38ea44716c81630a57505e69e1c5e81a8ab68f6ac9a28 [2022-07-13 16:29:29,670 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-13 16:29:29,688 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-13 16:29:29,689 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-13 16:29:29,690 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-13 16:29:29,690 INFO L275 PluginConnector]: CDTParser initialized [2022-07-13 16:29:29,691 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/nla-digbench-scaling/freire1_unwindbound100.c [2022-07-13 16:29:29,740 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/939d89cc0/5897f0a144d7408dafbf8a7b00f4fa8e/FLAGc72390b37 [2022-07-13 16:29:30,133 INFO L306 CDTParser]: Found 1 translation units. [2022-07-13 16:29:30,133 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/freire1_unwindbound100.c [2022-07-13 16:29:30,138 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/939d89cc0/5897f0a144d7408dafbf8a7b00f4fa8e/FLAGc72390b37 [2022-07-13 16:29:30,549 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/939d89cc0/5897f0a144d7408dafbf8a7b00f4fa8e [2022-07-13 16:29:30,551 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-13 16:29:30,552 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-13 16:29:30,555 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-13 16:29:30,555 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-13 16:29:30,557 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-13 16:29:30,558 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.07 04:29:30" (1/1) ... [2022-07-13 16:29:30,559 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@722038d6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 04:29:30, skipping insertion in model container [2022-07-13 16:29:30,559 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.07 04:29:30" (1/1) ... [2022-07-13 16:29:30,574 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-13 16:29:30,602 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-13 16:29:30,734 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/nla-digbench-scaling/freire1_unwindbound100.c[712,725] [2022-07-13 16:29:30,750 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-13 16:29:30,757 INFO L203 MainTranslator]: Completed pre-run [2022-07-13 16:29:30,769 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/nla-digbench-scaling/freire1_unwindbound100.c[712,725] [2022-07-13 16:29:30,776 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-13 16:29:30,788 INFO L208 MainTranslator]: Completed translation [2022-07-13 16:29:30,788 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 04:29:30 WrapperNode [2022-07-13 16:29:30,789 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-13 16:29:30,790 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-13 16:29:30,790 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-13 16:29:30,790 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-13 16:29:30,795 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 04:29:30" (1/1) ... [2022-07-13 16:29:30,802 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 04:29:30" (1/1) ... [2022-07-13 16:29:30,816 INFO L137 Inliner]: procedures = 14, calls = 9, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 34 [2022-07-13 16:29:30,816 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-13 16:29:30,818 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-13 16:29:30,818 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-13 16:29:30,818 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-13 16:29:30,824 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 04:29:30" (1/1) ... [2022-07-13 16:29:30,824 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 04:29:30" (1/1) ... [2022-07-13 16:29:30,832 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 04:29:30" (1/1) ... [2022-07-13 16:29:30,833 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 04:29:30" (1/1) ... [2022-07-13 16:29:30,841 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 04:29:30" (1/1) ... [2022-07-13 16:29:30,847 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 04:29:30" (1/1) ... [2022-07-13 16:29:30,848 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 04:29:30" (1/1) ... [2022-07-13 16:29:30,851 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-13 16:29:30,854 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-13 16:29:30,854 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-13 16:29:30,855 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-13 16:29:30,855 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 04:29:30" (1/1) ... [2022-07-13 16:29:30,861 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-13 16:29:30,869 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 16:29:30,884 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-13 16:29:30,908 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-13 16:29:30,928 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-13 16:29:30,928 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-13 16:29:30,928 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-13 16:29:30,929 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-13 16:29:30,929 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-07-13 16:29:30,929 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-07-13 16:29:30,980 INFO L234 CfgBuilder]: Building ICFG [2022-07-13 16:29:30,981 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-13 16:29:31,094 INFO L275 CfgBuilder]: Performing block encoding [2022-07-13 16:29:31,098 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-13 16:29:31,099 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-07-13 16:29:31,101 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.07 04:29:31 BoogieIcfgContainer [2022-07-13 16:29:31,102 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-13 16:29:31,103 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-13 16:29:31,104 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-13 16:29:31,107 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-13 16:29:31,107 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.07 04:29:30" (1/3) ... [2022-07-13 16:29:31,108 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1f6db361 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.07 04:29:31, skipping insertion in model container [2022-07-13 16:29:31,108 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 04:29:30" (2/3) ... [2022-07-13 16:29:31,108 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1f6db361 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.07 04:29:31, skipping insertion in model container [2022-07-13 16:29:31,109 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.07 04:29:31" (3/3) ... [2022-07-13 16:29:31,110 INFO L111 eAbstractionObserver]: Analyzing ICFG freire1_unwindbound100.c [2022-07-13 16:29:31,121 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-13 16:29:31,121 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-13 16:29:31,154 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-13 16:29:31,160 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@1638c591, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@1f8f55ef [2022-07-13 16:29:31,160 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-07-13 16:29:31,163 INFO L276 IsEmpty]: Start isEmpty. Operand has 17 states, 12 states have (on average 1.4166666666666667) internal successors, (17), 13 states have internal predecessors, (17), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-13 16:29:31,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-07-13 16:29:31,169 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 16:29:31,170 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-07-13 16:29:31,170 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 16:29:31,174 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 16:29:31,175 INFO L85 PathProgramCache]: Analyzing trace with hash 1819757606, now seen corresponding path program 1 times [2022-07-13 16:29:31,182 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 16:29:31,183 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1093925259] [2022-07-13 16:29:31,183 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 16:29:31,184 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 16:29:31,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 16:29:31,298 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-13 16:29:31,298 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 16:29:31,299 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1093925259] [2022-07-13 16:29:31,300 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1093925259] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 16:29:31,300 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 16:29:31,300 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-13 16:29:31,301 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1693633690] [2022-07-13 16:29:31,303 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 16:29:31,306 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-07-13 16:29:31,314 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 16:29:31,341 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-07-13 16:29:31,343 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-07-13 16:29:31,346 INFO L87 Difference]: Start difference. First operand has 17 states, 12 states have (on average 1.4166666666666667) internal successors, (17), 13 states have internal predecessors, (17), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 16:29:31,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 16:29:31,367 INFO L93 Difference]: Finished difference Result 32 states and 42 transitions. [2022-07-13 16:29:31,369 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-07-13 16:29:31,370 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2022-07-13 16:29:31,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 16:29:31,376 INFO L225 Difference]: With dead ends: 32 [2022-07-13 16:29:31,376 INFO L226 Difference]: Without dead ends: 13 [2022-07-13 16:29:31,379 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-07-13 16:29:31,383 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 19 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-13 16:29:31,384 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-13 16:29:31,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2022-07-13 16:29:31,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2022-07-13 16:29:31,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 9 states have (on average 1.3333333333333333) internal successors, (12), 10 states have internal predecessors, (12), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-13 16:29:31,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 15 transitions. [2022-07-13 16:29:31,413 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 15 transitions. Word has length 7 [2022-07-13 16:29:31,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 16:29:31,413 INFO L495 AbstractCegarLoop]: Abstraction has 13 states and 15 transitions. [2022-07-13 16:29:31,414 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 16:29:31,414 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 15 transitions. [2022-07-13 16:29:31,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-07-13 16:29:31,415 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 16:29:31,416 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 16:29:31,416 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-13 16:29:31,416 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 16:29:31,418 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 16:29:31,418 INFO L85 PathProgramCache]: Analyzing trace with hash 178410715, now seen corresponding path program 1 times [2022-07-13 16:29:31,418 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 16:29:31,419 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [772888137] [2022-07-13 16:29:31,419 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 16:29:31,419 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 16:29:31,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 16:29:31,529 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-13 16:29:31,529 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 16:29:31,530 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [772888137] [2022-07-13 16:29:31,530 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [772888137] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 16:29:31,530 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 16:29:31,530 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-13 16:29:31,531 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2032322667] [2022-07-13 16:29:31,531 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 16:29:31,532 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-13 16:29:31,532 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 16:29:31,533 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-13 16:29:31,533 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-13 16:29:31,533 INFO L87 Difference]: Start difference. First operand 13 states and 15 transitions. Second operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 16:29:31,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 16:29:31,546 INFO L93 Difference]: Finished difference Result 22 states and 24 transitions. [2022-07-13 16:29:31,546 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-13 16:29:31,547 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2022-07-13 16:29:31,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 16:29:31,547 INFO L225 Difference]: With dead ends: 22 [2022-07-13 16:29:31,547 INFO L226 Difference]: Without dead ends: 15 [2022-07-13 16:29:31,548 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-13 16:29:31,549 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 0 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 35 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-13 16:29:31,550 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 35 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-13 16:29:31,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2022-07-13 16:29:31,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2022-07-13 16:29:31,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 12 states have internal predecessors, (14), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-13 16:29:31,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 17 transitions. [2022-07-13 16:29:31,554 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 17 transitions. Word has length 8 [2022-07-13 16:29:31,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 16:29:31,554 INFO L495 AbstractCegarLoop]: Abstraction has 15 states and 17 transitions. [2022-07-13 16:29:31,554 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 16:29:31,554 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 17 transitions. [2022-07-13 16:29:31,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-07-13 16:29:31,555 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 16:29:31,555 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 16:29:31,555 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-13 16:29:31,556 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 16:29:31,556 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 16:29:31,556 INFO L85 PathProgramCache]: Analyzing trace with hash 180198175, now seen corresponding path program 1 times [2022-07-13 16:29:31,557 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 16:29:31,557 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [820416244] [2022-07-13 16:29:31,557 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 16:29:31,557 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 16:29:31,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 16:29:31,565 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-13 16:29:31,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 16:29:31,584 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-13 16:29:31,584 INFO L271 BasicCegarLoop]: Counterexample is feasible [2022-07-13 16:29:31,585 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-07-13 16:29:31,587 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-07-13 16:29:31,589 INFO L356 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2022-07-13 16:29:31,592 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-07-13 16:29:31,607 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.07 04:29:31 BoogieIcfgContainer [2022-07-13 16:29:31,607 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-07-13 16:29:31,608 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-07-13 16:29:31,608 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-07-13 16:29:31,608 INFO L275 PluginConnector]: Witness Printer initialized [2022-07-13 16:29:31,608 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.07 04:29:31" (3/4) ... [2022-07-13 16:29:31,611 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-07-13 16:29:31,611 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-07-13 16:29:31,612 INFO L158 Benchmark]: Toolchain (without parser) took 1059.24ms. Allocated memory was 90.2MB in the beginning and 111.1MB in the end (delta: 21.0MB). Free memory was 49.6MB in the beginning and 74.8MB in the end (delta: -25.2MB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-13 16:29:31,612 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 90.2MB. Free memory was 66.1MB in the beginning and 66.1MB in the end (delta: 44.6kB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-13 16:29:31,613 INFO L158 Benchmark]: CACSL2BoogieTranslator took 234.37ms. Allocated memory is still 90.2MB. Free memory was 49.4MB in the beginning and 59.7MB in the end (delta: -10.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-13 16:29:31,614 INFO L158 Benchmark]: Boogie Procedure Inliner took 26.72ms. Allocated memory is still 90.2MB. Free memory was 59.5MB in the beginning and 58.2MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-13 16:29:31,614 INFO L158 Benchmark]: Boogie Preprocessor took 35.94ms. Allocated memory is still 90.2MB. Free memory was 58.2MB in the beginning and 57.2MB in the end (delta: 948.3kB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-13 16:29:31,615 INFO L158 Benchmark]: RCFGBuilder took 247.67ms. Allocated memory is still 90.2MB. Free memory was 57.0MB in the beginning and 48.5MB in the end (delta: 8.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-07-13 16:29:31,615 INFO L158 Benchmark]: TraceAbstraction took 504.19ms. Allocated memory was 90.2MB in the beginning and 111.1MB in the end (delta: 21.0MB). Free memory was 47.9MB in the beginning and 74.8MB in the end (delta: -27.0MB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-13 16:29:31,616 INFO L158 Benchmark]: Witness Printer took 3.59ms. Allocated memory is still 111.1MB. Free memory is still 74.8MB. There was no memory consumed. Max. memory is 16.1GB. [2022-07-13 16:29:31,618 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.19ms. Allocated memory is still 90.2MB. Free memory was 66.1MB in the beginning and 66.1MB in the end (delta: 44.6kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 234.37ms. Allocated memory is still 90.2MB. Free memory was 49.4MB in the beginning and 59.7MB in the end (delta: -10.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 26.72ms. Allocated memory is still 90.2MB. Free memory was 59.5MB in the beginning and 58.2MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 35.94ms. Allocated memory is still 90.2MB. Free memory was 58.2MB in the beginning and 57.2MB in the end (delta: 948.3kB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 247.67ms. Allocated memory is still 90.2MB. Free memory was 57.0MB in the beginning and 48.5MB in the end (delta: 8.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 504.19ms. Allocated memory was 90.2MB in the beginning and 111.1MB in the end (delta: 21.0MB). Free memory was 47.9MB in the beginning and 74.8MB in the end (delta: -27.0MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 3.59ms. Allocated memory is still 111.1MB. Free memory is still 74.8MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: overapproximation of to_int at line 33, overapproximation of someBinaryArithmeticDOUBLEoperation at line 29. Possible FailurePath: [L24] int counter = 0; VAL [counter=0] [L26] int r; [L27] double a, x; [L28] a = __VERIFIER_nondet_double() [L29] x = a / 2.0 [L30] r = 0 VAL [counter=0, r=0] [L32] EXPR counter++ VAL [counter=1, counter++=0, r=0] [L32] COND TRUE counter++<100 [L33] CALL __VERIFIER_assert((int)(r*r - a - r + 2*x) == 0) VAL [\old(cond)=0, counter=1] [L17] COND TRUE !(cond) VAL [\old(cond)=0, cond=0, counter=1] [L19] reach_error() VAL [\old(cond)=0, cond=0, counter=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 17 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 0.4s, OverallIterations: 3, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 0 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 0 mSDsluCounter, 54 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 22 mSDsCounter, 0 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 8 IncrementalHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 0 mSolverCounterUnsat, 32 mSDtfsCounter, 8 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=17occurred in iteration=0, InterpolantAutomatonStates: 6, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 2 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.1s InterpolantComputationTime, 23 NumberOfCodeBlocks, 23 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 13 ConstructedInterpolants, 0 QuantifiedInterpolants, 19 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 2 InterpolantComputations, 2 PerfectInterpolantSequences, 0/0 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-13 16:29:31,670 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/nla-digbench-scaling/freire1_unwindbound100.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 f78eb3bd6243e56025d38ea44716c81630a57505e69e1c5e81a8ab68f6ac9a28 --- Real Ultimate output --- This is Ultimate 0.2.2-?-f4b24e3 [2022-07-13 16:29:33,473 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-13 16:29:33,475 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-13 16:29:33,510 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-13 16:29:33,511 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-13 16:29:33,512 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-13 16:29:33,513 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-13 16:29:33,515 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-13 16:29:33,517 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-13 16:29:33,517 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-13 16:29:33,518 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-13 16:29:33,519 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-13 16:29:33,520 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-13 16:29:33,521 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-13 16:29:33,522 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-13 16:29:33,523 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-13 16:29:33,523 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-13 16:29:33,524 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-13 16:29:33,526 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-13 16:29:33,527 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-13 16:29:33,528 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-13 16:29:33,529 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-13 16:29:33,530 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-13 16:29:33,531 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-13 16:29:33,532 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-13 16:29:33,535 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-13 16:29:33,535 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-13 16:29:33,535 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-13 16:29:33,536 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-13 16:29:33,537 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-13 16:29:33,537 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-13 16:29:33,538 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-13 16:29:33,538 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-13 16:29:33,539 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-13 16:29:33,540 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-13 16:29:33,541 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-13 16:29:33,541 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-13 16:29:33,542 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-13 16:29:33,542 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-13 16:29:33,542 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-13 16:29:33,543 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-13 16:29:33,544 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-13 16:29:33,545 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2022-07-13 16:29:33,564 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-13 16:29:33,565 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-13 16:29:33,565 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-13 16:29:33,565 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-13 16:29:33,566 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-13 16:29:33,566 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-13 16:29:33,567 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-13 16:29:33,567 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-13 16:29:33,567 INFO L138 SettingsManager]: * Use SBE=true [2022-07-13 16:29:33,567 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-13 16:29:33,568 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-13 16:29:33,568 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-13 16:29:33,568 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-13 16:29:33,568 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-13 16:29:33,568 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-13 16:29:33,569 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-13 16:29:33,569 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-07-13 16:29:33,569 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-07-13 16:29:33,569 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-07-13 16:29:33,569 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-13 16:29:33,570 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-13 16:29:33,570 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-13 16:29:33,570 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-13 16:29:33,570 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-13 16:29:33,570 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-13 16:29:33,571 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-13 16:29:33,571 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-13 16:29:33,571 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-13 16:29:33,571 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-13 16:29:33,572 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-13 16:29:33,572 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2022-07-13 16:29:33,572 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-07-13 16:29:33,572 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-13 16:29:33,572 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-13 16:29:33,573 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-13 16:29:33,573 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-07-13 16:29:33,573 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 -> f78eb3bd6243e56025d38ea44716c81630a57505e69e1c5e81a8ab68f6ac9a28 [2022-07-13 16:29:33,885 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-13 16:29:33,913 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-13 16:29:33,916 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-13 16:29:33,916 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-13 16:29:33,917 INFO L275 PluginConnector]: CDTParser initialized [2022-07-13 16:29:33,919 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/nla-digbench-scaling/freire1_unwindbound100.c [2022-07-13 16:29:33,978 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/776e07c72/89c25e9d2fc14787aba4f771e09183de/FLAG08430b9f1 [2022-07-13 16:29:34,404 INFO L306 CDTParser]: Found 1 translation units. [2022-07-13 16:29:34,405 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/freire1_unwindbound100.c [2022-07-13 16:29:34,410 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/776e07c72/89c25e9d2fc14787aba4f771e09183de/FLAG08430b9f1 [2022-07-13 16:29:34,426 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/776e07c72/89c25e9d2fc14787aba4f771e09183de [2022-07-13 16:29:34,428 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-13 16:29:34,430 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-13 16:29:34,432 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-13 16:29:34,432 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-13 16:29:34,434 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-13 16:29:34,435 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.07 04:29:34" (1/1) ... [2022-07-13 16:29:34,436 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@c76ff7c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 04:29:34, skipping insertion in model container [2022-07-13 16:29:34,436 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.07 04:29:34" (1/1) ... [2022-07-13 16:29:34,441 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-13 16:29:34,456 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-13 16:29:34,580 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/nla-digbench-scaling/freire1_unwindbound100.c[712,725] [2022-07-13 16:29:34,591 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-13 16:29:34,602 INFO L203 MainTranslator]: Completed pre-run [2022-07-13 16:29:34,620 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/nla-digbench-scaling/freire1_unwindbound100.c[712,725] [2022-07-13 16:29:34,644 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-13 16:29:34,666 INFO L208 MainTranslator]: Completed translation [2022-07-13 16:29:34,666 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 04:29:34 WrapperNode [2022-07-13 16:29:34,666 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-13 16:29:34,667 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-13 16:29:34,667 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-13 16:29:34,667 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-13 16:29:34,673 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 04:29:34" (1/1) ... [2022-07-13 16:29:34,691 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 04:29:34" (1/1) ... [2022-07-13 16:29:34,706 INFO L137 Inliner]: procedures = 15, calls = 9, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 35 [2022-07-13 16:29:34,706 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-13 16:29:34,707 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-13 16:29:34,707 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-13 16:29:34,708 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-13 16:29:34,714 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 04:29:34" (1/1) ... [2022-07-13 16:29:34,714 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 04:29:34" (1/1) ... [2022-07-13 16:29:34,720 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 04:29:34" (1/1) ... [2022-07-13 16:29:34,720 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 04:29:34" (1/1) ... [2022-07-13 16:29:34,735 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 04:29:34" (1/1) ... [2022-07-13 16:29:34,738 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 04:29:34" (1/1) ... [2022-07-13 16:29:34,744 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 04:29:34" (1/1) ... [2022-07-13 16:29:34,747 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-13 16:29:34,749 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-13 16:29:34,750 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-13 16:29:34,751 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-13 16:29:34,752 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 04:29:34" (1/1) ... [2022-07-13 16:29:34,757 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-13 16:29:34,765 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 16:29:34,776 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-13 16:29:34,801 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-13 16:29:34,817 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-13 16:29:34,817 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-07-13 16:29:34,817 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-13 16:29:34,818 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-13 16:29:34,818 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-07-13 16:29:34,818 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-07-13 16:29:34,875 INFO L234 CfgBuilder]: Building ICFG [2022-07-13 16:29:34,877 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-13 16:29:35,864 INFO L275 CfgBuilder]: Performing block encoding [2022-07-13 16:29:35,868 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-13 16:29:35,869 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-07-13 16:29:35,870 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.07 04:29:35 BoogieIcfgContainer [2022-07-13 16:29:35,870 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-13 16:29:35,872 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-13 16:29:35,873 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-13 16:29:35,876 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-13 16:29:35,876 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.07 04:29:34" (1/3) ... [2022-07-13 16:29:35,877 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6497da92 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.07 04:29:35, skipping insertion in model container [2022-07-13 16:29:35,877 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 04:29:34" (2/3) ... [2022-07-13 16:29:35,877 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6497da92 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.07 04:29:35, skipping insertion in model container [2022-07-13 16:29:35,877 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.07 04:29:35" (3/3) ... [2022-07-13 16:29:35,878 INFO L111 eAbstractionObserver]: Analyzing ICFG freire1_unwindbound100.c [2022-07-13 16:29:35,897 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-13 16:29:35,898 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-13 16:29:35,948 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-13 16:29:35,957 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@3c0d773d, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@61dbc219 [2022-07-13 16:29:35,958 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-07-13 16:29:35,964 INFO L276 IsEmpty]: Start isEmpty. Operand has 17 states, 12 states have (on average 1.4166666666666667) internal successors, (17), 13 states have internal predecessors, (17), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-13 16:29:35,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-07-13 16:29:35,976 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 16:29:35,977 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-07-13 16:29:35,978 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 16:29:35,984 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 16:29:35,984 INFO L85 PathProgramCache]: Analyzing trace with hash 1819757606, now seen corresponding path program 1 times [2022-07-13 16:29:35,995 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-13 16:29:35,996 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [544862620] [2022-07-13 16:29:35,996 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 16:29:35,997 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-13 16:29:35,999 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-13 16:29:36,005 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-13 16:29:36,007 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-13 16:29:36,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 16:29:36,385 INFO L263 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 1 conjunts are in the unsatisfiable core [2022-07-13 16:29:36,387 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 16:29:36,406 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-13 16:29:36,406 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 16:29:36,407 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-13 16:29:36,407 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [544862620] [2022-07-13 16:29:36,407 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [544862620] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 16:29:36,407 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 16:29:36,408 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-13 16:29:36,409 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1643630829] [2022-07-13 16:29:36,411 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 16:29:36,414 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-07-13 16:29:36,415 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-13 16:29:36,439 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-07-13 16:29:36,439 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-07-13 16:29:36,441 INFO L87 Difference]: Start difference. First operand has 17 states, 12 states have (on average 1.4166666666666667) internal successors, (17), 13 states have internal predecessors, (17), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 16:29:36,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 16:29:36,454 INFO L93 Difference]: Finished difference Result 32 states and 42 transitions. [2022-07-13 16:29:36,454 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-07-13 16:29:36,455 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2022-07-13 16:29:36,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 16:29:36,459 INFO L225 Difference]: With dead ends: 32 [2022-07-13 16:29:36,460 INFO L226 Difference]: Without dead ends: 13 [2022-07-13 16:29:36,462 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-07-13 16:29:36,465 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 19 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-13 16:29:36,466 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-13 16:29:36,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2022-07-13 16:29:36,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2022-07-13 16:29:36,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 9 states have (on average 1.3333333333333333) internal successors, (12), 10 states have internal predecessors, (12), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-13 16:29:36,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 15 transitions. [2022-07-13 16:29:36,490 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 15 transitions. Word has length 7 [2022-07-13 16:29:36,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 16:29:36,490 INFO L495 AbstractCegarLoop]: Abstraction has 13 states and 15 transitions. [2022-07-13 16:29:36,491 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 16:29:36,491 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 15 transitions. [2022-07-13 16:29:36,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-07-13 16:29:36,491 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 16:29:36,491 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 16:29:36,507 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Ended with exit code 0 [2022-07-13 16:29:36,696 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-13 16:29:36,697 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 16:29:36,697 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 16:29:36,697 INFO L85 PathProgramCache]: Analyzing trace with hash 178410715, now seen corresponding path program 1 times [2022-07-13 16:29:36,698 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-13 16:29:36,698 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [331589551] [2022-07-13 16:29:36,698 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 16:29:36,698 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-13 16:29:36,698 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-13 16:29:36,700 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-13 16:29:36,701 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-13 16:29:36,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 16:29:36,964 INFO L263 TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-13 16:29:36,965 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 16:29:37,015 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-13 16:29:37,016 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 16:29:37,016 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-13 16:29:37,016 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [331589551] [2022-07-13 16:29:37,016 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [331589551] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 16:29:37,016 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 16:29:37,016 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-13 16:29:37,017 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2098078623] [2022-07-13 16:29:37,017 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 16:29:37,018 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-13 16:29:37,018 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-13 16:29:37,018 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-13 16:29:37,018 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-13 16:29:37,019 INFO L87 Difference]: Start difference. First operand 13 states and 15 transitions. Second operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 16:29:37,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 16:29:37,928 INFO L93 Difference]: Finished difference Result 22 states and 24 transitions. [2022-07-13 16:29:37,929 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-13 16:29:37,929 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2022-07-13 16:29:37,929 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 16:29:37,929 INFO L225 Difference]: With dead ends: 22 [2022-07-13 16:29:37,929 INFO L226 Difference]: Without dead ends: 15 [2022-07-13 16:29:37,930 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-13 16:29:37,931 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 0 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 35 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-07-13 16:29:37,931 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 35 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-07-13 16:29:37,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2022-07-13 16:29:37,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2022-07-13 16:29:37,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 12 states have internal predecessors, (14), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-13 16:29:37,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 17 transitions. [2022-07-13 16:29:37,936 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 17 transitions. Word has length 8 [2022-07-13 16:29:37,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 16:29:37,936 INFO L495 AbstractCegarLoop]: Abstraction has 15 states and 17 transitions. [2022-07-13 16:29:37,936 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 16:29:37,936 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 17 transitions. [2022-07-13 16:29:37,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-07-13 16:29:37,937 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 16:29:37,937 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 16:29:37,951 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Ended with exit code 0 [2022-07-13 16:29:38,147 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-13 16:29:38,148 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 16:29:38,148 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 16:29:38,149 INFO L85 PathProgramCache]: Analyzing trace with hash 180198175, now seen corresponding path program 1 times [2022-07-13 16:29:38,149 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-13 16:29:38,149 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [54428019] [2022-07-13 16:29:38,149 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 16:29:38,149 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-13 16:29:38,150 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-13 16:29:38,151 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-13 16:29:38,152 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-13 16:29:40,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 16:29:40,331 INFO L263 TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 6 conjunts are in the unsatisfiable core [2022-07-13 16:29:40,334 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 16:30:03,641 WARN L833 $PredicateComparison]: unable to prove that (or (and (exists ((|v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_1| (_ FloatingPoint 11 53))) (= ((_ fp.to_sbv 32) roundTowardZero (fp.add roundNearestTiesToEven (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv0 32)))) (fp.sub roundNearestTiesToEven (fp.sub roundNearestTiesToEven .cse0 |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_1|) .cse0)) (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (_ bv2 32)) (fp.div roundNearestTiesToEven |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_1| ((_ to_fp 11 53) roundNearestTiesToEven 2.0))))) (_ bv0 32))) (= |c___VERIFIER_assert_#in~cond| (_ bv1 32))) (and (exists ((|v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_1| (_ FloatingPoint 11 53))) (not (= ((_ fp.to_sbv 32) roundTowardZero (fp.add roundNearestTiesToEven (let ((.cse1 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv0 32)))) (fp.sub roundNearestTiesToEven (fp.sub roundNearestTiesToEven .cse1 |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_1|) .cse1)) (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (_ bv2 32)) (fp.div roundNearestTiesToEven |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_1| ((_ to_fp 11 53) roundNearestTiesToEven 2.0))))) (_ bv0 32)))) (= |c___VERIFIER_assert_#in~cond| (_ bv0 32)))) is different from false [2022-07-13 16:30:18,050 WARN L833 $PredicateComparison]: unable to prove that (or (and (exists ((|v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_1| (_ FloatingPoint 11 53))) (not (= ((_ fp.to_sbv 32) roundTowardZero (fp.add roundNearestTiesToEven (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv0 32)))) (fp.sub roundNearestTiesToEven (fp.sub roundNearestTiesToEven .cse0 |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_1|) .cse0)) (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (_ bv2 32)) (fp.div roundNearestTiesToEven |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_1| ((_ to_fp 11 53) roundNearestTiesToEven 2.0))))) (_ bv0 32)))) (= (_ bv0 32) c___VERIFIER_assert_~cond)) (and (exists ((|v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_1| (_ FloatingPoint 11 53))) (= ((_ fp.to_sbv 32) roundTowardZero (fp.add roundNearestTiesToEven (let ((.cse1 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv0 32)))) (fp.sub roundNearestTiesToEven (fp.sub roundNearestTiesToEven .cse1 |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_1|) .cse1)) (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (_ bv2 32)) (fp.div roundNearestTiesToEven |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_1| ((_ to_fp 11 53) roundNearestTiesToEven 2.0))))) (_ bv0 32))) (= (_ bv1 32) c___VERIFIER_assert_~cond))) is different from false [2022-07-13 16:30:24,458 WARN L833 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_1| (_ FloatingPoint 11 53))) (not (= ((_ fp.to_sbv 32) roundTowardZero (fp.add roundNearestTiesToEven (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv0 32)))) (fp.sub roundNearestTiesToEven (fp.sub roundNearestTiesToEven .cse0 |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_1|) .cse0)) (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (_ bv2 32)) (fp.div roundNearestTiesToEven |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_1| ((_ to_fp 11 53) roundNearestTiesToEven 2.0))))) (_ bv0 32)))) is different from false [2022-07-13 16:30:26,493 WARN L855 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_1| (_ FloatingPoint 11 53))) (not (= ((_ fp.to_sbv 32) roundTowardZero (fp.add roundNearestTiesToEven (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv0 32)))) (fp.sub roundNearestTiesToEven (fp.sub roundNearestTiesToEven .cse0 |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_1|) .cse0)) (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (_ bv2 32)) (fp.div roundNearestTiesToEven |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_1| ((_ to_fp 11 53) roundNearestTiesToEven 2.0))))) (_ bv0 32)))) is different from true [2022-07-13 16:30:26,494 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-13 16:30:26,494 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 16:30:26,494 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-13 16:30:26,494 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [54428019] [2022-07-13 16:30:26,495 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [54428019] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 16:30:26,495 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 16:30:26,495 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-13 16:30:26,495 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1003210249] [2022-07-13 16:30:26,495 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 16:30:26,495 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-13 16:30:26,496 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-13 16:30:26,496 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-13 16:30:26,496 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=8, Unknown=4, NotChecked=18, Total=42 [2022-07-13 16:30:26,497 INFO L87 Difference]: Start difference. First operand 15 states and 17 transitions. Second operand has 7 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 5 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 16:30:28,977 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.20s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-07-13 16:30:31,149 WARN L833 $PredicateComparison]: unable to prove that (and (or (and (exists ((|v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_1| (_ FloatingPoint 11 53))) (= ((_ fp.to_sbv 32) roundTowardZero (fp.add roundNearestTiesToEven (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv0 32)))) (fp.sub roundNearestTiesToEven (fp.sub roundNearestTiesToEven .cse0 |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_1|) .cse0)) (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (_ bv2 32)) (fp.div roundNearestTiesToEven |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_1| ((_ to_fp 11 53) roundNearestTiesToEven 2.0))))) (_ bv0 32))) (= |c___VERIFIER_assert_#in~cond| (_ bv1 32))) (and (exists ((|v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_1| (_ FloatingPoint 11 53))) (not (= ((_ fp.to_sbv 32) roundTowardZero (fp.add roundNearestTiesToEven (let ((.cse1 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv0 32)))) (fp.sub roundNearestTiesToEven (fp.sub roundNearestTiesToEven .cse1 |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_1|) .cse1)) (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (_ bv2 32)) (fp.div roundNearestTiesToEven |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_1| ((_ to_fp 11 53) roundNearestTiesToEven 2.0))))) (_ bv0 32)))) (= |c___VERIFIER_assert_#in~cond| (_ bv0 32)))) (= c_currentRoundingMode roundNearestTiesToEven)) is different from false [2022-07-13 16:30:33,470 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.46s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-07-13 16:30:35,735 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.22s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-07-13 16:30:37,768 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-07-13 16:30:39,966 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.20s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-07-13 16:30:42,204 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.24s for a HTC check with result UNKNOWN. Formula has sorts [Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-07-13 16:30:42,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 16:30:42,552 INFO L93 Difference]: Finished difference Result 24 states and 27 transitions. [2022-07-13 16:30:42,562 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-13 16:30:42,562 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 5 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2022-07-13 16:30:42,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 16:30:42,563 INFO L225 Difference]: With dead ends: 24 [2022-07-13 16:30:42,563 INFO L226 Difference]: Without dead ends: 22 [2022-07-13 16:30:42,563 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 12.4s TimeCoverageRelationStatistics Valid=14, Invalid=9, Unknown=5, NotChecked=28, Total=56 [2022-07-13 16:30:42,564 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 17 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 3 mSolverCounterUnsat, 5 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 13.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 75 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 5 IncrementalHoareTripleChecker+Unknown, 61 IncrementalHoareTripleChecker+Unchecked, 13.9s IncrementalHoareTripleChecker+Time [2022-07-13 16:30:42,565 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 34 Invalid, 75 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 6 Invalid, 5 Unknown, 61 Unchecked, 13.9s Time] [2022-07-13 16:30:42,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2022-07-13 16:30:42,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 20. [2022-07-13 16:30:42,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 16 states have internal predecessors, (17), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-13 16:30:42,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 22 transitions. [2022-07-13 16:30:42,570 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 22 transitions. Word has length 8 [2022-07-13 16:30:42,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 16:30:42,571 INFO L495 AbstractCegarLoop]: Abstraction has 20 states and 22 transitions. [2022-07-13 16:30:42,571 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 5 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 16:30:42,571 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 22 transitions. [2022-07-13 16:30:42,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-07-13 16:30:42,571 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 16:30:42,572 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 16:30:42,589 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Ended with exit code 0 [2022-07-13 16:30:42,777 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-13 16:30:42,778 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 16:30:42,778 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 16:30:42,778 INFO L85 PathProgramCache]: Analyzing trace with hash 1780785341, now seen corresponding path program 1 times [2022-07-13 16:30:42,779 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-13 16:30:42,779 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [722955011] [2022-07-13 16:30:42,779 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 16:30:42,779 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-13 16:30:42,780 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-13 16:30:42,781 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-13 16:30:42,784 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-13 16:30:43,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 16:30:43,058 INFO L263 TraceCheckSpWp]: Trace formula consists of 35 conjuncts, 6 conjunts are in the unsatisfiable core [2022-07-13 16:30:43,060 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 16:30:49,357 WARN L833 $PredicateComparison]: unable to prove that (= ((_ fp.to_sbv 32) roundTowardZero (fp.add c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (bvmul |c_ULTIMATE.start_main_~r~0#1| |c_ULTIMATE.start_main_~r~0#1|)) |c_ULTIMATE.start_main_~a~0#1|) ((_ to_fp 11 53) c_currentRoundingMode |c_ULTIMATE.start_main_~r~0#1|)) (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (_ bv2 32)) |c_ULTIMATE.start_main_~x~0#1|))) (_ bv0 32)) is different from false [2022-07-13 16:30:51,423 WARN L855 $PredicateComparison]: unable to prove that (= ((_ fp.to_sbv 32) roundTowardZero (fp.add c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (bvmul |c_ULTIMATE.start_main_~r~0#1| |c_ULTIMATE.start_main_~r~0#1|)) |c_ULTIMATE.start_main_~a~0#1|) ((_ to_fp 11 53) c_currentRoundingMode |c_ULTIMATE.start_main_~r~0#1|)) (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (_ bv2 32)) |c_ULTIMATE.start_main_~x~0#1|))) (_ bv0 32)) is different from true [2022-07-13 16:31:03,850 WARN L833 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_2| (_ FloatingPoint 11 53)) (|v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_2| (_ BitVec 32)) (|v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_2| (_ FloatingPoint 11 53)) (currentRoundingMode RoundingMode)) (= ((_ fp.to_sbv 32) roundTowardZero (fp.add currentRoundingMode (fp.sub currentRoundingMode (fp.sub currentRoundingMode ((_ to_fp 11 53) currentRoundingMode (bvmul |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_2| |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_2|)) |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_2|) ((_ to_fp 11 53) currentRoundingMode |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_2|)) (fp.mul currentRoundingMode ((_ to_fp 11 53) currentRoundingMode (_ bv2 32)) |v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_2|))) (_ bv0 32))) (= |c___VERIFIER_assert_#in~cond| (_ bv1 32))) is different from false [2022-07-13 16:31:12,149 WARN L833 $PredicateComparison]: unable to prove that (and (= (_ bv1 32) c___VERIFIER_assert_~cond) (exists ((|v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_2| (_ FloatingPoint 11 53)) (|v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_2| (_ BitVec 32)) (|v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_2| (_ FloatingPoint 11 53)) (currentRoundingMode RoundingMode)) (= ((_ fp.to_sbv 32) roundTowardZero (fp.add currentRoundingMode (fp.sub currentRoundingMode (fp.sub currentRoundingMode ((_ to_fp 11 53) currentRoundingMode (bvmul |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_2| |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_2|)) |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_2|) ((_ to_fp 11 53) currentRoundingMode |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_2|)) (fp.mul currentRoundingMode ((_ to_fp 11 53) currentRoundingMode (_ bv2 32)) |v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_2|))) (_ bv0 32)))) is different from false [2022-07-13 16:31:12,158 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2022-07-13 16:31:12,158 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 16:31:37,093 WARN L233 SmtUtils]: Spent 16.51s on a formula simplification that was a NOOP. DAG size: 26 (called from [L 279] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-07-13 16:31:53,587 WARN L233 SmtUtils]: Spent 16.49s on a formula simplification that was a NOOP. DAG size: 26 (called from [L 316] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-07-13 16:31:59,843 WARN L855 $PredicateComparison]: unable to prove that (or (forall ((|v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_3| (_ FloatingPoint 11 53)) (|v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_3| (_ BitVec 32)) (|v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_3| (_ FloatingPoint 11 53))) (= ((_ fp.to_sbv 32) roundTowardZero (fp.add c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (bvmul |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_3| |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_3|)) |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_3|) ((_ to_fp 11 53) c_currentRoundingMode |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_3|)) (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (_ bv2 32)) |v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_3|))) (_ bv0 32))) (not (= |c___VERIFIER_assert_#in~cond| (_ bv0 32)))) is different from true [2022-07-13 16:32:10,279 WARN L855 $PredicateComparison]: unable to prove that (or (forall ((|v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_3| (_ FloatingPoint 11 53)) (|v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_3| (_ BitVec 32)) (|v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_3| (_ FloatingPoint 11 53))) (= ((_ fp.to_sbv 32) roundTowardZero (fp.add c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (bvmul |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_3| |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_3|)) |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_3|) ((_ to_fp 11 53) c_currentRoundingMode |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_3|)) (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (_ bv2 32)) |v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_3|))) (_ bv0 32))) (= (_ bv0 32) c___VERIFIER_assert_~cond) (not (= |c___VERIFIER_assert_#in~cond| (_ bv0 32)))) is different from true [2022-07-13 16:32:10,282 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2022-07-13 16:32:10,282 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-13 16:32:10,282 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [722955011] [2022-07-13 16:32:10,283 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [722955011] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 16:32:10,283 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-13 16:32:10,283 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 10 [2022-07-13 16:32:10,283 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [280578275] [2022-07-13 16:32:10,283 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-13 16:32:10,283 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-13 16:32:10,283 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-13 16:32:10,284 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-13 16:32:10,284 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=17, Unknown=6, NotChecked=50, Total=90 [2022-07-13 16:32:10,284 INFO L87 Difference]: Start difference. First operand 20 states and 22 transitions. Second operand has 10 states, 10 states have (on average 1.6) internal successors, (16), 9 states have internal predecessors, (16), 2 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-07-13 16:32:12,425 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.14s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-07-13 16:32:14,432 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-07-13 16:32:16,582 WARN L855 $PredicateComparison]: unable to prove that (and (= |c___VERIFIER_assert_#in~cond| c___VERIFIER_assert_~cond) (or (forall ((|v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_3| (_ FloatingPoint 11 53)) (|v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_3| (_ BitVec 32)) (|v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_3| (_ FloatingPoint 11 53))) (= ((_ fp.to_sbv 32) roundTowardZero (fp.add c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (bvmul |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_3| |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_3|)) |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_3|) ((_ to_fp 11 53) c_currentRoundingMode |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_3|)) (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (_ bv2 32)) |v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_3|))) (_ bv0 32))) (= (_ bv0 32) c___VERIFIER_assert_~cond) (not (= |c___VERIFIER_assert_#in~cond| (_ bv0 32))))) is different from true [2022-07-13 16:32:18,657 WARN L855 $PredicateComparison]: unable to prove that (let ((.cse0 (not (= |c___VERIFIER_assert_#in~cond| (_ bv0 32))))) (and (or (forall ((|v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_3| (_ FloatingPoint 11 53)) (|v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_3| (_ BitVec 32)) (|v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_3| (_ FloatingPoint 11 53))) (= ((_ fp.to_sbv 32) roundTowardZero (fp.add c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (bvmul |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_3| |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_3|)) |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_3|) ((_ to_fp 11 53) c_currentRoundingMode |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_3|)) (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (_ bv2 32)) |v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_3|))) (_ bv0 32))) .cse0) .cse0)) is different from true [2022-07-13 16:32:20,731 WARN L833 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_2| (_ FloatingPoint 11 53)) (|v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_2| (_ BitVec 32)) (|v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_2| (_ FloatingPoint 11 53)) (currentRoundingMode RoundingMode)) (= ((_ fp.to_sbv 32) roundTowardZero (fp.add currentRoundingMode (fp.sub currentRoundingMode (fp.sub currentRoundingMode ((_ to_fp 11 53) currentRoundingMode (bvmul |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_2| |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_2|)) |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_2|) ((_ to_fp 11 53) currentRoundingMode |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_2|)) (fp.mul currentRoundingMode ((_ to_fp 11 53) currentRoundingMode (_ bv2 32)) |v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_2|))) (_ bv0 32))) (= |c___VERIFIER_assert_#in~cond| (_ bv1 32)) (not (= |c___VERIFIER_assert_#in~cond| (_ bv0 32)))) is different from false [2022-07-13 16:32:22,808 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (= (_ bv0 32) c___VERIFIER_assert_~cond))) (and (= |c___VERIFIER_assert_#in~cond| c___VERIFIER_assert_~cond) (= (_ bv1 32) c___VERIFIER_assert_~cond) (not .cse0) (exists ((|v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_2| (_ FloatingPoint 11 53)) (|v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_2| (_ BitVec 32)) (|v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_2| (_ FloatingPoint 11 53)) (currentRoundingMode RoundingMode)) (= ((_ fp.to_sbv 32) roundTowardZero (fp.add currentRoundingMode (fp.sub currentRoundingMode (fp.sub currentRoundingMode ((_ to_fp 11 53) currentRoundingMode (bvmul |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_2| |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_2|)) |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_2|) ((_ to_fp 11 53) currentRoundingMode |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_2|)) (fp.mul currentRoundingMode ((_ to_fp 11 53) currentRoundingMode (_ bv2 32)) |v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_2|))) (_ bv0 32))) (or (forall ((|v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_3| (_ FloatingPoint 11 53)) (|v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_3| (_ BitVec 32)) (|v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_3| (_ FloatingPoint 11 53))) (= ((_ fp.to_sbv 32) roundTowardZero (fp.add c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (bvmul |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_3| |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_3|)) |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_3|) ((_ to_fp 11 53) c_currentRoundingMode |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_3|)) (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (_ bv2 32)) |v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_3|))) (_ bv0 32))) .cse0 (not (= |c___VERIFIER_assert_#in~cond| (_ bv0 32)))))) is different from false [2022-07-13 16:32:24,872 WARN L855 $PredicateComparison]: unable to prove that (let ((.cse0 (= (_ bv0 32) c___VERIFIER_assert_~cond))) (and (= |c___VERIFIER_assert_#in~cond| c___VERIFIER_assert_~cond) (= (_ bv1 32) c___VERIFIER_assert_~cond) (not .cse0) (exists ((|v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_2| (_ FloatingPoint 11 53)) (|v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_2| (_ BitVec 32)) (|v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_2| (_ FloatingPoint 11 53)) (currentRoundingMode RoundingMode)) (= ((_ fp.to_sbv 32) roundTowardZero (fp.add currentRoundingMode (fp.sub currentRoundingMode (fp.sub currentRoundingMode ((_ to_fp 11 53) currentRoundingMode (bvmul |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_2| |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_2|)) |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_2|) ((_ to_fp 11 53) currentRoundingMode |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_2|)) (fp.mul currentRoundingMode ((_ to_fp 11 53) currentRoundingMode (_ bv2 32)) |v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_2|))) (_ bv0 32))) (or (forall ((|v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_3| (_ FloatingPoint 11 53)) (|v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_3| (_ BitVec 32)) (|v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_3| (_ FloatingPoint 11 53))) (= ((_ fp.to_sbv 32) roundTowardZero (fp.add c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (bvmul |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_3| |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_3|)) |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_3|) ((_ to_fp 11 53) c_currentRoundingMode |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_3|)) (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (_ bv2 32)) |v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_3|))) (_ bv0 32))) .cse0 (not (= |c___VERIFIER_assert_#in~cond| (_ bv0 32)))))) is different from true [2022-07-13 16:32:24,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 16:32:24,875 INFO L93 Difference]: Finished difference Result 25 states and 27 transitions. [2022-07-13 16:32:24,875 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-13 16:32:24,875 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 1.6) internal successors, (16), 9 states have internal predecessors, (16), 2 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 14 [2022-07-13 16:32:24,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 16:32:24,878 INFO L225 Difference]: With dead ends: 25 [2022-07-13 16:32:24,878 INFO L226 Difference]: Without dead ends: 20 [2022-07-13 16:32:24,879 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 9 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 22.9s TimeCoverageRelationStatistics Valid=25, Invalid=20, Unknown=11, NotChecked=126, Total=182 [2022-07-13 16:32:24,881 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 0 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 41 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 40 IncrementalHoareTripleChecker+Unchecked, 4.2s IncrementalHoareTripleChecker+Time [2022-07-13 16:32:24,881 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 41 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 2 Unknown, 40 Unchecked, 4.2s Time] [2022-07-13 16:32:24,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2022-07-13 16:32:24,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2022-07-13 16:32:24,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 14 states have (on average 1.1428571428571428) internal successors, (16), 16 states have internal predecessors, (16), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-13 16:32:24,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 21 transitions. [2022-07-13 16:32:24,885 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 21 transitions. Word has length 14 [2022-07-13 16:32:24,886 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 16:32:24,886 INFO L495 AbstractCegarLoop]: Abstraction has 20 states and 21 transitions. [2022-07-13 16:32:24,886 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 1.6) internal successors, (16), 9 states have internal predecessors, (16), 2 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-07-13 16:32:24,886 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 21 transitions. [2022-07-13 16:32:24,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-07-13 16:32:24,887 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 16:32:24,887 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 16:32:24,902 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Ended with exit code 0 [2022-07-13 16:32:25,090 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-13 16:32:25,091 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 16:32:25,091 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 16:32:25,091 INFO L85 PathProgramCache]: Analyzing trace with hash -1542398814, now seen corresponding path program 1 times [2022-07-13 16:32:25,091 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-13 16:32:25,091 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [499593752] [2022-07-13 16:32:25,092 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 16:32:25,092 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-13 16:32:25,092 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-13 16:32:25,093 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-13 16:32:25,094 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-13 16:32:25,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 16:32:25,658 INFO L263 TraceCheckSpWp]: Trace formula consists of 40 conjuncts, 5 conjunts are in the unsatisfiable core [2022-07-13 16:32:25,659 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 16:32:25,901 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 16:32:25,901 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 16:32:26,174 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 16:32:26,175 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-13 16:32:26,175 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [499593752] [2022-07-13 16:32:26,175 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [499593752] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 16:32:26,175 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-13 16:32:26,175 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5] total 8 [2022-07-13 16:32:26,175 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1850341000] [2022-07-13 16:32:26,175 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-13 16:32:26,176 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-13 16:32:26,176 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-13 16:32:26,176 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-13 16:32:26,176 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2022-07-13 16:32:26,176 INFO L87 Difference]: Start difference. First operand 20 states and 21 transitions. Second operand has 8 states, 8 states have (on average 2.875) internal successors, (23), 8 states have internal predecessors, (23), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-13 16:32:29,436 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.14s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-07-13 16:32:31,644 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.20s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-07-13 16:32:34,062 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.13s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-07-13 16:32:36,079 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-07-13 16:32:38,313 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.23s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-07-13 16:32:40,321 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-07-13 16:32:42,611 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.14s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-07-13 16:32:44,617 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-07-13 16:32:46,622 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-07-13 16:32:48,829 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.21s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-07-13 16:32:50,833 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-07-13 16:32:50,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 16:32:50,932 INFO L93 Difference]: Finished difference Result 50 states and 53 transitions. [2022-07-13 16:32:50,932 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-13 16:32:50,933 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.875) internal successors, (23), 8 states have internal predecessors, (23), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 16 [2022-07-13 16:32:50,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 16:32:50,934 INFO L225 Difference]: With dead ends: 50 [2022-07-13 16:32:50,934 INFO L226 Difference]: Without dead ends: 43 [2022-07-13 16:32:50,934 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=44, Invalid=88, Unknown=0, NotChecked=0, Total=132 [2022-07-13 16:32:50,936 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 25 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 11 mSolverCounterUnsat, 11 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 24.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 78 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 11 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 24.5s IncrementalHoareTripleChecker+Time [2022-07-13 16:32:50,936 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 78 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 25 Invalid, 11 Unknown, 0 Unchecked, 24.5s Time] [2022-07-13 16:32:50,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2022-07-13 16:32:50,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 39. [2022-07-13 16:32:50,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 29 states have (on average 1.1379310344827587) internal successors, (33), 30 states have internal predecessors, (33), 5 states have call successors, (5), 4 states have call predecessors, (5), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-07-13 16:32:50,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 42 transitions. [2022-07-13 16:32:50,950 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 42 transitions. Word has length 16 [2022-07-13 16:32:50,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 16:32:50,950 INFO L495 AbstractCegarLoop]: Abstraction has 39 states and 42 transitions. [2022-07-13 16:32:50,951 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.875) internal successors, (23), 8 states have internal predecessors, (23), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-13 16:32:50,951 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 42 transitions. [2022-07-13 16:32:50,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-07-13 16:32:50,952 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 16:32:50,952 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 16:32:50,979 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2022-07-13 16:32:51,167 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-13 16:32:51,168 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 16:32:51,168 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 16:32:51,168 INFO L85 PathProgramCache]: Analyzing trace with hash -1540611354, now seen corresponding path program 1 times [2022-07-13 16:32:51,168 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-13 16:32:51,168 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1078577101] [2022-07-13 16:32:51,169 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 16:32:51,169 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-13 16:32:51,169 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-13 16:32:51,170 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-13 16:32:51,171 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2022-07-13 16:32:56,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 16:32:56,855 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-13 16:33:05,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 16:33:05,765 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2022-07-13 16:33:05,766 INFO L271 BasicCegarLoop]: Counterexample is feasible [2022-07-13 16:33:05,766 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-07-13 16:33:05,824 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2022-07-13 16:33:05,968 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-13 16:33:05,972 INFO L356 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2022-07-13 16:33:05,974 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-07-13 16:33:05,993 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.07 04:33:05 BoogieIcfgContainer [2022-07-13 16:33:05,993 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-07-13 16:33:05,994 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-07-13 16:33:05,994 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-07-13 16:33:05,994 INFO L275 PluginConnector]: Witness Printer initialized [2022-07-13 16:33:05,995 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.07 04:29:35" (3/4) ... [2022-07-13 16:33:05,997 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2022-07-13 16:33:06,032 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2022-07-13 16:33:06,033 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-07-13 16:33:06,033 INFO L158 Benchmark]: Toolchain (without parser) took 211603.77ms. Allocated memory was 56.6MB in the beginning and 69.2MB in the end (delta: 12.6MB). Free memory was 35.6MB in the beginning and 37.3MB in the end (delta: -1.7MB). Peak memory consumption was 9.6MB. Max. memory is 16.1GB. [2022-07-13 16:33:06,034 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 56.6MB. Free memory was 38.9MB in the beginning and 38.8MB in the end (delta: 44.1kB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-13 16:33:06,034 INFO L158 Benchmark]: CACSL2BoogieTranslator took 235.10ms. Allocated memory is still 56.6MB. Free memory was 35.4MB in the beginning and 39.9MB in the end (delta: -4.4MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2022-07-13 16:33:06,034 INFO L158 Benchmark]: Boogie Procedure Inliner took 38.92ms. Allocated memory is still 56.6MB. Free memory was 39.9MB in the beginning and 38.3MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-13 16:33:06,035 INFO L158 Benchmark]: Boogie Preprocessor took 41.26ms. Allocated memory is still 56.6MB. Free memory was 38.3MB in the beginning and 37.1MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-13 16:33:06,035 INFO L158 Benchmark]: RCFGBuilder took 1121.83ms. Allocated memory is still 56.6MB. Free memory was 37.1MB in the beginning and 28.3MB in the end (delta: 8.8MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-07-13 16:33:06,035 INFO L158 Benchmark]: TraceAbstraction took 210121.68ms. Allocated memory was 56.6MB in the beginning and 69.2MB in the end (delta: 12.6MB). Free memory was 27.8MB in the beginning and 39.5MB in the end (delta: -11.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-13 16:33:06,036 INFO L158 Benchmark]: Witness Printer took 38.87ms. Allocated memory is still 69.2MB. Free memory was 39.5MB in the beginning and 37.3MB in the end (delta: 2.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-13 16:33:06,038 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.18ms. Allocated memory is still 56.6MB. Free memory was 38.9MB in the beginning and 38.8MB in the end (delta: 44.1kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 235.10ms. Allocated memory is still 56.6MB. Free memory was 35.4MB in the beginning and 39.9MB in the end (delta: -4.4MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 38.92ms. Allocated memory is still 56.6MB. Free memory was 39.9MB in the beginning and 38.3MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 41.26ms. Allocated memory is still 56.6MB. Free memory was 38.3MB in the beginning and 37.1MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 1121.83ms. Allocated memory is still 56.6MB. Free memory was 37.1MB in the beginning and 28.3MB in the end (delta: 8.8MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * TraceAbstraction took 210121.68ms. Allocated memory was 56.6MB in the beginning and 69.2MB in the end (delta: 12.6MB). Free memory was 27.8MB in the beginning and 39.5MB in the end (delta: -11.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Witness Printer took 38.87ms. Allocated memory is still 69.2MB. Free memory was 39.5MB in the beginning and 37.3MB in the end (delta: 2.2MB). Peak memory consumption was 2.1MB. 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 - CounterExampleResult [Line: 19]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L24] int counter = 0; VAL [counter=0] [L26] int r; [L27] double a, x; [L28] a = __VERIFIER_nondet_double() [L29] x = a / 2.0 [L30] r = 0 VAL [a=16039263319621250, counter=0, r=0, x=8019631659810625] [L32] EXPR counter++ VAL [a=16039263319621250, counter=1, counter++=0, r=0, x=8019631659810625] [L32] COND TRUE counter++<100 [L33] CALL __VERIFIER_assert((int)(r*r - a - r + 2*x) == 0) VAL [\old(cond)=1, counter=1] [L17] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=1] [L33] RET __VERIFIER_assert((int)(r*r - a - r + 2*x) == 0) VAL [a=16039263319621250, counter=1, r=0, x=8019631659810625] [L35] COND FALSE !(!(x > r)) [L37] x = x - r [L38] r = r + 1 VAL [a=16039263319621250, counter=1, r=1, x=8019631659810625] [L32] EXPR counter++ VAL [a=16039263319621250, counter=2, counter++=1, r=1, x=8019631659810625] [L32] COND TRUE counter++<100 [L33] CALL __VERIFIER_assert((int)(r*r - a - r + 2*x) == 0) VAL [\old(cond)=0, counter=2] [L17] COND TRUE !(cond) VAL [\old(cond)=0, cond=0, counter=2] [L19] reach_error() VAL [\old(cond)=0, cond=0, counter=2] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 17 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 210.0s, OverallIterations: 6, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 56.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 18 mSolverCounterUnknown, 43 SdHoareTripleChecker+Valid, 43.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 42 mSDsluCounter, 207 SdHoareTripleChecker+Invalid, 42.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 101 IncrementalHoareTripleChecker+Unchecked, 137 mSDsCounter, 14 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 41 IncrementalHoareTripleChecker+Invalid, 174 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 14 mSolverCounterUnsat, 70 mSDtfsCounter, 41 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 86 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 13 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 35.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=39occurred in iteration=5, InterpolantAutomatonStates: 30, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 5 MinimizatonAttempts, 6 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 9.1s SatisfiabilityAnalysisTime, 134.1s InterpolantComputationTime, 69 NumberOfCodeBlocks, 69 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 76 ConstructedInterpolants, 8 QuantifiedInterpolants, 606 SizeOfPredicates, 7 NumberOfNonLiveVariables, 154 ConjunctsInSsa, 21 ConjunctsInUnsatCore, 7 InterpolantComputations, 3 PerfectInterpolantSequences, 6/12 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 proved your program to be incorrect! [2022-07-13 16:33:06,275 WARN L435 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forcibly destroying the process [2022-07-13 16:33:06,289 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 Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE