./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/combinations/gcd_4+newton_1_6.i --full-output -ea --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 03d7b7b3 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -ea -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/combinations/gcd_4+newton_1_6.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.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 8d5852a96a997fd819a9dfc3e184ca8c6360d14970e60ecfb10d610384c98f94 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 19:35:52,970 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 19:35:52,974 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 19:35:52,998 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 19:35:52,999 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 19:35:53,000 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 19:35:53,001 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 19:35:53,002 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 19:35:53,003 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 19:35:53,004 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 19:35:53,004 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 19:35:53,005 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 19:35:53,005 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 19:35:53,006 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 19:35:53,007 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 19:35:53,020 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 19:35:53,021 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 19:35:53,022 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 19:35:53,023 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 19:35:53,024 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 19:35:53,025 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 19:35:53,026 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 19:35:53,027 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 19:35:53,027 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 19:35:53,029 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 19:35:53,030 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 19:35:53,030 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 19:35:53,030 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 19:35:53,031 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 19:35:53,032 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 19:35:53,032 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 19:35:53,032 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 19:35:53,033 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 19:35:53,033 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 19:35:53,034 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 19:35:53,034 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 19:35:53,035 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 19:35:53,035 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 19:35:53,035 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 19:35:53,036 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 19:35:53,036 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 19:35:53,037 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-02-20 19:35:53,056 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 19:35:53,056 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 19:35:53,057 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 19:35:53,057 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 19:35:53,057 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 19:35:53,057 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 19:35:53,058 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 19:35:53,058 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 19:35:53,058 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 19:35:53,058 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 19:35:53,058 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 19:35:53,059 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 19:35:53,059 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 19:35:53,059 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 19:35:53,059 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 19:35:53,059 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 19:35:53,059 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 19:35:53,060 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 19:35:53,060 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 19:35:53,064 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 19:35:53,065 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 19:35:53,065 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 19:35:53,065 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 19:35:53,065 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 19:35:53,065 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 19:35:53,065 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 19:35:53,066 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 19:35:53,066 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 19:35:53,066 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-20 19:35:53,066 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-20 19:35:53,066 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 19:35:53,066 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 19:35:53,067 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 19:35:53,067 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 -> 8d5852a96a997fd819a9dfc3e184ca8c6360d14970e60ecfb10d610384c98f94 [2022-02-20 19:35:53,281 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 19:35:53,297 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 19:35:53,300 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 19:35:53,300 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 19:35:53,301 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 19:35:53,302 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/combinations/gcd_4+newton_1_6.i [2022-02-20 19:35:53,357 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6e9e9332b/667291043a6348548983e8e1525a543b/FLAG690af687b [2022-02-20 19:35:53,648 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 19:35:53,648 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/gcd_4+newton_1_6.i [2022-02-20 19:35:53,654 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6e9e9332b/667291043a6348548983e8e1525a543b/FLAG690af687b [2022-02-20 19:35:54,086 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6e9e9332b/667291043a6348548983e8e1525a543b [2022-02-20 19:35:54,089 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 19:35:54,092 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 19:35:54,094 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 19:35:54,094 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 19:35:54,096 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 19:35:54,097 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 07:35:54" (1/1) ... [2022-02-20 19:35:54,098 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4d0b41f3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:35:54, skipping insertion in model container [2022-02-20 19:35:54,098 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 07:35:54" (1/1) ... [2022-02-20 19:35:54,102 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 19:35:54,119 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 19:35:54,301 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/combinations/gcd_4+newton_1_6.i[1224,1237] [2022-02-20 19:35:54,337 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/combinations/gcd_4+newton_1_6.i[2806,2819] [2022-02-20 19:35:54,340 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 19:35:54,349 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 19:35:54,368 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/combinations/gcd_4+newton_1_6.i[1224,1237] [2022-02-20 19:35:54,389 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/combinations/gcd_4+newton_1_6.i[2806,2819] [2022-02-20 19:35:54,393 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 19:35:54,405 INFO L208 MainTranslator]: Completed translation [2022-02-20 19:35:54,405 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:35:54 WrapperNode [2022-02-20 19:35:54,406 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 19:35:54,406 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 19:35:54,407 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 19:35:54,407 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 19:35:54,412 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:35:54" (1/1) ... [2022-02-20 19:35:54,424 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:35:54" (1/1) ... [2022-02-20 19:35:54,454 INFO L137 Inliner]: procedures = 27, calls = 16, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 73 [2022-02-20 19:35:54,455 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 19:35:54,456 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 19:35:54,456 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 19:35:54,456 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 19:35:54,462 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:35:54" (1/1) ... [2022-02-20 19:35:54,463 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:35:54" (1/1) ... [2022-02-20 19:35:54,465 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:35:54" (1/1) ... [2022-02-20 19:35:54,465 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:35:54" (1/1) ... [2022-02-20 19:35:54,472 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:35:54" (1/1) ... [2022-02-20 19:35:54,476 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:35:54" (1/1) ... [2022-02-20 19:35:54,481 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:35:54" (1/1) ... [2022-02-20 19:35:54,483 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 19:35:54,483 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 19:35:54,483 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 19:35:54,484 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 19:35:54,488 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:35:54" (1/1) ... [2022-02-20 19:35:54,493 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 19:35:54,510 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 19:35:54,521 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-02-20 19:35:54,530 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-02-20 19:35:54,555 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 19:35:54,556 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-20 19:35:54,556 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 19:35:54,556 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 19:35:54,556 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-02-20 19:35:54,558 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-02-20 19:35:54,603 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 19:35:54,604 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 19:35:54,760 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 19:35:54,765 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 19:35:54,765 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-02-20 19:35:54,767 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 07:35:54 BoogieIcfgContainer [2022-02-20 19:35:54,767 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 19:35:54,768 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 19:35:54,768 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 19:35:54,776 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 19:35:54,776 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 07:35:54" (1/3) ... [2022-02-20 19:35:54,776 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5daaf73b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 07:35:54, skipping insertion in model container [2022-02-20 19:35:54,777 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:35:54" (2/3) ... [2022-02-20 19:35:54,777 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5daaf73b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 07:35:54, skipping insertion in model container [2022-02-20 19:35:54,777 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 07:35:54" (3/3) ... [2022-02-20 19:35:54,778 INFO L111 eAbstractionObserver]: Analyzing ICFG gcd_4+newton_1_6.i [2022-02-20 19:35:54,781 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 19:35:54,783 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-02-20 19:35:54,824 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 19:35:54,833 INFO L339 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, mLoopAccelerationTechnique=FAST_UPR [2022-02-20 19:35:54,833 INFO L340 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2022-02-20 19:35:54,848 INFO L276 IsEmpty]: Start isEmpty. Operand has 33 states, 26 states have (on average 1.4615384615384615) internal successors, (38), 28 states have internal predecessors, (38), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-20 19:35:54,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-02-20 19:35:54,851 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:35:54,851 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 19:35:54,852 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:35:54,870 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:35:54,874 INFO L85 PathProgramCache]: Analyzing trace with hash -1386425161, now seen corresponding path program 1 times [2022-02-20 19:35:54,883 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:35:54,883 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1221166544] [2022-02-20 19:35:54,884 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:35:54,885 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:35:54,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:35:55,022 INFO L290 TraceCheckUtils]: 0: Hoare triple {36#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(8, 2);call #Ultimate.allocInit(12, 3); {36#true} is VALID [2022-02-20 19:35:55,024 INFO L290 TraceCheckUtils]: 1: Hoare triple {36#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet9#1, main_#t~ret10#1, main_#t~ret11#1;assume -2147483648 <= main_#t~nondet9#1 && main_#t~nondet9#1 <= 2147483647; {36#true} is VALID [2022-02-20 19:35:55,025 INFO L290 TraceCheckUtils]: 2: Hoare triple {36#true} assume !(0 != main_#t~nondet9#1);havoc main_#t~nondet9#1;assume { :begin_inline_main2 } true;havoc main2_#res#1;havoc main2_#t~nondet6#1, main2_#t~ret7#1, main2_#t~ret8#1, main2_~IN~0#1, main2_~x~1#1;main2_~IN~0#1 := main2_#t~nondet6#1;havoc main2_#t~nondet6#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := (if ~someBinaryFLOATComparisonOperation(main2_~IN~0#1, ~someUnaryFLOAToperation(1.2)) && ~someBinaryFLOATComparisonOperation(main2_~IN~0#1, 1.2) then 1 else 0);havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {36#true} is VALID [2022-02-20 19:35:55,026 INFO L290 TraceCheckUtils]: 3: Hoare triple {36#true} assume 0 == assume_abort_if_not_~cond#1;assume false; {37#false} is VALID [2022-02-20 19:35:55,026 INFO L290 TraceCheckUtils]: 4: Hoare triple {37#false} assume { :end_inline_assume_abort_if_not } true;assume { :begin_inline_f } true;f_#in~x#1 := main2_~IN~0#1;havoc f_#res#1;havoc f_~x#1;f_~x#1 := f_#in~x#1;f_#res#1 := ~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(f_~x#1, ~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(f_~x#1, f_~x#1), f_~x#1), 6.0)), ~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(f_~x#1, f_~x#1), f_~x#1), f_~x#1), f_~x#1), 120.0)), ~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(f_~x#1, f_~x#1), f_~x#1), f_~x#1), f_~x#1), f_~x#1), f_~x#1), 5040.0)); {37#false} is VALID [2022-02-20 19:35:55,026 INFO L290 TraceCheckUtils]: 5: Hoare triple {37#false} main2_#t~ret7#1 := f_#res#1;assume { :end_inline_f } true;assume { :begin_inline_fp } true;fp_#in~x#1 := main2_~IN~0#1;havoc fp_#res#1;havoc fp_~x#1;fp_~x#1 := fp_#in~x#1;fp_#res#1 := ~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(~convertINTToFLOAT(1), ~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(fp_~x#1, fp_~x#1), 2.0)), ~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(fp_~x#1, fp_~x#1), fp_~x#1), fp_~x#1), 24.0)), ~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(fp_~x#1, fp_~x#1), fp_~x#1), fp_~x#1), fp_~x#1), fp_~x#1), 720.0)); {37#false} is VALID [2022-02-20 19:35:55,027 INFO L290 TraceCheckUtils]: 6: Hoare triple {37#false} main2_#t~ret8#1 := fp_#res#1;assume { :end_inline_fp } true;main2_~x~1#1 := ~someBinaryArithmeticFLOAToperation(main2_~IN~0#1, ~someBinaryArithmeticFLOAToperation(main2_#t~ret7#1, main2_#t~ret8#1));havoc main2_#t~ret7#1;havoc main2_#t~ret8#1; {37#false} is VALID [2022-02-20 19:35:55,027 INFO L290 TraceCheckUtils]: 7: Hoare triple {37#false} assume !~someBinaryDOUBLEComparisonOperation(main2_~x~1#1, 0.1); {37#false} is VALID [2022-02-20 19:35:55,027 INFO L290 TraceCheckUtils]: 8: Hoare triple {37#false} assume !false; {37#false} is VALID [2022-02-20 19:35:55,028 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 19:35:55,029 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:35:55,029 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1221166544] [2022-02-20 19:35:55,029 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1221166544] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:35:55,030 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:35:55,030 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-20 19:35:55,032 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1244246043] [2022-02-20 19:35:55,032 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:35:55,037 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2022-02-20 19:35:55,037 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:35:55,040 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:35:55,059 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 9 edges. 9 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:35:55,060 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-02-20 19:35:55,060 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:35:55,077 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-02-20 19:35:55,077 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-02-20 19:35:55,079 INFO L87 Difference]: Start difference. First operand has 33 states, 26 states have (on average 1.4615384615384615) internal successors, (38), 28 states have internal predecessors, (38), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:35:55,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:35:55,123 INFO L93 Difference]: Finished difference Result 57 states and 74 transitions. [2022-02-20 19:35:55,123 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-20 19:35:55,124 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2022-02-20 19:35:55,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:35:55,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:35:55,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 74 transitions. [2022-02-20 19:35:55,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:35:55,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 74 transitions. [2022-02-20 19:35:55,133 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 74 transitions. [2022-02-20 19:35:55,191 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 74 edges. 74 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:35:55,196 INFO L225 Difference]: With dead ends: 57 [2022-02-20 19:35:55,196 INFO L226 Difference]: Without dead ends: 26 [2022-02-20 19:35:55,198 INFO L932 BasicCegarLoop]: 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-02-20 19:35:55,200 INFO L933 BasicCegarLoop]: 40 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, 40 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-02-20 19:35:55,201 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 19:35:55,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2022-02-20 19:35:55,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2022-02-20 19:35:55,218 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:35:55,219 INFO L82 GeneralOperation]: Start isEquivalent. First operand 26 states. Second operand has 26 states, 20 states have (on average 1.35) internal successors, (27), 22 states have internal predecessors, (27), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 19:35:55,219 INFO L74 IsIncluded]: Start isIncluded. First operand 26 states. Second operand has 26 states, 20 states have (on average 1.35) internal successors, (27), 22 states have internal predecessors, (27), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 19:35:55,219 INFO L87 Difference]: Start difference. First operand 26 states. Second operand has 26 states, 20 states have (on average 1.35) internal successors, (27), 22 states have internal predecessors, (27), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 19:35:55,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:35:55,222 INFO L93 Difference]: Finished difference Result 26 states and 32 transitions. [2022-02-20 19:35:55,222 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 32 transitions. [2022-02-20 19:35:55,223 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:35:55,223 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:35:55,223 INFO L74 IsIncluded]: Start isIncluded. First operand has 26 states, 20 states have (on average 1.35) internal successors, (27), 22 states have internal predecessors, (27), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 26 states. [2022-02-20 19:35:55,224 INFO L87 Difference]: Start difference. First operand has 26 states, 20 states have (on average 1.35) internal successors, (27), 22 states have internal predecessors, (27), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 26 states. [2022-02-20 19:35:55,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:35:55,226 INFO L93 Difference]: Finished difference Result 26 states and 32 transitions. [2022-02-20 19:35:55,226 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 32 transitions. [2022-02-20 19:35:55,226 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:35:55,226 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:35:55,226 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:35:55,227 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:35:55,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 20 states have (on average 1.35) internal successors, (27), 22 states have internal predecessors, (27), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 19:35:55,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 32 transitions. [2022-02-20 19:35:55,229 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 32 transitions. Word has length 9 [2022-02-20 19:35:55,229 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:35:55,230 INFO L470 AbstractCegarLoop]: Abstraction has 26 states and 32 transitions. [2022-02-20 19:35:55,230 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:35:55,230 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 32 transitions. [2022-02-20 19:35:55,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-02-20 19:35:55,230 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:35:55,231 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 19:35:55,231 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-20 19:35:55,231 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:35:55,232 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:35:55,232 INFO L85 PathProgramCache]: Analyzing trace with hash -1329166859, now seen corresponding path program 1 times [2022-02-20 19:35:55,232 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:35:55,232 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1207708019] [2022-02-20 19:35:55,232 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:35:55,232 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:35:55,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-20 19:35:55,247 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-20 19:35:55,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-20 19:35:55,263 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-20 19:35:55,263 INFO L628 BasicCegarLoop]: Counterexample is feasible [2022-02-20 19:35:55,265 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (1 of 2 remaining) [2022-02-20 19:35:55,266 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2022-02-20 19:35:55,266 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-02-20 19:35:55,268 INFO L732 BasicCegarLoop]: Path program histogram: [1, 1] [2022-02-20 19:35:55,269 INFO L180 ceAbstractionStarter]: Computing trace abstraction results [2022-02-20 19:35:55,281 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2022-02-20 19:35:55,281 WARN L170 areAnnotationChecker]: __VERIFIER_assertENTRY has no Hoare annotation [2022-02-20 19:35:55,281 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2022-02-20 19:35:55,282 WARN L170 areAnnotationChecker]: L26 has no Hoare annotation [2022-02-20 19:35:55,282 WARN L170 areAnnotationChecker]: L26 has no Hoare annotation [2022-02-20 19:35:55,282 WARN L170 areAnnotationChecker]: L115 has no Hoare annotation [2022-02-20 19:35:55,282 WARN L170 areAnnotationChecker]: L115 has no Hoare annotation [2022-02-20 19:35:55,282 WARN L170 areAnnotationChecker]: L27 has no Hoare annotation [2022-02-20 19:35:55,282 WARN L170 areAnnotationChecker]: L27 has no Hoare annotation [2022-02-20 19:35:55,282 WARN L170 areAnnotationChecker]: L26-2 has no Hoare annotation [2022-02-20 19:35:55,282 WARN L170 areAnnotationChecker]: L33 has no Hoare annotation [2022-02-20 19:35:55,283 WARN L170 areAnnotationChecker]: L33 has no Hoare annotation [2022-02-20 19:35:55,283 WARN L170 areAnnotationChecker]: L82 has no Hoare annotation [2022-02-20 19:35:55,283 WARN L170 areAnnotationChecker]: L82 has no Hoare annotation [2022-02-20 19:35:55,283 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-02-20 19:35:55,283 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-02-20 19:35:55,283 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-02-20 19:35:55,283 WARN L170 areAnnotationChecker]: L33-2 has no Hoare annotation [2022-02-20 19:35:55,283 WARN L170 areAnnotationChecker]: L33-2 has no Hoare annotation [2022-02-20 19:35:55,283 WARN L170 areAnnotationChecker]: L81 has no Hoare annotation [2022-02-20 19:35:55,283 WARN L170 areAnnotationChecker]: L62-1 has no Hoare annotation [2022-02-20 19:35:55,284 WARN L170 areAnnotationChecker]: L62-1 has no Hoare annotation [2022-02-20 19:35:55,284 WARN L170 areAnnotationChecker]: L63 has no Hoare annotation [2022-02-20 19:35:55,284 WARN L170 areAnnotationChecker]: L63 has no Hoare annotation [2022-02-20 19:35:55,284 WARN L170 areAnnotationChecker]: L64 has no Hoare annotation [2022-02-20 19:35:55,284 WARN L170 areAnnotationChecker]: L34-1 has no Hoare annotation [2022-02-20 19:35:55,284 WARN L170 areAnnotationChecker]: L34-1 has no Hoare annotation [2022-02-20 19:35:55,284 WARN L170 areAnnotationChecker]: L87 has no Hoare annotation [2022-02-20 19:35:55,284 WARN L170 areAnnotationChecker]: L66 has no Hoare annotation [2022-02-20 19:35:55,284 WARN L170 areAnnotationChecker]: L47 has no Hoare annotation [2022-02-20 19:35:55,285 WARN L170 areAnnotationChecker]: L41-2 has no Hoare annotation [2022-02-20 19:35:55,285 WARN L170 areAnnotationChecker]: L41-2 has no Hoare annotation [2022-02-20 19:35:55,285 WARN L170 areAnnotationChecker]: L41-2 has no Hoare annotation [2022-02-20 19:35:55,285 WARN L170 areAnnotationChecker]: L92 has no Hoare annotation [2022-02-20 19:35:55,285 WARN L170 areAnnotationChecker]: L113 has no Hoare annotation [2022-02-20 19:35:55,285 WARN L170 areAnnotationChecker]: L62 has no Hoare annotation [2022-02-20 19:35:55,285 WARN L170 areAnnotationChecker]: L62 has no Hoare annotation [2022-02-20 19:35:55,285 WARN L170 areAnnotationChecker]: L40-2 has no Hoare annotation [2022-02-20 19:35:55,285 WARN L170 areAnnotationChecker]: L41 has no Hoare annotation [2022-02-20 19:35:55,286 WARN L170 areAnnotationChecker]: L41 has no Hoare annotation [2022-02-20 19:35:55,286 WARN L170 areAnnotationChecker]: L108 has no Hoare annotation [2022-02-20 19:35:55,286 WARN L170 areAnnotationChecker]: L108 has no Hoare annotation [2022-02-20 19:35:55,286 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-02-20 19:35:55,286 WARN L170 areAnnotationChecker]: L109 has no Hoare annotation [2022-02-20 19:35:55,286 WARN L170 areAnnotationChecker]: L109 has no Hoare annotation [2022-02-20 19:35:55,286 WARN L170 areAnnotationChecker]: L108-2 has no Hoare annotation [2022-02-20 19:35:55,286 WARN L170 areAnnotationChecker]: L111 has no Hoare annotation [2022-02-20 19:35:55,286 INFO L163 areAnnotationChecker]: CFG has 0 edges. 0 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2022-02-20 19:35:55,287 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.02 07:35:55 BoogieIcfgContainer [2022-02-20 19:35:55,287 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-02-20 19:35:55,288 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-02-20 19:35:55,288 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-02-20 19:35:55,288 INFO L275 PluginConnector]: Witness Printer initialized [2022-02-20 19:35:55,288 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 07:35:54" (3/4) ... [2022-02-20 19:35:55,290 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-02-20 19:35:55,290 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-02-20 19:35:55,291 INFO L158 Benchmark]: Toolchain (without parser) took 1199.06ms. Allocated memory was 88.1MB in the beginning and 111.1MB in the end (delta: 23.1MB). Free memory was 52.5MB in the beginning and 61.7MB in the end (delta: -9.2MB). Peak memory consumption was 14.1MB. Max. memory is 16.1GB. [2022-02-20 19:35:55,291 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 88.1MB. Free memory is still 68.5MB. There was no memory consumed. Max. memory is 16.1GB. [2022-02-20 19:35:55,292 INFO L158 Benchmark]: CACSL2BoogieTranslator took 312.13ms. Allocated memory was 88.1MB in the beginning and 111.1MB in the end (delta: 23.1MB). Free memory was 52.3MB in the beginning and 86.1MB in the end (delta: -33.8MB). Peak memory consumption was 5.7MB. Max. memory is 16.1GB. [2022-02-20 19:35:55,292 INFO L158 Benchmark]: Boogie Procedure Inliner took 48.68ms. Allocated memory is still 111.1MB. Free memory was 85.8MB in the beginning and 83.8MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-20 19:35:55,292 INFO L158 Benchmark]: Boogie Preprocessor took 27.00ms. Allocated memory is still 111.1MB. Free memory was 83.8MB in the beginning and 82.5MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-20 19:35:55,293 INFO L158 Benchmark]: RCFGBuilder took 283.61ms. Allocated memory is still 111.1MB. Free memory was 82.5MB in the beginning and 69.9MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2022-02-20 19:35:55,293 INFO L158 Benchmark]: TraceAbstraction took 519.24ms. Allocated memory is still 111.1MB. Free memory was 69.4MB in the beginning and 62.1MB in the end (delta: 7.3MB). Peak memory consumption was 6.2MB. Max. memory is 16.1GB. [2022-02-20 19:35:55,293 INFO L158 Benchmark]: Witness Printer took 2.46ms. Allocated memory is still 111.1MB. Free memory is still 61.7MB. There was no memory consumed. Max. memory is 16.1GB. [2022-02-20 19:35:55,295 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15ms. Allocated memory is still 88.1MB. Free memory is still 68.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 312.13ms. Allocated memory was 88.1MB in the beginning and 111.1MB in the end (delta: 23.1MB). Free memory was 52.3MB in the beginning and 86.1MB in the end (delta: -33.8MB). Peak memory consumption was 5.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 48.68ms. Allocated memory is still 111.1MB. Free memory was 85.8MB in the beginning and 83.8MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 27.00ms. Allocated memory is still 111.1MB. Free memory was 83.8MB in the beginning and 82.5MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 283.61ms. Allocated memory is still 111.1MB. Free memory was 82.5MB in the beginning and 69.9MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * TraceAbstraction took 519.24ms. Allocated memory is still 111.1MB. Free memory was 69.4MB in the beginning and 62.1MB in the end (delta: 7.3MB). Peak memory consumption was 6.2MB. Max. memory is 16.1GB. * Witness Printer took 2.46ms. Allocated memory is still 111.1MB. Free memory is still 61.7MB. 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: 109]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 98, overapproximation of someBinaryDOUBLEComparisonOperation at line 108, overapproximation of someBinaryArithmeticFLOAToperation at line 100. Possible FailurePath: [L115] COND FALSE !(__VERIFIER_nondet_int()) [L118] CALL main2() [L97] float IN = __VERIFIER_nondet_float(); [L98] CALL assume_abort_if_not(IN > -1.2f && IN < 1.2f) [L82] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L98] RET assume_abort_if_not(IN > -1.2f && IN < 1.2f) [L100] CALL, EXPR f(IN) [L87] return x - (x*x*x)/6.0f + (x*x*x*x*x)/120.0f + (x*x*x*x*x*x*x)/5040.0f; VAL [\old(x)=49, x=49] [L100] RET, EXPR f(IN) [L100] CALL, EXPR fp(IN) [L92] return 1 - (x*x)/2.0f + (x*x*x*x)/24.0f + (x*x*x*x*x*x)/720.0f; VAL [\old(x)=49, x=49] [L100] RET, EXPR fp(IN) [L100] float x = IN - f(IN)/fp(IN); [L108] COND TRUE !(x < 0.1) VAL [IN=49] [L109] reach_error() VAL [IN=49] - UnprovableResult [Line: 27]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 33 locations, 2 error locations. Started 1 CEGAR loops. OverallTime: 0.4s, OverallIterations: 2, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 0 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 0 mSDsluCounter, 40 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 0 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 0 IncrementalHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 0 mSolverCounterUnsat, 40 mSDtfsCounter, 0 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=33occurred in iteration=0, InterpolantAutomatonStates: 2, 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, 1 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 18 NumberOfCodeBlocks, 18 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 8 ConstructedInterpolants, 0 QuantifiedInterpolants, 8 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 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-02-20 19:35:55,325 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -ea -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/combinations/gcd_4+newton_1_6.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.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 8d5852a96a997fd819a9dfc3e184ca8c6360d14970e60ecfb10d610384c98f94 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 19:35:57,120 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 19:35:57,122 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 19:35:57,150 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 19:35:57,151 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 19:35:57,153 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 19:35:57,154 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 19:35:57,158 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 19:35:57,159 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 19:35:57,162 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 19:35:57,163 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 19:35:57,164 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 19:35:57,164 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 19:35:57,166 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 19:35:57,167 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 19:35:57,169 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 19:35:57,170 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 19:35:57,170 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 19:35:57,174 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 19:35:57,177 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 19:35:57,178 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 19:35:57,179 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 19:35:57,180 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 19:35:57,181 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 19:35:57,185 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 19:35:57,185 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 19:35:57,186 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 19:35:57,187 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 19:35:57,187 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 19:35:57,188 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 19:35:57,188 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 19:35:57,188 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 19:35:57,189 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 19:35:57,190 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 19:35:57,191 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 19:35:57,191 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 19:35:57,191 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 19:35:57,192 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 19:35:57,192 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 19:35:57,193 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 19:35:57,193 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 19:35:57,194 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2022-02-20 19:35:57,227 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 19:35:57,227 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 19:35:57,228 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 19:35:57,228 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 19:35:57,229 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 19:35:57,229 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 19:35:57,230 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 19:35:57,230 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 19:35:57,230 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 19:35:57,230 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 19:35:57,231 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 19:35:57,231 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 19:35:57,231 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 19:35:57,232 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 19:35:57,232 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 19:35:57,232 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 19:35:57,232 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-02-20 19:35:57,232 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-02-20 19:35:57,232 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-02-20 19:35:57,232 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 19:35:57,233 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 19:35:57,233 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 19:35:57,233 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 19:35:57,233 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 19:35:57,233 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 19:35:57,233 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 19:35:57,234 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 19:35:57,234 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 19:35:57,234 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 19:35:57,234 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 19:35:57,234 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2022-02-20 19:35:57,234 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-02-20 19:35:57,235 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 19:35:57,235 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 19:35:57,235 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 19:35:57,235 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-02-20 19:35:57,235 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 -> 8d5852a96a997fd819a9dfc3e184ca8c6360d14970e60ecfb10d610384c98f94 [2022-02-20 19:35:57,511 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 19:35:57,532 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 19:35:57,533 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 19:35:57,534 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 19:35:57,535 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 19:35:57,536 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/combinations/gcd_4+newton_1_6.i [2022-02-20 19:35:57,593 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bb12de854/ee46df4248fb4eb68484ef8e08e309c8/FLAGca6e46872 [2022-02-20 19:35:57,882 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 19:35:57,882 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/gcd_4+newton_1_6.i [2022-02-20 19:35:57,901 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bb12de854/ee46df4248fb4eb68484ef8e08e309c8/FLAGca6e46872 [2022-02-20 19:35:58,310 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bb12de854/ee46df4248fb4eb68484ef8e08e309c8 [2022-02-20 19:35:58,312 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 19:35:58,313 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 19:35:58,316 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 19:35:58,316 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 19:35:58,319 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 19:35:58,319 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 07:35:58" (1/1) ... [2022-02-20 19:35:58,321 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4301d17f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:35:58, skipping insertion in model container [2022-02-20 19:35:58,321 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 07:35:58" (1/1) ... [2022-02-20 19:35:58,326 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 19:35:58,350 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 19:35:58,479 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/combinations/gcd_4+newton_1_6.i[1224,1237] [2022-02-20 19:35:58,512 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/combinations/gcd_4+newton_1_6.i[2806,2819] [2022-02-20 19:35:58,513 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 19:35:58,520 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 19:35:58,565 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/combinations/gcd_4+newton_1_6.i[1224,1237] [2022-02-20 19:35:58,574 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/combinations/gcd_4+newton_1_6.i[2806,2819] [2022-02-20 19:35:58,582 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 19:35:58,598 INFO L208 MainTranslator]: Completed translation [2022-02-20 19:35:58,599 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:35:58 WrapperNode [2022-02-20 19:35:58,599 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 19:35:58,600 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 19:35:58,600 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 19:35:58,600 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 19:35:58,604 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:35:58" (1/1) ... [2022-02-20 19:35:58,618 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:35:58" (1/1) ... [2022-02-20 19:35:58,648 INFO L137 Inliner]: procedures = 28, calls = 16, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 70 [2022-02-20 19:35:58,648 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 19:35:58,649 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 19:35:58,649 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 19:35:58,650 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 19:35:58,654 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:35:58" (1/1) ... [2022-02-20 19:35:58,655 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:35:58" (1/1) ... [2022-02-20 19:35:58,663 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:35:58" (1/1) ... [2022-02-20 19:35:58,663 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:35:58" (1/1) ... [2022-02-20 19:35:58,677 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:35:58" (1/1) ... [2022-02-20 19:35:58,686 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:35:58" (1/1) ... [2022-02-20 19:35:58,688 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:35:58" (1/1) ... [2022-02-20 19:35:58,693 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 19:35:58,694 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 19:35:58,697 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 19:35:58,697 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 19:35:58,698 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:35:58" (1/1) ... [2022-02-20 19:35:58,702 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 19:35:58,709 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 19:35:58,753 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-02-20 19:35:58,793 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-02-20 19:35:58,831 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 19:35:58,832 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-02-20 19:35:58,832 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 19:35:58,832 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 19:35:58,832 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-02-20 19:35:58,832 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-02-20 19:35:58,873 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 19:35:58,874 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 19:36:05,630 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 19:36:05,634 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 19:36:05,634 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-02-20 19:36:05,635 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 07:36:05 BoogieIcfgContainer [2022-02-20 19:36:05,636 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 19:36:05,637 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 19:36:05,637 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 19:36:05,639 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 19:36:05,639 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 07:35:58" (1/3) ... [2022-02-20 19:36:05,639 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2db61847 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 07:36:05, skipping insertion in model container [2022-02-20 19:36:05,639 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:35:58" (2/3) ... [2022-02-20 19:36:05,640 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2db61847 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 07:36:05, skipping insertion in model container [2022-02-20 19:36:05,640 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 07:36:05" (3/3) ... [2022-02-20 19:36:05,641 INFO L111 eAbstractionObserver]: Analyzing ICFG gcd_4+newton_1_6.i [2022-02-20 19:36:05,644 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 19:36:05,644 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-02-20 19:36:05,671 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 19:36:05,675 INFO L339 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, mLoopAccelerationTechnique=FAST_UPR [2022-02-20 19:36:05,675 INFO L340 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2022-02-20 19:36:05,687 INFO L276 IsEmpty]: Start isEmpty. Operand has 33 states, 26 states have (on average 1.4615384615384615) internal successors, (38), 28 states have internal predecessors, (38), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-20 19:36:05,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-02-20 19:36:05,696 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:36:05,697 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 19:36:05,697 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:36:05,700 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:36:05,701 INFO L85 PathProgramCache]: Analyzing trace with hash -1386425161, now seen corresponding path program 1 times [2022-02-20 19:36:05,708 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 19:36:05,708 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1745105473] [2022-02-20 19:36:05,708 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:36:05,709 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 19:36:05,709 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 19:36:05,711 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-02-20 19:36:05,712 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2022-02-20 19:36:06,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:36:06,613 INFO L263 TraceCheckSpWp]: Trace formula consists of 30 conjuncts, 1 conjunts are in the unsatisfiable core [2022-02-20 19:36:06,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:36:06,623 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 19:36:06,716 INFO L290 TraceCheckUtils]: 0: Hoare triple {36#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv32, 0bv32;assume 0bv1 == #valid[0bv32];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven;call #Ultimate.allocInit(2bv32, 1bv32);call write~init~intINTTYPE1(48bv8, 1bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 1bv32, 1bv32, 1bv32);call #Ultimate.allocInit(8bv32, 2bv32);call #Ultimate.allocInit(12bv32, 3bv32); {36#true} is VALID [2022-02-20 19:36:06,717 INFO L290 TraceCheckUtils]: 1: Hoare triple {36#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet9#1, main_#t~ret10#1, main_#t~ret11#1; {36#true} is VALID [2022-02-20 19:36:06,717 INFO L290 TraceCheckUtils]: 2: Hoare triple {36#true} assume !(0bv32 != main_#t~nondet9#1);havoc main_#t~nondet9#1;assume { :begin_inline_main2 } true;havoc main2_#res#1;havoc main2_#t~nondet6#1, main2_#t~ret7#1, main2_#t~ret8#1, main2_~IN~0#1, main2_~x~1#1;main2_~IN~0#1 := main2_#t~nondet6#1;havoc main2_#t~nondet6#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := (if ~fp.gt~FLOAT(main2_~IN~0#1, ~fp.neg~FLOAT(~to_fp~FLOAT(currentRoundingMode, 1.2))) && ~fp.lt~FLOAT(main2_~IN~0#1, ~to_fp~FLOAT(currentRoundingMode, 1.2)) then 1bv32 else 0bv32);havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {36#true} is VALID [2022-02-20 19:36:06,719 INFO L290 TraceCheckUtils]: 3: Hoare triple {36#true} assume 0bv32 == assume_abort_if_not_~cond#1;assume false; {37#false} is VALID [2022-02-20 19:36:06,719 INFO L290 TraceCheckUtils]: 4: Hoare triple {37#false} assume { :end_inline_assume_abort_if_not } true;assume { :begin_inline_f } true;f_#in~x#1 := main2_~IN~0#1;havoc f_#res#1;havoc f_~x#1;f_~x#1 := f_#in~x#1;f_#res#1 := ~fp.add~FLOAT(currentRoundingMode, ~fp.add~FLOAT(currentRoundingMode, ~fp.sub~FLOAT(currentRoundingMode, f_~x#1, ~fp.div~FLOAT(currentRoundingMode, ~fp.mul~FLOAT(currentRoundingMode, ~fp.mul~FLOAT(currentRoundingMode, f_~x#1, f_~x#1), f_~x#1), ~to_fp~FLOAT(currentRoundingMode, 6.0))), ~fp.div~FLOAT(currentRoundingMode, ~fp.mul~FLOAT(currentRoundingMode, ~fp.mul~FLOAT(currentRoundingMode, ~fp.mul~FLOAT(currentRoundingMode, ~fp.mul~FLOAT(currentRoundingMode, f_~x#1, f_~x#1), f_~x#1), f_~x#1), f_~x#1), ~to_fp~FLOAT(currentRoundingMode, 120.0))), ~fp.div~FLOAT(currentRoundingMode, ~fp.mul~FLOAT(currentRoundingMode, ~fp.mul~FLOAT(currentRoundingMode, ~fp.mul~FLOAT(currentRoundingMode, ~fp.mul~FLOAT(currentRoundingMode, ~fp.mul~FLOAT(currentRoundingMode, ~fp.mul~FLOAT(currentRoundingMode, f_~x#1, f_~x#1), f_~x#1), f_~x#1), f_~x#1), f_~x#1), f_~x#1), ~to_fp~FLOAT(currentRoundingMode, 5040.0))); {37#false} is VALID [2022-02-20 19:36:06,719 INFO L290 TraceCheckUtils]: 5: Hoare triple {37#false} main2_#t~ret7#1 := f_#res#1;assume { :end_inline_f } true;assume { :begin_inline_fp } true;fp_#in~x#1 := main2_~IN~0#1;havoc fp_#res#1;havoc fp_~x#1;fp_~x#1 := fp_#in~x#1;fp_#res#1 := ~fp.add~FLOAT(currentRoundingMode, ~fp.add~FLOAT(currentRoundingMode, ~fp.sub~FLOAT(currentRoundingMode, ~convertINTToFLOAT(currentRoundingMode, 1bv32), ~fp.div~FLOAT(currentRoundingMode, ~fp.mul~FLOAT(currentRoundingMode, fp_~x#1, fp_~x#1), ~to_fp~FLOAT(currentRoundingMode, 2.0))), ~fp.div~FLOAT(currentRoundingMode, ~fp.mul~FLOAT(currentRoundingMode, ~fp.mul~FLOAT(currentRoundingMode, ~fp.mul~FLOAT(currentRoundingMode, fp_~x#1, fp_~x#1), fp_~x#1), fp_~x#1), ~to_fp~FLOAT(currentRoundingMode, 24.0))), ~fp.div~FLOAT(currentRoundingMode, ~fp.mul~FLOAT(currentRoundingMode, ~fp.mul~FLOAT(currentRoundingMode, ~fp.mul~FLOAT(currentRoundingMode, ~fp.mul~FLOAT(currentRoundingMode, ~fp.mul~FLOAT(currentRoundingMode, fp_~x#1, fp_~x#1), fp_~x#1), fp_~x#1), fp_~x#1), fp_~x#1), ~to_fp~FLOAT(currentRoundingMode, 720.0))); {37#false} is VALID [2022-02-20 19:36:06,719 INFO L290 TraceCheckUtils]: 6: Hoare triple {37#false} main2_#t~ret8#1 := fp_#res#1;assume { :end_inline_fp } true;main2_~x~1#1 := ~fp.sub~FLOAT(currentRoundingMode, main2_~IN~0#1, ~fp.div~FLOAT(currentRoundingMode, main2_#t~ret7#1, main2_#t~ret8#1));havoc main2_#t~ret7#1;havoc main2_#t~ret8#1; {37#false} is VALID [2022-02-20 19:36:06,719 INFO L290 TraceCheckUtils]: 7: Hoare triple {37#false} assume !~fp.lt~DOUBLE(~convertFLOATToDOUBLE(currentRoundingMode, main2_~x~1#1), ~to_fp~DOUBLE(currentRoundingMode, 0.1)); {37#false} is VALID [2022-02-20 19:36:06,720 INFO L290 TraceCheckUtils]: 8: Hoare triple {37#false} assume !false; {37#false} is VALID [2022-02-20 19:36:06,720 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 19:36:06,720 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 19:36:06,721 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 19:36:06,721 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1745105473] [2022-02-20 19:36:06,721 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1745105473] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:36:06,721 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:36:06,721 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-20 19:36:06,722 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [87936367] [2022-02-20 19:36:06,723 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:36:06,726 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2022-02-20 19:36:06,726 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:36:06,728 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:36:08,707 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 9 edges. 9 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:36:08,707 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-02-20 19:36:08,707 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 19:36:08,725 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-02-20 19:36:08,726 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-02-20 19:36:08,730 INFO L87 Difference]: Start difference. First operand has 33 states, 26 states have (on average 1.4615384615384615) internal successors, (38), 28 states have internal predecessors, (38), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:36:15,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:36:15,816 INFO L93 Difference]: Finished difference Result 57 states and 74 transitions. [2022-02-20 19:36:15,816 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-20 19:36:15,816 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2022-02-20 19:36:15,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:36:15,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:36:15,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 74 transitions. [2022-02-20 19:36:15,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:36:15,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 74 transitions. [2022-02-20 19:36:15,860 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 74 transitions. [2022-02-20 19:36:20,056 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 74 edges. 74 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:36:20,062 INFO L225 Difference]: With dead ends: 57 [2022-02-20 19:36:20,062 INFO L226 Difference]: Without dead ends: 26 [2022-02-20 19:36:20,064 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 8 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-02-20 19:36:20,066 INFO L933 BasicCegarLoop]: 40 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, 40 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-02-20 19:36:20,066 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 19:36:20,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2022-02-20 19:36:20,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2022-02-20 19:36:20,089 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:36:20,089 INFO L82 GeneralOperation]: Start isEquivalent. First operand 26 states. Second operand has 26 states, 20 states have (on average 1.35) internal successors, (27), 22 states have internal predecessors, (27), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 19:36:20,091 INFO L74 IsIncluded]: Start isIncluded. First operand 26 states. Second operand has 26 states, 20 states have (on average 1.35) internal successors, (27), 22 states have internal predecessors, (27), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 19:36:20,100 INFO L87 Difference]: Start difference. First operand 26 states. Second operand has 26 states, 20 states have (on average 1.35) internal successors, (27), 22 states have internal predecessors, (27), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 19:36:20,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:36:20,109 INFO L93 Difference]: Finished difference Result 26 states and 32 transitions. [2022-02-20 19:36:20,109 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 32 transitions. [2022-02-20 19:36:20,122 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:36:20,123 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:36:20,123 INFO L74 IsIncluded]: Start isIncluded. First operand has 26 states, 20 states have (on average 1.35) internal successors, (27), 22 states have internal predecessors, (27), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 26 states. [2022-02-20 19:36:20,123 INFO L87 Difference]: Start difference. First operand has 26 states, 20 states have (on average 1.35) internal successors, (27), 22 states have internal predecessors, (27), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 26 states. [2022-02-20 19:36:20,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:36:20,126 INFO L93 Difference]: Finished difference Result 26 states and 32 transitions. [2022-02-20 19:36:20,126 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 32 transitions. [2022-02-20 19:36:20,126 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:36:20,126 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:36:20,126 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:36:20,127 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:36:20,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 20 states have (on average 1.35) internal successors, (27), 22 states have internal predecessors, (27), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 19:36:20,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 32 transitions. [2022-02-20 19:36:20,132 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 32 transitions. Word has length 9 [2022-02-20 19:36:20,132 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:36:20,132 INFO L470 AbstractCegarLoop]: Abstraction has 26 states and 32 transitions. [2022-02-20 19:36:20,133 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 19:36:20,133 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 32 transitions. [2022-02-20 19:36:20,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-02-20 19:36:20,133 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:36:20,133 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 19:36:20,161 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Ended with exit code 0 [2022-02-20 19:36:20,340 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-02-20 19:36:20,341 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:36:20,344 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:36:20,344 INFO L85 PathProgramCache]: Analyzing trace with hash -1329166859, now seen corresponding path program 1 times [2022-02-20 19:36:20,345 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 19:36:20,345 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [765833787] [2022-02-20 19:36:20,345 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:36:20,345 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 19:36:20,346 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 19:36:20,347 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-02-20 19:36:20,354 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2022-02-20 19:36:24,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-20 19:36:24,679 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-20 19:36:56,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-20 19:36:56,191 INFO L138 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2022-02-20 19:36:56,191 INFO L628 BasicCegarLoop]: Counterexample is feasible [2022-02-20 19:36:56,192 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (1 of 2 remaining) [2022-02-20 19:36:56,193 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2022-02-20 19:36:56,257 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2022-02-20 19:36:56,394 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-02-20 19:36:56,397 INFO L732 BasicCegarLoop]: Path program histogram: [1, 1] [2022-02-20 19:36:56,399 INFO L180 ceAbstractionStarter]: Computing trace abstraction results [2022-02-20 19:36:56,417 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2022-02-20 19:36:56,417 WARN L170 areAnnotationChecker]: __VERIFIER_assertENTRY has no Hoare annotation [2022-02-20 19:36:56,417 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2022-02-20 19:36:56,417 WARN L170 areAnnotationChecker]: L26 has no Hoare annotation [2022-02-20 19:36:56,417 WARN L170 areAnnotationChecker]: L26 has no Hoare annotation [2022-02-20 19:36:56,418 WARN L170 areAnnotationChecker]: L115 has no Hoare annotation [2022-02-20 19:36:56,418 WARN L170 areAnnotationChecker]: L115 has no Hoare annotation [2022-02-20 19:36:56,418 WARN L170 areAnnotationChecker]: L27 has no Hoare annotation [2022-02-20 19:36:56,418 WARN L170 areAnnotationChecker]: L27 has no Hoare annotation [2022-02-20 19:36:56,418 WARN L170 areAnnotationChecker]: L26-2 has no Hoare annotation [2022-02-20 19:36:56,418 WARN L170 areAnnotationChecker]: L33 has no Hoare annotation [2022-02-20 19:36:56,418 WARN L170 areAnnotationChecker]: L33 has no Hoare annotation [2022-02-20 19:36:56,418 WARN L170 areAnnotationChecker]: L82 has no Hoare annotation [2022-02-20 19:36:56,418 WARN L170 areAnnotationChecker]: L82 has no Hoare annotation [2022-02-20 19:36:56,418 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-02-20 19:36:56,418 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-02-20 19:36:56,419 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-02-20 19:36:56,419 WARN L170 areAnnotationChecker]: L33-2 has no Hoare annotation [2022-02-20 19:36:56,419 WARN L170 areAnnotationChecker]: L33-2 has no Hoare annotation [2022-02-20 19:36:56,419 WARN L170 areAnnotationChecker]: L81 has no Hoare annotation [2022-02-20 19:36:56,419 WARN L170 areAnnotationChecker]: L62-1 has no Hoare annotation [2022-02-20 19:36:56,419 WARN L170 areAnnotationChecker]: L62-1 has no Hoare annotation [2022-02-20 19:36:56,419 WARN L170 areAnnotationChecker]: L63 has no Hoare annotation [2022-02-20 19:36:56,419 WARN L170 areAnnotationChecker]: L63 has no Hoare annotation [2022-02-20 19:36:56,419 WARN L170 areAnnotationChecker]: L64 has no Hoare annotation [2022-02-20 19:36:56,419 WARN L170 areAnnotationChecker]: L34-1 has no Hoare annotation [2022-02-20 19:36:56,420 WARN L170 areAnnotationChecker]: L34-1 has no Hoare annotation [2022-02-20 19:36:56,420 WARN L170 areAnnotationChecker]: L87 has no Hoare annotation [2022-02-20 19:36:56,420 WARN L170 areAnnotationChecker]: L66 has no Hoare annotation [2022-02-20 19:36:56,420 WARN L170 areAnnotationChecker]: L47 has no Hoare annotation [2022-02-20 19:36:56,420 WARN L170 areAnnotationChecker]: L41-2 has no Hoare annotation [2022-02-20 19:36:56,420 WARN L170 areAnnotationChecker]: L41-2 has no Hoare annotation [2022-02-20 19:36:56,420 WARN L170 areAnnotationChecker]: L41-2 has no Hoare annotation [2022-02-20 19:36:56,420 WARN L170 areAnnotationChecker]: L92 has no Hoare annotation [2022-02-20 19:36:56,420 WARN L170 areAnnotationChecker]: L113 has no Hoare annotation [2022-02-20 19:36:56,420 WARN L170 areAnnotationChecker]: L62 has no Hoare annotation [2022-02-20 19:36:56,420 WARN L170 areAnnotationChecker]: L62 has no Hoare annotation [2022-02-20 19:36:56,421 WARN L170 areAnnotationChecker]: L40-2 has no Hoare annotation [2022-02-20 19:36:56,421 WARN L170 areAnnotationChecker]: L41 has no Hoare annotation [2022-02-20 19:36:56,421 WARN L170 areAnnotationChecker]: L41 has no Hoare annotation [2022-02-20 19:36:56,421 WARN L170 areAnnotationChecker]: L108 has no Hoare annotation [2022-02-20 19:36:56,421 WARN L170 areAnnotationChecker]: L108 has no Hoare annotation [2022-02-20 19:36:56,421 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-02-20 19:36:56,421 WARN L170 areAnnotationChecker]: L109 has no Hoare annotation [2022-02-20 19:36:56,421 WARN L170 areAnnotationChecker]: L109 has no Hoare annotation [2022-02-20 19:36:56,421 WARN L170 areAnnotationChecker]: L108-2 has no Hoare annotation [2022-02-20 19:36:56,421 WARN L170 areAnnotationChecker]: L111 has no Hoare annotation [2022-02-20 19:36:56,422 INFO L163 areAnnotationChecker]: CFG has 0 edges. 0 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2022-02-20 19:36:56,422 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.02 07:36:56 BoogieIcfgContainer [2022-02-20 19:36:56,422 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-02-20 19:36:56,423 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-02-20 19:36:56,423 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-02-20 19:36:56,423 INFO L275 PluginConnector]: Witness Printer initialized [2022-02-20 19:36:56,424 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 07:36:05" (3/4) ... [2022-02-20 19:36:56,425 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2022-02-20 19:36:56,450 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2022-02-20 19:36:56,451 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-02-20 19:36:56,452 INFO L158 Benchmark]: Toolchain (without parser) took 58138.32ms. Allocated memory is still 73.4MB. Free memory was 48.6MB in the beginning and 43.8MB in the end (delta: 4.9MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-02-20 19:36:56,452 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 50.3MB. Free memory was 31.8MB in the beginning and 31.8MB in the end (delta: 31.8kB). There was no memory consumed. Max. memory is 16.1GB. [2022-02-20 19:36:56,452 INFO L158 Benchmark]: CACSL2BoogieTranslator took 283.53ms. Allocated memory is still 73.4MB. Free memory was 48.4MB in the beginning and 55.2MB in the end (delta: -6.9MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2022-02-20 19:36:56,452 INFO L158 Benchmark]: Boogie Procedure Inliner took 48.48ms. Allocated memory is still 73.4MB. Free memory was 55.0MB in the beginning and 53.1MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-20 19:36:56,453 INFO L158 Benchmark]: Boogie Preprocessor took 44.53ms. Allocated memory is still 73.4MB. Free memory was 52.9MB in the beginning and 51.5MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-20 19:36:56,453 INFO L158 Benchmark]: RCFGBuilder took 6941.78ms. Allocated memory is still 73.4MB. Free memory was 51.5MB in the beginning and 40.2MB in the end (delta: 11.3MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-02-20 19:36:56,453 INFO L158 Benchmark]: TraceAbstraction took 50785.88ms. Allocated memory is still 73.4MB. Free memory was 39.8MB in the beginning and 45.9MB in the end (delta: -6.1MB). There was no memory consumed. Max. memory is 16.1GB. [2022-02-20 19:36:56,454 INFO L158 Benchmark]: Witness Printer took 27.50ms. Allocated memory is still 73.4MB. Free memory was 45.9MB in the beginning and 43.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-20 19:36:56,455 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15ms. Allocated memory is still 50.3MB. Free memory was 31.8MB in the beginning and 31.8MB in the end (delta: 31.8kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 283.53ms. Allocated memory is still 73.4MB. Free memory was 48.4MB in the beginning and 55.2MB in the end (delta: -6.9MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 48.48ms. Allocated memory is still 73.4MB. Free memory was 55.0MB in the beginning and 53.1MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 44.53ms. Allocated memory is still 73.4MB. Free memory was 52.9MB in the beginning and 51.5MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 6941.78ms. Allocated memory is still 73.4MB. Free memory was 51.5MB in the beginning and 40.2MB in the end (delta: 11.3MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * TraceAbstraction took 50785.88ms. Allocated memory is still 73.4MB. Free memory was 39.8MB in the beginning and 45.9MB in the end (delta: -6.1MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 27.50ms. Allocated memory is still 73.4MB. Free memory was 45.9MB in the beginning and 43.8MB 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: 109]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L115] COND FALSE !(__VERIFIER_nondet_int()) [L118] CALL main2() [L97] float IN = __VERIFIER_nondet_float(); [L98] CALL assume_abort_if_not(IN > -1.2f && IN < 1.2f) [L82] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L98] RET assume_abort_if_not(IN > -1.2f && IN < 1.2f) [L100] CALL, EXPR f(IN) [L87] return x - (x*x*x)/6.0f + (x*x*x*x*x)/120.0f + (x*x*x*x*x*x*x)/5040.0f; VAL [\old(x)=-0.7727874517440796, \result=-0.6981987357139587, x=-0.7727874517440796] [L100] RET, EXPR f(IN) [L100] CALL, EXPR fp(IN) [L92] return 1 - (x*x)/2.0f + (x*x*x*x)/24.0f + (x*x*x*x*x*x)/720.0f; VAL [\old(x)=-0.7727874517440796, \result=0.7165559530258179, x=-0.7727874517440796] [L100] RET, EXPR fp(IN) [L100] float x = IN - f(IN)/fp(IN); [L108] COND TRUE !(x < 0.1) VAL [IN=-0.7727874517440796, x=0.20159387588500977] [L109] reach_error() VAL [IN=-0.7727874517440796, x=0.20159387588500977] - UnprovableResult [Line: 27]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 33 locations, 2 error locations. Started 1 CEGAR loops. OverallTime: 50.7s, OverallIterations: 2, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 11.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 0 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 0 mSDsluCounter, 40 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 0 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 0 IncrementalHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 0 mSolverCounterUnsat, 40 mSDtfsCounter, 0 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 8 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=33occurred in iteration=0, InterpolantAutomatonStates: 2, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 1 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 5.1s SatisfiabilityAnalysisTime, 0.2s InterpolantComputationTime, 18 NumberOfCodeBlocks, 18 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 8 ConstructedInterpolants, 0 QuantifiedInterpolants, 8 SizeOfPredicates, 0 NumberOfNonLiveVariables, 30 ConjunctsInSsa, 1 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 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 proved your program to be incorrect! [2022-02-20 19:36:56,635 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