./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/nla-digbench-scaling/geo1-u_valuebound20.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_valuebound20.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 56ae0381e0fc321a4bef875cc97d6a437c7ca54ffeb3bb010be2e47fa76c5a5f --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 17:29:12,333 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 17:29:12,334 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 17:29:12,366 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 17:29:12,367 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 17:29:12,368 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 17:29:12,369 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 17:29:12,370 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 17:29:12,371 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 17:29:12,371 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 17:29:12,372 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 17:29:12,373 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 17:29:12,373 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 17:29:12,374 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 17:29:12,374 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 17:29:12,375 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 17:29:12,375 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 17:29:12,376 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 17:29:12,377 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 17:29:12,378 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 17:29:12,395 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 17:29:12,396 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 17:29:12,397 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 17:29:12,397 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 17:29:12,413 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 17:29:12,413 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 17:29:12,413 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 17:29:12,414 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 17:29:12,414 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 17:29:12,415 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 17:29:12,415 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 17:29:12,415 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 17:29:12,416 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 17:29:12,416 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 17:29:12,417 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 17:29:12,417 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 17:29:12,417 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 17:29:12,418 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 17:29:12,418 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 17:29:12,418 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 17:29:12,419 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 17:29:12,420 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,436 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 17:29:12,439 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 17:29:12,440 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 17:29:12,440 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 17:29:12,441 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 17:29:12,441 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 17:29:12,441 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 17:29:12,441 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 17:29:12,441 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 17:29:12,442 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 17:29:12,442 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 17:29:12,442 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 17:29:12,442 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 17:29:12,443 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 17:29:12,443 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 17:29:12,443 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 17:29:12,443 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 17:29:12,443 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 17:29:12,443 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 17:29:12,443 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 17:29:12,443 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 17:29:12,444 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 17:29:12,444 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 17:29:12,444 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 17:29:12,444 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 17:29:12,444 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 17:29:12,444 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 17:29:12,445 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 17:29:12,445 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-20 17:29:12,445 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-20 17:29:12,445 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 17:29:12,445 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 17:29:12,445 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 17:29:12,445 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 -> 56ae0381e0fc321a4bef875cc97d6a437c7ca54ffeb3bb010be2e47fa76c5a5f [2022-02-20 17:29:12,645 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 17:29:12,660 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 17:29:12,662 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 17:29:12,663 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 17:29:12,663 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 17:29:12,664 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/nla-digbench-scaling/geo1-u_valuebound20.c [2022-02-20 17:29:12,702 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ad53b7d0a/34412842f32343b6bc9d25eecc1c3292/FLAGf36d35c2c [2022-02-20 17:29:13,029 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 17:29:13,029 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/geo1-u_valuebound20.c [2022-02-20 17:29:13,036 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ad53b7d0a/34412842f32343b6bc9d25eecc1c3292/FLAGf36d35c2c [2022-02-20 17:29:13,447 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ad53b7d0a/34412842f32343b6bc9d25eecc1c3292 [2022-02-20 17:29:13,449 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 17:29:13,451 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 17:29:13,452 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 17:29:13,452 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 17:29:13,454 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 17:29:13,455 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,456 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1302e54d 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,456 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,461 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 17:29:13,471 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 17:29:13,579 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_valuebound20.c[555,568] [2022-02-20 17:29:13,588 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 17:29:13,594 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 17:29:13,602 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_valuebound20.c[555,568] [2022-02-20 17:29:13,606 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 17:29:13,614 INFO L208 MainTranslator]: Completed translation [2022-02-20 17:29:13,615 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,615 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 17:29:13,616 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 17:29:13,616 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 17:29:13,616 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 17:29:13,621 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,626 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,638 INFO L137 Inliner]: procedures = 14, calls = 11, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 38 [2022-02-20 17:29:13,638 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 17:29:13,639 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 17:29:13,639 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 17:29:13,639 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 17:29:13,644 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,644 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,667 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,667 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,670 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,674 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,675 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,675 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 17:29:13,676 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 17:29:13,676 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 17:29:13,676 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 17:29:13,677 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,695 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 17:29:13,702 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 17:29:13,741 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,746 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,767 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 17:29:13,767 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-02-20 17:29:13,767 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-02-20 17:29:13,767 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-20 17:29:13,768 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 17:29:13,768 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 17:29:13,768 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-02-20 17:29:13,768 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-02-20 17:29:13,808 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 17:29:13,809 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 17:29:13,892 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 17:29:13,897 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 17:29:13,897 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-02-20 17:29:13,899 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,899 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 17:29:13,900 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 17:29:13,900 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 17:29:13,914 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 17:29:13,915 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,915 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@74f598df 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,915 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,915 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@74f598df 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,916 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,917 INFO L111 eAbstractionObserver]: Analyzing ICFG geo1-u_valuebound20.c [2022-02-20 17:29:13,920 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 17:29:13,920 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-02-20 17:29:13,948 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 17:29:13,952 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,953 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-02-20 17:29:13,972 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,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-02-20 17:29:13,975 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:29:13,976 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,976 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 17:29:13,980 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:29:13,986 INFO L85 PathProgramCache]: Analyzing trace with hash -1975646755, now seen corresponding path program 1 times [2022-02-20 17:29:13,993 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 17:29:13,993 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1608340045] [2022-02-20 17:29:13,993 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:29:13,994 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 17:29:14,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:29:14,102 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-02-20 17:29:14,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:29:14,117 INFO L290 TraceCheckUtils]: 0: Hoare triple {28#true} ~cond := #in~cond; {28#true} is VALID [2022-02-20 17:29:14,118 INFO L290 TraceCheckUtils]: 1: Hoare triple {28#true} assume 0 == ~cond;assume false; {29#false} is VALID [2022-02-20 17:29:14,119 INFO L290 TraceCheckUtils]: 2: Hoare triple {29#false} assume true; {29#false} is VALID [2022-02-20 17:29:14,119 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {29#false} {28#true} #51#return; {29#false} is VALID [2022-02-20 17:29:14,120 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-02-20 17:29:14,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:29:14,127 INFO L290 TraceCheckUtils]: 0: Hoare triple {28#true} ~cond := #in~cond; {28#true} is VALID [2022-02-20 17:29:14,128 INFO L290 TraceCheckUtils]: 1: Hoare triple {28#true} assume 0 == ~cond;assume false; {29#false} is VALID [2022-02-20 17:29:14,128 INFO L290 TraceCheckUtils]: 2: Hoare triple {29#false} assume true; {29#false} is VALID [2022-02-20 17:29:14,128 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {29#false} {29#false} #53#return; {29#false} is VALID [2022-02-20 17:29:14,128 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,129 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,129 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 <= 20 then 1 else 0)); {28#true} is VALID [2022-02-20 17:29:14,129 INFO L290 TraceCheckUtils]: 3: Hoare triple {28#true} ~cond := #in~cond; {28#true} is VALID [2022-02-20 17:29:14,130 INFO L290 TraceCheckUtils]: 4: Hoare triple {28#true} assume 0 == ~cond;assume false; {29#false} is VALID [2022-02-20 17:29:14,130 INFO L290 TraceCheckUtils]: 5: Hoare triple {29#false} assume true; {29#false} is VALID [2022-02-20 17:29:14,130 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {29#false} {28#true} #51#return; {29#false} is VALID [2022-02-20 17:29:14,130 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,130 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 <= 20 then 1 else 0)); {28#true} is VALID [2022-02-20 17:29:14,131 INFO L290 TraceCheckUtils]: 9: Hoare triple {28#true} ~cond := #in~cond; {28#true} is VALID [2022-02-20 17:29:14,131 INFO L290 TraceCheckUtils]: 10: Hoare triple {28#true} assume 0 == ~cond;assume false; {29#false} is VALID [2022-02-20 17:29:14,131 INFO L290 TraceCheckUtils]: 11: Hoare triple {29#false} assume true; {29#false} is VALID [2022-02-20 17:29:14,132 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {29#false} {29#false} #53#return; {29#false} is VALID [2022-02-20 17:29:14,132 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,132 INFO L290 TraceCheckUtils]: 14: Hoare triple {29#false} assume !false; {29#false} is VALID [2022-02-20 17:29:14,132 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,132 INFO L290 TraceCheckUtils]: 16: Hoare triple {29#false} ~cond := #in~cond; {29#false} is VALID [2022-02-20 17:29:14,133 INFO L290 TraceCheckUtils]: 17: Hoare triple {29#false} assume 0 == ~cond; {29#false} is VALID [2022-02-20 17:29:14,133 INFO L290 TraceCheckUtils]: 18: Hoare triple {29#false} assume !false; {29#false} is VALID [2022-02-20 17:29:14,133 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,134 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 17:29:14,134 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1608340045] [2022-02-20 17:29:14,134 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1608340045] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 17:29:14,135 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 17:29:14,135 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-20 17:29:14,136 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1973638946] [2022-02-20 17:29:14,137 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 17:29:14,140 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,142 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 17:29:14,144 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,169 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,169 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-02-20 17:29:14,169 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 17:29:14,184 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-02-20 17:29:14,185 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-02-20 17:29:14,186 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,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:29:14,229 INFO L93 Difference]: Finished difference Result 47 states and 62 transitions. [2022-02-20 17:29:14,229 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-20 17:29:14,229 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,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 17:29:14,231 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,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 62 transitions. [2022-02-20 17:29:14,237 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,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 62 transitions. [2022-02-20 17:29:14,241 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 62 transitions. [2022-02-20 17:29:14,304 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,309 INFO L225 Difference]: With dead ends: 47 [2022-02-20 17:29:14,310 INFO L226 Difference]: Without dead ends: 21 [2022-02-20 17:29:14,312 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,314 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,315 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,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2022-02-20 17:29:14,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2022-02-20 17:29:14,334 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 17:29:14,335 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,336 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,336 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,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:29:14,339 INFO L93 Difference]: Finished difference Result 21 states and 23 transitions. [2022-02-20 17:29:14,343 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 23 transitions. [2022-02-20 17:29:14,344 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:29:14,344 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:29:14,344 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,345 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,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:29:14,347 INFO L93 Difference]: Finished difference Result 21 states and 23 transitions. [2022-02-20 17:29:14,347 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 23 transitions. [2022-02-20 17:29:14,348 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:29:14,348 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:29:14,348 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 17:29:14,348 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 17:29:14,349 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,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 23 transitions. [2022-02-20 17:29:14,351 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 23 transitions. Word has length 19 [2022-02-20 17:29:14,351 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 17:29:14,352 INFO L470 AbstractCegarLoop]: Abstraction has 21 states and 23 transitions. [2022-02-20 17:29:14,352 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,352 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 23 transitions. [2022-02-20 17:29:14,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-02-20 17:29:14,353 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:29:14,353 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,353 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-20 17:29:14,353 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 17:29:14,354 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:29:14,354 INFO L85 PathProgramCache]: Analyzing trace with hash 1719515233, now seen corresponding path program 1 times [2022-02-20 17:29:14,354 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 17:29:14,355 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [667118858] [2022-02-20 17:29:14,355 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:29:14,355 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 17:29:14,370 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-20 17:29:14,370 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1095177287] [2022-02-20 17:29:14,370 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:29:14,371 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 17:29:14,371 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 17:29:14,374 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,376 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,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:29:14,410 INFO L263 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 7 conjunts are in the unsatisfiable core [2022-02-20 17:29:14,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:29:14,421 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 17:29:14,594 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,595 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,595 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 <= 20 then 1 else 0)); {172#true} is VALID [2022-02-20 17:29:14,596 INFO L290 TraceCheckUtils]: 3: Hoare triple {172#true} ~cond := #in~cond; {172#true} is VALID [2022-02-20 17:29:14,596 INFO L290 TraceCheckUtils]: 4: Hoare triple {172#true} assume !(0 == ~cond); {172#true} is VALID [2022-02-20 17:29:14,596 INFO L290 TraceCheckUtils]: 5: Hoare triple {172#true} assume true; {172#true} is VALID [2022-02-20 17:29:14,597 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {172#true} {172#true} #51#return; {172#true} is VALID [2022-02-20 17:29:14,597 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,597 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 <= 20 then 1 else 0)); {172#true} is VALID [2022-02-20 17:29:14,597 INFO L290 TraceCheckUtils]: 9: Hoare triple {172#true} ~cond := #in~cond; {172#true} is VALID [2022-02-20 17:29:14,597 INFO L290 TraceCheckUtils]: 10: Hoare triple {172#true} assume !(0 == ~cond); {172#true} is VALID [2022-02-20 17:29:14,598 INFO L290 TraceCheckUtils]: 11: Hoare triple {172#true} assume true; {172#true} is VALID [2022-02-20 17:29:14,598 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {172#true} {172#true} #53#return; {172#true} is VALID [2022-02-20 17:29:14,599 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,600 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,601 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,602 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,602 INFO L290 TraceCheckUtils]: 17: Hoare triple {227#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {173#false} is VALID [2022-02-20 17:29:14,602 INFO L290 TraceCheckUtils]: 18: Hoare triple {173#false} assume !false; {173#false} is VALID [2022-02-20 17:29:14,602 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,602 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 17:29:14,603 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 17:29:14,603 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [667118858] [2022-02-20 17:29:14,604 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-20 17:29:14,604 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1095177287] [2022-02-20 17:29:14,605 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1095177287] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 17:29:14,605 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 17:29:14,606 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 17:29:14,607 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [26448350] [2022-02-20 17:29:14,609 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 17:29:14,610 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,610 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 17:29:14,611 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,628 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,628 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 17:29:14,629 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 17:29:14,630 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 17:29:14,630 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 17:29:14,631 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,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:29:14,721 INFO L93 Difference]: Finished difference Result 31 states and 34 transitions. [2022-02-20 17:29:14,721 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 17:29:14,721 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,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 17:29:14,722 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,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 34 transitions. [2022-02-20 17:29:14,724 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,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 34 transitions. [2022-02-20 17:29:14,725 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 34 transitions. [2022-02-20 17:29:14,749 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,751 INFO L225 Difference]: With dead ends: 31 [2022-02-20 17:29:14,751 INFO L226 Difference]: Without dead ends: 29 [2022-02-20 17:29:14,751 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,752 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,752 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,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2022-02-20 17:29:14,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 27. [2022-02-20 17:29:14,756 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 17:29:14,757 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,757 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,757 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,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:29:14,759 INFO L93 Difference]: Finished difference Result 29 states and 32 transitions. [2022-02-20 17:29:14,759 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 32 transitions. [2022-02-20 17:29:14,760 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:29:14,760 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:29:14,760 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,760 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,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:29:14,762 INFO L93 Difference]: Finished difference Result 29 states and 32 transitions. [2022-02-20 17:29:14,762 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 32 transitions. [2022-02-20 17:29:14,763 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:29:14,763 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:29:14,763 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 17:29:14,763 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 17:29:14,763 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,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 29 transitions. [2022-02-20 17:29:14,765 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 29 transitions. Word has length 19 [2022-02-20 17:29:14,765 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 17:29:14,765 INFO L470 AbstractCegarLoop]: Abstraction has 27 states and 29 transitions. [2022-02-20 17:29:14,765 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,765 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 29 transitions. [2022-02-20 17:29:14,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-02-20 17:29:14,766 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:29:14,766 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,789 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-02-20 17:29:14,984 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,984 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 17:29:14,985 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:29:14,985 INFO L85 PathProgramCache]: Analyzing trace with hash 1670281901, now seen corresponding path program 1 times [2022-02-20 17:29:14,985 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 17:29:14,985 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1932198944] [2022-02-20 17:29:14,985 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:29:14,985 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 17:29:15,002 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-20 17:29:15,003 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1227641741] [2022-02-20 17:29:15,004 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:29:15,004 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 17:29:15,004 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 17:29:15,006 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:15,010 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:15,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-20 17:29:15,066 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-20 17:29:15,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-20 17:29:15,090 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-20 17:29:15,090 INFO L628 BasicCegarLoop]: Counterexample is feasible [2022-02-20 17:29:15,091 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-02-20 17:29:15,112 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,307 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,310 INFO L732 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2022-02-20 17:29:15,312 INFO L180 ceAbstractionStarter]: Computing trace abstraction results [2022-02-20 17:29:15,319 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 <= 20 then 1 else 0)); [2022-02-20 17:29:15,322 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,324 INFO L158 Benchmark]: Toolchain (without parser) took 1873.33ms. Allocated memory was 104.9MB in the beginning and 127.9MB in the end (delta: 23.1MB). Free memory was 76.5MB in the beginning and 99.6MB in the end (delta: -23.2MB). There was no memory consumed. Max. memory is 16.1GB. [2022-02-20 17:29:15,324 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 104.9MB. Free memory was 60.1MB in the beginning and 60.0MB in the end (delta: 90.9kB). There was no memory consumed. Max. memory is 16.1GB. [2022-02-20 17:29:15,329 INFO L158 Benchmark]: CACSL2BoogieTranslator took 162.97ms. Allocated memory was 104.9MB in the beginning and 127.9MB in the end (delta: 23.1MB). Free memory was 76.2MB in the beginning and 102.4MB in the end (delta: -26.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-02-20 17:29:15,330 INFO L158 Benchmark]: Boogie Procedure Inliner took 22.78ms. Allocated memory is still 127.9MB. Free memory was 102.4MB in the beginning and 100.7MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-20 17:29:15,330 INFO L158 Benchmark]: Boogie Preprocessor took 36.66ms. Allocated memory is still 127.9MB. Free memory was 100.7MB in the beginning and 99.6MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-20 17:29:15,330 INFO L158 Benchmark]: RCFGBuilder took 222.90ms. Allocated memory is still 127.9MB. Free memory was 99.6MB in the beginning and 89.8MB in the end (delta: 9.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-02-20 17:29:15,330 INFO L158 Benchmark]: TraceAbstraction took 1423.46ms. Allocated memory is still 127.9MB. Free memory was 89.5MB in the beginning and 99.6MB in the end (delta: -10.1MB). There was no memory consumed. Max. memory is 16.1GB. [2022-02-20 17:29:15,332 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.18ms. Allocated memory is still 104.9MB. Free memory was 60.1MB in the beginning and 60.0MB in the end (delta: 90.9kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 162.97ms. Allocated memory was 104.9MB in the beginning and 127.9MB in the end (delta: 23.1MB). Free memory was 76.2MB in the beginning and 102.4MB in the end (delta: -26.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 22.78ms. Allocated memory is still 127.9MB. Free memory was 102.4MB in the beginning and 100.7MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 36.66ms. Allocated memory is still 127.9MB. Free memory was 100.7MB in the beginning and 99.6MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 222.90ms. Allocated memory is still 127.9MB. Free memory was 99.6MB in the beginning and 89.8MB in the end (delta: 9.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 1423.46ms. Allocated memory is still 127.9MB. Free memory was 89.5MB in the beginning and 99.6MB in the end (delta: -10.1MB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - 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,357 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -ea -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/nla-digbench-scaling/geo1-u_valuebound20.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 56ae0381e0fc321a4bef875cc97d6a437c7ca54ffeb3bb010be2e47fa76c5a5f --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 17:29:17,139 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 17:29:17,141 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 17:29:17,164 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 17:29:17,165 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 17:29:17,168 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 17:29:17,169 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 17:29:17,170 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 17:29:17,171 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 17:29:17,172 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 17:29:17,173 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 17:29:17,173 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 17:29:17,174 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 17:29:17,174 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 17:29:17,175 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 17:29:17,176 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 17:29:17,177 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 17:29:17,177 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 17:29:17,178 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 17:29:17,179 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 17:29:17,180 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 17:29:17,181 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 17:29:17,182 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 17:29:17,183 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 17:29:17,184 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 17:29:17,185 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 17:29:17,185 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 17:29:17,185 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 17:29:17,186 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 17:29:17,186 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 17:29:17,187 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 17:29:17,187 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 17:29:17,188 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 17:29:17,188 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 17:29:17,189 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 17:29:17,189 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 17:29:17,190 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 17:29:17,190 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 17:29:17,190 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 17:29:17,191 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 17:29:17,191 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 17:29:17,192 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,211 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 17:29:17,211 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 17:29:17,212 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 17:29:17,212 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 17:29:17,213 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 17:29:17,213 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 17:29:17,213 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 17:29:17,213 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 17:29:17,214 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 17:29:17,214 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 17:29:17,214 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 17:29:17,214 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 17:29:17,214 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 17:29:17,215 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 17:29:17,215 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 17:29:17,215 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 17:29:17,215 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-02-20 17:29:17,215 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-02-20 17:29:17,216 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-02-20 17:29:17,216 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 17:29:17,216 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 17:29:17,216 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 17:29:17,216 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 17:29:17,217 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 17:29:17,217 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 17:29:17,217 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 17:29:17,217 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 17:29:17,217 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 17:29:17,218 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 17:29:17,218 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 17:29:17,218 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2022-02-20 17:29:17,218 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-02-20 17:29:17,218 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 17:29:17,219 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 17:29:17,219 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 17:29:17,219 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-02-20 17:29:17,219 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 -> 56ae0381e0fc321a4bef875cc97d6a437c7ca54ffeb3bb010be2e47fa76c5a5f [2022-02-20 17:29:17,472 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 17:29:17,494 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 17:29:17,496 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 17:29:17,497 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 17:29:17,497 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 17:29:17,499 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/nla-digbench-scaling/geo1-u_valuebound20.c [2022-02-20 17:29:17,549 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2f4a27c1f/3af1b68b803e433b80cb31dce5380785/FLAG5dc94128c [2022-02-20 17:29:17,876 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 17:29:17,876 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/geo1-u_valuebound20.c [2022-02-20 17:29:17,881 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2f4a27c1f/3af1b68b803e433b80cb31dce5380785/FLAG5dc94128c [2022-02-20 17:29:18,299 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2f4a27c1f/3af1b68b803e433b80cb31dce5380785 [2022-02-20 17:29:18,310 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 17:29:18,311 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 17:29:18,314 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 17:29:18,314 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 17:29:18,317 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 17:29:18,318 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 05:29:18" (1/1) ... [2022-02-20 17:29:18,320 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3ec1fc76 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:29:18, skipping insertion in model container [2022-02-20 17:29:18,320 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 05:29:18" (1/1) ... [2022-02-20 17:29:18,326 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 17:29:18,337 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 17:29:18,437 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_valuebound20.c[555,568] [2022-02-20 17:29:18,446 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 17:29:18,454 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 17:29:18,467 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_valuebound20.c[555,568] [2022-02-20 17:29:18,480 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 17:29:18,531 INFO L208 MainTranslator]: Completed translation [2022-02-20 17:29:18,532 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,532 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 17:29:18,533 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 17:29:18,533 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 17:29:18,533 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 17:29:18,538 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,558 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,575 INFO L137 Inliner]: procedures = 14, calls = 11, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 38 [2022-02-20 17:29:18,576 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 17:29:18,577 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 17:29:18,577 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 17:29:18,578 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 17:29:18,583 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,584 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,592 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,592 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,604 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,609 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,612 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,614 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 17:29:18,616 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 17:29:18,617 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 17:29:18,617 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 17:29:18,619 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,624 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 17:29:18,631 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 17:29:18,653 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,671 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,682 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 17:29:18,683 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-02-20 17:29:18,683 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-02-20 17:29:18,683 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-02-20 17:29:18,683 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 17:29:18,683 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 17:29:18,683 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-02-20 17:29:18,684 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-02-20 17:29:18,732 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 17:29:18,733 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 17:29:18,945 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 17:29:18,950 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 17:29:18,950 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-02-20 17:29:18,951 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,951 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 17:29:18,952 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 17:29:18,952 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 17:29:18,954 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 17:29:18,955 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 05:29:18" (1/3) ... [2022-02-20 17:29:18,955 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6c154a11 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,955 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,956 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6c154a11 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,956 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,957 INFO L111 eAbstractionObserver]: Analyzing ICFG geo1-u_valuebound20.c [2022-02-20 17:29:18,960 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 17:29:18,960 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-02-20 17:29:18,994 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 17:29:18,998 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,999 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-02-20 17:29:19,012 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:19,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-02-20 17:29:19,015 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:29:19,016 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,016 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 17:29:19,020 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:29:19,020 INFO L85 PathProgramCache]: Analyzing trace with hash -1975646755, now seen corresponding path program 1 times [2022-02-20 17:29:19,029 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 17:29:19,029 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1219352035] [2022-02-20 17:29:19,030 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:29:19,030 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 17:29:19,030 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 17:29:19,032 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:19,033 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:19,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:29:19,090 INFO L263 TraceCheckSpWp]: Trace formula consists of 40 conjuncts, 1 conjunts are in the unsatisfiable core [2022-02-20 17:29:19,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:29:19,100 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 17:29:19,194 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:19,195 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:19,196 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, 20bv32) then 1bv32 else 0bv32)); {28#true} is VALID [2022-02-20 17:29:19,196 INFO L290 TraceCheckUtils]: 3: Hoare triple {28#true} ~cond := #in~cond; {28#true} is VALID [2022-02-20 17:29:19,197 INFO L290 TraceCheckUtils]: 4: Hoare triple {28#true} assume 0bv32 == ~cond;assume false; {28#true} is VALID [2022-02-20 17:29:19,197 INFO L290 TraceCheckUtils]: 5: Hoare triple {28#true} assume true; {28#true} is VALID [2022-02-20 17:29:19,197 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {28#true} {28#true} #51#return; {28#true} is VALID [2022-02-20 17:29:19,198 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:19,198 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, 20bv32) then 1bv32 else 0bv32)); {28#true} is VALID [2022-02-20 17:29:19,199 INFO L290 TraceCheckUtils]: 9: Hoare triple {28#true} ~cond := #in~cond; {28#true} is VALID [2022-02-20 17:29:19,200 INFO L290 TraceCheckUtils]: 10: Hoare triple {28#true} assume 0bv32 == ~cond;assume false; {29#false} is VALID [2022-02-20 17:29:19,200 INFO L290 TraceCheckUtils]: 11: Hoare triple {29#false} assume true; {29#false} is VALID [2022-02-20 17:29:19,201 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {29#false} {28#true} #53#return; {29#false} is VALID [2022-02-20 17:29:19,201 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:19,201 INFO L290 TraceCheckUtils]: 14: Hoare triple {29#false} assume !false; {29#false} is VALID [2022-02-20 17:29:19,204 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:19,204 INFO L290 TraceCheckUtils]: 16: Hoare triple {29#false} ~cond := #in~cond; {29#false} is VALID [2022-02-20 17:29:19,204 INFO L290 TraceCheckUtils]: 17: Hoare triple {29#false} assume 0bv32 == ~cond; {29#false} is VALID [2022-02-20 17:29:19,204 INFO L290 TraceCheckUtils]: 18: Hoare triple {29#false} assume !false; {29#false} is VALID [2022-02-20 17:29:19,205 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:19,205 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 17:29:19,206 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 17:29:19,206 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1219352035] [2022-02-20 17:29:19,206 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1219352035] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 17:29:19,206 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 17:29:19,207 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-20 17:29:19,208 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1298710079] [2022-02-20 17:29:19,208 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 17:29:19,211 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,213 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 17:29:19,215 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:19,248 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:19,248 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-02-20 17:29:19,249 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 17:29:19,268 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-02-20 17:29:19,268 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-02-20 17:29:19,270 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,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:29:19,480 INFO L93 Difference]: Finished difference Result 47 states and 62 transitions. [2022-02-20 17:29:19,480 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-20 17:29:19,480 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,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 17:29:19,481 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,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 62 transitions. [2022-02-20 17:29:19,492 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,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 62 transitions. [2022-02-20 17:29:19,496 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 62 transitions. [2022-02-20 17:29:19,717 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,723 INFO L225 Difference]: With dead ends: 47 [2022-02-20 17:29:19,723 INFO L226 Difference]: Without dead ends: 21 [2022-02-20 17:29:19,725 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,732 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,733 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,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2022-02-20 17:29:19,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2022-02-20 17:29:19,769 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 17:29:19,770 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,771 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,772 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,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:29:19,779 INFO L93 Difference]: Finished difference Result 21 states and 23 transitions. [2022-02-20 17:29:19,779 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 23 transitions. [2022-02-20 17:29:19,780 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:29:19,780 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:29:19,781 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,782 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,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:29:19,803 INFO L93 Difference]: Finished difference Result 21 states and 23 transitions. [2022-02-20 17:29:19,803 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 23 transitions. [2022-02-20 17:29:19,803 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:29:19,803 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:29:19,804 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 17:29:19,804 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 17:29:19,804 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,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 23 transitions. [2022-02-20 17:29:19,806 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 23 transitions. Word has length 19 [2022-02-20 17:29:19,812 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 17:29:19,812 INFO L470 AbstractCegarLoop]: Abstraction has 21 states and 23 transitions. [2022-02-20 17:29:19,812 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,813 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 23 transitions. [2022-02-20 17:29:19,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-02-20 17:29:19,813 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:29:19,813 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,823 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2022-02-20 17:29:20,020 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:20,021 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 17:29:20,022 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:29:20,022 INFO L85 PathProgramCache]: Analyzing trace with hash 1719515233, now seen corresponding path program 1 times [2022-02-20 17:29:20,022 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 17:29:20,022 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1023498531] [2022-02-20 17:29:20,023 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:29:20,025 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 17:29:20,025 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 17:29:20,026 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:20,027 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:20,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:29:20,120 INFO L263 TraceCheckSpWp]: Trace formula consists of 40 conjuncts, 8 conjunts are in the unsatisfiable core [2022-02-20 17:29:20,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:29:20,128 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 17:29:20,362 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,362 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,362 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, 20bv32) then 1bv32 else 0bv32)); {218#true} is VALID [2022-02-20 17:29:20,363 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:20,363 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:20,364 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:20,365 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| (_ bv20 32))} is VALID [2022-02-20 17:29:20,365 INFO L290 TraceCheckUtils]: 7: Hoare triple {243#(bvule |ULTIMATE.start_main_~z~0#1| (_ bv20 32))} main_~k~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; {243#(bvule |ULTIMATE.start_main_~z~0#1| (_ bv20 32))} is VALID [2022-02-20 17:29:20,365 INFO L272 TraceCheckUtils]: 8: Hoare triple {243#(bvule |ULTIMATE.start_main_~z~0#1| (_ bv20 32))} call assume_abort_if_not((if ~bvuge32(main_~k~0#1, 0bv32) && ~bvule32(main_~k~0#1, 20bv32) then 1bv32 else 0bv32)); {218#true} is VALID [2022-02-20 17:29:20,365 INFO L290 TraceCheckUtils]: 9: Hoare triple {218#true} ~cond := #in~cond; {218#true} is VALID [2022-02-20 17:29:20,366 INFO L290 TraceCheckUtils]: 10: Hoare triple {218#true} assume !(0bv32 == ~cond); {218#true} is VALID [2022-02-20 17:29:20,366 INFO L290 TraceCheckUtils]: 11: Hoare triple {218#true} assume true; {218#true} is VALID [2022-02-20 17:29:20,366 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {218#true} {243#(bvule |ULTIMATE.start_main_~z~0#1| (_ bv20 32))} #53#return; {243#(bvule |ULTIMATE.start_main_~z~0#1| (_ bv20 32))} is VALID [2022-02-20 17:29:20,367 INFO L290 TraceCheckUtils]: 13: Hoare triple {243#(bvule |ULTIMATE.start_main_~z~0#1| (_ bv20 32))} main_~x~0#1 := 1bv64;main_~y~0#1 := ~zero_extendFrom32To64(main_~z~0#1);main_~c~0#1 := 1bv64; {265#(and (= |ULTIMATE.start_main_~x~0#1| (_ bv1 64)) (bvule |ULTIMATE.start_main_~z~0#1| (_ bv20 32)) (= |ULTIMATE.start_main_~y~0#1| ((_ zero_extend 32) |ULTIMATE.start_main_~z~0#1|)))} is VALID [2022-02-20 17:29:20,368 INFO L290 TraceCheckUtils]: 14: Hoare triple {265#(and (= |ULTIMATE.start_main_~x~0#1| (_ bv1 64)) (bvule |ULTIMATE.start_main_~z~0#1| (_ bv20 32)) (= |ULTIMATE.start_main_~y~0#1| ((_ zero_extend 32) |ULTIMATE.start_main_~z~0#1|)))} assume !false; {265#(and (= |ULTIMATE.start_main_~x~0#1| (_ bv1 64)) (bvule |ULTIMATE.start_main_~z~0#1| (_ bv20 32)) (= |ULTIMATE.start_main_~y~0#1| ((_ zero_extend 32) |ULTIMATE.start_main_~z~0#1|)))} is VALID [2022-02-20 17:29:20,369 INFO L272 TraceCheckUtils]: 15: Hoare triple {265#(and (= |ULTIMATE.start_main_~x~0#1| (_ bv1 64)) (bvule |ULTIMATE.start_main_~z~0#1| (_ bv20 32)) (= |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:20,369 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:20,370 INFO L290 TraceCheckUtils]: 17: Hoare triple {276#(= __VERIFIER_assert_~cond (_ bv1 32))} assume 0bv32 == ~cond; {219#false} is VALID [2022-02-20 17:29:20,370 INFO L290 TraceCheckUtils]: 18: Hoare triple {219#false} assume !false; {219#false} is VALID [2022-02-20 17:29:20,370 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:20,370 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 17:29:21,150 INFO L290 TraceCheckUtils]: 18: Hoare triple {219#false} assume !false; {219#false} is VALID [2022-02-20 17:29:21,151 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:21,152 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:21,152 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:21,153 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:21,154 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:21,154 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {218#true} {218#true} #53#return; {218#true} is VALID [2022-02-20 17:29:21,154 INFO L290 TraceCheckUtils]: 11: Hoare triple {218#true} assume true; {218#true} is VALID [2022-02-20 17:29:21,154 INFO L290 TraceCheckUtils]: 10: Hoare triple {218#true} assume !(0bv32 == ~cond); {218#true} is VALID [2022-02-20 17:29:21,154 INFO L290 TraceCheckUtils]: 9: Hoare triple {218#true} ~cond := #in~cond; {218#true} is VALID [2022-02-20 17:29:21,155 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, 20bv32) then 1bv32 else 0bv32)); {218#true} is VALID [2022-02-20 17:29:21,157 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:21,158 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {218#true} {218#true} #51#return; {218#true} is VALID [2022-02-20 17:29:21,158 INFO L290 TraceCheckUtils]: 5: Hoare triple {218#true} assume true; {218#true} is VALID [2022-02-20 17:29:21,158 INFO L290 TraceCheckUtils]: 4: Hoare triple {218#true} assume !(0bv32 == ~cond); {218#true} is VALID [2022-02-20 17:29:21,158 INFO L290 TraceCheckUtils]: 3: Hoare triple {218#true} ~cond := #in~cond; {218#true} is VALID [2022-02-20 17:29:21,159 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, 20bv32) then 1bv32 else 0bv32)); {218#true} is VALID [2022-02-20 17:29:21,159 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:21,159 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:21,161 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:21,162 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 17:29:21,162 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1023498531] [2022-02-20 17:29:21,163 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1023498531] provided 1 perfect and 1 imperfect interpolant sequences [2022-02-20 17:29:21,163 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-02-20 17:29:21,163 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [8] total 11 [2022-02-20 17:29:21,163 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [776560908] [2022-02-20 17:29:21,164 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 17:29:21,166 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:21,167 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 17:29:21,167 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:21,208 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:21,209 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 17:29:21,209 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 17:29:21,209 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 17:29:21,209 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2022-02-20 17:29:21,210 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:24,480 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-02-20 17:29:26,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:29:26,050 INFO L93 Difference]: Finished difference Result 31 states and 34 transitions. [2022-02-20 17:29:26,050 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-20 17:29:26,050 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:26,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 17:29:26,050 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:26,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 34 transitions. [2022-02-20 17:29:26,052 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:26,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 34 transitions. [2022-02-20 17:29:26,053 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 34 transitions. [2022-02-20 17:29:26,319 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:26,320 INFO L225 Difference]: With dead ends: 31 [2022-02-20 17:29:26,320 INFO L226 Difference]: Without dead ends: 29 [2022-02-20 17:29:26,320 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2022-02-20 17:29:26,321 INFO L933 BasicCegarLoop]: 19 mSDtfsCounter, 7 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 1 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s 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, 2.9s IncrementalHoareTripleChecker+Time [2022-02-20 17:29:26,321 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [8 Valid, 71 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 21 Invalid, 1 Unknown, 0 Unchecked, 2.9s Time] [2022-02-20 17:29:26,322 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2022-02-20 17:29:26,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 27. [2022-02-20 17:29:26,324 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 17:29:26,324 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:26,325 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:26,325 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:26,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:29:26,327 INFO L93 Difference]: Finished difference Result 29 states and 32 transitions. [2022-02-20 17:29:26,327 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 32 transitions. [2022-02-20 17:29:26,327 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:29:26,327 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:29:26,328 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:26,328 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:26,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:29:26,329 INFO L93 Difference]: Finished difference Result 29 states and 32 transitions. [2022-02-20 17:29:26,330 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 32 transitions. [2022-02-20 17:29:26,330 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:29:26,330 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:29:26,330 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 17:29:26,330 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 17:29:26,330 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:26,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 29 transitions. [2022-02-20 17:29:26,332 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 29 transitions. Word has length 19 [2022-02-20 17:29:26,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 17:29:26,332 INFO L470 AbstractCegarLoop]: Abstraction has 27 states and 29 transitions. [2022-02-20 17:29:26,332 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:26,333 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 29 transitions. [2022-02-20 17:29:26,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-02-20 17:29:26,333 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:29:26,333 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:26,343 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:26,537 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:26,537 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 17:29:26,538 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:29:26,538 INFO L85 PathProgramCache]: Analyzing trace with hash 1670281901, now seen corresponding path program 1 times [2022-02-20 17:29:26,538 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 17:29:26,539 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [458279080] [2022-02-20 17:29:26,539 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:29:26,539 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 17:29:26,539 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 17:29:26,541 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:26,542 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:26,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-20 17:29:26,651 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-20 17:29:26,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-20 17:29:26,760 INFO L138 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2022-02-20 17:29:26,763 INFO L628 BasicCegarLoop]: Counterexample is feasible [2022-02-20 17:29:26,764 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-02-20 17:29:26,790 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:26,966 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:26,969 INFO L732 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2022-02-20 17:29:26,971 INFO L180 ceAbstractionStarter]: Computing trace abstraction results [2022-02-20 17:29:26,986 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, 20bv32) then 1bv32 else 0bv32)); [2022-02-20 17:29:26,992 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:26,996 INFO L158 Benchmark]: Toolchain (without parser) took 8684.87ms. Allocated memory was 58.7MB in the beginning and 71.3MB in the end (delta: 12.6MB). Free memory was 43.9MB in the beginning and 27.8MB in the end (delta: 16.1MB). Peak memory consumption was 28.4MB. Max. memory is 16.1GB. [2022-02-20 17:29:27,011 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 48.2MB. Free memory was 29.9MB in the beginning and 29.8MB in the end (delta: 32.7kB). There was no memory consumed. Max. memory is 16.1GB. [2022-02-20 17:29:27,012 INFO L158 Benchmark]: CACSL2BoogieTranslator took 218.09ms. Allocated memory is still 58.7MB. Free memory was 43.7MB in the beginning and 42.9MB in the end (delta: 781.8kB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2022-02-20 17:29:27,013 INFO L158 Benchmark]: Boogie Procedure Inliner took 43.17ms. Allocated memory is still 58.7MB. Free memory was 42.9MB in the beginning and 41.3MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 16.1GB. [2022-02-20 17:29:27,013 INFO L158 Benchmark]: Boogie Preprocessor took 38.31ms. Allocated memory is still 58.7MB. Free memory was 41.3MB in the beginning and 40.0MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 16.1GB. [2022-02-20 17:29:27,013 INFO L158 Benchmark]: RCFGBuilder took 335.24ms. Allocated memory is still 58.7MB. Free memory was 40.0MB in the beginning and 30.5MB in the end (delta: 9.5MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2022-02-20 17:29:27,015 INFO L158 Benchmark]: TraceAbstraction took 8042.81ms. Allocated memory was 58.7MB in the beginning and 71.3MB in the end (delta: 12.6MB). Free memory was 30.0MB in the beginning and 27.8MB in the end (delta: 2.2MB). Peak memory consumption was 15.0MB. Max. memory is 16.1GB. [2022-02-20 17:29:27,017 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 48.2MB. Free memory was 29.9MB in the beginning and 29.8MB in the end (delta: 32.7kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 218.09ms. Allocated memory is still 58.7MB. Free memory was 43.7MB in the beginning and 42.9MB in the end (delta: 781.8kB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 43.17ms. Allocated memory is still 58.7MB. Free memory was 42.9MB in the beginning and 41.3MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 38.31ms. Allocated memory is still 58.7MB. Free memory was 41.3MB in the beginning and 40.0MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 335.24ms. Allocated memory is still 58.7MB. Free memory was 40.0MB in the beginning and 30.5MB in the end (delta: 9.5MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * TraceAbstraction took 8042.81ms. Allocated memory was 58.7MB in the beginning and 71.3MB in the end (delta: 12.6MB). Free memory was 30.0MB in the beginning and 27.8MB in the end (delta: 2.2MB). Peak memory consumption was 15.0MB. 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:27,052 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