./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/nla-digbench-scaling/prodbin-ll_valuebound50.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/prodbin-ll_valuebound50.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 352373f9b097794e6947f5064b04543cec809ba042ac0b3a931e0e161838d7d3 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 17:39:47,973 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 17:39:47,990 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 17:39:48,032 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 17:39:48,033 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 17:39:48,036 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 17:39:48,037 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 17:39:48,039 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 17:39:48,041 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 17:39:48,045 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 17:39:48,045 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 17:39:48,047 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 17:39:48,047 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 17:39:48,049 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 17:39:48,050 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 17:39:48,053 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 17:39:48,054 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 17:39:48,055 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 17:39:48,057 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 17:39:48,062 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 17:39:48,063 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 17:39:48,064 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 17:39:48,066 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 17:39:48,066 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 17:39:48,072 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 17:39:48,072 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 17:39:48,072 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 17:39:48,073 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 17:39:48,074 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 17:39:48,075 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 17:39:48,075 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 17:39:48,076 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 17:39:48,077 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 17:39:48,078 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 17:39:48,079 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 17:39:48,079 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 17:39:48,080 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 17:39:48,080 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 17:39:48,080 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 17:39:48,081 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 17:39:48,082 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 17:39:48,083 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:39:48,110 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 17:39:48,110 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 17:39:48,111 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 17:39:48,111 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 17:39:48,112 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 17:39:48,112 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 17:39:48,113 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 17:39:48,113 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 17:39:48,113 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 17:39:48,113 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 17:39:48,114 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 17:39:48,114 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 17:39:48,114 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 17:39:48,115 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 17:39:48,115 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 17:39:48,115 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 17:39:48,115 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 17:39:48,115 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 17:39:48,116 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 17:39:48,116 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 17:39:48,116 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 17:39:48,116 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 17:39:48,116 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 17:39:48,117 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 17:39:48,117 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 17:39:48,117 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 17:39:48,117 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 17:39:48,117 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 17:39:48,118 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-20 17:39:48,118 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-20 17:39:48,118 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 17:39:48,118 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 17:39:48,118 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 17:39:48,119 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 -> 352373f9b097794e6947f5064b04543cec809ba042ac0b3a931e0e161838d7d3 [2022-02-20 17:39:48,329 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 17:39:48,351 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 17:39:48,353 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 17:39:48,354 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 17:39:48,355 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 17:39:48,356 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/nla-digbench-scaling/prodbin-ll_valuebound50.c [2022-02-20 17:39:48,416 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/41f1e9fe4/09a04178134b4385816046b40d2db895/FLAGa4ac1cfda [2022-02-20 17:39:48,731 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 17:39:48,731 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/prodbin-ll_valuebound50.c [2022-02-20 17:39:48,736 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/41f1e9fe4/09a04178134b4385816046b40d2db895/FLAGa4ac1cfda [2022-02-20 17:39:49,143 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/41f1e9fe4/09a04178134b4385816046b40d2db895 [2022-02-20 17:39:49,146 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 17:39:49,148 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 17:39:49,151 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 17:39:49,151 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 17:39:49,157 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 17:39:49,158 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 05:39:49" (1/1) ... [2022-02-20 17:39:49,160 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@73d2b774 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:39:49, skipping insertion in model container [2022-02-20 17:39:49,160 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 05:39:49" (1/1) ... [2022-02-20 17:39:49,165 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 17:39:49,177 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 17:39:49,302 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/prodbin-ll_valuebound50.c[537,550] [2022-02-20 17:39:49,326 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 17:39:49,339 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 17:39:49,352 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/prodbin-ll_valuebound50.c[537,550] [2022-02-20 17:39:49,360 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 17:39:49,372 INFO L208 MainTranslator]: Completed translation [2022-02-20 17:39:49,372 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:39:49 WrapperNode [2022-02-20 17:39:49,372 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 17:39:49,373 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 17:39:49,373 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 17:39:49,373 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 17:39:49,377 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:39:49" (1/1) ... [2022-02-20 17:39:49,382 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:39:49" (1/1) ... [2022-02-20 17:39:49,398 INFO L137 Inliner]: procedures = 14, calls = 12, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 42 [2022-02-20 17:39:49,399 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 17:39:49,399 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 17:39:49,399 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 17:39:49,400 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 17:39:49,405 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:39:49" (1/1) ... [2022-02-20 17:39:49,405 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:39:49" (1/1) ... [2022-02-20 17:39:49,406 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:39:49" (1/1) ... [2022-02-20 17:39:49,406 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:39:49" (1/1) ... [2022-02-20 17:39:49,409 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:39:49" (1/1) ... [2022-02-20 17:39:49,412 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:39:49" (1/1) ... [2022-02-20 17:39:49,413 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:39:49" (1/1) ... [2022-02-20 17:39:49,414 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 17:39:49,415 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 17:39:49,415 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 17:39:49,415 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 17:39:49,416 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:39:49" (1/1) ... [2022-02-20 17:39:49,431 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 17:39:49,441 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 17:39:49,451 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:39:49,470 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:39:49,489 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 17:39:49,489 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-02-20 17:39:49,489 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-02-20 17:39:49,490 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-20 17:39:49,490 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 17:39:49,490 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 17:39:49,490 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-02-20 17:39:49,490 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-02-20 17:39:49,545 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 17:39:49,547 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 17:39:49,746 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 17:39:49,759 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 17:39:49,766 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-02-20 17:39:49,768 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 05:39:49 BoogieIcfgContainer [2022-02-20 17:39:49,768 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 17:39:49,769 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 17:39:49,769 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 17:39:49,785 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 17:39:49,785 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 05:39:49" (1/3) ... [2022-02-20 17:39:49,786 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@70611064 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 05:39:49, skipping insertion in model container [2022-02-20 17:39:49,786 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:39:49" (2/3) ... [2022-02-20 17:39:49,786 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@70611064 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 05:39:49, skipping insertion in model container [2022-02-20 17:39:49,787 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 05:39:49" (3/3) ... [2022-02-20 17:39:49,788 INFO L111 eAbstractionObserver]: Analyzing ICFG prodbin-ll_valuebound50.c [2022-02-20 17:39:49,792 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 17:39:49,792 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-02-20 17:39:49,872 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 17:39:49,877 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:39:49,878 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-02-20 17:39:49,903 INFO L276 IsEmpty]: Start isEmpty. Operand has 27 states, 18 states have (on average 1.3888888888888888) internal successors, (25), 19 states have internal predecessors, (25), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-02-20 17:39:49,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-02-20 17:39:49,911 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:39:49,912 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 17:39:49,913 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 17:39:49,921 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:39:49,922 INFO L85 PathProgramCache]: Analyzing trace with hash -861605892, now seen corresponding path program 1 times [2022-02-20 17:39:49,930 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 17:39:49,934 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1833808570] [2022-02-20 17:39:49,934 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:39:49,936 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 17:39:50,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:39:50,085 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-02-20 17:39:50,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:39:50,107 INFO L290 TraceCheckUtils]: 0: Hoare triple {30#true} ~cond := #in~cond; {30#true} is VALID [2022-02-20 17:39:50,109 INFO L290 TraceCheckUtils]: 1: Hoare triple {30#true} assume 0 == ~cond;assume false; {31#false} is VALID [2022-02-20 17:39:50,109 INFO L290 TraceCheckUtils]: 2: Hoare triple {31#false} assume true; {31#false} is VALID [2022-02-20 17:39:50,109 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {31#false} {30#true} #58#return; {31#false} is VALID [2022-02-20 17:39:50,110 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-02-20 17:39:50,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:39:50,117 INFO L290 TraceCheckUtils]: 0: Hoare triple {30#true} ~cond := #in~cond; {30#true} is VALID [2022-02-20 17:39:50,118 INFO L290 TraceCheckUtils]: 1: Hoare triple {30#true} assume 0 == ~cond;assume false; {31#false} is VALID [2022-02-20 17:39:50,118 INFO L290 TraceCheckUtils]: 2: Hoare triple {31#false} assume true; {31#false} is VALID [2022-02-20 17:39:50,118 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {31#false} {31#false} #60#return; {31#false} is VALID [2022-02-20 17:39:50,118 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-02-20 17:39:50,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:39:50,128 INFO L290 TraceCheckUtils]: 0: Hoare triple {30#true} ~cond := #in~cond; {30#true} is VALID [2022-02-20 17:39:50,129 INFO L290 TraceCheckUtils]: 1: Hoare triple {30#true} assume 0 == ~cond;assume false; {31#false} is VALID [2022-02-20 17:39:50,129 INFO L290 TraceCheckUtils]: 2: Hoare triple {31#false} assume true; {31#false} is VALID [2022-02-20 17:39:50,129 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {31#false} {31#false} #62#return; {31#false} is VALID [2022-02-20 17:39:50,130 INFO L290 TraceCheckUtils]: 0: Hoare triple {30#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); {30#true} is VALID [2022-02-20 17:39:50,130 INFO L290 TraceCheckUtils]: 1: Hoare triple {30#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_~a~0#1, main_~b~0#1, main_~x~0#1, main_~y~0#1, main_~z~0#1;havoc main_~a~0#1;havoc main_~b~0#1;havoc main_~x~0#1;havoc main_~y~0#1;havoc main_~z~0#1;assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;main_~a~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; {30#true} is VALID [2022-02-20 17:39:50,130 INFO L272 TraceCheckUtils]: 2: Hoare triple {30#true} call assume_abort_if_not((if main_~a~0#1 >= 0 && main_~a~0#1 <= 50 then 1 else 0)); {30#true} is VALID [2022-02-20 17:39:50,130 INFO L290 TraceCheckUtils]: 3: Hoare triple {30#true} ~cond := #in~cond; {30#true} is VALID [2022-02-20 17:39:50,131 INFO L290 TraceCheckUtils]: 4: Hoare triple {30#true} assume 0 == ~cond;assume false; {31#false} is VALID [2022-02-20 17:39:50,131 INFO L290 TraceCheckUtils]: 5: Hoare triple {31#false} assume true; {31#false} is VALID [2022-02-20 17:39:50,131 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {31#false} {30#true} #58#return; {31#false} is VALID [2022-02-20 17:39:50,132 INFO L290 TraceCheckUtils]: 7: Hoare triple {31#false} assume -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647;main_~b~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; {31#false} is VALID [2022-02-20 17:39:50,132 INFO L272 TraceCheckUtils]: 8: Hoare triple {31#false} call assume_abort_if_not((if main_~b~0#1 >= 0 && main_~b~0#1 <= 50 then 1 else 0)); {30#true} is VALID [2022-02-20 17:39:50,132 INFO L290 TraceCheckUtils]: 9: Hoare triple {30#true} ~cond := #in~cond; {30#true} is VALID [2022-02-20 17:39:50,133 INFO L290 TraceCheckUtils]: 10: Hoare triple {30#true} assume 0 == ~cond;assume false; {31#false} is VALID [2022-02-20 17:39:50,133 INFO L290 TraceCheckUtils]: 11: Hoare triple {31#false} assume true; {31#false} is VALID [2022-02-20 17:39:50,133 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {31#false} {31#false} #60#return; {31#false} is VALID [2022-02-20 17:39:50,133 INFO L272 TraceCheckUtils]: 13: Hoare triple {31#false} call assume_abort_if_not((if main_~b~0#1 >= 1 then 1 else 0)); {30#true} is VALID [2022-02-20 17:39:50,134 INFO L290 TraceCheckUtils]: 14: Hoare triple {30#true} ~cond := #in~cond; {30#true} is VALID [2022-02-20 17:39:50,134 INFO L290 TraceCheckUtils]: 15: Hoare triple {30#true} assume 0 == ~cond;assume false; {31#false} is VALID [2022-02-20 17:39:50,134 INFO L290 TraceCheckUtils]: 16: Hoare triple {31#false} assume true; {31#false} is VALID [2022-02-20 17:39:50,135 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {31#false} {31#false} #62#return; {31#false} is VALID [2022-02-20 17:39:50,135 INFO L290 TraceCheckUtils]: 18: Hoare triple {31#false} main_~x~0#1 := main_~a~0#1;main_~y~0#1 := main_~b~0#1;main_~z~0#1 := 0; {31#false} is VALID [2022-02-20 17:39:50,135 INFO L290 TraceCheckUtils]: 19: Hoare triple {31#false} assume !false; {31#false} is VALID [2022-02-20 17:39:50,135 INFO L272 TraceCheckUtils]: 20: Hoare triple {31#false} call __VERIFIER_assert((if main_~z~0#1 + main_~x~0#1 * main_~y~0#1 == main_~a~0#1 * main_~b~0#1 then 1 else 0)); {31#false} is VALID [2022-02-20 17:39:50,136 INFO L290 TraceCheckUtils]: 21: Hoare triple {31#false} ~cond := #in~cond; {31#false} is VALID [2022-02-20 17:39:50,136 INFO L290 TraceCheckUtils]: 22: Hoare triple {31#false} assume 0 == ~cond; {31#false} is VALID [2022-02-20 17:39:50,136 INFO L290 TraceCheckUtils]: 23: Hoare triple {31#false} assume !false; {31#false} is VALID [2022-02-20 17:39:50,137 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-02-20 17:39:50,137 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 17:39:50,137 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1833808570] [2022-02-20 17:39:50,138 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1833808570] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 17:39:50,138 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 17:39:50,138 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-20 17:39:50,140 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [628086828] [2022-02-20 17:39:50,140 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 17:39:50,144 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) Word has length 24 [2022-02-20 17:39:50,146 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 17:39:50,148 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2022-02-20 17:39:50,170 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:39:50,170 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-02-20 17:39:50,170 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 17:39:50,194 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-02-20 17:39:50,194 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-02-20 17:39:50,196 INFO L87 Difference]: Start difference. First operand has 27 states, 18 states have (on average 1.3888888888888888) internal successors, (25), 19 states have internal predecessors, (25), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2022-02-20 17:39:50,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:39:50,258 INFO L93 Difference]: Finished difference Result 51 states and 71 transitions. [2022-02-20 17:39:50,259 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-20 17:39:50,259 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) Word has length 24 [2022-02-20 17:39:50,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 17:39:50,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2022-02-20 17:39:50,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 71 transitions. [2022-02-20 17:39:50,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2022-02-20 17:39:50,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 71 transitions. [2022-02-20 17:39:50,276 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 71 transitions. [2022-02-20 17:39:50,342 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 71 edges. 71 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:39:50,349 INFO L225 Difference]: With dead ends: 51 [2022-02-20 17:39:50,350 INFO L226 Difference]: Without dead ends: 23 [2022-02-20 17:39:50,352 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 11 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:39:50,355 INFO L933 BasicCegarLoop]: 31 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, 31 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:39:50,356 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 17:39:50,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2022-02-20 17:39:50,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2022-02-20 17:39:50,379 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 17:39:50,380 INFO L82 GeneralOperation]: Start isEquivalent. First operand 23 states. Second operand has 23 states, 15 states have (on average 1.2) internal successors, (18), 16 states have internal predecessors, (18), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-02-20 17:39:50,380 INFO L74 IsIncluded]: Start isIncluded. First operand 23 states. Second operand has 23 states, 15 states have (on average 1.2) internal successors, (18), 16 states have internal predecessors, (18), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-02-20 17:39:50,381 INFO L87 Difference]: Start difference. First operand 23 states. Second operand has 23 states, 15 states have (on average 1.2) internal successors, (18), 16 states have internal predecessors, (18), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-02-20 17:39:50,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:39:50,385 INFO L93 Difference]: Finished difference Result 23 states and 27 transitions. [2022-02-20 17:39:50,385 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 27 transitions. [2022-02-20 17:39:50,385 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:39:50,385 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:39:50,386 INFO L74 IsIncluded]: Start isIncluded. First operand has 23 states, 15 states have (on average 1.2) internal successors, (18), 16 states have internal predecessors, (18), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 23 states. [2022-02-20 17:39:50,386 INFO L87 Difference]: Start difference. First operand has 23 states, 15 states have (on average 1.2) internal successors, (18), 16 states have internal predecessors, (18), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 23 states. [2022-02-20 17:39:50,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:39:50,389 INFO L93 Difference]: Finished difference Result 23 states and 27 transitions. [2022-02-20 17:39:50,389 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 27 transitions. [2022-02-20 17:39:50,390 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:39:50,390 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:39:50,390 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 17:39:50,390 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 17:39:50,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 15 states have (on average 1.2) internal successors, (18), 16 states have internal predecessors, (18), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-02-20 17:39:50,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 27 transitions. [2022-02-20 17:39:50,394 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 27 transitions. Word has length 24 [2022-02-20 17:39:50,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 17:39:50,394 INFO L470 AbstractCegarLoop]: Abstraction has 23 states and 27 transitions. [2022-02-20 17:39:50,395 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2022-02-20 17:39:50,395 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 27 transitions. [2022-02-20 17:39:50,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-02-20 17:39:50,396 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:39:50,396 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 17:39:50,396 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-20 17:39:50,397 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 17:39:50,397 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:39:50,397 INFO L85 PathProgramCache]: Analyzing trace with hash -2010313222, now seen corresponding path program 1 times [2022-02-20 17:39:50,398 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 17:39:50,398 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1009743266] [2022-02-20 17:39:50,398 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:39:50,398 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 17:39:50,420 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-20 17:39:50,420 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [861489905] [2022-02-20 17:39:50,420 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:39:50,421 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 17:39:50,421 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 17:39:50,422 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:39:50,461 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:39:50,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:39:50,496 INFO L263 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 11 conjunts are in the unsatisfiable core [2022-02-20 17:39:50,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:39:50,517 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 17:39:50,726 INFO L290 TraceCheckUtils]: 0: Hoare triple {191#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); {191#true} is VALID [2022-02-20 17:39:50,726 INFO L290 TraceCheckUtils]: 1: Hoare triple {191#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_~a~0#1, main_~b~0#1, main_~x~0#1, main_~y~0#1, main_~z~0#1;havoc main_~a~0#1;havoc main_~b~0#1;havoc main_~x~0#1;havoc main_~y~0#1;havoc main_~z~0#1;assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;main_~a~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; {191#true} is VALID [2022-02-20 17:39:50,727 INFO L272 TraceCheckUtils]: 2: Hoare triple {191#true} call assume_abort_if_not((if main_~a~0#1 >= 0 && main_~a~0#1 <= 50 then 1 else 0)); {191#true} is VALID [2022-02-20 17:39:50,727 INFO L290 TraceCheckUtils]: 3: Hoare triple {191#true} ~cond := #in~cond; {191#true} is VALID [2022-02-20 17:39:50,727 INFO L290 TraceCheckUtils]: 4: Hoare triple {191#true} assume !(0 == ~cond); {191#true} is VALID [2022-02-20 17:39:50,727 INFO L290 TraceCheckUtils]: 5: Hoare triple {191#true} assume true; {191#true} is VALID [2022-02-20 17:39:50,727 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {191#true} {191#true} #58#return; {191#true} is VALID [2022-02-20 17:39:50,728 INFO L290 TraceCheckUtils]: 7: Hoare triple {191#true} assume -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647;main_~b~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; {191#true} is VALID [2022-02-20 17:39:50,728 INFO L272 TraceCheckUtils]: 8: Hoare triple {191#true} call assume_abort_if_not((if main_~b~0#1 >= 0 && main_~b~0#1 <= 50 then 1 else 0)); {191#true} is VALID [2022-02-20 17:39:50,728 INFO L290 TraceCheckUtils]: 9: Hoare triple {191#true} ~cond := #in~cond; {191#true} is VALID [2022-02-20 17:39:50,729 INFO L290 TraceCheckUtils]: 10: Hoare triple {191#true} assume !(0 == ~cond); {191#true} is VALID [2022-02-20 17:39:50,729 INFO L290 TraceCheckUtils]: 11: Hoare triple {191#true} assume true; {191#true} is VALID [2022-02-20 17:39:50,729 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {191#true} {191#true} #60#return; {191#true} is VALID [2022-02-20 17:39:50,729 INFO L272 TraceCheckUtils]: 13: Hoare triple {191#true} call assume_abort_if_not((if main_~b~0#1 >= 1 then 1 else 0)); {191#true} is VALID [2022-02-20 17:39:50,729 INFO L290 TraceCheckUtils]: 14: Hoare triple {191#true} ~cond := #in~cond; {191#true} is VALID [2022-02-20 17:39:50,730 INFO L290 TraceCheckUtils]: 15: Hoare triple {191#true} assume !(0 == ~cond); {191#true} is VALID [2022-02-20 17:39:50,730 INFO L290 TraceCheckUtils]: 16: Hoare triple {191#true} assume true; {191#true} is VALID [2022-02-20 17:39:50,730 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {191#true} {191#true} #62#return; {191#true} is VALID [2022-02-20 17:39:50,732 INFO L290 TraceCheckUtils]: 18: Hoare triple {191#true} main_~x~0#1 := main_~a~0#1;main_~y~0#1 := main_~b~0#1;main_~z~0#1 := 0; {250#(and (= |ULTIMATE.start_main_~b~0#1| |ULTIMATE.start_main_~y~0#1|) (= |ULTIMATE.start_main_~z~0#1| 0) (= |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~x~0#1|))} is VALID [2022-02-20 17:39:50,732 INFO L290 TraceCheckUtils]: 19: Hoare triple {250#(and (= |ULTIMATE.start_main_~b~0#1| |ULTIMATE.start_main_~y~0#1|) (= |ULTIMATE.start_main_~z~0#1| 0) (= |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~x~0#1|))} assume !false; {250#(and (= |ULTIMATE.start_main_~b~0#1| |ULTIMATE.start_main_~y~0#1|) (= |ULTIMATE.start_main_~z~0#1| 0) (= |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~x~0#1|))} is VALID [2022-02-20 17:39:50,734 INFO L272 TraceCheckUtils]: 20: Hoare triple {250#(and (= |ULTIMATE.start_main_~b~0#1| |ULTIMATE.start_main_~y~0#1|) (= |ULTIMATE.start_main_~z~0#1| 0) (= |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~x~0#1|))} call __VERIFIER_assert((if main_~z~0#1 + main_~x~0#1 * main_~y~0#1 == main_~a~0#1 * main_~b~0#1 then 1 else 0)); {257#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-02-20 17:39:50,734 INFO L290 TraceCheckUtils]: 21: Hoare triple {257#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {261#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-02-20 17:39:50,736 INFO L290 TraceCheckUtils]: 22: Hoare triple {261#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {192#false} is VALID [2022-02-20 17:39:50,737 INFO L290 TraceCheckUtils]: 23: Hoare triple {192#false} assume !false; {192#false} is VALID [2022-02-20 17:39:50,738 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-02-20 17:39:50,738 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 17:39:50,738 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 17:39:50,738 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1009743266] [2022-02-20 17:39:50,739 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-20 17:39:50,739 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [861489905] [2022-02-20 17:39:50,743 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [861489905] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 17:39:50,743 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 17:39:50,743 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 17:39:50,744 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [768865091] [2022-02-20 17:39:50,744 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 17:39:50,744 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 24 [2022-02-20 17:39:50,745 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 17:39:50,745 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-02-20 17:39:50,762 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:39:50,762 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 17:39:50,763 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 17:39:50,764 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 17:39:50,764 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 17:39:50,764 INFO L87 Difference]: Start difference. First operand 23 states and 27 transitions. Second operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-02-20 17:39:50,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:39:50,915 INFO L93 Difference]: Finished difference Result 35 states and 41 transitions. [2022-02-20 17:39:50,915 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 17:39:50,915 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 24 [2022-02-20 17:39:50,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 17:39:50,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-02-20 17:39:50,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 41 transitions. [2022-02-20 17:39:50,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-02-20 17:39:50,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 41 transitions. [2022-02-20 17:39:50,927 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 41 transitions. [2022-02-20 17:39:50,962 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 41 edges. 41 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:39:50,964 INFO L225 Difference]: With dead ends: 35 [2022-02-20 17:39:50,964 INFO L226 Difference]: Without dead ends: 33 [2022-02-20 17:39:50,964 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 20 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:39:50,966 INFO L933 BasicCegarLoop]: 21 mSDtfsCounter, 8 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 78 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 17:39:50,966 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [9 Valid, 78 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 17:39:50,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2022-02-20 17:39:50,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 29. [2022-02-20 17:39:50,971 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 17:39:50,972 INFO L82 GeneralOperation]: Start isEquivalent. First operand 33 states. Second operand has 29 states, 19 states have (on average 1.1578947368421053) internal successors, (22), 21 states have internal predecessors, (22), 6 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5) [2022-02-20 17:39:50,972 INFO L74 IsIncluded]: Start isIncluded. First operand 33 states. Second operand has 29 states, 19 states have (on average 1.1578947368421053) internal successors, (22), 21 states have internal predecessors, (22), 6 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5) [2022-02-20 17:39:50,972 INFO L87 Difference]: Start difference. First operand 33 states. Second operand has 29 states, 19 states have (on average 1.1578947368421053) internal successors, (22), 21 states have internal predecessors, (22), 6 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5) [2022-02-20 17:39:50,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:39:50,975 INFO L93 Difference]: Finished difference Result 33 states and 39 transitions. [2022-02-20 17:39:50,975 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 39 transitions. [2022-02-20 17:39:50,976 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:39:50,976 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:39:50,976 INFO L74 IsIncluded]: Start isIncluded. First operand has 29 states, 19 states have (on average 1.1578947368421053) internal successors, (22), 21 states have internal predecessors, (22), 6 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5) Second operand 33 states. [2022-02-20 17:39:50,977 INFO L87 Difference]: Start difference. First operand has 29 states, 19 states have (on average 1.1578947368421053) internal successors, (22), 21 states have internal predecessors, (22), 6 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5) Second operand 33 states. [2022-02-20 17:39:50,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:39:50,979 INFO L93 Difference]: Finished difference Result 33 states and 39 transitions. [2022-02-20 17:39:50,979 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 39 transitions. [2022-02-20 17:39:50,980 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:39:50,980 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:39:50,980 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 17:39:50,981 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 17:39:50,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 19 states have (on average 1.1578947368421053) internal successors, (22), 21 states have internal predecessors, (22), 6 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5) [2022-02-20 17:39:50,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 33 transitions. [2022-02-20 17:39:50,983 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 33 transitions. Word has length 24 [2022-02-20 17:39:50,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 17:39:50,983 INFO L470 AbstractCegarLoop]: Abstraction has 29 states and 33 transitions. [2022-02-20 17:39:50,984 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-02-20 17:39:50,984 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 33 transitions. [2022-02-20 17:39:50,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-02-20 17:39:50,985 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:39:50,985 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 17:39:51,011 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:39:51,207 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 17:39:51,208 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 17:39:51,208 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:39:51,209 INFO L85 PathProgramCache]: Analyzing trace with hash -895979555, now seen corresponding path program 1 times [2022-02-20 17:39:51,209 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 17:39:51,209 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1988506812] [2022-02-20 17:39:51,209 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:39:51,209 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 17:39:51,227 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-20 17:39:51,227 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [589699614] [2022-02-20 17:39:51,227 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:39:51,227 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 17:39:51,227 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 17:39:51,229 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:39:51,230 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:39:51,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:39:51,264 INFO L263 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 7 conjunts are in the unsatisfiable core [2022-02-20 17:39:51,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:39:51,273 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 17:39:51,389 INFO L290 TraceCheckUtils]: 0: Hoare triple {422#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); {422#true} is VALID [2022-02-20 17:39:51,389 INFO L290 TraceCheckUtils]: 1: Hoare triple {422#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_~a~0#1, main_~b~0#1, main_~x~0#1, main_~y~0#1, main_~z~0#1;havoc main_~a~0#1;havoc main_~b~0#1;havoc main_~x~0#1;havoc main_~y~0#1;havoc main_~z~0#1;assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;main_~a~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; {422#true} is VALID [2022-02-20 17:39:51,389 INFO L272 TraceCheckUtils]: 2: Hoare triple {422#true} call assume_abort_if_not((if main_~a~0#1 >= 0 && main_~a~0#1 <= 50 then 1 else 0)); {422#true} is VALID [2022-02-20 17:39:51,390 INFO L290 TraceCheckUtils]: 3: Hoare triple {422#true} ~cond := #in~cond; {422#true} is VALID [2022-02-20 17:39:51,390 INFO L290 TraceCheckUtils]: 4: Hoare triple {422#true} assume !(0 == ~cond); {422#true} is VALID [2022-02-20 17:39:51,390 INFO L290 TraceCheckUtils]: 5: Hoare triple {422#true} assume true; {422#true} is VALID [2022-02-20 17:39:51,390 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {422#true} {422#true} #58#return; {422#true} is VALID [2022-02-20 17:39:51,391 INFO L290 TraceCheckUtils]: 7: Hoare triple {422#true} assume -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647;main_~b~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; {422#true} is VALID [2022-02-20 17:39:51,391 INFO L272 TraceCheckUtils]: 8: Hoare triple {422#true} call assume_abort_if_not((if main_~b~0#1 >= 0 && main_~b~0#1 <= 50 then 1 else 0)); {422#true} is VALID [2022-02-20 17:39:51,391 INFO L290 TraceCheckUtils]: 9: Hoare triple {422#true} ~cond := #in~cond; {422#true} is VALID [2022-02-20 17:39:51,391 INFO L290 TraceCheckUtils]: 10: Hoare triple {422#true} assume !(0 == ~cond); {422#true} is VALID [2022-02-20 17:39:51,391 INFO L290 TraceCheckUtils]: 11: Hoare triple {422#true} assume true; {422#true} is VALID [2022-02-20 17:39:51,392 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {422#true} {422#true} #60#return; {422#true} is VALID [2022-02-20 17:39:51,392 INFO L272 TraceCheckUtils]: 13: Hoare triple {422#true} call assume_abort_if_not((if main_~b~0#1 >= 1 then 1 else 0)); {422#true} is VALID [2022-02-20 17:39:51,397 INFO L290 TraceCheckUtils]: 14: Hoare triple {422#true} ~cond := #in~cond; {469#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-02-20 17:39:51,397 INFO L290 TraceCheckUtils]: 15: Hoare triple {469#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {473#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-02-20 17:39:51,397 INFO L290 TraceCheckUtils]: 16: Hoare triple {473#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {473#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-02-20 17:39:51,399 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {473#(not (= |assume_abort_if_not_#in~cond| 0))} {422#true} #62#return; {480#(<= 1 |ULTIMATE.start_main_~b~0#1|)} is VALID [2022-02-20 17:39:51,399 INFO L290 TraceCheckUtils]: 18: Hoare triple {480#(<= 1 |ULTIMATE.start_main_~b~0#1|)} main_~x~0#1 := main_~a~0#1;main_~y~0#1 := main_~b~0#1;main_~z~0#1 := 0; {484#(<= 1 |ULTIMATE.start_main_~y~0#1|)} is VALID [2022-02-20 17:39:51,400 INFO L290 TraceCheckUtils]: 19: Hoare triple {484#(<= 1 |ULTIMATE.start_main_~y~0#1|)} assume !false; {484#(<= 1 |ULTIMATE.start_main_~y~0#1|)} is VALID [2022-02-20 17:39:51,400 INFO L272 TraceCheckUtils]: 20: Hoare triple {484#(<= 1 |ULTIMATE.start_main_~y~0#1|)} call __VERIFIER_assert((if main_~z~0#1 + main_~x~0#1 * main_~y~0#1 == main_~a~0#1 * main_~b~0#1 then 1 else 0)); {422#true} is VALID [2022-02-20 17:39:51,400 INFO L290 TraceCheckUtils]: 21: Hoare triple {422#true} ~cond := #in~cond; {422#true} is VALID [2022-02-20 17:39:51,400 INFO L290 TraceCheckUtils]: 22: Hoare triple {422#true} assume !(0 == ~cond); {422#true} is VALID [2022-02-20 17:39:51,401 INFO L290 TraceCheckUtils]: 23: Hoare triple {422#true} assume true; {422#true} is VALID [2022-02-20 17:39:51,402 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {422#true} {484#(<= 1 |ULTIMATE.start_main_~y~0#1|)} #64#return; {484#(<= 1 |ULTIMATE.start_main_~y~0#1|)} is VALID [2022-02-20 17:39:51,402 INFO L290 TraceCheckUtils]: 25: Hoare triple {484#(<= 1 |ULTIMATE.start_main_~y~0#1|)} assume !(0 != main_~y~0#1); {423#false} is VALID [2022-02-20 17:39:51,402 INFO L272 TraceCheckUtils]: 26: Hoare triple {423#false} call __VERIFIER_assert((if main_~z~0#1 == main_~a~0#1 * main_~b~0#1 then 1 else 0)); {423#false} is VALID [2022-02-20 17:39:51,402 INFO L290 TraceCheckUtils]: 27: Hoare triple {423#false} ~cond := #in~cond; {423#false} is VALID [2022-02-20 17:39:51,403 INFO L290 TraceCheckUtils]: 28: Hoare triple {423#false} assume 0 == ~cond; {423#false} is VALID [2022-02-20 17:39:51,403 INFO L290 TraceCheckUtils]: 29: Hoare triple {423#false} assume !false; {423#false} is VALID [2022-02-20 17:39:51,403 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-02-20 17:39:51,403 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 17:39:51,403 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 17:39:51,406 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1988506812] [2022-02-20 17:39:51,406 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-20 17:39:51,406 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [589699614] [2022-02-20 17:39:51,406 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [589699614] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 17:39:51,406 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 17:39:51,406 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-02-20 17:39:51,407 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [963294046] [2022-02-20 17:39:51,407 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 17:39:51,407 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) Word has length 30 [2022-02-20 17:39:51,408 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 17:39:51,408 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2022-02-20 17:39:51,429 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:39:51,429 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-20 17:39:51,429 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 17:39:51,430 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-20 17:39:51,430 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-02-20 17:39:51,430 INFO L87 Difference]: Start difference. First operand 29 states and 33 transitions. Second operand has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2022-02-20 17:39:51,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:39:51,599 INFO L93 Difference]: Finished difference Result 39 states and 44 transitions. [2022-02-20 17:39:51,599 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-20 17:39:51,599 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) Word has length 30 [2022-02-20 17:39:51,600 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 17:39:51,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2022-02-20 17:39:51,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 41 transitions. [2022-02-20 17:39:51,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2022-02-20 17:39:51,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 41 transitions. [2022-02-20 17:39:51,604 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 41 transitions. [2022-02-20 17:39:51,634 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 41 edges. 41 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:39:51,635 INFO L225 Difference]: With dead ends: 39 [2022-02-20 17:39:51,635 INFO L226 Difference]: Without dead ends: 32 [2022-02-20 17:39:51,636 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-02-20 17:39:51,637 INFO L933 BasicCegarLoop]: 20 mSDtfsCounter, 14 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 79 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 17:39:51,637 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [15 Valid, 79 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 17:39:51,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2022-02-20 17:39:51,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 30. [2022-02-20 17:39:51,655 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 17:39:51,656 INFO L82 GeneralOperation]: Start isEquivalent. First operand 32 states. Second operand has 30 states, 20 states have (on average 1.15) internal successors, (23), 21 states have internal predecessors, (23), 6 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-02-20 17:39:51,656 INFO L74 IsIncluded]: Start isIncluded. First operand 32 states. Second operand has 30 states, 20 states have (on average 1.15) internal successors, (23), 21 states have internal predecessors, (23), 6 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-02-20 17:39:51,659 INFO L87 Difference]: Start difference. First operand 32 states. Second operand has 30 states, 20 states have (on average 1.15) internal successors, (23), 21 states have internal predecessors, (23), 6 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-02-20 17:39:51,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:39:51,665 INFO L93 Difference]: Finished difference Result 32 states and 37 transitions. [2022-02-20 17:39:51,665 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 37 transitions. [2022-02-20 17:39:51,666 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:39:51,667 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:39:51,667 INFO L74 IsIncluded]: Start isIncluded. First operand has 30 states, 20 states have (on average 1.15) internal successors, (23), 21 states have internal predecessors, (23), 6 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand 32 states. [2022-02-20 17:39:51,668 INFO L87 Difference]: Start difference. First operand has 30 states, 20 states have (on average 1.15) internal successors, (23), 21 states have internal predecessors, (23), 6 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand 32 states. [2022-02-20 17:39:51,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:39:51,674 INFO L93 Difference]: Finished difference Result 32 states and 37 transitions. [2022-02-20 17:39:51,675 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 37 transitions. [2022-02-20 17:39:51,675 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:39:51,676 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:39:51,676 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 17:39:51,676 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 17:39:51,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 20 states have (on average 1.15) internal successors, (23), 21 states have internal predecessors, (23), 6 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-02-20 17:39:51,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 34 transitions. [2022-02-20 17:39:51,683 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 34 transitions. Word has length 30 [2022-02-20 17:39:51,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 17:39:51,684 INFO L470 AbstractCegarLoop]: Abstraction has 30 states and 34 transitions. [2022-02-20 17:39:51,684 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2022-02-20 17:39:51,684 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 34 transitions. [2022-02-20 17:39:51,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-02-20 17:39:51,688 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:39:51,689 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 17:39:51,708 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:39:51,895 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2022-02-20 17:39:51,896 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 17:39:51,896 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:39:51,897 INFO L85 PathProgramCache]: Analyzing trace with hash -1371702355, now seen corresponding path program 1 times [2022-02-20 17:39:51,897 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 17:39:51,897 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [275480188] [2022-02-20 17:39:51,897 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:39:51,897 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 17:39:51,914 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-20 17:39:51,914 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [83940908] [2022-02-20 17:39:51,914 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:39:51,914 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 17:39:51,915 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 17:39:51,916 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:39:51,944 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:39:52,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:39:52,249 INFO L263 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 31 conjunts are in the unsatisfiable core [2022-02-20 17:39:52,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:39:52,268 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 17:39:56,777 INFO L290 TraceCheckUtils]: 0: Hoare triple {678#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); {678#true} is VALID [2022-02-20 17:39:56,777 INFO L290 TraceCheckUtils]: 1: Hoare triple {678#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_~a~0#1, main_~b~0#1, main_~x~0#1, main_~y~0#1, main_~z~0#1;havoc main_~a~0#1;havoc main_~b~0#1;havoc main_~x~0#1;havoc main_~y~0#1;havoc main_~z~0#1;assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;main_~a~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; {678#true} is VALID [2022-02-20 17:39:56,777 INFO L272 TraceCheckUtils]: 2: Hoare triple {678#true} call assume_abort_if_not((if main_~a~0#1 >= 0 && main_~a~0#1 <= 50 then 1 else 0)); {678#true} is VALID [2022-02-20 17:39:56,778 INFO L290 TraceCheckUtils]: 3: Hoare triple {678#true} ~cond := #in~cond; {692#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-02-20 17:39:56,778 INFO L290 TraceCheckUtils]: 4: Hoare triple {692#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {696#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-02-20 17:39:56,779 INFO L290 TraceCheckUtils]: 5: Hoare triple {696#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {696#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-02-20 17:39:56,780 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {696#(not (= |assume_abort_if_not_#in~cond| 0))} {678#true} #58#return; {703#(and (<= |ULTIMATE.start_main_~a~0#1| 50) (<= 0 |ULTIMATE.start_main_~a~0#1|))} is VALID [2022-02-20 17:39:56,780 INFO L290 TraceCheckUtils]: 7: Hoare triple {703#(and (<= |ULTIMATE.start_main_~a~0#1| 50) (<= 0 |ULTIMATE.start_main_~a~0#1|))} assume -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647;main_~b~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; {703#(and (<= |ULTIMATE.start_main_~a~0#1| 50) (<= 0 |ULTIMATE.start_main_~a~0#1|))} is VALID [2022-02-20 17:39:56,780 INFO L272 TraceCheckUtils]: 8: Hoare triple {703#(and (<= |ULTIMATE.start_main_~a~0#1| 50) (<= 0 |ULTIMATE.start_main_~a~0#1|))} call assume_abort_if_not((if main_~b~0#1 >= 0 && main_~b~0#1 <= 50 then 1 else 0)); {678#true} is VALID [2022-02-20 17:39:56,781 INFO L290 TraceCheckUtils]: 9: Hoare triple {678#true} ~cond := #in~cond; {678#true} is VALID [2022-02-20 17:39:56,781 INFO L290 TraceCheckUtils]: 10: Hoare triple {678#true} assume !(0 == ~cond); {678#true} is VALID [2022-02-20 17:39:56,781 INFO L290 TraceCheckUtils]: 11: Hoare triple {678#true} assume true; {678#true} is VALID [2022-02-20 17:39:56,783 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {678#true} {703#(and (<= |ULTIMATE.start_main_~a~0#1| 50) (<= 0 |ULTIMATE.start_main_~a~0#1|))} #60#return; {703#(and (<= |ULTIMATE.start_main_~a~0#1| 50) (<= 0 |ULTIMATE.start_main_~a~0#1|))} is VALID [2022-02-20 17:39:56,784 INFO L272 TraceCheckUtils]: 13: Hoare triple {703#(and (<= |ULTIMATE.start_main_~a~0#1| 50) (<= 0 |ULTIMATE.start_main_~a~0#1|))} call assume_abort_if_not((if main_~b~0#1 >= 1 then 1 else 0)); {678#true} is VALID [2022-02-20 17:39:56,784 INFO L290 TraceCheckUtils]: 14: Hoare triple {678#true} ~cond := #in~cond; {678#true} is VALID [2022-02-20 17:39:56,784 INFO L290 TraceCheckUtils]: 15: Hoare triple {678#true} assume !(0 == ~cond); {678#true} is VALID [2022-02-20 17:39:56,784 INFO L290 TraceCheckUtils]: 16: Hoare triple {678#true} assume true; {678#true} is VALID [2022-02-20 17:39:56,786 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {678#true} {703#(and (<= |ULTIMATE.start_main_~a~0#1| 50) (<= 0 |ULTIMATE.start_main_~a~0#1|))} #62#return; {703#(and (<= |ULTIMATE.start_main_~a~0#1| 50) (<= 0 |ULTIMATE.start_main_~a~0#1|))} is VALID [2022-02-20 17:39:56,787 INFO L290 TraceCheckUtils]: 18: Hoare triple {703#(and (<= |ULTIMATE.start_main_~a~0#1| 50) (<= 0 |ULTIMATE.start_main_~a~0#1|))} main_~x~0#1 := main_~a~0#1;main_~y~0#1 := main_~b~0#1;main_~z~0#1 := 0; {740#(and (= |ULTIMATE.start_main_~b~0#1| |ULTIMATE.start_main_~y~0#1|) (<= |ULTIMATE.start_main_~a~0#1| 50) (= |ULTIMATE.start_main_~z~0#1| 0) (<= 0 |ULTIMATE.start_main_~a~0#1|) (= |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~x~0#1|))} is VALID [2022-02-20 17:39:56,787 INFO L290 TraceCheckUtils]: 19: Hoare triple {740#(and (= |ULTIMATE.start_main_~b~0#1| |ULTIMATE.start_main_~y~0#1|) (<= |ULTIMATE.start_main_~a~0#1| 50) (= |ULTIMATE.start_main_~z~0#1| 0) (<= 0 |ULTIMATE.start_main_~a~0#1|) (= |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~x~0#1|))} assume !false; {740#(and (= |ULTIMATE.start_main_~b~0#1| |ULTIMATE.start_main_~y~0#1|) (<= |ULTIMATE.start_main_~a~0#1| 50) (= |ULTIMATE.start_main_~z~0#1| 0) (<= 0 |ULTIMATE.start_main_~a~0#1|) (= |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~x~0#1|))} is VALID [2022-02-20 17:39:56,787 INFO L272 TraceCheckUtils]: 20: Hoare triple {740#(and (= |ULTIMATE.start_main_~b~0#1| |ULTIMATE.start_main_~y~0#1|) (<= |ULTIMATE.start_main_~a~0#1| 50) (= |ULTIMATE.start_main_~z~0#1| 0) (<= 0 |ULTIMATE.start_main_~a~0#1|) (= |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~x~0#1|))} call __VERIFIER_assert((if main_~z~0#1 + main_~x~0#1 * main_~y~0#1 == main_~a~0#1 * main_~b~0#1 then 1 else 0)); {678#true} is VALID [2022-02-20 17:39:56,788 INFO L290 TraceCheckUtils]: 21: Hoare triple {678#true} ~cond := #in~cond; {750#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-02-20 17:39:56,788 INFO L290 TraceCheckUtils]: 22: Hoare triple {750#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {754#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-02-20 17:39:56,789 INFO L290 TraceCheckUtils]: 23: Hoare triple {754#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {754#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-02-20 17:39:56,789 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {754#(not (= |__VERIFIER_assert_#in~cond| 0))} {740#(and (= |ULTIMATE.start_main_~b~0#1| |ULTIMATE.start_main_~y~0#1|) (<= |ULTIMATE.start_main_~a~0#1| 50) (= |ULTIMATE.start_main_~z~0#1| 0) (<= 0 |ULTIMATE.start_main_~a~0#1|) (= |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~x~0#1|))} #64#return; {740#(and (= |ULTIMATE.start_main_~b~0#1| |ULTIMATE.start_main_~y~0#1|) (<= |ULTIMATE.start_main_~a~0#1| 50) (= |ULTIMATE.start_main_~z~0#1| 0) (<= 0 |ULTIMATE.start_main_~a~0#1|) (= |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~x~0#1|))} is VALID [2022-02-20 17:39:56,790 INFO L290 TraceCheckUtils]: 25: Hoare triple {740#(and (= |ULTIMATE.start_main_~b~0#1| |ULTIMATE.start_main_~y~0#1|) (<= |ULTIMATE.start_main_~a~0#1| 50) (= |ULTIMATE.start_main_~z~0#1| 0) (<= 0 |ULTIMATE.start_main_~a~0#1|) (= |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~x~0#1|))} assume !!(0 != main_~y~0#1); {764#(and (not (= |ULTIMATE.start_main_~y~0#1| 0)) (= |ULTIMATE.start_main_~b~0#1| |ULTIMATE.start_main_~y~0#1|) (<= |ULTIMATE.start_main_~a~0#1| 50) (= |ULTIMATE.start_main_~z~0#1| 0) (<= 0 |ULTIMATE.start_main_~a~0#1|) (= |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~x~0#1|))} is VALID [2022-02-20 17:39:56,791 INFO L290 TraceCheckUtils]: 26: Hoare triple {764#(and (not (= |ULTIMATE.start_main_~y~0#1| 0)) (= |ULTIMATE.start_main_~b~0#1| |ULTIMATE.start_main_~y~0#1|) (<= |ULTIMATE.start_main_~a~0#1| 50) (= |ULTIMATE.start_main_~z~0#1| 0) (<= 0 |ULTIMATE.start_main_~a~0#1|) (= |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~x~0#1|))} assume 1 == (if main_~y~0#1 < 0 && 0 != main_~y~0#1 % 2 then main_~y~0#1 % 2 - 2 else main_~y~0#1 % 2);main_~z~0#1 := main_~z~0#1 + main_~x~0#1;main_~y~0#1 := main_~y~0#1 - 1; {768#(and (<= 0 |ULTIMATE.start_main_~b~0#1|) (<= 1 (mod |ULTIMATE.start_main_~b~0#1| 2)) (= (+ |ULTIMATE.start_main_~y~0#1| 1) |ULTIMATE.start_main_~b~0#1|) (<= |ULTIMATE.start_main_~a~0#1| 50) (= |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~z~0#1|) (<= 0 |ULTIMATE.start_main_~a~0#1|) (= |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~x~0#1|))} is VALID [2022-02-20 17:39:56,792 INFO L290 TraceCheckUtils]: 27: Hoare triple {768#(and (<= 0 |ULTIMATE.start_main_~b~0#1|) (<= 1 (mod |ULTIMATE.start_main_~b~0#1| 2)) (= (+ |ULTIMATE.start_main_~y~0#1| 1) |ULTIMATE.start_main_~b~0#1|) (<= |ULTIMATE.start_main_~a~0#1| 50) (= |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~z~0#1|) (<= 0 |ULTIMATE.start_main_~a~0#1|) (= |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~x~0#1|))} main_~x~0#1 := 2 * main_~x~0#1;main_~y~0#1 := (if main_~y~0#1 < 0 && 0 != main_~y~0#1 % 2 then 1 + main_~y~0#1 / 2 else main_~y~0#1 / 2); {772#(and (<= 0 |ULTIMATE.start_main_~b~0#1|) (<= 1 (mod |ULTIMATE.start_main_~b~0#1| 2)) (= (div (+ (- 1) |ULTIMATE.start_main_~b~0#1|) 2) |ULTIMATE.start_main_~y~0#1|) (= |ULTIMATE.start_main_~x~0#1| (* 2 |ULTIMATE.start_main_~z~0#1|)) (<= |ULTIMATE.start_main_~a~0#1| 50) (= |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~z~0#1|) (<= 0 |ULTIMATE.start_main_~a~0#1|))} is VALID [2022-02-20 17:39:56,793 INFO L290 TraceCheckUtils]: 28: Hoare triple {772#(and (<= 0 |ULTIMATE.start_main_~b~0#1|) (<= 1 (mod |ULTIMATE.start_main_~b~0#1| 2)) (= (div (+ (- 1) |ULTIMATE.start_main_~b~0#1|) 2) |ULTIMATE.start_main_~y~0#1|) (= |ULTIMATE.start_main_~x~0#1| (* 2 |ULTIMATE.start_main_~z~0#1|)) (<= |ULTIMATE.start_main_~a~0#1| 50) (= |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~z~0#1|) (<= 0 |ULTIMATE.start_main_~a~0#1|))} assume !false; {772#(and (<= 0 |ULTIMATE.start_main_~b~0#1|) (<= 1 (mod |ULTIMATE.start_main_~b~0#1| 2)) (= (div (+ (- 1) |ULTIMATE.start_main_~b~0#1|) 2) |ULTIMATE.start_main_~y~0#1|) (= |ULTIMATE.start_main_~x~0#1| (* 2 |ULTIMATE.start_main_~z~0#1|)) (<= |ULTIMATE.start_main_~a~0#1| 50) (= |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~z~0#1|) (<= 0 |ULTIMATE.start_main_~a~0#1|))} is VALID [2022-02-20 17:39:57,449 INFO L272 TraceCheckUtils]: 29: Hoare triple {772#(and (<= 0 |ULTIMATE.start_main_~b~0#1|) (<= 1 (mod |ULTIMATE.start_main_~b~0#1| 2)) (= (div (+ (- 1) |ULTIMATE.start_main_~b~0#1|) 2) |ULTIMATE.start_main_~y~0#1|) (= |ULTIMATE.start_main_~x~0#1| (* 2 |ULTIMATE.start_main_~z~0#1|)) (<= |ULTIMATE.start_main_~a~0#1| 50) (= |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~z~0#1|) (<= 0 |ULTIMATE.start_main_~a~0#1|))} call __VERIFIER_assert((if main_~z~0#1 + main_~x~0#1 * main_~y~0#1 == main_~a~0#1 * main_~b~0#1 then 1 else 0)); {779#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-02-20 17:39:57,450 INFO L290 TraceCheckUtils]: 30: Hoare triple {779#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {783#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-02-20 17:39:57,452 INFO L290 TraceCheckUtils]: 31: Hoare triple {783#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {679#false} is VALID [2022-02-20 17:39:57,452 INFO L290 TraceCheckUtils]: 32: Hoare triple {679#false} assume !false; {679#false} is VALID [2022-02-20 17:39:57,453 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 1 proven. 9 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-02-20 17:39:57,453 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 17:41:00,770 INFO L290 TraceCheckUtils]: 32: Hoare triple {679#false} assume !false; {679#false} is VALID [2022-02-20 17:41:00,772 INFO L290 TraceCheckUtils]: 31: Hoare triple {783#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {679#false} is VALID [2022-02-20 17:41:00,772 INFO L290 TraceCheckUtils]: 30: Hoare triple {779#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {783#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-02-20 17:41:00,773 INFO L272 TraceCheckUtils]: 29: Hoare triple {799#(= (+ |ULTIMATE.start_main_~z~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|))} call __VERIFIER_assert((if main_~z~0#1 + main_~x~0#1 * main_~y~0#1 == main_~a~0#1 * main_~b~0#1 then 1 else 0)); {779#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-02-20 17:41:00,774 INFO L290 TraceCheckUtils]: 28: Hoare triple {799#(= (+ |ULTIMATE.start_main_~z~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|))} assume !false; {799#(= (+ |ULTIMATE.start_main_~z~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|))} is VALID [2022-02-20 17:41:00,781 INFO L290 TraceCheckUtils]: 27: Hoare triple {806#(and (or (= (+ (* (* 2 |ULTIMATE.start_main_~x~0#1|) (div |ULTIMATE.start_main_~y~0#1| 2)) |ULTIMATE.start_main_~z~0#1|) (* |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~b~0#1|)) (and (< |ULTIMATE.start_main_~y~0#1| 0) (not (= (mod |ULTIMATE.start_main_~y~0#1| 2) 0)))) (or (= (+ |ULTIMATE.start_main_~z~0#1| (* (* 2 |ULTIMATE.start_main_~x~0#1|) (+ 1 (div |ULTIMATE.start_main_~y~0#1| 2)))) (* |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~b~0#1|)) (= (mod |ULTIMATE.start_main_~y~0#1| 2) 0) (not (< |ULTIMATE.start_main_~y~0#1| 0))))} main_~x~0#1 := 2 * main_~x~0#1;main_~y~0#1 := (if main_~y~0#1 < 0 && 0 != main_~y~0#1 % 2 then 1 + main_~y~0#1 / 2 else main_~y~0#1 / 2); {799#(= (+ |ULTIMATE.start_main_~z~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|))} is VALID [2022-02-20 17:41:00,784 INFO L290 TraceCheckUtils]: 26: Hoare triple {810#(or (not (<= 1 (mod |ULTIMATE.start_main_~y~0#1| 2))) (< |ULTIMATE.start_main_~y~0#1| 0) (= (+ |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~z~0#1| (* (* 2 |ULTIMATE.start_main_~x~0#1|) (div (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 2))) (* |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~b~0#1|)))} assume 1 == (if main_~y~0#1 < 0 && 0 != main_~y~0#1 % 2 then main_~y~0#1 % 2 - 2 else main_~y~0#1 % 2);main_~z~0#1 := main_~z~0#1 + main_~x~0#1;main_~y~0#1 := main_~y~0#1 - 1; {806#(and (or (= (+ (* (* 2 |ULTIMATE.start_main_~x~0#1|) (div |ULTIMATE.start_main_~y~0#1| 2)) |ULTIMATE.start_main_~z~0#1|) (* |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~b~0#1|)) (and (< |ULTIMATE.start_main_~y~0#1| 0) (not (= (mod |ULTIMATE.start_main_~y~0#1| 2) 0)))) (or (= (+ |ULTIMATE.start_main_~z~0#1| (* (* 2 |ULTIMATE.start_main_~x~0#1|) (+ 1 (div |ULTIMATE.start_main_~y~0#1| 2)))) (* |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~b~0#1|)) (= (mod |ULTIMATE.start_main_~y~0#1| 2) 0) (not (< |ULTIMATE.start_main_~y~0#1| 0))))} is VALID [2022-02-20 17:41:00,785 INFO L290 TraceCheckUtils]: 25: Hoare triple {810#(or (not (<= 1 (mod |ULTIMATE.start_main_~y~0#1| 2))) (< |ULTIMATE.start_main_~y~0#1| 0) (= (+ |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~z~0#1| (* (* 2 |ULTIMATE.start_main_~x~0#1|) (div (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 2))) (* |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~b~0#1|)))} assume !!(0 != main_~y~0#1); {810#(or (not (<= 1 (mod |ULTIMATE.start_main_~y~0#1| 2))) (< |ULTIMATE.start_main_~y~0#1| 0) (= (+ |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~z~0#1| (* (* 2 |ULTIMATE.start_main_~x~0#1|) (div (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 2))) (* |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~b~0#1|)))} is VALID [2022-02-20 17:41:02,177 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {754#(not (= |__VERIFIER_assert_#in~cond| 0))} {678#true} #64#return; {810#(or (not (<= 1 (mod |ULTIMATE.start_main_~y~0#1| 2))) (< |ULTIMATE.start_main_~y~0#1| 0) (= (+ |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~z~0#1| (* (* 2 |ULTIMATE.start_main_~x~0#1|) (div (+ (- 1) |ULTIMATE.start_main_~y~0#1|) 2))) (* |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~b~0#1|)))} is VALID [2022-02-20 17:41:02,178 INFO L290 TraceCheckUtils]: 23: Hoare triple {754#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {754#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-02-20 17:41:02,179 INFO L290 TraceCheckUtils]: 22: Hoare triple {826#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {754#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-02-20 17:41:02,179 INFO L290 TraceCheckUtils]: 21: Hoare triple {678#true} ~cond := #in~cond; {826#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-02-20 17:41:02,179 INFO L272 TraceCheckUtils]: 20: Hoare triple {678#true} call __VERIFIER_assert((if main_~z~0#1 + main_~x~0#1 * main_~y~0#1 == main_~a~0#1 * main_~b~0#1 then 1 else 0)); {678#true} is VALID [2022-02-20 17:41:02,179 INFO L290 TraceCheckUtils]: 19: Hoare triple {678#true} assume !false; {678#true} is VALID [2022-02-20 17:41:02,179 INFO L290 TraceCheckUtils]: 18: Hoare triple {678#true} main_~x~0#1 := main_~a~0#1;main_~y~0#1 := main_~b~0#1;main_~z~0#1 := 0; {678#true} is VALID [2022-02-20 17:41:02,180 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {678#true} {678#true} #62#return; {678#true} is VALID [2022-02-20 17:41:02,180 INFO L290 TraceCheckUtils]: 16: Hoare triple {678#true} assume true; {678#true} is VALID [2022-02-20 17:41:02,180 INFO L290 TraceCheckUtils]: 15: Hoare triple {678#true} assume !(0 == ~cond); {678#true} is VALID [2022-02-20 17:41:02,180 INFO L290 TraceCheckUtils]: 14: Hoare triple {678#true} ~cond := #in~cond; {678#true} is VALID [2022-02-20 17:41:02,180 INFO L272 TraceCheckUtils]: 13: Hoare triple {678#true} call assume_abort_if_not((if main_~b~0#1 >= 1 then 1 else 0)); {678#true} is VALID [2022-02-20 17:41:02,180 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {678#true} {678#true} #60#return; {678#true} is VALID [2022-02-20 17:41:02,180 INFO L290 TraceCheckUtils]: 11: Hoare triple {678#true} assume true; {678#true} is VALID [2022-02-20 17:41:02,180 INFO L290 TraceCheckUtils]: 10: Hoare triple {678#true} assume !(0 == ~cond); {678#true} is VALID [2022-02-20 17:41:02,180 INFO L290 TraceCheckUtils]: 9: Hoare triple {678#true} ~cond := #in~cond; {678#true} is VALID [2022-02-20 17:41:02,180 INFO L272 TraceCheckUtils]: 8: Hoare triple {678#true} call assume_abort_if_not((if main_~b~0#1 >= 0 && main_~b~0#1 <= 50 then 1 else 0)); {678#true} is VALID [2022-02-20 17:41:02,181 INFO L290 TraceCheckUtils]: 7: Hoare triple {678#true} assume -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647;main_~b~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; {678#true} is VALID [2022-02-20 17:41:02,181 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {678#true} {678#true} #58#return; {678#true} is VALID [2022-02-20 17:41:02,181 INFO L290 TraceCheckUtils]: 5: Hoare triple {678#true} assume true; {678#true} is VALID [2022-02-20 17:41:02,181 INFO L290 TraceCheckUtils]: 4: Hoare triple {678#true} assume !(0 == ~cond); {678#true} is VALID [2022-02-20 17:41:02,181 INFO L290 TraceCheckUtils]: 3: Hoare triple {678#true} ~cond := #in~cond; {678#true} is VALID [2022-02-20 17:41:02,181 INFO L272 TraceCheckUtils]: 2: Hoare triple {678#true} call assume_abort_if_not((if main_~a~0#1 >= 0 && main_~a~0#1 <= 50 then 1 else 0)); {678#true} is VALID [2022-02-20 17:41:02,181 INFO L290 TraceCheckUtils]: 1: Hoare triple {678#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_~a~0#1, main_~b~0#1, main_~x~0#1, main_~y~0#1, main_~z~0#1;havoc main_~a~0#1;havoc main_~b~0#1;havoc main_~x~0#1;havoc main_~y~0#1;havoc main_~z~0#1;assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;main_~a~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; {678#true} is VALID [2022-02-20 17:41:02,181 INFO L290 TraceCheckUtils]: 0: Hoare triple {678#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); {678#true} is VALID [2022-02-20 17:41:02,182 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-02-20 17:41:02,182 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 17:41:02,182 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [275480188] [2022-02-20 17:41:02,182 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-20 17:41:02,182 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [83940908] [2022-02-20 17:41:02,182 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [83940908] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 17:41:02,182 INFO L191 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-02-20 17:41:02,182 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 9] total 17 [2022-02-20 17:41:02,183 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [297206034] [2022-02-20 17:41:02,183 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-02-20 17:41:02,183 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 1.7647058823529411) internal successors, (30), 16 states have internal predecessors, (30), 5 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (8), 4 states have call predecessors, (8), 3 states have call successors, (8) Word has length 33 [2022-02-20 17:41:02,184 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 17:41:02,184 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 17 states, 17 states have (on average 1.7647058823529411) internal successors, (30), 16 states have internal predecessors, (30), 5 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (8), 4 states have call predecessors, (8), 3 states have call successors, (8) [2022-02-20 17:41:04,261 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 47 edges. 47 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:41:04,261 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-02-20 17:41:04,261 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 17:41:04,262 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-02-20 17:41:04,262 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=222, Unknown=0, NotChecked=0, Total=272 [2022-02-20 17:41:04,263 INFO L87 Difference]: Start difference. First operand 30 states and 34 transitions. Second operand has 17 states, 17 states have (on average 1.7647058823529411) internal successors, (30), 16 states have internal predecessors, (30), 5 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (8), 4 states have call predecessors, (8), 3 states have call successors, (8)