./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/nla-digbench-scaling/hard2_unwindbound1.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/hard2_unwindbound1.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 c7383f54d0aefdd248f516d45c67549426beac87be78bf6e7bb8108aedb7974b --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 17:31:09,431 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 17:31:09,433 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 17:31:09,473 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 17:31:09,473 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 17:31:09,476 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 17:31:09,478 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 17:31:09,480 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 17:31:09,482 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 17:31:09,487 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 17:31:09,488 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 17:31:09,489 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 17:31:09,489 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 17:31:09,491 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 17:31:09,492 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 17:31:09,495 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 17:31:09,495 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 17:31:09,496 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 17:31:09,497 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 17:31:09,503 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 17:31:09,503 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 17:31:09,504 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 17:31:09,505 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 17:31:09,506 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 17:31:09,508 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 17:31:09,508 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 17:31:09,508 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 17:31:09,509 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 17:31:09,510 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 17:31:09,510 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 17:31:09,510 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 17:31:09,511 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 17:31:09,512 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 17:31:09,513 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 17:31:09,514 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 17:31:09,514 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 17:31:09,515 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 17:31:09,515 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 17:31:09,515 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 17:31:09,516 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 17:31:09,517 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 17:31:09,518 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:31:09,544 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 17:31:09,544 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 17:31:09,545 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 17:31:09,545 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 17:31:09,546 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 17:31:09,546 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 17:31:09,546 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 17:31:09,546 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 17:31:09,547 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 17:31:09,547 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 17:31:09,547 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 17:31:09,548 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 17:31:09,548 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 17:31:09,548 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 17:31:09,548 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 17:31:09,548 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 17:31:09,548 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 17:31:09,549 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 17:31:09,549 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 17:31:09,549 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 17:31:09,549 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 17:31:09,549 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 17:31:09,549 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 17:31:09,549 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 17:31:09,550 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 17:31:09,550 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 17:31:09,550 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 17:31:09,551 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 17:31:09,551 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-20 17:31:09,552 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-20 17:31:09,552 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 17:31:09,552 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 17:31:09,552 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 17:31:09,553 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 -> c7383f54d0aefdd248f516d45c67549426beac87be78bf6e7bb8108aedb7974b [2022-02-20 17:31:09,726 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 17:31:09,738 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 17:31:09,740 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 17:31:09,740 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 17:31:09,741 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 17:31:09,741 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/nla-digbench-scaling/hard2_unwindbound1.c [2022-02-20 17:31:09,775 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/814bec551/6ca530ebdad44f1d8d8bfdb9b536eec6/FLAG40d26c1a6 [2022-02-20 17:31:10,120 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 17:31:10,120 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/hard2_unwindbound1.c [2022-02-20 17:31:10,124 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/814bec551/6ca530ebdad44f1d8d8bfdb9b536eec6/FLAG40d26c1a6 [2022-02-20 17:31:10,543 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/814bec551/6ca530ebdad44f1d8d8bfdb9b536eec6 [2022-02-20 17:31:10,545 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 17:31:10,546 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 17:31:10,547 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 17:31:10,547 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 17:31:10,550 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 17:31:10,551 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 05:31:10" (1/1) ... [2022-02-20 17:31:10,552 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@63032c7c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:31:10, skipping insertion in model container [2022-02-20 17:31:10,552 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 05:31:10" (1/1) ... [2022-02-20 17:31:10,559 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 17:31:10,569 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 17:31:10,681 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/hard2_unwindbound1.c[526,539] [2022-02-20 17:31:10,703 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 17:31:10,710 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 17:31:10,717 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/hard2_unwindbound1.c[526,539] [2022-02-20 17:31:10,725 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 17:31:10,733 INFO L208 MainTranslator]: Completed translation [2022-02-20 17:31:10,733 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:31:10 WrapperNode [2022-02-20 17:31:10,734 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 17:31:10,734 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 17:31:10,735 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 17:31:10,735 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 17:31:10,741 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:31:10" (1/1) ... [2022-02-20 17:31:10,746 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:31:10" (1/1) ... [2022-02-20 17:31:10,761 INFO L137 Inliner]: procedures = 14, calls = 14, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 61 [2022-02-20 17:31:10,767 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 17:31:10,767 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 17:31:10,768 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 17:31:10,768 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 17:31:10,773 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:31:10" (1/1) ... [2022-02-20 17:31:10,773 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:31:10" (1/1) ... [2022-02-20 17:31:10,774 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:31:10" (1/1) ... [2022-02-20 17:31:10,774 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:31:10" (1/1) ... [2022-02-20 17:31:10,777 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:31:10" (1/1) ... [2022-02-20 17:31:10,779 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:31:10" (1/1) ... [2022-02-20 17:31:10,780 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:31:10" (1/1) ... [2022-02-20 17:31:10,781 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 17:31:10,782 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 17:31:10,782 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 17:31:10,782 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 17:31:10,782 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:31:10" (1/1) ... [2022-02-20 17:31:10,787 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 17:31:10,805 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 17:31:10,815 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:31:10,817 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:31:10,854 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 17:31:10,854 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-20 17:31:10,854 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 17:31:10,854 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 17:31:10,854 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-02-20 17:31:10,854 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-02-20 17:31:10,918 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 17:31:10,919 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 17:31:11,025 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 17:31:11,029 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 17:31:11,029 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-02-20 17:31:11,031 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 05:31:11 BoogieIcfgContainer [2022-02-20 17:31:11,031 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 17:31:11,032 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 17:31:11,032 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 17:31:11,034 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 17:31:11,034 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 05:31:10" (1/3) ... [2022-02-20 17:31:11,035 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3e8b1c49 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 05:31:11, skipping insertion in model container [2022-02-20 17:31:11,035 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:31:10" (2/3) ... [2022-02-20 17:31:11,035 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3e8b1c49 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 05:31:11, skipping insertion in model container [2022-02-20 17:31:11,035 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 05:31:11" (3/3) ... [2022-02-20 17:31:11,036 INFO L111 eAbstractionObserver]: Analyzing ICFG hard2_unwindbound1.c [2022-02-20 17:31:11,039 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 17:31:11,039 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-02-20 17:31:11,066 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 17:31:11,070 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:31:11,070 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-02-20 17:31:11,082 INFO L276 IsEmpty]: Start isEmpty. Operand has 26 states, 16 states have (on average 1.5625) internal successors, (25), 17 states have internal predecessors, (25), 7 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-02-20 17:31:11,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-02-20 17:31:11,085 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:31:11,085 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 17:31:11,085 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 17:31:11,088 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:31:11,089 INFO L85 PathProgramCache]: Analyzing trace with hash 643118537, now seen corresponding path program 1 times [2022-02-20 17:31:11,094 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 17:31:11,094 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [789305619] [2022-02-20 17:31:11,094 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:31:11,095 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 17:31:11,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:31:11,181 INFO L290 TraceCheckUtils]: 0: Hoare triple {29#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(8, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {29#true} is VALID [2022-02-20 17:31:11,181 INFO L290 TraceCheckUtils]: 1: Hoare triple {29#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~post5#1, main_#t~post6#1, main_~A~0#1, main_~B~0#1, main_~r~0#1, main_~d~0#1, main_~p~0#1, main_~q~0#1;havoc main_~A~0#1;havoc main_~B~0#1;havoc main_~r~0#1;havoc main_~d~0#1;havoc main_~p~0#1;havoc main_~q~0#1;assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;main_~A~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;main_~B~0#1 := 1;main_~r~0#1 := main_~A~0#1;main_~d~0#1 := main_~B~0#1;main_~p~0#1 := 1;main_~q~0#1 := 0; {29#true} is VALID [2022-02-20 17:31:11,182 INFO L290 TraceCheckUtils]: 2: Hoare triple {29#true} assume !true; {30#false} is VALID [2022-02-20 17:31:11,182 INFO L290 TraceCheckUtils]: 3: Hoare triple {30#false} assume !true; {30#false} is VALID [2022-02-20 17:31:11,182 INFO L272 TraceCheckUtils]: 4: Hoare triple {30#false} call __VERIFIER_assert((if main_~A~0#1 == main_~d~0#1 * main_~q~0#1 + main_~r~0#1 then 1 else 0)); {30#false} is VALID [2022-02-20 17:31:11,183 INFO L290 TraceCheckUtils]: 5: Hoare triple {30#false} ~cond := #in~cond; {30#false} is VALID [2022-02-20 17:31:11,183 INFO L290 TraceCheckUtils]: 6: Hoare triple {30#false} assume 0 == ~cond; {30#false} is VALID [2022-02-20 17:31:11,183 INFO L290 TraceCheckUtils]: 7: Hoare triple {30#false} assume !false; {30#false} is VALID [2022-02-20 17:31:11,184 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 17:31:11,184 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 17:31:11,185 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [789305619] [2022-02-20 17:31:11,185 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [789305619] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 17:31:11,185 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 17:31:11,186 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-20 17:31:11,187 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1556077556] [2022-02-20 17:31:11,187 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 17:31:11,190 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2022-02-20 17:31:11,191 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 17:31:11,193 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:31:11,203 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 8 edges. 8 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:31:11,203 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-02-20 17:31:11,203 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 17:31:11,216 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-02-20 17:31:11,216 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-02-20 17:31:11,218 INFO L87 Difference]: Start difference. First operand has 26 states, 16 states have (on average 1.5625) internal successors, (25), 17 states have internal predecessors, (25), 7 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:31:11,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:31:11,267 INFO L93 Difference]: Finished difference Result 50 states and 83 transitions. [2022-02-20 17:31:11,273 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-20 17:31:11,273 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2022-02-20 17:31:11,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 17:31:11,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:31:11,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 83 transitions. [2022-02-20 17:31:11,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:31:11,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 83 transitions. [2022-02-20 17:31:11,285 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 83 transitions. [2022-02-20 17:31:11,362 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 83 edges. 83 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:31:11,370 INFO L225 Difference]: With dead ends: 50 [2022-02-20 17:31:11,370 INFO L226 Difference]: Without dead ends: 22 [2022-02-20 17:31:11,373 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-02-20 17:31:11,379 INFO L933 BasicCegarLoop]: 36 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, 36 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:31:11,381 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 17:31:11,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2022-02-20 17:31:11,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2022-02-20 17:31:11,407 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 17:31:11,408 INFO L82 GeneralOperation]: Start isEquivalent. First operand 22 states. Second operand has 22 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 14 states have internal predecessors, (19), 7 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-02-20 17:31:11,408 INFO L74 IsIncluded]: Start isIncluded. First operand 22 states. Second operand has 22 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 14 states have internal predecessors, (19), 7 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-02-20 17:31:11,409 INFO L87 Difference]: Start difference. First operand 22 states. Second operand has 22 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 14 states have internal predecessors, (19), 7 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-02-20 17:31:11,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:31:11,417 INFO L93 Difference]: Finished difference Result 22 states and 32 transitions. [2022-02-20 17:31:11,417 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 32 transitions. [2022-02-20 17:31:11,418 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:31:11,419 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:31:11,419 INFO L74 IsIncluded]: Start isIncluded. First operand has 22 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 14 states have internal predecessors, (19), 7 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand 22 states. [2022-02-20 17:31:11,420 INFO L87 Difference]: Start difference. First operand has 22 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 14 states have internal predecessors, (19), 7 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand 22 states. [2022-02-20 17:31:11,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:31:11,424 INFO L93 Difference]: Finished difference Result 22 states and 32 transitions. [2022-02-20 17:31:11,425 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 32 transitions. [2022-02-20 17:31:11,425 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:31:11,426 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:31:11,426 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 17:31:11,426 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 17:31:11,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 14 states have internal predecessors, (19), 7 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-02-20 17:31:11,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 32 transitions. [2022-02-20 17:31:11,434 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 32 transitions. Word has length 8 [2022-02-20 17:31:11,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 17:31:11,435 INFO L470 AbstractCegarLoop]: Abstraction has 22 states and 32 transitions. [2022-02-20 17:31:11,435 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:31:11,435 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 32 transitions. [2022-02-20 17:31:11,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-02-20 17:31:11,437 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:31:11,437 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 17:31:11,437 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-20 17:31:11,438 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 17:31:11,440 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:31:11,441 INFO L85 PathProgramCache]: Analyzing trace with hash 181060127, now seen corresponding path program 1 times [2022-02-20 17:31:11,441 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 17:31:11,441 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1447811051] [2022-02-20 17:31:11,442 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:31:11,444 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 17:31:11,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:31:11,528 INFO L290 TraceCheckUtils]: 0: Hoare triple {178#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(8, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {178#true} is VALID [2022-02-20 17:31:11,529 INFO L290 TraceCheckUtils]: 1: Hoare triple {178#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~post5#1, main_#t~post6#1, main_~A~0#1, main_~B~0#1, main_~r~0#1, main_~d~0#1, main_~p~0#1, main_~q~0#1;havoc main_~A~0#1;havoc main_~B~0#1;havoc main_~r~0#1;havoc main_~d~0#1;havoc main_~p~0#1;havoc main_~q~0#1;assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;main_~A~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;main_~B~0#1 := 1;main_~r~0#1 := main_~A~0#1;main_~d~0#1 := main_~B~0#1;main_~p~0#1 := 1;main_~q~0#1 := 0; {180#(= |ULTIMATE.start_main_~q~0#1| 0)} is VALID [2022-02-20 17:31:11,530 INFO L290 TraceCheckUtils]: 2: Hoare triple {180#(= |ULTIMATE.start_main_~q~0#1| 0)} main_#t~post5#1 := ~counter~0;~counter~0 := 1 + main_#t~post5#1; {180#(= |ULTIMATE.start_main_~q~0#1| 0)} is VALID [2022-02-20 17:31:11,531 INFO L290 TraceCheckUtils]: 3: Hoare triple {180#(= |ULTIMATE.start_main_~q~0#1| 0)} assume !!(main_#t~post5#1 < 1);havoc main_#t~post5#1; {180#(= |ULTIMATE.start_main_~q~0#1| 0)} is VALID [2022-02-20 17:31:11,532 INFO L272 TraceCheckUtils]: 4: Hoare triple {180#(= |ULTIMATE.start_main_~q~0#1| 0)} call __VERIFIER_assert((if 0 == main_~q~0#1 then 1 else 0)); {181#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-02-20 17:31:11,533 INFO L290 TraceCheckUtils]: 5: Hoare triple {181#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {182#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-02-20 17:31:11,534 INFO L290 TraceCheckUtils]: 6: Hoare triple {182#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {179#false} is VALID [2022-02-20 17:31:11,537 INFO L290 TraceCheckUtils]: 7: Hoare triple {179#false} assume !false; {179#false} is VALID [2022-02-20 17:31:11,538 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 17:31:11,538 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 17:31:11,538 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1447811051] [2022-02-20 17:31:11,538 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1447811051] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 17:31:11,539 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 17:31:11,539 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 17:31:11,539 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1671388462] [2022-02-20 17:31:11,539 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 17:31:11,541 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.4) internal successors, (7), 4 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2022-02-20 17:31:11,541 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 17:31:11,541 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 1.4) internal successors, (7), 4 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:31:11,554 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 8 edges. 8 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:31:11,555 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 17:31:11,556 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 17:31:11,557 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 17:31:11,557 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 17:31:11,557 INFO L87 Difference]: Start difference. First operand 22 states and 32 transitions. Second operand has 5 states, 5 states have (on average 1.4) internal successors, (7), 4 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:31:11,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:31:11,696 INFO L93 Difference]: Finished difference Result 36 states and 51 transitions. [2022-02-20 17:31:11,696 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-20 17:31:11,696 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.4) internal successors, (7), 4 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2022-02-20 17:31:11,696 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 17:31:11,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 1.4) internal successors, (7), 4 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:31:11,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 51 transitions. [2022-02-20 17:31:11,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 1.4) internal successors, (7), 4 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:31:11,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 51 transitions. [2022-02-20 17:31:11,699 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 51 transitions. [2022-02-20 17:31:11,737 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 51 edges. 51 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:31:11,738 INFO L225 Difference]: With dead ends: 36 [2022-02-20 17:31:11,738 INFO L226 Difference]: Without dead ends: 34 [2022-02-20 17:31:11,739 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 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:31:11,739 INFO L933 BasicCegarLoop]: 31 mSDtfsCounter, 15 mSDsluCounter, 74 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 105 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 17:31:11,740 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [21 Valid, 105 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 17:31:11,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2022-02-20 17:31:11,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 26. [2022-02-20 17:31:11,743 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 17:31:11,743 INFO L82 GeneralOperation]: Start isEquivalent. First operand 34 states. Second operand has 26 states, 16 states have (on average 1.375) internal successors, (22), 17 states have internal predecessors, (22), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-02-20 17:31:11,744 INFO L74 IsIncluded]: Start isIncluded. First operand 34 states. Second operand has 26 states, 16 states have (on average 1.375) internal successors, (22), 17 states have internal predecessors, (22), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-02-20 17:31:11,744 INFO L87 Difference]: Start difference. First operand 34 states. Second operand has 26 states, 16 states have (on average 1.375) internal successors, (22), 17 states have internal predecessors, (22), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-02-20 17:31:11,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:31:11,746 INFO L93 Difference]: Finished difference Result 34 states and 49 transitions. [2022-02-20 17:31:11,746 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 49 transitions. [2022-02-20 17:31:11,746 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:31:11,747 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:31:11,747 INFO L74 IsIncluded]: Start isIncluded. First operand has 26 states, 16 states have (on average 1.375) internal successors, (22), 17 states have internal predecessors, (22), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand 34 states. [2022-02-20 17:31:11,747 INFO L87 Difference]: Start difference. First operand has 26 states, 16 states have (on average 1.375) internal successors, (22), 17 states have internal predecessors, (22), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand 34 states. [2022-02-20 17:31:11,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:31:11,749 INFO L93 Difference]: Finished difference Result 34 states and 49 transitions. [2022-02-20 17:31:11,749 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 49 transitions. [2022-02-20 17:31:11,750 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:31:11,750 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:31:11,750 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 17:31:11,750 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 17:31:11,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 16 states have (on average 1.375) internal successors, (22), 17 states have internal predecessors, (22), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-02-20 17:31:11,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 35 transitions. [2022-02-20 17:31:11,751 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 35 transitions. Word has length 8 [2022-02-20 17:31:11,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 17:31:11,752 INFO L470 AbstractCegarLoop]: Abstraction has 26 states and 35 transitions. [2022-02-20 17:31:11,752 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.4) internal successors, (7), 4 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:31:11,752 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 35 transitions. [2022-02-20 17:31:11,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-02-20 17:31:11,752 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:31:11,753 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 17:31:11,753 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-02-20 17:31:11,753 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 17:31:11,753 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:31:11,753 INFO L85 PathProgramCache]: Analyzing trace with hash -712280900, now seen corresponding path program 1 times [2022-02-20 17:31:11,754 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 17:31:11,754 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1827180701] [2022-02-20 17:31:11,754 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:31:11,754 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 17:31:11,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:31:11,777 INFO L290 TraceCheckUtils]: 0: Hoare triple {341#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(8, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {343#(= ~counter~0 0)} is VALID [2022-02-20 17:31:11,777 INFO L290 TraceCheckUtils]: 1: Hoare triple {343#(= ~counter~0 0)} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~post5#1, main_#t~post6#1, main_~A~0#1, main_~B~0#1, main_~r~0#1, main_~d~0#1, main_~p~0#1, main_~q~0#1;havoc main_~A~0#1;havoc main_~B~0#1;havoc main_~r~0#1;havoc main_~d~0#1;havoc main_~p~0#1;havoc main_~q~0#1;assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;main_~A~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;main_~B~0#1 := 1;main_~r~0#1 := main_~A~0#1;main_~d~0#1 := main_~B~0#1;main_~p~0#1 := 1;main_~q~0#1 := 0; {343#(= ~counter~0 0)} is VALID [2022-02-20 17:31:11,778 INFO L290 TraceCheckUtils]: 2: Hoare triple {343#(= ~counter~0 0)} main_#t~post5#1 := ~counter~0;~counter~0 := 1 + main_#t~post5#1; {344#(= |ULTIMATE.start_main_#t~post5#1| 0)} is VALID [2022-02-20 17:31:11,778 INFO L290 TraceCheckUtils]: 3: Hoare triple {344#(= |ULTIMATE.start_main_#t~post5#1| 0)} assume !(main_#t~post5#1 < 1);havoc main_#t~post5#1; {342#false} is VALID [2022-02-20 17:31:11,779 INFO L290 TraceCheckUtils]: 4: Hoare triple {342#false} main_#t~post6#1 := ~counter~0;~counter~0 := 1 + main_#t~post6#1; {342#false} is VALID [2022-02-20 17:31:11,779 INFO L290 TraceCheckUtils]: 5: Hoare triple {342#false} assume !!(main_#t~post6#1 < 1);havoc main_#t~post6#1; {342#false} is VALID [2022-02-20 17:31:11,779 INFO L272 TraceCheckUtils]: 6: Hoare triple {342#false} call __VERIFIER_assert((if main_~A~0#1 == main_~q~0#1 * main_~B~0#1 + main_~r~0#1 then 1 else 0)); {342#false} is VALID [2022-02-20 17:31:11,779 INFO L290 TraceCheckUtils]: 7: Hoare triple {342#false} ~cond := #in~cond; {342#false} is VALID [2022-02-20 17:31:11,779 INFO L290 TraceCheckUtils]: 8: Hoare triple {342#false} assume 0 == ~cond; {342#false} is VALID [2022-02-20 17:31:11,779 INFO L290 TraceCheckUtils]: 9: Hoare triple {342#false} assume !false; {342#false} is VALID [2022-02-20 17:31:11,780 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 17:31:11,780 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 17:31:11,780 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1827180701] [2022-02-20 17:31:11,780 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1827180701] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 17:31:11,780 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 17:31:11,780 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 17:31:11,781 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1024458571] [2022-02-20 17:31:11,781 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 17:31:11,781 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 3 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2022-02-20 17:31:11,781 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 17:31:11,782 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 2.25) internal successors, (9), 3 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:31:11,788 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 10 edges. 10 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:31:11,788 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-20 17:31:11,789 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 17:31:11,789 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-20 17:31:11,789 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-20 17:31:11,789 INFO L87 Difference]: Start difference. First operand 26 states and 35 transitions. Second operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 3 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:31:11,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:31:11,862 INFO L93 Difference]: Finished difference Result 42 states and 57 transitions. [2022-02-20 17:31:11,862 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-20 17:31:11,863 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 3 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2022-02-20 17:31:11,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 17:31:11,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 3 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:31:11,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 54 transitions. [2022-02-20 17:31:11,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 3 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:31:11,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 54 transitions. [2022-02-20 17:31:11,871 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 54 transitions. [2022-02-20 17:31:11,918 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 54 edges. 54 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:31:11,918 INFO L225 Difference]: With dead ends: 42 [2022-02-20 17:31:11,919 INFO L226 Difference]: Without dead ends: 28 [2022-02-20 17:31:11,919 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-20 17:31:11,920 INFO L933 BasicCegarLoop]: 30 mSDtfsCounter, 0 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 85 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 17:31:11,920 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 85 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 17:31:11,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2022-02-20 17:31:11,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2022-02-20 17:31:11,923 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 17:31:11,923 INFO L82 GeneralOperation]: Start isEquivalent. First operand 28 states. Second operand has 28 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 19 states have internal predecessors, (24), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-02-20 17:31:11,924 INFO L74 IsIncluded]: Start isIncluded. First operand 28 states. Second operand has 28 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 19 states have internal predecessors, (24), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-02-20 17:31:11,924 INFO L87 Difference]: Start difference. First operand 28 states. Second operand has 28 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 19 states have internal predecessors, (24), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-02-20 17:31:11,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:31:11,926 INFO L93 Difference]: Finished difference Result 28 states and 37 transitions. [2022-02-20 17:31:11,926 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 37 transitions. [2022-02-20 17:31:11,926 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:31:11,926 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:31:11,927 INFO L74 IsIncluded]: Start isIncluded. First operand has 28 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 19 states have internal predecessors, (24), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand 28 states. [2022-02-20 17:31:11,927 INFO L87 Difference]: Start difference. First operand has 28 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 19 states have internal predecessors, (24), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand 28 states. [2022-02-20 17:31:11,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:31:11,928 INFO L93 Difference]: Finished difference Result 28 states and 37 transitions. [2022-02-20 17:31:11,928 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 37 transitions. [2022-02-20 17:31:11,928 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:31:11,929 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:31:11,929 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 17:31:11,929 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 17:31:11,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 19 states have internal predecessors, (24), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-02-20 17:31:11,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 37 transitions. [2022-02-20 17:31:11,930 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 37 transitions. Word has length 10 [2022-02-20 17:31:11,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 17:31:11,930 INFO L470 AbstractCegarLoop]: Abstraction has 28 states and 37 transitions. [2022-02-20 17:31:11,931 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 3 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:31:11,931 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 37 transitions. [2022-02-20 17:31:11,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-02-20 17:31:11,931 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:31:11,931 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 17:31:11,931 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-02-20 17:31:11,932 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 17:31:11,932 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:31:11,932 INFO L85 PathProgramCache]: Analyzing trace with hash 2036073049, now seen corresponding path program 1 times [2022-02-20 17:31:11,932 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 17:31:11,932 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2090731666] [2022-02-20 17:31:11,933 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:31:11,933 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 17:31:11,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:31:11,981 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-02-20 17:31:11,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:31:11,989 INFO L290 TraceCheckUtils]: 0: Hoare triple {500#true} ~cond := #in~cond; {500#true} is VALID [2022-02-20 17:31:11,989 INFO L290 TraceCheckUtils]: 1: Hoare triple {500#true} assume !(0 == ~cond); {500#true} is VALID [2022-02-20 17:31:11,990 INFO L290 TraceCheckUtils]: 2: Hoare triple {500#true} assume true; {500#true} is VALID [2022-02-20 17:31:11,990 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {500#true} {502#(= |ULTIMATE.start_main_~A~0#1| |ULTIMATE.start_main_~r~0#1|)} #67#return; {502#(= |ULTIMATE.start_main_~A~0#1| |ULTIMATE.start_main_~r~0#1|)} is VALID [2022-02-20 17:31:11,990 INFO L290 TraceCheckUtils]: 0: Hoare triple {500#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(8, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {500#true} is VALID [2022-02-20 17:31:11,991 INFO L290 TraceCheckUtils]: 1: Hoare triple {500#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~post5#1, main_#t~post6#1, main_~A~0#1, main_~B~0#1, main_~r~0#1, main_~d~0#1, main_~p~0#1, main_~q~0#1;havoc main_~A~0#1;havoc main_~B~0#1;havoc main_~r~0#1;havoc main_~d~0#1;havoc main_~p~0#1;havoc main_~q~0#1;assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;main_~A~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;main_~B~0#1 := 1;main_~r~0#1 := main_~A~0#1;main_~d~0#1 := main_~B~0#1;main_~p~0#1 := 1;main_~q~0#1 := 0; {502#(= |ULTIMATE.start_main_~A~0#1| |ULTIMATE.start_main_~r~0#1|)} is VALID [2022-02-20 17:31:11,991 INFO L290 TraceCheckUtils]: 2: Hoare triple {502#(= |ULTIMATE.start_main_~A~0#1| |ULTIMATE.start_main_~r~0#1|)} main_#t~post5#1 := ~counter~0;~counter~0 := 1 + main_#t~post5#1; {502#(= |ULTIMATE.start_main_~A~0#1| |ULTIMATE.start_main_~r~0#1|)} is VALID [2022-02-20 17:31:11,992 INFO L290 TraceCheckUtils]: 3: Hoare triple {502#(= |ULTIMATE.start_main_~A~0#1| |ULTIMATE.start_main_~r~0#1|)} assume !!(main_#t~post5#1 < 1);havoc main_#t~post5#1; {502#(= |ULTIMATE.start_main_~A~0#1| |ULTIMATE.start_main_~r~0#1|)} is VALID [2022-02-20 17:31:11,992 INFO L272 TraceCheckUtils]: 4: Hoare triple {502#(= |ULTIMATE.start_main_~A~0#1| |ULTIMATE.start_main_~r~0#1|)} call __VERIFIER_assert((if 0 == main_~q~0#1 then 1 else 0)); {500#true} is VALID [2022-02-20 17:31:11,992 INFO L290 TraceCheckUtils]: 5: Hoare triple {500#true} ~cond := #in~cond; {500#true} is VALID [2022-02-20 17:31:11,992 INFO L290 TraceCheckUtils]: 6: Hoare triple {500#true} assume !(0 == ~cond); {500#true} is VALID [2022-02-20 17:31:11,992 INFO L290 TraceCheckUtils]: 7: Hoare triple {500#true} assume true; {500#true} is VALID [2022-02-20 17:31:11,993 INFO L284 TraceCheckUtils]: 8: Hoare quadruple {500#true} {502#(= |ULTIMATE.start_main_~A~0#1| |ULTIMATE.start_main_~r~0#1|)} #67#return; {502#(= |ULTIMATE.start_main_~A~0#1| |ULTIMATE.start_main_~r~0#1|)} is VALID [2022-02-20 17:31:11,994 INFO L272 TraceCheckUtils]: 9: Hoare triple {502#(= |ULTIMATE.start_main_~A~0#1| |ULTIMATE.start_main_~r~0#1|)} call __VERIFIER_assert((if main_~r~0#1 == main_~A~0#1 then 1 else 0)); {507#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-02-20 17:31:11,994 INFO L290 TraceCheckUtils]: 10: Hoare triple {507#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {508#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-02-20 17:31:11,994 INFO L290 TraceCheckUtils]: 11: Hoare triple {508#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {501#false} is VALID [2022-02-20 17:31:11,995 INFO L290 TraceCheckUtils]: 12: Hoare triple {501#false} assume !false; {501#false} is VALID [2022-02-20 17:31:11,995 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 17:31:11,995 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 17:31:11,995 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2090731666] [2022-02-20 17:31:11,995 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2090731666] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 17:31:11,995 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 17:31:11,996 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 17:31:11,996 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [813947440] [2022-02-20 17:31:11,996 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 17:31:11,996 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 13 [2022-02-20 17:31:11,996 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 17:31:11,997 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 17:31:12,008 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 13 edges. 13 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:31:12,008 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 17:31:12,009 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 17:31:12,009 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 17:31:12,009 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 17:31:12,009 INFO L87 Difference]: Start difference. First operand 28 states and 37 transitions. Second operand has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 17:31:12,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:31:12,136 INFO L93 Difference]: Finished difference Result 42 states and 56 transitions. [2022-02-20 17:31:12,136 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-20 17:31:12,137 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 13 [2022-02-20 17:31:12,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 17:31:12,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 17:31:12,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 51 transitions. [2022-02-20 17:31:12,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 17:31:12,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 51 transitions. [2022-02-20 17:31:12,140 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 51 transitions. [2022-02-20 17:31:12,185 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 51 edges. 51 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:31:12,187 INFO L225 Difference]: With dead ends: 42 [2022-02-20 17:31:12,187 INFO L226 Difference]: Without dead ends: 40 [2022-02-20 17:31:12,187 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 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:31:12,188 INFO L933 BasicCegarLoop]: 31 mSDtfsCounter, 13 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 101 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 17:31:12,188 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [18 Valid, 101 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 17:31:12,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2022-02-20 17:31:12,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 32. [2022-02-20 17:31:12,191 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 17:31:12,191 INFO L82 GeneralOperation]: Start isEquivalent. First operand 40 states. Second operand has 32 states, 21 states have (on average 1.2857142857142858) internal successors, (27), 22 states have internal predecessors, (27), 7 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-02-20 17:31:12,191 INFO L74 IsIncluded]: Start isIncluded. First operand 40 states. Second operand has 32 states, 21 states have (on average 1.2857142857142858) internal successors, (27), 22 states have internal predecessors, (27), 7 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-02-20 17:31:12,192 INFO L87 Difference]: Start difference. First operand 40 states. Second operand has 32 states, 21 states have (on average 1.2857142857142858) internal successors, (27), 22 states have internal predecessors, (27), 7 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-02-20 17:31:12,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:31:12,193 INFO L93 Difference]: Finished difference Result 40 states and 54 transitions. [2022-02-20 17:31:12,193 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 54 transitions. [2022-02-20 17:31:12,193 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:31:12,194 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:31:12,194 INFO L74 IsIncluded]: Start isIncluded. First operand has 32 states, 21 states have (on average 1.2857142857142858) internal successors, (27), 22 states have internal predecessors, (27), 7 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand 40 states. [2022-02-20 17:31:12,194 INFO L87 Difference]: Start difference. First operand has 32 states, 21 states have (on average 1.2857142857142858) internal successors, (27), 22 states have internal predecessors, (27), 7 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand 40 states. [2022-02-20 17:31:12,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:31:12,196 INFO L93 Difference]: Finished difference Result 40 states and 54 transitions. [2022-02-20 17:31:12,196 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 54 transitions. [2022-02-20 17:31:12,196 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:31:12,196 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:31:12,196 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 17:31:12,197 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 17:31:12,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 21 states have (on average 1.2857142857142858) internal successors, (27), 22 states have internal predecessors, (27), 7 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-02-20 17:31:12,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 40 transitions. [2022-02-20 17:31:12,198 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 40 transitions. Word has length 13 [2022-02-20 17:31:12,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 17:31:12,198 INFO L470 AbstractCegarLoop]: Abstraction has 32 states and 40 transitions. [2022-02-20 17:31:12,198 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 17:31:12,199 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 40 transitions. [2022-02-20 17:31:12,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-02-20 17:31:12,199 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:31:12,199 INFO L514 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 17:31:12,199 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-02-20 17:31:12,199 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 17:31:12,200 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:31:12,200 INFO L85 PathProgramCache]: Analyzing trace with hash 380169759, now seen corresponding path program 1 times [2022-02-20 17:31:12,200 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 17:31:12,200 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1004111661] [2022-02-20 17:31:12,200 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:31:12,200 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 17:31:12,211 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-20 17:31:12,211 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1199004100] [2022-02-20 17:31:12,211 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:31:12,211 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 17:31:12,212 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 17:31:12,213 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:31:12,228 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:31:12,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:31:12,248 INFO L263 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 9 conjunts are in the unsatisfiable core [2022-02-20 17:31:12,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:31:12,264 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 17:31:12,390 INFO L290 TraceCheckUtils]: 0: Hoare triple {695#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(8, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {695#true} is VALID [2022-02-20 17:31:12,391 INFO L290 TraceCheckUtils]: 1: Hoare triple {695#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~post5#1, main_#t~post6#1, main_~A~0#1, main_~B~0#1, main_~r~0#1, main_~d~0#1, main_~p~0#1, main_~q~0#1;havoc main_~A~0#1;havoc main_~B~0#1;havoc main_~r~0#1;havoc main_~d~0#1;havoc main_~p~0#1;havoc main_~q~0#1;assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;main_~A~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;main_~B~0#1 := 1;main_~r~0#1 := main_~A~0#1;main_~d~0#1 := main_~B~0#1;main_~p~0#1 := 1;main_~q~0#1 := 0; {703#(and (= |ULTIMATE.start_main_~p~0#1| 1) (= |ULTIMATE.start_main_~B~0#1| |ULTIMATE.start_main_~d~0#1|) (= |ULTIMATE.start_main_~B~0#1| 1))} is VALID [2022-02-20 17:31:12,392 INFO L290 TraceCheckUtils]: 2: Hoare triple {703#(and (= |ULTIMATE.start_main_~p~0#1| 1) (= |ULTIMATE.start_main_~B~0#1| |ULTIMATE.start_main_~d~0#1|) (= |ULTIMATE.start_main_~B~0#1| 1))} main_#t~post5#1 := ~counter~0;~counter~0 := 1 + main_#t~post5#1; {703#(and (= |ULTIMATE.start_main_~p~0#1| 1) (= |ULTIMATE.start_main_~B~0#1| |ULTIMATE.start_main_~d~0#1|) (= |ULTIMATE.start_main_~B~0#1| 1))} is VALID [2022-02-20 17:31:12,392 INFO L290 TraceCheckUtils]: 3: Hoare triple {703#(and (= |ULTIMATE.start_main_~p~0#1| 1) (= |ULTIMATE.start_main_~B~0#1| |ULTIMATE.start_main_~d~0#1|) (= |ULTIMATE.start_main_~B~0#1| 1))} assume !!(main_#t~post5#1 < 1);havoc main_#t~post5#1; {703#(and (= |ULTIMATE.start_main_~p~0#1| 1) (= |ULTIMATE.start_main_~B~0#1| |ULTIMATE.start_main_~d~0#1|) (= |ULTIMATE.start_main_~B~0#1| 1))} is VALID [2022-02-20 17:31:12,392 INFO L272 TraceCheckUtils]: 4: Hoare triple {703#(and (= |ULTIMATE.start_main_~p~0#1| 1) (= |ULTIMATE.start_main_~B~0#1| |ULTIMATE.start_main_~d~0#1|) (= |ULTIMATE.start_main_~B~0#1| 1))} call __VERIFIER_assert((if 0 == main_~q~0#1 then 1 else 0)); {695#true} is VALID [2022-02-20 17:31:12,393 INFO L290 TraceCheckUtils]: 5: Hoare triple {695#true} ~cond := #in~cond; {695#true} is VALID [2022-02-20 17:31:12,393 INFO L290 TraceCheckUtils]: 6: Hoare triple {695#true} assume !(0 == ~cond); {695#true} is VALID [2022-02-20 17:31:12,393 INFO L290 TraceCheckUtils]: 7: Hoare triple {695#true} assume true; {695#true} is VALID [2022-02-20 17:31:12,393 INFO L284 TraceCheckUtils]: 8: Hoare quadruple {695#true} {703#(and (= |ULTIMATE.start_main_~p~0#1| 1) (= |ULTIMATE.start_main_~B~0#1| |ULTIMATE.start_main_~d~0#1|) (= |ULTIMATE.start_main_~B~0#1| 1))} #67#return; {703#(and (= |ULTIMATE.start_main_~p~0#1| 1) (= |ULTIMATE.start_main_~B~0#1| |ULTIMATE.start_main_~d~0#1|) (= |ULTIMATE.start_main_~B~0#1| 1))} is VALID [2022-02-20 17:31:12,393 INFO L272 TraceCheckUtils]: 9: Hoare triple {703#(and (= |ULTIMATE.start_main_~p~0#1| 1) (= |ULTIMATE.start_main_~B~0#1| |ULTIMATE.start_main_~d~0#1|) (= |ULTIMATE.start_main_~B~0#1| 1))} call __VERIFIER_assert((if main_~r~0#1 == main_~A~0#1 then 1 else 0)); {695#true} is VALID [2022-02-20 17:31:12,394 INFO L290 TraceCheckUtils]: 10: Hoare triple {695#true} ~cond := #in~cond; {695#true} is VALID [2022-02-20 17:31:12,394 INFO L290 TraceCheckUtils]: 11: Hoare triple {695#true} assume !(0 == ~cond); {695#true} is VALID [2022-02-20 17:31:12,394 INFO L290 TraceCheckUtils]: 12: Hoare triple {695#true} assume true; {695#true} is VALID [2022-02-20 17:31:12,394 INFO L284 TraceCheckUtils]: 13: Hoare quadruple {695#true} {703#(and (= |ULTIMATE.start_main_~p~0#1| 1) (= |ULTIMATE.start_main_~B~0#1| |ULTIMATE.start_main_~d~0#1|) (= |ULTIMATE.start_main_~B~0#1| 1))} #69#return; {703#(and (= |ULTIMATE.start_main_~p~0#1| 1) (= |ULTIMATE.start_main_~B~0#1| |ULTIMATE.start_main_~d~0#1|) (= |ULTIMATE.start_main_~B~0#1| 1))} is VALID [2022-02-20 17:31:12,395 INFO L272 TraceCheckUtils]: 14: Hoare triple {703#(and (= |ULTIMATE.start_main_~p~0#1| 1) (= |ULTIMATE.start_main_~B~0#1| |ULTIMATE.start_main_~d~0#1|) (= |ULTIMATE.start_main_~B~0#1| 1))} call __VERIFIER_assert((if main_~d~0#1 == main_~B~0#1 * main_~p~0#1 then 1 else 0)); {743#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-02-20 17:31:12,395 INFO L290 TraceCheckUtils]: 15: Hoare triple {743#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {747#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-02-20 17:31:12,396 INFO L290 TraceCheckUtils]: 16: Hoare triple {747#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {696#false} is VALID [2022-02-20 17:31:12,396 INFO L290 TraceCheckUtils]: 17: Hoare triple {696#false} assume !false; {696#false} is VALID [2022-02-20 17:31:12,396 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-02-20 17:31:12,396 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 17:31:12,396 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 17:31:12,397 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1004111661] [2022-02-20 17:31:12,397 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-20 17:31:12,397 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1199004100] [2022-02-20 17:31:12,397 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1199004100] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 17:31:12,397 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 17:31:12,397 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 17:31:12,397 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1285197811] [2022-02-20 17:31:12,397 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 17:31:12,402 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 1 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 18 [2022-02-20 17:31:12,402 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 17:31:12,403 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 1 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:31:12,414 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 15 edges. 15 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:31:12,414 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 17:31:12,414 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 17:31:12,415 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 17:31:12,415 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 17:31:12,415 INFO L87 Difference]: Start difference. First operand 32 states and 40 transitions. Second operand has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 1 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:31:12,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:31:12,568 INFO L93 Difference]: Finished difference Result 61 states and 83 transitions. [2022-02-20 17:31:12,568 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 17:31:12,568 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 1 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 18 [2022-02-20 17:31:12,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 17:31:12,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 1 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:31:12,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 77 transitions. [2022-02-20 17:31:12,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 1 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:31:12,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 77 transitions. [2022-02-20 17:31:12,571 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 77 transitions. [2022-02-20 17:31:12,629 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 77 edges. 77 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:31:12,630 INFO L225 Difference]: With dead ends: 61 [2022-02-20 17:31:12,630 INFO L226 Difference]: Without dead ends: 46 [2022-02-20 17:31:12,631 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 14 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:31:12,631 INFO L933 BasicCegarLoop]: 34 mSDtfsCounter, 10 mSDsluCounter, 81 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 115 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 17:31:12,632 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [14 Valid, 115 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 17:31:12,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2022-02-20 17:31:12,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2022-02-20 17:31:12,636 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 17:31:12,636 INFO L82 GeneralOperation]: Start isEquivalent. First operand 46 states. Second operand has 46 states, 28 states have (on average 1.2857142857142858) internal successors, (36), 30 states have internal predecessors, (36), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-02-20 17:31:12,636 INFO L74 IsIncluded]: Start isIncluded. First operand 46 states. Second operand has 46 states, 28 states have (on average 1.2857142857142858) internal successors, (36), 30 states have internal predecessors, (36), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-02-20 17:31:12,637 INFO L87 Difference]: Start difference. First operand 46 states. Second operand has 46 states, 28 states have (on average 1.2857142857142858) internal successors, (36), 30 states have internal predecessors, (36), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-02-20 17:31:12,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:31:12,638 INFO L93 Difference]: Finished difference Result 46 states and 60 transitions. [2022-02-20 17:31:12,638 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 60 transitions. [2022-02-20 17:31:12,638 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:31:12,638 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:31:12,638 INFO L74 IsIncluded]: Start isIncluded. First operand has 46 states, 28 states have (on average 1.2857142857142858) internal successors, (36), 30 states have internal predecessors, (36), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand 46 states. [2022-02-20 17:31:12,639 INFO L87 Difference]: Start difference. First operand has 46 states, 28 states have (on average 1.2857142857142858) internal successors, (36), 30 states have internal predecessors, (36), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand 46 states. [2022-02-20 17:31:12,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:31:12,640 INFO L93 Difference]: Finished difference Result 46 states and 60 transitions. [2022-02-20 17:31:12,640 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 60 transitions. [2022-02-20 17:31:12,640 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:31:12,640 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:31:12,640 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 17:31:12,640 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 17:31:12,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 28 states have (on average 1.2857142857142858) internal successors, (36), 30 states have internal predecessors, (36), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-02-20 17:31:12,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 60 transitions. [2022-02-20 17:31:12,642 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 60 transitions. Word has length 18 [2022-02-20 17:31:12,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 17:31:12,642 INFO L470 AbstractCegarLoop]: Abstraction has 46 states and 60 transitions. [2022-02-20 17:31:12,642 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 1 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:31:12,642 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 60 transitions. [2022-02-20 17:31:12,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-02-20 17:31:12,642 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:31:12,642 INFO L514 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 17:31:12,673 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:31:12,858 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 17:31:12,859 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 17:31:12,859 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:31:12,859 INFO L85 PathProgramCache]: Analyzing trace with hash -461064832, now seen corresponding path program 1 times [2022-02-20 17:31:12,859 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 17:31:12,859 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2086664648] [2022-02-20 17:31:12,859 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:31:12,859 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 17:31:12,872 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-20 17:31:12,872 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1736394486] [2022-02-20 17:31:12,872 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:31:12,872 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 17:31:12,872 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 17:31:12,873 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:31:12,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:31:12,916 INFO L263 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 5 conjunts are in the unsatisfiable core [2022-02-20 17:31:12,917 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:31:12,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:31:12,925 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 17:31:13,074 INFO L290 TraceCheckUtils]: 0: Hoare triple {998#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(8, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {1003#(<= 0 ~counter~0)} is VALID [2022-02-20 17:31:13,075 INFO L290 TraceCheckUtils]: 1: Hoare triple {1003#(<= 0 ~counter~0)} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~post5#1, main_#t~post6#1, main_~A~0#1, main_~B~0#1, main_~r~0#1, main_~d~0#1, main_~p~0#1, main_~q~0#1;havoc main_~A~0#1;havoc main_~B~0#1;havoc main_~r~0#1;havoc main_~d~0#1;havoc main_~p~0#1;havoc main_~q~0#1;assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;main_~A~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;main_~B~0#1 := 1;main_~r~0#1 := main_~A~0#1;main_~d~0#1 := main_~B~0#1;main_~p~0#1 := 1;main_~q~0#1 := 0; {1003#(<= 0 ~counter~0)} is VALID [2022-02-20 17:31:13,075 INFO L290 TraceCheckUtils]: 2: Hoare triple {1003#(<= 0 ~counter~0)} main_#t~post5#1 := ~counter~0;~counter~0 := 1 + main_#t~post5#1; {1010#(<= 1 ~counter~0)} is VALID [2022-02-20 17:31:13,076 INFO L290 TraceCheckUtils]: 3: Hoare triple {1010#(<= 1 ~counter~0)} assume !!(main_#t~post5#1 < 1);havoc main_#t~post5#1; {1010#(<= 1 ~counter~0)} is VALID [2022-02-20 17:31:13,076 INFO L272 TraceCheckUtils]: 4: Hoare triple {1010#(<= 1 ~counter~0)} call __VERIFIER_assert((if 0 == main_~q~0#1 then 1 else 0)); {1010#(<= 1 ~counter~0)} is VALID [2022-02-20 17:31:13,076 INFO L290 TraceCheckUtils]: 5: Hoare triple {1010#(<= 1 ~counter~0)} ~cond := #in~cond; {1010#(<= 1 ~counter~0)} is VALID [2022-02-20 17:31:13,077 INFO L290 TraceCheckUtils]: 6: Hoare triple {1010#(<= 1 ~counter~0)} assume !(0 == ~cond); {1010#(<= 1 ~counter~0)} is VALID [2022-02-20 17:31:13,077 INFO L290 TraceCheckUtils]: 7: Hoare triple {1010#(<= 1 ~counter~0)} assume true; {1010#(<= 1 ~counter~0)} is VALID [2022-02-20 17:31:13,078 INFO L284 TraceCheckUtils]: 8: Hoare quadruple {1010#(<= 1 ~counter~0)} {1010#(<= 1 ~counter~0)} #67#return; {1010#(<= 1 ~counter~0)} is VALID [2022-02-20 17:31:13,078 INFO L272 TraceCheckUtils]: 9: Hoare triple {1010#(<= 1 ~counter~0)} call __VERIFIER_assert((if main_~r~0#1 == main_~A~0#1 then 1 else 0)); {1010#(<= 1 ~counter~0)} is VALID [2022-02-20 17:31:13,079 INFO L290 TraceCheckUtils]: 10: Hoare triple {1010#(<= 1 ~counter~0)} ~cond := #in~cond; {1010#(<= 1 ~counter~0)} is VALID [2022-02-20 17:31:13,079 INFO L290 TraceCheckUtils]: 11: Hoare triple {1010#(<= 1 ~counter~0)} assume !(0 == ~cond); {1010#(<= 1 ~counter~0)} is VALID [2022-02-20 17:31:13,079 INFO L290 TraceCheckUtils]: 12: Hoare triple {1010#(<= 1 ~counter~0)} assume true; {1010#(<= 1 ~counter~0)} is VALID [2022-02-20 17:31:13,080 INFO L284 TraceCheckUtils]: 13: Hoare quadruple {1010#(<= 1 ~counter~0)} {1010#(<= 1 ~counter~0)} #69#return; {1010#(<= 1 ~counter~0)} is VALID [2022-02-20 17:31:13,083 INFO L272 TraceCheckUtils]: 14: Hoare triple {1010#(<= 1 ~counter~0)} call __VERIFIER_assert((if main_~d~0#1 == main_~B~0#1 * main_~p~0#1 then 1 else 0)); {1010#(<= 1 ~counter~0)} is VALID [2022-02-20 17:31:13,083 INFO L290 TraceCheckUtils]: 15: Hoare triple {1010#(<= 1 ~counter~0)} ~cond := #in~cond; {1010#(<= 1 ~counter~0)} is VALID [2022-02-20 17:31:13,084 INFO L290 TraceCheckUtils]: 16: Hoare triple {1010#(<= 1 ~counter~0)} assume !(0 == ~cond); {1010#(<= 1 ~counter~0)} is VALID [2022-02-20 17:31:13,084 INFO L290 TraceCheckUtils]: 17: Hoare triple {1010#(<= 1 ~counter~0)} assume true; {1010#(<= 1 ~counter~0)} is VALID [2022-02-20 17:31:13,085 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {1010#(<= 1 ~counter~0)} {1010#(<= 1 ~counter~0)} #71#return; {1010#(<= 1 ~counter~0)} is VALID [2022-02-20 17:31:13,085 INFO L290 TraceCheckUtils]: 19: Hoare triple {1010#(<= 1 ~counter~0)} assume !(main_~r~0#1 >= main_~d~0#1); {1010#(<= 1 ~counter~0)} is VALID [2022-02-20 17:31:13,085 INFO L290 TraceCheckUtils]: 20: Hoare triple {1010#(<= 1 ~counter~0)} main_#t~post6#1 := ~counter~0;~counter~0 := 1 + main_#t~post6#1; {1065#(<= 1 |ULTIMATE.start_main_#t~post6#1|)} is VALID [2022-02-20 17:31:13,086 INFO L290 TraceCheckUtils]: 21: Hoare triple {1065#(<= 1 |ULTIMATE.start_main_#t~post6#1|)} assume !!(main_#t~post6#1 < 1);havoc main_#t~post6#1; {999#false} is VALID [2022-02-20 17:31:13,086 INFO L272 TraceCheckUtils]: 22: Hoare triple {999#false} call __VERIFIER_assert((if main_~A~0#1 == main_~q~0#1 * main_~B~0#1 + main_~r~0#1 then 1 else 0)); {999#false} is VALID [2022-02-20 17:31:13,086 INFO L290 TraceCheckUtils]: 23: Hoare triple {999#false} ~cond := #in~cond; {999#false} is VALID [2022-02-20 17:31:13,086 INFO L290 TraceCheckUtils]: 24: Hoare triple {999#false} assume 0 == ~cond; {999#false} is VALID [2022-02-20 17:31:13,086 INFO L290 TraceCheckUtils]: 25: Hoare triple {999#false} assume !false; {999#false} is VALID [2022-02-20 17:31:13,086 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-02-20 17:31:13,086 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 17:31:13,086 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 17:31:13,086 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2086664648] [2022-02-20 17:31:13,086 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-20 17:31:13,086 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1736394486] [2022-02-20 17:31:13,087 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1736394486] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 17:31:13,087 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 17:31:13,087 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-20 17:31:13,087 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1735606503] [2022-02-20 17:31:13,087 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 17:31:13,087 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 26 [2022-02-20 17:31:13,088 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 17:31:13,088 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-02-20 17:31:13,102 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:31:13,102 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 17:31:13,102 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 17:31:13,102 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 17:31:13,102 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-02-20 17:31:13,102 INFO L87 Difference]: Start difference. First operand 46 states and 60 transitions. Second operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-02-20 17:31:13,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:31:13,172 INFO L93 Difference]: Finished difference Result 61 states and 75 transitions. [2022-02-20 17:31:13,172 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 17:31:13,172 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 26 [2022-02-20 17:31:13,172 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 17:31:13,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-02-20 17:31:13,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-02-20 17:31:13,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-02-20 17:31:13,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-02-20 17:31:13,174 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 44 transitions. [2022-02-20 17:31:13,203 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 44 edges. 44 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:31:13,204 INFO L225 Difference]: With dead ends: 61 [2022-02-20 17:31:13,204 INFO L226 Difference]: Without dead ends: 39 [2022-02-20 17:31:13,204 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2022-02-20 17:31:13,205 INFO L933 BasicCegarLoop]: 20 mSDtfsCounter, 16 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 40 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 17:31:13,205 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [16 Valid, 40 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 17:31:13,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2022-02-20 17:31:13,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2022-02-20 17:31:13,217 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 17:31:13,217 INFO L82 GeneralOperation]: Start isEquivalent. First operand 39 states. Second operand has 39 states, 25 states have (on average 1.16) internal successors, (29), 27 states have internal predecessors, (29), 9 states have call successors, (9), 4 states have call predecessors, (9), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-02-20 17:31:13,217 INFO L74 IsIncluded]: Start isIncluded. First operand 39 states. Second operand has 39 states, 25 states have (on average 1.16) internal successors, (29), 27 states have internal predecessors, (29), 9 states have call successors, (9), 4 states have call predecessors, (9), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-02-20 17:31:13,217 INFO L87 Difference]: Start difference. First operand 39 states. Second operand has 39 states, 25 states have (on average 1.16) internal successors, (29), 27 states have internal predecessors, (29), 9 states have call successors, (9), 4 states have call predecessors, (9), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-02-20 17:31:13,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:31:13,218 INFO L93 Difference]: Finished difference Result 39 states and 45 transitions. [2022-02-20 17:31:13,218 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 45 transitions. [2022-02-20 17:31:13,219 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:31:13,219 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:31:13,219 INFO L74 IsIncluded]: Start isIncluded. First operand has 39 states, 25 states have (on average 1.16) internal successors, (29), 27 states have internal predecessors, (29), 9 states have call successors, (9), 4 states have call predecessors, (9), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand 39 states. [2022-02-20 17:31:13,219 INFO L87 Difference]: Start difference. First operand has 39 states, 25 states have (on average 1.16) internal successors, (29), 27 states have internal predecessors, (29), 9 states have call successors, (9), 4 states have call predecessors, (9), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand 39 states. [2022-02-20 17:31:13,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:31:13,220 INFO L93 Difference]: Finished difference Result 39 states and 45 transitions. [2022-02-20 17:31:13,220 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 45 transitions. [2022-02-20 17:31:13,221 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:31:13,221 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:31:13,221 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 17:31:13,221 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 17:31:13,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 25 states have (on average 1.16) internal successors, (29), 27 states have internal predecessors, (29), 9 states have call successors, (9), 4 states have call predecessors, (9), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-02-20 17:31:13,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 45 transitions. [2022-02-20 17:31:13,222 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 45 transitions. Word has length 26 [2022-02-20 17:31:13,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 17:31:13,222 INFO L470 AbstractCegarLoop]: Abstraction has 39 states and 45 transitions. [2022-02-20 17:31:13,222 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-02-20 17:31:13,223 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 45 transitions. [2022-02-20 17:31:13,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-02-20 17:31:13,223 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:31:13,223 INFO L514 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 17:31:13,241 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:31:13,439 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,SelfDestructingSolverStorable5 [2022-02-20 17:31:13,439 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 17:31:13,439 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:31:13,440 INFO L85 PathProgramCache]: Analyzing trace with hash -462792710, now seen corresponding path program 1 times [2022-02-20 17:31:13,440 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 17:31:13,440 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2111532756] [2022-02-20 17:31:13,440 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:31:13,440 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 17:31:13,462 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-20 17:31:13,467 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1394261990] [2022-02-20 17:31:13,467 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:31:13,467 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 17:31:13,467 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 17:31:13,468 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-20 17:31:13,469 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-02-20 17:31:13,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:31:13,496 INFO L263 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 7 conjunts are in the unsatisfiable core [2022-02-20 17:31:13,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:31:13,501 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 17:31:13,596 INFO L290 TraceCheckUtils]: 0: Hoare triple {1299#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(8, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {1299#true} is VALID [2022-02-20 17:31:13,597 INFO L290 TraceCheckUtils]: 1: Hoare triple {1299#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~post5#1, main_#t~post6#1, main_~A~0#1, main_~B~0#1, main_~r~0#1, main_~d~0#1, main_~p~0#1, main_~q~0#1;havoc main_~A~0#1;havoc main_~B~0#1;havoc main_~r~0#1;havoc main_~d~0#1;havoc main_~p~0#1;havoc main_~q~0#1;assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;main_~A~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;main_~B~0#1 := 1;main_~r~0#1 := main_~A~0#1;main_~d~0#1 := main_~B~0#1;main_~p~0#1 := 1;main_~q~0#1 := 0; {1307#(and (= |ULTIMATE.start_main_~q~0#1| 0) (= |ULTIMATE.start_main_~A~0#1| |ULTIMATE.start_main_~r~0#1|))} is VALID [2022-02-20 17:31:13,597 INFO L290 TraceCheckUtils]: 2: Hoare triple {1307#(and (= |ULTIMATE.start_main_~q~0#1| 0) (= |ULTIMATE.start_main_~A~0#1| |ULTIMATE.start_main_~r~0#1|))} main_#t~post5#1 := ~counter~0;~counter~0 := 1 + main_#t~post5#1; {1307#(and (= |ULTIMATE.start_main_~q~0#1| 0) (= |ULTIMATE.start_main_~A~0#1| |ULTIMATE.start_main_~r~0#1|))} is VALID [2022-02-20 17:31:13,597 INFO L290 TraceCheckUtils]: 3: Hoare triple {1307#(and (= |ULTIMATE.start_main_~q~0#1| 0) (= |ULTIMATE.start_main_~A~0#1| |ULTIMATE.start_main_~r~0#1|))} assume !!(main_#t~post5#1 < 1);havoc main_#t~post5#1; {1307#(and (= |ULTIMATE.start_main_~q~0#1| 0) (= |ULTIMATE.start_main_~A~0#1| |ULTIMATE.start_main_~r~0#1|))} is VALID [2022-02-20 17:31:13,597 INFO L272 TraceCheckUtils]: 4: Hoare triple {1307#(and (= |ULTIMATE.start_main_~q~0#1| 0) (= |ULTIMATE.start_main_~A~0#1| |ULTIMATE.start_main_~r~0#1|))} call __VERIFIER_assert((if 0 == main_~q~0#1 then 1 else 0)); {1299#true} is VALID [2022-02-20 17:31:13,598 INFO L290 TraceCheckUtils]: 5: Hoare triple {1299#true} ~cond := #in~cond; {1299#true} is VALID [2022-02-20 17:31:13,598 INFO L290 TraceCheckUtils]: 6: Hoare triple {1299#true} assume !(0 == ~cond); {1299#true} is VALID [2022-02-20 17:31:13,598 INFO L290 TraceCheckUtils]: 7: Hoare triple {1299#true} assume true; {1299#true} is VALID [2022-02-20 17:31:13,598 INFO L284 TraceCheckUtils]: 8: Hoare quadruple {1299#true} {1307#(and (= |ULTIMATE.start_main_~q~0#1| 0) (= |ULTIMATE.start_main_~A~0#1| |ULTIMATE.start_main_~r~0#1|))} #67#return; {1307#(and (= |ULTIMATE.start_main_~q~0#1| 0) (= |ULTIMATE.start_main_~A~0#1| |ULTIMATE.start_main_~r~0#1|))} is VALID [2022-02-20 17:31:13,599 INFO L272 TraceCheckUtils]: 9: Hoare triple {1307#(and (= |ULTIMATE.start_main_~q~0#1| 0) (= |ULTIMATE.start_main_~A~0#1| |ULTIMATE.start_main_~r~0#1|))} call __VERIFIER_assert((if main_~r~0#1 == main_~A~0#1 then 1 else 0)); {1299#true} is VALID [2022-02-20 17:31:13,599 INFO L290 TraceCheckUtils]: 10: Hoare triple {1299#true} ~cond := #in~cond; {1299#true} is VALID [2022-02-20 17:31:13,599 INFO L290 TraceCheckUtils]: 11: Hoare triple {1299#true} assume !(0 == ~cond); {1299#true} is VALID [2022-02-20 17:31:13,599 INFO L290 TraceCheckUtils]: 12: Hoare triple {1299#true} assume true; {1299#true} is VALID [2022-02-20 17:31:13,599 INFO L284 TraceCheckUtils]: 13: Hoare quadruple {1299#true} {1307#(and (= |ULTIMATE.start_main_~q~0#1| 0) (= |ULTIMATE.start_main_~A~0#1| |ULTIMATE.start_main_~r~0#1|))} #69#return; {1307#(and (= |ULTIMATE.start_main_~q~0#1| 0) (= |ULTIMATE.start_main_~A~0#1| |ULTIMATE.start_main_~r~0#1|))} is VALID [2022-02-20 17:31:13,600 INFO L272 TraceCheckUtils]: 14: Hoare triple {1307#(and (= |ULTIMATE.start_main_~q~0#1| 0) (= |ULTIMATE.start_main_~A~0#1| |ULTIMATE.start_main_~r~0#1|))} call __VERIFIER_assert((if main_~d~0#1 == main_~B~0#1 * main_~p~0#1 then 1 else 0)); {1299#true} is VALID [2022-02-20 17:31:13,600 INFO L290 TraceCheckUtils]: 15: Hoare triple {1299#true} ~cond := #in~cond; {1299#true} is VALID [2022-02-20 17:31:13,600 INFO L290 TraceCheckUtils]: 16: Hoare triple {1299#true} assume !(0 == ~cond); {1299#true} is VALID [2022-02-20 17:31:13,600 INFO L290 TraceCheckUtils]: 17: Hoare triple {1299#true} assume true; {1299#true} is VALID [2022-02-20 17:31:13,601 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {1299#true} {1307#(and (= |ULTIMATE.start_main_~q~0#1| 0) (= |ULTIMATE.start_main_~A~0#1| |ULTIMATE.start_main_~r~0#1|))} #71#return; {1307#(and (= |ULTIMATE.start_main_~q~0#1| 0) (= |ULTIMATE.start_main_~A~0#1| |ULTIMATE.start_main_~r~0#1|))} is VALID [2022-02-20 17:31:13,601 INFO L290 TraceCheckUtils]: 19: Hoare triple {1307#(and (= |ULTIMATE.start_main_~q~0#1| 0) (= |ULTIMATE.start_main_~A~0#1| |ULTIMATE.start_main_~r~0#1|))} assume !(main_~r~0#1 >= main_~d~0#1); {1307#(and (= |ULTIMATE.start_main_~q~0#1| 0) (= |ULTIMATE.start_main_~A~0#1| |ULTIMATE.start_main_~r~0#1|))} is VALID [2022-02-20 17:31:13,601 INFO L290 TraceCheckUtils]: 20: Hoare triple {1307#(and (= |ULTIMATE.start_main_~q~0#1| 0) (= |ULTIMATE.start_main_~A~0#1| |ULTIMATE.start_main_~r~0#1|))} main_#t~post6#1 := ~counter~0;~counter~0 := 1 + main_#t~post6#1; {1307#(and (= |ULTIMATE.start_main_~q~0#1| 0) (= |ULTIMATE.start_main_~A~0#1| |ULTIMATE.start_main_~r~0#1|))} is VALID [2022-02-20 17:31:13,602 INFO L290 TraceCheckUtils]: 21: Hoare triple {1307#(and (= |ULTIMATE.start_main_~q~0#1| 0) (= |ULTIMATE.start_main_~A~0#1| |ULTIMATE.start_main_~r~0#1|))} assume !(main_#t~post6#1 < 1);havoc main_#t~post6#1; {1307#(and (= |ULTIMATE.start_main_~q~0#1| 0) (= |ULTIMATE.start_main_~A~0#1| |ULTIMATE.start_main_~r~0#1|))} is VALID [2022-02-20 17:31:13,602 INFO L272 TraceCheckUtils]: 22: Hoare triple {1307#(and (= |ULTIMATE.start_main_~q~0#1| 0) (= |ULTIMATE.start_main_~A~0#1| |ULTIMATE.start_main_~r~0#1|))} call __VERIFIER_assert((if main_~A~0#1 == main_~d~0#1 * main_~q~0#1 + main_~r~0#1 then 1 else 0)); {1371#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-02-20 17:31:13,603 INFO L290 TraceCheckUtils]: 23: Hoare triple {1371#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1375#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-02-20 17:31:13,603 INFO L290 TraceCheckUtils]: 24: Hoare triple {1375#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1300#false} is VALID [2022-02-20 17:31:13,603 INFO L290 TraceCheckUtils]: 25: Hoare triple {1300#false} assume !false; {1300#false} is VALID [2022-02-20 17:31:13,603 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-02-20 17:31:13,603 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 17:31:13,604 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 17:31:13,604 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2111532756] [2022-02-20 17:31:13,604 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-20 17:31:13,604 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1394261990] [2022-02-20 17:31:13,604 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1394261990] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 17:31:13,604 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 17:31:13,604 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 17:31:13,604 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1195566682] [2022-02-20 17:31:13,605 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 17:31:13,605 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 26 [2022-02-20 17:31:13,605 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 17:31:13,605 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-02-20 17:31:13,617 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:31:13,617 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 17:31:13,617 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 17:31:13,617 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 17:31:13,618 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 17:31:13,618 INFO L87 Difference]: Start difference. First operand 39 states and 45 transitions. Second operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-02-20 17:31:13,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:31:13,696 INFO L93 Difference]: Finished difference Result 45 states and 50 transitions. [2022-02-20 17:31:13,697 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 17:31:13,697 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 26 [2022-02-20 17:31:13,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 17:31:13,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-02-20 17:31:13,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 28 transitions. [2022-02-20 17:31:13,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-02-20 17:31:13,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 28 transitions. [2022-02-20 17:31:13,698 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 28 transitions. [2022-02-20 17:31:13,726 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 28 edges. 28 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:31:13,726 INFO L225 Difference]: With dead ends: 45 [2022-02-20 17:31:13,727 INFO L226 Difference]: Without dead ends: 40 [2022-02-20 17:31:13,727 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 22 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:31:13,727 INFO L933 BasicCegarLoop]: 16 mSDtfsCounter, 7 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 52 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 17:31:13,728 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [8 Valid, 52 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 17:31:13,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2022-02-20 17:31:13,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2022-02-20 17:31:13,739 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 17:31:13,739 INFO L82 GeneralOperation]: Start isEquivalent. First operand 40 states. Second operand has 40 states, 26 states have (on average 1.1153846153846154) internal successors, (29), 27 states have internal predecessors, (29), 8 states have call successors, (8), 5 states have call predecessors, (8), 5 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-02-20 17:31:13,739 INFO L74 IsIncluded]: Start isIncluded. First operand 40 states. Second operand has 40 states, 26 states have (on average 1.1153846153846154) internal successors, (29), 27 states have internal predecessors, (29), 8 states have call successors, (8), 5 states have call predecessors, (8), 5 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-02-20 17:31:13,739 INFO L87 Difference]: Start difference. First operand 40 states. Second operand has 40 states, 26 states have (on average 1.1153846153846154) internal successors, (29), 27 states have internal predecessors, (29), 8 states have call successors, (8), 5 states have call predecessors, (8), 5 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-02-20 17:31:13,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:31:13,740 INFO L93 Difference]: Finished difference Result 40 states and 44 transitions. [2022-02-20 17:31:13,740 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 44 transitions. [2022-02-20 17:31:13,741 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:31:13,741 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:31:13,741 INFO L74 IsIncluded]: Start isIncluded. First operand has 40 states, 26 states have (on average 1.1153846153846154) internal successors, (29), 27 states have internal predecessors, (29), 8 states have call successors, (8), 5 states have call predecessors, (8), 5 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand 40 states. [2022-02-20 17:31:13,741 INFO L87 Difference]: Start difference. First operand has 40 states, 26 states have (on average 1.1153846153846154) internal successors, (29), 27 states have internal predecessors, (29), 8 states have call successors, (8), 5 states have call predecessors, (8), 5 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand 40 states. [2022-02-20 17:31:13,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:31:13,742 INFO L93 Difference]: Finished difference Result 40 states and 44 transitions. [2022-02-20 17:31:13,742 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 44 transitions. [2022-02-20 17:31:13,742 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:31:13,742 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:31:13,742 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 17:31:13,743 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 17:31:13,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 26 states have (on average 1.1153846153846154) internal successors, (29), 27 states have internal predecessors, (29), 8 states have call successors, (8), 5 states have call predecessors, (8), 5 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-02-20 17:31:13,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 44 transitions. [2022-02-20 17:31:13,744 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 44 transitions. Word has length 26 [2022-02-20 17:31:13,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 17:31:13,744 INFO L470 AbstractCegarLoop]: Abstraction has 40 states and 44 transitions. [2022-02-20 17:31:13,744 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-02-20 17:31:13,744 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 44 transitions. [2022-02-20 17:31:13,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-02-20 17:31:13,745 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:31:13,745 INFO L514 BasicCegarLoop]: trace histogram [5, 4, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 17:31:13,788 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-02-20 17:31:13,961 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 17:31:13,961 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 17:31:13,961 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:31:13,961 INFO L85 PathProgramCache]: Analyzing trace with hash 847666457, now seen corresponding path program 1 times [2022-02-20 17:31:13,962 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 17:31:13,962 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1933812525] [2022-02-20 17:31:13,962 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:31:13,962 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 17:31:13,974 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-20 17:31:13,974 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1609375107] [2022-02-20 17:31:13,974 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:31:13,975 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 17:31:13,975 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 17:31:13,976 INFO L229 MonitoredProcess]: Starting monitored process 5 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:31:13,977 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-02-20 17:31:14,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-20 17:31:14,005 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-20 17:31:14,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-20 17:31:14,024 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-20 17:31:14,024 INFO L628 BasicCegarLoop]: Counterexample is feasible [2022-02-20 17:31:14,025 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-02-20 17:31:14,054 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-02-20 17:31:14,236 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 17:31:14,239 INFO L732 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 17:31:14,241 INFO L180 ceAbstractionStarter]: Computing trace abstraction results [2022-02-20 17:31:14,252 FATAL L489 DefaultTranslator]: Callstack has procedure call flag but succeeding procedure is empty at [CALL] call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); [2022-02-20 17:31:14,253 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:31:14,262 INFO L158 Benchmark]: Toolchain (without parser) took 3716.27ms. Allocated memory was 107.0MB in the beginning and 130.0MB in the end (delta: 23.1MB). Free memory was 76.2MB in the beginning and 61.4MB in the end (delta: 14.8MB). Peak memory consumption was 37.4MB. Max. memory is 16.1GB. [2022-02-20 17:31:14,263 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 107.0MB. Free memory was 64.1MB in the beginning and 64.1MB in the end (delta: 77.0kB). There was no memory consumed. Max. memory is 16.1GB. [2022-02-20 17:31:14,263 INFO L158 Benchmark]: CACSL2BoogieTranslator took 186.83ms. Allocated memory is still 107.0MB. Free memory was 75.9MB in the beginning and 82.4MB in the end (delta: -6.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-02-20 17:31:14,263 INFO L158 Benchmark]: Boogie Procedure Inliner took 32.58ms. Allocated memory is still 107.0MB. Free memory was 82.4MB in the beginning and 80.9MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. [2022-02-20 17:31:14,263 INFO L158 Benchmark]: Boogie Preprocessor took 13.64ms. Allocated memory is still 107.0MB. Free memory was 80.9MB in the beginning and 79.6MB in the end (delta: 1.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-20 17:31:14,263 INFO L158 Benchmark]: RCFGBuilder took 249.31ms. Allocated memory is still 107.0MB. Free memory was 79.6MB in the beginning and 68.7MB in the end (delta: 10.9MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-02-20 17:31:14,264 INFO L158 Benchmark]: TraceAbstraction took 3229.91ms. Allocated memory was 107.0MB in the beginning and 130.0MB in the end (delta: 23.1MB). Free memory was 68.3MB in the beginning and 61.4MB in the end (delta: 6.9MB). Peak memory consumption was 32.1MB. Max. memory is 16.1GB. [2022-02-20 17:31:14,264 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 107.0MB. Free memory was 64.1MB in the beginning and 64.1MB in the end (delta: 77.0kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 186.83ms. Allocated memory is still 107.0MB. Free memory was 75.9MB in the beginning and 82.4MB in the end (delta: -6.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 32.58ms. Allocated memory is still 107.0MB. Free memory was 82.4MB in the beginning and 80.9MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 13.64ms. Allocated memory is still 107.0MB. Free memory was 80.9MB in the beginning and 79.6MB in the end (delta: 1.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 249.31ms. Allocated memory is still 107.0MB. Free memory was 79.6MB in the beginning and 68.7MB in the end (delta: 10.9MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * TraceAbstraction took 3229.91ms. Allocated memory was 107.0MB in the beginning and 130.0MB in the end (delta: 23.1MB). Free memory was 68.3MB in the beginning and 61.4MB in the end (delta: 6.9MB). Peak memory consumption was 32.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - ExceptionOrErrorResult: AssertionError: callstack broken after backtranslation by InlinerBacktranslator de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: callstack broken after backtranslation by InlinerBacktranslator: de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator.translateProgramExecution(InlinerBacktranslator.java:230) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2022-02-20 17:31:14,292 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/hard2_unwindbound1.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 c7383f54d0aefdd248f516d45c67549426beac87be78bf6e7bb8108aedb7974b --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 17:31:16,175 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 17:31:16,177 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 17:31:16,206 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 17:31:16,207 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 17:31:16,209 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 17:31:16,210 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 17:31:16,213 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 17:31:16,215 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 17:31:16,218 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 17:31:16,219 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 17:31:16,226 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 17:31:16,226 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 17:31:16,228 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 17:31:16,229 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 17:31:16,231 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 17:31:16,232 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 17:31:16,232 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 17:31:16,234 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 17:31:16,238 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 17:31:16,239 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 17:31:16,240 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 17:31:16,241 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 17:31:16,242 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 17:31:16,246 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 17:31:16,246 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 17:31:16,247 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 17:31:16,248 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 17:31:16,248 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 17:31:16,249 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 17:31:16,249 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 17:31:16,249 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 17:31:16,250 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 17:31:16,251 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 17:31:16,252 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 17:31:16,252 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 17:31:16,253 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 17:31:16,253 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 17:31:16,253 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 17:31:16,254 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 17:31:16,255 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 17:31:16,255 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:31:16,283 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 17:31:16,284 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 17:31:16,284 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 17:31:16,284 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 17:31:16,285 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 17:31:16,285 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 17:31:16,286 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 17:31:16,286 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 17:31:16,287 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 17:31:16,287 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 17:31:16,287 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 17:31:16,288 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 17:31:16,288 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 17:31:16,288 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 17:31:16,288 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 17:31:16,288 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 17:31:16,288 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-02-20 17:31:16,288 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-02-20 17:31:16,289 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-02-20 17:31:16,289 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 17:31:16,289 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 17:31:16,289 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 17:31:16,289 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 17:31:16,289 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 17:31:16,289 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 17:31:16,290 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 17:31:16,290 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 17:31:16,290 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 17:31:16,290 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 17:31:16,290 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 17:31:16,290 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2022-02-20 17:31:16,290 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-02-20 17:31:16,291 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 17:31:16,291 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 17:31:16,291 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 17:31:16,291 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-02-20 17:31:16,291 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 -> c7383f54d0aefdd248f516d45c67549426beac87be78bf6e7bb8108aedb7974b [2022-02-20 17:31:16,569 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 17:31:16,582 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 17:31:16,583 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 17:31:16,584 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 17:31:16,585 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 17:31:16,585 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/nla-digbench-scaling/hard2_unwindbound1.c [2022-02-20 17:31:16,632 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/17e003d69/b198b4debb9c4ff886d77ef9b5207779/FLAG5f56debd1 [2022-02-20 17:31:16,968 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 17:31:16,969 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/hard2_unwindbound1.c [2022-02-20 17:31:16,973 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/17e003d69/b198b4debb9c4ff886d77ef9b5207779/FLAG5f56debd1 [2022-02-20 17:31:16,985 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/17e003d69/b198b4debb9c4ff886d77ef9b5207779 [2022-02-20 17:31:16,987 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 17:31:16,988 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 17:31:16,990 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 17:31:16,990 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 17:31:16,993 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 17:31:16,997 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 05:31:16" (1/1) ... [2022-02-20 17:31:16,998 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2dcb07af and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:31:16, skipping insertion in model container [2022-02-20 17:31:16,998 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 05:31:16" (1/1) ... [2022-02-20 17:31:17,003 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 17:31:17,014 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 17:31:17,116 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/hard2_unwindbound1.c[526,539] [2022-02-20 17:31:17,140 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 17:31:17,157 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 17:31:17,173 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/hard2_unwindbound1.c[526,539] [2022-02-20 17:31:17,206 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 17:31:17,218 INFO L208 MainTranslator]: Completed translation [2022-02-20 17:31:17,219 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:31:17 WrapperNode [2022-02-20 17:31:17,220 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 17:31:17,221 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 17:31:17,221 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 17:31:17,221 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 17:31:17,226 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:31:17" (1/1) ... [2022-02-20 17:31:17,233 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:31:17" (1/1) ... [2022-02-20 17:31:17,254 INFO L137 Inliner]: procedures = 14, calls = 14, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 60 [2022-02-20 17:31:17,255 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 17:31:17,255 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 17:31:17,255 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 17:31:17,256 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 17:31:17,261 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:31:17" (1/1) ... [2022-02-20 17:31:17,262 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:31:17" (1/1) ... [2022-02-20 17:31:17,271 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:31:17" (1/1) ... [2022-02-20 17:31:17,271 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:31:17" (1/1) ... [2022-02-20 17:31:17,282 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:31:17" (1/1) ... [2022-02-20 17:31:17,285 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:31:17" (1/1) ... [2022-02-20 17:31:17,289 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:31:17" (1/1) ... [2022-02-20 17:31:17,291 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 17:31:17,293 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 17:31:17,293 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 17:31:17,293 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 17:31:17,295 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:31:17" (1/1) ... [2022-02-20 17:31:17,300 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 17:31:17,307 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 17:31:17,316 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:31:17,343 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:31:17,370 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 17:31:17,371 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-02-20 17:31:17,371 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 17:31:17,371 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 17:31:17,371 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-02-20 17:31:17,371 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-02-20 17:31:17,417 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 17:31:17,418 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 17:31:17,530 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 17:31:17,535 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 17:31:17,535 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-02-20 17:31:17,536 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 05:31:17 BoogieIcfgContainer [2022-02-20 17:31:17,539 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 17:31:17,540 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 17:31:17,540 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 17:31:17,542 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 17:31:17,542 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 05:31:16" (1/3) ... [2022-02-20 17:31:17,543 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6d87976b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 05:31:17, skipping insertion in model container [2022-02-20 17:31:17,543 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:31:17" (2/3) ... [2022-02-20 17:31:17,543 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6d87976b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 05:31:17, skipping insertion in model container [2022-02-20 17:31:17,543 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 05:31:17" (3/3) ... [2022-02-20 17:31:17,544 INFO L111 eAbstractionObserver]: Analyzing ICFG hard2_unwindbound1.c [2022-02-20 17:31:17,547 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 17:31:17,548 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-02-20 17:31:17,575 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 17:31:17,579 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:31:17,582 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-02-20 17:31:17,605 INFO L276 IsEmpty]: Start isEmpty. Operand has 26 states, 16 states have (on average 1.5625) internal successors, (25), 17 states have internal predecessors, (25), 7 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-02-20 17:31:17,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-02-20 17:31:17,607 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:31:17,623 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 17:31:17,624 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 17:31:17,627 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:31:17,627 INFO L85 PathProgramCache]: Analyzing trace with hash 643118537, now seen corresponding path program 1 times [2022-02-20 17:31:17,634 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 17:31:17,634 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [737828089] [2022-02-20 17:31:17,635 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:31:17,635 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 17:31:17,635 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 17:31:17,637 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:31:17,648 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:31:17,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:31:17,711 INFO L263 TraceCheckSpWp]: Trace formula consists of 28 conjuncts, 1 conjunts are in the unsatisfiable core [2022-02-20 17:31:17,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:31:17,732 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 17:31:17,789 INFO L290 TraceCheckUtils]: 0: Hoare triple {29#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(8bv32, 2bv32);call #Ultimate.allocInit(12bv32, 3bv32);~counter~0 := 0bv32; {29#true} is VALID [2022-02-20 17:31:17,789 INFO L290 TraceCheckUtils]: 1: Hoare triple {29#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~post5#1, main_#t~post6#1, main_~A~0#1, main_~B~0#1, main_~r~0#1, main_~d~0#1, main_~p~0#1, main_~q~0#1;havoc main_~A~0#1;havoc main_~B~0#1;havoc main_~r~0#1;havoc main_~d~0#1;havoc main_~p~0#1;havoc main_~q~0#1;main_~A~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;main_~B~0#1 := 1bv32;main_~r~0#1 := main_~A~0#1;main_~d~0#1 := main_~B~0#1;main_~p~0#1 := 1bv32;main_~q~0#1 := 0bv32; {29#true} is VALID [2022-02-20 17:31:17,800 INFO L290 TraceCheckUtils]: 2: Hoare triple {29#true} assume !true; {30#false} is VALID [2022-02-20 17:31:17,800 INFO L290 TraceCheckUtils]: 3: Hoare triple {30#false} assume !true; {30#false} is VALID [2022-02-20 17:31:17,800 INFO L272 TraceCheckUtils]: 4: Hoare triple {30#false} call __VERIFIER_assert((if main_~A~0#1 == ~bvadd32(~bvmul32(main_~d~0#1, main_~q~0#1), main_~r~0#1) then 1bv32 else 0bv32)); {30#false} is VALID [2022-02-20 17:31:17,800 INFO L290 TraceCheckUtils]: 5: Hoare triple {30#false} ~cond := #in~cond; {30#false} is VALID [2022-02-20 17:31:17,801 INFO L290 TraceCheckUtils]: 6: Hoare triple {30#false} assume 0bv32 == ~cond; {30#false} is VALID [2022-02-20 17:31:17,801 INFO L290 TraceCheckUtils]: 7: Hoare triple {30#false} assume !false; {30#false} is VALID [2022-02-20 17:31:17,801 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 17:31:17,801 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 17:31:17,802 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 17:31:17,802 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [737828089] [2022-02-20 17:31:17,802 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [737828089] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 17:31:17,802 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 17:31:17,802 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-20 17:31:17,803 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [7760588] [2022-02-20 17:31:17,804 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 17:31:17,807 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2022-02-20 17:31:17,813 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 17:31:17,815 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:31:17,835 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 8 edges. 8 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:31:17,835 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-02-20 17:31:17,836 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 17:31:17,852 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-02-20 17:31:17,856 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-02-20 17:31:17,858 INFO L87 Difference]: Start difference. First operand has 26 states, 16 states have (on average 1.5625) internal successors, (25), 17 states have internal predecessors, (25), 7 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:31:18,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:31:18,016 INFO L93 Difference]: Finished difference Result 50 states and 83 transitions. [2022-02-20 17:31:18,016 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-20 17:31:18,017 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2022-02-20 17:31:18,017 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 17:31:18,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:31:18,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 83 transitions. [2022-02-20 17:31:18,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:31:18,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 83 transitions. [2022-02-20 17:31:18,040 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 83 transitions. [2022-02-20 17:31:18,236 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 83 edges. 83 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:31:18,243 INFO L225 Difference]: With dead ends: 50 [2022-02-20 17:31:18,243 INFO L226 Difference]: Without dead ends: 22 [2022-02-20 17:31:18,246 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 7 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:31:18,250 INFO L933 BasicCegarLoop]: 36 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, 36 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:31:18,252 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 17:31:18,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2022-02-20 17:31:18,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2022-02-20 17:31:18,275 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 17:31:18,276 INFO L82 GeneralOperation]: Start isEquivalent. First operand 22 states. Second operand has 22 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 14 states have internal predecessors, (19), 7 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-02-20 17:31:18,277 INFO L74 IsIncluded]: Start isIncluded. First operand 22 states. Second operand has 22 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 14 states have internal predecessors, (19), 7 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-02-20 17:31:18,278 INFO L87 Difference]: Start difference. First operand 22 states. Second operand has 22 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 14 states have internal predecessors, (19), 7 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-02-20 17:31:18,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:31:18,286 INFO L93 Difference]: Finished difference Result 22 states and 32 transitions. [2022-02-20 17:31:18,287 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 32 transitions. [2022-02-20 17:31:18,287 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:31:18,288 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:31:18,288 INFO L74 IsIncluded]: Start isIncluded. First operand has 22 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 14 states have internal predecessors, (19), 7 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand 22 states. [2022-02-20 17:31:18,289 INFO L87 Difference]: Start difference. First operand has 22 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 14 states have internal predecessors, (19), 7 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand 22 states. [2022-02-20 17:31:18,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:31:18,293 INFO L93 Difference]: Finished difference Result 22 states and 32 transitions. [2022-02-20 17:31:18,294 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 32 transitions. [2022-02-20 17:31:18,294 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:31:18,294 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:31:18,294 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 17:31:18,295 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 17:31:18,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 14 states have internal predecessors, (19), 7 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-02-20 17:31:18,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 32 transitions. [2022-02-20 17:31:18,304 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 32 transitions. Word has length 8 [2022-02-20 17:31:18,304 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 17:31:18,304 INFO L470 AbstractCegarLoop]: Abstraction has 22 states and 32 transitions. [2022-02-20 17:31:18,309 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:31:18,309 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 32 transitions. [2022-02-20 17:31:18,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-02-20 17:31:18,312 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:31:18,313 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 17:31:18,319 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Ended with exit code 0 [2022-02-20 17:31:18,519 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:31:18,519 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 17:31:18,520 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:31:18,520 INFO L85 PathProgramCache]: Analyzing trace with hash 181060127, now seen corresponding path program 1 times [2022-02-20 17:31:18,520 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 17:31:18,520 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1674159203] [2022-02-20 17:31:18,520 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:31:18,520 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 17:31:18,520 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 17:31:18,523 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:31:18,524 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:31:18,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:31:18,556 INFO L263 TraceCheckSpWp]: Trace formula consists of 29 conjuncts, 4 conjunts are in the unsatisfiable core [2022-02-20 17:31:18,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:31:18,562 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 17:31:18,636 INFO L290 TraceCheckUtils]: 0: Hoare triple {199#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(8bv32, 2bv32);call #Ultimate.allocInit(12bv32, 3bv32);~counter~0 := 0bv32; {199#true} is VALID [2022-02-20 17:31:18,637 INFO L290 TraceCheckUtils]: 1: Hoare triple {199#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~post5#1, main_#t~post6#1, main_~A~0#1, main_~B~0#1, main_~r~0#1, main_~d~0#1, main_~p~0#1, main_~q~0#1;havoc main_~A~0#1;havoc main_~B~0#1;havoc main_~r~0#1;havoc main_~d~0#1;havoc main_~p~0#1;havoc main_~q~0#1;main_~A~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;main_~B~0#1 := 1bv32;main_~r~0#1 := main_~A~0#1;main_~d~0#1 := main_~B~0#1;main_~p~0#1 := 1bv32;main_~q~0#1 := 0bv32; {207#(= |ULTIMATE.start_main_~q~0#1| (_ bv0 32))} is VALID [2022-02-20 17:31:18,637 INFO L290 TraceCheckUtils]: 2: Hoare triple {207#(= |ULTIMATE.start_main_~q~0#1| (_ bv0 32))} main_#t~post5#1 := ~counter~0;~counter~0 := ~bvadd32(1bv32, main_#t~post5#1); {207#(= |ULTIMATE.start_main_~q~0#1| (_ bv0 32))} is VALID [2022-02-20 17:31:18,638 INFO L290 TraceCheckUtils]: 3: Hoare triple {207#(= |ULTIMATE.start_main_~q~0#1| (_ bv0 32))} assume !!~bvslt32(main_#t~post5#1, 1bv32);havoc main_#t~post5#1; {207#(= |ULTIMATE.start_main_~q~0#1| (_ bv0 32))} is VALID [2022-02-20 17:31:18,640 INFO L272 TraceCheckUtils]: 4: Hoare triple {207#(= |ULTIMATE.start_main_~q~0#1| (_ bv0 32))} call __VERIFIER_assert((if 0bv32 == main_~q~0#1 then 1bv32 else 0bv32)); {217#(= (_ bv1 32) |__VERIFIER_assert_#in~cond|)} is VALID [2022-02-20 17:31:18,640 INFO L290 TraceCheckUtils]: 5: Hoare triple {217#(= (_ bv1 32) |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {221#(= __VERIFIER_assert_~cond (_ bv1 32))} is VALID [2022-02-20 17:31:18,640 INFO L290 TraceCheckUtils]: 6: Hoare triple {221#(= __VERIFIER_assert_~cond (_ bv1 32))} assume 0bv32 == ~cond; {200#false} is VALID [2022-02-20 17:31:18,641 INFO L290 TraceCheckUtils]: 7: Hoare triple {200#false} assume !false; {200#false} is VALID [2022-02-20 17:31:18,641 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 17:31:18,641 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 17:31:18,641 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 17:31:18,641 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1674159203] [2022-02-20 17:31:18,641 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1674159203] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 17:31:18,642 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 17:31:18,642 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 17:31:18,642 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2010447112] [2022-02-20 17:31:18,644 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 17:31:18,645 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.4) internal successors, (7), 4 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2022-02-20 17:31:18,645 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 17:31:18,646 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 1.4) internal successors, (7), 4 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:31:18,654 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 8 edges. 8 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:31:18,654 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 17:31:18,655 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 17:31:18,655 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 17:31:18,655 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 17:31:18,656 INFO L87 Difference]: Start difference. First operand 22 states and 32 transitions. Second operand has 5 states, 5 states have (on average 1.4) internal successors, (7), 4 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:31:19,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:31:19,174 INFO L93 Difference]: Finished difference Result 36 states and 51 transitions. [2022-02-20 17:31:19,174 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 17:31:19,174 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.4) internal successors, (7), 4 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2022-02-20 17:31:19,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 17:31:19,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 1.4) internal successors, (7), 4 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:31:19,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 51 transitions. [2022-02-20 17:31:19,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 1.4) internal successors, (7), 4 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:31:19,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 51 transitions. [2022-02-20 17:31:19,182 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 51 transitions. [2022-02-20 17:31:19,318 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 51 edges. 51 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:31:19,319 INFO L225 Difference]: With dead ends: 36 [2022-02-20 17:31:19,319 INFO L226 Difference]: Without dead ends: 34 [2022-02-20 17:31:19,319 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 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:31:19,320 INFO L933 BasicCegarLoop]: 31 mSDtfsCounter, 14 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 106 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 17:31:19,320 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [20 Valid, 106 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 17:31:19,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2022-02-20 17:31:19,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 26. [2022-02-20 17:31:19,324 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 17:31:19,324 INFO L82 GeneralOperation]: Start isEquivalent. First operand 34 states. Second operand has 26 states, 16 states have (on average 1.375) internal successors, (22), 17 states have internal predecessors, (22), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-02-20 17:31:19,325 INFO L74 IsIncluded]: Start isIncluded. First operand 34 states. Second operand has 26 states, 16 states have (on average 1.375) internal successors, (22), 17 states have internal predecessors, (22), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-02-20 17:31:19,325 INFO L87 Difference]: Start difference. First operand 34 states. Second operand has 26 states, 16 states have (on average 1.375) internal successors, (22), 17 states have internal predecessors, (22), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-02-20 17:31:19,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:31:19,327 INFO L93 Difference]: Finished difference Result 34 states and 49 transitions. [2022-02-20 17:31:19,327 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 49 transitions. [2022-02-20 17:31:19,328 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:31:19,328 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:31:19,328 INFO L74 IsIncluded]: Start isIncluded. First operand has 26 states, 16 states have (on average 1.375) internal successors, (22), 17 states have internal predecessors, (22), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand 34 states. [2022-02-20 17:31:19,329 INFO L87 Difference]: Start difference. First operand has 26 states, 16 states have (on average 1.375) internal successors, (22), 17 states have internal predecessors, (22), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand 34 states. [2022-02-20 17:31:19,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:31:19,331 INFO L93 Difference]: Finished difference Result 34 states and 49 transitions. [2022-02-20 17:31:19,331 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 49 transitions. [2022-02-20 17:31:19,332 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:31:19,332 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:31:19,332 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 17:31:19,332 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 17:31:19,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 16 states have (on average 1.375) internal successors, (22), 17 states have internal predecessors, (22), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-02-20 17:31:19,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 35 transitions. [2022-02-20 17:31:19,334 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 35 transitions. Word has length 8 [2022-02-20 17:31:19,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 17:31:19,334 INFO L470 AbstractCegarLoop]: Abstraction has 26 states and 35 transitions. [2022-02-20 17:31:19,334 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.4) internal successors, (7), 4 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:31:19,334 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 35 transitions. [2022-02-20 17:31:19,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-02-20 17:31:19,335 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:31:19,335 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 17:31:19,351 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Ended with exit code 0 [2022-02-20 17:31:19,541 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:31:19,541 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 17:31:19,542 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:31:19,542 INFO L85 PathProgramCache]: Analyzing trace with hash -712280900, now seen corresponding path program 1 times [2022-02-20 17:31:19,542 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 17:31:19,542 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1060947804] [2022-02-20 17:31:19,543 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:31:19,543 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 17:31:19,543 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 17:31:19,544 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:31:19,546 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:31:19,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:31:19,593 INFO L263 TraceCheckSpWp]: Trace formula consists of 32 conjuncts, 3 conjunts are in the unsatisfiable core [2022-02-20 17:31:19,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:31:19,602 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 17:31:19,645 INFO L290 TraceCheckUtils]: 0: Hoare triple {383#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(8bv32, 2bv32);call #Ultimate.allocInit(12bv32, 3bv32);~counter~0 := 0bv32; {388#(= ~counter~0 (_ bv0 32))} is VALID [2022-02-20 17:31:19,645 INFO L290 TraceCheckUtils]: 1: Hoare triple {388#(= ~counter~0 (_ bv0 32))} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~post5#1, main_#t~post6#1, main_~A~0#1, main_~B~0#1, main_~r~0#1, main_~d~0#1, main_~p~0#1, main_~q~0#1;havoc main_~A~0#1;havoc main_~B~0#1;havoc main_~r~0#1;havoc main_~d~0#1;havoc main_~p~0#1;havoc main_~q~0#1;main_~A~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;main_~B~0#1 := 1bv32;main_~r~0#1 := main_~A~0#1;main_~d~0#1 := main_~B~0#1;main_~p~0#1 := 1bv32;main_~q~0#1 := 0bv32; {388#(= ~counter~0 (_ bv0 32))} is VALID [2022-02-20 17:31:19,646 INFO L290 TraceCheckUtils]: 2: Hoare triple {388#(= ~counter~0 (_ bv0 32))} main_#t~post5#1 := ~counter~0;~counter~0 := ~bvadd32(1bv32, main_#t~post5#1); {395#(= |ULTIMATE.start_main_#t~post5#1| (_ bv0 32))} is VALID [2022-02-20 17:31:19,646 INFO L290 TraceCheckUtils]: 3: Hoare triple {395#(= |ULTIMATE.start_main_#t~post5#1| (_ bv0 32))} assume !~bvslt32(main_#t~post5#1, 1bv32);havoc main_#t~post5#1; {384#false} is VALID [2022-02-20 17:31:19,646 INFO L290 TraceCheckUtils]: 4: Hoare triple {384#false} main_#t~post6#1 := ~counter~0;~counter~0 := ~bvadd32(1bv32, main_#t~post6#1); {384#false} is VALID [2022-02-20 17:31:19,647 INFO L290 TraceCheckUtils]: 5: Hoare triple {384#false} assume !!~bvslt32(main_#t~post6#1, 1bv32);havoc main_#t~post6#1; {384#false} is VALID [2022-02-20 17:31:19,647 INFO L272 TraceCheckUtils]: 6: Hoare triple {384#false} call __VERIFIER_assert((if main_~A~0#1 == ~bvadd32(~bvmul32(main_~q~0#1, main_~B~0#1), main_~r~0#1) then 1bv32 else 0bv32)); {384#false} is VALID [2022-02-20 17:31:19,647 INFO L290 TraceCheckUtils]: 7: Hoare triple {384#false} ~cond := #in~cond; {384#false} is VALID [2022-02-20 17:31:19,647 INFO L290 TraceCheckUtils]: 8: Hoare triple {384#false} assume 0bv32 == ~cond; {384#false} is VALID [2022-02-20 17:31:19,647 INFO L290 TraceCheckUtils]: 9: Hoare triple {384#false} assume !false; {384#false} is VALID [2022-02-20 17:31:19,647 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 17:31:19,647 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 17:31:19,647 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 17:31:19,648 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1060947804] [2022-02-20 17:31:19,648 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1060947804] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 17:31:19,648 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 17:31:19,648 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 17:31:19,648 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [582078439] [2022-02-20 17:31:19,648 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 17:31:19,648 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 3 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2022-02-20 17:31:19,648 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 17:31:19,649 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 2.25) internal successors, (9), 3 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:31:19,663 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 10 edges. 10 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:31:19,664 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-20 17:31:19,664 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 17:31:19,664 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-20 17:31:19,664 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-20 17:31:19,664 INFO L87 Difference]: Start difference. First operand 26 states and 35 transitions. Second operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 3 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:31:20,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:31:20,008 INFO L93 Difference]: Finished difference Result 42 states and 57 transitions. [2022-02-20 17:31:20,008 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-20 17:31:20,008 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 3 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2022-02-20 17:31:20,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 17:31:20,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 3 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:31:20,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 54 transitions. [2022-02-20 17:31:20,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 3 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:31:20,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 54 transitions. [2022-02-20 17:31:20,011 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 54 transitions. [2022-02-20 17:31:20,152 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 54 edges. 54 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:31:20,153 INFO L225 Difference]: With dead ends: 42 [2022-02-20 17:31:20,153 INFO L226 Difference]: Without dead ends: 28 [2022-02-20 17:31:20,153 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-20 17:31:20,154 INFO L933 BasicCegarLoop]: 30 mSDtfsCounter, 0 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 85 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 17:31:20,154 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 85 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 17:31:20,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2022-02-20 17:31:20,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2022-02-20 17:31:20,157 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 17:31:20,158 INFO L82 GeneralOperation]: Start isEquivalent. First operand 28 states. Second operand has 28 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 19 states have internal predecessors, (24), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-02-20 17:31:20,158 INFO L74 IsIncluded]: Start isIncluded. First operand 28 states. Second operand has 28 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 19 states have internal predecessors, (24), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-02-20 17:31:20,158 INFO L87 Difference]: Start difference. First operand 28 states. Second operand has 28 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 19 states have internal predecessors, (24), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-02-20 17:31:20,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:31:20,160 INFO L93 Difference]: Finished difference Result 28 states and 37 transitions. [2022-02-20 17:31:20,160 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 37 transitions. [2022-02-20 17:31:20,160 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:31:20,160 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:31:20,160 INFO L74 IsIncluded]: Start isIncluded. First operand has 28 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 19 states have internal predecessors, (24), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand 28 states. [2022-02-20 17:31:20,161 INFO L87 Difference]: Start difference. First operand has 28 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 19 states have internal predecessors, (24), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand 28 states. [2022-02-20 17:31:20,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:31:20,162 INFO L93 Difference]: Finished difference Result 28 states and 37 transitions. [2022-02-20 17:31:20,162 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 37 transitions. [2022-02-20 17:31:20,162 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:31:20,163 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:31:20,163 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 17:31:20,163 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 17:31:20,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 19 states have internal predecessors, (24), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-02-20 17:31:20,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 37 transitions. [2022-02-20 17:31:20,164 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 37 transitions. Word has length 10 [2022-02-20 17:31:20,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 17:31:20,164 INFO L470 AbstractCegarLoop]: Abstraction has 28 states and 37 transitions. [2022-02-20 17:31:20,165 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 3 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:31:20,165 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 37 transitions. [2022-02-20 17:31:20,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-02-20 17:31:20,165 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:31:20,165 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 17:31:20,185 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:31:20,379 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:31:20,379 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 17:31:20,380 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:31:20,380 INFO L85 PathProgramCache]: Analyzing trace with hash 2036073049, now seen corresponding path program 1 times [2022-02-20 17:31:20,380 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 17:31:20,380 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1046265392] [2022-02-20 17:31:20,380 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:31:20,380 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 17:31:20,381 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 17:31:20,383 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-02-20 17:31:20,384 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2022-02-20 17:31:20,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:31:20,404 INFO L263 TraceCheckSpWp]: Trace formula consists of 36 conjuncts, 4 conjunts are in the unsatisfiable core [2022-02-20 17:31:20,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:31:20,408 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 17:31:20,457 INFO L290 TraceCheckUtils]: 0: Hoare triple {569#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(8bv32, 2bv32);call #Ultimate.allocInit(12bv32, 3bv32);~counter~0 := 0bv32; {569#true} is VALID [2022-02-20 17:31:20,457 INFO L290 TraceCheckUtils]: 1: Hoare triple {569#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~post5#1, main_#t~post6#1, main_~A~0#1, main_~B~0#1, main_~r~0#1, main_~d~0#1, main_~p~0#1, main_~q~0#1;havoc main_~A~0#1;havoc main_~B~0#1;havoc main_~r~0#1;havoc main_~d~0#1;havoc main_~p~0#1;havoc main_~q~0#1;main_~A~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;main_~B~0#1 := 1bv32;main_~r~0#1 := main_~A~0#1;main_~d~0#1 := main_~B~0#1;main_~p~0#1 := 1bv32;main_~q~0#1 := 0bv32; {577#(= |ULTIMATE.start_main_~r~0#1| |ULTIMATE.start_main_~A~0#1|)} is VALID [2022-02-20 17:31:20,458 INFO L290 TraceCheckUtils]: 2: Hoare triple {577#(= |ULTIMATE.start_main_~r~0#1| |ULTIMATE.start_main_~A~0#1|)} main_#t~post5#1 := ~counter~0;~counter~0 := ~bvadd32(1bv32, main_#t~post5#1); {577#(= |ULTIMATE.start_main_~r~0#1| |ULTIMATE.start_main_~A~0#1|)} is VALID [2022-02-20 17:31:20,458 INFO L290 TraceCheckUtils]: 3: Hoare triple {577#(= |ULTIMATE.start_main_~r~0#1| |ULTIMATE.start_main_~A~0#1|)} assume !!~bvslt32(main_#t~post5#1, 1bv32);havoc main_#t~post5#1; {577#(= |ULTIMATE.start_main_~r~0#1| |ULTIMATE.start_main_~A~0#1|)} is VALID [2022-02-20 17:31:20,458 INFO L272 TraceCheckUtils]: 4: Hoare triple {577#(= |ULTIMATE.start_main_~r~0#1| |ULTIMATE.start_main_~A~0#1|)} call __VERIFIER_assert((if 0bv32 == main_~q~0#1 then 1bv32 else 0bv32)); {569#true} is VALID [2022-02-20 17:31:20,458 INFO L290 TraceCheckUtils]: 5: Hoare triple {569#true} ~cond := #in~cond; {569#true} is VALID [2022-02-20 17:31:20,458 INFO L290 TraceCheckUtils]: 6: Hoare triple {569#true} assume !(0bv32 == ~cond); {569#true} is VALID [2022-02-20 17:31:20,458 INFO L290 TraceCheckUtils]: 7: Hoare triple {569#true} assume true; {569#true} is VALID [2022-02-20 17:31:20,459 INFO L284 TraceCheckUtils]: 8: Hoare quadruple {569#true} {577#(= |ULTIMATE.start_main_~r~0#1| |ULTIMATE.start_main_~A~0#1|)} #67#return; {577#(= |ULTIMATE.start_main_~r~0#1| |ULTIMATE.start_main_~A~0#1|)} is VALID [2022-02-20 17:31:20,459 INFO L272 TraceCheckUtils]: 9: Hoare triple {577#(= |ULTIMATE.start_main_~r~0#1| |ULTIMATE.start_main_~A~0#1|)} call __VERIFIER_assert((if main_~r~0#1 == main_~A~0#1 then 1bv32 else 0bv32)); {602#(= (_ bv1 32) |__VERIFIER_assert_#in~cond|)} is VALID [2022-02-20 17:31:20,460 INFO L290 TraceCheckUtils]: 10: Hoare triple {602#(= (_ bv1 32) |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {606#(= __VERIFIER_assert_~cond (_ bv1 32))} is VALID [2022-02-20 17:31:20,460 INFO L290 TraceCheckUtils]: 11: Hoare triple {606#(= __VERIFIER_assert_~cond (_ bv1 32))} assume 0bv32 == ~cond; {570#false} is VALID [2022-02-20 17:31:20,460 INFO L290 TraceCheckUtils]: 12: Hoare triple {570#false} assume !false; {570#false} is VALID [2022-02-20 17:31:20,460 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 17:31:20,460 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 17:31:20,460 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 17:31:20,460 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1046265392] [2022-02-20 17:31:20,461 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1046265392] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 17:31:20,461 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 17:31:20,461 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 17:31:20,461 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1422795499] [2022-02-20 17:31:20,461 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 17:31:20,461 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 13 [2022-02-20 17:31:20,461 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 17:31:20,461 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 17:31:20,468 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 13 edges. 13 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:31:20,468 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 17:31:20,468 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 17:31:20,469 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 17:31:20,469 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 17:31:20,469 INFO L87 Difference]: Start difference. First operand 28 states and 37 transitions. Second operand has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 17:31:20,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:31:20,941 INFO L93 Difference]: Finished difference Result 42 states and 56 transitions. [2022-02-20 17:31:20,941 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 17:31:20,941 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 13 [2022-02-20 17:31:20,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 17:31:20,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 17:31:20,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 51 transitions. [2022-02-20 17:31:20,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 17:31:20,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 51 transitions. [2022-02-20 17:31:20,957 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 51 transitions. [2022-02-20 17:31:21,077 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 51 edges. 51 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:31:21,078 INFO L225 Difference]: With dead ends: 42 [2022-02-20 17:31:21,078 INFO L226 Difference]: Without dead ends: 40 [2022-02-20 17:31:21,078 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 9 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:31:21,079 INFO L933 BasicCegarLoop]: 31 mSDtfsCounter, 14 mSDsluCounter, 71 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 102 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 17:31:21,079 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [19 Valid, 102 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 17:31:21,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2022-02-20 17:31:21,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 32. [2022-02-20 17:31:21,084 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 17:31:21,084 INFO L82 GeneralOperation]: Start isEquivalent. First operand 40 states. Second operand has 32 states, 21 states have (on average 1.2857142857142858) internal successors, (27), 22 states have internal predecessors, (27), 7 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-02-20 17:31:21,084 INFO L74 IsIncluded]: Start isIncluded. First operand 40 states. Second operand has 32 states, 21 states have (on average 1.2857142857142858) internal successors, (27), 22 states have internal predecessors, (27), 7 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-02-20 17:31:21,084 INFO L87 Difference]: Start difference. First operand 40 states. Second operand has 32 states, 21 states have (on average 1.2857142857142858) internal successors, (27), 22 states have internal predecessors, (27), 7 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-02-20 17:31:21,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:31:21,087 INFO L93 Difference]: Finished difference Result 40 states and 54 transitions. [2022-02-20 17:31:21,088 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 54 transitions. [2022-02-20 17:31:21,088 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:31:21,088 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:31:21,088 INFO L74 IsIncluded]: Start isIncluded. First operand has 32 states, 21 states have (on average 1.2857142857142858) internal successors, (27), 22 states have internal predecessors, (27), 7 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand 40 states. [2022-02-20 17:31:21,089 INFO L87 Difference]: Start difference. First operand has 32 states, 21 states have (on average 1.2857142857142858) internal successors, (27), 22 states have internal predecessors, (27), 7 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand 40 states. [2022-02-20 17:31:21,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:31:21,096 INFO L93 Difference]: Finished difference Result 40 states and 54 transitions. [2022-02-20 17:31:21,096 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 54 transitions. [2022-02-20 17:31:21,096 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:31:21,096 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:31:21,096 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 17:31:21,097 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 17:31:21,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 21 states have (on average 1.2857142857142858) internal successors, (27), 22 states have internal predecessors, (27), 7 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-02-20 17:31:21,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 40 transitions. [2022-02-20 17:31:21,098 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 40 transitions. Word has length 13 [2022-02-20 17:31:21,098 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 17:31:21,098 INFO L470 AbstractCegarLoop]: Abstraction has 32 states and 40 transitions. [2022-02-20 17:31:21,098 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 17:31:21,099 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 40 transitions. [2022-02-20 17:31:21,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-02-20 17:31:21,099 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:31:21,099 INFO L514 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 17:31:21,113 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Ended with exit code 0 [2022-02-20 17:31:21,313 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-02-20 17:31:21,313 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 17:31:21,314 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:31:21,314 INFO L85 PathProgramCache]: Analyzing trace with hash 380169759, now seen corresponding path program 1 times [2022-02-20 17:31:21,314 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 17:31:21,314 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2039257729] [2022-02-20 17:31:21,314 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:31:21,314 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 17:31:21,314 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 17:31:21,315 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-02-20 17:31:21,316 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2022-02-20 17:31:21,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:31:21,344 INFO L263 TraceCheckSpWp]: Trace formula consists of 43 conjuncts, 6 conjunts are in the unsatisfiable core [2022-02-20 17:31:21,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:31:21,358 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 17:31:21,503 INFO L290 TraceCheckUtils]: 0: Hoare triple {796#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(8bv32, 2bv32);call #Ultimate.allocInit(12bv32, 3bv32);~counter~0 := 0bv32; {796#true} is VALID [2022-02-20 17:31:21,503 INFO L290 TraceCheckUtils]: 1: Hoare triple {796#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~post5#1, main_#t~post6#1, main_~A~0#1, main_~B~0#1, main_~r~0#1, main_~d~0#1, main_~p~0#1, main_~q~0#1;havoc main_~A~0#1;havoc main_~B~0#1;havoc main_~r~0#1;havoc main_~d~0#1;havoc main_~p~0#1;havoc main_~q~0#1;main_~A~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;main_~B~0#1 := 1bv32;main_~r~0#1 := main_~A~0#1;main_~d~0#1 := main_~B~0#1;main_~p~0#1 := 1bv32;main_~q~0#1 := 0bv32; {804#(and (= |ULTIMATE.start_main_~d~0#1| |ULTIMATE.start_main_~B~0#1|) (= |ULTIMATE.start_main_~B~0#1| (_ bv1 32)) (= |ULTIMATE.start_main_~p~0#1| (_ bv1 32)))} is VALID [2022-02-20 17:31:21,504 INFO L290 TraceCheckUtils]: 2: Hoare triple {804#(and (= |ULTIMATE.start_main_~d~0#1| |ULTIMATE.start_main_~B~0#1|) (= |ULTIMATE.start_main_~B~0#1| (_ bv1 32)) (= |ULTIMATE.start_main_~p~0#1| (_ bv1 32)))} main_#t~post5#1 := ~counter~0;~counter~0 := ~bvadd32(1bv32, main_#t~post5#1); {804#(and (= |ULTIMATE.start_main_~d~0#1| |ULTIMATE.start_main_~B~0#1|) (= |ULTIMATE.start_main_~B~0#1| (_ bv1 32)) (= |ULTIMATE.start_main_~p~0#1| (_ bv1 32)))} is VALID [2022-02-20 17:31:21,504 INFO L290 TraceCheckUtils]: 3: Hoare triple {804#(and (= |ULTIMATE.start_main_~d~0#1| |ULTIMATE.start_main_~B~0#1|) (= |ULTIMATE.start_main_~B~0#1| (_ bv1 32)) (= |ULTIMATE.start_main_~p~0#1| (_ bv1 32)))} assume !!~bvslt32(main_#t~post5#1, 1bv32);havoc main_#t~post5#1; {804#(and (= |ULTIMATE.start_main_~d~0#1| |ULTIMATE.start_main_~B~0#1|) (= |ULTIMATE.start_main_~B~0#1| (_ bv1 32)) (= |ULTIMATE.start_main_~p~0#1| (_ bv1 32)))} is VALID [2022-02-20 17:31:21,504 INFO L272 TraceCheckUtils]: 4: Hoare triple {804#(and (= |ULTIMATE.start_main_~d~0#1| |ULTIMATE.start_main_~B~0#1|) (= |ULTIMATE.start_main_~B~0#1| (_ bv1 32)) (= |ULTIMATE.start_main_~p~0#1| (_ bv1 32)))} call __VERIFIER_assert((if 0bv32 == main_~q~0#1 then 1bv32 else 0bv32)); {796#true} is VALID [2022-02-20 17:31:21,505 INFO L290 TraceCheckUtils]: 5: Hoare triple {796#true} ~cond := #in~cond; {796#true} is VALID [2022-02-20 17:31:21,505 INFO L290 TraceCheckUtils]: 6: Hoare triple {796#true} assume !(0bv32 == ~cond); {796#true} is VALID [2022-02-20 17:31:21,505 INFO L290 TraceCheckUtils]: 7: Hoare triple {796#true} assume true; {796#true} is VALID [2022-02-20 17:31:21,506 INFO L284 TraceCheckUtils]: 8: Hoare quadruple {796#true} {804#(and (= |ULTIMATE.start_main_~d~0#1| |ULTIMATE.start_main_~B~0#1|) (= |ULTIMATE.start_main_~B~0#1| (_ bv1 32)) (= |ULTIMATE.start_main_~p~0#1| (_ bv1 32)))} #67#return; {804#(and (= |ULTIMATE.start_main_~d~0#1| |ULTIMATE.start_main_~B~0#1|) (= |ULTIMATE.start_main_~B~0#1| (_ bv1 32)) (= |ULTIMATE.start_main_~p~0#1| (_ bv1 32)))} is VALID [2022-02-20 17:31:21,506 INFO L272 TraceCheckUtils]: 9: Hoare triple {804#(and (= |ULTIMATE.start_main_~d~0#1| |ULTIMATE.start_main_~B~0#1|) (= |ULTIMATE.start_main_~B~0#1| (_ bv1 32)) (= |ULTIMATE.start_main_~p~0#1| (_ bv1 32)))} call __VERIFIER_assert((if main_~r~0#1 == main_~A~0#1 then 1bv32 else 0bv32)); {796#true} is VALID [2022-02-20 17:31:21,506 INFO L290 TraceCheckUtils]: 10: Hoare triple {796#true} ~cond := #in~cond; {796#true} is VALID [2022-02-20 17:31:21,506 INFO L290 TraceCheckUtils]: 11: Hoare triple {796#true} assume !(0bv32 == ~cond); {796#true} is VALID [2022-02-20 17:31:21,506 INFO L290 TraceCheckUtils]: 12: Hoare triple {796#true} assume true; {796#true} is VALID [2022-02-20 17:31:21,507 INFO L284 TraceCheckUtils]: 13: Hoare quadruple {796#true} {804#(and (= |ULTIMATE.start_main_~d~0#1| |ULTIMATE.start_main_~B~0#1|) (= |ULTIMATE.start_main_~B~0#1| (_ bv1 32)) (= |ULTIMATE.start_main_~p~0#1| (_ bv1 32)))} #69#return; {804#(and (= |ULTIMATE.start_main_~d~0#1| |ULTIMATE.start_main_~B~0#1|) (= |ULTIMATE.start_main_~B~0#1| (_ bv1 32)) (= |ULTIMATE.start_main_~p~0#1| (_ bv1 32)))} is VALID [2022-02-20 17:31:21,507 INFO L272 TraceCheckUtils]: 14: Hoare triple {804#(and (= |ULTIMATE.start_main_~d~0#1| |ULTIMATE.start_main_~B~0#1|) (= |ULTIMATE.start_main_~B~0#1| (_ bv1 32)) (= |ULTIMATE.start_main_~p~0#1| (_ bv1 32)))} call __VERIFIER_assert((if main_~d~0#1 == ~bvmul32(main_~B~0#1, main_~p~0#1) then 1bv32 else 0bv32)); {844#(= (_ bv1 32) |__VERIFIER_assert_#in~cond|)} is VALID [2022-02-20 17:31:21,508 INFO L290 TraceCheckUtils]: 15: Hoare triple {844#(= (_ bv1 32) |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {848#(= __VERIFIER_assert_~cond (_ bv1 32))} is VALID [2022-02-20 17:31:21,508 INFO L290 TraceCheckUtils]: 16: Hoare triple {848#(= __VERIFIER_assert_~cond (_ bv1 32))} assume 0bv32 == ~cond; {797#false} is VALID [2022-02-20 17:31:21,508 INFO L290 TraceCheckUtils]: 17: Hoare triple {797#false} assume !false; {797#false} is VALID [2022-02-20 17:31:21,508 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-02-20 17:31:21,509 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 17:31:21,509 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 17:31:21,509 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2039257729] [2022-02-20 17:31:21,509 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2039257729] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 17:31:21,509 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 17:31:21,509 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 17:31:21,509 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1547608239] [2022-02-20 17:31:21,509 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 17:31:21,510 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 1 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 18 [2022-02-20 17:31:21,510 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 17:31:21,510 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 1 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:31:21,526 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 15 edges. 15 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:31:21,526 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 17:31:21,526 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 17:31:21,527 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 17:31:21,527 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 17:31:21,527 INFO L87 Difference]: Start difference. First operand 32 states and 40 transitions. Second operand has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 1 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:31:22,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:31:22,007 INFO L93 Difference]: Finished difference Result 61 states and 83 transitions. [2022-02-20 17:31:22,007 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 17:31:22,007 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 1 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 18 [2022-02-20 17:31:22,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 17:31:22,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 1 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:31:22,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 77 transitions. [2022-02-20 17:31:22,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 1 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:31:22,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 77 transitions. [2022-02-20 17:31:22,010 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 77 transitions. [2022-02-20 17:31:22,198 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 77 edges. 77 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:31:22,199 INFO L225 Difference]: With dead ends: 61 [2022-02-20 17:31:22,199 INFO L226 Difference]: Without dead ends: 46 [2022-02-20 17:31:22,199 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 14 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:31:22,200 INFO L933 BasicCegarLoop]: 34 mSDtfsCounter, 10 mSDsluCounter, 81 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 115 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 17:31:22,200 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [14 Valid, 115 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 17:31:22,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2022-02-20 17:31:22,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2022-02-20 17:31:22,204 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 17:31:22,205 INFO L82 GeneralOperation]: Start isEquivalent. First operand 46 states. Second operand has 46 states, 28 states have (on average 1.2857142857142858) internal successors, (36), 30 states have internal predecessors, (36), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-02-20 17:31:22,205 INFO L74 IsIncluded]: Start isIncluded. First operand 46 states. Second operand has 46 states, 28 states have (on average 1.2857142857142858) internal successors, (36), 30 states have internal predecessors, (36), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-02-20 17:31:22,205 INFO L87 Difference]: Start difference. First operand 46 states. Second operand has 46 states, 28 states have (on average 1.2857142857142858) internal successors, (36), 30 states have internal predecessors, (36), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-02-20 17:31:22,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:31:22,207 INFO L93 Difference]: Finished difference Result 46 states and 60 transitions. [2022-02-20 17:31:22,207 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 60 transitions. [2022-02-20 17:31:22,207 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:31:22,207 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:31:22,208 INFO L74 IsIncluded]: Start isIncluded. First operand has 46 states, 28 states have (on average 1.2857142857142858) internal successors, (36), 30 states have internal predecessors, (36), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand 46 states. [2022-02-20 17:31:22,208 INFO L87 Difference]: Start difference. First operand has 46 states, 28 states have (on average 1.2857142857142858) internal successors, (36), 30 states have internal predecessors, (36), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand 46 states. [2022-02-20 17:31:22,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:31:22,210 INFO L93 Difference]: Finished difference Result 46 states and 60 transitions. [2022-02-20 17:31:22,210 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 60 transitions. [2022-02-20 17:31:22,210 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:31:22,210 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:31:22,210 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 17:31:22,210 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 17:31:22,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 28 states have (on average 1.2857142857142858) internal successors, (36), 30 states have internal predecessors, (36), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-02-20 17:31:22,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 60 transitions. [2022-02-20 17:31:22,212 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 60 transitions. Word has length 18 [2022-02-20 17:31:22,212 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 17:31:22,212 INFO L470 AbstractCegarLoop]: Abstraction has 46 states and 60 transitions. [2022-02-20 17:31:22,212 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 1 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:31:22,212 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 60 transitions. [2022-02-20 17:31:22,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-02-20 17:31:22,213 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:31:22,213 INFO L514 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 17:31:22,219 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2022-02-20 17:31:22,419 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-02-20 17:31:22,420 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 17:31:22,420 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:31:22,420 INFO L85 PathProgramCache]: Analyzing trace with hash -461064832, now seen corresponding path program 1 times [2022-02-20 17:31:22,421 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 17:31:22,421 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2072434625] [2022-02-20 17:31:22,421 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:31:22,421 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 17:31:22,421 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 17:31:22,422 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-02-20 17:31:22,423 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2022-02-20 17:31:22,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:31:22,454 INFO L263 TraceCheckSpWp]: Trace formula consists of 54 conjuncts, 5 conjunts are in the unsatisfiable core [2022-02-20 17:31:22,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:31:22,461 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 17:31:22,580 INFO L290 TraceCheckUtils]: 0: Hoare triple {1099#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(8bv32, 2bv32);call #Ultimate.allocInit(12bv32, 3bv32);~counter~0 := 0bv32; {1104#(= ~counter~0 (_ bv0 32))} is VALID [2022-02-20 17:31:22,580 INFO L290 TraceCheckUtils]: 1: Hoare triple {1104#(= ~counter~0 (_ bv0 32))} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~post5#1, main_#t~post6#1, main_~A~0#1, main_~B~0#1, main_~r~0#1, main_~d~0#1, main_~p~0#1, main_~q~0#1;havoc main_~A~0#1;havoc main_~B~0#1;havoc main_~r~0#1;havoc main_~d~0#1;havoc main_~p~0#1;havoc main_~q~0#1;main_~A~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;main_~B~0#1 := 1bv32;main_~r~0#1 := main_~A~0#1;main_~d~0#1 := main_~B~0#1;main_~p~0#1 := 1bv32;main_~q~0#1 := 0bv32; {1104#(= ~counter~0 (_ bv0 32))} is VALID [2022-02-20 17:31:22,580 INFO L290 TraceCheckUtils]: 2: Hoare triple {1104#(= ~counter~0 (_ bv0 32))} main_#t~post5#1 := ~counter~0;~counter~0 := ~bvadd32(1bv32, main_#t~post5#1); {1111#(= (bvadd (_ bv4294967295 32) ~counter~0) (_ bv0 32))} is VALID [2022-02-20 17:31:22,581 INFO L290 TraceCheckUtils]: 3: Hoare triple {1111#(= (bvadd (_ bv4294967295 32) ~counter~0) (_ bv0 32))} assume !!~bvslt32(main_#t~post5#1, 1bv32);havoc main_#t~post5#1; {1111#(= (bvadd (_ bv4294967295 32) ~counter~0) (_ bv0 32))} is VALID [2022-02-20 17:31:22,581 INFO L272 TraceCheckUtils]: 4: Hoare triple {1111#(= (bvadd (_ bv4294967295 32) ~counter~0) (_ bv0 32))} call __VERIFIER_assert((if 0bv32 == main_~q~0#1 then 1bv32 else 0bv32)); {1111#(= (bvadd (_ bv4294967295 32) ~counter~0) (_ bv0 32))} is VALID [2022-02-20 17:31:22,582 INFO L290 TraceCheckUtils]: 5: Hoare triple {1111#(= (bvadd (_ bv4294967295 32) ~counter~0) (_ bv0 32))} ~cond := #in~cond; {1111#(= (bvadd (_ bv4294967295 32) ~counter~0) (_ bv0 32))} is VALID [2022-02-20 17:31:22,582 INFO L290 TraceCheckUtils]: 6: Hoare triple {1111#(= (bvadd (_ bv4294967295 32) ~counter~0) (_ bv0 32))} assume !(0bv32 == ~cond); {1111#(= (bvadd (_ bv4294967295 32) ~counter~0) (_ bv0 32))} is VALID [2022-02-20 17:31:22,583 INFO L290 TraceCheckUtils]: 7: Hoare triple {1111#(= (bvadd (_ bv4294967295 32) ~counter~0) (_ bv0 32))} assume true; {1111#(= (bvadd (_ bv4294967295 32) ~counter~0) (_ bv0 32))} is VALID [2022-02-20 17:31:22,583 INFO L284 TraceCheckUtils]: 8: Hoare quadruple {1111#(= (bvadd (_ bv4294967295 32) ~counter~0) (_ bv0 32))} {1111#(= (bvadd (_ bv4294967295 32) ~counter~0) (_ bv0 32))} #67#return; {1111#(= (bvadd (_ bv4294967295 32) ~counter~0) (_ bv0 32))} is VALID [2022-02-20 17:31:22,584 INFO L272 TraceCheckUtils]: 9: Hoare triple {1111#(= (bvadd (_ bv4294967295 32) ~counter~0) (_ bv0 32))} call __VERIFIER_assert((if main_~r~0#1 == main_~A~0#1 then 1bv32 else 0bv32)); {1111#(= (bvadd (_ bv4294967295 32) ~counter~0) (_ bv0 32))} is VALID [2022-02-20 17:31:22,584 INFO L290 TraceCheckUtils]: 10: Hoare triple {1111#(= (bvadd (_ bv4294967295 32) ~counter~0) (_ bv0 32))} ~cond := #in~cond; {1111#(= (bvadd (_ bv4294967295 32) ~counter~0) (_ bv0 32))} is VALID [2022-02-20 17:31:22,585 INFO L290 TraceCheckUtils]: 11: Hoare triple {1111#(= (bvadd (_ bv4294967295 32) ~counter~0) (_ bv0 32))} assume !(0bv32 == ~cond); {1111#(= (bvadd (_ bv4294967295 32) ~counter~0) (_ bv0 32))} is VALID [2022-02-20 17:31:22,585 INFO L290 TraceCheckUtils]: 12: Hoare triple {1111#(= (bvadd (_ bv4294967295 32) ~counter~0) (_ bv0 32))} assume true; {1111#(= (bvadd (_ bv4294967295 32) ~counter~0) (_ bv0 32))} is VALID [2022-02-20 17:31:22,586 INFO L284 TraceCheckUtils]: 13: Hoare quadruple {1111#(= (bvadd (_ bv4294967295 32) ~counter~0) (_ bv0 32))} {1111#(= (bvadd (_ bv4294967295 32) ~counter~0) (_ bv0 32))} #69#return; {1111#(= (bvadd (_ bv4294967295 32) ~counter~0) (_ bv0 32))} is VALID [2022-02-20 17:31:22,586 INFO L272 TraceCheckUtils]: 14: Hoare triple {1111#(= (bvadd (_ bv4294967295 32) ~counter~0) (_ bv0 32))} call __VERIFIER_assert((if main_~d~0#1 == ~bvmul32(main_~B~0#1, main_~p~0#1) then 1bv32 else 0bv32)); {1111#(= (bvadd (_ bv4294967295 32) ~counter~0) (_ bv0 32))} is VALID [2022-02-20 17:31:22,587 INFO L290 TraceCheckUtils]: 15: Hoare triple {1111#(= (bvadd (_ bv4294967295 32) ~counter~0) (_ bv0 32))} ~cond := #in~cond; {1111#(= (bvadd (_ bv4294967295 32) ~counter~0) (_ bv0 32))} is VALID [2022-02-20 17:31:22,587 INFO L290 TraceCheckUtils]: 16: Hoare triple {1111#(= (bvadd (_ bv4294967295 32) ~counter~0) (_ bv0 32))} assume !(0bv32 == ~cond); {1111#(= (bvadd (_ bv4294967295 32) ~counter~0) (_ bv0 32))} is VALID [2022-02-20 17:31:22,587 INFO L290 TraceCheckUtils]: 17: Hoare triple {1111#(= (bvadd (_ bv4294967295 32) ~counter~0) (_ bv0 32))} assume true; {1111#(= (bvadd (_ bv4294967295 32) ~counter~0) (_ bv0 32))} is VALID [2022-02-20 17:31:22,588 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {1111#(= (bvadd (_ bv4294967295 32) ~counter~0) (_ bv0 32))} {1111#(= (bvadd (_ bv4294967295 32) ~counter~0) (_ bv0 32))} #71#return; {1111#(= (bvadd (_ bv4294967295 32) ~counter~0) (_ bv0 32))} is VALID [2022-02-20 17:31:22,589 INFO L290 TraceCheckUtils]: 19: Hoare triple {1111#(= (bvadd (_ bv4294967295 32) ~counter~0) (_ bv0 32))} assume !~bvsge32(main_~r~0#1, main_~d~0#1); {1111#(= (bvadd (_ bv4294967295 32) ~counter~0) (_ bv0 32))} is VALID [2022-02-20 17:31:22,589 INFO L290 TraceCheckUtils]: 20: Hoare triple {1111#(= (bvadd (_ bv4294967295 32) ~counter~0) (_ bv0 32))} main_#t~post6#1 := ~counter~0;~counter~0 := ~bvadd32(1bv32, main_#t~post6#1); {1166#(= |ULTIMATE.start_main_#t~post6#1| (_ bv1 32))} is VALID [2022-02-20 17:31:22,589 INFO L290 TraceCheckUtils]: 21: Hoare triple {1166#(= |ULTIMATE.start_main_#t~post6#1| (_ bv1 32))} assume !!~bvslt32(main_#t~post6#1, 1bv32);havoc main_#t~post6#1; {1100#false} is VALID [2022-02-20 17:31:22,590 INFO L272 TraceCheckUtils]: 22: Hoare triple {1100#false} call __VERIFIER_assert((if main_~A~0#1 == ~bvadd32(~bvmul32(main_~q~0#1, main_~B~0#1), main_~r~0#1) then 1bv32 else 0bv32)); {1100#false} is VALID [2022-02-20 17:31:22,590 INFO L290 TraceCheckUtils]: 23: Hoare triple {1100#false} ~cond := #in~cond; {1100#false} is VALID [2022-02-20 17:31:22,590 INFO L290 TraceCheckUtils]: 24: Hoare triple {1100#false} assume 0bv32 == ~cond; {1100#false} is VALID [2022-02-20 17:31:22,590 INFO L290 TraceCheckUtils]: 25: Hoare triple {1100#false} assume !false; {1100#false} is VALID [2022-02-20 17:31:22,590 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-02-20 17:31:22,590 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 17:31:22,590 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 17:31:22,591 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2072434625] [2022-02-20 17:31:22,591 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2072434625] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 17:31:22,591 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 17:31:22,591 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-20 17:31:22,591 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1477400040] [2022-02-20 17:31:22,591 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 17:31:22,592 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 26 [2022-02-20 17:31:22,592 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 17:31:22,592 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-02-20 17:31:22,621 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:31:22,621 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 17:31:22,622 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 17:31:22,622 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 17:31:22,622 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 17:31:22,622 INFO L87 Difference]: Start difference. First operand 46 states and 60 transitions. Second operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-02-20 17:31:23,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:31:23,050 INFO L93 Difference]: Finished difference Result 66 states and 76 transitions. [2022-02-20 17:31:23,050 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 17:31:23,050 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 26 [2022-02-20 17:31:23,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 17:31:23,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-02-20 17:31:23,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 60 transitions. [2022-02-20 17:31:23,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-02-20 17:31:23,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 60 transitions. [2022-02-20 17:31:23,052 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 60 transitions. [2022-02-20 17:31:23,157 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 60 edges. 60 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:31:23,158 INFO L225 Difference]: With dead ends: 66 [2022-02-20 17:31:23,158 INFO L226 Difference]: Without dead ends: 52 [2022-02-20 17:31:23,158 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 17:31:23,159 INFO L933 BasicCegarLoop]: 32 mSDtfsCounter, 1 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 114 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 17:31:23,159 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1 Valid, 114 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 17:31:23,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2022-02-20 17:31:23,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 51. [2022-02-20 17:31:23,163 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 17:31:23,164 INFO L82 GeneralOperation]: Start isEquivalent. First operand 52 states. Second operand has 51 states, 33 states have (on average 1.2121212121212122) internal successors, (40), 35 states have internal predecessors, (40), 11 states have call successors, (11), 6 states have call predecessors, (11), 6 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-02-20 17:31:23,164 INFO L74 IsIncluded]: Start isIncluded. First operand 52 states. Second operand has 51 states, 33 states have (on average 1.2121212121212122) internal successors, (40), 35 states have internal predecessors, (40), 11 states have call successors, (11), 6 states have call predecessors, (11), 6 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-02-20 17:31:23,164 INFO L87 Difference]: Start difference. First operand 52 states. Second operand has 51 states, 33 states have (on average 1.2121212121212122) internal successors, (40), 35 states have internal predecessors, (40), 11 states have call successors, (11), 6 states have call predecessors, (11), 6 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-02-20 17:31:23,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:31:23,166 INFO L93 Difference]: Finished difference Result 52 states and 61 transitions. [2022-02-20 17:31:23,166 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 61 transitions. [2022-02-20 17:31:23,166 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:31:23,166 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:31:23,166 INFO L74 IsIncluded]: Start isIncluded. First operand has 51 states, 33 states have (on average 1.2121212121212122) internal successors, (40), 35 states have internal predecessors, (40), 11 states have call successors, (11), 6 states have call predecessors, (11), 6 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Second operand 52 states. [2022-02-20 17:31:23,167 INFO L87 Difference]: Start difference. First operand has 51 states, 33 states have (on average 1.2121212121212122) internal successors, (40), 35 states have internal predecessors, (40), 11 states have call successors, (11), 6 states have call predecessors, (11), 6 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Second operand 52 states. [2022-02-20 17:31:23,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:31:23,168 INFO L93 Difference]: Finished difference Result 52 states and 61 transitions. [2022-02-20 17:31:23,168 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 61 transitions. [2022-02-20 17:31:23,168 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:31:23,168 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:31:23,168 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 17:31:23,169 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 17:31:23,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 33 states have (on average 1.2121212121212122) internal successors, (40), 35 states have internal predecessors, (40), 11 states have call successors, (11), 6 states have call predecessors, (11), 6 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-02-20 17:31:23,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 60 transitions. [2022-02-20 17:31:23,170 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 60 transitions. Word has length 26 [2022-02-20 17:31:23,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 17:31:23,170 INFO L470 AbstractCegarLoop]: Abstraction has 51 states and 60 transitions. [2022-02-20 17:31:23,170 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-02-20 17:31:23,171 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 60 transitions. [2022-02-20 17:31:23,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-02-20 17:31:23,171 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:31:23,171 INFO L514 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 17:31:23,190 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Ended with exit code 0 [2022-02-20 17:31:23,377 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-02-20 17:31:23,378 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 17:31:23,378 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:31:23,378 INFO L85 PathProgramCache]: Analyzing trace with hash -462792710, now seen corresponding path program 1 times [2022-02-20 17:31:23,378 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 17:31:23,378 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1881623572] [2022-02-20 17:31:23,378 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:31:23,379 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 17:31:23,379 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 17:31:23,380 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-02-20 17:31:23,380 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2022-02-20 17:31:23,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:31:23,415 INFO L263 TraceCheckSpWp]: Trace formula consists of 54 conjuncts, 5 conjunts are in the unsatisfiable core [2022-02-20 17:31:23,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:31:23,422 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 17:31:23,540 INFO L290 TraceCheckUtils]: 0: Hoare triple {1446#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(8bv32, 2bv32);call #Ultimate.allocInit(12bv32, 3bv32);~counter~0 := 0bv32; {1446#true} is VALID [2022-02-20 17:31:23,541 INFO L290 TraceCheckUtils]: 1: Hoare triple {1446#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~post5#1, main_#t~post6#1, main_~A~0#1, main_~B~0#1, main_~r~0#1, main_~d~0#1, main_~p~0#1, main_~q~0#1;havoc main_~A~0#1;havoc main_~B~0#1;havoc main_~r~0#1;havoc main_~d~0#1;havoc main_~p~0#1;havoc main_~q~0#1;main_~A~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;main_~B~0#1 := 1bv32;main_~r~0#1 := main_~A~0#1;main_~d~0#1 := main_~B~0#1;main_~p~0#1 := 1bv32;main_~q~0#1 := 0bv32; {1454#(and (= |ULTIMATE.start_main_~r~0#1| |ULTIMATE.start_main_~A~0#1|) (= |ULTIMATE.start_main_~q~0#1| (_ bv0 32)))} is VALID [2022-02-20 17:31:23,541 INFO L290 TraceCheckUtils]: 2: Hoare triple {1454#(and (= |ULTIMATE.start_main_~r~0#1| |ULTIMATE.start_main_~A~0#1|) (= |ULTIMATE.start_main_~q~0#1| (_ bv0 32)))} main_#t~post5#1 := ~counter~0;~counter~0 := ~bvadd32(1bv32, main_#t~post5#1); {1454#(and (= |ULTIMATE.start_main_~r~0#1| |ULTIMATE.start_main_~A~0#1|) (= |ULTIMATE.start_main_~q~0#1| (_ bv0 32)))} is VALID [2022-02-20 17:31:23,542 INFO L290 TraceCheckUtils]: 3: Hoare triple {1454#(and (= |ULTIMATE.start_main_~r~0#1| |ULTIMATE.start_main_~A~0#1|) (= |ULTIMATE.start_main_~q~0#1| (_ bv0 32)))} assume !!~bvslt32(main_#t~post5#1, 1bv32);havoc main_#t~post5#1; {1454#(and (= |ULTIMATE.start_main_~r~0#1| |ULTIMATE.start_main_~A~0#1|) (= |ULTIMATE.start_main_~q~0#1| (_ bv0 32)))} is VALID [2022-02-20 17:31:23,542 INFO L272 TraceCheckUtils]: 4: Hoare triple {1454#(and (= |ULTIMATE.start_main_~r~0#1| |ULTIMATE.start_main_~A~0#1|) (= |ULTIMATE.start_main_~q~0#1| (_ bv0 32)))} call __VERIFIER_assert((if 0bv32 == main_~q~0#1 then 1bv32 else 0bv32)); {1446#true} is VALID [2022-02-20 17:31:23,542 INFO L290 TraceCheckUtils]: 5: Hoare triple {1446#true} ~cond := #in~cond; {1446#true} is VALID [2022-02-20 17:31:23,542 INFO L290 TraceCheckUtils]: 6: Hoare triple {1446#true} assume !(0bv32 == ~cond); {1446#true} is VALID [2022-02-20 17:31:23,542 INFO L290 TraceCheckUtils]: 7: Hoare triple {1446#true} assume true; {1446#true} is VALID [2022-02-20 17:31:23,543 INFO L284 TraceCheckUtils]: 8: Hoare quadruple {1446#true} {1454#(and (= |ULTIMATE.start_main_~r~0#1| |ULTIMATE.start_main_~A~0#1|) (= |ULTIMATE.start_main_~q~0#1| (_ bv0 32)))} #67#return; {1454#(and (= |ULTIMATE.start_main_~r~0#1| |ULTIMATE.start_main_~A~0#1|) (= |ULTIMATE.start_main_~q~0#1| (_ bv0 32)))} is VALID [2022-02-20 17:31:23,543 INFO L272 TraceCheckUtils]: 9: Hoare triple {1454#(and (= |ULTIMATE.start_main_~r~0#1| |ULTIMATE.start_main_~A~0#1|) (= |ULTIMATE.start_main_~q~0#1| (_ bv0 32)))} call __VERIFIER_assert((if main_~r~0#1 == main_~A~0#1 then 1bv32 else 0bv32)); {1446#true} is VALID [2022-02-20 17:31:23,543 INFO L290 TraceCheckUtils]: 10: Hoare triple {1446#true} ~cond := #in~cond; {1446#true} is VALID [2022-02-20 17:31:23,543 INFO L290 TraceCheckUtils]: 11: Hoare triple {1446#true} assume !(0bv32 == ~cond); {1446#true} is VALID [2022-02-20 17:31:23,543 INFO L290 TraceCheckUtils]: 12: Hoare triple {1446#true} assume true; {1446#true} is VALID [2022-02-20 17:31:23,544 INFO L284 TraceCheckUtils]: 13: Hoare quadruple {1446#true} {1454#(and (= |ULTIMATE.start_main_~r~0#1| |ULTIMATE.start_main_~A~0#1|) (= |ULTIMATE.start_main_~q~0#1| (_ bv0 32)))} #69#return; {1454#(and (= |ULTIMATE.start_main_~r~0#1| |ULTIMATE.start_main_~A~0#1|) (= |ULTIMATE.start_main_~q~0#1| (_ bv0 32)))} is VALID [2022-02-20 17:31:23,544 INFO L272 TraceCheckUtils]: 14: Hoare triple {1454#(and (= |ULTIMATE.start_main_~r~0#1| |ULTIMATE.start_main_~A~0#1|) (= |ULTIMATE.start_main_~q~0#1| (_ bv0 32)))} call __VERIFIER_assert((if main_~d~0#1 == ~bvmul32(main_~B~0#1, main_~p~0#1) then 1bv32 else 0bv32)); {1446#true} is VALID [2022-02-20 17:31:23,544 INFO L290 TraceCheckUtils]: 15: Hoare triple {1446#true} ~cond := #in~cond; {1446#true} is VALID [2022-02-20 17:31:23,544 INFO L290 TraceCheckUtils]: 16: Hoare triple {1446#true} assume !(0bv32 == ~cond); {1446#true} is VALID [2022-02-20 17:31:23,544 INFO L290 TraceCheckUtils]: 17: Hoare triple {1446#true} assume true; {1446#true} is VALID [2022-02-20 17:31:23,545 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {1446#true} {1454#(and (= |ULTIMATE.start_main_~r~0#1| |ULTIMATE.start_main_~A~0#1|) (= |ULTIMATE.start_main_~q~0#1| (_ bv0 32)))} #71#return; {1454#(and (= |ULTIMATE.start_main_~r~0#1| |ULTIMATE.start_main_~A~0#1|) (= |ULTIMATE.start_main_~q~0#1| (_ bv0 32)))} is VALID [2022-02-20 17:31:23,546 INFO L290 TraceCheckUtils]: 19: Hoare triple {1454#(and (= |ULTIMATE.start_main_~r~0#1| |ULTIMATE.start_main_~A~0#1|) (= |ULTIMATE.start_main_~q~0#1| (_ bv0 32)))} assume !~bvsge32(main_~r~0#1, main_~d~0#1); {1454#(and (= |ULTIMATE.start_main_~r~0#1| |ULTIMATE.start_main_~A~0#1|) (= |ULTIMATE.start_main_~q~0#1| (_ bv0 32)))} is VALID [2022-02-20 17:31:23,546 INFO L290 TraceCheckUtils]: 20: Hoare triple {1454#(and (= |ULTIMATE.start_main_~r~0#1| |ULTIMATE.start_main_~A~0#1|) (= |ULTIMATE.start_main_~q~0#1| (_ bv0 32)))} main_#t~post6#1 := ~counter~0;~counter~0 := ~bvadd32(1bv32, main_#t~post6#1); {1454#(and (= |ULTIMATE.start_main_~r~0#1| |ULTIMATE.start_main_~A~0#1|) (= |ULTIMATE.start_main_~q~0#1| (_ bv0 32)))} is VALID [2022-02-20 17:31:23,547 INFO L290 TraceCheckUtils]: 21: Hoare triple {1454#(and (= |ULTIMATE.start_main_~r~0#1| |ULTIMATE.start_main_~A~0#1|) (= |ULTIMATE.start_main_~q~0#1| (_ bv0 32)))} assume !~bvslt32(main_#t~post6#1, 1bv32);havoc main_#t~post6#1; {1454#(and (= |ULTIMATE.start_main_~r~0#1| |ULTIMATE.start_main_~A~0#1|) (= |ULTIMATE.start_main_~q~0#1| (_ bv0 32)))} is VALID [2022-02-20 17:31:23,547 INFO L272 TraceCheckUtils]: 22: Hoare triple {1454#(and (= |ULTIMATE.start_main_~r~0#1| |ULTIMATE.start_main_~A~0#1|) (= |ULTIMATE.start_main_~q~0#1| (_ bv0 32)))} call __VERIFIER_assert((if main_~A~0#1 == ~bvadd32(~bvmul32(main_~d~0#1, main_~q~0#1), main_~r~0#1) then 1bv32 else 0bv32)); {1518#(= (_ bv1 32) |__VERIFIER_assert_#in~cond|)} is VALID [2022-02-20 17:31:23,548 INFO L290 TraceCheckUtils]: 23: Hoare triple {1518#(= (_ bv1 32) |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1522#(= __VERIFIER_assert_~cond (_ bv1 32))} is VALID [2022-02-20 17:31:23,548 INFO L290 TraceCheckUtils]: 24: Hoare triple {1522#(= __VERIFIER_assert_~cond (_ bv1 32))} assume 0bv32 == ~cond; {1447#false} is VALID [2022-02-20 17:31:23,548 INFO L290 TraceCheckUtils]: 25: Hoare triple {1447#false} assume !false; {1447#false} is VALID [2022-02-20 17:31:23,548 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-02-20 17:31:23,549 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 17:31:23,549 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 17:31:23,549 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1881623572] [2022-02-20 17:31:23,549 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1881623572] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 17:31:23,549 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 17:31:23,549 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 17:31:23,549 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1181234176] [2022-02-20 17:31:23,549 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 17:31:23,550 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 26 [2022-02-20 17:31:23,550 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 17:31:23,550 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-02-20 17:31:23,578 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:31:23,578 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 17:31:23,578 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 17:31:23,578 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 17:31:23,579 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 17:31:23,579 INFO L87 Difference]: Start difference. First operand 51 states and 60 transitions. Second operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-02-20 17:31:24,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:31:24,129 INFO L93 Difference]: Finished difference Result 65 states and 79 transitions. [2022-02-20 17:31:24,129 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 17:31:24,129 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 26 [2022-02-20 17:31:24,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 17:31:24,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-02-20 17:31:24,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 51 transitions. [2022-02-20 17:31:24,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-02-20 17:31:24,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 51 transitions. [2022-02-20 17:31:24,131 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 51 transitions. [2022-02-20 17:31:24,263 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 51 edges. 51 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:31:24,270 INFO L225 Difference]: With dead ends: 65 [2022-02-20 17:31:24,270 INFO L226 Difference]: Without dead ends: 60 [2022-02-20 17:31:24,271 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 22 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:31:24,272 INFO L933 BasicCegarLoop]: 25 mSDtfsCounter, 11 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 87 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 17:31:24,272 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [14 Valid, 87 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 17:31:24,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2022-02-20 17:31:24,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 59. [2022-02-20 17:31:24,291 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 17:31:24,300 INFO L82 GeneralOperation]: Start isEquivalent. First operand 60 states. Second operand has 59 states, 38 states have (on average 1.236842105263158) internal successors, (47), 40 states have internal predecessors, (47), 13 states have call successors, (13), 7 states have call predecessors, (13), 7 states have return successors, (12), 11 states have call predecessors, (12), 12 states have call successors, (12) [2022-02-20 17:31:24,300 INFO L74 IsIncluded]: Start isIncluded. First operand 60 states. Second operand has 59 states, 38 states have (on average 1.236842105263158) internal successors, (47), 40 states have internal predecessors, (47), 13 states have call successors, (13), 7 states have call predecessors, (13), 7 states have return successors, (12), 11 states have call predecessors, (12), 12 states have call successors, (12) [2022-02-20 17:31:24,300 INFO L87 Difference]: Start difference. First operand 60 states. Second operand has 59 states, 38 states have (on average 1.236842105263158) internal successors, (47), 40 states have internal predecessors, (47), 13 states have call successors, (13), 7 states have call predecessors, (13), 7 states have return successors, (12), 11 states have call predecessors, (12), 12 states have call successors, (12) [2022-02-20 17:31:24,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:31:24,302 INFO L93 Difference]: Finished difference Result 60 states and 73 transitions. [2022-02-20 17:31:24,302 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 73 transitions. [2022-02-20 17:31:24,302 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:31:24,302 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:31:24,303 INFO L74 IsIncluded]: Start isIncluded. First operand has 59 states, 38 states have (on average 1.236842105263158) internal successors, (47), 40 states have internal predecessors, (47), 13 states have call successors, (13), 7 states have call predecessors, (13), 7 states have return successors, (12), 11 states have call predecessors, (12), 12 states have call successors, (12) Second operand 60 states. [2022-02-20 17:31:24,303 INFO L87 Difference]: Start difference. First operand has 59 states, 38 states have (on average 1.236842105263158) internal successors, (47), 40 states have internal predecessors, (47), 13 states have call successors, (13), 7 states have call predecessors, (13), 7 states have return successors, (12), 11 states have call predecessors, (12), 12 states have call successors, (12) Second operand 60 states. [2022-02-20 17:31:24,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:31:24,304 INFO L93 Difference]: Finished difference Result 60 states and 73 transitions. [2022-02-20 17:31:24,304 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 73 transitions. [2022-02-20 17:31:24,305 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:31:24,305 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:31:24,305 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 17:31:24,305 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 17:31:24,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 38 states have (on average 1.236842105263158) internal successors, (47), 40 states have internal predecessors, (47), 13 states have call successors, (13), 7 states have call predecessors, (13), 7 states have return successors, (12), 11 states have call predecessors, (12), 12 states have call successors, (12) [2022-02-20 17:31:24,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 72 transitions. [2022-02-20 17:31:24,306 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 72 transitions. Word has length 26 [2022-02-20 17:31:24,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 17:31:24,307 INFO L470 AbstractCegarLoop]: Abstraction has 59 states and 72 transitions. [2022-02-20 17:31:24,307 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-02-20 17:31:24,307 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 72 transitions. [2022-02-20 17:31:24,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-02-20 17:31:24,308 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:31:24,308 INFO L514 BasicCegarLoop]: trace histogram [5, 4, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 17:31:24,323 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2022-02-20 17:31:24,513 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-02-20 17:31:24,513 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 17:31:24,513 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:31:24,513 INFO L85 PathProgramCache]: Analyzing trace with hash -909290541, now seen corresponding path program 1 times [2022-02-20 17:31:24,514 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 17:31:24,514 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [723612000] [2022-02-20 17:31:24,514 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:31:24,514 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 17:31:24,514 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 17:31:24,515 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-02-20 17:31:24,517 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2022-02-20 17:31:24,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:31:24,556 INFO L263 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 7 conjunts are in the unsatisfiable core [2022-02-20 17:31:24,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:31:24,565 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 17:31:24,737 INFO L290 TraceCheckUtils]: 0: Hoare triple {1820#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(8bv32, 2bv32);call #Ultimate.allocInit(12bv32, 3bv32);~counter~0 := 0bv32; {1825#(= ~counter~0 (_ bv0 32))} is VALID [2022-02-20 17:31:24,738 INFO L290 TraceCheckUtils]: 1: Hoare triple {1825#(= ~counter~0 (_ bv0 32))} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~post5#1, main_#t~post6#1, main_~A~0#1, main_~B~0#1, main_~r~0#1, main_~d~0#1, main_~p~0#1, main_~q~0#1;havoc main_~A~0#1;havoc main_~B~0#1;havoc main_~r~0#1;havoc main_~d~0#1;havoc main_~p~0#1;havoc main_~q~0#1;main_~A~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;main_~B~0#1 := 1bv32;main_~r~0#1 := main_~A~0#1;main_~d~0#1 := main_~B~0#1;main_~p~0#1 := 1bv32;main_~q~0#1 := 0bv32; {1825#(= ~counter~0 (_ bv0 32))} is VALID [2022-02-20 17:31:24,738 INFO L290 TraceCheckUtils]: 2: Hoare triple {1825#(= ~counter~0 (_ bv0 32))} main_#t~post5#1 := ~counter~0;~counter~0 := ~bvadd32(1bv32, main_#t~post5#1); {1832#(= (bvadd (_ bv4294967295 32) ~counter~0) (_ bv0 32))} is VALID [2022-02-20 17:31:24,738 INFO L290 TraceCheckUtils]: 3: Hoare triple {1832#(= (bvadd (_ bv4294967295 32) ~counter~0) (_ bv0 32))} assume !!~bvslt32(main_#t~post5#1, 1bv32);havoc main_#t~post5#1; {1832#(= (bvadd (_ bv4294967295 32) ~counter~0) (_ bv0 32))} is VALID [2022-02-20 17:31:24,739 INFO L272 TraceCheckUtils]: 4: Hoare triple {1832#(= (bvadd (_ bv4294967295 32) ~counter~0) (_ bv0 32))} call __VERIFIER_assert((if 0bv32 == main_~q~0#1 then 1bv32 else 0bv32)); {1832#(= (bvadd (_ bv4294967295 32) ~counter~0) (_ bv0 32))} is VALID [2022-02-20 17:31:24,739 INFO L290 TraceCheckUtils]: 5: Hoare triple {1832#(= (bvadd (_ bv4294967295 32) ~counter~0) (_ bv0 32))} ~cond := #in~cond; {1832#(= (bvadd (_ bv4294967295 32) ~counter~0) (_ bv0 32))} is VALID [2022-02-20 17:31:24,740 INFO L290 TraceCheckUtils]: 6: Hoare triple {1832#(= (bvadd (_ bv4294967295 32) ~counter~0) (_ bv0 32))} assume !(0bv32 == ~cond); {1832#(= (bvadd (_ bv4294967295 32) ~counter~0) (_ bv0 32))} is VALID [2022-02-20 17:31:24,740 INFO L290 TraceCheckUtils]: 7: Hoare triple {1832#(= (bvadd (_ bv4294967295 32) ~counter~0) (_ bv0 32))} assume true; {1832#(= (bvadd (_ bv4294967295 32) ~counter~0) (_ bv0 32))} is VALID [2022-02-20 17:31:24,741 INFO L284 TraceCheckUtils]: 8: Hoare quadruple {1832#(= (bvadd (_ bv4294967295 32) ~counter~0) (_ bv0 32))} {1832#(= (bvadd (_ bv4294967295 32) ~counter~0) (_ bv0 32))} #67#return; {1832#(= (bvadd (_ bv4294967295 32) ~counter~0) (_ bv0 32))} is VALID [2022-02-20 17:31:24,743 INFO L272 TraceCheckUtils]: 9: Hoare triple {1832#(= (bvadd (_ bv4294967295 32) ~counter~0) (_ bv0 32))} call __VERIFIER_assert((if main_~r~0#1 == main_~A~0#1 then 1bv32 else 0bv32)); {1832#(= (bvadd (_ bv4294967295 32) ~counter~0) (_ bv0 32))} is VALID [2022-02-20 17:31:24,743 INFO L290 TraceCheckUtils]: 10: Hoare triple {1832#(= (bvadd (_ bv4294967295 32) ~counter~0) (_ bv0 32))} ~cond := #in~cond; {1832#(= (bvadd (_ bv4294967295 32) ~counter~0) (_ bv0 32))} is VALID [2022-02-20 17:31:24,747 INFO L290 TraceCheckUtils]: 11: Hoare triple {1832#(= (bvadd (_ bv4294967295 32) ~counter~0) (_ bv0 32))} assume !(0bv32 == ~cond); {1832#(= (bvadd (_ bv4294967295 32) ~counter~0) (_ bv0 32))} is VALID [2022-02-20 17:31:24,748 INFO L290 TraceCheckUtils]: 12: Hoare triple {1832#(= (bvadd (_ bv4294967295 32) ~counter~0) (_ bv0 32))} assume true; {1832#(= (bvadd (_ bv4294967295 32) ~counter~0) (_ bv0 32))} is VALID [2022-02-20 17:31:24,748 INFO L284 TraceCheckUtils]: 13: Hoare quadruple {1832#(= (bvadd (_ bv4294967295 32) ~counter~0) (_ bv0 32))} {1832#(= (bvadd (_ bv4294967295 32) ~counter~0) (_ bv0 32))} #69#return; {1832#(= (bvadd (_ bv4294967295 32) ~counter~0) (_ bv0 32))} is VALID [2022-02-20 17:31:24,749 INFO L272 TraceCheckUtils]: 14: Hoare triple {1832#(= (bvadd (_ bv4294967295 32) ~counter~0) (_ bv0 32))} call __VERIFIER_assert((if main_~d~0#1 == ~bvmul32(main_~B~0#1, main_~p~0#1) then 1bv32 else 0bv32)); {1832#(= (bvadd (_ bv4294967295 32) ~counter~0) (_ bv0 32))} is VALID [2022-02-20 17:31:24,749 INFO L290 TraceCheckUtils]: 15: Hoare triple {1832#(= (bvadd (_ bv4294967295 32) ~counter~0) (_ bv0 32))} ~cond := #in~cond; {1832#(= (bvadd (_ bv4294967295 32) ~counter~0) (_ bv0 32))} is VALID [2022-02-20 17:31:24,750 INFO L290 TraceCheckUtils]: 16: Hoare triple {1832#(= (bvadd (_ bv4294967295 32) ~counter~0) (_ bv0 32))} assume !(0bv32 == ~cond); {1832#(= (bvadd (_ bv4294967295 32) ~counter~0) (_ bv0 32))} is VALID [2022-02-20 17:31:24,750 INFO L290 TraceCheckUtils]: 17: Hoare triple {1832#(= (bvadd (_ bv4294967295 32) ~counter~0) (_ bv0 32))} assume true; {1832#(= (bvadd (_ bv4294967295 32) ~counter~0) (_ bv0 32))} is VALID [2022-02-20 17:31:24,750 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {1832#(= (bvadd (_ bv4294967295 32) ~counter~0) (_ bv0 32))} {1832#(= (bvadd (_ bv4294967295 32) ~counter~0) (_ bv0 32))} #71#return; {1832#(= (bvadd (_ bv4294967295 32) ~counter~0) (_ bv0 32))} is VALID [2022-02-20 17:31:24,751 INFO L290 TraceCheckUtils]: 19: Hoare triple {1832#(= (bvadd (_ bv4294967295 32) ~counter~0) (_ bv0 32))} assume !!~bvsge32(main_~r~0#1, main_~d~0#1);main_~d~0#1 := ~bvmul32(2bv32, main_~d~0#1);main_~p~0#1 := ~bvmul32(2bv32, main_~p~0#1); {1832#(= (bvadd (_ bv4294967295 32) ~counter~0) (_ bv0 32))} is VALID [2022-02-20 17:31:24,751 INFO L290 TraceCheckUtils]: 20: Hoare triple {1832#(= (bvadd (_ bv4294967295 32) ~counter~0) (_ bv0 32))} main_#t~post5#1 := ~counter~0;~counter~0 := ~bvadd32(1bv32, main_#t~post5#1); {1887#(= (_ bv0 32) (bvadd (_ bv4294967294 32) ~counter~0))} is VALID [2022-02-20 17:31:24,752 INFO L290 TraceCheckUtils]: 21: Hoare triple {1887#(= (_ bv0 32) (bvadd (_ bv4294967294 32) ~counter~0))} assume !~bvslt32(main_#t~post5#1, 1bv32);havoc main_#t~post5#1; {1887#(= (_ bv0 32) (bvadd (_ bv4294967294 32) ~counter~0))} is VALID [2022-02-20 17:31:24,752 INFO L290 TraceCheckUtils]: 22: Hoare triple {1887#(= (_ bv0 32) (bvadd (_ bv4294967294 32) ~counter~0))} main_#t~post6#1 := ~counter~0;~counter~0 := ~bvadd32(1bv32, main_#t~post6#1); {1894#(= (bvadd |ULTIMATE.start_main_#t~post6#1| (_ bv4294967294 32)) (_ bv0 32))} is VALID [2022-02-20 17:31:24,752 INFO L290 TraceCheckUtils]: 23: Hoare triple {1894#(= (bvadd |ULTIMATE.start_main_#t~post6#1| (_ bv4294967294 32)) (_ bv0 32))} assume !!~bvslt32(main_#t~post6#1, 1bv32);havoc main_#t~post6#1; {1821#false} is VALID [2022-02-20 17:31:24,753 INFO L272 TraceCheckUtils]: 24: Hoare triple {1821#false} call __VERIFIER_assert((if main_~A~0#1 == ~bvadd32(~bvmul32(main_~q~0#1, main_~B~0#1), main_~r~0#1) then 1bv32 else 0bv32)); {1821#false} is VALID [2022-02-20 17:31:24,753 INFO L290 TraceCheckUtils]: 25: Hoare triple {1821#false} ~cond := #in~cond; {1821#false} is VALID [2022-02-20 17:31:24,753 INFO L290 TraceCheckUtils]: 26: Hoare triple {1821#false} assume !(0bv32 == ~cond); {1821#false} is VALID [2022-02-20 17:31:24,753 INFO L290 TraceCheckUtils]: 27: Hoare triple {1821#false} assume true; {1821#false} is VALID [2022-02-20 17:31:24,753 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {1821#false} {1821#false} #73#return; {1821#false} is VALID [2022-02-20 17:31:24,753 INFO L272 TraceCheckUtils]: 29: Hoare triple {1821#false} call __VERIFIER_assert((if main_~d~0#1 == ~bvmul32(main_~B~0#1, main_~p~0#1) then 1bv32 else 0bv32)); {1821#false} is VALID [2022-02-20 17:31:24,753 INFO L290 TraceCheckUtils]: 30: Hoare triple {1821#false} ~cond := #in~cond; {1821#false} is VALID [2022-02-20 17:31:24,754 INFO L290 TraceCheckUtils]: 31: Hoare triple {1821#false} assume 0bv32 == ~cond; {1821#false} is VALID [2022-02-20 17:31:24,754 INFO L290 TraceCheckUtils]: 32: Hoare triple {1821#false} assume !false; {1821#false} is VALID [2022-02-20 17:31:24,754 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 18 proven. 2 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2022-02-20 17:31:24,754 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 17:31:24,898 INFO L290 TraceCheckUtils]: 32: Hoare triple {1821#false} assume !false; {1821#false} is VALID [2022-02-20 17:31:24,898 INFO L290 TraceCheckUtils]: 31: Hoare triple {1821#false} assume 0bv32 == ~cond; {1821#false} is VALID [2022-02-20 17:31:24,898 INFO L290 TraceCheckUtils]: 30: Hoare triple {1821#false} ~cond := #in~cond; {1821#false} is VALID [2022-02-20 17:31:24,898 INFO L272 TraceCheckUtils]: 29: Hoare triple {1821#false} call __VERIFIER_assert((if main_~d~0#1 == ~bvmul32(main_~B~0#1, main_~p~0#1) then 1bv32 else 0bv32)); {1821#false} is VALID [2022-02-20 17:31:24,898 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {1820#true} {1821#false} #73#return; {1821#false} is VALID [2022-02-20 17:31:24,898 INFO L290 TraceCheckUtils]: 27: Hoare triple {1820#true} assume true; {1820#true} is VALID [2022-02-20 17:31:24,898 INFO L290 TraceCheckUtils]: 26: Hoare triple {1820#true} assume !(0bv32 == ~cond); {1820#true} is VALID [2022-02-20 17:31:24,898 INFO L290 TraceCheckUtils]: 25: Hoare triple {1820#true} ~cond := #in~cond; {1820#true} is VALID [2022-02-20 17:31:24,899 INFO L272 TraceCheckUtils]: 24: Hoare triple {1821#false} call __VERIFIER_assert((if main_~A~0#1 == ~bvadd32(~bvmul32(main_~q~0#1, main_~B~0#1), main_~r~0#1) then 1bv32 else 0bv32)); {1820#true} is VALID [2022-02-20 17:31:24,899 INFO L290 TraceCheckUtils]: 23: Hoare triple {1952#(not (bvslt |ULTIMATE.start_main_#t~post6#1| (_ bv1 32)))} assume !!~bvslt32(main_#t~post6#1, 1bv32);havoc main_#t~post6#1; {1821#false} is VALID [2022-02-20 17:31:24,899 INFO L290 TraceCheckUtils]: 22: Hoare triple {1956#(not (bvslt ~counter~0 (_ bv1 32)))} main_#t~post6#1 := ~counter~0;~counter~0 := ~bvadd32(1bv32, main_#t~post6#1); {1952#(not (bvslt |ULTIMATE.start_main_#t~post6#1| (_ bv1 32)))} is VALID [2022-02-20 17:31:24,900 INFO L290 TraceCheckUtils]: 21: Hoare triple {1956#(not (bvslt ~counter~0 (_ bv1 32)))} assume !~bvslt32(main_#t~post5#1, 1bv32);havoc main_#t~post5#1; {1956#(not (bvslt ~counter~0 (_ bv1 32)))} is VALID [2022-02-20 17:31:24,900 INFO L290 TraceCheckUtils]: 20: Hoare triple {1963#(not (bvslt (bvadd ~counter~0 (_ bv1 32)) (_ bv1 32)))} main_#t~post5#1 := ~counter~0;~counter~0 := ~bvadd32(1bv32, main_#t~post5#1); {1956#(not (bvslt ~counter~0 (_ bv1 32)))} is VALID [2022-02-20 17:31:24,900 INFO L290 TraceCheckUtils]: 19: Hoare triple {1963#(not (bvslt (bvadd ~counter~0 (_ bv1 32)) (_ bv1 32)))} assume !!~bvsge32(main_~r~0#1, main_~d~0#1);main_~d~0#1 := ~bvmul32(2bv32, main_~d~0#1);main_~p~0#1 := ~bvmul32(2bv32, main_~p~0#1); {1963#(not (bvslt (bvadd ~counter~0 (_ bv1 32)) (_ bv1 32)))} is VALID [2022-02-20 17:31:24,901 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {1820#true} {1963#(not (bvslt (bvadd ~counter~0 (_ bv1 32)) (_ bv1 32)))} #71#return; {1963#(not (bvslt (bvadd ~counter~0 (_ bv1 32)) (_ bv1 32)))} is VALID [2022-02-20 17:31:24,901 INFO L290 TraceCheckUtils]: 17: Hoare triple {1820#true} assume true; {1820#true} is VALID [2022-02-20 17:31:24,901 INFO L290 TraceCheckUtils]: 16: Hoare triple {1820#true} assume !(0bv32 == ~cond); {1820#true} is VALID [2022-02-20 17:31:24,901 INFO L290 TraceCheckUtils]: 15: Hoare triple {1820#true} ~cond := #in~cond; {1820#true} is VALID [2022-02-20 17:31:24,901 INFO L272 TraceCheckUtils]: 14: Hoare triple {1963#(not (bvslt (bvadd ~counter~0 (_ bv1 32)) (_ bv1 32)))} call __VERIFIER_assert((if main_~d~0#1 == ~bvmul32(main_~B~0#1, main_~p~0#1) then 1bv32 else 0bv32)); {1820#true} is VALID [2022-02-20 17:31:24,902 INFO L284 TraceCheckUtils]: 13: Hoare quadruple {1820#true} {1963#(not (bvslt (bvadd ~counter~0 (_ bv1 32)) (_ bv1 32)))} #69#return; {1963#(not (bvslt (bvadd ~counter~0 (_ bv1 32)) (_ bv1 32)))} is VALID [2022-02-20 17:31:24,902 INFO L290 TraceCheckUtils]: 12: Hoare triple {1820#true} assume true; {1820#true} is VALID [2022-02-20 17:31:24,902 INFO L290 TraceCheckUtils]: 11: Hoare triple {1820#true} assume !(0bv32 == ~cond); {1820#true} is VALID [2022-02-20 17:31:24,902 INFO L290 TraceCheckUtils]: 10: Hoare triple {1820#true} ~cond := #in~cond; {1820#true} is VALID [2022-02-20 17:31:24,902 INFO L272 TraceCheckUtils]: 9: Hoare triple {1963#(not (bvslt (bvadd ~counter~0 (_ bv1 32)) (_ bv1 32)))} call __VERIFIER_assert((if main_~r~0#1 == main_~A~0#1 then 1bv32 else 0bv32)); {1820#true} is VALID [2022-02-20 17:31:24,903 INFO L284 TraceCheckUtils]: 8: Hoare quadruple {1820#true} {1963#(not (bvslt (bvadd ~counter~0 (_ bv1 32)) (_ bv1 32)))} #67#return; {1963#(not (bvslt (bvadd ~counter~0 (_ bv1 32)) (_ bv1 32)))} is VALID [2022-02-20 17:31:24,903 INFO L290 TraceCheckUtils]: 7: Hoare triple {1820#true} assume true; {1820#true} is VALID [2022-02-20 17:31:24,903 INFO L290 TraceCheckUtils]: 6: Hoare triple {1820#true} assume !(0bv32 == ~cond); {1820#true} is VALID [2022-02-20 17:31:24,903 INFO L290 TraceCheckUtils]: 5: Hoare triple {1820#true} ~cond := #in~cond; {1820#true} is VALID [2022-02-20 17:31:24,903 INFO L272 TraceCheckUtils]: 4: Hoare triple {1963#(not (bvslt (bvadd ~counter~0 (_ bv1 32)) (_ bv1 32)))} call __VERIFIER_assert((if 0bv32 == main_~q~0#1 then 1bv32 else 0bv32)); {1820#true} is VALID [2022-02-20 17:31:24,903 INFO L290 TraceCheckUtils]: 3: Hoare triple {1963#(not (bvslt (bvadd ~counter~0 (_ bv1 32)) (_ bv1 32)))} assume !!~bvslt32(main_#t~post5#1, 1bv32);havoc main_#t~post5#1; {1963#(not (bvslt (bvadd ~counter~0 (_ bv1 32)) (_ bv1 32)))} is VALID [2022-02-20 17:31:24,904 INFO L290 TraceCheckUtils]: 2: Hoare triple {2018#(not (bvslt (bvadd (_ bv2 32) ~counter~0) (_ bv1 32)))} main_#t~post5#1 := ~counter~0;~counter~0 := ~bvadd32(1bv32, main_#t~post5#1); {1963#(not (bvslt (bvadd ~counter~0 (_ bv1 32)) (_ bv1 32)))} is VALID [2022-02-20 17:31:24,905 INFO L290 TraceCheckUtils]: 1: Hoare triple {2018#(not (bvslt (bvadd (_ bv2 32) ~counter~0) (_ bv1 32)))} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~post5#1, main_#t~post6#1, main_~A~0#1, main_~B~0#1, main_~r~0#1, main_~d~0#1, main_~p~0#1, main_~q~0#1;havoc main_~A~0#1;havoc main_~B~0#1;havoc main_~r~0#1;havoc main_~d~0#1;havoc main_~p~0#1;havoc main_~q~0#1;main_~A~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;main_~B~0#1 := 1bv32;main_~r~0#1 := main_~A~0#1;main_~d~0#1 := main_~B~0#1;main_~p~0#1 := 1bv32;main_~q~0#1 := 0bv32; {2018#(not (bvslt (bvadd (_ bv2 32) ~counter~0) (_ bv1 32)))} is VALID [2022-02-20 17:31:24,905 INFO L290 TraceCheckUtils]: 0: Hoare triple {1820#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(8bv32, 2bv32);call #Ultimate.allocInit(12bv32, 3bv32);~counter~0 := 0bv32; {2018#(not (bvslt (bvadd (_ bv2 32) ~counter~0) (_ bv1 32)))} is VALID [2022-02-20 17:31:24,906 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-02-20 17:31:24,906 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 17:31:24,906 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [723612000] [2022-02-20 17:31:24,906 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [723612000] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 17:31:24,906 INFO L191 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-02-20 17:31:24,906 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6] total 10 [2022-02-20 17:31:24,906 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [66336877] [2022-02-20 17:31:24,906 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-02-20 17:31:24,906 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.9) internal successors, (29), 10 states have internal predecessors, (29), 3 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) Word has length 33 [2022-02-20 17:31:24,907 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 17:31:24,907 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 10 states, 10 states have (on average 2.9) internal successors, (29), 10 states have internal predecessors, (29), 3 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2022-02-20 17:31:24,967 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 46 edges. 46 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:31:24,967 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-02-20 17:31:24,967 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 17:31:24,967 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-02-20 17:31:24,967 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2022-02-20 17:31:24,967 INFO L87 Difference]: Start difference. First operand 59 states and 72 transitions. Second operand has 10 states, 10 states have (on average 2.9) internal successors, (29), 10 states have internal predecessors, (29), 3 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2022-02-20 17:31:27,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:31:27,191 INFO L93 Difference]: Finished difference Result 191 states and 226 transitions. [2022-02-20 17:31:27,191 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-02-20 17:31:27,191 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.9) internal successors, (29), 10 states have internal predecessors, (29), 3 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) Word has length 33 [2022-02-20 17:31:27,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 17:31:27,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 2.9) internal successors, (29), 10 states have internal predecessors, (29), 3 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2022-02-20 17:31:27,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 149 transitions. [2022-02-20 17:31:27,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 2.9) internal successors, (29), 10 states have internal predecessors, (29), 3 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2022-02-20 17:31:27,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 149 transitions. [2022-02-20 17:31:27,196 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states and 149 transitions. [2022-02-20 17:31:27,448 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 149 edges. 149 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:31:27,456 INFO L225 Difference]: With dead ends: 191 [2022-02-20 17:31:27,456 INFO L226 Difference]: Without dead ends: 166 [2022-02-20 17:31:27,459 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=62, Invalid=148, Unknown=0, NotChecked=0, Total=210 [2022-02-20 17:31:27,465 INFO L933 BasicCegarLoop]: 57 mSDtfsCounter, 86 mSDsluCounter, 259 mSDsCounter, 0 mSdLazyCounter, 132 mSolverCounterSat, 70 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 86 SdHoareTripleChecker+Valid, 316 SdHoareTripleChecker+Invalid, 202 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 70 IncrementalHoareTripleChecker+Valid, 132 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-02-20 17:31:27,466 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [86 Valid, 316 Invalid, 202 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [70 Valid, 132 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-02-20 17:31:27,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2022-02-20 17:31:27,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 157. [2022-02-20 17:31:27,493 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 17:31:27,495 INFO L82 GeneralOperation]: Start isEquivalent. First operand 166 states. Second operand has 157 states, 103 states have (on average 1.203883495145631) internal successors, (124), 108 states have internal predecessors, (124), 31 states have call successors, (31), 22 states have call predecessors, (31), 22 states have return successors, (27), 26 states have call predecessors, (27), 27 states have call successors, (27) [2022-02-20 17:31:27,501 INFO L74 IsIncluded]: Start isIncluded. First operand 166 states. Second operand has 157 states, 103 states have (on average 1.203883495145631) internal successors, (124), 108 states have internal predecessors, (124), 31 states have call successors, (31), 22 states have call predecessors, (31), 22 states have return successors, (27), 26 states have call predecessors, (27), 27 states have call successors, (27) [2022-02-20 17:31:27,502 INFO L87 Difference]: Start difference. First operand 166 states. Second operand has 157 states, 103 states have (on average 1.203883495145631) internal successors, (124), 108 states have internal predecessors, (124), 31 states have call successors, (31), 22 states have call predecessors, (31), 22 states have return successors, (27), 26 states have call predecessors, (27), 27 states have call successors, (27) [2022-02-20 17:31:27,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:31:27,512 INFO L93 Difference]: Finished difference Result 166 states and 187 transitions. [2022-02-20 17:31:27,513 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 187 transitions. [2022-02-20 17:31:27,514 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:31:27,514 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:31:27,516 INFO L74 IsIncluded]: Start isIncluded. First operand has 157 states, 103 states have (on average 1.203883495145631) internal successors, (124), 108 states have internal predecessors, (124), 31 states have call successors, (31), 22 states have call predecessors, (31), 22 states have return successors, (27), 26 states have call predecessors, (27), 27 states have call successors, (27) Second operand 166 states. [2022-02-20 17:31:27,516 INFO L87 Difference]: Start difference. First operand has 157 states, 103 states have (on average 1.203883495145631) internal successors, (124), 108 states have internal predecessors, (124), 31 states have call successors, (31), 22 states have call predecessors, (31), 22 states have return successors, (27), 26 states have call predecessors, (27), 27 states have call successors, (27) Second operand 166 states. [2022-02-20 17:31:27,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:31:27,533 INFO L93 Difference]: Finished difference Result 166 states and 187 transitions. [2022-02-20 17:31:27,533 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 187 transitions. [2022-02-20 17:31:27,534 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:31:27,534 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:31:27,534 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 17:31:27,534 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 17:31:27,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 157 states, 103 states have (on average 1.203883495145631) internal successors, (124), 108 states have internal predecessors, (124), 31 states have call successors, (31), 22 states have call predecessors, (31), 22 states have return successors, (27), 26 states have call predecessors, (27), 27 states have call successors, (27) [2022-02-20 17:31:27,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 182 transitions. [2022-02-20 17:31:27,547 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 182 transitions. Word has length 33 [2022-02-20 17:31:27,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 17:31:27,547 INFO L470 AbstractCegarLoop]: Abstraction has 157 states and 182 transitions. [2022-02-20 17:31:27,547 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.9) internal successors, (29), 10 states have internal predecessors, (29), 3 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2022-02-20 17:31:27,547 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 182 transitions. [2022-02-20 17:31:27,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-02-20 17:31:27,548 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:31:27,548 INFO L514 BasicCegarLoop]: trace histogram [5, 4, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 17:31:27,556 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2022-02-20 17:31:27,755 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-02-20 17:31:27,755 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 17:31:27,756 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:31:27,756 INFO L85 PathProgramCache]: Analyzing trace with hash 847666457, now seen corresponding path program 1 times [2022-02-20 17:31:27,756 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 17:31:27,756 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1585824982] [2022-02-20 17:31:27,757 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:31:27,757 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 17:31:27,757 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 17:31:27,758 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-02-20 17:31:27,758 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2022-02-20 17:31:27,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-20 17:31:27,790 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-20 17:31:27,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-20 17:31:27,840 INFO L138 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2022-02-20 17:31:27,840 INFO L628 BasicCegarLoop]: Counterexample is feasible [2022-02-20 17:31:27,841 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-02-20 17:31:27,872 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (10)] Ended with exit code 0 [2022-02-20 17:31:28,042 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-02-20 17:31:28,044 INFO L732 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 17:31:28,046 INFO L180 ceAbstractionStarter]: Computing trace abstraction results [2022-02-20 17:31:28,055 FATAL L489 DefaultTranslator]: Callstack has procedure call flag but succeeding procedure is empty at [CALL] call __VERIFIER_assert((if 0bv32 == ~q~0 then 1bv32 else 0bv32)); [2022-02-20 17:31:28,056 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:31:28,057 INFO L158 Benchmark]: Toolchain (without parser) took 11069.00ms. Allocated memory was 48.2MB in the beginning and 71.3MB in the end (delta: 23.1MB). Free memory was 24.0MB in the beginning and 27.7MB in the end (delta: -3.7MB). Peak memory consumption was 19.4MB. Max. memory is 16.1GB. [2022-02-20 17:31:28,062 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 48.2MB. Free memory was 29.8MB in the beginning and 29.8MB in the end (delta: 36.6kB). There was no memory consumed. Max. memory is 16.1GB. [2022-02-20 17:31:28,062 INFO L158 Benchmark]: CACSL2BoogieTranslator took 229.52ms. Allocated memory was 48.2MB in the beginning and 58.7MB in the end (delta: 10.5MB). Free memory was 23.8MB in the beginning and 41.5MB in the end (delta: -17.8MB). Peak memory consumption was 3.3MB. Max. memory is 16.1GB. [2022-02-20 17:31:28,062 INFO L158 Benchmark]: Boogie Procedure Inliner took 33.43ms. Allocated memory is still 58.7MB. Free memory was 41.5MB in the beginning and 40.0MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. [2022-02-20 17:31:28,062 INFO L158 Benchmark]: Boogie Preprocessor took 36.41ms. Allocated memory is still 58.7MB. Free memory was 40.0MB in the beginning and 38.6MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-20 17:31:28,062 INFO L158 Benchmark]: RCFGBuilder took 246.21ms. Allocated memory is still 58.7MB. Free memory was 38.6MB in the beginning and 42.2MB in the end (delta: -3.6MB). Peak memory consumption was 13.7MB. Max. memory is 16.1GB. [2022-02-20 17:31:28,063 INFO L158 Benchmark]: TraceAbstraction took 10516.57ms. Allocated memory was 58.7MB in the beginning and 71.3MB in the end (delta: 12.6MB). Free memory was 41.7MB in the beginning and 27.7MB in the end (delta: 14.0MB). Peak memory consumption was 26.8MB. Max. memory is 16.1GB. [2022-02-20 17:31:28,064 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.13ms. Allocated memory is still 48.2MB. Free memory was 29.8MB in the beginning and 29.8MB in the end (delta: 36.6kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 229.52ms. Allocated memory was 48.2MB in the beginning and 58.7MB in the end (delta: 10.5MB). Free memory was 23.8MB in the beginning and 41.5MB in the end (delta: -17.8MB). Peak memory consumption was 3.3MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 33.43ms. Allocated memory is still 58.7MB. Free memory was 41.5MB in the beginning and 40.0MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 36.41ms. Allocated memory is still 58.7MB. Free memory was 40.0MB in the beginning and 38.6MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 246.21ms. Allocated memory is still 58.7MB. Free memory was 38.6MB in the beginning and 42.2MB in the end (delta: -3.6MB). Peak memory consumption was 13.7MB. Max. memory is 16.1GB. * TraceAbstraction took 10516.57ms. Allocated memory was 58.7MB in the beginning and 71.3MB in the end (delta: 12.6MB). Free memory was 41.7MB in the beginning and 27.7MB in the end (delta: 14.0MB). Peak memory consumption was 26.8MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - ExceptionOrErrorResult: AssertionError: callstack broken after backtranslation by InlinerBacktranslator de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: callstack broken after backtranslation by InlinerBacktranslator: de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator.translateProgramExecution(InlinerBacktranslator.java:230) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2022-02-20 17:31:28,087 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