./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/nla-digbench/geo1-u.c --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/nla-digbench/geo1-u.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 60503b6cfd2a800757639deb106bbf28191c36de345606f03caabc1a25a1beff --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 17:11:54,952 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 17:11:54,955 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 17:11:54,988 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 17:11:54,989 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 17:11:54,991 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 17:11:54,992 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 17:11:54,995 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 17:11:54,996 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 17:11:55,000 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 17:11:55,001 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 17:11:55,002 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 17:11:55,002 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 17:11:55,004 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 17:11:55,005 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 17:11:55,007 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 17:11:55,008 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 17:11:55,009 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 17:11:55,011 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 17:11:55,015 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 17:11:55,016 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 17:11:55,017 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 17:11:55,018 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 17:11:55,019 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 17:11:55,024 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 17:11:55,025 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 17:11:55,025 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 17:11:55,026 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 17:11:55,027 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 17:11:55,028 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 17:11:55,028 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 17:11:55,029 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 17:11:55,030 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 17:11:55,031 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 17:11:55,032 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 17:11:55,032 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 17:11:55,032 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 17:11:55,033 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 17:11:55,033 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 17:11:55,034 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 17:11:55,034 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 17:11:55,035 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-02-20 17:11:55,060 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 17:11:55,060 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 17:11:55,060 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 17:11:55,061 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 17:11:55,061 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 17:11:55,062 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 17:11:55,062 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 17:11:55,062 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 17:11:55,063 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 17:11:55,063 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 17:11:55,063 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 17:11:55,064 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 17:11:55,064 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 17:11:55,064 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 17:11:55,064 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 17:11:55,064 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 17:11:55,064 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 17:11:55,065 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 17:11:55,065 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 17:11:55,065 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 17:11:55,065 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 17:11:55,065 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 17:11:55,065 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 17:11:55,066 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 17:11:55,066 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 17:11:55,066 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 17:11:55,066 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 17:11:55,067 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 17:11:55,067 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-20 17:11:55,068 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-20 17:11:55,068 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 17:11:55,068 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 17:11:55,068 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 17:11:55,068 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 -> 60503b6cfd2a800757639deb106bbf28191c36de345606f03caabc1a25a1beff [2022-02-20 17:11:55,277 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 17:11:55,295 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 17:11:55,297 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 17:11:55,298 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 17:11:55,305 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 17:11:55,306 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/nla-digbench/geo1-u.c [2022-02-20 17:11:55,350 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fcf47b769/b082ab5ce28f4827ad9a8cdfd0cc587b/FLAG9c3f9a6a4 [2022-02-20 17:11:55,729 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 17:11:55,729 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench/geo1-u.c [2022-02-20 17:11:55,734 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fcf47b769/b082ab5ce28f4827ad9a8cdfd0cc587b/FLAG9c3f9a6a4 [2022-02-20 17:11:55,742 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fcf47b769/b082ab5ce28f4827ad9a8cdfd0cc587b [2022-02-20 17:11:55,744 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 17:11:55,745 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 17:11:55,746 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 17:11:55,747 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 17:11:55,749 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 17:11:55,750 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 05:11:55" (1/1) ... [2022-02-20 17:11:55,751 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4b21498 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:11:55, skipping insertion in model container [2022-02-20 17:11:55,751 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 05:11:55" (1/1) ... [2022-02-20 17:11:55,756 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 17:11:55,765 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 17:11:55,906 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench/geo1-u.c[555,568] [2022-02-20 17:11:55,932 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 17:11:55,938 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 17:11:55,946 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench/geo1-u.c[555,568] [2022-02-20 17:11:55,950 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 17:11:55,960 INFO L208 MainTranslator]: Completed translation [2022-02-20 17:11:55,960 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:11:55 WrapperNode [2022-02-20 17:11:55,960 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 17:11:55,961 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 17:11:55,961 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 17:11:55,962 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 17:11:55,967 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:11:55" (1/1) ... [2022-02-20 17:11:55,974 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:11:55" (1/1) ... [2022-02-20 17:11:55,988 INFO L137 Inliner]: procedures = 14, calls = 9, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 36 [2022-02-20 17:11:55,988 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 17:11:55,989 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 17:11:55,989 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 17:11:55,989 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 17:11:55,995 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:11:55" (1/1) ... [2022-02-20 17:11:55,995 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:11:55" (1/1) ... [2022-02-20 17:11:55,997 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:11:55" (1/1) ... [2022-02-20 17:11:55,998 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:11:55" (1/1) ... [2022-02-20 17:11:56,005 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:11:55" (1/1) ... [2022-02-20 17:11:56,009 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:11:55" (1/1) ... [2022-02-20 17:11:56,010 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:11:55" (1/1) ... [2022-02-20 17:11:56,011 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 17:11:56,011 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 17:11:56,012 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 17:11:56,012 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 17:11:56,013 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:11:55" (1/1) ... [2022-02-20 17:11:56,018 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 17:11:56,025 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 17:11:56,057 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 17:11:56,064 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 17:11:56,085 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 17:11:56,085 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-20 17:11:56,086 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 17:11:56,086 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 17:11:56,086 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-02-20 17:11:56,086 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-02-20 17:11:56,122 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 17:11:56,124 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 17:11:56,198 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 17:11:56,202 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 17:11:56,203 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-02-20 17:11:56,204 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 05:11:56 BoogieIcfgContainer [2022-02-20 17:11:56,204 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 17:11:56,205 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 17:11:56,205 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 17:11:56,208 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 17:11:56,208 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 05:11:55" (1/3) ... [2022-02-20 17:11:56,208 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@26a301ef and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 05:11:56, skipping insertion in model container [2022-02-20 17:11:56,208 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:11:55" (2/3) ... [2022-02-20 17:11:56,209 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@26a301ef and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 05:11:56, skipping insertion in model container [2022-02-20 17:11:56,209 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 05:11:56" (3/3) ... [2022-02-20 17:11:56,209 INFO L111 eAbstractionObserver]: Analyzing ICFG geo1-u.c [2022-02-20 17:11:56,212 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 17:11:56,213 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-02-20 17:11:56,239 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 17:11:56,243 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 17:11:56,243 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-02-20 17:11:56,254 INFO L276 IsEmpty]: Start isEmpty. Operand has 17 states, 12 states have (on average 1.4166666666666667) internal successors, (17), 13 states have internal predecessors, (17), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 17:11:56,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-02-20 17:11:56,260 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:11:56,260 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-02-20 17:11:56,260 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 17:11:56,263 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:11:56,264 INFO L85 PathProgramCache]: Analyzing trace with hash 1811386335, now seen corresponding path program 1 times [2022-02-20 17:11:56,269 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 17:11:56,270 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1218262222] [2022-02-20 17:11:56,270 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:11:56,270 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 17:11:56,324 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-20 17:11:56,324 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [364727785] [2022-02-20 17:11:56,325 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:11:56,325 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 17:11:56,325 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 17:11:56,326 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-20 17:11:56,327 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-02-20 17:11:56,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:11:56,360 INFO L263 TraceCheckSpWp]: Trace formula consists of 41 conjuncts, 7 conjunts are in the unsatisfiable core [2022-02-20 17:11:56,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:11:56,370 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 17:11:56,509 INFO L290 TraceCheckUtils]: 0: Hoare triple {20#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(9, 2);call #Ultimate.allocInit(12, 3); {20#true} is VALID [2022-02-20 17:11:56,510 INFO L290 TraceCheckUtils]: 1: Hoare triple {20#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_~z~0#1, main_~k~0#1, main_~x~0#1, main_~y~0#1, main_~c~0#1;havoc main_~z~0#1;havoc main_~k~0#1;havoc main_~x~0#1;havoc main_~y~0#1;havoc main_~c~0#1;main_~z~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;main_~k~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;main_~x~0#1 := 1;main_~y~0#1 := main_~z~0#1 % 4294967296;main_~c~0#1 := 1; {28#(and (= |ULTIMATE.start_main_~x~0#1| 1) (= |ULTIMATE.start_main_~y~0#1| (mod |ULTIMATE.start_main_~z~0#1| 4294967296)))} is VALID [2022-02-20 17:11:56,511 INFO L290 TraceCheckUtils]: 2: Hoare triple {28#(and (= |ULTIMATE.start_main_~x~0#1| 1) (= |ULTIMATE.start_main_~y~0#1| (mod |ULTIMATE.start_main_~z~0#1| 4294967296)))} assume !false; {28#(and (= |ULTIMATE.start_main_~x~0#1| 1) (= |ULTIMATE.start_main_~y~0#1| (mod |ULTIMATE.start_main_~z~0#1| 4294967296)))} is VALID [2022-02-20 17:11:56,512 INFO L272 TraceCheckUtils]: 3: Hoare triple {28#(and (= |ULTIMATE.start_main_~x~0#1| 1) (= |ULTIMATE.start_main_~y~0#1| (mod |ULTIMATE.start_main_~z~0#1| 4294967296)))} call __VERIFIER_assert((if 0 == 1 + (main_~x~0#1 * (main_~z~0#1 % 4294967296) - main_~x~0#1 - main_~y~0#1) then 1 else 0)); {35#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-02-20 17:11:56,513 INFO L290 TraceCheckUtils]: 4: Hoare triple {35#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {39#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-02-20 17:11:56,513 INFO L290 TraceCheckUtils]: 5: Hoare triple {39#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {21#false} is VALID [2022-02-20 17:11:56,513 INFO L290 TraceCheckUtils]: 6: Hoare triple {21#false} assume !false; {21#false} is VALID [2022-02-20 17:11:56,514 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 17:11:56,514 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 17:11:56,514 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 17:11:56,515 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1218262222] [2022-02-20 17:11:56,515 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-20 17:11:56,516 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [364727785] [2022-02-20 17:11:56,516 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [364727785] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 17:11:56,516 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 17:11:56,516 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 17:11:56,519 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [875100241] [2022-02-20 17:11:56,520 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 17:11:56,549 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.2) internal successors, (6), 4 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2022-02-20 17:11:56,550 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 17:11:56,552 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 1.2) internal successors, (6), 4 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:11:56,567 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 7 edges. 7 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:11:56,567 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 17:11:56,567 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 17:11:56,589 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 17:11:56,590 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 17:11:56,592 INFO L87 Difference]: Start difference. First operand has 17 states, 12 states have (on average 1.4166666666666667) internal successors, (17), 13 states have internal predecessors, (17), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 5 states, 5 states have (on average 1.2) internal successors, (6), 4 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:11:56,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:11:56,770 INFO L93 Difference]: Finished difference Result 40 states and 55 transitions. [2022-02-20 17:11:56,770 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 17:11:56,770 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.2) internal successors, (6), 4 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2022-02-20 17:11:56,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 17:11:56,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 1.2) internal successors, (6), 4 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:11:56,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 55 transitions. [2022-02-20 17:11:56,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 1.2) internal successors, (6), 4 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:11:56,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 55 transitions. [2022-02-20 17:11:56,785 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 55 transitions. [2022-02-20 17:11:56,836 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 55 edges. 55 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:11:56,846 INFO L225 Difference]: With dead ends: 40 [2022-02-20 17:11:56,846 INFO L226 Difference]: Without dead ends: 21 [2022-02-20 17:11:56,849 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-02-20 17:11:56,853 INFO L933 BasicCegarLoop]: 14 mSDtfsCounter, 6 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 53 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 17:11:56,854 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [7 Valid, 53 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 17:11:56,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2022-02-20 17:11:56,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 19. [2022-02-20 17:11:56,883 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 17:11:56,883 INFO L82 GeneralOperation]: Start isEquivalent. First operand 21 states. Second operand has 19 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 15 states have internal predecessors, (15), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 17:11:56,884 INFO L74 IsIncluded]: Start isIncluded. First operand 21 states. Second operand has 19 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 15 states have internal predecessors, (15), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 17:11:56,885 INFO L87 Difference]: Start difference. First operand 21 states. Second operand has 19 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 15 states have internal predecessors, (15), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 17:11:56,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:11:56,894 INFO L93 Difference]: Finished difference Result 21 states and 23 transitions. [2022-02-20 17:11:56,894 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 23 transitions. [2022-02-20 17:11:56,895 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:11:56,895 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:11:56,896 INFO L74 IsIncluded]: Start isIncluded. First operand has 19 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 15 states have internal predecessors, (15), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Second operand 21 states. [2022-02-20 17:11:56,897 INFO L87 Difference]: Start difference. First operand has 19 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 15 states have internal predecessors, (15), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Second operand 21 states. [2022-02-20 17:11:56,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:11:56,900 INFO L93 Difference]: Finished difference Result 21 states and 23 transitions. [2022-02-20 17:11:56,900 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 23 transitions. [2022-02-20 17:11:56,901 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:11:56,901 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:11:56,901 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 17:11:56,901 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 17:11:56,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 15 states have internal predecessors, (15), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 17:11:56,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 20 transitions. [2022-02-20 17:11:56,904 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 20 transitions. Word has length 7 [2022-02-20 17:11:56,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 17:11:56,905 INFO L470 AbstractCegarLoop]: Abstraction has 19 states and 20 transitions. [2022-02-20 17:11:56,907 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.2) internal successors, (6), 4 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:11:56,907 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 20 transitions. [2022-02-20 17:11:56,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-02-20 17:11:56,908 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:11:56,908 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 17:11:56,925 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-02-20 17:11:57,125 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2022-02-20 17:11:57,126 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 17:11:57,127 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:11:57,127 INFO L85 PathProgramCache]: Analyzing trace with hash -555889191, now seen corresponding path program 1 times [2022-02-20 17:11:57,127 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 17:11:57,127 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1530004495] [2022-02-20 17:11:57,128 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:11:57,128 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 17:11:57,142 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-20 17:11:57,148 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1363593103] [2022-02-20 17:11:57,149 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:11:57,149 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 17:11:57,150 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 17:11:57,151 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-20 17:11:57,163 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-02-20 17:11:57,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:11:57,200 INFO L263 TraceCheckSpWp]: Trace formula consists of 58 conjuncts, 11 conjunts are in the unsatisfiable core [2022-02-20 17:11:57,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:11:57,208 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 17:11:57,347 INFO L290 TraceCheckUtils]: 0: Hoare triple {168#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(9, 2);call #Ultimate.allocInit(12, 3); {168#true} is VALID [2022-02-20 17:11:57,348 INFO L290 TraceCheckUtils]: 1: Hoare triple {168#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_~z~0#1, main_~k~0#1, main_~x~0#1, main_~y~0#1, main_~c~0#1;havoc main_~z~0#1;havoc main_~k~0#1;havoc main_~x~0#1;havoc main_~y~0#1;havoc main_~c~0#1;main_~z~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;main_~k~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;main_~x~0#1 := 1;main_~y~0#1 := main_~z~0#1 % 4294967296;main_~c~0#1 := 1; {176#(and (= |ULTIMATE.start_main_~x~0#1| 1) (= |ULTIMATE.start_main_~y~0#1| (mod |ULTIMATE.start_main_~z~0#1| 4294967296)))} is VALID [2022-02-20 17:11:57,348 INFO L290 TraceCheckUtils]: 2: Hoare triple {176#(and (= |ULTIMATE.start_main_~x~0#1| 1) (= |ULTIMATE.start_main_~y~0#1| (mod |ULTIMATE.start_main_~z~0#1| 4294967296)))} assume !false; {176#(and (= |ULTIMATE.start_main_~x~0#1| 1) (= |ULTIMATE.start_main_~y~0#1| (mod |ULTIMATE.start_main_~z~0#1| 4294967296)))} is VALID [2022-02-20 17:11:57,349 INFO L272 TraceCheckUtils]: 3: Hoare triple {176#(and (= |ULTIMATE.start_main_~x~0#1| 1) (= |ULTIMATE.start_main_~y~0#1| (mod |ULTIMATE.start_main_~z~0#1| 4294967296)))} call __VERIFIER_assert((if 0 == 1 + (main_~x~0#1 * (main_~z~0#1 % 4294967296) - main_~x~0#1 - main_~y~0#1) then 1 else 0)); {168#true} is VALID [2022-02-20 17:11:57,349 INFO L290 TraceCheckUtils]: 4: Hoare triple {168#true} ~cond := #in~cond; {168#true} is VALID [2022-02-20 17:11:57,349 INFO L290 TraceCheckUtils]: 5: Hoare triple {168#true} assume !(0 == ~cond); {168#true} is VALID [2022-02-20 17:11:57,349 INFO L290 TraceCheckUtils]: 6: Hoare triple {168#true} assume true; {168#true} is VALID [2022-02-20 17:11:57,350 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {168#true} {176#(and (= |ULTIMATE.start_main_~x~0#1| 1) (= |ULTIMATE.start_main_~y~0#1| (mod |ULTIMATE.start_main_~z~0#1| 4294967296)))} #39#return; {176#(and (= |ULTIMATE.start_main_~x~0#1| 1) (= |ULTIMATE.start_main_~y~0#1| (mod |ULTIMATE.start_main_~z~0#1| 4294967296)))} is VALID [2022-02-20 17:11:57,351 INFO L290 TraceCheckUtils]: 8: Hoare triple {176#(and (= |ULTIMATE.start_main_~x~0#1| 1) (= |ULTIMATE.start_main_~y~0#1| (mod |ULTIMATE.start_main_~z~0#1| 4294967296)))} assume !!(main_~c~0#1 < main_~k~0#1 % 4294967296);main_~c~0#1 := 1 + main_~c~0#1;main_~x~0#1 := 1 + main_~x~0#1 * (main_~z~0#1 % 4294967296);main_~y~0#1 := main_~y~0#1 * (main_~z~0#1 % 4294967296); {198#(and (= (* (mod |ULTIMATE.start_main_~z~0#1| 4294967296) (mod |ULTIMATE.start_main_~z~0#1| 4294967296)) |ULTIMATE.start_main_~y~0#1|) (= (+ (mod |ULTIMATE.start_main_~z~0#1| 4294967296) 1) |ULTIMATE.start_main_~x~0#1|))} is VALID [2022-02-20 17:11:57,352 INFO L290 TraceCheckUtils]: 9: Hoare triple {198#(and (= (* (mod |ULTIMATE.start_main_~z~0#1| 4294967296) (mod |ULTIMATE.start_main_~z~0#1| 4294967296)) |ULTIMATE.start_main_~y~0#1|) (= (+ (mod |ULTIMATE.start_main_~z~0#1| 4294967296) 1) |ULTIMATE.start_main_~x~0#1|))} assume !false; {198#(and (= (* (mod |ULTIMATE.start_main_~z~0#1| 4294967296) (mod |ULTIMATE.start_main_~z~0#1| 4294967296)) |ULTIMATE.start_main_~y~0#1|) (= (+ (mod |ULTIMATE.start_main_~z~0#1| 4294967296) 1) |ULTIMATE.start_main_~x~0#1|))} is VALID [2022-02-20 17:11:57,354 INFO L272 TraceCheckUtils]: 10: Hoare triple {198#(and (= (* (mod |ULTIMATE.start_main_~z~0#1| 4294967296) (mod |ULTIMATE.start_main_~z~0#1| 4294967296)) |ULTIMATE.start_main_~y~0#1|) (= (+ (mod |ULTIMATE.start_main_~z~0#1| 4294967296) 1) |ULTIMATE.start_main_~x~0#1|))} call __VERIFIER_assert((if 0 == 1 + (main_~x~0#1 * (main_~z~0#1 % 4294967296) - main_~x~0#1 - main_~y~0#1) then 1 else 0)); {205#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-02-20 17:11:57,355 INFO L290 TraceCheckUtils]: 11: Hoare triple {205#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {209#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-02-20 17:11:57,355 INFO L290 TraceCheckUtils]: 12: Hoare triple {209#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {169#false} is VALID [2022-02-20 17:11:57,356 INFO L290 TraceCheckUtils]: 13: Hoare triple {169#false} assume !false; {169#false} is VALID [2022-02-20 17:11:57,356 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 17:11:57,356 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 17:11:57,560 INFO L290 TraceCheckUtils]: 13: Hoare triple {169#false} assume !false; {169#false} is VALID [2022-02-20 17:11:57,561 INFO L290 TraceCheckUtils]: 12: Hoare triple {209#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {169#false} is VALID [2022-02-20 17:11:57,562 INFO L290 TraceCheckUtils]: 11: Hoare triple {205#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {209#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-02-20 17:11:57,563 INFO L272 TraceCheckUtils]: 10: Hoare triple {225#(= (+ (* |ULTIMATE.start_main_~x~0#1| (mod |ULTIMATE.start_main_~z~0#1| 4294967296)) 1) (+ |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~y~0#1|))} call __VERIFIER_assert((if 0 == 1 + (main_~x~0#1 * (main_~z~0#1 % 4294967296) - main_~x~0#1 - main_~y~0#1) then 1 else 0)); {205#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-02-20 17:11:57,563 INFO L290 TraceCheckUtils]: 9: Hoare triple {225#(= (+ (* |ULTIMATE.start_main_~x~0#1| (mod |ULTIMATE.start_main_~z~0#1| 4294967296)) 1) (+ |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~y~0#1|))} assume !false; {225#(= (+ (* |ULTIMATE.start_main_~x~0#1| (mod |ULTIMATE.start_main_~z~0#1| 4294967296)) 1) (+ |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~y~0#1|))} is VALID [2022-02-20 17:11:57,566 INFO L290 TraceCheckUtils]: 8: Hoare triple {232#(= (+ (* |ULTIMATE.start_main_~x~0#1| (mod |ULTIMATE.start_main_~z~0#1| 4294967296)) (* |ULTIMATE.start_main_~y~0#1| (mod |ULTIMATE.start_main_~z~0#1| 4294967296)) 1) (+ (* (+ (* |ULTIMATE.start_main_~x~0#1| (mod |ULTIMATE.start_main_~z~0#1| 4294967296)) 1) (mod |ULTIMATE.start_main_~z~0#1| 4294967296)) 1))} assume !!(main_~c~0#1 < main_~k~0#1 % 4294967296);main_~c~0#1 := 1 + main_~c~0#1;main_~x~0#1 := 1 + main_~x~0#1 * (main_~z~0#1 % 4294967296);main_~y~0#1 := main_~y~0#1 * (main_~z~0#1 % 4294967296); {225#(= (+ (* |ULTIMATE.start_main_~x~0#1| (mod |ULTIMATE.start_main_~z~0#1| 4294967296)) 1) (+ |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~y~0#1|))} is VALID [2022-02-20 17:11:57,567 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {168#true} {232#(= (+ (* |ULTIMATE.start_main_~x~0#1| (mod |ULTIMATE.start_main_~z~0#1| 4294967296)) (* |ULTIMATE.start_main_~y~0#1| (mod |ULTIMATE.start_main_~z~0#1| 4294967296)) 1) (+ (* (+ (* |ULTIMATE.start_main_~x~0#1| (mod |ULTIMATE.start_main_~z~0#1| 4294967296)) 1) (mod |ULTIMATE.start_main_~z~0#1| 4294967296)) 1))} #39#return; {232#(= (+ (* |ULTIMATE.start_main_~x~0#1| (mod |ULTIMATE.start_main_~z~0#1| 4294967296)) (* |ULTIMATE.start_main_~y~0#1| (mod |ULTIMATE.start_main_~z~0#1| 4294967296)) 1) (+ (* (+ (* |ULTIMATE.start_main_~x~0#1| (mod |ULTIMATE.start_main_~z~0#1| 4294967296)) 1) (mod |ULTIMATE.start_main_~z~0#1| 4294967296)) 1))} is VALID [2022-02-20 17:11:57,567 INFO L290 TraceCheckUtils]: 6: Hoare triple {168#true} assume true; {168#true} is VALID [2022-02-20 17:11:57,567 INFO L290 TraceCheckUtils]: 5: Hoare triple {168#true} assume !(0 == ~cond); {168#true} is VALID [2022-02-20 17:11:57,567 INFO L290 TraceCheckUtils]: 4: Hoare triple {168#true} ~cond := #in~cond; {168#true} is VALID [2022-02-20 17:11:57,568 INFO L272 TraceCheckUtils]: 3: Hoare triple {232#(= (+ (* |ULTIMATE.start_main_~x~0#1| (mod |ULTIMATE.start_main_~z~0#1| 4294967296)) (* |ULTIMATE.start_main_~y~0#1| (mod |ULTIMATE.start_main_~z~0#1| 4294967296)) 1) (+ (* (+ (* |ULTIMATE.start_main_~x~0#1| (mod |ULTIMATE.start_main_~z~0#1| 4294967296)) 1) (mod |ULTIMATE.start_main_~z~0#1| 4294967296)) 1))} call __VERIFIER_assert((if 0 == 1 + (main_~x~0#1 * (main_~z~0#1 % 4294967296) - main_~x~0#1 - main_~y~0#1) then 1 else 0)); {168#true} is VALID [2022-02-20 17:11:57,568 INFO L290 TraceCheckUtils]: 2: Hoare triple {232#(= (+ (* |ULTIMATE.start_main_~x~0#1| (mod |ULTIMATE.start_main_~z~0#1| 4294967296)) (* |ULTIMATE.start_main_~y~0#1| (mod |ULTIMATE.start_main_~z~0#1| 4294967296)) 1) (+ (* (+ (* |ULTIMATE.start_main_~x~0#1| (mod |ULTIMATE.start_main_~z~0#1| 4294967296)) 1) (mod |ULTIMATE.start_main_~z~0#1| 4294967296)) 1))} assume !false; {232#(= (+ (* |ULTIMATE.start_main_~x~0#1| (mod |ULTIMATE.start_main_~z~0#1| 4294967296)) (* |ULTIMATE.start_main_~y~0#1| (mod |ULTIMATE.start_main_~z~0#1| 4294967296)) 1) (+ (* (+ (* |ULTIMATE.start_main_~x~0#1| (mod |ULTIMATE.start_main_~z~0#1| 4294967296)) 1) (mod |ULTIMATE.start_main_~z~0#1| 4294967296)) 1))} is VALID [2022-02-20 17:11:57,570 INFO L290 TraceCheckUtils]: 1: Hoare triple {168#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_~z~0#1, main_~k~0#1, main_~x~0#1, main_~y~0#1, main_~c~0#1;havoc main_~z~0#1;havoc main_~k~0#1;havoc main_~x~0#1;havoc main_~y~0#1;havoc main_~c~0#1;main_~z~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;main_~k~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;main_~x~0#1 := 1;main_~y~0#1 := main_~z~0#1 % 4294967296;main_~c~0#1 := 1; {232#(= (+ (* |ULTIMATE.start_main_~x~0#1| (mod |ULTIMATE.start_main_~z~0#1| 4294967296)) (* |ULTIMATE.start_main_~y~0#1| (mod |ULTIMATE.start_main_~z~0#1| 4294967296)) 1) (+ (* (+ (* |ULTIMATE.start_main_~x~0#1| (mod |ULTIMATE.start_main_~z~0#1| 4294967296)) 1) (mod |ULTIMATE.start_main_~z~0#1| 4294967296)) 1))} is VALID [2022-02-20 17:11:57,570 INFO L290 TraceCheckUtils]: 0: Hoare triple {168#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(9, 2);call #Ultimate.allocInit(12, 3); {168#true} is VALID [2022-02-20 17:11:57,570 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 17:11:57,571 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 17:11:57,571 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1530004495] [2022-02-20 17:11:57,571 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-20 17:11:57,571 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1363593103] [2022-02-20 17:11:57,571 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1363593103] provided 1 perfect and 1 imperfect interpolant sequences [2022-02-20 17:11:57,572 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-02-20 17:11:57,572 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 8 [2022-02-20 17:11:57,572 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1576686610] [2022-02-20 17:11:57,572 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 17:11:57,573 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 5 states have internal predecessors, (11), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14 [2022-02-20 17:11:57,573 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 17:11:57,573 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 5 states have internal predecessors, (11), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 17:11:57,596 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 14 edges. 14 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:11:57,596 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-20 17:11:57,597 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 17:11:57,602 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-20 17:11:57,602 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2022-02-20 17:11:57,602 INFO L87 Difference]: Start difference. First operand 19 states and 20 transitions. Second operand has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 5 states have internal predecessors, (11), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 17:12:00,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:12:00,319 INFO L93 Difference]: Finished difference Result 25 states and 25 transitions. [2022-02-20 17:12:00,319 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 17:12:00,319 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 5 states have internal predecessors, (11), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14 [2022-02-20 17:12:00,319 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 17:12:00,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 5 states have internal predecessors, (11), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 17:12:00,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 19 transitions. [2022-02-20 17:12:00,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 5 states have internal predecessors, (11), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 17:12:00,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 19 transitions. [2022-02-20 17:12:00,322 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 19 transitions. [2022-02-20 17:12:00,332 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:12:00,333 INFO L225 Difference]: With dead ends: 25 [2022-02-20 17:12:00,333 INFO L226 Difference]: Without dead ends: 21 [2022-02-20 17:12:00,333 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 19 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2022-02-20 17:12:00,334 INFO L933 BasicCegarLoop]: 9 mSDtfsCounter, 6 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 37 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2022-02-20 17:12:00,335 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [7 Valid, 37 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2022-02-20 17:12:00,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2022-02-20 17:12:00,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 15. [2022-02-20 17:12:00,337 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 17:12:00,338 INFO L82 GeneralOperation]: Start isEquivalent. First operand 21 states. Second operand has 15 states, 11 states have (on average 1.0909090909090908) internal successors, (12), 11 states have internal predecessors, (12), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 17:12:00,338 INFO L74 IsIncluded]: Start isIncluded. First operand 21 states. Second operand has 15 states, 11 states have (on average 1.0909090909090908) internal successors, (12), 11 states have internal predecessors, (12), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 17:12:00,338 INFO L87 Difference]: Start difference. First operand 21 states. Second operand has 15 states, 11 states have (on average 1.0909090909090908) internal successors, (12), 11 states have internal predecessors, (12), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 17:12:00,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:12:00,339 INFO L93 Difference]: Finished difference Result 21 states and 21 transitions. [2022-02-20 17:12:00,339 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 21 transitions. [2022-02-20 17:12:00,339 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:12:00,339 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:12:00,339 INFO L74 IsIncluded]: Start isIncluded. First operand has 15 states, 11 states have (on average 1.0909090909090908) internal successors, (12), 11 states have internal predecessors, (12), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 21 states. [2022-02-20 17:12:00,340 INFO L87 Difference]: Start difference. First operand has 15 states, 11 states have (on average 1.0909090909090908) internal successors, (12), 11 states have internal predecessors, (12), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 21 states. [2022-02-20 17:12:00,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:12:00,341 INFO L93 Difference]: Finished difference Result 21 states and 21 transitions. [2022-02-20 17:12:00,341 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 21 transitions. [2022-02-20 17:12:00,341 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:12:00,341 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:12:00,341 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 17:12:00,341 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 17:12:00,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 11 states have (on average 1.0909090909090908) internal successors, (12), 11 states have internal predecessors, (12), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 17:12:00,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 15 transitions. [2022-02-20 17:12:00,342 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 15 transitions. Word has length 14 [2022-02-20 17:12:00,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 17:12:00,342 INFO L470 AbstractCegarLoop]: Abstraction has 15 states and 15 transitions. [2022-02-20 17:12:00,342 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 5 states have internal predecessors, (11), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 17:12:00,342 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2022-02-20 17:12:00,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-02-20 17:12:00,343 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:12:00,343 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 17:12:00,365 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-02-20 17:12:00,568 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable1 [2022-02-20 17:12:00,568 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 17:12:00,569 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:12:00,569 INFO L85 PathProgramCache]: Analyzing trace with hash -603852701, now seen corresponding path program 1 times [2022-02-20 17:12:00,569 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 17:12:00,569 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1706580116] [2022-02-20 17:12:00,570 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:12:00,570 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 17:12:00,578 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-20 17:12:00,578 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1726171602] [2022-02-20 17:12:00,578 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:12:00,578 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 17:12:00,579 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 17:12:00,580 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-20 17:12:00,581 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-02-20 17:12:00,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-20 17:12:00,604 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-20 17:12:00,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-20 17:12:00,617 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-20 17:12:00,617 INFO L628 BasicCegarLoop]: Counterexample is feasible [2022-02-20 17:12:00,618 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-02-20 17:12:00,638 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2022-02-20 17:12:00,820 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 17:12:00,822 INFO L732 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2022-02-20 17:12:00,825 INFO L180 ceAbstractionStarter]: Computing trace abstraction results [2022-02-20 17:12:00,835 FATAL L489 DefaultTranslator]: Callstack has procedure call flag but succeeding procedure is empty at [CALL] call __VERIFIER_assert((if 0 == 1 + (~x~0 * (~z~0 % 4294967296) - ~x~0 - ~y~0) then 1 else 0)); [2022-02-20 17:12:00,835 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: callstack broken after backtranslation by InlinerBacktranslator at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator.translateProgramExecution(InlinerBacktranslator.java:230) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.ModelTranslationContainer.translateProgramExecution(ModelTranslationContainer.java:216) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.ModelTranslationContainer.translateProgramExecution(ModelTranslationContainer.java:225) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.ModelTranslationContainer.translateProgramExecution(ModelTranslationContainer.java:225) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.ModelTranslationContainer.translateProgramExecution(ModelTranslationContainer.java:206) at de.uni_freiburg.informatik.ultimate.core.lib.results.CounterExampleResult.getProgramExecutionAsString(CounterExampleResult.java:155) at de.uni_freiburg.informatik.ultimate.core.lib.results.CounterExampleResult.getLongDescription(CounterExampleResult.java:134) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.ResultService.reportResult(ResultService.java:86) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopResultReporter.reportResult(CegarLoopResultReporter.java:141) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.reportLocationResults(TraceAbstractionStarter.java:607) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:182) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:156) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-02-20 17:12:00,839 INFO L158 Benchmark]: Toolchain (without parser) took 5092.63ms. Allocated memory was 111.1MB in the beginning and 172.0MB in the end (delta: 60.8MB). Free memory was 81.3MB in the beginning and 128.3MB in the end (delta: -47.0MB). Peak memory consumption was 12.7MB. Max. memory is 16.1GB. [2022-02-20 17:12:00,840 INFO L158 Benchmark]: CDTParser took 0.25ms. Allocated memory is still 111.1MB. Free memory is still 66.4MB. There was no memory consumed. Max. memory is 16.1GB. [2022-02-20 17:12:00,840 INFO L158 Benchmark]: CACSL2BoogieTranslator took 214.33ms. Allocated memory is still 111.1MB. Free memory was 81.3MB in the beginning and 85.3MB in the end (delta: -4.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-02-20 17:12:00,840 INFO L158 Benchmark]: Boogie Procedure Inliner took 27.04ms. Allocated memory is still 111.1MB. Free memory was 84.9MB in the beginning and 83.5MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. [2022-02-20 17:12:00,843 INFO L158 Benchmark]: Boogie Preprocessor took 21.75ms. Allocated memory is still 111.1MB. Free memory was 83.5MB in the beginning and 82.5MB in the end (delta: 964.7kB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-20 17:12:00,843 INFO L158 Benchmark]: RCFGBuilder took 192.52ms. Allocated memory is still 111.1MB. Free memory was 82.5MB in the beginning and 73.4MB in the end (delta: 9.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-02-20 17:12:00,843 INFO L158 Benchmark]: TraceAbstraction took 4632.39ms. Allocated memory was 111.1MB in the beginning and 172.0MB in the end (delta: 60.8MB). Free memory was 73.1MB in the beginning and 128.3MB in the end (delta: -55.2MB). Peak memory consumption was 7.3MB. Max. memory is 16.1GB. [2022-02-20 17:12:00,846 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.25ms. Allocated memory is still 111.1MB. Free memory is still 66.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 214.33ms. Allocated memory is still 111.1MB. Free memory was 81.3MB in the beginning and 85.3MB in the end (delta: -4.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 27.04ms. Allocated memory is still 111.1MB. Free memory was 84.9MB in the beginning and 83.5MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 21.75ms. Allocated memory is still 111.1MB. Free memory was 83.5MB in the beginning and 82.5MB in the end (delta: 964.7kB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 192.52ms. Allocated memory is still 111.1MB. Free memory was 82.5MB in the beginning and 73.4MB in the end (delta: 9.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 4632.39ms. Allocated memory was 111.1MB in the beginning and 172.0MB in the end (delta: 60.8MB). Free memory was 73.1MB in the beginning and 128.3MB in the end (delta: -55.2MB). Peak memory consumption was 7.3MB. 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 - ExceptionOrErrorResult: AssertionError: callstack broken after backtranslation by InlinerBacktranslator de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: callstack broken after backtranslation by InlinerBacktranslator: de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator.translateProgramExecution(InlinerBacktranslator.java:230) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2022-02-20 17:12:00,858 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -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/nla-digbench/geo1-u.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 60503b6cfd2a800757639deb106bbf28191c36de345606f03caabc1a25a1beff --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 17:12:02,527 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 17:12:02,530 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 17:12:02,569 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 17:12:02,569 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 17:12:02,572 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 17:12:02,573 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 17:12:02,577 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 17:12:02,579 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 17:12:02,582 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 17:12:02,584 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 17:12:02,585 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 17:12:02,585 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 17:12:02,587 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 17:12:02,588 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 17:12:02,592 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 17:12:02,593 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 17:12:02,594 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 17:12:02,595 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 17:12:02,600 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 17:12:02,601 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 17:12:02,602 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 17:12:02,602 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 17:12:02,604 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 17:12:02,609 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 17:12:02,609 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 17:12:02,609 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 17:12:02,611 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 17:12:02,611 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 17:12:02,612 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 17:12:02,612 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 17:12:02,614 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 17:12:02,615 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 17:12:02,616 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 17:12:02,617 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 17:12:02,617 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 17:12:02,618 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 17:12:02,618 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 17:12:02,618 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 17:12:02,619 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 17:12:02,620 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 17:12:02,621 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2022-02-20 17:12:02,643 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 17:12:02,644 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 17:12:02,644 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 17:12:02,644 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 17:12:02,645 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 17:12:02,645 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 17:12:02,646 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 17:12:02,647 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 17:12:02,647 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 17:12:02,647 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 17:12:02,648 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 17:12:02,648 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 17:12:02,648 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 17:12:02,648 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 17:12:02,648 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 17:12:02,648 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 17:12:02,649 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-02-20 17:12:02,649 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-02-20 17:12:02,649 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-02-20 17:12:02,649 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 17:12:02,649 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 17:12:02,649 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 17:12:02,650 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 17:12:02,650 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 17:12:02,650 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 17:12:02,650 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 17:12:02,650 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 17:12:02,650 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 17:12:02,651 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 17:12:02,651 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 17:12:02,651 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2022-02-20 17:12:02,651 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-02-20 17:12:02,652 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 17:12:02,652 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 17:12:02,652 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 17:12:02,652 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-02-20 17:12:02,652 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 -> 60503b6cfd2a800757639deb106bbf28191c36de345606f03caabc1a25a1beff [2022-02-20 17:12:02,933 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 17:12:02,954 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 17:12:02,956 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 17:12:02,957 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 17:12:02,958 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 17:12:02,959 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/nla-digbench/geo1-u.c [2022-02-20 17:12:03,018 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/149a4eb9e/60f2cf257d164d6a959cfc863415efa7/FLAG304375e8a [2022-02-20 17:12:03,378 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 17:12:03,379 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench/geo1-u.c [2022-02-20 17:12:03,385 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/149a4eb9e/60f2cf257d164d6a959cfc863415efa7/FLAG304375e8a [2022-02-20 17:12:03,397 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/149a4eb9e/60f2cf257d164d6a959cfc863415efa7 [2022-02-20 17:12:03,399 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 17:12:03,400 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 17:12:03,401 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 17:12:03,401 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 17:12:03,403 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 17:12:03,404 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 05:12:03" (1/1) ... [2022-02-20 17:12:03,405 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7d920763 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:12:03, skipping insertion in model container [2022-02-20 17:12:03,405 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 05:12:03" (1/1) ... [2022-02-20 17:12:03,409 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 17:12:03,417 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 17:12:03,526 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench/geo1-u.c[555,568] [2022-02-20 17:12:03,547 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 17:12:03,555 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 17:12:03,571 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench/geo1-u.c[555,568] [2022-02-20 17:12:03,590 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 17:12:03,602 INFO L208 MainTranslator]: Completed translation [2022-02-20 17:12:03,602 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:12:03 WrapperNode [2022-02-20 17:12:03,602 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 17:12:03,603 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 17:12:03,603 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 17:12:03,603 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 17:12:03,607 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:12:03" (1/1) ... [2022-02-20 17:12:03,612 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:12:03" (1/1) ... [2022-02-20 17:12:03,627 INFO L137 Inliner]: procedures = 14, calls = 9, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 36 [2022-02-20 17:12:03,627 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 17:12:03,628 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 17:12:03,628 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 17:12:03,628 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 17:12:03,633 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:12:03" (1/1) ... [2022-02-20 17:12:03,633 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:12:03" (1/1) ... [2022-02-20 17:12:03,642 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:12:03" (1/1) ... [2022-02-20 17:12:03,642 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:12:03" (1/1) ... [2022-02-20 17:12:03,654 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:12:03" (1/1) ... [2022-02-20 17:12:03,656 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:12:03" (1/1) ... [2022-02-20 17:12:03,658 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:12:03" (1/1) ... [2022-02-20 17:12:03,661 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 17:12:03,663 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 17:12:03,664 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 17:12:03,664 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 17:12:03,666 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:12:03" (1/1) ... [2022-02-20 17:12:03,670 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 17:12:03,677 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 17:12:03,696 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 17:12:03,711 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 17:12:03,726 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 17:12:03,726 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-02-20 17:12:03,726 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 17:12:03,727 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 17:12:03,727 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-02-20 17:12:03,727 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-02-20 17:12:03,774 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 17:12:03,775 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 17:12:03,969 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 17:12:03,973 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 17:12:03,973 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-02-20 17:12:03,974 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 05:12:03 BoogieIcfgContainer [2022-02-20 17:12:03,975 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 17:12:03,976 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 17:12:03,976 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 17:12:03,978 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 17:12:03,978 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 05:12:03" (1/3) ... [2022-02-20 17:12:03,978 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1f572359 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 05:12:03, skipping insertion in model container [2022-02-20 17:12:03,978 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:12:03" (2/3) ... [2022-02-20 17:12:03,979 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1f572359 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 05:12:03, skipping insertion in model container [2022-02-20 17:12:03,979 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 05:12:03" (3/3) ... [2022-02-20 17:12:03,980 INFO L111 eAbstractionObserver]: Analyzing ICFG geo1-u.c [2022-02-20 17:12:03,983 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 17:12:03,983 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-02-20 17:12:04,008 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 17:12:04,013 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 17:12:04,013 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-02-20 17:12:04,025 INFO L276 IsEmpty]: Start isEmpty. Operand has 17 states, 12 states have (on average 1.4166666666666667) internal successors, (17), 13 states have internal predecessors, (17), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 17:12:04,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-02-20 17:12:04,028 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:12:04,028 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-02-20 17:12:04,028 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 17:12:04,031 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:12:04,032 INFO L85 PathProgramCache]: Analyzing trace with hash 1811386335, now seen corresponding path program 1 times [2022-02-20 17:12:04,039 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 17:12:04,039 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2144870171] [2022-02-20 17:12:04,039 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:12:04,040 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 17:12:04,040 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 17:12:04,042 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 17:12:04,066 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 17:12:04,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:12:04,169 INFO L263 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 5 conjunts are in the unsatisfiable core [2022-02-20 17:12:04,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:12:04,187 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 17:12:04,388 INFO L290 TraceCheckUtils]: 0: Hoare triple {20#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv32, 0bv32;assume 0bv1 == #valid[0bv32];assume ~bvult32(0bv32, #StackHeapBarrier);call #Ultimate.allocInit(2bv32, 1bv32);call write~init~intINTTYPE1(48bv8, 1bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 1bv32, 1bv32, 1bv32);call #Ultimate.allocInit(9bv32, 2bv32);call #Ultimate.allocInit(12bv32, 3bv32); {20#true} is VALID [2022-02-20 17:12:04,389 INFO L290 TraceCheckUtils]: 1: Hoare triple {20#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_~z~0#1, main_~k~0#1, main_~x~0#1, main_~y~0#1, main_~c~0#1;havoc main_~z~0#1;havoc main_~k~0#1;havoc main_~x~0#1;havoc main_~y~0#1;havoc main_~c~0#1;main_~z~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;main_~k~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;main_~x~0#1 := 1bv64;main_~y~0#1 := ~zero_extendFrom32To64(main_~z~0#1);main_~c~0#1 := 1bv64; {28#(and (= |ULTIMATE.start_main_~x~0#1| (_ bv1 64)) (= |ULTIMATE.start_main_~y~0#1| ((_ zero_extend 32) |ULTIMATE.start_main_~z~0#1|)))} is VALID [2022-02-20 17:12:04,389 INFO L290 TraceCheckUtils]: 2: Hoare triple {28#(and (= |ULTIMATE.start_main_~x~0#1| (_ bv1 64)) (= |ULTIMATE.start_main_~y~0#1| ((_ zero_extend 32) |ULTIMATE.start_main_~z~0#1|)))} assume !false; {28#(and (= |ULTIMATE.start_main_~x~0#1| (_ bv1 64)) (= |ULTIMATE.start_main_~y~0#1| ((_ zero_extend 32) |ULTIMATE.start_main_~z~0#1|)))} is VALID [2022-02-20 17:12:04,391 INFO L272 TraceCheckUtils]: 3: Hoare triple {28#(and (= |ULTIMATE.start_main_~x~0#1| (_ bv1 64)) (= |ULTIMATE.start_main_~y~0#1| ((_ zero_extend 32) |ULTIMATE.start_main_~z~0#1|)))} call __VERIFIER_assert((if 0bv64 == ~bvadd64(1bv64, ~bvsub64(~bvsub64(~bvmul64(main_~x~0#1, ~zero_extendFrom32To64(main_~z~0#1)), main_~x~0#1), main_~y~0#1)) then 1bv32 else 0bv32)); {35#(= (_ bv1 32) |__VERIFIER_assert_#in~cond|)} is VALID [2022-02-20 17:12:04,391 INFO L290 TraceCheckUtils]: 4: Hoare triple {35#(= (_ bv1 32) |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {39#(= __VERIFIER_assert_~cond (_ bv1 32))} is VALID [2022-02-20 17:12:04,392 INFO L290 TraceCheckUtils]: 5: Hoare triple {39#(= __VERIFIER_assert_~cond (_ bv1 32))} assume 0bv32 == ~cond; {21#false} is VALID [2022-02-20 17:12:04,392 INFO L290 TraceCheckUtils]: 6: Hoare triple {21#false} assume !false; {21#false} is VALID [2022-02-20 17:12:04,393 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 17:12:04,393 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 17:12:04,393 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 17:12:04,394 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2144870171] [2022-02-20 17:12:04,394 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2144870171] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 17:12:04,394 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 17:12:04,395 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 17:12:04,396 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1991667648] [2022-02-20 17:12:04,396 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 17:12:04,399 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.2) internal successors, (6), 4 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2022-02-20 17:12:04,400 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 17:12:04,402 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 1.2) internal successors, (6), 4 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:12:04,447 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 7 edges. 7 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:12:04,448 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 17:12:04,448 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 17:12:04,464 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 17:12:04,464 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 17:12:04,466 INFO L87 Difference]: Start difference. First operand has 17 states, 12 states have (on average 1.4166666666666667) internal successors, (17), 13 states have internal predecessors, (17), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 5 states, 5 states have (on average 1.2) internal successors, (6), 4 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:12:05,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:12:05,224 INFO L93 Difference]: Finished difference Result 40 states and 55 transitions. [2022-02-20 17:12:05,225 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 17:12:05,225 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.2) internal successors, (6), 4 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2022-02-20 17:12:05,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 17:12:05,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 1.2) internal successors, (6), 4 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:12:05,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 55 transitions. [2022-02-20 17:12:05,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 1.2) internal successors, (6), 4 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:12:05,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 55 transitions. [2022-02-20 17:12:05,237 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 55 transitions. [2022-02-20 17:12:05,560 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 55 edges. 55 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:12:05,565 INFO L225 Difference]: With dead ends: 40 [2022-02-20 17:12:05,566 INFO L226 Difference]: Without dead ends: 21 [2022-02-20 17:12:05,567 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-02-20 17:12:05,569 INFO L933 BasicCegarLoop]: 14 mSDtfsCounter, 6 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 53 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-02-20 17:12:05,570 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [7 Valid, 53 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-02-20 17:12:05,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2022-02-20 17:12:05,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 19. [2022-02-20 17:12:05,593 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 17:12:05,593 INFO L82 GeneralOperation]: Start isEquivalent. First operand 21 states. Second operand has 19 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 15 states have internal predecessors, (15), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 17:12:05,594 INFO L74 IsIncluded]: Start isIncluded. First operand 21 states. Second operand has 19 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 15 states have internal predecessors, (15), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 17:12:05,595 INFO L87 Difference]: Start difference. First operand 21 states. Second operand has 19 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 15 states have internal predecessors, (15), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 17:12:05,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:12:05,605 INFO L93 Difference]: Finished difference Result 21 states and 23 transitions. [2022-02-20 17:12:05,605 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 23 transitions. [2022-02-20 17:12:05,606 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:12:05,606 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:12:05,606 INFO L74 IsIncluded]: Start isIncluded. First operand has 19 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 15 states have internal predecessors, (15), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Second operand 21 states. [2022-02-20 17:12:05,606 INFO L87 Difference]: Start difference. First operand has 19 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 15 states have internal predecessors, (15), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Second operand 21 states. [2022-02-20 17:12:05,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:12:05,618 INFO L93 Difference]: Finished difference Result 21 states and 23 transitions. [2022-02-20 17:12:05,618 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 23 transitions. [2022-02-20 17:12:05,619 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:12:05,619 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:12:05,619 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 17:12:05,619 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 17:12:05,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 15 states have internal predecessors, (15), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 17:12:05,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 20 transitions. [2022-02-20 17:12:05,624 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 20 transitions. Word has length 7 [2022-02-20 17:12:05,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 17:12:05,627 INFO L470 AbstractCegarLoop]: Abstraction has 19 states and 20 transitions. [2022-02-20 17:12:05,627 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.2) internal successors, (6), 4 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:12:05,628 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 20 transitions. [2022-02-20 17:12:05,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-02-20 17:12:05,630 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:12:05,631 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 17:12:05,659 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 17:12:05,838 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 17:12:05,840 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 17:12:05,841 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:12:05,845 INFO L85 PathProgramCache]: Analyzing trace with hash -555889191, now seen corresponding path program 1 times [2022-02-20 17:12:05,845 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 17:12:05,845 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [553916293] [2022-02-20 17:12:05,846 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:12:05,846 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 17:12:05,846 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 17:12:05,859 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 17:12:05,864 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Waiting until timeout for monitored process