./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/nla-digbench-scaling/freire1_unwindbound20.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_unwindbound20.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 290432887833d1264fa39f327d8609faf39248fe680017022e16e5c72d0bf2b6 --- Real Ultimate output --- This is Ultimate 0.2.2-?-f4b24e3 [2022-07-13 16:29:33,980 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-13 16:29:33,982 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-13 16:29:34,028 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-13 16:29:34,029 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-13 16:29:34,031 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-13 16:29:34,032 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-13 16:29:34,034 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-13 16:29:34,035 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-13 16:29:34,038 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-13 16:29:34,039 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-13 16:29:34,041 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-13 16:29:34,041 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-13 16:29:34,043 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-13 16:29:34,043 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-13 16:29:34,046 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-13 16:29:34,047 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-13 16:29:34,048 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-13 16:29:34,049 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-13 16:29:34,053 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-13 16:29:34,054 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-13 16:29:34,055 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-13 16:29:34,056 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-13 16:29:34,056 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-13 16:29:34,058 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-13 16:29:34,061 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-13 16:29:34,062 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-13 16:29:34,062 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-13 16:29:34,063 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-13 16:29:34,063 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-13 16:29:34,064 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-13 16:29:34,064 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-13 16:29:34,066 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-13 16:29:34,066 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-13 16:29:34,066 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-13 16:29:34,067 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-13 16:29:34,067 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-13 16:29:34,068 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-13 16:29:34,069 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-13 16:29:34,069 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-13 16:29:34,069 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-13 16:29:34,071 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-13 16:29:34,072 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:34,093 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-13 16:29:34,094 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-13 16:29:34,094 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-13 16:29:34,094 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-13 16:29:34,095 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-13 16:29:34,095 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-13 16:29:34,095 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-13 16:29:34,095 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-13 16:29:34,096 INFO L138 SettingsManager]: * Use SBE=true [2022-07-13 16:29:34,096 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-13 16:29:34,096 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-13 16:29:34,097 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-13 16:29:34,097 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-13 16:29:34,097 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-13 16:29:34,097 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-13 16:29:34,097 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-13 16:29:34,097 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-13 16:29:34,097 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-13 16:29:34,097 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-13 16:29:34,098 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-13 16:29:34,098 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-13 16:29:34,098 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-13 16:29:34,098 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-13 16:29:34,098 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-13 16:29:34,099 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-13 16:29:34,099 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-13 16:29:34,099 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-13 16:29:34,099 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-13 16:29:34,099 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-13 16:29:34,100 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-13 16:29:34,100 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-13 16:29:34,100 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-13 16:29:34,100 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-13 16:29:34,100 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 -> 290432887833d1264fa39f327d8609faf39248fe680017022e16e5c72d0bf2b6 [2022-07-13 16:29:34,259 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-13 16:29:34,275 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-13 16:29:34,276 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-13 16:29:34,277 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-13 16:29:34,278 INFO L275 PluginConnector]: CDTParser initialized [2022-07-13 16:29:34,279 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/nla-digbench-scaling/freire1_unwindbound20.c [2022-07-13 16:29:34,330 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d1b86fbb4/ef723c38a559486cad899bbdc58e0a27/FLAG15d349563 [2022-07-13 16:29:34,694 INFO L306 CDTParser]: Found 1 translation units. [2022-07-13 16:29:34,694 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/freire1_unwindbound20.c [2022-07-13 16:29:34,698 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d1b86fbb4/ef723c38a559486cad899bbdc58e0a27/FLAG15d349563 [2022-07-13 16:29:34,707 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d1b86fbb4/ef723c38a559486cad899bbdc58e0a27 [2022-07-13 16:29:34,709 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-13 16:29:34,710 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-13 16:29:34,713 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-13 16:29:34,713 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-13 16:29:34,715 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-13 16:29:34,716 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,717 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5d1be711 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,717 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,722 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-13 16:29:34,732 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-13 16:29:34,874 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_unwindbound20.c[712,725] [2022-07-13 16:29:34,889 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-13 16:29:34,895 INFO L203 MainTranslator]: Completed pre-run [2022-07-13 16:29:34,906 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_unwindbound20.c[712,725] [2022-07-13 16:29:34,912 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-13 16:29:34,921 INFO L208 MainTranslator]: Completed translation [2022-07-13 16:29:34,922 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,922 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-13 16:29:34,923 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-13 16:29:34,923 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-13 16:29:34,924 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-13 16:29:34,929 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,934 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,947 INFO L137 Inliner]: procedures = 14, calls = 9, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 34 [2022-07-13 16:29:34,947 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-13 16:29:34,948 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-13 16:29:34,948 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-13 16:29:34,948 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-13 16:29:34,953 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,953 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,960 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,960 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,970 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,972 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,974 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,978 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-13 16:29:34,979 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-13 16:29:34,980 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-13 16:29:34,980 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-13 16:29:34,981 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,986 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-13 16:29:34,994 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 16:29:35,018 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:35,037 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:35,053 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-13 16:29:35,053 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-13 16:29:35,053 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-13 16:29:35,053 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-13 16:29:35,054 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-07-13 16:29:35,054 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-07-13 16:29:35,096 INFO L234 CfgBuilder]: Building ICFG [2022-07-13 16:29:35,097 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-13 16:29:35,174 INFO L275 CfgBuilder]: Performing block encoding [2022-07-13 16:29:35,178 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-13 16:29:35,178 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-07-13 16:29:35,179 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,180 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-13 16:29:35,181 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-13 16:29:35,181 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-13 16:29:35,183 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-13 16:29:35,183 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,184 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@157b4334 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,184 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,184 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@157b4334 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,184 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,185 INFO L111 eAbstractionObserver]: Analyzing ICFG freire1_unwindbound20.c [2022-07-13 16:29:35,196 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-13 16:29:35,196 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-13 16:29:35,227 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-13 16:29:35,232 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@7a890bb5, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@3b42f5f5 [2022-07-13 16:29:35,233 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-07-13 16:29:35,236 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,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-07-13 16:29:35,240 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 16:29:35,241 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-07-13 16:29:35,241 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 16:29:35,244 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 16:29:35,245 INFO L85 PathProgramCache]: Analyzing trace with hash 1819757606, now seen corresponding path program 1 times [2022-07-13 16:29:35,251 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 16:29:35,251 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [881895324] [2022-07-13 16:29:35,252 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 16:29:35,252 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 16:29:35,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 16:29:35,331 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:35,332 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 16:29:35,332 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [881895324] [2022-07-13 16:29:35,332 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [881895324] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 16:29:35,333 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 16:29:35,333 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-13 16:29:35,334 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1312841322] [2022-07-13 16:29:35,335 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 16:29:35,338 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-07-13 16:29:35,338 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 16:29:35,362 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-07-13 16:29:35,363 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-07-13 16:29:35,365 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:35,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 16:29:35,379 INFO L93 Difference]: Finished difference Result 32 states and 42 transitions. [2022-07-13 16:29:35,381 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-07-13 16:29:35,382 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:35,382 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 16:29:35,387 INFO L225 Difference]: With dead ends: 32 [2022-07-13 16:29:35,387 INFO L226 Difference]: Without dead ends: 13 [2022-07-13 16:29:35,390 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:35,393 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:35,394 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:35,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2022-07-13 16:29:35,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2022-07-13 16:29:35,417 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:35,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 15 transitions. [2022-07-13 16:29:35,419 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 15 transitions. Word has length 7 [2022-07-13 16:29:35,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 16:29:35,420 INFO L495 AbstractCegarLoop]: Abstraction has 13 states and 15 transitions. [2022-07-13 16:29:35,420 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:35,421 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 15 transitions. [2022-07-13 16:29:35,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-07-13 16:29:35,422 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 16:29:35,422 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 16:29:35,422 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-13 16:29:35,422 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 16:29:35,424 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 16:29:35,424 INFO L85 PathProgramCache]: Analyzing trace with hash 178410715, now seen corresponding path program 1 times [2022-07-13 16:29:35,424 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 16:29:35,424 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2112035124] [2022-07-13 16:29:35,425 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 16:29:35,425 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 16:29:35,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 16:29:35,528 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:35,529 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 16:29:35,529 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2112035124] [2022-07-13 16:29:35,529 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2112035124] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 16:29:35,529 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 16:29:35,530 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-13 16:29:35,530 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1527957081] [2022-07-13 16:29:35,530 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 16:29:35,531 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-13 16:29:35,531 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 16:29:35,531 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-13 16:29:35,532 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-13 16:29:35,532 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:35,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 16:29:35,559 INFO L93 Difference]: Finished difference Result 22 states and 24 transitions. [2022-07-13 16:29:35,560 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-13 16:29:35,560 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:35,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 16:29:35,561 INFO L225 Difference]: With dead ends: 22 [2022-07-13 16:29:35,561 INFO L226 Difference]: Without dead ends: 15 [2022-07-13 16:29:35,561 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:35,562 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:35,563 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:35,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2022-07-13 16:29:35,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2022-07-13 16:29:35,565 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:35,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 17 transitions. [2022-07-13 16:29:35,566 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 17 transitions. Word has length 8 [2022-07-13 16:29:35,566 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 16:29:35,566 INFO L495 AbstractCegarLoop]: Abstraction has 15 states and 17 transitions. [2022-07-13 16:29:35,566 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:35,567 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 17 transitions. [2022-07-13 16:29:35,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-07-13 16:29:35,567 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 16:29:35,567 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 16:29:35,567 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-13 16:29:35,568 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 16:29:35,568 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 16:29:35,568 INFO L85 PathProgramCache]: Analyzing trace with hash 180198175, now seen corresponding path program 1 times [2022-07-13 16:29:35,569 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 16:29:35,569 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1187286729] [2022-07-13 16:29:35,569 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 16:29:35,569 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 16:29:35,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 16:29:35,590 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-13 16:29:35,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 16:29:35,618 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-13 16:29:35,618 INFO L271 BasicCegarLoop]: Counterexample is feasible [2022-07-13 16:29:35,619 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-07-13 16:29:35,621 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-07-13 16:29:35,623 INFO L356 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2022-07-13 16:29:35,632 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-07-13 16:29:35,647 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.07 04:29:35 BoogieIcfgContainer [2022-07-13 16:29:35,648 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-07-13 16:29:35,649 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-07-13 16:29:35,649 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-07-13 16:29:35,649 INFO L275 PluginConnector]: Witness Printer initialized [2022-07-13 16:29:35,650 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:29:35,652 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-07-13 16:29:35,652 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-07-13 16:29:35,653 INFO L158 Benchmark]: Toolchain (without parser) took 942.25ms. Allocated memory is still 134.2MB. Free memory was 103.7MB in the beginning and 70.4MB in the end (delta: 33.3MB). Peak memory consumption was 32.8MB. Max. memory is 16.1GB. [2022-07-13 16:29:35,653 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 88.1MB. Free memory was 45.8MB in the beginning and 45.8MB in the end (delta: 44.0kB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-13 16:29:35,654 INFO L158 Benchmark]: CACSL2BoogieTranslator took 209.89ms. Allocated memory is still 134.2MB. Free memory was 103.4MB in the beginning and 110.2MB in the end (delta: -6.8MB). Peak memory consumption was 9.8MB. Max. memory is 16.1GB. [2022-07-13 16:29:35,658 INFO L158 Benchmark]: Boogie Procedure Inliner took 23.85ms. Allocated memory is still 134.2MB. Free memory was 110.2MB in the beginning and 108.8MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-13 16:29:35,661 INFO L158 Benchmark]: Boogie Preprocessor took 30.92ms. Allocated memory is still 134.2MB. Free memory was 108.8MB in the beginning and 107.7MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-13 16:29:35,661 INFO L158 Benchmark]: RCFGBuilder took 200.47ms. Allocated memory is still 134.2MB. Free memory was 107.7MB in the beginning and 99.0MB in the end (delta: 8.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-07-13 16:29:35,662 INFO L158 Benchmark]: TraceAbstraction took 467.44ms. Allocated memory is still 134.2MB. Free memory was 98.3MB in the beginning and 70.7MB in the end (delta: 27.6MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. [2022-07-13 16:29:35,667 INFO L158 Benchmark]: Witness Printer took 3.21ms. Allocated memory is still 134.2MB. Free memory was 70.7MB in the beginning and 70.4MB in the end (delta: 329.4kB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-13 16:29:35,672 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.17ms. Allocated memory is still 88.1MB. Free memory was 45.8MB in the beginning and 45.8MB in the end (delta: 44.0kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 209.89ms. Allocated memory is still 134.2MB. Free memory was 103.4MB in the beginning and 110.2MB in the end (delta: -6.8MB). Peak memory consumption was 9.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 23.85ms. Allocated memory is still 134.2MB. Free memory was 110.2MB in the beginning and 108.8MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 30.92ms. Allocated memory is still 134.2MB. Free memory was 108.8MB in the beginning and 107.7MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 200.47ms. Allocated memory is still 134.2MB. Free memory was 107.7MB in the beginning and 99.0MB in the end (delta: 8.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 467.44ms. Allocated memory is still 134.2MB. Free memory was 98.3MB in the beginning and 70.7MB in the end (delta: 27.6MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. * Witness Printer took 3.21ms. Allocated memory is still 134.2MB. Free memory was 70.7MB in the beginning and 70.4MB in the end (delta: 329.4kB). 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++<20 [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:35,706 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_unwindbound20.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 290432887833d1264fa39f327d8609faf39248fe680017022e16e5c72d0bf2b6 --- Real Ultimate output --- This is Ultimate 0.2.2-?-f4b24e3 [2022-07-13 16:29:37,393 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-13 16:29:37,395 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-13 16:29:37,425 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-13 16:29:37,426 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-13 16:29:37,427 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-13 16:29:37,430 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-13 16:29:37,433 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-13 16:29:37,434 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-13 16:29:37,438 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-13 16:29:37,439 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-13 16:29:37,440 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-13 16:29:37,441 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-13 16:29:37,442 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-13 16:29:37,443 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-13 16:29:37,447 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-13 16:29:37,448 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-13 16:29:37,449 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-13 16:29:37,450 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-13 16:29:37,455 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-13 16:29:37,456 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-13 16:29:37,457 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-13 16:29:37,458 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-13 16:29:37,459 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-13 16:29:37,460 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-13 16:29:37,466 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-13 16:29:37,466 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-13 16:29:37,466 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-13 16:29:37,467 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-13 16:29:37,467 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-13 16:29:37,468 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-13 16:29:37,468 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-13 16:29:37,470 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-13 16:29:37,470 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-13 16:29:37,471 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-13 16:29:37,472 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-13 16:29:37,472 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-13 16:29:37,473 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-13 16:29:37,473 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-13 16:29:37,473 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-13 16:29:37,474 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-13 16:29:37,475 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-13 16:29:37,481 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:37,507 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-13 16:29:37,508 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-13 16:29:37,508 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-13 16:29:37,508 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-13 16:29:37,509 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-13 16:29:37,509 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-13 16:29:37,510 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-13 16:29:37,510 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-13 16:29:37,510 INFO L138 SettingsManager]: * Use SBE=true [2022-07-13 16:29:37,511 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-13 16:29:37,511 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-13 16:29:37,511 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-13 16:29:37,512 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-13 16:29:37,512 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-13 16:29:37,512 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-13 16:29:37,519 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-13 16:29:37,519 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-07-13 16:29:37,519 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-07-13 16:29:37,519 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-07-13 16:29:37,519 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-13 16:29:37,520 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-13 16:29:37,520 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-13 16:29:37,520 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-13 16:29:37,520 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-13 16:29:37,520 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-13 16:29:37,520 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-13 16:29:37,521 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-13 16:29:37,521 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-13 16:29:37,521 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-13 16:29:37,521 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-13 16:29:37,522 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2022-07-13 16:29:37,522 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-07-13 16:29:37,522 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-13 16:29:37,522 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-13 16:29:37,522 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-13 16:29:37,523 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-07-13 16:29:37,523 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 -> 290432887833d1264fa39f327d8609faf39248fe680017022e16e5c72d0bf2b6 [2022-07-13 16:29:37,791 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-13 16:29:37,822 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-13 16:29:37,824 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-13 16:29:37,824 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-13 16:29:37,825 INFO L275 PluginConnector]: CDTParser initialized [2022-07-13 16:29:37,826 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/nla-digbench-scaling/freire1_unwindbound20.c [2022-07-13 16:29:37,877 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/266f72baf/386997265be247dfb360b4b44c76ca76/FLAGb97de6456 [2022-07-13 16:29:38,242 INFO L306 CDTParser]: Found 1 translation units. [2022-07-13 16:29:38,242 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/freire1_unwindbound20.c [2022-07-13 16:29:38,247 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/266f72baf/386997265be247dfb360b4b44c76ca76/FLAGb97de6456 [2022-07-13 16:29:38,261 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/266f72baf/386997265be247dfb360b4b44c76ca76 [2022-07-13 16:29:38,263 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-13 16:29:38,264 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-13 16:29:38,267 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-13 16:29:38,267 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-13 16:29:38,270 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-13 16:29:38,270 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.07 04:29:38" (1/1) ... [2022-07-13 16:29:38,272 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2494dc60 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 04:29:38, skipping insertion in model container [2022-07-13 16:29:38,272 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.07 04:29:38" (1/1) ... [2022-07-13 16:29:38,276 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-13 16:29:38,287 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-13 16:29:38,414 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_unwindbound20.c[712,725] [2022-07-13 16:29:38,430 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-13 16:29:38,447 INFO L203 MainTranslator]: Completed pre-run [2022-07-13 16:29:38,490 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_unwindbound20.c[712,725] [2022-07-13 16:29:38,500 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-13 16:29:38,512 INFO L208 MainTranslator]: Completed translation [2022-07-13 16:29:38,513 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 04:29:38 WrapperNode [2022-07-13 16:29:38,513 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-13 16:29:38,514 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-13 16:29:38,514 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-13 16:29:38,514 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-13 16:29:38,519 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:38" (1/1) ... [2022-07-13 16:29:38,531 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:38" (1/1) ... [2022-07-13 16:29:38,545 INFO L137 Inliner]: procedures = 15, calls = 9, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 35 [2022-07-13 16:29:38,546 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-13 16:29:38,547 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-13 16:29:38,547 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-13 16:29:38,547 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-13 16:29:38,553 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:38" (1/1) ... [2022-07-13 16:29:38,554 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:38" (1/1) ... [2022-07-13 16:29:38,558 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:38" (1/1) ... [2022-07-13 16:29:38,559 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:38" (1/1) ... [2022-07-13 16:29:38,566 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:38" (1/1) ... [2022-07-13 16:29:38,572 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:38" (1/1) ... [2022-07-13 16:29:38,574 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:38" (1/1) ... [2022-07-13 16:29:38,577 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-13 16:29:38,578 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-13 16:29:38,579 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-13 16:29:38,579 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-13 16:29:38,580 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 04:29:38" (1/1) ... [2022-07-13 16:29:38,584 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-13 16:29:38,591 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 16:29:38,601 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:38,612 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:38,632 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-13 16:29:38,632 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-07-13 16:29:38,632 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-13 16:29:38,633 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-13 16:29:38,633 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-07-13 16:29:38,633 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-07-13 16:29:38,673 INFO L234 CfgBuilder]: Building ICFG [2022-07-13 16:29:38,674 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-13 16:29:39,716 INFO L275 CfgBuilder]: Performing block encoding [2022-07-13 16:29:39,720 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-13 16:29:39,720 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-07-13 16:29:39,722 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.07 04:29:39 BoogieIcfgContainer [2022-07-13 16:29:39,722 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-13 16:29:39,723 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-13 16:29:39,723 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-13 16:29:39,725 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-13 16:29:39,725 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.07 04:29:38" (1/3) ... [2022-07-13 16:29:39,726 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6fa2db31 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.07 04:29:39, skipping insertion in model container [2022-07-13 16:29:39,726 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 04:29:38" (2/3) ... [2022-07-13 16:29:39,726 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6fa2db31 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.07 04:29:39, skipping insertion in model container [2022-07-13 16:29:39,726 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.07 04:29:39" (3/3) ... [2022-07-13 16:29:39,727 INFO L111 eAbstractionObserver]: Analyzing ICFG freire1_unwindbound20.c [2022-07-13 16:29:39,738 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-13 16:29:39,738 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-13 16:29:39,773 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-13 16:29:39,778 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@4294d322, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@7c46d8c5 [2022-07-13 16:29:39,778 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-07-13 16:29:39,782 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:39,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-07-13 16:29:39,787 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 16:29:39,788 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-07-13 16:29:39,788 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 16:29:39,791 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 16:29:39,792 INFO L85 PathProgramCache]: Analyzing trace with hash 1819757606, now seen corresponding path program 1 times [2022-07-13 16:29:39,799 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-13 16:29:39,799 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [496987074] [2022-07-13 16:29:39,799 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 16:29:39,800 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-13 16:29:39,800 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-13 16:29:39,801 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:39,802 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:40,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 16:29:40,093 INFO L263 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 1 conjunts are in the unsatisfiable core [2022-07-13 16:29:40,096 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 16:29:40,109 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:40,110 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 16:29:40,110 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-13 16:29:40,111 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [496987074] [2022-07-13 16:29:40,111 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [496987074] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 16:29:40,111 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 16:29:40,111 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-13 16:29:40,113 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1982373782] [2022-07-13 16:29:40,113 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 16:29:40,116 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-07-13 16:29:40,116 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-13 16:29:40,137 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-07-13 16:29:40,137 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-07-13 16:29:40,139 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:40,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 16:29:40,153 INFO L93 Difference]: Finished difference Result 32 states and 42 transitions. [2022-07-13 16:29:40,154 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-07-13 16:29:40,155 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:40,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 16:29:40,163 INFO L225 Difference]: With dead ends: 32 [2022-07-13 16:29:40,164 INFO L226 Difference]: Without dead ends: 13 [2022-07-13 16:29:40,165 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:40,168 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:40,169 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:40,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2022-07-13 16:29:40,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2022-07-13 16:29:40,188 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:40,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 15 transitions. [2022-07-13 16:29:40,190 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 15 transitions. Word has length 7 [2022-07-13 16:29:40,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 16:29:40,191 INFO L495 AbstractCegarLoop]: Abstraction has 13 states and 15 transitions. [2022-07-13 16:29:40,191 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:40,191 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 15 transitions. [2022-07-13 16:29:40,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-07-13 16:29:40,191 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 16:29:40,192 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 16:29:40,208 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2022-07-13 16:29:40,394 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:40,394 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 16:29:40,395 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 16:29:40,395 INFO L85 PathProgramCache]: Analyzing trace with hash 178410715, now seen corresponding path program 1 times [2022-07-13 16:29:40,395 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-13 16:29:40,396 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2054566130] [2022-07-13 16:29:40,396 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 16:29:40,396 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-13 16:29:40,396 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-13 16:29:40,397 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:40,398 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:40,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 16:29:40,685 INFO L263 TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-13 16:29:40,686 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 16:29:40,728 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:40,729 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 16:29:40,729 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-13 16:29:40,730 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2054566130] [2022-07-13 16:29:40,730 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2054566130] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 16:29:40,730 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 16:29:40,730 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-13 16:29:40,731 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [389052195] [2022-07-13 16:29:40,731 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 16:29:40,736 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-13 16:29:40,737 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-13 16:29:40,738 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-13 16:29:40,738 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-13 16:29:40,740 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:41,826 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.08s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-07-13 16:29:41,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 16:29:41,863 INFO L93 Difference]: Finished difference Result 22 states and 24 transitions. [2022-07-13 16:29:41,864 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-13 16:29:41,864 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:41,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 16:29:41,865 INFO L225 Difference]: With dead ends: 22 [2022-07-13 16:29:41,865 INFO L226 Difference]: Without dead ends: 15 [2022-07-13 16:29:41,865 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:41,866 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 0 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s 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, 1.1s IncrementalHoareTripleChecker+Time [2022-07-13 16:29:41,866 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 35 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-07-13 16:29:41,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2022-07-13 16:29:41,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2022-07-13 16:29:41,869 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:41,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 17 transitions. [2022-07-13 16:29:41,870 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 17 transitions. Word has length 8 [2022-07-13 16:29:41,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 16:29:41,870 INFO L495 AbstractCegarLoop]: Abstraction has 15 states and 17 transitions. [2022-07-13 16:29:41,870 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:41,870 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 17 transitions. [2022-07-13 16:29:41,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-07-13 16:29:41,871 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 16:29:41,871 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 16:29:41,886 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2022-07-13 16:29:42,084 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:42,085 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 16:29:42,085 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 16:29:42,086 INFO L85 PathProgramCache]: Analyzing trace with hash 180198175, now seen corresponding path program 1 times [2022-07-13 16:29:42,086 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-13 16:29:42,086 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [273272221] [2022-07-13 16:29:42,086 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 16:29:42,086 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-13 16:29:42,086 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-13 16:29:42,087 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:42,088 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:45,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 16:29:45,123 INFO L263 TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 6 conjunts are in the unsatisfiable core [2022-07-13 16:29:45,124 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 16:30:05,932 WARN L833 $PredicateComparison]: unable to prove that (or (= |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 ((.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| (_ bv0 32)))) is different from false [2022-07-13 16:30:14,181 WARN L833 $PredicateComparison]: unable to prove that (or (= (_ bv1 32) c___VERIFIER_assert_~cond) (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))) is different from false [2022-07-13 16:30:20,618 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:22,655 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:22,656 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:22,656 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 16:30:22,656 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-13 16:30:22,656 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [273272221] [2022-07-13 16:30:22,656 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [273272221] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 16:30:22,656 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 16:30:22,656 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-13 16:30:22,656 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1262064709] [2022-07-13 16:30:22,657 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 16:30:22,657 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-13 16:30:22,657 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-13 16:30:22,657 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-13 16:30:22,658 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=8, Unknown=4, NotChecked=18, Total=42 [2022-07-13 16:30:22,658 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:24,149 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.42s 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:26,384 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.23s 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:28,515 WARN L833 $PredicateComparison]: unable to prove that (and (or (= |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 ((.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| (_ bv0 32)))) (= c_currentRoundingMode roundNearestTiesToEven)) is different from false [2022-07-13 16:30:31,282 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.13s 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:33,512 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.23s 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:35,537 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s 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,737 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:38,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 16:30:38,570 INFO L93 Difference]: Finished difference Result 28 states and 31 transitions. [2022-07-13 16:30:38,582 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-13 16:30:38,582 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:38,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 16:30:38,583 INFO L225 Difference]: With dead ends: 28 [2022-07-13 16:30:38,583 INFO L226 Difference]: Without dead ends: 24 [2022-07-13 16:30:38,583 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 13.3s TimeCoverageRelationStatistics Valid=14, Invalid=9, Unknown=5, NotChecked=28, Total=56 [2022-07-13 16:30:38,584 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 9 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 5 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 13.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 53 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 5 IncrementalHoareTripleChecker+Unknown, 47 IncrementalHoareTripleChecker+Unchecked, 13.8s IncrementalHoareTripleChecker+Time [2022-07-13 16:30:38,584 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 53 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 5 Unknown, 47 Unchecked, 13.8s Time] [2022-07-13 16:30:38,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2022-07-13 16:30:38,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 22. [2022-07-13 16:30:38,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 16 states have (on average 1.25) internal successors, (20), 16 states have internal predecessors, (20), 4 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-13 16:30:38,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 26 transitions. [2022-07-13 16:30:38,588 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 26 transitions. Word has length 8 [2022-07-13 16:30:38,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 16:30:38,589 INFO L495 AbstractCegarLoop]: Abstraction has 22 states and 26 transitions. [2022-07-13 16:30:38,589 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:38,589 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 26 transitions. [2022-07-13 16:30:38,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-07-13 16:30:38,590 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 16:30:38,590 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 16:30:38,605 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2022-07-13 16:30:38,792 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:38,792 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 16:30:38,793 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 16:30:38,793 INFO L85 PathProgramCache]: Analyzing trace with hash 1780785341, now seen corresponding path program 1 times [2022-07-13 16:30:38,793 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-13 16:30:38,793 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [475306532] [2022-07-13 16:30:38,793 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 16:30:38,793 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-13 16:30:38,793 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-13 16:30:38,797 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:38,800 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:39,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 16:30:39,090 INFO L263 TraceCheckSpWp]: Trace formula consists of 35 conjuncts, 6 conjunts are in the unsatisfiable core [2022-07-13 16:30:39,091 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 16:30:45,381 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:47,445 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:30:59,878 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:08,189 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:08,196 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:08,197 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 16:31:33,116 WARN L233 SmtUtils]: Spent 16.52s 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:49,639 WARN L233 SmtUtils]: Spent 16.52s 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:55,911 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:06,335 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:06,344 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:06,344 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-13 16:32:06,344 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [475306532] [2022-07-13 16:32:06,344 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [475306532] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 16:32:06,344 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-13 16:32:06,344 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 10 [2022-07-13 16:32:06,344 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1839570669] [2022-07-13 16:32:06,344 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-13 16:32:06,345 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-13 16:32:06,345 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-13 16:32:06,345 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-13 16:32:06,345 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=17, Unknown=6, NotChecked=50, Total=90 [2022-07-13 16:32:06,345 INFO L87 Difference]: Start difference. First operand 22 states and 26 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:08,486 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:10,494 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:12,654 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:14,755 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:16,828 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:18,910 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:20,975 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:20,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 16:32:20,978 INFO L93 Difference]: Finished difference Result 27 states and 31 transitions. [2022-07-13 16:32:20,978 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-13 16:32:20,978 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:20,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 16:32:20,978 INFO L225 Difference]: With dead ends: 27 [2022-07-13 16:32:20,978 INFO L226 Difference]: Without dead ends: 19 [2022-07-13 16:32:20,981 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:20,982 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:20,982 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:20,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2022-07-13 16:32:20,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 18. [2022-07-13 16:32:20,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 14 states have internal predecessors, (15), 3 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-13 16:32:20,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 20 transitions. [2022-07-13 16:32:20,985 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 20 transitions. Word has length 14 [2022-07-13 16:32:20,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 16:32:20,985 INFO L495 AbstractCegarLoop]: Abstraction has 18 states and 20 transitions. [2022-07-13 16:32:20,986 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:20,986 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 20 transitions. [2022-07-13 16:32:20,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-07-13 16:32:20,986 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 16:32:20,986 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 16:32:21,001 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2022-07-13 16:32:21,186 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:21,187 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 16:32:21,187 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 16:32:21,187 INFO L85 PathProgramCache]: Analyzing trace with hash -1542398814, now seen corresponding path program 1 times [2022-07-13 16:32:21,187 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-13 16:32:21,187 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1066686662] [2022-07-13 16:32:21,188 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 16:32:21,188 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-13 16:32:21,188 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-13 16:32:21,189 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:21,189 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:21,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 16:32:21,783 INFO L263 TraceCheckSpWp]: Trace formula consists of 40 conjuncts, 5 conjunts are in the unsatisfiable core [2022-07-13 16:32:21,785 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 16:32:21,980 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:21,980 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 16:32:22,197 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:22,197 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-13 16:32:22,197 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1066686662] [2022-07-13 16:32:22,197 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1066686662] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 16:32:22,197 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-13 16:32:22,197 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5] total 8 [2022-07-13 16:32:22,197 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1449422256] [2022-07-13 16:32:22,198 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-13 16:32:22,198 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-13 16:32:22,198 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-13 16:32:22,198 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-13 16:32:22,198 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2022-07-13 16:32:22,198 INFO L87 Difference]: Start difference. First operand 18 states and 20 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:23,253 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.05s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-07-13 16:32:25,494 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:27,725 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:30,109 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:32,115 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:34,331 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:36,335 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:38,630 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.15s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-07-13 16:32:40,637 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:42,643 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:44,854 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:46,864 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-07-13 16:32:48,867 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:48,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 16:32:48,964 INFO L93 Difference]: Finished difference Result 50 states and 53 transitions. [2022-07-13 16:32:48,964 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-13 16:32:48,964 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:48,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 16:32:48,965 INFO L225 Difference]: With dead ends: 50 [2022-07-13 16:32:48,965 INFO L226 Difference]: Without dead ends: 43 [2022-07-13 16:32:48,965 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:48,966 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 25 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 11 mSolverCounterUnsat, 12 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 26.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 66 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 12 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 26.5s IncrementalHoareTripleChecker+Time [2022-07-13 16:32:48,966 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 66 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 21 Invalid, 12 Unknown, 0 Unchecked, 26.5s Time] [2022-07-13 16:32:48,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2022-07-13 16:32:48,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 39. [2022-07-13 16:32:48,971 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:48,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 42 transitions. [2022-07-13 16:32:48,971 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 42 transitions. Word has length 16 [2022-07-13 16:32:48,972 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 16:32:48,972 INFO L495 AbstractCegarLoop]: Abstraction has 39 states and 42 transitions. [2022-07-13 16:32:48,972 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:48,972 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 42 transitions. [2022-07-13 16:32:48,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-07-13 16:32:48,972 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 16:32:48,972 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 16:32:48,996 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:49,183 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:49,184 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 16:32:49,184 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 16:32:49,184 INFO L85 PathProgramCache]: Analyzing trace with hash -1540611354, now seen corresponding path program 1 times [2022-07-13 16:32:49,184 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-13 16:32:49,185 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1626755276] [2022-07-13 16:32:49,185 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 16:32:49,185 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-13 16:32:49,185 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-13 16:32:49,186 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-13 16:32:49,188 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,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 16:32:56,769 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-13 16:33:09,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 16:33:09,446 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2022-07-13 16:33:09,446 INFO L271 BasicCegarLoop]: Counterexample is feasible [2022-07-13 16:33:09,447 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-07-13 16:33:09,488 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:09,648 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:09,651 INFO L356 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2022-07-13 16:33:09,653 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-07-13 16:33:09,678 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.07 04:33:09 BoogieIcfgContainer [2022-07-13 16:33:09,678 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-07-13 16:33:09,678 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-07-13 16:33:09,678 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-07-13 16:33:09,678 INFO L275 PluginConnector]: Witness Printer initialized [2022-07-13 16:33:09,678 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:39" (3/4) ... [2022-07-13 16:33:09,680 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2022-07-13 16:33:09,702 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2022-07-13 16:33:09,702 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-07-13 16:33:09,703 INFO L158 Benchmark]: Toolchain (without parser) took 211438.20ms. Allocated memory was 58.7MB in the beginning and 71.3MB in the end (delta: 12.6MB). Free memory was 37.4MB in the beginning and 42.1MB in the end (delta: -4.7MB). Peak memory consumption was 7.4MB. Max. memory is 16.1GB. [2022-07-13 16:33:09,703 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 58.7MB. Free memory was 40.5MB in the beginning and 40.5MB in the end (delta: 43.9kB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-13 16:33:09,703 INFO L158 Benchmark]: CACSL2BoogieTranslator took 245.90ms. Allocated memory is still 58.7MB. Free memory was 37.2MB in the beginning and 41.3MB in the end (delta: -4.2MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2022-07-13 16:33:09,703 INFO L158 Benchmark]: Boogie Procedure Inliner took 31.83ms. Allocated memory is still 58.7MB. Free memory was 41.2MB in the beginning and 39.8MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-13 16:33:09,703 INFO L158 Benchmark]: Boogie Preprocessor took 30.71ms. Allocated memory is still 58.7MB. Free memory was 39.6MB in the beginning and 38.5MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-13 16:33:09,704 INFO L158 Benchmark]: RCFGBuilder took 1143.86ms. Allocated memory is still 58.7MB. Free memory was 38.4MB in the beginning and 29.6MB in the end (delta: 8.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-07-13 16:33:09,704 INFO L158 Benchmark]: TraceAbstraction took 209954.73ms. Allocated memory was 58.7MB in the beginning and 71.3MB in the end (delta: 12.6MB). Free memory was 29.0MB in the beginning and 44.1MB in the end (delta: -15.1MB). Peak memory consumption was 63.9kB. Max. memory is 16.1GB. [2022-07-13 16:33:09,704 INFO L158 Benchmark]: Witness Printer took 24.06ms. Allocated memory is still 71.3MB. Free memory was 44.1MB in the beginning and 42.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-13 16:33:09,705 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 58.7MB. Free memory was 40.5MB in the beginning and 40.5MB in the end (delta: 43.9kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 245.90ms. Allocated memory is still 58.7MB. Free memory was 37.2MB in the beginning and 41.3MB in the end (delta: -4.2MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 31.83ms. Allocated memory is still 58.7MB. Free memory was 41.2MB in the beginning and 39.8MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 30.71ms. Allocated memory is still 58.7MB. Free memory was 39.6MB in the beginning and 38.5MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 1143.86ms. Allocated memory is still 58.7MB. Free memory was 38.4MB in the beginning and 29.6MB in the end (delta: 8.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 209954.73ms. Allocated memory was 58.7MB in the beginning and 71.3MB in the end (delta: 12.6MB). Free memory was 29.0MB in the beginning and 44.1MB in the end (delta: -15.1MB). Peak memory consumption was 63.9kB. Max. memory is 16.1GB. * Witness Printer took 24.06ms. Allocated memory is still 71.3MB. Free memory was 44.1MB in the beginning and 42.1MB in the end (delta: 2.1MB). 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++<20 [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++<20 [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: 209.9s, OverallIterations: 6, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 58.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 19 mSolverCounterUnknown, 35 SdHoareTripleChecker+Valid, 45.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 34 mSDsluCounter, 214 SdHoareTripleChecker+Invalid, 44.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 87 IncrementalHoareTripleChecker+Unchecked, 144 mSDsCounter, 13 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 36 IncrementalHoareTripleChecker+Invalid, 155 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 13 mSolverCounterUnsat, 70 mSDtfsCounter, 36 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 86 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 13 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 36.7s 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, 7 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 11.9s SatisfiabilityAnalysisTime, 125.4s InterpolantComputationTime, 69 NumberOfCodeBlocks, 69 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 76 ConstructedInterpolants, 8 QuantifiedInterpolants, 546 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:09,873 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