./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/nla-digbench-scaling/geo1-u_valuebound5.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-scaling/geo1-u_valuebound5.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 3fabbb4366f4018d2566a269c32a869eae5327dd4c35f2c68a01653f56969989 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 17:29:12,244 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 17:29:12,246 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 17:29:12,278 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 17:29:12,278 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 17:29:12,281 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 17:29:12,283 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 17:29:12,285 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 17:29:12,287 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 17:29:12,289 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 17:29:12,290 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 17:29:12,291 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 17:29:12,291 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 17:29:12,295 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 17:29:12,296 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 17:29:12,297 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 17:29:12,297 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 17:29:12,298 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 17:29:12,299 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 17:29:12,300 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 17:29:12,301 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 17:29:12,301 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 17:29:12,302 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 17:29:12,303 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 17:29:12,304 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 17:29:12,304 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 17:29:12,305 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 17:29:12,305 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 17:29:12,305 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 17:29:12,306 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 17:29:12,306 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 17:29:12,307 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 17:29:12,307 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 17:29:12,308 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 17:29:12,308 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 17:29:12,308 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 17:29:12,309 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 17:29:12,310 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 17:29:12,310 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 17:29:12,311 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 17:29:12,312 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 17:29:12,312 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:29:12,325 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 17:29:12,329 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 17:29:12,329 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 17:29:12,329 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 17:29:12,330 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 17:29:12,330 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 17:29:12,331 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 17:29:12,331 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 17:29:12,331 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 17:29:12,331 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 17:29:12,332 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 17:29:12,332 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 17:29:12,332 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 17:29:12,332 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 17:29:12,333 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 17:29:12,333 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 17:29:12,333 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 17:29:12,333 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 17:29:12,333 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 17:29:12,333 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 17:29:12,333 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 17:29:12,333 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 17:29:12,334 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 17:29:12,334 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 17:29:12,334 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 17:29:12,334 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 17:29:12,334 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 17:29:12,335 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 17:29:12,336 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-20 17:29:12,336 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-20 17:29:12,336 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 17:29:12,336 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 17:29:12,336 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 17:29:12,336 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 -> 3fabbb4366f4018d2566a269c32a869eae5327dd4c35f2c68a01653f56969989 [2022-02-20 17:29:12,537 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 17:29:12,562 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 17:29:12,564 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 17:29:12,564 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 17:29:12,565 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 17:29:12,566 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/nla-digbench-scaling/geo1-u_valuebound5.c [2022-02-20 17:29:12,605 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3c1a37bd2/800209f6feda49d8a729f25a14cf87dd/FLAG891c9ad98 [2022-02-20 17:29:12,932 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 17:29:12,933 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/geo1-u_valuebound5.c [2022-02-20 17:29:12,938 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3c1a37bd2/800209f6feda49d8a729f25a14cf87dd/FLAG891c9ad98 [2022-02-20 17:29:13,372 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3c1a37bd2/800209f6feda49d8a729f25a14cf87dd [2022-02-20 17:29:13,373 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 17:29:13,374 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 17:29:13,375 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 17:29:13,375 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 17:29:13,383 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 17:29:13,384 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 05:29:13" (1/1) ... [2022-02-20 17:29:13,385 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@61fdb5fc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:29:13, skipping insertion in model container [2022-02-20 17:29:13,387 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 05:29:13" (1/1) ... [2022-02-20 17:29:13,391 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 17:29:13,402 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 17:29:13,522 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/geo1-u_valuebound5.c[555,568] [2022-02-20 17:29:13,532 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 17:29:13,538 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 17:29:13,546 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/geo1-u_valuebound5.c[555,568] [2022-02-20 17:29:13,550 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 17:29:13,559 INFO L208 MainTranslator]: Completed translation [2022-02-20 17:29:13,560 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:29:13 WrapperNode [2022-02-20 17:29:13,560 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 17:29:13,561 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 17:29:13,561 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 17:29:13,561 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 17:29:13,565 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:29:13" (1/1) ... [2022-02-20 17:29:13,569 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:29:13" (1/1) ... [2022-02-20 17:29:13,581 INFO L137 Inliner]: procedures = 14, calls = 11, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 38 [2022-02-20 17:29:13,581 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 17:29:13,582 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 17:29:13,582 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 17:29:13,582 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 17:29:13,586 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:29:13" (1/1) ... [2022-02-20 17:29:13,586 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:29:13" (1/1) ... [2022-02-20 17:29:13,587 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:29:13" (1/1) ... [2022-02-20 17:29:13,587 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:29:13" (1/1) ... [2022-02-20 17:29:13,590 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:29:13" (1/1) ... [2022-02-20 17:29:13,592 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:29:13" (1/1) ... [2022-02-20 17:29:13,592 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:29:13" (1/1) ... [2022-02-20 17:29:13,593 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 17:29:13,594 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 17:29:13,594 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 17:29:13,594 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 17:29:13,595 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:29:13" (1/1) ... [2022-02-20 17:29:13,605 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 17:29:13,613 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 17:29:13,633 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:29:13,638 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:29:13,661 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 17:29:13,662 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-02-20 17:29:13,662 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-02-20 17:29:13,662 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-20 17:29:13,662 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 17:29:13,662 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 17:29:13,662 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-02-20 17:29:13,663 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-02-20 17:29:13,698 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 17:29:13,699 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 17:29:13,788 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 17:29:13,794 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 17:29:13,794 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-02-20 17:29:13,795 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 05:29:13 BoogieIcfgContainer [2022-02-20 17:29:13,795 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 17:29:13,796 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 17:29:13,797 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 17:29:13,799 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 17:29:13,799 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 05:29:13" (1/3) ... [2022-02-20 17:29:13,800 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@36722512 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 05:29:13, skipping insertion in model container [2022-02-20 17:29:13,800 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:29:13" (2/3) ... [2022-02-20 17:29:13,800 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@36722512 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 05:29:13, skipping insertion in model container [2022-02-20 17:29:13,800 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 05:29:13" (3/3) ... [2022-02-20 17:29:13,801 INFO L111 eAbstractionObserver]: Analyzing ICFG geo1-u_valuebound5.c [2022-02-20 17:29:13,804 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 17:29:13,805 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-02-20 17:29:13,833 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 17:29:13,837 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:29:13,837 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-02-20 17:29:13,850 INFO L276 IsEmpty]: Start isEmpty. Operand has 25 states, 17 states have (on average 1.3529411764705883) internal successors, (23), 18 states have internal predecessors, (23), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-02-20 17:29:13,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-02-20 17:29:13,854 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:29:13,854 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 17:29:13,854 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 17:29:13,858 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:29:13,858 INFO L85 PathProgramCache]: Analyzing trace with hash -1975646755, now seen corresponding path program 1 times [2022-02-20 17:29:13,864 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 17:29:13,864 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [463340529] [2022-02-20 17:29:13,865 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:29:13,865 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 17:29:13,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:29:13,988 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-02-20 17:29:13,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:29:14,000 INFO L290 TraceCheckUtils]: 0: Hoare triple {28#true} ~cond := #in~cond; {28#true} is VALID [2022-02-20 17:29:14,016 INFO L290 TraceCheckUtils]: 1: Hoare triple {28#true} assume 0 == ~cond;assume false; {29#false} is VALID [2022-02-20 17:29:14,016 INFO L290 TraceCheckUtils]: 2: Hoare triple {29#false} assume true; {29#false} is VALID [2022-02-20 17:29:14,016 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {29#false} {28#true} #51#return; {29#false} is VALID [2022-02-20 17:29:14,017 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-02-20 17:29:14,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:29:14,024 INFO L290 TraceCheckUtils]: 0: Hoare triple {28#true} ~cond := #in~cond; {28#true} is VALID [2022-02-20 17:29:14,024 INFO L290 TraceCheckUtils]: 1: Hoare triple {28#true} assume 0 == ~cond;assume false; {29#false} is VALID [2022-02-20 17:29:14,024 INFO L290 TraceCheckUtils]: 2: Hoare triple {29#false} assume true; {29#false} is VALID [2022-02-20 17:29:14,025 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {29#false} {29#false} #53#return; {29#false} is VALID [2022-02-20 17:29:14,025 INFO L290 TraceCheckUtils]: 0: Hoare triple {28#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); {28#true} is VALID [2022-02-20 17:29:14,025 INFO L290 TraceCheckUtils]: 1: Hoare triple {28#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; {28#true} is VALID [2022-02-20 17:29:14,025 INFO L272 TraceCheckUtils]: 2: Hoare triple {28#true} call assume_abort_if_not((if main_~z~0#1 % 4294967296 >= 0 && main_~z~0#1 % 4294967296 <= 5 then 1 else 0)); {28#true} is VALID [2022-02-20 17:29:14,026 INFO L290 TraceCheckUtils]: 3: Hoare triple {28#true} ~cond := #in~cond; {28#true} is VALID [2022-02-20 17:29:14,026 INFO L290 TraceCheckUtils]: 4: Hoare triple {28#true} assume 0 == ~cond;assume false; {29#false} is VALID [2022-02-20 17:29:14,026 INFO L290 TraceCheckUtils]: 5: Hoare triple {29#false} assume true; {29#false} is VALID [2022-02-20 17:29:14,027 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {29#false} {28#true} #51#return; {29#false} is VALID [2022-02-20 17:29:14,027 INFO L290 TraceCheckUtils]: 7: Hoare triple {29#false} main_~k~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; {29#false} is VALID [2022-02-20 17:29:14,027 INFO L272 TraceCheckUtils]: 8: Hoare triple {29#false} call assume_abort_if_not((if main_~k~0#1 % 4294967296 >= 0 && main_~k~0#1 % 4294967296 <= 5 then 1 else 0)); {28#true} is VALID [2022-02-20 17:29:14,027 INFO L290 TraceCheckUtils]: 9: Hoare triple {28#true} ~cond := #in~cond; {28#true} is VALID [2022-02-20 17:29:14,028 INFO L290 TraceCheckUtils]: 10: Hoare triple {28#true} assume 0 == ~cond;assume false; {29#false} is VALID [2022-02-20 17:29:14,028 INFO L290 TraceCheckUtils]: 11: Hoare triple {29#false} assume true; {29#false} is VALID [2022-02-20 17:29:14,028 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {29#false} {29#false} #53#return; {29#false} is VALID [2022-02-20 17:29:14,028 INFO L290 TraceCheckUtils]: 13: Hoare triple {29#false} main_~x~0#1 := 1;main_~y~0#1 := main_~z~0#1 % 4294967296;main_~c~0#1 := 1; {29#false} is VALID [2022-02-20 17:29:14,029 INFO L290 TraceCheckUtils]: 14: Hoare triple {29#false} assume !false; {29#false} is VALID [2022-02-20 17:29:14,029 INFO L272 TraceCheckUtils]: 15: Hoare triple {29#false} 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)); {29#false} is VALID [2022-02-20 17:29:14,029 INFO L290 TraceCheckUtils]: 16: Hoare triple {29#false} ~cond := #in~cond; {29#false} is VALID [2022-02-20 17:29:14,029 INFO L290 TraceCheckUtils]: 17: Hoare triple {29#false} assume 0 == ~cond; {29#false} is VALID [2022-02-20 17:29:14,030 INFO L290 TraceCheckUtils]: 18: Hoare triple {29#false} assume !false; {29#false} is VALID [2022-02-20 17:29:14,030 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-02-20 17:29:14,030 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 17:29:14,031 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [463340529] [2022-02-20 17:29:14,032 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [463340529] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 17:29:14,047 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 17:29:14,047 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-20 17:29:14,049 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [268755223] [2022-02-20 17:29:14,049 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 17:29:14,053 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 19 [2022-02-20 17:29:14,054 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 17:29:14,056 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 17:29:14,086 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 16 edges. 16 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:29:14,086 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-02-20 17:29:14,086 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 17:29:14,108 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-02-20 17:29:14,123 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-02-20 17:29:14,126 INFO L87 Difference]: Start difference. First operand has 25 states, 17 states have (on average 1.3529411764705883) internal successors, (23), 18 states have internal predecessors, (23), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 17:29:14,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:29:14,189 INFO L93 Difference]: Finished difference Result 47 states and 62 transitions. [2022-02-20 17:29:14,189 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-20 17:29:14,189 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 19 [2022-02-20 17:29:14,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 17:29:14,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 17:29:14,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 62 transitions. [2022-02-20 17:29:14,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 17:29:14,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 62 transitions. [2022-02-20 17:29:14,205 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 62 transitions. [2022-02-20 17:29:14,270 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 62 edges. 62 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:29:14,290 INFO L225 Difference]: With dead ends: 47 [2022-02-20 17:29:14,290 INFO L226 Difference]: Without dead ends: 21 [2022-02-20 17:29:14,292 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-02-20 17:29:14,295 INFO L933 BasicCegarLoop]: 27 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 27 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 17:29:14,295 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 17:29:14,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2022-02-20 17:29:14,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2022-02-20 17:29:14,314 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 17:29:14,315 INFO L82 GeneralOperation]: Start isEquivalent. First operand 21 states. Second operand has 21 states, 14 states have (on average 1.1428571428571428) internal successors, (16), 15 states have internal predecessors, (16), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-20 17:29:14,315 INFO L74 IsIncluded]: Start isIncluded. First operand 21 states. Second operand has 21 states, 14 states have (on average 1.1428571428571428) internal successors, (16), 15 states have internal predecessors, (16), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-20 17:29:14,316 INFO L87 Difference]: Start difference. First operand 21 states. Second operand has 21 states, 14 states have (on average 1.1428571428571428) internal successors, (16), 15 states have internal predecessors, (16), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-20 17:29:14,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:29:14,318 INFO L93 Difference]: Finished difference Result 21 states and 23 transitions. [2022-02-20 17:29:14,319 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 23 transitions. [2022-02-20 17:29:14,319 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:29:14,319 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:29:14,319 INFO L74 IsIncluded]: Start isIncluded. First operand has 21 states, 14 states have (on average 1.1428571428571428) internal successors, (16), 15 states have internal predecessors, (16), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 21 states. [2022-02-20 17:29:14,320 INFO L87 Difference]: Start difference. First operand has 21 states, 14 states have (on average 1.1428571428571428) internal successors, (16), 15 states have internal predecessors, (16), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 21 states. [2022-02-20 17:29:14,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:29:14,322 INFO L93 Difference]: Finished difference Result 21 states and 23 transitions. [2022-02-20 17:29:14,322 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 23 transitions. [2022-02-20 17:29:14,322 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:29:14,322 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:29:14,323 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 17:29:14,323 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 17:29:14,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 14 states have (on average 1.1428571428571428) internal successors, (16), 15 states have internal predecessors, (16), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-20 17:29:14,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 23 transitions. [2022-02-20 17:29:14,326 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 23 transitions. Word has length 19 [2022-02-20 17:29:14,326 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 17:29:14,326 INFO L470 AbstractCegarLoop]: Abstraction has 21 states and 23 transitions. [2022-02-20 17:29:14,326 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 17:29:14,326 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 23 transitions. [2022-02-20 17:29:14,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-02-20 17:29:14,327 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:29:14,327 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 17:29:14,327 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-20 17:29:14,328 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 17:29:14,328 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:29:14,328 INFO L85 PathProgramCache]: Analyzing trace with hash 1719515233, now seen corresponding path program 1 times [2022-02-20 17:29:14,328 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 17:29:14,329 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [535094717] [2022-02-20 17:29:14,329 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:29:14,329 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 17:29:14,349 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-20 17:29:14,349 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [529964492] [2022-02-20 17:29:14,349 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:29:14,349 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 17:29:14,349 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 17:29:14,351 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:29:14,374 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:29:14,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:29:14,409 INFO L263 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 7 conjunts are in the unsatisfiable core [2022-02-20 17:29:14,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:29:14,418 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 17:29:14,522 INFO L290 TraceCheckUtils]: 0: Hoare triple {172#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); {172#true} is VALID [2022-02-20 17:29:14,523 INFO L290 TraceCheckUtils]: 1: Hoare triple {172#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; {172#true} is VALID [2022-02-20 17:29:14,523 INFO L272 TraceCheckUtils]: 2: Hoare triple {172#true} call assume_abort_if_not((if main_~z~0#1 % 4294967296 >= 0 && main_~z~0#1 % 4294967296 <= 5 then 1 else 0)); {172#true} is VALID [2022-02-20 17:29:14,523 INFO L290 TraceCheckUtils]: 3: Hoare triple {172#true} ~cond := #in~cond; {172#true} is VALID [2022-02-20 17:29:14,523 INFO L290 TraceCheckUtils]: 4: Hoare triple {172#true} assume !(0 == ~cond); {172#true} is VALID [2022-02-20 17:29:14,523 INFO L290 TraceCheckUtils]: 5: Hoare triple {172#true} assume true; {172#true} is VALID [2022-02-20 17:29:14,524 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {172#true} {172#true} #51#return; {172#true} is VALID [2022-02-20 17:29:14,524 INFO L290 TraceCheckUtils]: 7: Hoare triple {172#true} main_~k~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; {172#true} is VALID [2022-02-20 17:29:14,524 INFO L272 TraceCheckUtils]: 8: Hoare triple {172#true} call assume_abort_if_not((if main_~k~0#1 % 4294967296 >= 0 && main_~k~0#1 % 4294967296 <= 5 then 1 else 0)); {172#true} is VALID [2022-02-20 17:29:14,524 INFO L290 TraceCheckUtils]: 9: Hoare triple {172#true} ~cond := #in~cond; {172#true} is VALID [2022-02-20 17:29:14,524 INFO L290 TraceCheckUtils]: 10: Hoare triple {172#true} assume !(0 == ~cond); {172#true} is VALID [2022-02-20 17:29:14,524 INFO L290 TraceCheckUtils]: 11: Hoare triple {172#true} assume true; {172#true} is VALID [2022-02-20 17:29:14,525 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {172#true} {172#true} #53#return; {172#true} is VALID [2022-02-20 17:29:14,525 INFO L290 TraceCheckUtils]: 13: Hoare triple {172#true} main_~x~0#1 := 1;main_~y~0#1 := main_~z~0#1 % 4294967296;main_~c~0#1 := 1; {216#(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:29:14,526 INFO L290 TraceCheckUtils]: 14: Hoare triple {216#(and (= |ULTIMATE.start_main_~x~0#1| 1) (= |ULTIMATE.start_main_~y~0#1| (mod |ULTIMATE.start_main_~z~0#1| 4294967296)))} assume !false; {216#(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:29:14,527 INFO L272 TraceCheckUtils]: 15: Hoare triple {216#(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)); {223#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-02-20 17:29:14,527 INFO L290 TraceCheckUtils]: 16: Hoare triple {223#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {227#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-02-20 17:29:14,528 INFO L290 TraceCheckUtils]: 17: Hoare triple {227#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {173#false} is VALID [2022-02-20 17:29:14,528 INFO L290 TraceCheckUtils]: 18: Hoare triple {173#false} assume !false; {173#false} is VALID [2022-02-20 17:29:14,528 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-02-20 17:29:14,528 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 17:29:14,528 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 17:29:14,529 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [535094717] [2022-02-20 17:29:14,529 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-20 17:29:14,529 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [529964492] [2022-02-20 17:29:14,529 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [529964492] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 17:29:14,529 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 17:29:14,529 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 17:29:14,530 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [464041841] [2022-02-20 17:29:14,530 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 17:29:14,531 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 19 [2022-02-20 17:29:14,531 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 17:29:14,531 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 17:29:14,543 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 16 edges. 16 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:29:14,544 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 17:29:14,544 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 17:29:14,544 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 17:29:14,545 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 17:29:14,545 INFO L87 Difference]: Start difference. First operand 21 states and 23 transitions. Second operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 17:29:14,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:29:14,631 INFO L93 Difference]: Finished difference Result 31 states and 34 transitions. [2022-02-20 17:29:14,632 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 17:29:14,632 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 19 [2022-02-20 17:29:14,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 17:29:14,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 17:29:14,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 34 transitions. [2022-02-20 17:29:14,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 17:29:14,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 34 transitions. [2022-02-20 17:29:14,636 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 34 transitions. [2022-02-20 17:29:14,667 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 34 edges. 34 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:29:14,669 INFO L225 Difference]: With dead ends: 31 [2022-02-20 17:29:14,669 INFO L226 Difference]: Without dead ends: 29 [2022-02-20 17:29:14,669 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 15 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:29:14,670 INFO L933 BasicCegarLoop]: 19 mSDtfsCounter, 6 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 72 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 17:29:14,671 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [7 Valid, 72 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 17:29:14,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2022-02-20 17:29:14,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 27. [2022-02-20 17:29:14,675 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 17:29:14,675 INFO L82 GeneralOperation]: Start isEquivalent. First operand 29 states. Second operand has 27 states, 18 states have (on average 1.1111111111111112) internal successors, (20), 20 states have internal predecessors, (20), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2022-02-20 17:29:14,676 INFO L74 IsIncluded]: Start isIncluded. First operand 29 states. Second operand has 27 states, 18 states have (on average 1.1111111111111112) internal successors, (20), 20 states have internal predecessors, (20), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2022-02-20 17:29:14,676 INFO L87 Difference]: Start difference. First operand 29 states. Second operand has 27 states, 18 states have (on average 1.1111111111111112) internal successors, (20), 20 states have internal predecessors, (20), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2022-02-20 17:29:14,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:29:14,678 INFO L93 Difference]: Finished difference Result 29 states and 32 transitions. [2022-02-20 17:29:14,678 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 32 transitions. [2022-02-20 17:29:14,678 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:29:14,678 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:29:14,679 INFO L74 IsIncluded]: Start isIncluded. First operand has 27 states, 18 states have (on average 1.1111111111111112) internal successors, (20), 20 states have internal predecessors, (20), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) Second operand 29 states. [2022-02-20 17:29:14,679 INFO L87 Difference]: Start difference. First operand has 27 states, 18 states have (on average 1.1111111111111112) internal successors, (20), 20 states have internal predecessors, (20), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) Second operand 29 states. [2022-02-20 17:29:14,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:29:14,681 INFO L93 Difference]: Finished difference Result 29 states and 32 transitions. [2022-02-20 17:29:14,681 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 32 transitions. [2022-02-20 17:29:14,681 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:29:14,681 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:29:14,681 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 17:29:14,681 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 17:29:14,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 18 states have (on average 1.1111111111111112) internal successors, (20), 20 states have internal predecessors, (20), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2022-02-20 17:29:14,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 29 transitions. [2022-02-20 17:29:14,683 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 29 transitions. Word has length 19 [2022-02-20 17:29:14,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 17:29:14,684 INFO L470 AbstractCegarLoop]: Abstraction has 27 states and 29 transitions. [2022-02-20 17:29:14,684 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 17:29:14,684 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 29 transitions. [2022-02-20 17:29:14,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-02-20 17:29:14,685 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:29:14,685 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 17:29:14,717 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:29:14,900 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 17:29:14,900 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 17:29:14,901 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:29:14,901 INFO L85 PathProgramCache]: Analyzing trace with hash 1670281901, now seen corresponding path program 1 times [2022-02-20 17:29:14,901 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 17:29:14,901 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2077531503] [2022-02-20 17:29:14,901 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:29:14,902 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 17:29:14,920 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-20 17:29:14,920 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1124799544] [2022-02-20 17:29:14,921 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:29:14,921 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 17:29:14,921 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 17:29:14,922 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:29:14,944 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:29:14,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-20 17:29:14,975 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-20 17:29:14,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-20 17:29:14,994 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-20 17:29:14,994 INFO L628 BasicCegarLoop]: Counterexample is feasible [2022-02-20 17:29:14,995 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-02-20 17:29:15,013 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-02-20 17:29:15,213 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,SelfDestructingSolverStorable2 [2022-02-20 17:29:15,216 INFO L732 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2022-02-20 17:29:15,218 INFO L180 ceAbstractionStarter]: Computing trace abstraction results [2022-02-20 17:29:15,228 FATAL L489 DefaultTranslator]: Callstack has procedure call flag but succeeding procedure is empty at [CALL] call assume_abort_if_not((if ~z~0 % 4294967296 >= 0 && ~z~0 % 4294967296 <= 5 then 1 else 0)); [2022-02-20 17:29:15,229 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:29:15,231 INFO L158 Benchmark]: Toolchain (without parser) took 1857.18ms. Allocated memory is still 111.1MB. Free memory was 75.2MB in the beginning and 47.7MB in the end (delta: 27.6MB). Peak memory consumption was 26.5MB. Max. memory is 16.1GB. [2022-02-20 17:29:15,232 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 111.1MB. Free memory is still 91.0MB. There was no memory consumed. Max. memory is 16.1GB. [2022-02-20 17:29:15,232 INFO L158 Benchmark]: CACSL2BoogieTranslator took 184.77ms. Allocated memory is still 111.1MB. Free memory was 75.0MB in the beginning and 86.9MB in the end (delta: -11.9MB). Peak memory consumption was 9.8MB. Max. memory is 16.1GB. [2022-02-20 17:29:15,232 INFO L158 Benchmark]: Boogie Procedure Inliner took 20.38ms. Allocated memory is still 111.1MB. Free memory was 86.9MB in the beginning and 85.5MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. [2022-02-20 17:29:15,233 INFO L158 Benchmark]: Boogie Preprocessor took 11.99ms. Allocated memory is still 111.1MB. Free memory was 85.2MB in the beginning and 84.2MB in the end (delta: 1.0MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-02-20 17:29:15,233 INFO L158 Benchmark]: RCFGBuilder took 201.62ms. Allocated memory is still 111.1MB. Free memory was 84.2MB in the beginning and 74.5MB in the end (delta: 9.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-02-20 17:29:15,233 INFO L158 Benchmark]: TraceAbstraction took 1434.27ms. Allocated memory is still 111.1MB. Free memory was 73.7MB in the beginning and 47.7MB in the end (delta: 26.0MB). Peak memory consumption was 25.1MB. Max. memory is 16.1GB. [2022-02-20 17:29:15,235 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.14ms. Allocated memory is still 111.1MB. Free memory is still 91.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 184.77ms. Allocated memory is still 111.1MB. Free memory was 75.0MB in the beginning and 86.9MB in the end (delta: -11.9MB). Peak memory consumption was 9.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 20.38ms. Allocated memory is still 111.1MB. Free memory was 86.9MB in the beginning and 85.5MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 11.99ms. Allocated memory is still 111.1MB. Free memory was 85.2MB in the beginning and 84.2MB in the end (delta: 1.0MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 201.62ms. Allocated memory is still 111.1MB. Free memory was 84.2MB in the beginning and 74.5MB in the end (delta: 9.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 1434.27ms. Allocated memory is still 111.1MB. Free memory was 73.7MB in the beginning and 47.7MB in the end (delta: 26.0MB). Peak memory consumption was 25.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - 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:29:15,257 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-scaling/geo1-u_valuebound5.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 3fabbb4366f4018d2566a269c32a869eae5327dd4c35f2c68a01653f56969989 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 17:29:17,003 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 17:29:17,005 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 17:29:17,042 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 17:29:17,042 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 17:29:17,045 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 17:29:17,046 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 17:29:17,050 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 17:29:17,051 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 17:29:17,054 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 17:29:17,055 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 17:29:17,058 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 17:29:17,058 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 17:29:17,060 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 17:29:17,061 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 17:29:17,063 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 17:29:17,064 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 17:29:17,064 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 17:29:17,066 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 17:29:17,070 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 17:29:17,071 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 17:29:17,072 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 17:29:17,073 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 17:29:17,074 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 17:29:17,079 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 17:29:17,079 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 17:29:17,079 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 17:29:17,080 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 17:29:17,081 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 17:29:17,081 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 17:29:17,081 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 17:29:17,082 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 17:29:17,083 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 17:29:17,084 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 17:29:17,085 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 17:29:17,085 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 17:29:17,085 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 17:29:17,086 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 17:29:17,086 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 17:29:17,087 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 17:29:17,087 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 17:29:17,088 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:29:17,127 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 17:29:17,127 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 17:29:17,127 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 17:29:17,128 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 17:29:17,128 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 17:29:17,128 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 17:29:17,128 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 17:29:17,129 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 17:29:17,129 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 17:29:17,129 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 17:29:17,129 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 17:29:17,129 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 17:29:17,129 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 17:29:17,129 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 17:29:17,129 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 17:29:17,129 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 17:29:17,129 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-02-20 17:29:17,129 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-02-20 17:29:17,130 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-02-20 17:29:17,130 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 17:29:17,130 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 17:29:17,130 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 17:29:17,130 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 17:29:17,130 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 17:29:17,130 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 17:29:17,130 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 17:29:17,130 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 17:29:17,130 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 17:29:17,131 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 17:29:17,131 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 17:29:17,131 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2022-02-20 17:29:17,131 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-02-20 17:29:17,131 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 17:29:17,131 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 17:29:17,131 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 17:29:17,131 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-02-20 17:29:17,132 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 -> 3fabbb4366f4018d2566a269c32a869eae5327dd4c35f2c68a01653f56969989 [2022-02-20 17:29:17,370 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 17:29:17,390 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 17:29:17,392 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 17:29:17,393 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 17:29:17,394 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 17:29:17,395 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/nla-digbench-scaling/geo1-u_valuebound5.c [2022-02-20 17:29:17,445 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d54756617/875ffe33041841588ebe7f39a290a26e/FLAGa87053948 [2022-02-20 17:29:17,778 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 17:29:17,779 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/geo1-u_valuebound5.c [2022-02-20 17:29:17,783 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d54756617/875ffe33041841588ebe7f39a290a26e/FLAGa87053948 [2022-02-20 17:29:17,794 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d54756617/875ffe33041841588ebe7f39a290a26e [2022-02-20 17:29:17,796 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 17:29:17,798 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 17:29:17,799 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 17:29:17,800 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 17:29:17,802 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 17:29:17,805 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 05:29:17" (1/1) ... [2022-02-20 17:29:17,806 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@37313d91 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:29:17, skipping insertion in model container [2022-02-20 17:29:17,806 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 05:29:17" (1/1) ... [2022-02-20 17:29:17,810 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 17:29:17,821 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 17:29:17,934 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/geo1-u_valuebound5.c[555,568] [2022-02-20 17:29:17,944 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 17:29:17,956 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 17:29:17,994 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/geo1-u_valuebound5.c[555,568] [2022-02-20 17:29:18,003 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 17:29:18,012 INFO L208 MainTranslator]: Completed translation [2022-02-20 17:29:18,013 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:29:18 WrapperNode [2022-02-20 17:29:18,013 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 17:29:18,014 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 17:29:18,014 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 17:29:18,014 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 17:29:18,018 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:29:18" (1/1) ... [2022-02-20 17:29:18,024 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:29:18" (1/1) ... [2022-02-20 17:29:18,046 INFO L137 Inliner]: procedures = 14, calls = 11, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 38 [2022-02-20 17:29:18,047 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 17:29:18,047 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 17:29:18,048 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 17:29:18,048 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 17:29:18,053 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:29:18" (1/1) ... [2022-02-20 17:29:18,054 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:29:18" (1/1) ... [2022-02-20 17:29:18,061 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:29:18" (1/1) ... [2022-02-20 17:29:18,062 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:29:18" (1/1) ... [2022-02-20 17:29:18,074 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:29:18" (1/1) ... [2022-02-20 17:29:18,078 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:29:18" (1/1) ... [2022-02-20 17:29:18,081 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:29:18" (1/1) ... [2022-02-20 17:29:18,083 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 17:29:18,085 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 17:29:18,086 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 17:29:18,086 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 17:29:18,088 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:29:18" (1/1) ... [2022-02-20 17:29:18,093 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 17:29:18,100 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 17:29:18,135 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:29:18,198 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:29:18,219 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 17:29:18,219 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-02-20 17:29:18,220 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-02-20 17:29:18,220 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-02-20 17:29:18,220 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 17:29:18,220 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 17:29:18,220 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-02-20 17:29:18,220 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-02-20 17:29:18,267 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 17:29:18,268 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 17:29:18,463 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 17:29:18,468 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 17:29:18,468 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-02-20 17:29:18,470 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 05:29:18 BoogieIcfgContainer [2022-02-20 17:29:18,470 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 17:29:18,471 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 17:29:18,471 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 17:29:18,474 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 17:29:18,474 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 05:29:17" (1/3) ... [2022-02-20 17:29:18,474 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1d6b550e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 05:29:18, skipping insertion in model container [2022-02-20 17:29:18,475 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:29:18" (2/3) ... [2022-02-20 17:29:18,475 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1d6b550e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 05:29:18, skipping insertion in model container [2022-02-20 17:29:18,475 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 05:29:18" (3/3) ... [2022-02-20 17:29:18,476 INFO L111 eAbstractionObserver]: Analyzing ICFG geo1-u_valuebound5.c [2022-02-20 17:29:18,479 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 17:29:18,480 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-02-20 17:29:18,510 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 17:29:18,515 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:29:18,515 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-02-20 17:29:18,528 INFO L276 IsEmpty]: Start isEmpty. Operand has 25 states, 17 states have (on average 1.3529411764705883) internal successors, (23), 18 states have internal predecessors, (23), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-02-20 17:29:18,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-02-20 17:29:18,532 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:29:18,532 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 17:29:18,533 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 17:29:18,539 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:29:18,539 INFO L85 PathProgramCache]: Analyzing trace with hash -1975646755, now seen corresponding path program 1 times [2022-02-20 17:29:18,548 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 17:29:18,549 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1154126586] [2022-02-20 17:29:18,549 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:29:18,550 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 17:29:18,550 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 17:29:18,552 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:29:18,590 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:29:18,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:29:18,666 INFO L263 TraceCheckSpWp]: Trace formula consists of 40 conjuncts, 1 conjunts are in the unsatisfiable core [2022-02-20 17:29:18,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:29:18,684 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 17:29:18,775 INFO L290 TraceCheckUtils]: 0: Hoare triple {28#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); {28#true} is VALID [2022-02-20 17:29:18,777 INFO L290 TraceCheckUtils]: 1: Hoare triple {28#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; {28#true} is VALID [2022-02-20 17:29:18,777 INFO L272 TraceCheckUtils]: 2: Hoare triple {28#true} call assume_abort_if_not((if ~bvuge32(main_~z~0#1, 0bv32) && ~bvule32(main_~z~0#1, 5bv32) then 1bv32 else 0bv32)); {28#true} is VALID [2022-02-20 17:29:18,777 INFO L290 TraceCheckUtils]: 3: Hoare triple {28#true} ~cond := #in~cond; {28#true} is VALID [2022-02-20 17:29:18,778 INFO L290 TraceCheckUtils]: 4: Hoare triple {28#true} assume 0bv32 == ~cond;assume false; {28#true} is VALID [2022-02-20 17:29:18,778 INFO L290 TraceCheckUtils]: 5: Hoare triple {28#true} assume true; {28#true} is VALID [2022-02-20 17:29:18,778 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {28#true} {28#true} #51#return; {28#true} is VALID [2022-02-20 17:29:18,778 INFO L290 TraceCheckUtils]: 7: Hoare triple {28#true} main_~k~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; {28#true} is VALID [2022-02-20 17:29:18,778 INFO L272 TraceCheckUtils]: 8: Hoare triple {28#true} call assume_abort_if_not((if ~bvuge32(main_~k~0#1, 0bv32) && ~bvule32(main_~k~0#1, 5bv32) then 1bv32 else 0bv32)); {28#true} is VALID [2022-02-20 17:29:18,779 INFO L290 TraceCheckUtils]: 9: Hoare triple {28#true} ~cond := #in~cond; {28#true} is VALID [2022-02-20 17:29:18,780 INFO L290 TraceCheckUtils]: 10: Hoare triple {28#true} assume 0bv32 == ~cond;assume false; {29#false} is VALID [2022-02-20 17:29:18,780 INFO L290 TraceCheckUtils]: 11: Hoare triple {29#false} assume true; {29#false} is VALID [2022-02-20 17:29:18,781 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {29#false} {28#true} #53#return; {29#false} is VALID [2022-02-20 17:29:18,781 INFO L290 TraceCheckUtils]: 13: Hoare triple {29#false} main_~x~0#1 := 1bv64;main_~y~0#1 := ~zero_extendFrom32To64(main_~z~0#1);main_~c~0#1 := 1bv64; {29#false} is VALID [2022-02-20 17:29:18,782 INFO L290 TraceCheckUtils]: 14: Hoare triple {29#false} assume !false; {29#false} is VALID [2022-02-20 17:29:18,782 INFO L272 TraceCheckUtils]: 15: Hoare triple {29#false} 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)); {29#false} is VALID [2022-02-20 17:29:18,782 INFO L290 TraceCheckUtils]: 16: Hoare triple {29#false} ~cond := #in~cond; {29#false} is VALID [2022-02-20 17:29:18,782 INFO L290 TraceCheckUtils]: 17: Hoare triple {29#false} assume 0bv32 == ~cond; {29#false} is VALID [2022-02-20 17:29:18,783 INFO L290 TraceCheckUtils]: 18: Hoare triple {29#false} assume !false; {29#false} is VALID [2022-02-20 17:29:18,784 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-02-20 17:29:18,784 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 17:29:18,785 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 17:29:18,785 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1154126586] [2022-02-20 17:29:18,785 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1154126586] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 17:29:18,786 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 17:29:18,786 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-20 17:29:18,787 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1380369158] [2022-02-20 17:29:18,789 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 17:29:18,793 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 19 [2022-02-20 17:29:18,794 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 17:29:18,796 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 17:29:18,836 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:29:18,837 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-02-20 17:29:18,837 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 17:29:18,850 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-02-20 17:29:18,851 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-02-20 17:29:18,853 INFO L87 Difference]: Start difference. First operand has 25 states, 17 states have (on average 1.3529411764705883) internal successors, (23), 18 states have internal predecessors, (23), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 17:29:19,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:29:19,084 INFO L93 Difference]: Finished difference Result 47 states and 62 transitions. [2022-02-20 17:29:19,084 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-20 17:29:19,084 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 19 [2022-02-20 17:29:19,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 17:29:19,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 17:29:19,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 62 transitions. [2022-02-20 17:29:19,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 17:29:19,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 62 transitions. [2022-02-20 17:29:19,098 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 62 transitions. [2022-02-20 17:29:19,295 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 62 edges. 62 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:29:19,300 INFO L225 Difference]: With dead ends: 47 [2022-02-20 17:29:19,301 INFO L226 Difference]: Without dead ends: 21 [2022-02-20 17:29:19,302 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-02-20 17:29:19,305 INFO L933 BasicCegarLoop]: 27 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 27 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 17:29:19,305 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 17:29:19,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2022-02-20 17:29:19,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2022-02-20 17:29:19,323 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 17:29:19,324 INFO L82 GeneralOperation]: Start isEquivalent. First operand 21 states. Second operand has 21 states, 14 states have (on average 1.1428571428571428) internal successors, (16), 15 states have internal predecessors, (16), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-20 17:29:19,324 INFO L74 IsIncluded]: Start isIncluded. First operand 21 states. Second operand has 21 states, 14 states have (on average 1.1428571428571428) internal successors, (16), 15 states have internal predecessors, (16), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-20 17:29:19,325 INFO L87 Difference]: Start difference. First operand 21 states. Second operand has 21 states, 14 states have (on average 1.1428571428571428) internal successors, (16), 15 states have internal predecessors, (16), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-20 17:29:19,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:29:19,327 INFO L93 Difference]: Finished difference Result 21 states and 23 transitions. [2022-02-20 17:29:19,327 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 23 transitions. [2022-02-20 17:29:19,327 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:29:19,328 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:29:19,328 INFO L74 IsIncluded]: Start isIncluded. First operand has 21 states, 14 states have (on average 1.1428571428571428) internal successors, (16), 15 states have internal predecessors, (16), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 21 states. [2022-02-20 17:29:19,328 INFO L87 Difference]: Start difference. First operand has 21 states, 14 states have (on average 1.1428571428571428) internal successors, (16), 15 states have internal predecessors, (16), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 21 states. [2022-02-20 17:29:19,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:29:19,330 INFO L93 Difference]: Finished difference Result 21 states and 23 transitions. [2022-02-20 17:29:19,330 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 23 transitions. [2022-02-20 17:29:19,330 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:29:19,330 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:29:19,330 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 17:29:19,331 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 17:29:19,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 14 states have (on average 1.1428571428571428) internal successors, (16), 15 states have internal predecessors, (16), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-20 17:29:19,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 23 transitions. [2022-02-20 17:29:19,333 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 23 transitions. Word has length 19 [2022-02-20 17:29:19,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 17:29:19,333 INFO L470 AbstractCegarLoop]: Abstraction has 21 states and 23 transitions. [2022-02-20 17:29:19,334 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 17:29:19,334 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 23 transitions. [2022-02-20 17:29:19,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-02-20 17:29:19,334 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:29:19,334 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 17:29:19,347 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:29:19,542 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:29:19,542 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 17:29:19,543 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:29:19,543 INFO L85 PathProgramCache]: Analyzing trace with hash 1719515233, now seen corresponding path program 1 times [2022-02-20 17:29:19,544 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 17:29:19,544 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1184075377] [2022-02-20 17:29:19,544 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:29:19,544 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 17:29:19,544 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 17:29:19,545 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:29:19,548 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2022-02-20 17:29:19,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:29:19,591 INFO L263 TraceCheckSpWp]: Trace formula consists of 40 conjuncts, 8 conjunts are in the unsatisfiable core [2022-02-20 17:29:19,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:29:19,612 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 17:29:19,864 INFO L290 TraceCheckUtils]: 0: Hoare triple {218#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); {218#true} is VALID [2022-02-20 17:29:19,864 INFO L290 TraceCheckUtils]: 1: Hoare triple {218#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; {218#true} is VALID [2022-02-20 17:29:19,864 INFO L272 TraceCheckUtils]: 2: Hoare triple {218#true} call assume_abort_if_not((if ~bvuge32(main_~z~0#1, 0bv32) && ~bvule32(main_~z~0#1, 5bv32) then 1bv32 else 0bv32)); {218#true} is VALID [2022-02-20 17:29:19,864 INFO L290 TraceCheckUtils]: 3: Hoare triple {218#true} ~cond := #in~cond; {232#(= |assume_abort_if_not_#in~cond| assume_abort_if_not_~cond)} is VALID [2022-02-20 17:29:19,865 INFO L290 TraceCheckUtils]: 4: Hoare triple {232#(= |assume_abort_if_not_#in~cond| assume_abort_if_not_~cond)} assume !(0bv32 == ~cond); {236#(not (= |assume_abort_if_not_#in~cond| (_ bv0 32)))} is VALID [2022-02-20 17:29:19,865 INFO L290 TraceCheckUtils]: 5: Hoare triple {236#(not (= |assume_abort_if_not_#in~cond| (_ bv0 32)))} assume true; {236#(not (= |assume_abort_if_not_#in~cond| (_ bv0 32)))} is VALID [2022-02-20 17:29:19,866 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {236#(not (= |assume_abort_if_not_#in~cond| (_ bv0 32)))} {218#true} #51#return; {243#(bvule |ULTIMATE.start_main_~z~0#1| (_ bv5 32))} is VALID [2022-02-20 17:29:19,866 INFO L290 TraceCheckUtils]: 7: Hoare triple {243#(bvule |ULTIMATE.start_main_~z~0#1| (_ bv5 32))} main_~k~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; {243#(bvule |ULTIMATE.start_main_~z~0#1| (_ bv5 32))} is VALID [2022-02-20 17:29:19,866 INFO L272 TraceCheckUtils]: 8: Hoare triple {243#(bvule |ULTIMATE.start_main_~z~0#1| (_ bv5 32))} call assume_abort_if_not((if ~bvuge32(main_~k~0#1, 0bv32) && ~bvule32(main_~k~0#1, 5bv32) then 1bv32 else 0bv32)); {218#true} is VALID [2022-02-20 17:29:19,866 INFO L290 TraceCheckUtils]: 9: Hoare triple {218#true} ~cond := #in~cond; {218#true} is VALID [2022-02-20 17:29:19,867 INFO L290 TraceCheckUtils]: 10: Hoare triple {218#true} assume !(0bv32 == ~cond); {218#true} is VALID [2022-02-20 17:29:19,867 INFO L290 TraceCheckUtils]: 11: Hoare triple {218#true} assume true; {218#true} is VALID [2022-02-20 17:29:19,867 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {218#true} {243#(bvule |ULTIMATE.start_main_~z~0#1| (_ bv5 32))} #53#return; {243#(bvule |ULTIMATE.start_main_~z~0#1| (_ bv5 32))} is VALID [2022-02-20 17:29:19,868 INFO L290 TraceCheckUtils]: 13: Hoare triple {243#(bvule |ULTIMATE.start_main_~z~0#1| (_ bv5 32))} main_~x~0#1 := 1bv64;main_~y~0#1 := ~zero_extendFrom32To64(main_~z~0#1);main_~c~0#1 := 1bv64; {265#(and (bvule |ULTIMATE.start_main_~z~0#1| (_ bv5 32)) (= |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:29:19,868 INFO L290 TraceCheckUtils]: 14: Hoare triple {265#(and (bvule |ULTIMATE.start_main_~z~0#1| (_ bv5 32)) (= |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; {265#(and (bvule |ULTIMATE.start_main_~z~0#1| (_ bv5 32)) (= |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:29:19,869 INFO L272 TraceCheckUtils]: 15: Hoare triple {265#(and (bvule |ULTIMATE.start_main_~z~0#1| (_ bv5 32)) (= |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)); {272#(= (_ bv1 32) |__VERIFIER_assert_#in~cond|)} is VALID [2022-02-20 17:29:19,869 INFO L290 TraceCheckUtils]: 16: Hoare triple {272#(= (_ bv1 32) |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {276#(= __VERIFIER_assert_~cond (_ bv1 32))} is VALID [2022-02-20 17:29:19,870 INFO L290 TraceCheckUtils]: 17: Hoare triple {276#(= __VERIFIER_assert_~cond (_ bv1 32))} assume 0bv32 == ~cond; {219#false} is VALID [2022-02-20 17:29:19,870 INFO L290 TraceCheckUtils]: 18: Hoare triple {219#false} assume !false; {219#false} is VALID [2022-02-20 17:29:19,870 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-02-20 17:29:19,870 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 17:29:20,893 INFO L290 TraceCheckUtils]: 18: Hoare triple {219#false} assume !false; {219#false} is VALID [2022-02-20 17:29:20,893 INFO L290 TraceCheckUtils]: 17: Hoare triple {286#(not (= __VERIFIER_assert_~cond (_ bv0 32)))} assume 0bv32 == ~cond; {219#false} is VALID [2022-02-20 17:29:20,893 INFO L290 TraceCheckUtils]: 16: Hoare triple {290#(not (= |__VERIFIER_assert_#in~cond| (_ bv0 32)))} ~cond := #in~cond; {286#(not (= __VERIFIER_assert_~cond (_ bv0 32)))} is VALID [2022-02-20 17:29:20,894 INFO L272 TraceCheckUtils]: 15: Hoare triple {294#(= (_ bv0 64) (bvadd (_ bv1 64) (bvneg |ULTIMATE.start_main_~x~0#1|) (bvmul |ULTIMATE.start_main_~x~0#1| ((_ zero_extend 32) |ULTIMATE.start_main_~z~0#1|)) (bvneg |ULTIMATE.start_main_~y~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)); {290#(not (= |__VERIFIER_assert_#in~cond| (_ bv0 32)))} is VALID [2022-02-20 17:29:20,895 INFO L290 TraceCheckUtils]: 14: Hoare triple {294#(= (_ bv0 64) (bvadd (_ bv1 64) (bvneg |ULTIMATE.start_main_~x~0#1|) (bvmul |ULTIMATE.start_main_~x~0#1| ((_ zero_extend 32) |ULTIMATE.start_main_~z~0#1|)) (bvneg |ULTIMATE.start_main_~y~0#1|)))} assume !false; {294#(= (_ bv0 64) (bvadd (_ bv1 64) (bvneg |ULTIMATE.start_main_~x~0#1|) (bvmul |ULTIMATE.start_main_~x~0#1| ((_ zero_extend 32) |ULTIMATE.start_main_~z~0#1|)) (bvneg |ULTIMATE.start_main_~y~0#1|)))} is VALID [2022-02-20 17:29:20,895 INFO L290 TraceCheckUtils]: 13: Hoare triple {218#true} main_~x~0#1 := 1bv64;main_~y~0#1 := ~zero_extendFrom32To64(main_~z~0#1);main_~c~0#1 := 1bv64; {294#(= (_ bv0 64) (bvadd (_ bv1 64) (bvneg |ULTIMATE.start_main_~x~0#1|) (bvmul |ULTIMATE.start_main_~x~0#1| ((_ zero_extend 32) |ULTIMATE.start_main_~z~0#1|)) (bvneg |ULTIMATE.start_main_~y~0#1|)))} is VALID [2022-02-20 17:29:20,895 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {218#true} {218#true} #53#return; {218#true} is VALID [2022-02-20 17:29:20,895 INFO L290 TraceCheckUtils]: 11: Hoare triple {218#true} assume true; {218#true} is VALID [2022-02-20 17:29:20,895 INFO L290 TraceCheckUtils]: 10: Hoare triple {218#true} assume !(0bv32 == ~cond); {218#true} is VALID [2022-02-20 17:29:20,896 INFO L290 TraceCheckUtils]: 9: Hoare triple {218#true} ~cond := #in~cond; {218#true} is VALID [2022-02-20 17:29:20,896 INFO L272 TraceCheckUtils]: 8: Hoare triple {218#true} call assume_abort_if_not((if ~bvuge32(main_~k~0#1, 0bv32) && ~bvule32(main_~k~0#1, 5bv32) then 1bv32 else 0bv32)); {218#true} is VALID [2022-02-20 17:29:20,896 INFO L290 TraceCheckUtils]: 7: Hoare triple {218#true} main_~k~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; {218#true} is VALID [2022-02-20 17:29:20,896 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {218#true} {218#true} #51#return; {218#true} is VALID [2022-02-20 17:29:20,896 INFO L290 TraceCheckUtils]: 5: Hoare triple {218#true} assume true; {218#true} is VALID [2022-02-20 17:29:20,896 INFO L290 TraceCheckUtils]: 4: Hoare triple {218#true} assume !(0bv32 == ~cond); {218#true} is VALID [2022-02-20 17:29:20,896 INFO L290 TraceCheckUtils]: 3: Hoare triple {218#true} ~cond := #in~cond; {218#true} is VALID [2022-02-20 17:29:20,896 INFO L272 TraceCheckUtils]: 2: Hoare triple {218#true} call assume_abort_if_not((if ~bvuge32(main_~z~0#1, 0bv32) && ~bvule32(main_~z~0#1, 5bv32) then 1bv32 else 0bv32)); {218#true} is VALID [2022-02-20 17:29:20,897 INFO L290 TraceCheckUtils]: 1: Hoare triple {218#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; {218#true} is VALID [2022-02-20 17:29:20,897 INFO L290 TraceCheckUtils]: 0: Hoare triple {218#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); {218#true} is VALID [2022-02-20 17:29:20,897 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-02-20 17:29:20,897 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 17:29:20,897 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1184075377] [2022-02-20 17:29:20,897 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1184075377] provided 1 perfect and 1 imperfect interpolant sequences [2022-02-20 17:29:20,897 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-02-20 17:29:20,897 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [8] total 11 [2022-02-20 17:29:20,898 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1367260146] [2022-02-20 17:29:20,898 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 17:29:20,899 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 19 [2022-02-20 17:29:20,899 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 17:29:20,899 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 17:29:20,953 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 16 edges. 16 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:29:20,953 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 17:29:20,954 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 17:29:20,954 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 17:29:20,954 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2022-02-20 17:29:20,955 INFO L87 Difference]: Start difference. First operand 21 states and 23 transitions. Second operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 17:29:25,040 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-02-20 17:29:27,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:29:27,190 INFO L93 Difference]: Finished difference Result 31 states and 34 transitions. [2022-02-20 17:29:27,190 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-20 17:29:27,191 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 19 [2022-02-20 17:29:27,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 17:29:27,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 17:29:27,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 34 transitions. [2022-02-20 17:29:27,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 17:29:27,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 34 transitions. [2022-02-20 17:29:27,194 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 34 transitions. [2022-02-20 17:29:27,442 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 34 edges. 34 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:29:27,443 INFO L225 Difference]: With dead ends: 31 [2022-02-20 17:29:27,443 INFO L226 Difference]: Without dead ends: 29 [2022-02-20 17:29:27,444 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2022-02-20 17:29:27,444 INFO L933 BasicCegarLoop]: 19 mSDtfsCounter, 7 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 1 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 71 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2022-02-20 17:29:27,445 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [8 Valid, 71 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 21 Invalid, 1 Unknown, 0 Unchecked, 3.1s Time] [2022-02-20 17:29:27,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2022-02-20 17:29:27,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 27. [2022-02-20 17:29:27,448 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 17:29:27,448 INFO L82 GeneralOperation]: Start isEquivalent. First operand 29 states. Second operand has 27 states, 18 states have (on average 1.1111111111111112) internal successors, (20), 20 states have internal predecessors, (20), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2022-02-20 17:29:27,448 INFO L74 IsIncluded]: Start isIncluded. First operand 29 states. Second operand has 27 states, 18 states have (on average 1.1111111111111112) internal successors, (20), 20 states have internal predecessors, (20), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2022-02-20 17:29:27,448 INFO L87 Difference]: Start difference. First operand 29 states. Second operand has 27 states, 18 states have (on average 1.1111111111111112) internal successors, (20), 20 states have internal predecessors, (20), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2022-02-20 17:29:27,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:29:27,450 INFO L93 Difference]: Finished difference Result 29 states and 32 transitions. [2022-02-20 17:29:27,450 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 32 transitions. [2022-02-20 17:29:27,450 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:29:27,451 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:29:27,451 INFO L74 IsIncluded]: Start isIncluded. First operand has 27 states, 18 states have (on average 1.1111111111111112) internal successors, (20), 20 states have internal predecessors, (20), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) Second operand 29 states. [2022-02-20 17:29:27,453 INFO L87 Difference]: Start difference. First operand has 27 states, 18 states have (on average 1.1111111111111112) internal successors, (20), 20 states have internal predecessors, (20), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) Second operand 29 states. [2022-02-20 17:29:27,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:29:27,468 INFO L93 Difference]: Finished difference Result 29 states and 32 transitions. [2022-02-20 17:29:27,468 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 32 transitions. [2022-02-20 17:29:27,468 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:29:27,468 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:29:27,468 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 17:29:27,468 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 17:29:27,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 18 states have (on average 1.1111111111111112) internal successors, (20), 20 states have internal predecessors, (20), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2022-02-20 17:29:27,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 29 transitions. [2022-02-20 17:29:27,470 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 29 transitions. Word has length 19 [2022-02-20 17:29:27,470 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 17:29:27,470 INFO L470 AbstractCegarLoop]: Abstraction has 27 states and 29 transitions. [2022-02-20 17:29:27,470 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 17:29:27,471 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 29 transitions. [2022-02-20 17:29:27,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-02-20 17:29:27,471 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:29:27,471 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 17:29:27,494 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2022-02-20 17:29:27,672 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-02-20 17:29:27,672 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 17:29:27,672 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:29:27,672 INFO L85 PathProgramCache]: Analyzing trace with hash 1670281901, now seen corresponding path program 1 times [2022-02-20 17:29:27,673 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 17:29:27,673 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [470123529] [2022-02-20 17:29:27,673 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:29:27,673 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 17:29:27,673 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 17:29:27,688 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-02-20 17:29:27,739 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2022-02-20 17:29:27,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-20 17:29:27,769 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-20 17:29:27,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-20 17:29:27,878 INFO L138 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2022-02-20 17:29:27,878 INFO L628 BasicCegarLoop]: Counterexample is feasible [2022-02-20 17:29:27,879 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-02-20 17:29:27,891 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2022-02-20 17:29:28,081 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-02-20 17:29:28,083 INFO L732 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2022-02-20 17:29:28,085 INFO L180 ceAbstractionStarter]: Computing trace abstraction results [2022-02-20 17:29:28,098 FATAL L489 DefaultTranslator]: Callstack has procedure call flag but succeeding procedure is empty at [CALL] call assume_abort_if_not((if ~bvuge32(~z~0, 0bv32) && ~bvule32(~z~0, 5bv32) then 1bv32 else 0bv32)); [2022-02-20 17:29:28,098 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:29:28,100 INFO L158 Benchmark]: Toolchain (without parser) took 10302.41ms. Allocated memory was 56.6MB in the beginning and 83.9MB in the end (delta: 27.3MB). Free memory was 35.2MB in the beginning and 42.3MB in the end (delta: -7.1MB). Peak memory consumption was 20.1MB. Max. memory is 16.1GB. [2022-02-20 17:29:28,100 INFO L158 Benchmark]: CDTParser took 0.41ms. Allocated memory is still 56.6MB. Free memory was 37.4MB in the beginning and 37.3MB in the end (delta: 30.0kB). There was no memory consumed. Max. memory is 16.1GB. [2022-02-20 17:29:28,101 INFO L158 Benchmark]: CACSL2BoogieTranslator took 213.67ms. Allocated memory was 56.6MB in the beginning and 83.9MB in the end (delta: 27.3MB). Free memory was 35.0MB in the beginning and 66.3MB in the end (delta: -31.3MB). Peak memory consumption was 9.3MB. Max. memory is 16.1GB. [2022-02-20 17:29:28,101 INFO L158 Benchmark]: Boogie Procedure Inliner took 33.26ms. Allocated memory is still 83.9MB. Free memory was 66.3MB in the beginning and 64.7MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. [2022-02-20 17:29:28,113 INFO L158 Benchmark]: Boogie Preprocessor took 37.48ms. Allocated memory is still 83.9MB. Free memory was 64.7MB in the beginning and 63.4MB in the end (delta: 1.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-20 17:29:28,113 INFO L158 Benchmark]: RCFGBuilder took 384.42ms. Allocated memory is still 83.9MB. Free memory was 63.4MB in the beginning and 53.7MB in the end (delta: 9.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-02-20 17:29:28,114 INFO L158 Benchmark]: TraceAbstraction took 9628.20ms. Allocated memory is still 83.9MB. Free memory was 53.4MB in the beginning and 42.3MB in the end (delta: 11.1MB). Peak memory consumption was 12.8MB. Max. memory is 16.1GB. [2022-02-20 17:29:28,115 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.41ms. Allocated memory is still 56.6MB. Free memory was 37.4MB in the beginning and 37.3MB in the end (delta: 30.0kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 213.67ms. Allocated memory was 56.6MB in the beginning and 83.9MB in the end (delta: 27.3MB). Free memory was 35.0MB in the beginning and 66.3MB in the end (delta: -31.3MB). Peak memory consumption was 9.3MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 33.26ms. Allocated memory is still 83.9MB. Free memory was 66.3MB in the beginning and 64.7MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 37.48ms. Allocated memory is still 83.9MB. Free memory was 64.7MB in the beginning and 63.4MB in the end (delta: 1.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 384.42ms. Allocated memory is still 83.9MB. Free memory was 63.4MB in the beginning and 53.7MB in the end (delta: 9.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 9628.20ms. Allocated memory is still 83.9MB. Free memory was 53.4MB in the beginning and 42.3MB in the end (delta: 11.1MB). Peak memory consumption was 12.8MB. 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:29:28,177 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: ERROR: ExceptionOrErrorResult: AssertionError: callstack broken after backtranslation by InlinerBacktranslator