./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/nla-digbench-scaling/prod4br-ll_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/prod4br-ll_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 7e9492584c051c945baa3a1de8b03a2c00614fb076a66c88b26b81461b005eeb --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 17:38:05,755 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 17:38:05,757 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 17:38:05,779 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 17:38:05,780 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 17:38:05,781 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 17:38:05,782 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 17:38:05,784 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 17:38:05,785 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 17:38:05,786 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 17:38:05,787 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 17:38:05,788 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 17:38:05,788 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 17:38:05,789 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 17:38:05,790 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 17:38:05,792 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 17:38:05,793 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 17:38:05,797 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 17:38:05,799 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 17:38:05,801 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 17:38:05,805 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 17:38:05,806 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 17:38:05,808 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 17:38:05,808 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 17:38:05,813 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 17:38:05,816 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 17:38:05,816 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 17:38:05,817 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 17:38:05,817 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 17:38:05,818 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 17:38:05,818 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 17:38:05,819 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 17:38:05,820 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 17:38:05,821 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 17:38:05,822 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 17:38:05,823 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 17:38:05,824 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 17:38:05,824 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 17:38:05,824 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 17:38:05,825 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 17:38:05,826 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 17:38:05,827 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:38:05,847 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 17:38:05,847 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 17:38:05,848 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 17:38:05,848 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 17:38:05,848 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 17:38:05,849 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 17:38:05,849 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 17:38:05,849 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 17:38:05,850 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 17:38:05,850 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 17:38:05,850 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 17:38:05,851 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 17:38:05,851 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 17:38:05,851 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 17:38:05,851 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 17:38:05,851 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 17:38:05,852 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 17:38:05,852 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 17:38:05,852 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 17:38:05,852 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 17:38:05,852 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 17:38:05,853 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 17:38:05,853 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 17:38:05,853 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 17:38:05,853 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 17:38:05,853 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 17:38:05,854 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 17:38:05,855 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 17:38:05,855 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-20 17:38:05,855 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-20 17:38:05,855 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 17:38:05,855 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 17:38:05,856 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 17:38:05,856 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 -> 7e9492584c051c945baa3a1de8b03a2c00614fb076a66c88b26b81461b005eeb [2022-02-20 17:38:06,064 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 17:38:06,088 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 17:38:06,090 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 17:38:06,091 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 17:38:06,092 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 17:38:06,093 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/nla-digbench-scaling/prod4br-ll_unwindbound1.c [2022-02-20 17:38:06,160 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e2353b49e/586eddb6c602456e9d6158091ae8cb2f/FLAG4ea9aaa27 [2022-02-20 17:38:06,504 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 17:38:06,505 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/prod4br-ll_unwindbound1.c [2022-02-20 17:38:06,510 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e2353b49e/586eddb6c602456e9d6158091ae8cb2f/FLAG4ea9aaa27 [2022-02-20 17:38:06,938 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e2353b49e/586eddb6c602456e9d6158091ae8cb2f [2022-02-20 17:38:06,940 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 17:38:06,941 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 17:38:06,943 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 17:38:06,944 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 17:38:06,946 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 17:38:06,948 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 05:38:06" (1/1) ... [2022-02-20 17:38:06,949 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@74112057 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:38:06, skipping insertion in model container [2022-02-20 17:38:06,949 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 05:38:06" (1/1) ... [2022-02-20 17:38:06,956 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 17:38:06,970 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 17:38:07,114 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/prod4br-ll_unwindbound1.c[524,537] [2022-02-20 17:38:07,133 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 17:38:07,142 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 17:38:07,152 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/prod4br-ll_unwindbound1.c[524,537] [2022-02-20 17:38:07,161 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 17:38:07,175 INFO L208 MainTranslator]: Completed translation [2022-02-20 17:38:07,176 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:38:07 WrapperNode [2022-02-20 17:38:07,176 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 17:38:07,177 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 17:38:07,177 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 17:38:07,177 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 17:38:07,182 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:38:07" (1/1) ... [2022-02-20 17:38:07,186 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:38:07" (1/1) ... [2022-02-20 17:38:07,213 INFO L137 Inliner]: procedures = 14, calls = 11, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 59 [2022-02-20 17:38:07,213 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 17:38:07,214 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 17:38:07,214 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 17:38:07,214 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 17:38:07,221 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:38:07" (1/1) ... [2022-02-20 17:38:07,221 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:38:07" (1/1) ... [2022-02-20 17:38:07,222 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:38:07" (1/1) ... [2022-02-20 17:38:07,223 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:38:07" (1/1) ... [2022-02-20 17:38:07,227 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:38:07" (1/1) ... [2022-02-20 17:38:07,230 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:38:07" (1/1) ... [2022-02-20 17:38:07,231 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:38:07" (1/1) ... [2022-02-20 17:38:07,233 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 17:38:07,233 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 17:38:07,234 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 17:38:07,234 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 17:38:07,235 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:38:07" (1/1) ... [2022-02-20 17:38:07,242 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 17:38:07,254 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 17:38:07,264 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:38:07,266 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:38:07,292 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 17:38:07,292 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-20 17:38:07,293 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 17:38:07,293 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 17:38:07,293 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-02-20 17:38:07,293 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-02-20 17:38:07,335 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 17:38:07,336 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 17:38:07,496 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 17:38:07,502 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 17:38:07,502 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-02-20 17:38:07,504 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 05:38:07 BoogieIcfgContainer [2022-02-20 17:38:07,504 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 17:38:07,505 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 17:38:07,505 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 17:38:07,515 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 17:38:07,517 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 05:38:06" (1/3) ... [2022-02-20 17:38:07,517 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5d139b83 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 05:38:07, skipping insertion in model container [2022-02-20 17:38:07,518 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:38:07" (2/3) ... [2022-02-20 17:38:07,518 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5d139b83 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 05:38:07, skipping insertion in model container [2022-02-20 17:38:07,524 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 05:38:07" (3/3) ... [2022-02-20 17:38:07,526 INFO L111 eAbstractionObserver]: Analyzing ICFG prod4br-ll_unwindbound1.c [2022-02-20 17:38:07,530 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 17:38:07,533 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-02-20 17:38:07,610 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 17:38:07,615 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:38:07,615 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-02-20 17:38:07,631 INFO L276 IsEmpty]: Start isEmpty. Operand has 23 states, 17 states have (on average 1.5294117647058822) internal successors, (26), 18 states have internal predecessors, (26), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-20 17:38:07,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-02-20 17:38:07,635 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:38:07,635 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 17:38:07,636 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 17:38:07,640 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:38:07,641 INFO L85 PathProgramCache]: Analyzing trace with hash -563977895, now seen corresponding path program 1 times [2022-02-20 17:38:07,649 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 17:38:07,650 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [92231148] [2022-02-20 17:38:07,650 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:38:07,651 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 17:38:07,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:38:07,846 INFO L290 TraceCheckUtils]: 0: Hoare triple {26#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(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {26#true} is VALID [2022-02-20 17:38:07,847 INFO L290 TraceCheckUtils]: 1: Hoare triple {26#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~post6#1, main_~x~0#1, main_~y~0#1, main_~a~0#1, main_~b~0#1, main_~p~0#1, main_~q~0#1;havoc main_~x~0#1;havoc main_~y~0#1;havoc main_~a~0#1;havoc main_~b~0#1;havoc main_~p~0#1;havoc main_~q~0#1;assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;main_~x~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647;main_~y~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := (if main_~y~0#1 >= 1 then 1 else 0);havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {26#true} is VALID [2022-02-20 17:38:07,848 INFO L290 TraceCheckUtils]: 2: Hoare triple {26#true} assume 0 == assume_abort_if_not_~cond#1;assume false; {27#false} is VALID [2022-02-20 17:38:07,849 INFO L290 TraceCheckUtils]: 3: Hoare triple {27#false} assume { :end_inline_assume_abort_if_not } true;main_~a~0#1 := main_~x~0#1;main_~b~0#1 := main_~y~0#1;main_~p~0#1 := 1;main_~q~0#1 := 0; {27#false} is VALID [2022-02-20 17:38:07,849 INFO L290 TraceCheckUtils]: 4: Hoare triple {27#false} assume !true; {27#false} is VALID [2022-02-20 17:38:07,850 INFO L272 TraceCheckUtils]: 5: Hoare triple {27#false} call __VERIFIER_assert((if main_~q~0#1 == main_~x~0#1 * main_~y~0#1 then 1 else 0)); {27#false} is VALID [2022-02-20 17:38:07,850 INFO L290 TraceCheckUtils]: 6: Hoare triple {27#false} ~cond := #in~cond; {27#false} is VALID [2022-02-20 17:38:07,850 INFO L290 TraceCheckUtils]: 7: Hoare triple {27#false} assume 0 == ~cond; {27#false} is VALID [2022-02-20 17:38:07,851 INFO L290 TraceCheckUtils]: 8: Hoare triple {27#false} assume !false; {27#false} is VALID [2022-02-20 17:38:07,853 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:38:07,853 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 17:38:07,854 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [92231148] [2022-02-20 17:38:07,855 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [92231148] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 17:38:07,855 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 17:38:07,856 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-20 17:38:07,857 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [13486725] [2022-02-20 17:38:07,858 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 17:38:07,863 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 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 9 [2022-02-20 17:38:07,866 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 17:38:07,869 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 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:38:07,900 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 9 edges. 9 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:38:07,900 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-02-20 17:38:07,901 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 17:38:07,922 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-02-20 17:38:07,923 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-02-20 17:38:07,926 INFO L87 Difference]: Start difference. First operand has 23 states, 17 states have (on average 1.5294117647058822) internal successors, (26), 18 states have internal predecessors, (26), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 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:38:08,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:38:08,009 INFO L93 Difference]: Finished difference Result 43 states and 63 transitions. [2022-02-20 17:38:08,010 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-20 17:38:08,010 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 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 9 [2022-02-20 17:38:08,011 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 17:38:08,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 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:38:08,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 63 transitions. [2022-02-20 17:38:08,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 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:38:08,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 63 transitions. [2022-02-20 17:38:08,034 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 63 transitions. [2022-02-20 17:38:08,126 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 63 edges. 63 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:38:08,137 INFO L225 Difference]: With dead ends: 43 [2022-02-20 17:38:08,137 INFO L226 Difference]: Without dead ends: 19 [2022-02-20 17:38:08,140 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:38:08,144 INFO L933 BasicCegarLoop]: 29 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, 29 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:38:08,145 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 17:38:08,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2022-02-20 17:38:08,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2022-02-20 17:38:08,174 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 17:38:08,175 INFO L82 GeneralOperation]: Start isEquivalent. First operand 19 states. Second operand has 19 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 15 states have internal predecessors, (20), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 17:38:08,176 INFO L74 IsIncluded]: Start isIncluded. First operand 19 states. Second operand has 19 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 15 states have internal predecessors, (20), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 17:38:08,176 INFO L87 Difference]: Start difference. First operand 19 states. Second operand has 19 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 15 states have internal predecessors, (20), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 17:38:08,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:38:08,182 INFO L93 Difference]: Finished difference Result 19 states and 25 transitions. [2022-02-20 17:38:08,183 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 25 transitions. [2022-02-20 17:38:08,183 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:38:08,183 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:38:08,184 INFO L74 IsIncluded]: Start isIncluded. First operand has 19 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 15 states have internal predecessors, (20), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 19 states. [2022-02-20 17:38:08,186 INFO L87 Difference]: Start difference. First operand has 19 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 15 states have internal predecessors, (20), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 19 states. [2022-02-20 17:38:08,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:38:08,189 INFO L93 Difference]: Finished difference Result 19 states and 25 transitions. [2022-02-20 17:38:08,189 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 25 transitions. [2022-02-20 17:38:08,190 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:38:08,190 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:38:08,190 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 17:38:08,191 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 17:38:08,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 15 states have internal predecessors, (20), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 17:38:08,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 25 transitions. [2022-02-20 17:38:08,197 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 25 transitions. Word has length 9 [2022-02-20 17:38:08,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 17:38:08,197 INFO L470 AbstractCegarLoop]: Abstraction has 19 states and 25 transitions. [2022-02-20 17:38:08,198 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 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:38:08,198 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 25 transitions. [2022-02-20 17:38:08,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-02-20 17:38:08,199 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:38:08,200 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 17:38:08,200 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-20 17:38:08,200 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 17:38:08,204 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:38:08,204 INFO L85 PathProgramCache]: Analyzing trace with hash -1986058659, now seen corresponding path program 1 times [2022-02-20 17:38:08,205 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 17:38:08,206 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1872650178] [2022-02-20 17:38:08,208 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:38:08,208 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 17:38:08,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:38:08,276 INFO L290 TraceCheckUtils]: 0: Hoare triple {147#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(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {149#(= ~counter~0 0)} is VALID [2022-02-20 17:38:08,277 INFO L290 TraceCheckUtils]: 1: Hoare triple {149#(= ~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~nondet5#1, main_#t~post6#1, main_~x~0#1, main_~y~0#1, main_~a~0#1, main_~b~0#1, main_~p~0#1, main_~q~0#1;havoc main_~x~0#1;havoc main_~y~0#1;havoc main_~a~0#1;havoc main_~b~0#1;havoc main_~p~0#1;havoc main_~q~0#1;assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;main_~x~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647;main_~y~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := (if main_~y~0#1 >= 1 then 1 else 0);havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {149#(= ~counter~0 0)} is VALID [2022-02-20 17:38:08,278 INFO L290 TraceCheckUtils]: 2: Hoare triple {149#(= ~counter~0 0)} assume !(0 == assume_abort_if_not_~cond#1); {149#(= ~counter~0 0)} is VALID [2022-02-20 17:38:08,278 INFO L290 TraceCheckUtils]: 3: Hoare triple {149#(= ~counter~0 0)} assume { :end_inline_assume_abort_if_not } true;main_~a~0#1 := main_~x~0#1;main_~b~0#1 := main_~y~0#1;main_~p~0#1 := 1;main_~q~0#1 := 0; {149#(= ~counter~0 0)} is VALID [2022-02-20 17:38:08,279 INFO L290 TraceCheckUtils]: 4: Hoare triple {149#(= ~counter~0 0)} main_#t~post6#1 := ~counter~0;~counter~0 := 1 + main_#t~post6#1; {150#(= |ULTIMATE.start_main_#t~post6#1| 0)} is VALID [2022-02-20 17:38:08,280 INFO L290 TraceCheckUtils]: 5: Hoare triple {150#(= |ULTIMATE.start_main_#t~post6#1| 0)} assume !(main_#t~post6#1 < 1);havoc main_#t~post6#1; {148#false} is VALID [2022-02-20 17:38:08,280 INFO L272 TraceCheckUtils]: 6: Hoare triple {148#false} call __VERIFIER_assert((if main_~q~0#1 == main_~x~0#1 * main_~y~0#1 then 1 else 0)); {148#false} is VALID [2022-02-20 17:38:08,280 INFO L290 TraceCheckUtils]: 7: Hoare triple {148#false} ~cond := #in~cond; {148#false} is VALID [2022-02-20 17:38:08,281 INFO L290 TraceCheckUtils]: 8: Hoare triple {148#false} assume 0 == ~cond; {148#false} is VALID [2022-02-20 17:38:08,281 INFO L290 TraceCheckUtils]: 9: Hoare triple {148#false} assume !false; {148#false} is VALID [2022-02-20 17:38:08,281 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:38:08,281 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 17:38:08,282 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1872650178] [2022-02-20 17:38:08,282 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1872650178] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 17:38:08,282 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 17:38:08,282 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 17:38:08,282 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [77021083] [2022-02-20 17:38:08,283 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 17:38:08,284 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:38:08,284 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 17:38:08,284 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:38:08,293 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:38:08,294 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-20 17:38:08,294 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 17:38:08,295 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-20 17:38:08,295 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-20 17:38:08,295 INFO L87 Difference]: Start difference. First operand 19 states and 25 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:38:08,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:38:08,355 INFO L93 Difference]: Finished difference Result 29 states and 36 transitions. [2022-02-20 17:38:08,355 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-20 17:38:08,355 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:38:08,356 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 17:38:08,356 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:38:08,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 36 transitions. [2022-02-20 17:38:08,358 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:38:08,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 36 transitions. [2022-02-20 17:38:08,359 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 36 transitions. [2022-02-20 17:38:08,392 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 36 edges. 36 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:38:08,393 INFO L225 Difference]: With dead ends: 29 [2022-02-20 17:38:08,393 INFO L226 Difference]: Without dead ends: 21 [2022-02-20 17:38:08,394 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:38:08,395 INFO L933 BasicCegarLoop]: 23 mSDtfsCounter, 0 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 63 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 17:38:08,395 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 63 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 17:38:08,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2022-02-20 17:38:08,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2022-02-20 17:38:08,399 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 17:38:08,399 INFO L82 GeneralOperation]: Start isEquivalent. First operand 21 states. Second operand has 21 states, 16 states have (on average 1.375) internal successors, (22), 17 states have internal predecessors, (22), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 17:38:08,399 INFO L74 IsIncluded]: Start isIncluded. First operand 21 states. Second operand has 21 states, 16 states have (on average 1.375) internal successors, (22), 17 states have internal predecessors, (22), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 17:38:08,400 INFO L87 Difference]: Start difference. First operand 21 states. Second operand has 21 states, 16 states have (on average 1.375) internal successors, (22), 17 states have internal predecessors, (22), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 17:38:08,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:38:08,401 INFO L93 Difference]: Finished difference Result 21 states and 27 transitions. [2022-02-20 17:38:08,402 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 27 transitions. [2022-02-20 17:38:08,402 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:38:08,402 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:38:08,403 INFO L74 IsIncluded]: Start isIncluded. First operand has 21 states, 16 states have (on average 1.375) internal successors, (22), 17 states have internal predecessors, (22), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 21 states. [2022-02-20 17:38:08,403 INFO L87 Difference]: Start difference. First operand has 21 states, 16 states have (on average 1.375) internal successors, (22), 17 states have internal predecessors, (22), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 21 states. [2022-02-20 17:38:08,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:38:08,405 INFO L93 Difference]: Finished difference Result 21 states and 27 transitions. [2022-02-20 17:38:08,405 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 27 transitions. [2022-02-20 17:38:08,405 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:38:08,406 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:38:08,406 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 17:38:08,406 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 17:38:08,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 16 states have (on average 1.375) internal successors, (22), 17 states have internal predecessors, (22), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 17:38:08,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 27 transitions. [2022-02-20 17:38:08,412 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 27 transitions. Word has length 10 [2022-02-20 17:38:08,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 17:38:08,413 INFO L470 AbstractCegarLoop]: Abstraction has 21 states and 27 transitions. [2022-02-20 17:38:08,413 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:38:08,413 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 27 transitions. [2022-02-20 17:38:08,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-02-20 17:38:08,414 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:38:08,414 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 17:38:08,414 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-02-20 17:38:08,414 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 17:38:08,415 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:38:08,415 INFO L85 PathProgramCache]: Analyzing trace with hash -1984271199, now seen corresponding path program 1 times [2022-02-20 17:38:08,415 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 17:38:08,415 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [932602827] [2022-02-20 17:38:08,416 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:38:08,416 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 17:38:08,431 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-20 17:38:08,431 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2064805856] [2022-02-20 17:38:08,431 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:38:08,432 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 17:38:08,432 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 17:38:08,439 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:38:08,472 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:38:08,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:38:08,495 INFO L263 TraceCheckSpWp]: Trace formula consists of 58 conjuncts, 11 conjunts are in the unsatisfiable core [2022-02-20 17:38:08,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:38:08,518 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 17:38:08,681 INFO L290 TraceCheckUtils]: 0: Hoare triple {260#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(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {260#true} is VALID [2022-02-20 17:38:08,682 INFO L290 TraceCheckUtils]: 1: Hoare triple {260#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~post6#1, main_~x~0#1, main_~y~0#1, main_~a~0#1, main_~b~0#1, main_~p~0#1, main_~q~0#1;havoc main_~x~0#1;havoc main_~y~0#1;havoc main_~a~0#1;havoc main_~b~0#1;havoc main_~p~0#1;havoc main_~q~0#1;assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;main_~x~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647;main_~y~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := (if main_~y~0#1 >= 1 then 1 else 0);havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {260#true} is VALID [2022-02-20 17:38:08,682 INFO L290 TraceCheckUtils]: 2: Hoare triple {260#true} assume !(0 == assume_abort_if_not_~cond#1); {260#true} is VALID [2022-02-20 17:38:08,683 INFO L290 TraceCheckUtils]: 3: Hoare triple {260#true} assume { :end_inline_assume_abort_if_not } true;main_~a~0#1 := main_~x~0#1;main_~b~0#1 := main_~y~0#1;main_~p~0#1 := 1;main_~q~0#1 := 0; {274#(and (= |ULTIMATE.start_main_~p~0#1| 1) (= |ULTIMATE.start_main_~b~0#1| |ULTIMATE.start_main_~y~0#1|) (= |ULTIMATE.start_main_~q~0#1| 0) (= |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~x~0#1|))} is VALID [2022-02-20 17:38:08,684 INFO L290 TraceCheckUtils]: 4: Hoare triple {274#(and (= |ULTIMATE.start_main_~p~0#1| 1) (= |ULTIMATE.start_main_~b~0#1| |ULTIMATE.start_main_~y~0#1|) (= |ULTIMATE.start_main_~q~0#1| 0) (= |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~x~0#1|))} main_#t~post6#1 := ~counter~0;~counter~0 := 1 + main_#t~post6#1; {274#(and (= |ULTIMATE.start_main_~p~0#1| 1) (= |ULTIMATE.start_main_~b~0#1| |ULTIMATE.start_main_~y~0#1|) (= |ULTIMATE.start_main_~q~0#1| 0) (= |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~x~0#1|))} is VALID [2022-02-20 17:38:08,684 INFO L290 TraceCheckUtils]: 5: Hoare triple {274#(and (= |ULTIMATE.start_main_~p~0#1| 1) (= |ULTIMATE.start_main_~b~0#1| |ULTIMATE.start_main_~y~0#1|) (= |ULTIMATE.start_main_~q~0#1| 0) (= |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~x~0#1|))} assume !!(main_#t~post6#1 < 1);havoc main_#t~post6#1; {274#(and (= |ULTIMATE.start_main_~p~0#1| 1) (= |ULTIMATE.start_main_~b~0#1| |ULTIMATE.start_main_~y~0#1|) (= |ULTIMATE.start_main_~q~0#1| 0) (= |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~x~0#1|))} is VALID [2022-02-20 17:38:08,686 INFO L272 TraceCheckUtils]: 6: Hoare triple {274#(and (= |ULTIMATE.start_main_~p~0#1| 1) (= |ULTIMATE.start_main_~b~0#1| |ULTIMATE.start_main_~y~0#1|) (= |ULTIMATE.start_main_~q~0#1| 0) (= |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~x~0#1|))} call __VERIFIER_assert((if main_~q~0#1 + main_~a~0#1 * main_~b~0#1 * main_~p~0#1 == main_~x~0#1 * main_~y~0#1 then 1 else 0)); {284#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-02-20 17:38:08,687 INFO L290 TraceCheckUtils]: 7: Hoare triple {284#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {288#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-02-20 17:38:08,687 INFO L290 TraceCheckUtils]: 8: Hoare triple {288#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {261#false} is VALID [2022-02-20 17:38:08,687 INFO L290 TraceCheckUtils]: 9: Hoare triple {261#false} assume !false; {261#false} is VALID [2022-02-20 17:38:08,688 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:38:08,688 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 17:38:08,688 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 17:38:08,688 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [932602827] [2022-02-20 17:38:08,689 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-20 17:38:08,689 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2064805856] [2022-02-20 17:38:08,689 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2064805856] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 17:38:08,689 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 17:38:08,689 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 17:38:08,690 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [495663161] [2022-02-20 17:38:08,690 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 17:38:08,690 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 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:38:08,690 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 17:38:08,691 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 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:38:08,701 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:38:08,701 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 17:38:08,701 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 17:38:08,702 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 17:38:08,702 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 17:38:08,702 INFO L87 Difference]: Start difference. First operand 21 states and 27 transitions. Second operand has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 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:38:08,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:38:08,880 INFO L93 Difference]: Finished difference Result 34 states and 45 transitions. [2022-02-20 17:38:08,880 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 17:38:08,881 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 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:38:08,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 17:38:08,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 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:38:08,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 45 transitions. [2022-02-20 17:38:08,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 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:38:08,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 45 transitions. [2022-02-20 17:38:08,884 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 45 transitions. [2022-02-20 17:38:08,929 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 45 edges. 45 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:38:08,930 INFO L225 Difference]: With dead ends: 34 [2022-02-20 17:38:08,930 INFO L226 Difference]: Without dead ends: 32 [2022-02-20 17:38:08,931 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 6 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:38:08,932 INFO L933 BasicCegarLoop]: 16 mSDtfsCounter, 9 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 58 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 17:38:08,932 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [11 Valid, 58 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 17:38:08,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2022-02-20 17:38:08,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 26. [2022-02-20 17:38:08,937 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 17:38:08,937 INFO L82 GeneralOperation]: Start isEquivalent. First operand 32 states. Second operand has 26 states, 19 states have (on average 1.3157894736842106) internal successors, (25), 21 states have internal predecessors, (25), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-20 17:38:08,937 INFO L74 IsIncluded]: Start isIncluded. First operand 32 states. Second operand has 26 states, 19 states have (on average 1.3157894736842106) internal successors, (25), 21 states have internal predecessors, (25), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-20 17:38:08,938 INFO L87 Difference]: Start difference. First operand 32 states. Second operand has 26 states, 19 states have (on average 1.3157894736842106) internal successors, (25), 21 states have internal predecessors, (25), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-20 17:38:08,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:38:08,940 INFO L93 Difference]: Finished difference Result 32 states and 43 transitions. [2022-02-20 17:38:08,940 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 43 transitions. [2022-02-20 17:38:08,941 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:38:08,941 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:38:08,941 INFO L74 IsIncluded]: Start isIncluded. First operand has 26 states, 19 states have (on average 1.3157894736842106) internal successors, (25), 21 states have internal predecessors, (25), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) Second operand 32 states. [2022-02-20 17:38:08,941 INFO L87 Difference]: Start difference. First operand has 26 states, 19 states have (on average 1.3157894736842106) internal successors, (25), 21 states have internal predecessors, (25), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) Second operand 32 states. [2022-02-20 17:38:08,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:38:08,943 INFO L93 Difference]: Finished difference Result 32 states and 43 transitions. [2022-02-20 17:38:08,943 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 43 transitions. [2022-02-20 17:38:08,944 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:38:08,944 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:38:08,944 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 17:38:08,944 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 17:38:08,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 19 states have (on average 1.3157894736842106) internal successors, (25), 21 states have internal predecessors, (25), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-20 17:38:08,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 32 transitions. [2022-02-20 17:38:08,946 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 32 transitions. Word has length 10 [2022-02-20 17:38:08,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 17:38:08,947 INFO L470 AbstractCegarLoop]: Abstraction has 26 states and 32 transitions. [2022-02-20 17:38:08,947 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 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:38:08,947 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 32 transitions. [2022-02-20 17:38:08,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-02-20 17:38:08,947 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:38:08,948 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 17:38:08,978 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:38:09,171 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 17:38:09,171 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 17:38:09,172 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:38:09,172 INFO L85 PathProgramCache]: Analyzing trace with hash -1194524114, now seen corresponding path program 1 times [2022-02-20 17:38:09,172 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 17:38:09,172 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1639792077] [2022-02-20 17:38:09,172 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:38:09,173 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 17:38:09,192 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-20 17:38:09,192 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [523020432] [2022-02-20 17:38:09,193 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:38:09,193 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 17:38:09,193 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 17:38:09,196 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:38:09,197 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:38:09,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:38:09,231 INFO L263 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 15 conjunts are in the unsatisfiable core [2022-02-20 17:38:09,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:38:09,242 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 17:38:19,833 INFO L290 TraceCheckUtils]: 0: Hoare triple {438#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(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {438#true} is VALID [2022-02-20 17:38:19,834 INFO L290 TraceCheckUtils]: 1: Hoare triple {438#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~post6#1, main_~x~0#1, main_~y~0#1, main_~a~0#1, main_~b~0#1, main_~p~0#1, main_~q~0#1;havoc main_~x~0#1;havoc main_~y~0#1;havoc main_~a~0#1;havoc main_~b~0#1;havoc main_~p~0#1;havoc main_~q~0#1;assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;main_~x~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647;main_~y~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := (if main_~y~0#1 >= 1 then 1 else 0);havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {446#(or (and (not (<= 1 |ULTIMATE.start_main_~y~0#1|)) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (and (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (<= 1 |ULTIMATE.start_main_~y~0#1|)))} is VALID [2022-02-20 17:38:19,835 INFO L290 TraceCheckUtils]: 2: Hoare triple {446#(or (and (not (<= 1 |ULTIMATE.start_main_~y~0#1|)) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (and (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (<= 1 |ULTIMATE.start_main_~y~0#1|)))} assume !(0 == assume_abort_if_not_~cond#1); {450#(<= 1 |ULTIMATE.start_main_~y~0#1|)} is VALID [2022-02-20 17:38:19,836 INFO L290 TraceCheckUtils]: 3: Hoare triple {450#(<= 1 |ULTIMATE.start_main_~y~0#1|)} assume { :end_inline_assume_abort_if_not } true;main_~a~0#1 := main_~x~0#1;main_~b~0#1 := main_~y~0#1;main_~p~0#1 := 1;main_~q~0#1 := 0; {454#(and (<= 1 |ULTIMATE.start_main_~y~0#1|) (<= |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~b~0#1|))} is VALID [2022-02-20 17:38:19,836 INFO L290 TraceCheckUtils]: 4: Hoare triple {454#(and (<= 1 |ULTIMATE.start_main_~y~0#1|) (<= |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~b~0#1|))} main_#t~post6#1 := ~counter~0;~counter~0 := 1 + main_#t~post6#1; {454#(and (<= 1 |ULTIMATE.start_main_~y~0#1|) (<= |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~b~0#1|))} is VALID [2022-02-20 17:38:19,837 INFO L290 TraceCheckUtils]: 5: Hoare triple {454#(and (<= 1 |ULTIMATE.start_main_~y~0#1|) (<= |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~b~0#1|))} assume !!(main_#t~post6#1 < 1);havoc main_#t~post6#1; {454#(and (<= 1 |ULTIMATE.start_main_~y~0#1|) (<= |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~b~0#1|))} is VALID [2022-02-20 17:38:19,837 INFO L272 TraceCheckUtils]: 6: Hoare triple {454#(and (<= 1 |ULTIMATE.start_main_~y~0#1|) (<= |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~b~0#1|))} call __VERIFIER_assert((if main_~q~0#1 + main_~a~0#1 * main_~b~0#1 * main_~p~0#1 == main_~x~0#1 * main_~y~0#1 then 1 else 0)); {438#true} is VALID [2022-02-20 17:38:19,838 INFO L290 TraceCheckUtils]: 7: Hoare triple {438#true} ~cond := #in~cond; {467#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-02-20 17:38:19,838 INFO L290 TraceCheckUtils]: 8: Hoare triple {467#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {471#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-02-20 17:38:19,839 INFO L290 TraceCheckUtils]: 9: Hoare triple {471#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {471#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-02-20 17:38:21,842 WARN L284 TraceCheckUtils]: 10: Hoare quadruple {471#(not (= |__VERIFIER_assert_#in~cond| 0))} {454#(and (<= 1 |ULTIMATE.start_main_~y~0#1|) (<= |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~b~0#1|))} #63#return; {478#(and (<= 1 |ULTIMATE.start_main_~y~0#1|) (<= |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~b~0#1|) (or (= (+ (* (- 1) |ULTIMATE.start_main_~q~0#1|) (* |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~y~0#1|)) 0) (and (not (= |ULTIMATE.start_main_~a~0#1| 0)) (= (mod (+ (* (- 1) |ULTIMATE.start_main_~q~0#1|) (* |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~y~0#1|)) (* |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~b~0#1|)) 0))))} is UNKNOWN [2022-02-20 17:38:21,843 INFO L290 TraceCheckUtils]: 11: Hoare triple {478#(and (<= 1 |ULTIMATE.start_main_~y~0#1|) (<= |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~b~0#1|) (or (= (+ (* (- 1) |ULTIMATE.start_main_~q~0#1|) (* |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~y~0#1|)) 0) (and (not (= |ULTIMATE.start_main_~a~0#1| 0)) (= (mod (+ (* (- 1) |ULTIMATE.start_main_~q~0#1|) (* |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~y~0#1|)) (* |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~b~0#1|)) 0))))} assume !(0 != main_~a~0#1 && 0 != main_~b~0#1); {482#(and (<= 1 |ULTIMATE.start_main_~y~0#1|) (= (+ (* (- 1) |ULTIMATE.start_main_~q~0#1|) (* |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~y~0#1|)) 0))} is VALID [2022-02-20 17:38:21,844 INFO L272 TraceCheckUtils]: 12: Hoare triple {482#(and (<= 1 |ULTIMATE.start_main_~y~0#1|) (= (+ (* (- 1) |ULTIMATE.start_main_~q~0#1|) (* |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~y~0#1|)) 0))} call __VERIFIER_assert((if main_~q~0#1 == main_~x~0#1 * main_~y~0#1 then 1 else 0)); {486#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-02-20 17:38:21,845 INFO L290 TraceCheckUtils]: 13: Hoare triple {486#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {490#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-02-20 17:38:21,845 INFO L290 TraceCheckUtils]: 14: Hoare triple {490#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {439#false} is VALID [2022-02-20 17:38:21,845 INFO L290 TraceCheckUtils]: 15: Hoare triple {439#false} assume !false; {439#false} is VALID [2022-02-20 17:38:21,845 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 17:38:21,846 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 17:38:36,010 INFO L290 TraceCheckUtils]: 15: Hoare triple {439#false} assume !false; {439#false} is VALID [2022-02-20 17:38:36,011 INFO L290 TraceCheckUtils]: 14: Hoare triple {490#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {439#false} is VALID [2022-02-20 17:38:36,011 INFO L290 TraceCheckUtils]: 13: Hoare triple {486#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {490#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-02-20 17:38:36,012 INFO L272 TraceCheckUtils]: 12: Hoare triple {506#(= |ULTIMATE.start_main_~q~0#1| (* |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~y~0#1|))} call __VERIFIER_assert((if main_~q~0#1 == main_~x~0#1 * main_~y~0#1 then 1 else 0)); {486#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-02-20 17:38:36,013 INFO L290 TraceCheckUtils]: 11: Hoare triple {510#(or (= |ULTIMATE.start_main_~q~0#1| (* |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~y~0#1|)) (and (not (= |ULTIMATE.start_main_~b~0#1| 0)) (not (= |ULTIMATE.start_main_~a~0#1| 0))))} assume !(0 != main_~a~0#1 && 0 != main_~b~0#1); {506#(= |ULTIMATE.start_main_~q~0#1| (* |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~y~0#1|))} is VALID [2022-02-20 17:38:36,015 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {471#(not (= |__VERIFIER_assert_#in~cond| 0))} {438#true} #63#return; {510#(or (= |ULTIMATE.start_main_~q~0#1| (* |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~y~0#1|)) (and (not (= |ULTIMATE.start_main_~b~0#1| 0)) (not (= |ULTIMATE.start_main_~a~0#1| 0))))} is VALID [2022-02-20 17:38:36,015 INFO L290 TraceCheckUtils]: 9: Hoare triple {471#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {471#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-02-20 17:38:36,016 INFO L290 TraceCheckUtils]: 8: Hoare triple {523#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {471#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-02-20 17:38:36,017 INFO L290 TraceCheckUtils]: 7: Hoare triple {438#true} ~cond := #in~cond; {523#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-02-20 17:38:36,017 INFO L272 TraceCheckUtils]: 6: Hoare triple {438#true} call __VERIFIER_assert((if main_~q~0#1 + main_~a~0#1 * main_~b~0#1 * main_~p~0#1 == main_~x~0#1 * main_~y~0#1 then 1 else 0)); {438#true} is VALID [2022-02-20 17:38:36,017 INFO L290 TraceCheckUtils]: 5: Hoare triple {438#true} assume !!(main_#t~post6#1 < 1);havoc main_#t~post6#1; {438#true} is VALID [2022-02-20 17:38:36,017 INFO L290 TraceCheckUtils]: 4: Hoare triple {438#true} main_#t~post6#1 := ~counter~0;~counter~0 := 1 + main_#t~post6#1; {438#true} is VALID [2022-02-20 17:38:36,017 INFO L290 TraceCheckUtils]: 3: Hoare triple {438#true} assume { :end_inline_assume_abort_if_not } true;main_~a~0#1 := main_~x~0#1;main_~b~0#1 := main_~y~0#1;main_~p~0#1 := 1;main_~q~0#1 := 0; {438#true} is VALID [2022-02-20 17:38:36,018 INFO L290 TraceCheckUtils]: 2: Hoare triple {438#true} assume !(0 == assume_abort_if_not_~cond#1); {438#true} is VALID [2022-02-20 17:38:36,018 INFO L290 TraceCheckUtils]: 1: Hoare triple {438#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~post6#1, main_~x~0#1, main_~y~0#1, main_~a~0#1, main_~b~0#1, main_~p~0#1, main_~q~0#1;havoc main_~x~0#1;havoc main_~y~0#1;havoc main_~a~0#1;havoc main_~b~0#1;havoc main_~p~0#1;havoc main_~q~0#1;assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;main_~x~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647;main_~y~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := (if main_~y~0#1 >= 1 then 1 else 0);havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {438#true} is VALID [2022-02-20 17:38:36,018 INFO L290 TraceCheckUtils]: 0: Hoare triple {438#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(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {438#true} is VALID [2022-02-20 17:38:36,018 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 17:38:36,018 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 17:38:36,019 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1639792077] [2022-02-20 17:38:36,019 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-20 17:38:36,019 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [523020432] [2022-02-20 17:38:36,019 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [523020432] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 17:38:36,019 INFO L191 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-02-20 17:38:36,019 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 8] total 14 [2022-02-20 17:38:36,020 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1024874206] [2022-02-20 17:38:36,020 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-02-20 17:38:36,021 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 12 states have (on average 1.75) internal successors, (21), 11 states have internal predecessors, (21), 4 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 16 [2022-02-20 17:38:36,021 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 17:38:36,021 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 14 states, 12 states have (on average 1.75) internal successors, (21), 11 states have internal predecessors, (21), 4 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 17:38:38,052 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 26 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-02-20 17:38:38,052 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-02-20 17:38:38,052 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 17:38:38,053 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-02-20 17:38:38,053 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=145, Unknown=0, NotChecked=0, Total=182 [2022-02-20 17:38:38,053 INFO L87 Difference]: Start difference. First operand 26 states and 32 transitions. Second operand has 14 states, 12 states have (on average 1.75) internal successors, (21), 11 states have internal predecessors, (21), 4 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 17:38:40,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:38:40,046 INFO L93 Difference]: Finished difference Result 47 states and 64 transitions. [2022-02-20 17:38:40,046 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-02-20 17:38:40,046 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 12 states have (on average 1.75) internal successors, (21), 11 states have internal predecessors, (21), 4 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 16 [2022-02-20 17:38:40,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 17:38:40,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 12 states have (on average 1.75) internal successors, (21), 11 states have internal predecessors, (21), 4 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 17:38:40,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 61 transitions. [2022-02-20 17:38:40,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 12 states have (on average 1.75) internal successors, (21), 11 states have internal predecessors, (21), 4 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 17:38:40,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 61 transitions. [2022-02-20 17:38:40,051 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 13 states and 61 transitions. [2022-02-20 17:38:42,128 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 61 edges. 60 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-02-20 17:38:42,130 INFO L225 Difference]: With dead ends: 47 [2022-02-20 17:38:42,130 INFO L226 Difference]: Without dead ends: 45 [2022-02-20 17:38:42,130 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 21 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=99, Invalid=363, Unknown=0, NotChecked=0, Total=462 [2022-02-20 17:38:42,131 INFO L933 BasicCegarLoop]: 13 mSDtfsCounter, 67 mSDsluCounter, 74 mSDsCounter, 0 mSdLazyCounter, 161 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 87 SdHoareTripleChecker+Invalid, 218 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 161 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-02-20 17:38:42,131 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [67 Valid, 87 Invalid, 218 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 161 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-02-20 17:38:42,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2022-02-20 17:38:42,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 31. [2022-02-20 17:38:42,148 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 17:38:42,148 INFO L82 GeneralOperation]: Start isEquivalent. First operand 45 states. Second operand has 31 states, 22 states have (on average 1.2727272727272727) internal successors, (28), 25 states have internal predecessors, (28), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (4), 2 states have call predecessors, (4), 4 states have call successors, (4) [2022-02-20 17:38:42,148 INFO L74 IsIncluded]: Start isIncluded. First operand 45 states. Second operand has 31 states, 22 states have (on average 1.2727272727272727) internal successors, (28), 25 states have internal predecessors, (28), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (4), 2 states have call predecessors, (4), 4 states have call successors, (4) [2022-02-20 17:38:42,149 INFO L87 Difference]: Start difference. First operand 45 states. Second operand has 31 states, 22 states have (on average 1.2727272727272727) internal successors, (28), 25 states have internal predecessors, (28), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (4), 2 states have call predecessors, (4), 4 states have call successors, (4) [2022-02-20 17:38:42,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:38:42,151 INFO L93 Difference]: Finished difference Result 45 states and 62 transitions. [2022-02-20 17:38:42,152 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 62 transitions. [2022-02-20 17:38:42,152 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:38:42,152 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:38:42,153 INFO L74 IsIncluded]: Start isIncluded. First operand has 31 states, 22 states have (on average 1.2727272727272727) internal successors, (28), 25 states have internal predecessors, (28), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (4), 2 states have call predecessors, (4), 4 states have call successors, (4) Second operand 45 states. [2022-02-20 17:38:42,153 INFO L87 Difference]: Start difference. First operand has 31 states, 22 states have (on average 1.2727272727272727) internal successors, (28), 25 states have internal predecessors, (28), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (4), 2 states have call predecessors, (4), 4 states have call successors, (4) Second operand 45 states. [2022-02-20 17:38:42,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:38:42,156 INFO L93 Difference]: Finished difference Result 45 states and 62 transitions. [2022-02-20 17:38:42,156 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 62 transitions. [2022-02-20 17:38:42,157 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:38:42,157 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:38:42,157 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 17:38:42,157 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 17:38:42,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 22 states have (on average 1.2727272727272727) internal successors, (28), 25 states have internal predecessors, (28), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (4), 2 states have call predecessors, (4), 4 states have call successors, (4) [2022-02-20 17:38:42,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 37 transitions. [2022-02-20 17:38:42,159 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 37 transitions. Word has length 16 [2022-02-20 17:38:42,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 17:38:42,159 INFO L470 AbstractCegarLoop]: Abstraction has 31 states and 37 transitions. [2022-02-20 17:38:42,159 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 12 states have (on average 1.75) internal successors, (21), 11 states have internal predecessors, (21), 4 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 17:38:42,160 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 37 transitions. [2022-02-20 17:38:42,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-02-20 17:38:42,160 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:38:42,160 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 17:38:42,184 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:38:42,361 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,SelfDestructingSolverStorable3 [2022-02-20 17:38:42,361 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 17:38:42,362 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:38:42,362 INFO L85 PathProgramCache]: Analyzing trace with hash -1756733383, now seen corresponding path program 1 times [2022-02-20 17:38:42,362 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 17:38:42,362 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1181369421] [2022-02-20 17:38:42,362 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:38:42,363 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 17:38:42,378 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-20 17:38:42,380 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [732511347] [2022-02-20 17:38:42,380 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:38:42,380 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 17:38:42,381 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 17:38:42,382 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:38:42,393 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:38:42,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-20 17:38:42,427 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-20 17:38:42,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-20 17:38:42,450 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-20 17:38:42,451 INFO L628 BasicCegarLoop]: Counterexample is feasible [2022-02-20 17:38:42,452 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-02-20 17:38:42,478 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:38:42,675 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 17:38:42,678 INFO L732 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2022-02-20 17:38:42,680 INFO L180 ceAbstractionStarter]: Computing trace abstraction results [2022-02-20 17:38:42,693 FATAL L489 DefaultTranslator]: Callstack has procedure call flag but succeeding procedure is empty at [CALL] call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); [2022-02-20 17:38:42,694 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:38:42,696 INFO L158 Benchmark]: Toolchain (without parser) took 35755.18ms. Allocated memory was 94.4MB in the beginning and 117.4MB in the end (delta: 23.1MB). Free memory was 64.0MB in the beginning and 51.1MB in the end (delta: 12.9MB). Peak memory consumption was 36.0MB. Max. memory is 16.1GB. [2022-02-20 17:38:42,700 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 94.4MB. Free memory is still 49.1MB. There was no memory consumed. Max. memory is 16.1GB. [2022-02-20 17:38:42,700 INFO L158 Benchmark]: CACSL2BoogieTranslator took 232.69ms. Allocated memory is still 94.4MB. Free memory was 63.7MB in the beginning and 69.3MB in the end (delta: -5.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-02-20 17:38:42,701 INFO L158 Benchmark]: Boogie Procedure Inliner took 36.51ms. Allocated memory is still 94.4MB. Free memory was 69.3MB in the beginning and 67.6MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-20 17:38:42,701 INFO L158 Benchmark]: Boogie Preprocessor took 19.20ms. Allocated memory is still 94.4MB. Free memory was 67.6MB in the beginning and 66.5MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2022-02-20 17:38:42,701 INFO L158 Benchmark]: RCFGBuilder took 270.73ms. Allocated memory is still 94.4MB. Free memory was 66.2MB in the beginning and 54.3MB in the end (delta: 11.9MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2022-02-20 17:38:42,702 INFO L158 Benchmark]: TraceAbstraction took 35190.21ms. Allocated memory was 94.4MB in the beginning and 117.4MB in the end (delta: 23.1MB). Free memory was 53.7MB in the beginning and 51.1MB in the end (delta: 2.6MB). Peak memory consumption was 28.7MB. Max. memory is 16.1GB. [2022-02-20 17:38:42,703 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.11ms. Allocated memory is still 94.4MB. Free memory is still 49.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 232.69ms. Allocated memory is still 94.4MB. Free memory was 63.7MB in the beginning and 69.3MB in the end (delta: -5.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 36.51ms. Allocated memory is still 94.4MB. Free memory was 69.3MB in the beginning and 67.6MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 19.20ms. Allocated memory is still 94.4MB. Free memory was 67.6MB in the beginning and 66.5MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 270.73ms. Allocated memory is still 94.4MB. Free memory was 66.2MB in the beginning and 54.3MB in the end (delta: 11.9MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * TraceAbstraction took 35190.21ms. Allocated memory was 94.4MB in the beginning and 117.4MB in the end (delta: 23.1MB). Free memory was 53.7MB in the beginning and 51.1MB in the end (delta: 2.6MB). Peak memory consumption was 28.7MB. 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:38:42,726 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -ea -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/nla-digbench-scaling/prod4br-ll_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 7e9492584c051c945baa3a1de8b03a2c00614fb076a66c88b26b81461b005eeb --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 17:38:44,519 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 17:38:44,522 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 17:38:44,558 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 17:38:44,558 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 17:38:44,560 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 17:38:44,563 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 17:38:44,568 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 17:38:44,570 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 17:38:44,575 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 17:38:44,582 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 17:38:44,586 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 17:38:44,586 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 17:38:44,589 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 17:38:44,590 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 17:38:44,591 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 17:38:44,592 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 17:38:44,593 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 17:38:44,596 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 17:38:44,602 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 17:38:44,603 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 17:38:44,604 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 17:38:44,605 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 17:38:44,606 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 17:38:44,609 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 17:38:44,609 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 17:38:44,609 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 17:38:44,611 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 17:38:44,611 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 17:38:44,612 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 17:38:44,612 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 17:38:44,613 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 17:38:44,614 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 17:38:44,615 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 17:38:44,616 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 17:38:44,616 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 17:38:44,617 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 17:38:44,617 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 17:38:44,618 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 17:38:44,619 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 17:38:44,620 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 17:38:44,620 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:38:44,655 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 17:38:44,655 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 17:38:44,656 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 17:38:44,657 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 17:38:44,657 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 17:38:44,658 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 17:38:44,659 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 17:38:44,659 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 17:38:44,659 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 17:38:44,659 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 17:38:44,660 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 17:38:44,660 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 17:38:44,660 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 17:38:44,661 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 17:38:44,661 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 17:38:44,661 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 17:38:44,661 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-02-20 17:38:44,661 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-02-20 17:38:44,662 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-02-20 17:38:44,662 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 17:38:44,662 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 17:38:44,662 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 17:38:44,662 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 17:38:44,662 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 17:38:44,663 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 17:38:44,663 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 17:38:44,663 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 17:38:44,663 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 17:38:44,663 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 17:38:44,664 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 17:38:44,664 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2022-02-20 17:38:44,664 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-02-20 17:38:44,664 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 17:38:44,664 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 17:38:44,665 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 17:38:44,665 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-02-20 17:38:44,665 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 -> 7e9492584c051c945baa3a1de8b03a2c00614fb076a66c88b26b81461b005eeb [2022-02-20 17:38:44,984 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 17:38:45,004 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 17:38:45,006 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 17:38:45,007 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 17:38:45,008 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 17:38:45,009 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/nla-digbench-scaling/prod4br-ll_unwindbound1.c [2022-02-20 17:38:45,060 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e4b096042/0ffa6ab61a294f5297b07284dec14810/FLAG5451b6833 [2022-02-20 17:38:45,519 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 17:38:45,519 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/prod4br-ll_unwindbound1.c [2022-02-20 17:38:45,525 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e4b096042/0ffa6ab61a294f5297b07284dec14810/FLAG5451b6833 [2022-02-20 17:38:45,545 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e4b096042/0ffa6ab61a294f5297b07284dec14810 [2022-02-20 17:38:45,548 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 17:38:45,550 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 17:38:45,552 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 17:38:45,553 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 17:38:45,556 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 17:38:45,557 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 05:38:45" (1/1) ... [2022-02-20 17:38:45,558 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2417d906 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:38:45, skipping insertion in model container [2022-02-20 17:38:45,558 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 05:38:45" (1/1) ... [2022-02-20 17:38:45,564 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 17:38:45,579 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 17:38:45,712 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/prod4br-ll_unwindbound1.c[524,537] [2022-02-20 17:38:45,749 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 17:38:45,772 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 17:38:45,781 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/prod4br-ll_unwindbound1.c[524,537] [2022-02-20 17:38:45,790 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 17:38:45,801 INFO L208 MainTranslator]: Completed translation [2022-02-20 17:38:45,801 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:38:45 WrapperNode [2022-02-20 17:38:45,801 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 17:38:45,802 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 17:38:45,802 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 17:38:45,802 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 17:38:45,808 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:38:45" (1/1) ... [2022-02-20 17:38:45,814 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:38:45" (1/1) ... [2022-02-20 17:38:45,831 INFO L137 Inliner]: procedures = 14, calls = 11, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 57 [2022-02-20 17:38:45,832 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 17:38:45,832 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 17:38:45,833 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 17:38:45,833 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 17:38:45,839 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:38:45" (1/1) ... [2022-02-20 17:38:45,839 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:38:45" (1/1) ... [2022-02-20 17:38:45,851 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:38:45" (1/1) ... [2022-02-20 17:38:45,851 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:38:45" (1/1) ... [2022-02-20 17:38:45,857 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:38:45" (1/1) ... [2022-02-20 17:38:45,861 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:38:45" (1/1) ... [2022-02-20 17:38:45,862 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:38:45" (1/1) ... [2022-02-20 17:38:45,864 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 17:38:45,865 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 17:38:45,865 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 17:38:45,865 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 17:38:45,865 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:38:45" (1/1) ... [2022-02-20 17:38:45,875 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 17:38:45,884 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 17:38:45,896 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:38:45,899 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:38:45,923 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 17:38:45,923 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-02-20 17:38:45,924 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 17:38:45,924 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 17:38:45,924 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-02-20 17:38:45,924 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-02-20 17:38:45,977 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 17:38:45,977 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 17:38:46,764 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 17:38:46,769 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 17:38:46,770 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-02-20 17:38:46,771 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 05:38:46 BoogieIcfgContainer [2022-02-20 17:38:46,771 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 17:38:46,773 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 17:38:46,773 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 17:38:46,775 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 17:38:46,776 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 05:38:45" (1/3) ... [2022-02-20 17:38:46,776 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7d55e4f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 05:38:46, skipping insertion in model container [2022-02-20 17:38:46,776 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:38:45" (2/3) ... [2022-02-20 17:38:46,777 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7d55e4f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 05:38:46, skipping insertion in model container [2022-02-20 17:38:46,777 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 05:38:46" (3/3) ... [2022-02-20 17:38:46,778 INFO L111 eAbstractionObserver]: Analyzing ICFG prod4br-ll_unwindbound1.c [2022-02-20 17:38:46,783 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 17:38:46,783 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-02-20 17:38:46,831 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 17:38:46,837 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2022-02-20 17:38:46,837 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-02-20 17:38:46,852 INFO L276 IsEmpty]: Start isEmpty. Operand has 23 states, 17 states have (on average 1.5294117647058822) internal successors, (26), 18 states have internal predecessors, (26), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-20 17:38:46,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-02-20 17:38:46,856 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:38:46,856 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 17:38:46,857 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 17:38:46,865 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:38:46,865 INFO L85 PathProgramCache]: Analyzing trace with hash -563977895, now seen corresponding path program 1 times [2022-02-20 17:38:46,876 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 17:38:46,877 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1333142078] [2022-02-20 17:38:46,877 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:38:46,878 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 17:38:46,878 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 17:38:46,883 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:38:46,888 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:38:46,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:38:46,976 INFO L263 TraceCheckSpWp]: Trace formula consists of 29 conjuncts, 1 conjunts are in the unsatisfiable core [2022-02-20 17:38:46,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:38:46,990 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 17:38:47,057 INFO L290 TraceCheckUtils]: 0: Hoare triple {26#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(13bv32, 2bv32);call #Ultimate.allocInit(12bv32, 3bv32);~counter~0 := 0bv32; {26#true} is VALID [2022-02-20 17:38:47,058 INFO L290 TraceCheckUtils]: 1: Hoare triple {26#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~post6#1, main_~x~0#1, main_~y~0#1, main_~a~0#1, main_~b~0#1, main_~p~0#1, main_~q~0#1;havoc main_~x~0#1;havoc main_~y~0#1;havoc main_~a~0#1;havoc main_~b~0#1;havoc main_~p~0#1;havoc main_~q~0#1;main_~x~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;main_~y~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := (if ~bvsge32(main_~y~0#1, 1bv32) then 1bv32 else 0bv32);havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {26#true} is VALID [2022-02-20 17:38:47,059 INFO L290 TraceCheckUtils]: 2: Hoare triple {26#true} assume 0bv32 == assume_abort_if_not_~cond#1;assume false; {27#false} is VALID [2022-02-20 17:38:47,059 INFO L290 TraceCheckUtils]: 3: Hoare triple {27#false} assume { :end_inline_assume_abort_if_not } true;main_~a~0#1 := ~sign_extendFrom32To64(main_~x~0#1);main_~b~0#1 := ~sign_extendFrom32To64(main_~y~0#1);main_~p~0#1 := 1bv64;main_~q~0#1 := 0bv64; {27#false} is VALID [2022-02-20 17:38:47,059 INFO L290 TraceCheckUtils]: 4: Hoare triple {27#false} assume !true; {27#false} is VALID [2022-02-20 17:38:47,059 INFO L272 TraceCheckUtils]: 5: Hoare triple {27#false} call __VERIFIER_assert((if main_~q~0#1 == ~bvmul64(~sign_extendFrom32To64(main_~x~0#1), ~sign_extendFrom32To64(main_~y~0#1)) then 1bv32 else 0bv32)); {27#false} is VALID [2022-02-20 17:38:47,060 INFO L290 TraceCheckUtils]: 6: Hoare triple {27#false} ~cond := #in~cond; {27#false} is VALID [2022-02-20 17:38:47,060 INFO L290 TraceCheckUtils]: 7: Hoare triple {27#false} assume 0bv32 == ~cond; {27#false} is VALID [2022-02-20 17:38:47,061 INFO L290 TraceCheckUtils]: 8: Hoare triple {27#false} assume !false; {27#false} is VALID [2022-02-20 17:38:47,062 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:38:47,062 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 17:38:47,063 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 17:38:47,064 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1333142078] [2022-02-20 17:38:47,064 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1333142078] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 17:38:47,065 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 17:38:47,065 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-20 17:38:47,066 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1855322616] [2022-02-20 17:38:47,067 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 17:38:47,071 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 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 9 [2022-02-20 17:38:47,072 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 17:38:47,074 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 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:38:47,111 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 9 edges. 9 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:38:47,112 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-02-20 17:38:47,112 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 17:38:47,132 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-02-20 17:38:47,132 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-02-20 17:38:47,135 INFO L87 Difference]: Start difference. First operand has 23 states, 17 states have (on average 1.5294117647058822) internal successors, (26), 18 states have internal predecessors, (26), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 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:38:48,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:38:48,572 INFO L93 Difference]: Finished difference Result 43 states and 63 transitions. [2022-02-20 17:38:48,573 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-20 17:38:48,573 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 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 9 [2022-02-20 17:38:48,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 17:38:48,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 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:38:48,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 63 transitions. [2022-02-20 17:38:48,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 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:38:48,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 63 transitions. [2022-02-20 17:38:48,593 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 63 transitions. [2022-02-20 17:38:49,599 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 63 edges. 63 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:38:49,605 INFO L225 Difference]: With dead ends: 43 [2022-02-20 17:38:49,605 INFO L226 Difference]: Without dead ends: 19 [2022-02-20 17:38:49,607 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-02-20 17:38:49,610 INFO L933 BasicCegarLoop]: 29 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, 29 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:38:49,611 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 17:38:49,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2022-02-20 17:38:49,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2022-02-20 17:38:49,633 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 17:38:49,634 INFO L82 GeneralOperation]: Start isEquivalent. First operand 19 states. Second operand has 19 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 15 states have internal predecessors, (20), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 17:38:49,634 INFO L74 IsIncluded]: Start isIncluded. First operand 19 states. Second operand has 19 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 15 states have internal predecessors, (20), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 17:38:49,635 INFO L87 Difference]: Start difference. First operand 19 states. Second operand has 19 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 15 states have internal predecessors, (20), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 17:38:49,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:38:49,638 INFO L93 Difference]: Finished difference Result 19 states and 25 transitions. [2022-02-20 17:38:49,638 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 25 transitions. [2022-02-20 17:38:49,638 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:38:49,639 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:38:49,639 INFO L74 IsIncluded]: Start isIncluded. First operand has 19 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 15 states have internal predecessors, (20), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 19 states. [2022-02-20 17:38:49,640 INFO L87 Difference]: Start difference. First operand has 19 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 15 states have internal predecessors, (20), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 19 states. [2022-02-20 17:38:49,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:38:49,642 INFO L93 Difference]: Finished difference Result 19 states and 25 transitions. [2022-02-20 17:38:49,642 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 25 transitions. [2022-02-20 17:38:49,643 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:38:49,643 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:38:49,643 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 17:38:49,643 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 17:38:49,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 15 states have internal predecessors, (20), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 17:38:49,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 25 transitions. [2022-02-20 17:38:49,647 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 25 transitions. Word has length 9 [2022-02-20 17:38:49,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 17:38:49,647 INFO L470 AbstractCegarLoop]: Abstraction has 19 states and 25 transitions. [2022-02-20 17:38:49,647 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 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:38:49,648 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 25 transitions. [2022-02-20 17:38:49,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-02-20 17:38:49,648 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:38:49,648 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 17:38:49,656 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2022-02-20 17:38:49,851 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:38:49,852 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 17:38:49,853 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:38:49,853 INFO L85 PathProgramCache]: Analyzing trace with hash -1986058659, now seen corresponding path program 1 times [2022-02-20 17:38:49,853 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 17:38:49,853 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [499912331] [2022-02-20 17:38:49,853 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:38:49,854 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 17:38:49,854 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 17:38:49,856 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:38:49,857 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:38:49,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:38:49,903 INFO L263 TraceCheckSpWp]: Trace formula consists of 31 conjuncts, 3 conjunts are in the unsatisfiable core [2022-02-20 17:38:49,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:38:49,910 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 17:38:49,999 INFO L290 TraceCheckUtils]: 0: Hoare triple {171#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(13bv32, 2bv32);call #Ultimate.allocInit(12bv32, 3bv32);~counter~0 := 0bv32; {176#(= ~counter~0 (_ bv0 32))} is VALID [2022-02-20 17:38:50,000 INFO L290 TraceCheckUtils]: 1: Hoare triple {176#(= ~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~nondet5#1, main_#t~post6#1, main_~x~0#1, main_~y~0#1, main_~a~0#1, main_~b~0#1, main_~p~0#1, main_~q~0#1;havoc main_~x~0#1;havoc main_~y~0#1;havoc main_~a~0#1;havoc main_~b~0#1;havoc main_~p~0#1;havoc main_~q~0#1;main_~x~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;main_~y~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := (if ~bvsge32(main_~y~0#1, 1bv32) then 1bv32 else 0bv32);havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {176#(= ~counter~0 (_ bv0 32))} is VALID [2022-02-20 17:38:50,000 INFO L290 TraceCheckUtils]: 2: Hoare triple {176#(= ~counter~0 (_ bv0 32))} assume !(0bv32 == assume_abort_if_not_~cond#1); {176#(= ~counter~0 (_ bv0 32))} is VALID [2022-02-20 17:38:50,001 INFO L290 TraceCheckUtils]: 3: Hoare triple {176#(= ~counter~0 (_ bv0 32))} assume { :end_inline_assume_abort_if_not } true;main_~a~0#1 := ~sign_extendFrom32To64(main_~x~0#1);main_~b~0#1 := ~sign_extendFrom32To64(main_~y~0#1);main_~p~0#1 := 1bv64;main_~q~0#1 := 0bv64; {176#(= ~counter~0 (_ bv0 32))} is VALID [2022-02-20 17:38:50,002 INFO L290 TraceCheckUtils]: 4: Hoare triple {176#(= ~counter~0 (_ bv0 32))} main_#t~post6#1 := ~counter~0;~counter~0 := ~bvadd32(1bv32, main_#t~post6#1); {189#(= |ULTIMATE.start_main_#t~post6#1| (_ bv0 32))} is VALID [2022-02-20 17:38:50,002 INFO L290 TraceCheckUtils]: 5: Hoare triple {189#(= |ULTIMATE.start_main_#t~post6#1| (_ bv0 32))} assume !~bvslt32(main_#t~post6#1, 1bv32);havoc main_#t~post6#1; {172#false} is VALID [2022-02-20 17:38:50,002 INFO L272 TraceCheckUtils]: 6: Hoare triple {172#false} call __VERIFIER_assert((if main_~q~0#1 == ~bvmul64(~sign_extendFrom32To64(main_~x~0#1), ~sign_extendFrom32To64(main_~y~0#1)) then 1bv32 else 0bv32)); {172#false} is VALID [2022-02-20 17:38:50,003 INFO L290 TraceCheckUtils]: 7: Hoare triple {172#false} ~cond := #in~cond; {172#false} is VALID [2022-02-20 17:38:50,003 INFO L290 TraceCheckUtils]: 8: Hoare triple {172#false} assume 0bv32 == ~cond; {172#false} is VALID [2022-02-20 17:38:50,003 INFO L290 TraceCheckUtils]: 9: Hoare triple {172#false} assume !false; {172#false} is VALID [2022-02-20 17:38:50,003 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:38:50,004 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 17:38:50,004 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 17:38:50,004 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [499912331] [2022-02-20 17:38:50,004 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [499912331] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 17:38:50,004 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 17:38:50,005 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 17:38:50,005 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1004827617] [2022-02-20 17:38:50,005 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 17:38:50,006 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:38:50,006 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 17:38:50,007 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:38:50,041 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:38:50,042 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-20 17:38:50,043 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 17:38:50,043 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-20 17:38:50,045 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-20 17:38:50,045 INFO L87 Difference]: Start difference. First operand 19 states and 25 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:38:53,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:38:53,667 INFO L93 Difference]: Finished difference Result 29 states and 36 transitions. [2022-02-20 17:38:53,667 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-20 17:38:53,667 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:38:53,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 17:38:53,668 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:38:53,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 36 transitions. [2022-02-20 17:38:53,671 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:38:53,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 36 transitions. [2022-02-20 17:38:53,673 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 36 transitions. [2022-02-20 17:38:54,105 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 36 edges. 36 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:38:54,106 INFO L225 Difference]: With dead ends: 29 [2022-02-20 17:38:54,106 INFO L226 Difference]: Without dead ends: 21 [2022-02-20 17:38:54,107 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:38:54,108 INFO L933 BasicCegarLoop]: 23 mSDtfsCounter, 0 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 63 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 17:38:54,109 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 63 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 17:38:54,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2022-02-20 17:38:54,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2022-02-20 17:38:54,112 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 17:38:54,112 INFO L82 GeneralOperation]: Start isEquivalent. First operand 21 states. Second operand has 21 states, 16 states have (on average 1.375) internal successors, (22), 17 states have internal predecessors, (22), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 17:38:54,113 INFO L74 IsIncluded]: Start isIncluded. First operand 21 states. Second operand has 21 states, 16 states have (on average 1.375) internal successors, (22), 17 states have internal predecessors, (22), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 17:38:54,113 INFO L87 Difference]: Start difference. First operand 21 states. Second operand has 21 states, 16 states have (on average 1.375) internal successors, (22), 17 states have internal predecessors, (22), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 17:38:54,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:38:54,115 INFO L93 Difference]: Finished difference Result 21 states and 27 transitions. [2022-02-20 17:38:54,115 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 27 transitions. [2022-02-20 17:38:54,116 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:38:54,116 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:38:54,116 INFO L74 IsIncluded]: Start isIncluded. First operand has 21 states, 16 states have (on average 1.375) internal successors, (22), 17 states have internal predecessors, (22), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 21 states. [2022-02-20 17:38:54,117 INFO L87 Difference]: Start difference. First operand has 21 states, 16 states have (on average 1.375) internal successors, (22), 17 states have internal predecessors, (22), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 21 states. [2022-02-20 17:38:54,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:38:54,119 INFO L93 Difference]: Finished difference Result 21 states and 27 transitions. [2022-02-20 17:38:54,119 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 27 transitions. [2022-02-20 17:38:54,119 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:38:54,120 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:38:54,120 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 17:38:54,120 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 17:38:54,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 16 states have (on average 1.375) internal successors, (22), 17 states have internal predecessors, (22), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 17:38:54,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 27 transitions. [2022-02-20 17:38:54,122 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 27 transitions. Word has length 10 [2022-02-20 17:38:54,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 17:38:54,122 INFO L470 AbstractCegarLoop]: Abstraction has 21 states and 27 transitions. [2022-02-20 17:38:54,123 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:38:54,123 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 27 transitions. [2022-02-20 17:38:54,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-02-20 17:38:54,123 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:38:54,130 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 17:38:54,146 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2022-02-20 17:38:54,339 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:38:54,340 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 17:38:54,340 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:38:54,340 INFO L85 PathProgramCache]: Analyzing trace with hash -1984271199, now seen corresponding path program 1 times [2022-02-20 17:38:54,341 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 17:38:54,341 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1723725342] [2022-02-20 17:38:54,341 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:38:54,341 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 17:38:54,341 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 17:38:54,342 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:38:54,345 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:38:54,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:38:54,697 INFO L263 TraceCheckSpWp]: Trace formula consists of 31 conjuncts, 10 conjunts are in the unsatisfiable core [2022-02-20 17:38:54,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:38:54,704 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 17:38:55,092 INFO L290 TraceCheckUtils]: 0: Hoare triple {311#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(13bv32, 2bv32);call #Ultimate.allocInit(12bv32, 3bv32);~counter~0 := 0bv32; {311#true} is VALID [2022-02-20 17:38:55,094 INFO L290 TraceCheckUtils]: 1: Hoare triple {311#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~post6#1, main_~x~0#1, main_~y~0#1, main_~a~0#1, main_~b~0#1, main_~p~0#1, main_~q~0#1;havoc main_~x~0#1;havoc main_~y~0#1;havoc main_~a~0#1;havoc main_~b~0#1;havoc main_~p~0#1;havoc main_~q~0#1;main_~x~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;main_~y~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := (if ~bvsge32(main_~y~0#1, 1bv32) then 1bv32 else 0bv32);havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {319#(or (and (bvsge |ULTIMATE.start_main_~y~0#1| (_ bv1 32)) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| (_ bv1 32))) (and (= |ULTIMATE.start_assume_abort_if_not_~cond#1| (_ bv0 32)) (not (bvsge |ULTIMATE.start_main_~y~0#1| (_ bv1 32)))))} is VALID [2022-02-20 17:38:55,094 INFO L290 TraceCheckUtils]: 2: Hoare triple {319#(or (and (bvsge |ULTIMATE.start_main_~y~0#1| (_ bv1 32)) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| (_ bv1 32))) (and (= |ULTIMATE.start_assume_abort_if_not_~cond#1| (_ bv0 32)) (not (bvsge |ULTIMATE.start_main_~y~0#1| (_ bv1 32)))))} assume !(0bv32 == assume_abort_if_not_~cond#1); {323#(bvsge |ULTIMATE.start_main_~y~0#1| (_ bv1 32))} is VALID [2022-02-20 17:38:55,096 INFO L290 TraceCheckUtils]: 3: Hoare triple {323#(bvsge |ULTIMATE.start_main_~y~0#1| (_ bv1 32))} assume { :end_inline_assume_abort_if_not } true;main_~a~0#1 := ~sign_extendFrom32To64(main_~x~0#1);main_~b~0#1 := ~sign_extendFrom32To64(main_~y~0#1);main_~p~0#1 := 1bv64;main_~q~0#1 := 0bv64; {327#(and (= |ULTIMATE.start_main_~a~0#1| ((_ sign_extend 32) |ULTIMATE.start_main_~x~0#1|)) (= |ULTIMATE.start_main_~b~0#1| ((_ sign_extend 32) |ULTIMATE.start_main_~y~0#1|)) (bvsge |ULTIMATE.start_main_~y~0#1| (_ bv1 32)) (= |ULTIMATE.start_main_~q~0#1| (_ bv0 64)) (= |ULTIMATE.start_main_~p~0#1| (_ bv1 64)))} is VALID [2022-02-20 17:38:55,097 INFO L290 TraceCheckUtils]: 4: Hoare triple {327#(and (= |ULTIMATE.start_main_~a~0#1| ((_ sign_extend 32) |ULTIMATE.start_main_~x~0#1|)) (= |ULTIMATE.start_main_~b~0#1| ((_ sign_extend 32) |ULTIMATE.start_main_~y~0#1|)) (bvsge |ULTIMATE.start_main_~y~0#1| (_ bv1 32)) (= |ULTIMATE.start_main_~q~0#1| (_ bv0 64)) (= |ULTIMATE.start_main_~p~0#1| (_ bv1 64)))} main_#t~post6#1 := ~counter~0;~counter~0 := ~bvadd32(1bv32, main_#t~post6#1); {327#(and (= |ULTIMATE.start_main_~a~0#1| ((_ sign_extend 32) |ULTIMATE.start_main_~x~0#1|)) (= |ULTIMATE.start_main_~b~0#1| ((_ sign_extend 32) |ULTIMATE.start_main_~y~0#1|)) (bvsge |ULTIMATE.start_main_~y~0#1| (_ bv1 32)) (= |ULTIMATE.start_main_~q~0#1| (_ bv0 64)) (= |ULTIMATE.start_main_~p~0#1| (_ bv1 64)))} is VALID [2022-02-20 17:38:55,098 INFO L290 TraceCheckUtils]: 5: Hoare triple {327#(and (= |ULTIMATE.start_main_~a~0#1| ((_ sign_extend 32) |ULTIMATE.start_main_~x~0#1|)) (= |ULTIMATE.start_main_~b~0#1| ((_ sign_extend 32) |ULTIMATE.start_main_~y~0#1|)) (bvsge |ULTIMATE.start_main_~y~0#1| (_ bv1 32)) (= |ULTIMATE.start_main_~q~0#1| (_ bv0 64)) (= |ULTIMATE.start_main_~p~0#1| (_ bv1 64)))} assume !!~bvslt32(main_#t~post6#1, 1bv32);havoc main_#t~post6#1; {327#(and (= |ULTIMATE.start_main_~a~0#1| ((_ sign_extend 32) |ULTIMATE.start_main_~x~0#1|)) (= |ULTIMATE.start_main_~b~0#1| ((_ sign_extend 32) |ULTIMATE.start_main_~y~0#1|)) (bvsge |ULTIMATE.start_main_~y~0#1| (_ bv1 32)) (= |ULTIMATE.start_main_~q~0#1| (_ bv0 64)) (= |ULTIMATE.start_main_~p~0#1| (_ bv1 64)))} is VALID [2022-02-20 17:38:55,099 INFO L272 TraceCheckUtils]: 6: Hoare triple {327#(and (= |ULTIMATE.start_main_~a~0#1| ((_ sign_extend 32) |ULTIMATE.start_main_~x~0#1|)) (= |ULTIMATE.start_main_~b~0#1| ((_ sign_extend 32) |ULTIMATE.start_main_~y~0#1|)) (bvsge |ULTIMATE.start_main_~y~0#1| (_ bv1 32)) (= |ULTIMATE.start_main_~q~0#1| (_ bv0 64)) (= |ULTIMATE.start_main_~p~0#1| (_ bv1 64)))} call __VERIFIER_assert((if ~bvadd64(main_~q~0#1, ~bvmul64(~bvmul64(main_~a~0#1, main_~b~0#1), main_~p~0#1)) == ~bvmul64(~sign_extendFrom32To64(main_~x~0#1), ~sign_extendFrom32To64(main_~y~0#1)) then 1bv32 else 0bv32)); {337#(= (_ bv1 32) |__VERIFIER_assert_#in~cond|)} is VALID [2022-02-20 17:38:55,100 INFO L290 TraceCheckUtils]: 7: Hoare triple {337#(= (_ bv1 32) |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {341#(= __VERIFIER_assert_~cond (_ bv1 32))} is VALID [2022-02-20 17:38:55,100 INFO L290 TraceCheckUtils]: 8: Hoare triple {341#(= __VERIFIER_assert_~cond (_ bv1 32))} assume 0bv32 == ~cond; {312#false} is VALID [2022-02-20 17:38:55,100 INFO L290 TraceCheckUtils]: 9: Hoare triple {312#false} assume !false; {312#false} is VALID [2022-02-20 17:38:55,100 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:38:55,101 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 17:38:55,101 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 17:38:55,101 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1723725342] [2022-02-20 17:38:55,101 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1723725342] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 17:38:55,101 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 17:38:55,101 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-02-20 17:38:55,102 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1632421328] [2022-02-20 17:38:55,102 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 17:38:55,102 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 1.2857142857142858) internal successors, (9), 6 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:38:55,102 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 17:38:55,102 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 1.2857142857142858) internal successors, (9), 6 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:38:57,196 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 10 edges. 9 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-02-20 17:38:57,197 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-02-20 17:38:57,197 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 17:38:57,197 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-02-20 17:38:57,197 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-02-20 17:38:57,198 INFO L87 Difference]: Start difference. First operand 21 states and 27 transitions. Second operand has 7 states, 7 states have (on average 1.2857142857142858) internal successors, (9), 6 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:39:03,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:39:03,871 INFO L93 Difference]: Finished difference Result 34 states and 45 transitions. [2022-02-20 17:39:03,871 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-02-20 17:39:03,871 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 1.2857142857142858) internal successors, (9), 6 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:39:03,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 17:39:03,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 1.2857142857142858) internal successors, (9), 6 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:39:03,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 45 transitions. [2022-02-20 17:39:03,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 1.2857142857142858) internal successors, (9), 6 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:39:03,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 45 transitions. [2022-02-20 17:39:03,874 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 45 transitions. [2022-02-20 17:39:06,819 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 45 edges. 44 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-02-20 17:39:06,821 INFO L225 Difference]: With dead ends: 34 [2022-02-20 17:39:06,821 INFO L226 Difference]: Without dead ends: 32 [2022-02-20 17:39:06,821 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2022-02-20 17:39:06,822 INFO L933 BasicCegarLoop]: 14 mSDtfsCounter, 46 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 56 SdHoareTripleChecker+Invalid, 76 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2022-02-20 17:39:06,822 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [46 Valid, 56 Invalid, 76 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2022-02-20 17:39:06,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2022-02-20 17:39:06,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 26. [2022-02-20 17:39:06,827 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 17:39:06,827 INFO L82 GeneralOperation]: Start isEquivalent. First operand 32 states. Second operand has 26 states, 19 states have (on average 1.3157894736842106) internal successors, (25), 21 states have internal predecessors, (25), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-20 17:39:06,828 INFO L74 IsIncluded]: Start isIncluded. First operand 32 states. Second operand has 26 states, 19 states have (on average 1.3157894736842106) internal successors, (25), 21 states have internal predecessors, (25), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-20 17:39:06,828 INFO L87 Difference]: Start difference. First operand 32 states. Second operand has 26 states, 19 states have (on average 1.3157894736842106) internal successors, (25), 21 states have internal predecessors, (25), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-20 17:39:06,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:39:06,831 INFO L93 Difference]: Finished difference Result 32 states and 43 transitions. [2022-02-20 17:39:06,831 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 43 transitions. [2022-02-20 17:39:06,831 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:39:06,831 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:39:06,832 INFO L74 IsIncluded]: Start isIncluded. First operand has 26 states, 19 states have (on average 1.3157894736842106) internal successors, (25), 21 states have internal predecessors, (25), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) Second operand 32 states. [2022-02-20 17:39:06,832 INFO L87 Difference]: Start difference. First operand has 26 states, 19 states have (on average 1.3157894736842106) internal successors, (25), 21 states have internal predecessors, (25), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) Second operand 32 states. [2022-02-20 17:39:06,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:39:06,835 INFO L93 Difference]: Finished difference Result 32 states and 43 transitions. [2022-02-20 17:39:06,835 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 43 transitions. [2022-02-20 17:39:06,835 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:39:06,835 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:39:06,836 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 17:39:06,836 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 17:39:06,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 19 states have (on average 1.3157894736842106) internal successors, (25), 21 states have internal predecessors, (25), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-20 17:39:06,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 32 transitions. [2022-02-20 17:39:06,838 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 32 transitions. Word has length 10 [2022-02-20 17:39:06,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 17:39:06,838 INFO L470 AbstractCegarLoop]: Abstraction has 26 states and 32 transitions. [2022-02-20 17:39:06,838 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 1.2857142857142858) internal successors, (9), 6 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:39:06,838 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 32 transitions. [2022-02-20 17:39:06,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-02-20 17:39:06,839 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:39:06,839 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 17:39:06,851 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:39:07,051 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:39:07,051 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 17:39:07,052 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:39:07,052 INFO L85 PathProgramCache]: Analyzing trace with hash -1194524114, now seen corresponding path program 1 times [2022-02-20 17:39:07,052 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 17:39:07,053 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2086718785] [2022-02-20 17:39:07,053 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:39:07,053 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 17:39:07,053 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 17:39:07,054 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:39:07,056 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:39:07,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:39:07,208 INFO L263 TraceCheckSpWp]: Trace formula consists of 39 conjuncts, 10 conjunts are in the unsatisfiable core [2022-02-20 17:39:07,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:39:07,256 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 17:39:08,298 INFO L290 TraceCheckUtils]: 0: Hoare triple {495#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(13bv32, 2bv32);call #Ultimate.allocInit(12bv32, 3bv32);~counter~0 := 0bv32; {495#true} is VALID [2022-02-20 17:39:08,299 INFO L290 TraceCheckUtils]: 1: Hoare triple {495#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~post6#1, main_~x~0#1, main_~y~0#1, main_~a~0#1, main_~b~0#1, main_~p~0#1, main_~q~0#1;havoc main_~x~0#1;havoc main_~y~0#1;havoc main_~a~0#1;havoc main_~b~0#1;havoc main_~p~0#1;havoc main_~q~0#1;main_~x~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;main_~y~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := (if ~bvsge32(main_~y~0#1, 1bv32) then 1bv32 else 0bv32);havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {503#(or (and (bvsge |ULTIMATE.start_main_~y~0#1| (_ bv1 32)) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| (_ bv1 32))) (and (= |ULTIMATE.start_assume_abort_if_not_~cond#1| (_ bv0 32)) (not (bvsge |ULTIMATE.start_main_~y~0#1| (_ bv1 32)))))} is VALID [2022-02-20 17:39:08,300 INFO L290 TraceCheckUtils]: 2: Hoare triple {503#(or (and (bvsge |ULTIMATE.start_main_~y~0#1| (_ bv1 32)) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| (_ bv1 32))) (and (= |ULTIMATE.start_assume_abort_if_not_~cond#1| (_ bv0 32)) (not (bvsge |ULTIMATE.start_main_~y~0#1| (_ bv1 32)))))} assume !(0bv32 == assume_abort_if_not_~cond#1); {507#(bvsge |ULTIMATE.start_main_~y~0#1| (_ bv1 32))} is VALID [2022-02-20 17:39:08,300 INFO L290 TraceCheckUtils]: 3: Hoare triple {507#(bvsge |ULTIMATE.start_main_~y~0#1| (_ bv1 32))} assume { :end_inline_assume_abort_if_not } true;main_~a~0#1 := ~sign_extendFrom32To64(main_~x~0#1);main_~b~0#1 := ~sign_extendFrom32To64(main_~y~0#1);main_~p~0#1 := 1bv64;main_~q~0#1 := 0bv64; {511#(and (= |ULTIMATE.start_main_~a~0#1| ((_ sign_extend 32) |ULTIMATE.start_main_~x~0#1|)) (= |ULTIMATE.start_main_~b~0#1| ((_ sign_extend 32) |ULTIMATE.start_main_~y~0#1|)) (bvsge |ULTIMATE.start_main_~y~0#1| (_ bv1 32)) (= |ULTIMATE.start_main_~q~0#1| (_ bv0 64)))} is VALID [2022-02-20 17:39:08,301 INFO L290 TraceCheckUtils]: 4: Hoare triple {511#(and (= |ULTIMATE.start_main_~a~0#1| ((_ sign_extend 32) |ULTIMATE.start_main_~x~0#1|)) (= |ULTIMATE.start_main_~b~0#1| ((_ sign_extend 32) |ULTIMATE.start_main_~y~0#1|)) (bvsge |ULTIMATE.start_main_~y~0#1| (_ bv1 32)) (= |ULTIMATE.start_main_~q~0#1| (_ bv0 64)))} main_#t~post6#1 := ~counter~0;~counter~0 := ~bvadd32(1bv32, main_#t~post6#1); {511#(and (= |ULTIMATE.start_main_~a~0#1| ((_ sign_extend 32) |ULTIMATE.start_main_~x~0#1|)) (= |ULTIMATE.start_main_~b~0#1| ((_ sign_extend 32) |ULTIMATE.start_main_~y~0#1|)) (bvsge |ULTIMATE.start_main_~y~0#1| (_ bv1 32)) (= |ULTIMATE.start_main_~q~0#1| (_ bv0 64)))} is VALID [2022-02-20 17:39:08,302 INFO L290 TraceCheckUtils]: 5: Hoare triple {511#(and (= |ULTIMATE.start_main_~a~0#1| ((_ sign_extend 32) |ULTIMATE.start_main_~x~0#1|)) (= |ULTIMATE.start_main_~b~0#1| ((_ sign_extend 32) |ULTIMATE.start_main_~y~0#1|)) (bvsge |ULTIMATE.start_main_~y~0#1| (_ bv1 32)) (= |ULTIMATE.start_main_~q~0#1| (_ bv0 64)))} assume !!~bvslt32(main_#t~post6#1, 1bv32);havoc main_#t~post6#1; {511#(and (= |ULTIMATE.start_main_~a~0#1| ((_ sign_extend 32) |ULTIMATE.start_main_~x~0#1|)) (= |ULTIMATE.start_main_~b~0#1| ((_ sign_extend 32) |ULTIMATE.start_main_~y~0#1|)) (bvsge |ULTIMATE.start_main_~y~0#1| (_ bv1 32)) (= |ULTIMATE.start_main_~q~0#1| (_ bv0 64)))} is VALID [2022-02-20 17:39:08,302 INFO L272 TraceCheckUtils]: 6: Hoare triple {511#(and (= |ULTIMATE.start_main_~a~0#1| ((_ sign_extend 32) |ULTIMATE.start_main_~x~0#1|)) (= |ULTIMATE.start_main_~b~0#1| ((_ sign_extend 32) |ULTIMATE.start_main_~y~0#1|)) (bvsge |ULTIMATE.start_main_~y~0#1| (_ bv1 32)) (= |ULTIMATE.start_main_~q~0#1| (_ bv0 64)))} call __VERIFIER_assert((if ~bvadd64(main_~q~0#1, ~bvmul64(~bvmul64(main_~a~0#1, main_~b~0#1), main_~p~0#1)) == ~bvmul64(~sign_extendFrom32To64(main_~x~0#1), ~sign_extendFrom32To64(main_~y~0#1)) then 1bv32 else 0bv32)); {495#true} is VALID [2022-02-20 17:39:08,302 INFO L290 TraceCheckUtils]: 7: Hoare triple {495#true} ~cond := #in~cond; {495#true} is VALID [2022-02-20 17:39:08,302 INFO L290 TraceCheckUtils]: 8: Hoare triple {495#true} assume !(0bv32 == ~cond); {495#true} is VALID [2022-02-20 17:39:08,302 INFO L290 TraceCheckUtils]: 9: Hoare triple {495#true} assume true; {495#true} is VALID [2022-02-20 17:39:08,303 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {495#true} {511#(and (= |ULTIMATE.start_main_~a~0#1| ((_ sign_extend 32) |ULTIMATE.start_main_~x~0#1|)) (= |ULTIMATE.start_main_~b~0#1| ((_ sign_extend 32) |ULTIMATE.start_main_~y~0#1|)) (bvsge |ULTIMATE.start_main_~y~0#1| (_ bv1 32)) (= |ULTIMATE.start_main_~q~0#1| (_ bv0 64)))} #63#return; {511#(and (= |ULTIMATE.start_main_~a~0#1| ((_ sign_extend 32) |ULTIMATE.start_main_~x~0#1|)) (= |ULTIMATE.start_main_~b~0#1| ((_ sign_extend 32) |ULTIMATE.start_main_~y~0#1|)) (bvsge |ULTIMATE.start_main_~y~0#1| (_ bv1 32)) (= |ULTIMATE.start_main_~q~0#1| (_ bv0 64)))} is VALID [2022-02-20 17:39:08,305 INFO L290 TraceCheckUtils]: 11: Hoare triple {511#(and (= |ULTIMATE.start_main_~a~0#1| ((_ sign_extend 32) |ULTIMATE.start_main_~x~0#1|)) (= |ULTIMATE.start_main_~b~0#1| ((_ sign_extend 32) |ULTIMATE.start_main_~y~0#1|)) (bvsge |ULTIMATE.start_main_~y~0#1| (_ bv1 32)) (= |ULTIMATE.start_main_~q~0#1| (_ bv0 64)))} assume !(0bv64 != main_~a~0#1 && 0bv64 != main_~b~0#1); {536#(and (= (_ bv0 64) ((_ sign_extend 32) |ULTIMATE.start_main_~x~0#1|)) (bvsge |ULTIMATE.start_main_~y~0#1| (_ bv1 32)) (= |ULTIMATE.start_main_~q~0#1| (_ bv0 64)))} is VALID [2022-02-20 17:39:08,306 INFO L272 TraceCheckUtils]: 12: Hoare triple {536#(and (= (_ bv0 64) ((_ sign_extend 32) |ULTIMATE.start_main_~x~0#1|)) (bvsge |ULTIMATE.start_main_~y~0#1| (_ bv1 32)) (= |ULTIMATE.start_main_~q~0#1| (_ bv0 64)))} call __VERIFIER_assert((if main_~q~0#1 == ~bvmul64(~sign_extendFrom32To64(main_~x~0#1), ~sign_extendFrom32To64(main_~y~0#1)) then 1bv32 else 0bv32)); {540#(= (_ bv1 32) |__VERIFIER_assert_#in~cond|)} is VALID [2022-02-20 17:39:08,306 INFO L290 TraceCheckUtils]: 13: Hoare triple {540#(= (_ bv1 32) |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {544#(= __VERIFIER_assert_~cond (_ bv1 32))} is VALID [2022-02-20 17:39:08,307 INFO L290 TraceCheckUtils]: 14: Hoare triple {544#(= __VERIFIER_assert_~cond (_ bv1 32))} assume 0bv32 == ~cond; {496#false} is VALID [2022-02-20 17:39:08,307 INFO L290 TraceCheckUtils]: 15: Hoare triple {496#false} assume !false; {496#false} is VALID [2022-02-20 17:39:08,307 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:39:08,307 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 17:39:08,308 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 17:39:08,308 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2086718785] [2022-02-20 17:39:08,308 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2086718785] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 17:39:08,308 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 17:39:08,308 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-02-20 17:39:08,308 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [162782554] [2022-02-20 17:39:08,308 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 17:39:08,309 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 7 states have internal predecessors, (13), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2022-02-20 17:39:08,309 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 17:39:08,309 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 8 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 7 states have internal predecessors, (13), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 17:39:08,475 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 16 edges. 16 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:39:08,475 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-02-20 17:39:08,475 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 17:39:08,475 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-02-20 17:39:08,476 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-02-20 17:39:08,476 INFO L87 Difference]: Start difference. First operand 26 states and 32 transitions. Second operand has 8 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 7 states have internal predecessors, (13), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 17:39:18,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:39:18,863 INFO L93 Difference]: Finished difference Result 38 states and 48 transitions. [2022-02-20 17:39:18,863 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-02-20 17:39:18,863 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 7 states have internal predecessors, (13), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2022-02-20 17:39:18,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 17:39:18,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 7 states have internal predecessors, (13), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 17:39:18,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 45 transitions. [2022-02-20 17:39:18,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 7 states have internal predecessors, (13), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 17:39:18,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 45 transitions. [2022-02-20 17:39:18,867 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 45 transitions.