./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/nla-digbench-scaling/hard-u_valuebound1.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/hard-u_valuebound1.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 2205701c87619eed0a8a76ebf684289d4e97e42556aa5e531d0e97f394ad4619 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 17:31:05,294 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 17:31:05,296 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 17:31:05,335 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 17:31:05,335 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 17:31:05,336 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 17:31:05,337 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 17:31:05,339 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 17:31:05,340 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 17:31:05,341 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 17:31:05,342 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 17:31:05,342 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 17:31:05,343 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 17:31:05,344 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 17:31:05,345 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 17:31:05,346 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 17:31:05,346 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 17:31:05,347 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 17:31:05,348 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 17:31:05,350 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 17:31:05,351 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 17:31:05,352 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 17:31:05,353 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 17:31:05,354 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 17:31:05,357 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 17:31:05,357 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 17:31:05,357 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 17:31:05,358 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 17:31:05,359 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 17:31:05,359 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 17:31:05,360 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 17:31:05,360 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 17:31:05,361 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 17:31:05,362 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 17:31:05,362 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 17:31:05,363 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 17:31:05,363 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 17:31:05,364 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 17:31:05,364 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 17:31:05,365 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 17:31:05,365 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 17:31:05,366 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-02-20 17:31:05,385 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 17:31:05,385 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 17:31:05,385 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 17:31:05,385 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 17:31:05,386 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 17:31:05,386 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 17:31:05,387 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 17:31:05,387 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 17:31:05,387 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 17:31:05,388 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 17:31:05,388 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 17:31:05,388 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 17:31:05,388 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 17:31:05,389 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 17:31:05,389 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 17:31:05,389 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 17:31:05,389 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 17:31:05,389 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 17:31:05,390 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 17:31:05,390 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 17:31:05,390 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 17:31:05,390 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 17:31:05,391 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 17:31:05,391 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 17:31:05,391 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 17:31:05,391 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 17:31:05,392 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 17:31:05,392 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 17:31:05,392 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-20 17:31:05,392 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-20 17:31:05,392 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 17:31:05,393 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 17:31:05,393 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 17:31:05,393 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 -> 2205701c87619eed0a8a76ebf684289d4e97e42556aa5e531d0e97f394ad4619 [2022-02-20 17:31:05,658 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 17:31:05,683 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 17:31:05,687 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 17:31:05,688 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 17:31:05,691 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 17:31:05,693 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/nla-digbench-scaling/hard-u_valuebound1.c [2022-02-20 17:31:05,784 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/93c83428e/48eb3397ae05498388b896ed6e05bd11/FLAG3bc9d2ea7 [2022-02-20 17:31:06,208 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 17:31:06,209 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/hard-u_valuebound1.c [2022-02-20 17:31:06,218 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/93c83428e/48eb3397ae05498388b896ed6e05bd11/FLAG3bc9d2ea7 [2022-02-20 17:31:06,606 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/93c83428e/48eb3397ae05498388b896ed6e05bd11 [2022-02-20 17:31:06,608 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 17:31:06,610 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 17:31:06,615 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 17:31:06,615 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 17:31:06,618 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 17:31:06,619 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 05:31:06" (1/1) ... [2022-02-20 17:31:06,621 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4fdcd884 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:31:06, skipping insertion in model container [2022-02-20 17:31:06,621 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 05:31:06" (1/1) ... [2022-02-20 17:31:06,627 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 17:31:06,641 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 17:31:06,779 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/hard-u_valuebound1.c[537,550] [2022-02-20 17:31:06,796 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 17:31:06,804 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 17:31:06,815 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/hard-u_valuebound1.c[537,550] [2022-02-20 17:31:06,828 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 17:31:06,839 INFO L208 MainTranslator]: Completed translation [2022-02-20 17:31:06,840 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:31:06 WrapperNode [2022-02-20 17:31:06,840 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 17:31:06,841 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 17:31:06,841 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 17:31:06,841 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 17:31:06,846 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:31:06" (1/1) ... [2022-02-20 17:31:06,851 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:31:06" (1/1) ... [2022-02-20 17:31:06,871 INFO L137 Inliner]: procedures = 14, calls = 17, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 55 [2022-02-20 17:31:06,872 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 17:31:06,872 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 17:31:06,873 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 17:31:06,873 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 17:31:06,880 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:31:06" (1/1) ... [2022-02-20 17:31:06,881 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:31:06" (1/1) ... [2022-02-20 17:31:06,891 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:31:06" (1/1) ... [2022-02-20 17:31:06,893 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:31:06" (1/1) ... [2022-02-20 17:31:06,897 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:31:06" (1/1) ... [2022-02-20 17:31:06,906 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:31:06" (1/1) ... [2022-02-20 17:31:06,909 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:31:06" (1/1) ... [2022-02-20 17:31:06,911 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 17:31:06,917 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 17:31:06,918 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 17:31:06,919 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 17:31:06,920 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:31:06" (1/1) ... [2022-02-20 17:31:06,926 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 17:31:06,935 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 17:31:06,953 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-02-20 17:31:06,957 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-02-20 17:31:06,986 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 17:31:06,986 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-02-20 17:31:06,986 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-02-20 17:31:06,987 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-20 17:31:06,987 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 17:31:06,987 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 17:31:06,987 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-02-20 17:31:06,988 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-02-20 17:31:07,040 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 17:31:07,041 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 17:31:07,262 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 17:31:07,269 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 17:31:07,273 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-02-20 17:31:07,275 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 05:31:07 BoogieIcfgContainer [2022-02-20 17:31:07,287 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 17:31:07,289 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 17:31:07,289 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 17:31:07,292 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 17:31:07,292 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 05:31:06" (1/3) ... [2022-02-20 17:31:07,293 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@64dbb5f3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 05:31:07, skipping insertion in model container [2022-02-20 17:31:07,293 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:31:06" (2/3) ... [2022-02-20 17:31:07,293 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@64dbb5f3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 05:31:07, skipping insertion in model container [2022-02-20 17:31:07,293 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 05:31:07" (3/3) ... [2022-02-20 17:31:07,294 INFO L111 eAbstractionObserver]: Analyzing ICFG hard-u_valuebound1.c [2022-02-20 17:31:07,307 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 17:31:07,307 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-02-20 17:31:07,370 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 17:31:07,376 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2022-02-20 17:31:07,376 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-02-20 17:31:07,409 INFO L276 IsEmpty]: Start isEmpty. Operand has 33 states, 19 states have (on average 1.5263157894736843) internal successors, (29), 20 states have internal predecessors, (29), 10 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-02-20 17:31:07,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-02-20 17:31:07,417 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:31:07,417 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:31:07,418 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 17:31:07,423 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:31:07,424 INFO L85 PathProgramCache]: Analyzing trace with hash -487550744, now seen corresponding path program 1 times [2022-02-20 17:31:07,432 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 17:31:07,434 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [654036117] [2022-02-20 17:31:07,434 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:31:07,435 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 17:31:07,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:31:07,596 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-02-20 17:31:07,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:31:07,628 INFO L290 TraceCheckUtils]: 0: Hoare triple {36#true} ~cond := #in~cond; {36#true} is VALID [2022-02-20 17:31:07,629 INFO L290 TraceCheckUtils]: 1: Hoare triple {36#true} assume 0 == ~cond;assume false; {37#false} is VALID [2022-02-20 17:31:07,630 INFO L290 TraceCheckUtils]: 2: Hoare triple {37#false} assume true; {37#false} is VALID [2022-02-20 17:31:07,630 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {37#false} {36#true} #78#return; {37#false} is VALID [2022-02-20 17:31:07,631 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-02-20 17:31:07,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:31:07,651 INFO L290 TraceCheckUtils]: 0: Hoare triple {36#true} ~cond := #in~cond; {36#true} is VALID [2022-02-20 17:31:07,652 INFO L290 TraceCheckUtils]: 1: Hoare triple {36#true} assume 0 == ~cond;assume false; {37#false} is VALID [2022-02-20 17:31:07,652 INFO L290 TraceCheckUtils]: 2: Hoare triple {37#false} assume true; {37#false} is VALID [2022-02-20 17:31:07,652 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {37#false} {37#false} #80#return; {37#false} is VALID [2022-02-20 17:31:07,653 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-02-20 17:31:07,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:31:07,666 INFO L290 TraceCheckUtils]: 0: Hoare triple {36#true} ~cond := #in~cond; {36#true} is VALID [2022-02-20 17:31:07,667 INFO L290 TraceCheckUtils]: 1: Hoare triple {36#true} assume 0 == ~cond;assume false; {37#false} is VALID [2022-02-20 17:31:07,667 INFO L290 TraceCheckUtils]: 2: Hoare triple {37#false} assume true; {37#false} is VALID [2022-02-20 17:31:07,667 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {37#false} {37#false} #82#return; {37#false} is VALID [2022-02-20 17:31:07,668 INFO L290 TraceCheckUtils]: 0: Hoare triple {36#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3); {36#true} is VALID [2022-02-20 17:31:07,668 INFO L290 TraceCheckUtils]: 1: Hoare triple {36#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_~r~0#1, main_~d~0#1, main_~p~0#1, main_~q~0#1;havoc main_~A~0#1;havoc main_~B~0#1;havoc main_~r~0#1;havoc main_~d~0#1;havoc main_~p~0#1;havoc main_~q~0#1;main_~A~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; {36#true} is VALID [2022-02-20 17:31:07,668 INFO L272 TraceCheckUtils]: 2: Hoare triple {36#true} call assume_abort_if_not((if main_~A~0#1 % 4294967296 >= 0 && main_~A~0#1 % 4294967296 <= 1 then 1 else 0)); {36#true} is VALID [2022-02-20 17:31:07,669 INFO L290 TraceCheckUtils]: 3: Hoare triple {36#true} ~cond := #in~cond; {36#true} is VALID [2022-02-20 17:31:07,670 INFO L290 TraceCheckUtils]: 4: Hoare triple {36#true} assume 0 == ~cond;assume false; {37#false} is VALID [2022-02-20 17:31:07,670 INFO L290 TraceCheckUtils]: 5: Hoare triple {37#false} assume true; {37#false} is VALID [2022-02-20 17:31:07,670 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {37#false} {36#true} #78#return; {37#false} is VALID [2022-02-20 17:31:07,671 INFO L290 TraceCheckUtils]: 7: Hoare triple {37#false} main_~B~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; {37#false} is VALID [2022-02-20 17:31:07,671 INFO L272 TraceCheckUtils]: 8: Hoare triple {37#false} call assume_abort_if_not((if main_~B~0#1 % 4294967296 >= 0 && main_~B~0#1 % 4294967296 <= 1 then 1 else 0)); {36#true} is VALID [2022-02-20 17:31:07,671 INFO L290 TraceCheckUtils]: 9: Hoare triple {36#true} ~cond := #in~cond; {36#true} is VALID [2022-02-20 17:31:07,672 INFO L290 TraceCheckUtils]: 10: Hoare triple {36#true} assume 0 == ~cond;assume false; {37#false} is VALID [2022-02-20 17:31:07,672 INFO L290 TraceCheckUtils]: 11: Hoare triple {37#false} assume true; {37#false} is VALID [2022-02-20 17:31:07,673 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {37#false} {37#false} #80#return; {37#false} is VALID [2022-02-20 17:31:07,673 INFO L272 TraceCheckUtils]: 13: Hoare triple {37#false} call assume_abort_if_not((if main_~B~0#1 % 4294967296 >= 1 then 1 else 0)); {36#true} is VALID [2022-02-20 17:31:07,673 INFO L290 TraceCheckUtils]: 14: Hoare triple {36#true} ~cond := #in~cond; {36#true} is VALID [2022-02-20 17:31:07,674 INFO L290 TraceCheckUtils]: 15: Hoare triple {36#true} assume 0 == ~cond;assume false; {37#false} is VALID [2022-02-20 17:31:07,674 INFO L290 TraceCheckUtils]: 16: Hoare triple {37#false} assume true; {37#false} is VALID [2022-02-20 17:31:07,675 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {37#false} {37#false} #82#return; {37#false} is VALID [2022-02-20 17:31:07,675 INFO L290 TraceCheckUtils]: 18: Hoare triple {37#false} main_~r~0#1 := main_~A~0#1;main_~d~0#1 := main_~B~0#1;main_~p~0#1 := 1;main_~q~0#1 := 0; {37#false} is VALID [2022-02-20 17:31:07,675 INFO L290 TraceCheckUtils]: 19: Hoare triple {37#false} assume !false; {37#false} is VALID [2022-02-20 17:31:07,676 INFO L272 TraceCheckUtils]: 20: Hoare triple {37#false} call __VERIFIER_assert((if 0 == main_~q~0#1 % 4294967296 then 1 else 0)); {37#false} is VALID [2022-02-20 17:31:07,676 INFO L290 TraceCheckUtils]: 21: Hoare triple {37#false} ~cond := #in~cond; {37#false} is VALID [2022-02-20 17:31:07,676 INFO L290 TraceCheckUtils]: 22: Hoare triple {37#false} assume 0 == ~cond; {37#false} is VALID [2022-02-20 17:31:07,676 INFO L290 TraceCheckUtils]: 23: Hoare triple {37#false} assume !false; {37#false} is VALID [2022-02-20 17:31:07,677 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:31:07,678 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 17:31:07,678 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [654036117] [2022-02-20 17:31:07,679 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [654036117] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 17:31:07,679 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 17:31:07,680 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-20 17:31:07,681 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2083971802] [2022-02-20 17:31:07,682 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 17:31:07,687 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:31:07,689 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 17:31:07,692 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:31:07,724 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:31:07,724 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-02-20 17:31:07,724 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 17:31:07,753 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-02-20 17:31:07,755 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-02-20 17:31:07,758 INFO L87 Difference]: Start difference. First operand has 33 states, 19 states have (on average 1.5263157894736843) internal successors, (29), 20 states have internal predecessors, (29), 10 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) 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:31:07,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:31:07,826 INFO L93 Difference]: Finished difference Result 63 states and 104 transitions. [2022-02-20 17:31:07,826 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-20 17:31:07,827 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:31:07,827 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 17:31:07,828 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:31:07,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 104 transitions. [2022-02-20 17:31:07,839 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:31:07,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 104 transitions. [2022-02-20 17:31:07,847 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 104 transitions. [2022-02-20 17:31:08,012 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 104 edges. 104 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:31:08,025 INFO L225 Difference]: With dead ends: 63 [2022-02-20 17:31:08,025 INFO L226 Difference]: Without dead ends: 29 [2022-02-20 17:31:08,029 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:31:08,036 INFO L933 BasicCegarLoop]: 43 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, 43 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 17:31:08,037 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 17:31:08,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2022-02-20 17:31:08,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2022-02-20 17:31:08,070 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 17:31:08,070 INFO L82 GeneralOperation]: Start isEquivalent. First operand 29 states. Second operand has 29 states, 16 states have (on average 1.25) internal successors, (20), 17 states have internal predecessors, (20), 10 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-02-20 17:31:08,071 INFO L74 IsIncluded]: Start isIncluded. First operand 29 states. Second operand has 29 states, 16 states have (on average 1.25) internal successors, (20), 17 states have internal predecessors, (20), 10 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-02-20 17:31:08,072 INFO L87 Difference]: Start difference. First operand 29 states. Second operand has 29 states, 16 states have (on average 1.25) internal successors, (20), 17 states have internal predecessors, (20), 10 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-02-20 17:31:08,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:31:08,077 INFO L93 Difference]: Finished difference Result 29 states and 39 transitions. [2022-02-20 17:31:08,077 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 39 transitions. [2022-02-20 17:31:08,078 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:31:08,078 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:31:08,078 INFO L74 IsIncluded]: Start isIncluded. First operand has 29 states, 16 states have (on average 1.25) internal successors, (20), 17 states have internal predecessors, (20), 10 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Second operand 29 states. [2022-02-20 17:31:08,079 INFO L87 Difference]: Start difference. First operand has 29 states, 16 states have (on average 1.25) internal successors, (20), 17 states have internal predecessors, (20), 10 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Second operand 29 states. [2022-02-20 17:31:08,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:31:08,083 INFO L93 Difference]: Finished difference Result 29 states and 39 transitions. [2022-02-20 17:31:08,083 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 39 transitions. [2022-02-20 17:31:08,084 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:31:08,084 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:31:08,084 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 17:31:08,085 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 17:31:08,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 16 states have (on average 1.25) internal successors, (20), 17 states have internal predecessors, (20), 10 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-02-20 17:31:08,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 39 transitions. [2022-02-20 17:31:08,089 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 39 transitions. Word has length 24 [2022-02-20 17:31:08,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 17:31:08,090 INFO L470 AbstractCegarLoop]: Abstraction has 29 states and 39 transitions. [2022-02-20 17:31:08,090 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:31:08,090 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 39 transitions. [2022-02-20 17:31:08,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-02-20 17:31:08,091 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:31:08,092 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:31:08,092 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-20 17:31:08,092 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 17:31:08,093 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:31:08,093 INFO L85 PathProgramCache]: Analyzing trace with hash -1636258074, now seen corresponding path program 1 times [2022-02-20 17:31:08,093 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 17:31:08,093 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1415472664] [2022-02-20 17:31:08,094 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:31:08,094 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 17:31:08,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:31:08,171 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-02-20 17:31:08,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:31:08,184 INFO L290 TraceCheckUtils]: 0: Hoare triple {242#true} ~cond := #in~cond; {242#true} is VALID [2022-02-20 17:31:08,184 INFO L290 TraceCheckUtils]: 1: Hoare triple {242#true} assume !(0 == ~cond); {242#true} is VALID [2022-02-20 17:31:08,184 INFO L290 TraceCheckUtils]: 2: Hoare triple {242#true} assume true; {242#true} is VALID [2022-02-20 17:31:08,185 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {242#true} {242#true} #78#return; {242#true} is VALID [2022-02-20 17:31:08,185 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-02-20 17:31:08,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:31:08,191 INFO L290 TraceCheckUtils]: 0: Hoare triple {242#true} ~cond := #in~cond; {242#true} is VALID [2022-02-20 17:31:08,191 INFO L290 TraceCheckUtils]: 1: Hoare triple {242#true} assume !(0 == ~cond); {242#true} is VALID [2022-02-20 17:31:08,191 INFO L290 TraceCheckUtils]: 2: Hoare triple {242#true} assume true; {242#true} is VALID [2022-02-20 17:31:08,192 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {242#true} {242#true} #80#return; {242#true} is VALID [2022-02-20 17:31:08,192 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-02-20 17:31:08,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:31:08,198 INFO L290 TraceCheckUtils]: 0: Hoare triple {242#true} ~cond := #in~cond; {242#true} is VALID [2022-02-20 17:31:08,198 INFO L290 TraceCheckUtils]: 1: Hoare triple {242#true} assume !(0 == ~cond); {242#true} is VALID [2022-02-20 17:31:08,199 INFO L290 TraceCheckUtils]: 2: Hoare triple {242#true} assume true; {242#true} is VALID [2022-02-20 17:31:08,199 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {242#true} {242#true} #82#return; {242#true} is VALID [2022-02-20 17:31:08,199 INFO L290 TraceCheckUtils]: 0: Hoare triple {242#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3); {242#true} is VALID [2022-02-20 17:31:08,199 INFO L290 TraceCheckUtils]: 1: Hoare triple {242#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_~r~0#1, main_~d~0#1, main_~p~0#1, main_~q~0#1;havoc main_~A~0#1;havoc main_~B~0#1;havoc main_~r~0#1;havoc main_~d~0#1;havoc main_~p~0#1;havoc main_~q~0#1;main_~A~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; {242#true} is VALID [2022-02-20 17:31:08,200 INFO L272 TraceCheckUtils]: 2: Hoare triple {242#true} call assume_abort_if_not((if main_~A~0#1 % 4294967296 >= 0 && main_~A~0#1 % 4294967296 <= 1 then 1 else 0)); {242#true} is VALID [2022-02-20 17:31:08,200 INFO L290 TraceCheckUtils]: 3: Hoare triple {242#true} ~cond := #in~cond; {242#true} is VALID [2022-02-20 17:31:08,200 INFO L290 TraceCheckUtils]: 4: Hoare triple {242#true} assume !(0 == ~cond); {242#true} is VALID [2022-02-20 17:31:08,200 INFO L290 TraceCheckUtils]: 5: Hoare triple {242#true} assume true; {242#true} is VALID [2022-02-20 17:31:08,201 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {242#true} {242#true} #78#return; {242#true} is VALID [2022-02-20 17:31:08,201 INFO L290 TraceCheckUtils]: 7: Hoare triple {242#true} main_~B~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; {242#true} is VALID [2022-02-20 17:31:08,201 INFO L272 TraceCheckUtils]: 8: Hoare triple {242#true} call assume_abort_if_not((if main_~B~0#1 % 4294967296 >= 0 && main_~B~0#1 % 4294967296 <= 1 then 1 else 0)); {242#true} is VALID [2022-02-20 17:31:08,201 INFO L290 TraceCheckUtils]: 9: Hoare triple {242#true} ~cond := #in~cond; {242#true} is VALID [2022-02-20 17:31:08,201 INFO L290 TraceCheckUtils]: 10: Hoare triple {242#true} assume !(0 == ~cond); {242#true} is VALID [2022-02-20 17:31:08,202 INFO L290 TraceCheckUtils]: 11: Hoare triple {242#true} assume true; {242#true} is VALID [2022-02-20 17:31:08,202 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {242#true} {242#true} #80#return; {242#true} is VALID [2022-02-20 17:31:08,202 INFO L272 TraceCheckUtils]: 13: Hoare triple {242#true} call assume_abort_if_not((if main_~B~0#1 % 4294967296 >= 1 then 1 else 0)); {242#true} is VALID [2022-02-20 17:31:08,202 INFO L290 TraceCheckUtils]: 14: Hoare triple {242#true} ~cond := #in~cond; {242#true} is VALID [2022-02-20 17:31:08,203 INFO L290 TraceCheckUtils]: 15: Hoare triple {242#true} assume !(0 == ~cond); {242#true} is VALID [2022-02-20 17:31:08,203 INFO L290 TraceCheckUtils]: 16: Hoare triple {242#true} assume true; {242#true} is VALID [2022-02-20 17:31:08,203 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {242#true} {242#true} #82#return; {242#true} is VALID [2022-02-20 17:31:08,204 INFO L290 TraceCheckUtils]: 18: Hoare triple {242#true} main_~r~0#1 := main_~A~0#1;main_~d~0#1 := main_~B~0#1;main_~p~0#1 := 1;main_~q~0#1 := 0; {256#(= |ULTIMATE.start_main_~q~0#1| 0)} is VALID [2022-02-20 17:31:08,204 INFO L290 TraceCheckUtils]: 19: Hoare triple {256#(= |ULTIMATE.start_main_~q~0#1| 0)} assume !false; {256#(= |ULTIMATE.start_main_~q~0#1| 0)} is VALID [2022-02-20 17:31:08,205 INFO L272 TraceCheckUtils]: 20: Hoare triple {256#(= |ULTIMATE.start_main_~q~0#1| 0)} call __VERIFIER_assert((if 0 == main_~q~0#1 % 4294967296 then 1 else 0)); {257#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-02-20 17:31:08,206 INFO L290 TraceCheckUtils]: 21: Hoare triple {257#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {258#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-02-20 17:31:08,206 INFO L290 TraceCheckUtils]: 22: Hoare triple {258#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {243#false} is VALID [2022-02-20 17:31:08,206 INFO L290 TraceCheckUtils]: 23: Hoare triple {243#false} assume !false; {243#false} is VALID [2022-02-20 17:31:08,207 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:31:08,207 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 17:31:08,207 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1415472664] [2022-02-20 17:31:08,208 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1415472664] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 17:31:08,208 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 17:31:08,208 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 17:31:08,208 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1715869984] [2022-02-20 17:31:08,208 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 17:31:08,209 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:31:08,210 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 17:31:08,210 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:31:08,229 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:31:08,230 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 17:31:08,230 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 17:31:08,230 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 17:31:08,231 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 17:31:08,231 INFO L87 Difference]: Start difference. First operand 29 states and 39 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:31:08,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:31:08,393 INFO L93 Difference]: Finished difference Result 42 states and 56 transitions. [2022-02-20 17:31:08,393 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-20 17:31:08,394 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:31:08,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 17:31:08,394 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:31:08,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 56 transitions. [2022-02-20 17:31:08,397 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:31:08,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 56 transitions. [2022-02-20 17:31:08,400 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 56 transitions. [2022-02-20 17:31:08,455 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 56 edges. 56 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:31:08,457 INFO L225 Difference]: With dead ends: 42 [2022-02-20 17:31:08,457 INFO L226 Difference]: Without dead ends: 40 [2022-02-20 17:31:08,458 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-02-20 17:31:08,459 INFO L933 BasicCegarLoop]: 38 mSDtfsCounter, 12 mSDsluCounter, 96 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 134 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 17:31:08,460 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [18 Valid, 134 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 17:31:08,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2022-02-20 17:31:08,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 33. [2022-02-20 17:31:08,465 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 17:31:08,466 INFO L82 GeneralOperation]: Start isEquivalent. First operand 40 states. Second operand has 33 states, 19 states have (on average 1.2105263157894737) internal successors, (23), 20 states have internal predecessors, (23), 10 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-02-20 17:31:08,466 INFO L74 IsIncluded]: Start isIncluded. First operand 40 states. Second operand has 33 states, 19 states have (on average 1.2105263157894737) internal successors, (23), 20 states have internal predecessors, (23), 10 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-02-20 17:31:08,467 INFO L87 Difference]: Start difference. First operand 40 states. Second operand has 33 states, 19 states have (on average 1.2105263157894737) internal successors, (23), 20 states have internal predecessors, (23), 10 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-02-20 17:31:08,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:31:08,470 INFO L93 Difference]: Finished difference Result 40 states and 54 transitions. [2022-02-20 17:31:08,470 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 54 transitions. [2022-02-20 17:31:08,471 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:31:08,471 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:31:08,472 INFO L74 IsIncluded]: Start isIncluded. First operand has 33 states, 19 states have (on average 1.2105263157894737) internal successors, (23), 20 states have internal predecessors, (23), 10 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Second operand 40 states. [2022-02-20 17:31:08,472 INFO L87 Difference]: Start difference. First operand has 33 states, 19 states have (on average 1.2105263157894737) internal successors, (23), 20 states have internal predecessors, (23), 10 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Second operand 40 states. [2022-02-20 17:31:08,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:31:08,476 INFO L93 Difference]: Finished difference Result 40 states and 54 transitions. [2022-02-20 17:31:08,476 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 54 transitions. [2022-02-20 17:31:08,477 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:31:08,477 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:31:08,477 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 17:31:08,477 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 17:31:08,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 19 states have (on average 1.2105263157894737) internal successors, (23), 20 states have internal predecessors, (23), 10 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-02-20 17:31:08,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 42 transitions. [2022-02-20 17:31:08,480 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 42 transitions. Word has length 24 [2022-02-20 17:31:08,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 17:31:08,481 INFO L470 AbstractCegarLoop]: Abstraction has 33 states and 42 transitions. [2022-02-20 17:31:08,481 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:31:08,481 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 42 transitions. [2022-02-20 17:31:08,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-02-20 17:31:08,482 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:31:08,482 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] [2022-02-20 17:31:08,482 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-02-20 17:31:08,482 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 17:31:08,483 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:31:08,483 INFO L85 PathProgramCache]: Analyzing trace with hash 906849917, now seen corresponding path program 1 times [2022-02-20 17:31:08,483 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 17:31:08,483 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1284814735] [2022-02-20 17:31:08,484 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:31:08,484 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 17:31:08,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:31:08,713 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-02-20 17:31:08,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:31:08,729 INFO L290 TraceCheckUtils]: 0: Hoare triple {450#true} ~cond := #in~cond; {450#true} is VALID [2022-02-20 17:31:08,730 INFO L290 TraceCheckUtils]: 1: Hoare triple {450#true} assume !(0 == ~cond); {450#true} is VALID [2022-02-20 17:31:08,731 INFO L290 TraceCheckUtils]: 2: Hoare triple {450#true} assume true; {450#true} is VALID [2022-02-20 17:31:08,733 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {450#true} {450#true} #78#return; {450#true} is VALID [2022-02-20 17:31:08,733 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-02-20 17:31:08,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:31:08,744 INFO L290 TraceCheckUtils]: 0: Hoare triple {450#true} ~cond := #in~cond; {450#true} is VALID [2022-02-20 17:31:08,745 INFO L290 TraceCheckUtils]: 1: Hoare triple {450#true} assume !(0 == ~cond); {450#true} is VALID [2022-02-20 17:31:08,745 INFO L290 TraceCheckUtils]: 2: Hoare triple {450#true} assume true; {450#true} is VALID [2022-02-20 17:31:08,745 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {450#true} {450#true} #80#return; {450#true} is VALID [2022-02-20 17:31:08,746 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-02-20 17:31:08,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:31:08,753 INFO L290 TraceCheckUtils]: 0: Hoare triple {450#true} ~cond := #in~cond; {450#true} is VALID [2022-02-20 17:31:08,754 INFO L290 TraceCheckUtils]: 1: Hoare triple {450#true} assume !(0 == ~cond); {450#true} is VALID [2022-02-20 17:31:08,754 INFO L290 TraceCheckUtils]: 2: Hoare triple {450#true} assume true; {450#true} is VALID [2022-02-20 17:31:08,754 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {450#true} {450#true} #82#return; {450#true} is VALID [2022-02-20 17:31:08,755 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-02-20 17:31:08,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:31:08,774 INFO L290 TraceCheckUtils]: 0: Hoare triple {450#true} ~cond := #in~cond; {450#true} is VALID [2022-02-20 17:31:08,774 INFO L290 TraceCheckUtils]: 1: Hoare triple {450#true} assume !(0 == ~cond); {450#true} is VALID [2022-02-20 17:31:08,774 INFO L290 TraceCheckUtils]: 2: Hoare triple {450#true} assume true; {450#true} is VALID [2022-02-20 17:31:08,775 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {450#true} {464#(and (<= (+ |ULTIMATE.start_main_~A~0#1| (* (div |ULTIMATE.start_main_~r~0#1| 4294967296) 4294967296)) (+ (* (div |ULTIMATE.start_main_~A~0#1| 4294967296) 4294967296) |ULTIMATE.start_main_~r~0#1|)) (< (+ (* (div |ULTIMATE.start_main_~A~0#1| 4294967296) 4294967296) |ULTIMATE.start_main_~r~0#1|) (+ |ULTIMATE.start_main_~A~0#1| (* (div |ULTIMATE.start_main_~r~0#1| 4294967296) 4294967296) 1)) (<= (* (div |ULTIMATE.start_main_~A~0#1| 4294967296) 4294967296) |ULTIMATE.start_main_~r~0#1|))} #84#return; {464#(and (<= (+ |ULTIMATE.start_main_~A~0#1| (* (div |ULTIMATE.start_main_~r~0#1| 4294967296) 4294967296)) (+ (* (div |ULTIMATE.start_main_~A~0#1| 4294967296) 4294967296) |ULTIMATE.start_main_~r~0#1|)) (< (+ (* (div |ULTIMATE.start_main_~A~0#1| 4294967296) 4294967296) |ULTIMATE.start_main_~r~0#1|) (+ |ULTIMATE.start_main_~A~0#1| (* (div |ULTIMATE.start_main_~r~0#1| 4294967296) 4294967296) 1)) (<= (* (div |ULTIMATE.start_main_~A~0#1| 4294967296) 4294967296) |ULTIMATE.start_main_~r~0#1|))} is VALID [2022-02-20 17:31:08,776 INFO L290 TraceCheckUtils]: 0: Hoare triple {450#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3); {450#true} is VALID [2022-02-20 17:31:08,776 INFO L290 TraceCheckUtils]: 1: Hoare triple {450#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_~r~0#1, main_~d~0#1, main_~p~0#1, main_~q~0#1;havoc main_~A~0#1;havoc main_~B~0#1;havoc main_~r~0#1;havoc main_~d~0#1;havoc main_~p~0#1;havoc main_~q~0#1;main_~A~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; {450#true} is VALID [2022-02-20 17:31:08,776 INFO L272 TraceCheckUtils]: 2: Hoare triple {450#true} call assume_abort_if_not((if main_~A~0#1 % 4294967296 >= 0 && main_~A~0#1 % 4294967296 <= 1 then 1 else 0)); {450#true} is VALID [2022-02-20 17:31:08,776 INFO L290 TraceCheckUtils]: 3: Hoare triple {450#true} ~cond := #in~cond; {450#true} is VALID [2022-02-20 17:31:08,777 INFO L290 TraceCheckUtils]: 4: Hoare triple {450#true} assume !(0 == ~cond); {450#true} is VALID [2022-02-20 17:31:08,777 INFO L290 TraceCheckUtils]: 5: Hoare triple {450#true} assume true; {450#true} is VALID [2022-02-20 17:31:08,777 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {450#true} {450#true} #78#return; {450#true} is VALID [2022-02-20 17:31:08,777 INFO L290 TraceCheckUtils]: 7: Hoare triple {450#true} main_~B~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; {450#true} is VALID [2022-02-20 17:31:08,778 INFO L272 TraceCheckUtils]: 8: Hoare triple {450#true} call assume_abort_if_not((if main_~B~0#1 % 4294967296 >= 0 && main_~B~0#1 % 4294967296 <= 1 then 1 else 0)); {450#true} is VALID [2022-02-20 17:31:08,778 INFO L290 TraceCheckUtils]: 9: Hoare triple {450#true} ~cond := #in~cond; {450#true} is VALID [2022-02-20 17:31:08,778 INFO L290 TraceCheckUtils]: 10: Hoare triple {450#true} assume !(0 == ~cond); {450#true} is VALID [2022-02-20 17:31:08,778 INFO L290 TraceCheckUtils]: 11: Hoare triple {450#true} assume true; {450#true} is VALID [2022-02-20 17:31:08,778 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {450#true} {450#true} #80#return; {450#true} is VALID [2022-02-20 17:31:08,779 INFO L272 TraceCheckUtils]: 13: Hoare triple {450#true} call assume_abort_if_not((if main_~B~0#1 % 4294967296 >= 1 then 1 else 0)); {450#true} is VALID [2022-02-20 17:31:08,779 INFO L290 TraceCheckUtils]: 14: Hoare triple {450#true} ~cond := #in~cond; {450#true} is VALID [2022-02-20 17:31:08,779 INFO L290 TraceCheckUtils]: 15: Hoare triple {450#true} assume !(0 == ~cond); {450#true} is VALID [2022-02-20 17:31:08,779 INFO L290 TraceCheckUtils]: 16: Hoare triple {450#true} assume true; {450#true} is VALID [2022-02-20 17:31:08,779 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {450#true} {450#true} #82#return; {450#true} is VALID [2022-02-20 17:31:08,781 INFO L290 TraceCheckUtils]: 18: Hoare triple {450#true} main_~r~0#1 := main_~A~0#1;main_~d~0#1 := main_~B~0#1;main_~p~0#1 := 1;main_~q~0#1 := 0; {464#(and (<= (+ |ULTIMATE.start_main_~A~0#1| (* (div |ULTIMATE.start_main_~r~0#1| 4294967296) 4294967296)) (+ (* (div |ULTIMATE.start_main_~A~0#1| 4294967296) 4294967296) |ULTIMATE.start_main_~r~0#1|)) (< (+ (* (div |ULTIMATE.start_main_~A~0#1| 4294967296) 4294967296) |ULTIMATE.start_main_~r~0#1|) (+ |ULTIMATE.start_main_~A~0#1| (* (div |ULTIMATE.start_main_~r~0#1| 4294967296) 4294967296) 1)) (<= (* (div |ULTIMATE.start_main_~A~0#1| 4294967296) 4294967296) |ULTIMATE.start_main_~r~0#1|))} is VALID [2022-02-20 17:31:08,782 INFO L290 TraceCheckUtils]: 19: Hoare triple {464#(and (<= (+ |ULTIMATE.start_main_~A~0#1| (* (div |ULTIMATE.start_main_~r~0#1| 4294967296) 4294967296)) (+ (* (div |ULTIMATE.start_main_~A~0#1| 4294967296) 4294967296) |ULTIMATE.start_main_~r~0#1|)) (< (+ (* (div |ULTIMATE.start_main_~A~0#1| 4294967296) 4294967296) |ULTIMATE.start_main_~r~0#1|) (+ |ULTIMATE.start_main_~A~0#1| (* (div |ULTIMATE.start_main_~r~0#1| 4294967296) 4294967296) 1)) (<= (* (div |ULTIMATE.start_main_~A~0#1| 4294967296) 4294967296) |ULTIMATE.start_main_~r~0#1|))} assume !false; {464#(and (<= (+ |ULTIMATE.start_main_~A~0#1| (* (div |ULTIMATE.start_main_~r~0#1| 4294967296) 4294967296)) (+ (* (div |ULTIMATE.start_main_~A~0#1| 4294967296) 4294967296) |ULTIMATE.start_main_~r~0#1|)) (< (+ (* (div |ULTIMATE.start_main_~A~0#1| 4294967296) 4294967296) |ULTIMATE.start_main_~r~0#1|) (+ |ULTIMATE.start_main_~A~0#1| (* (div |ULTIMATE.start_main_~r~0#1| 4294967296) 4294967296) 1)) (<= (* (div |ULTIMATE.start_main_~A~0#1| 4294967296) 4294967296) |ULTIMATE.start_main_~r~0#1|))} is VALID [2022-02-20 17:31:08,782 INFO L272 TraceCheckUtils]: 20: Hoare triple {464#(and (<= (+ |ULTIMATE.start_main_~A~0#1| (* (div |ULTIMATE.start_main_~r~0#1| 4294967296) 4294967296)) (+ (* (div |ULTIMATE.start_main_~A~0#1| 4294967296) 4294967296) |ULTIMATE.start_main_~r~0#1|)) (< (+ (* (div |ULTIMATE.start_main_~A~0#1| 4294967296) 4294967296) |ULTIMATE.start_main_~r~0#1|) (+ |ULTIMATE.start_main_~A~0#1| (* (div |ULTIMATE.start_main_~r~0#1| 4294967296) 4294967296) 1)) (<= (* (div |ULTIMATE.start_main_~A~0#1| 4294967296) 4294967296) |ULTIMATE.start_main_~r~0#1|))} call __VERIFIER_assert((if 0 == main_~q~0#1 % 4294967296 then 1 else 0)); {450#true} is VALID [2022-02-20 17:31:08,782 INFO L290 TraceCheckUtils]: 21: Hoare triple {450#true} ~cond := #in~cond; {450#true} is VALID [2022-02-20 17:31:08,782 INFO L290 TraceCheckUtils]: 22: Hoare triple {450#true} assume !(0 == ~cond); {450#true} is VALID [2022-02-20 17:31:08,783 INFO L290 TraceCheckUtils]: 23: Hoare triple {450#true} assume true; {450#true} is VALID [2022-02-20 17:31:08,783 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {450#true} {464#(and (<= (+ |ULTIMATE.start_main_~A~0#1| (* (div |ULTIMATE.start_main_~r~0#1| 4294967296) 4294967296)) (+ (* (div |ULTIMATE.start_main_~A~0#1| 4294967296) 4294967296) |ULTIMATE.start_main_~r~0#1|)) (< (+ (* (div |ULTIMATE.start_main_~A~0#1| 4294967296) 4294967296) |ULTIMATE.start_main_~r~0#1|) (+ |ULTIMATE.start_main_~A~0#1| (* (div |ULTIMATE.start_main_~r~0#1| 4294967296) 4294967296) 1)) (<= (* (div |ULTIMATE.start_main_~A~0#1| 4294967296) 4294967296) |ULTIMATE.start_main_~r~0#1|))} #84#return; {464#(and (<= (+ |ULTIMATE.start_main_~A~0#1| (* (div |ULTIMATE.start_main_~r~0#1| 4294967296) 4294967296)) (+ (* (div |ULTIMATE.start_main_~A~0#1| 4294967296) 4294967296) |ULTIMATE.start_main_~r~0#1|)) (< (+ (* (div |ULTIMATE.start_main_~A~0#1| 4294967296) 4294967296) |ULTIMATE.start_main_~r~0#1|) (+ |ULTIMATE.start_main_~A~0#1| (* (div |ULTIMATE.start_main_~r~0#1| 4294967296) 4294967296) 1)) (<= (* (div |ULTIMATE.start_main_~A~0#1| 4294967296) 4294967296) |ULTIMATE.start_main_~r~0#1|))} is VALID [2022-02-20 17:31:08,785 INFO L272 TraceCheckUtils]: 25: Hoare triple {464#(and (<= (+ |ULTIMATE.start_main_~A~0#1| (* (div |ULTIMATE.start_main_~r~0#1| 4294967296) 4294967296)) (+ (* (div |ULTIMATE.start_main_~A~0#1| 4294967296) 4294967296) |ULTIMATE.start_main_~r~0#1|)) (< (+ (* (div |ULTIMATE.start_main_~A~0#1| 4294967296) 4294967296) |ULTIMATE.start_main_~r~0#1|) (+ |ULTIMATE.start_main_~A~0#1| (* (div |ULTIMATE.start_main_~r~0#1| 4294967296) 4294967296) 1)) (<= (* (div |ULTIMATE.start_main_~A~0#1| 4294967296) 4294967296) |ULTIMATE.start_main_~r~0#1|))} call __VERIFIER_assert((if main_~r~0#1 % 4294967296 == main_~A~0#1 % 4294967296 then 1 else 0)); {469#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-02-20 17:31:08,786 INFO L290 TraceCheckUtils]: 26: Hoare triple {469#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {470#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-02-20 17:31:08,789 INFO L290 TraceCheckUtils]: 27: Hoare triple {470#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {451#false} is VALID [2022-02-20 17:31:08,789 INFO L290 TraceCheckUtils]: 28: Hoare triple {451#false} assume !false; {451#false} is VALID [2022-02-20 17:31:08,790 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-02-20 17:31:08,792 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 17:31:08,792 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1284814735] [2022-02-20 17:31:08,792 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1284814735] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 17:31:08,793 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 17:31:08,793 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 17:31:08,793 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [545848536] [2022-02-20 17:31:08,793 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 17:31:08,794 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 29 [2022-02-20 17:31:08,796 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 17:31:08,796 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-02-20 17:31:08,819 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:31:08,820 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 17:31:08,820 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 17:31:08,821 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 17:31:08,821 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 17:31:08,822 INFO L87 Difference]: Start difference. First operand 33 states and 42 transitions. Second operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-02-20 17:31:09,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:31:09,139 INFO L93 Difference]: Finished difference Result 46 states and 59 transitions. [2022-02-20 17:31:09,139 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-20 17:31:09,140 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 29 [2022-02-20 17:31:09,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 17:31:09,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-02-20 17:31:09,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 56 transitions. [2022-02-20 17:31:09,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-02-20 17:31:09,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 56 transitions. [2022-02-20 17:31:09,145 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 56 transitions. [2022-02-20 17:31:09,226 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 56 edges. 56 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:31:09,229 INFO L225 Difference]: With dead ends: 46 [2022-02-20 17:31:09,229 INFO L226 Difference]: Without dead ends: 44 [2022-02-20 17:31:09,229 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-02-20 17:31:09,230 INFO L933 BasicCegarLoop]: 38 mSDtfsCounter, 10 mSDsluCounter, 92 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 130 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 17:31:09,231 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [15 Valid, 130 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 17:31:09,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2022-02-20 17:31:09,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 37. [2022-02-20 17:31:09,246 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 17:31:09,246 INFO L82 GeneralOperation]: Start isEquivalent. First operand 44 states. Second operand has 37 states, 22 states have (on average 1.1818181818181819) internal successors, (26), 23 states have internal predecessors, (26), 10 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-02-20 17:31:09,247 INFO L74 IsIncluded]: Start isIncluded. First operand 44 states. Second operand has 37 states, 22 states have (on average 1.1818181818181819) internal successors, (26), 23 states have internal predecessors, (26), 10 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-02-20 17:31:09,247 INFO L87 Difference]: Start difference. First operand 44 states. Second operand has 37 states, 22 states have (on average 1.1818181818181819) internal successors, (26), 23 states have internal predecessors, (26), 10 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-02-20 17:31:09,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:31:09,250 INFO L93 Difference]: Finished difference Result 44 states and 57 transitions. [2022-02-20 17:31:09,250 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 57 transitions. [2022-02-20 17:31:09,251 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:31:09,251 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:31:09,251 INFO L74 IsIncluded]: Start isIncluded. First operand has 37 states, 22 states have (on average 1.1818181818181819) internal successors, (26), 23 states have internal predecessors, (26), 10 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Second operand 44 states. [2022-02-20 17:31:09,252 INFO L87 Difference]: Start difference. First operand has 37 states, 22 states have (on average 1.1818181818181819) internal successors, (26), 23 states have internal predecessors, (26), 10 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Second operand 44 states. [2022-02-20 17:31:09,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:31:09,254 INFO L93 Difference]: Finished difference Result 44 states and 57 transitions. [2022-02-20 17:31:09,255 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 57 transitions. [2022-02-20 17:31:09,255 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:31:09,255 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:31:09,256 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 17:31:09,256 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 17:31:09,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 22 states have (on average 1.1818181818181819) internal successors, (26), 23 states have internal predecessors, (26), 10 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-02-20 17:31:09,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 45 transitions. [2022-02-20 17:31:09,258 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 45 transitions. Word has length 29 [2022-02-20 17:31:09,258 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 17:31:09,259 INFO L470 AbstractCegarLoop]: Abstraction has 37 states and 45 transitions. [2022-02-20 17:31:09,259 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-02-20 17:31:09,259 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 45 transitions. [2022-02-20 17:31:09,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-02-20 17:31:09,260 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:31:09,260 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 17:31:09,260 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-02-20 17:31:09,261 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 17:31:09,261 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:31:09,261 INFO L85 PathProgramCache]: Analyzing trace with hash 710995206, now seen corresponding path program 1 times [2022-02-20 17:31:09,261 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 17:31:09,262 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [163674649] [2022-02-20 17:31:09,262 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:31:09,262 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 17:31:09,277 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-20 17:31:09,277 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2056473707] [2022-02-20 17:31:09,278 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:31:09,278 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 17:31:09,278 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 17:31:09,280 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-20 17:31:09,298 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-02-20 17:31:09,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:31:09,338 INFO L263 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 14 conjunts are in the unsatisfiable core [2022-02-20 17:31:09,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:31:09,362 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 17:31:10,101 INFO L290 TraceCheckUtils]: 0: Hoare triple {680#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3); {680#true} is VALID [2022-02-20 17:31:10,101 INFO L290 TraceCheckUtils]: 1: Hoare triple {680#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_~r~0#1, main_~d~0#1, main_~p~0#1, main_~q~0#1;havoc main_~A~0#1;havoc main_~B~0#1;havoc main_~r~0#1;havoc main_~d~0#1;havoc main_~p~0#1;havoc main_~q~0#1;main_~A~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; {680#true} is VALID [2022-02-20 17:31:10,102 INFO L272 TraceCheckUtils]: 2: Hoare triple {680#true} call assume_abort_if_not((if main_~A~0#1 % 4294967296 >= 0 && main_~A~0#1 % 4294967296 <= 1 then 1 else 0)); {680#true} is VALID [2022-02-20 17:31:10,102 INFO L290 TraceCheckUtils]: 3: Hoare triple {680#true} ~cond := #in~cond; {680#true} is VALID [2022-02-20 17:31:10,102 INFO L290 TraceCheckUtils]: 4: Hoare triple {680#true} assume !(0 == ~cond); {680#true} is VALID [2022-02-20 17:31:10,102 INFO L290 TraceCheckUtils]: 5: Hoare triple {680#true} assume true; {680#true} is VALID [2022-02-20 17:31:10,102 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {680#true} {680#true} #78#return; {680#true} is VALID [2022-02-20 17:31:10,103 INFO L290 TraceCheckUtils]: 7: Hoare triple {680#true} main_~B~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; {680#true} is VALID [2022-02-20 17:31:10,103 INFO L272 TraceCheckUtils]: 8: Hoare triple {680#true} call assume_abort_if_not((if main_~B~0#1 % 4294967296 >= 0 && main_~B~0#1 % 4294967296 <= 1 then 1 else 0)); {680#true} is VALID [2022-02-20 17:31:10,103 INFO L290 TraceCheckUtils]: 9: Hoare triple {680#true} ~cond := #in~cond; {712#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-02-20 17:31:10,104 INFO L290 TraceCheckUtils]: 10: Hoare triple {712#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {716#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-02-20 17:31:10,104 INFO L290 TraceCheckUtils]: 11: Hoare triple {716#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {716#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-02-20 17:31:10,105 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {716#(not (= |assume_abort_if_not_#in~cond| 0))} {680#true} #80#return; {723#(<= (mod |ULTIMATE.start_main_~B~0#1| 4294967296) 1)} is VALID [2022-02-20 17:31:10,106 INFO L272 TraceCheckUtils]: 13: Hoare triple {723#(<= (mod |ULTIMATE.start_main_~B~0#1| 4294967296) 1)} call assume_abort_if_not((if main_~B~0#1 % 4294967296 >= 1 then 1 else 0)); {680#true} is VALID [2022-02-20 17:31:10,106 INFO L290 TraceCheckUtils]: 14: Hoare triple {680#true} ~cond := #in~cond; {680#true} is VALID [2022-02-20 17:31:10,106 INFO L290 TraceCheckUtils]: 15: Hoare triple {680#true} assume !(0 == ~cond); {680#true} is VALID [2022-02-20 17:31:10,106 INFO L290 TraceCheckUtils]: 16: Hoare triple {680#true} assume true; {680#true} is VALID [2022-02-20 17:31:10,107 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {680#true} {723#(<= (mod |ULTIMATE.start_main_~B~0#1| 4294967296) 1)} #82#return; {723#(<= (mod |ULTIMATE.start_main_~B~0#1| 4294967296) 1)} is VALID [2022-02-20 17:31:10,111 INFO L290 TraceCheckUtils]: 18: Hoare triple {723#(<= (mod |ULTIMATE.start_main_~B~0#1| 4294967296) 1)} main_~r~0#1 := main_~A~0#1;main_~d~0#1 := main_~B~0#1;main_~p~0#1 := 1;main_~q~0#1 := 0; {742#(and (<= (mod |ULTIMATE.start_main_~B~0#1| 4294967296) 1) (= |ULTIMATE.start_main_~p~0#1| 1) (= |ULTIMATE.start_main_~B~0#1| |ULTIMATE.start_main_~d~0#1|))} is VALID [2022-02-20 17:31:10,112 INFO L290 TraceCheckUtils]: 19: Hoare triple {742#(and (<= (mod |ULTIMATE.start_main_~B~0#1| 4294967296) 1) (= |ULTIMATE.start_main_~p~0#1| 1) (= |ULTIMATE.start_main_~B~0#1| |ULTIMATE.start_main_~d~0#1|))} assume !false; {742#(and (<= (mod |ULTIMATE.start_main_~B~0#1| 4294967296) 1) (= |ULTIMATE.start_main_~p~0#1| 1) (= |ULTIMATE.start_main_~B~0#1| |ULTIMATE.start_main_~d~0#1|))} is VALID [2022-02-20 17:31:10,112 INFO L272 TraceCheckUtils]: 20: Hoare triple {742#(and (<= (mod |ULTIMATE.start_main_~B~0#1| 4294967296) 1) (= |ULTIMATE.start_main_~p~0#1| 1) (= |ULTIMATE.start_main_~B~0#1| |ULTIMATE.start_main_~d~0#1|))} call __VERIFIER_assert((if 0 == main_~q~0#1 % 4294967296 then 1 else 0)); {680#true} is VALID [2022-02-20 17:31:10,113 INFO L290 TraceCheckUtils]: 21: Hoare triple {680#true} ~cond := #in~cond; {680#true} is VALID [2022-02-20 17:31:10,113 INFO L290 TraceCheckUtils]: 22: Hoare triple {680#true} assume !(0 == ~cond); {680#true} is VALID [2022-02-20 17:31:10,113 INFO L290 TraceCheckUtils]: 23: Hoare triple {680#true} assume true; {680#true} is VALID [2022-02-20 17:31:10,114 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {680#true} {742#(and (<= (mod |ULTIMATE.start_main_~B~0#1| 4294967296) 1) (= |ULTIMATE.start_main_~p~0#1| 1) (= |ULTIMATE.start_main_~B~0#1| |ULTIMATE.start_main_~d~0#1|))} #84#return; {742#(and (<= (mod |ULTIMATE.start_main_~B~0#1| 4294967296) 1) (= |ULTIMATE.start_main_~p~0#1| 1) (= |ULTIMATE.start_main_~B~0#1| |ULTIMATE.start_main_~d~0#1|))} is VALID [2022-02-20 17:31:10,114 INFO L272 TraceCheckUtils]: 25: Hoare triple {742#(and (<= (mod |ULTIMATE.start_main_~B~0#1| 4294967296) 1) (= |ULTIMATE.start_main_~p~0#1| 1) (= |ULTIMATE.start_main_~B~0#1| |ULTIMATE.start_main_~d~0#1|))} call __VERIFIER_assert((if main_~r~0#1 % 4294967296 == main_~A~0#1 % 4294967296 then 1 else 0)); {680#true} is VALID [2022-02-20 17:31:10,114 INFO L290 TraceCheckUtils]: 26: Hoare triple {680#true} ~cond := #in~cond; {680#true} is VALID [2022-02-20 17:31:10,114 INFO L290 TraceCheckUtils]: 27: Hoare triple {680#true} assume !(0 == ~cond); {680#true} is VALID [2022-02-20 17:31:10,115 INFO L290 TraceCheckUtils]: 28: Hoare triple {680#true} assume true; {680#true} is VALID [2022-02-20 17:31:10,116 INFO L284 TraceCheckUtils]: 29: Hoare quadruple {680#true} {742#(and (<= (mod |ULTIMATE.start_main_~B~0#1| 4294967296) 1) (= |ULTIMATE.start_main_~p~0#1| 1) (= |ULTIMATE.start_main_~B~0#1| |ULTIMATE.start_main_~d~0#1|))} #86#return; {742#(and (<= (mod |ULTIMATE.start_main_~B~0#1| 4294967296) 1) (= |ULTIMATE.start_main_~p~0#1| 1) (= |ULTIMATE.start_main_~B~0#1| |ULTIMATE.start_main_~d~0#1|))} is VALID [2022-02-20 17:31:10,117 INFO L272 TraceCheckUtils]: 30: Hoare triple {742#(and (<= (mod |ULTIMATE.start_main_~B~0#1| 4294967296) 1) (= |ULTIMATE.start_main_~p~0#1| 1) (= |ULTIMATE.start_main_~B~0#1| |ULTIMATE.start_main_~d~0#1|))} call __VERIFIER_assert((if main_~d~0#1 % 4294967296 == main_~B~0#1 * main_~p~0#1 % 4294967296 then 1 else 0)); {779#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-02-20 17:31:10,117 INFO L290 TraceCheckUtils]: 31: Hoare triple {779#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {783#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-02-20 17:31:10,118 INFO L290 TraceCheckUtils]: 32: Hoare triple {783#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {681#false} is VALID [2022-02-20 17:31:10,118 INFO L290 TraceCheckUtils]: 33: Hoare triple {681#false} assume !false; {681#false} is VALID [2022-02-20 17:31:10,118 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 7 proven. 3 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-02-20 17:31:10,119 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 17:31:10,540 INFO L290 TraceCheckUtils]: 33: Hoare triple {681#false} assume !false; {681#false} is VALID [2022-02-20 17:31:10,541 INFO L290 TraceCheckUtils]: 32: Hoare triple {783#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {681#false} is VALID [2022-02-20 17:31:10,541 INFO L290 TraceCheckUtils]: 31: Hoare triple {779#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {783#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-02-20 17:31:10,542 INFO L272 TraceCheckUtils]: 30: Hoare triple {799#(= (mod (* |ULTIMATE.start_main_~B~0#1| |ULTIMATE.start_main_~p~0#1|) 4294967296) (mod |ULTIMATE.start_main_~d~0#1| 4294967296))} call __VERIFIER_assert((if main_~d~0#1 % 4294967296 == main_~B~0#1 * main_~p~0#1 % 4294967296 then 1 else 0)); {779#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-02-20 17:31:10,543 INFO L284 TraceCheckUtils]: 29: Hoare quadruple {680#true} {799#(= (mod (* |ULTIMATE.start_main_~B~0#1| |ULTIMATE.start_main_~p~0#1|) 4294967296) (mod |ULTIMATE.start_main_~d~0#1| 4294967296))} #86#return; {799#(= (mod (* |ULTIMATE.start_main_~B~0#1| |ULTIMATE.start_main_~p~0#1|) 4294967296) (mod |ULTIMATE.start_main_~d~0#1| 4294967296))} is VALID [2022-02-20 17:31:10,544 INFO L290 TraceCheckUtils]: 28: Hoare triple {680#true} assume true; {680#true} is VALID [2022-02-20 17:31:10,544 INFO L290 TraceCheckUtils]: 27: Hoare triple {680#true} assume !(0 == ~cond); {680#true} is VALID [2022-02-20 17:31:10,544 INFO L290 TraceCheckUtils]: 26: Hoare triple {680#true} ~cond := #in~cond; {680#true} is VALID [2022-02-20 17:31:10,544 INFO L272 TraceCheckUtils]: 25: Hoare triple {799#(= (mod (* |ULTIMATE.start_main_~B~0#1| |ULTIMATE.start_main_~p~0#1|) 4294967296) (mod |ULTIMATE.start_main_~d~0#1| 4294967296))} call __VERIFIER_assert((if main_~r~0#1 % 4294967296 == main_~A~0#1 % 4294967296 then 1 else 0)); {680#true} is VALID [2022-02-20 17:31:10,545 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {680#true} {799#(= (mod (* |ULTIMATE.start_main_~B~0#1| |ULTIMATE.start_main_~p~0#1|) 4294967296) (mod |ULTIMATE.start_main_~d~0#1| 4294967296))} #84#return; {799#(= (mod (* |ULTIMATE.start_main_~B~0#1| |ULTIMATE.start_main_~p~0#1|) 4294967296) (mod |ULTIMATE.start_main_~d~0#1| 4294967296))} is VALID [2022-02-20 17:31:10,545 INFO L290 TraceCheckUtils]: 23: Hoare triple {680#true} assume true; {680#true} is VALID [2022-02-20 17:31:10,545 INFO L290 TraceCheckUtils]: 22: Hoare triple {680#true} assume !(0 == ~cond); {680#true} is VALID [2022-02-20 17:31:10,546 INFO L290 TraceCheckUtils]: 21: Hoare triple {680#true} ~cond := #in~cond; {680#true} is VALID [2022-02-20 17:31:10,546 INFO L272 TraceCheckUtils]: 20: Hoare triple {799#(= (mod (* |ULTIMATE.start_main_~B~0#1| |ULTIMATE.start_main_~p~0#1|) 4294967296) (mod |ULTIMATE.start_main_~d~0#1| 4294967296))} call __VERIFIER_assert((if 0 == main_~q~0#1 % 4294967296 then 1 else 0)); {680#true} is VALID [2022-02-20 17:31:10,547 INFO L290 TraceCheckUtils]: 19: Hoare triple {799#(= (mod (* |ULTIMATE.start_main_~B~0#1| |ULTIMATE.start_main_~p~0#1|) 4294967296) (mod |ULTIMATE.start_main_~d~0#1| 4294967296))} assume !false; {799#(= (mod (* |ULTIMATE.start_main_~B~0#1| |ULTIMATE.start_main_~p~0#1|) 4294967296) (mod |ULTIMATE.start_main_~d~0#1| 4294967296))} is VALID [2022-02-20 17:31:10,547 INFO L290 TraceCheckUtils]: 18: Hoare triple {680#true} main_~r~0#1 := main_~A~0#1;main_~d~0#1 := main_~B~0#1;main_~p~0#1 := 1;main_~q~0#1 := 0; {799#(= (mod (* |ULTIMATE.start_main_~B~0#1| |ULTIMATE.start_main_~p~0#1|) 4294967296) (mod |ULTIMATE.start_main_~d~0#1| 4294967296))} is VALID [2022-02-20 17:31:10,548 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {680#true} {680#true} #82#return; {680#true} is VALID [2022-02-20 17:31:10,548 INFO L290 TraceCheckUtils]: 16: Hoare triple {680#true} assume true; {680#true} is VALID [2022-02-20 17:31:10,548 INFO L290 TraceCheckUtils]: 15: Hoare triple {680#true} assume !(0 == ~cond); {680#true} is VALID [2022-02-20 17:31:10,548 INFO L290 TraceCheckUtils]: 14: Hoare triple {680#true} ~cond := #in~cond; {680#true} is VALID [2022-02-20 17:31:10,549 INFO L272 TraceCheckUtils]: 13: Hoare triple {680#true} call assume_abort_if_not((if main_~B~0#1 % 4294967296 >= 1 then 1 else 0)); {680#true} is VALID [2022-02-20 17:31:10,549 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {680#true} {680#true} #80#return; {680#true} is VALID [2022-02-20 17:31:10,549 INFO L290 TraceCheckUtils]: 11: Hoare triple {680#true} assume true; {680#true} is VALID [2022-02-20 17:31:10,549 INFO L290 TraceCheckUtils]: 10: Hoare triple {680#true} assume !(0 == ~cond); {680#true} is VALID [2022-02-20 17:31:10,549 INFO L290 TraceCheckUtils]: 9: Hoare triple {680#true} ~cond := #in~cond; {680#true} is VALID [2022-02-20 17:31:10,550 INFO L272 TraceCheckUtils]: 8: Hoare triple {680#true} call assume_abort_if_not((if main_~B~0#1 % 4294967296 >= 0 && main_~B~0#1 % 4294967296 <= 1 then 1 else 0)); {680#true} is VALID [2022-02-20 17:31:10,550 INFO L290 TraceCheckUtils]: 7: Hoare triple {680#true} main_~B~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; {680#true} is VALID [2022-02-20 17:31:10,550 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {680#true} {680#true} #78#return; {680#true} is VALID [2022-02-20 17:31:10,550 INFO L290 TraceCheckUtils]: 5: Hoare triple {680#true} assume true; {680#true} is VALID [2022-02-20 17:31:10,551 INFO L290 TraceCheckUtils]: 4: Hoare triple {680#true} assume !(0 == ~cond); {680#true} is VALID [2022-02-20 17:31:10,551 INFO L290 TraceCheckUtils]: 3: Hoare triple {680#true} ~cond := #in~cond; {680#true} is VALID [2022-02-20 17:31:10,551 INFO L272 TraceCheckUtils]: 2: Hoare triple {680#true} call assume_abort_if_not((if main_~A~0#1 % 4294967296 >= 0 && main_~A~0#1 % 4294967296 <= 1 then 1 else 0)); {680#true} is VALID [2022-02-20 17:31:10,551 INFO L290 TraceCheckUtils]: 1: Hoare triple {680#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_~r~0#1, main_~d~0#1, main_~p~0#1, main_~q~0#1;havoc main_~A~0#1;havoc main_~B~0#1;havoc main_~r~0#1;havoc main_~d~0#1;havoc main_~p~0#1;havoc main_~q~0#1;main_~A~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; {680#true} is VALID [2022-02-20 17:31:10,552 INFO L290 TraceCheckUtils]: 0: Hoare triple {680#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3); {680#true} is VALID [2022-02-20 17:31:10,552 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-02-20 17:31:10,552 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 17:31:10,552 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [163674649] [2022-02-20 17:31:10,553 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-20 17:31:10,553 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2056473707] [2022-02-20 17:31:10,553 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2056473707] provided 1 perfect and 1 imperfect interpolant sequences [2022-02-20 17:31:10,553 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-02-20 17:31:10,554 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [8] total 9 [2022-02-20 17:31:10,554 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [61801800] [2022-02-20 17:31:10,554 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 17:31:10,555 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 34 [2022-02-20 17:31:10,555 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 17:31:10,555 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-02-20 17:31:10,577 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:31:10,578 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 17:31:10,578 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 17:31:10,579 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 17:31:10,579 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2022-02-20 17:31:10,579 INFO L87 Difference]: Start difference. First operand 37 states and 45 transitions. Second operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-02-20 17:31:12,716 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-02-20 17:31:14,796 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-02-20 17:31:16,864 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.07s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-02-20 17:31:19,146 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-02-20 17:31:19,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:31:19,227 INFO L93 Difference]: Finished difference Result 54 states and 69 transitions. [2022-02-20 17:31:19,227 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 17:31:19,227 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 34 [2022-02-20 17:31:19,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 17:31:19,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-02-20 17:31:19,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 63 transitions. [2022-02-20 17:31:19,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-02-20 17:31:19,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 63 transitions. [2022-02-20 17:31:19,231 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 63 transitions. [2022-02-20 17:31:19,296 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 63 edges. 63 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:31:19,298 INFO L225 Difference]: With dead ends: 54 [2022-02-20 17:31:19,298 INFO L226 Difference]: Without dead ends: 52 [2022-02-20 17:31:19,298 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 58 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2022-02-20 17:31:19,299 INFO L933 BasicCegarLoop]: 40 mSDtfsCounter, 8 mSDsluCounter, 99 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 1 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 139 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.3s IncrementalHoareTripleChecker+Time [2022-02-20 17:31:19,299 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [12 Valid, 139 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 39 Invalid, 4 Unknown, 0 Unchecked, 8.3s Time] [2022-02-20 17:31:19,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2022-02-20 17:31:19,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 49. [2022-02-20 17:31:19,328 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 17:31:19,329 INFO L82 GeneralOperation]: Start isEquivalent. First operand 52 states. Second operand has 49 states, 28 states have (on average 1.1785714285714286) internal successors, (33), 30 states have internal predecessors, (33), 15 states have call successors, (15), 5 states have call predecessors, (15), 5 states have return successors, (14), 13 states have call predecessors, (14), 14 states have call successors, (14) [2022-02-20 17:31:19,329 INFO L74 IsIncluded]: Start isIncluded. First operand 52 states. Second operand has 49 states, 28 states have (on average 1.1785714285714286) internal successors, (33), 30 states have internal predecessors, (33), 15 states have call successors, (15), 5 states have call predecessors, (15), 5 states have return successors, (14), 13 states have call predecessors, (14), 14 states have call successors, (14) [2022-02-20 17:31:19,330 INFO L87 Difference]: Start difference. First operand 52 states. Second operand has 49 states, 28 states have (on average 1.1785714285714286) internal successors, (33), 30 states have internal predecessors, (33), 15 states have call successors, (15), 5 states have call predecessors, (15), 5 states have return successors, (14), 13 states have call predecessors, (14), 14 states have call successors, (14) [2022-02-20 17:31:19,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:31:19,333 INFO L93 Difference]: Finished difference Result 52 states and 67 transitions. [2022-02-20 17:31:19,333 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 67 transitions. [2022-02-20 17:31:19,334 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:31:19,334 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:31:19,334 INFO L74 IsIncluded]: Start isIncluded. First operand has 49 states, 28 states have (on average 1.1785714285714286) internal successors, (33), 30 states have internal predecessors, (33), 15 states have call successors, (15), 5 states have call predecessors, (15), 5 states have return successors, (14), 13 states have call predecessors, (14), 14 states have call successors, (14) Second operand 52 states. [2022-02-20 17:31:19,335 INFO L87 Difference]: Start difference. First operand has 49 states, 28 states have (on average 1.1785714285714286) internal successors, (33), 30 states have internal predecessors, (33), 15 states have call successors, (15), 5 states have call predecessors, (15), 5 states have return successors, (14), 13 states have call predecessors, (14), 14 states have call successors, (14) Second operand 52 states. [2022-02-20 17:31:19,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:31:19,338 INFO L93 Difference]: Finished difference Result 52 states and 67 transitions. [2022-02-20 17:31:19,338 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 67 transitions. [2022-02-20 17:31:19,338 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:31:19,339 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:31:19,339 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 17:31:19,339 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 17:31:19,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 28 states have (on average 1.1785714285714286) internal successors, (33), 30 states have internal predecessors, (33), 15 states have call successors, (15), 5 states have call predecessors, (15), 5 states have return successors, (14), 13 states have call predecessors, (14), 14 states have call successors, (14) [2022-02-20 17:31:19,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 62 transitions. [2022-02-20 17:31:19,342 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 62 transitions. Word has length 34 [2022-02-20 17:31:19,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 17:31:19,342 INFO L470 AbstractCegarLoop]: Abstraction has 49 states and 62 transitions. [2022-02-20 17:31:19,342 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-02-20 17:31:19,342 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 62 transitions. [2022-02-20 17:31:19,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-02-20 17:31:19,343 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:31:19,343 INFO L514 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 17:31:19,367 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-02-20 17:31:19,559 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 17:31:19,561 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 17:31:19,562 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:31:19,562 INFO L85 PathProgramCache]: Analyzing trace with hash -1829555286, now seen corresponding path program 1 times [2022-02-20 17:31:19,562 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 17:31:19,562 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1904124584] [2022-02-20 17:31:19,562 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:31:19,562 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 17:31:19,577 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-20 17:31:19,585 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2098723399] [2022-02-20 17:31:19,585 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:31:19,585 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 17:31:19,586 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 17:31:19,587 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-20 17:31:19,588 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-02-20 17:31:19,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:31:19,644 INFO L263 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 17 conjunts are in the unsatisfiable core [2022-02-20 17:31:19,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:31:19,656 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 17:31:21,022 INFO L290 TraceCheckUtils]: 0: Hoare triple {1144#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3); {1144#true} is VALID [2022-02-20 17:31:21,022 INFO L290 TraceCheckUtils]: 1: Hoare triple {1144#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_~r~0#1, main_~d~0#1, main_~p~0#1, main_~q~0#1;havoc main_~A~0#1;havoc main_~B~0#1;havoc main_~r~0#1;havoc main_~d~0#1;havoc main_~p~0#1;havoc main_~q~0#1;main_~A~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; {1144#true} is VALID [2022-02-20 17:31:21,022 INFO L272 TraceCheckUtils]: 2: Hoare triple {1144#true} call assume_abort_if_not((if main_~A~0#1 % 4294967296 >= 0 && main_~A~0#1 % 4294967296 <= 1 then 1 else 0)); {1144#true} is VALID [2022-02-20 17:31:21,022 INFO L290 TraceCheckUtils]: 3: Hoare triple {1144#true} ~cond := #in~cond; {1144#true} is VALID [2022-02-20 17:31:21,023 INFO L290 TraceCheckUtils]: 4: Hoare triple {1144#true} assume !(0 == ~cond); {1144#true} is VALID [2022-02-20 17:31:21,023 INFO L290 TraceCheckUtils]: 5: Hoare triple {1144#true} assume true; {1144#true} is VALID [2022-02-20 17:31:21,023 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {1144#true} {1144#true} #78#return; {1144#true} is VALID [2022-02-20 17:31:21,023 INFO L290 TraceCheckUtils]: 7: Hoare triple {1144#true} main_~B~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; {1144#true} is VALID [2022-02-20 17:31:21,023 INFO L272 TraceCheckUtils]: 8: Hoare triple {1144#true} call assume_abort_if_not((if main_~B~0#1 % 4294967296 >= 0 && main_~B~0#1 % 4294967296 <= 1 then 1 else 0)); {1144#true} is VALID [2022-02-20 17:31:21,024 INFO L290 TraceCheckUtils]: 9: Hoare triple {1144#true} ~cond := #in~cond; {1176#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-02-20 17:31:21,025 INFO L290 TraceCheckUtils]: 10: Hoare triple {1176#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {1180#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-02-20 17:31:21,025 INFO L290 TraceCheckUtils]: 11: Hoare triple {1180#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {1180#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-02-20 17:31:21,026 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {1180#(not (= |assume_abort_if_not_#in~cond| 0))} {1144#true} #80#return; {1187#(<= (mod |ULTIMATE.start_main_~B~0#1| 4294967296) 1)} is VALID [2022-02-20 17:31:21,026 INFO L272 TraceCheckUtils]: 13: Hoare triple {1187#(<= (mod |ULTIMATE.start_main_~B~0#1| 4294967296) 1)} call assume_abort_if_not((if main_~B~0#1 % 4294967296 >= 1 then 1 else 0)); {1144#true} is VALID [2022-02-20 17:31:21,026 INFO L290 TraceCheckUtils]: 14: Hoare triple {1144#true} ~cond := #in~cond; {1144#true} is VALID [2022-02-20 17:31:21,027 INFO L290 TraceCheckUtils]: 15: Hoare triple {1144#true} assume !(0 == ~cond); {1144#true} is VALID [2022-02-20 17:31:21,027 INFO L290 TraceCheckUtils]: 16: Hoare triple {1144#true} assume true; {1144#true} is VALID [2022-02-20 17:31:21,030 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {1144#true} {1187#(<= (mod |ULTIMATE.start_main_~B~0#1| 4294967296) 1)} #82#return; {1187#(<= (mod |ULTIMATE.start_main_~B~0#1| 4294967296) 1)} is VALID [2022-02-20 17:31:21,031 INFO L290 TraceCheckUtils]: 18: Hoare triple {1187#(<= (mod |ULTIMATE.start_main_~B~0#1| 4294967296) 1)} main_~r~0#1 := main_~A~0#1;main_~d~0#1 := main_~B~0#1;main_~p~0#1 := 1;main_~q~0#1 := 0; {1206#(and (<= (mod |ULTIMATE.start_main_~B~0#1| 4294967296) 1) (= |ULTIMATE.start_main_~B~0#1| |ULTIMATE.start_main_~d~0#1|) (= |ULTIMATE.start_main_~q~0#1| 0) (= |ULTIMATE.start_main_~A~0#1| |ULTIMATE.start_main_~r~0#1|))} is VALID [2022-02-20 17:31:21,032 INFO L290 TraceCheckUtils]: 19: Hoare triple {1206#(and (<= (mod |ULTIMATE.start_main_~B~0#1| 4294967296) 1) (= |ULTIMATE.start_main_~B~0#1| |ULTIMATE.start_main_~d~0#1|) (= |ULTIMATE.start_main_~q~0#1| 0) (= |ULTIMATE.start_main_~A~0#1| |ULTIMATE.start_main_~r~0#1|))} assume !false; {1206#(and (<= (mod |ULTIMATE.start_main_~B~0#1| 4294967296) 1) (= |ULTIMATE.start_main_~B~0#1| |ULTIMATE.start_main_~d~0#1|) (= |ULTIMATE.start_main_~q~0#1| 0) (= |ULTIMATE.start_main_~A~0#1| |ULTIMATE.start_main_~r~0#1|))} is VALID [2022-02-20 17:31:21,032 INFO L272 TraceCheckUtils]: 20: Hoare triple {1206#(and (<= (mod |ULTIMATE.start_main_~B~0#1| 4294967296) 1) (= |ULTIMATE.start_main_~B~0#1| |ULTIMATE.start_main_~d~0#1|) (= |ULTIMATE.start_main_~q~0#1| 0) (= |ULTIMATE.start_main_~A~0#1| |ULTIMATE.start_main_~r~0#1|))} call __VERIFIER_assert((if 0 == main_~q~0#1 % 4294967296 then 1 else 0)); {1144#true} is VALID [2022-02-20 17:31:21,032 INFO L290 TraceCheckUtils]: 21: Hoare triple {1144#true} ~cond := #in~cond; {1144#true} is VALID [2022-02-20 17:31:21,032 INFO L290 TraceCheckUtils]: 22: Hoare triple {1144#true} assume !(0 == ~cond); {1144#true} is VALID [2022-02-20 17:31:21,033 INFO L290 TraceCheckUtils]: 23: Hoare triple {1144#true} assume true; {1144#true} is VALID [2022-02-20 17:31:21,033 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {1144#true} {1206#(and (<= (mod |ULTIMATE.start_main_~B~0#1| 4294967296) 1) (= |ULTIMATE.start_main_~B~0#1| |ULTIMATE.start_main_~d~0#1|) (= |ULTIMATE.start_main_~q~0#1| 0) (= |ULTIMATE.start_main_~A~0#1| |ULTIMATE.start_main_~r~0#1|))} #84#return; {1206#(and (<= (mod |ULTIMATE.start_main_~B~0#1| 4294967296) 1) (= |ULTIMATE.start_main_~B~0#1| |ULTIMATE.start_main_~d~0#1|) (= |ULTIMATE.start_main_~q~0#1| 0) (= |ULTIMATE.start_main_~A~0#1| |ULTIMATE.start_main_~r~0#1|))} is VALID [2022-02-20 17:31:21,034 INFO L272 TraceCheckUtils]: 25: Hoare triple {1206#(and (<= (mod |ULTIMATE.start_main_~B~0#1| 4294967296) 1) (= |ULTIMATE.start_main_~B~0#1| |ULTIMATE.start_main_~d~0#1|) (= |ULTIMATE.start_main_~q~0#1| 0) (= |ULTIMATE.start_main_~A~0#1| |ULTIMATE.start_main_~r~0#1|))} call __VERIFIER_assert((if main_~r~0#1 % 4294967296 == main_~A~0#1 % 4294967296 then 1 else 0)); {1144#true} is VALID [2022-02-20 17:31:21,034 INFO L290 TraceCheckUtils]: 26: Hoare triple {1144#true} ~cond := #in~cond; {1144#true} is VALID [2022-02-20 17:31:21,034 INFO L290 TraceCheckUtils]: 27: Hoare triple {1144#true} assume !(0 == ~cond); {1144#true} is VALID [2022-02-20 17:31:21,034 INFO L290 TraceCheckUtils]: 28: Hoare triple {1144#true} assume true; {1144#true} is VALID [2022-02-20 17:31:21,035 INFO L284 TraceCheckUtils]: 29: Hoare quadruple {1144#true} {1206#(and (<= (mod |ULTIMATE.start_main_~B~0#1| 4294967296) 1) (= |ULTIMATE.start_main_~B~0#1| |ULTIMATE.start_main_~d~0#1|) (= |ULTIMATE.start_main_~q~0#1| 0) (= |ULTIMATE.start_main_~A~0#1| |ULTIMATE.start_main_~r~0#1|))} #86#return; {1206#(and (<= (mod |ULTIMATE.start_main_~B~0#1| 4294967296) 1) (= |ULTIMATE.start_main_~B~0#1| |ULTIMATE.start_main_~d~0#1|) (= |ULTIMATE.start_main_~q~0#1| 0) (= |ULTIMATE.start_main_~A~0#1| |ULTIMATE.start_main_~r~0#1|))} is VALID [2022-02-20 17:31:21,035 INFO L272 TraceCheckUtils]: 30: Hoare triple {1206#(and (<= (mod |ULTIMATE.start_main_~B~0#1| 4294967296) 1) (= |ULTIMATE.start_main_~B~0#1| |ULTIMATE.start_main_~d~0#1|) (= |ULTIMATE.start_main_~q~0#1| 0) (= |ULTIMATE.start_main_~A~0#1| |ULTIMATE.start_main_~r~0#1|))} call __VERIFIER_assert((if main_~d~0#1 % 4294967296 == main_~B~0#1 * main_~p~0#1 % 4294967296 then 1 else 0)); {1144#true} is VALID [2022-02-20 17:31:21,035 INFO L290 TraceCheckUtils]: 31: Hoare triple {1144#true} ~cond := #in~cond; {1144#true} is VALID [2022-02-20 17:31:21,036 INFO L290 TraceCheckUtils]: 32: Hoare triple {1144#true} assume !(0 == ~cond); {1144#true} is VALID [2022-02-20 17:31:21,036 INFO L290 TraceCheckUtils]: 33: Hoare triple {1144#true} assume true; {1144#true} is VALID [2022-02-20 17:31:21,037 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {1144#true} {1206#(and (<= (mod |ULTIMATE.start_main_~B~0#1| 4294967296) 1) (= |ULTIMATE.start_main_~B~0#1| |ULTIMATE.start_main_~d~0#1|) (= |ULTIMATE.start_main_~q~0#1| 0) (= |ULTIMATE.start_main_~A~0#1| |ULTIMATE.start_main_~r~0#1|))} #88#return; {1206#(and (<= (mod |ULTIMATE.start_main_~B~0#1| 4294967296) 1) (= |ULTIMATE.start_main_~B~0#1| |ULTIMATE.start_main_~d~0#1|) (= |ULTIMATE.start_main_~q~0#1| 0) (= |ULTIMATE.start_main_~A~0#1| |ULTIMATE.start_main_~r~0#1|))} is VALID [2022-02-20 17:31:21,037 INFO L290 TraceCheckUtils]: 35: Hoare triple {1206#(and (<= (mod |ULTIMATE.start_main_~B~0#1| 4294967296) 1) (= |ULTIMATE.start_main_~B~0#1| |ULTIMATE.start_main_~d~0#1|) (= |ULTIMATE.start_main_~q~0#1| 0) (= |ULTIMATE.start_main_~A~0#1| |ULTIMATE.start_main_~r~0#1|))} assume !(main_~r~0#1 % 4294967296 >= main_~d~0#1 % 4294967296); {1258#(and (<= (mod |ULTIMATE.start_main_~B~0#1| 4294967296) 1) (not (<= (mod |ULTIMATE.start_main_~B~0#1| 4294967296) (mod |ULTIMATE.start_main_~r~0#1| 4294967296))) (= |ULTIMATE.start_main_~q~0#1| 0) (= |ULTIMATE.start_main_~A~0#1| |ULTIMATE.start_main_~r~0#1|))} is VALID [2022-02-20 17:31:21,038 INFO L290 TraceCheckUtils]: 36: Hoare triple {1258#(and (<= (mod |ULTIMATE.start_main_~B~0#1| 4294967296) 1) (not (<= (mod |ULTIMATE.start_main_~B~0#1| 4294967296) (mod |ULTIMATE.start_main_~r~0#1| 4294967296))) (= |ULTIMATE.start_main_~q~0#1| 0) (= |ULTIMATE.start_main_~A~0#1| |ULTIMATE.start_main_~r~0#1|))} assume !false; {1258#(and (<= (mod |ULTIMATE.start_main_~B~0#1| 4294967296) 1) (not (<= (mod |ULTIMATE.start_main_~B~0#1| 4294967296) (mod |ULTIMATE.start_main_~r~0#1| 4294967296))) (= |ULTIMATE.start_main_~q~0#1| 0) (= |ULTIMATE.start_main_~A~0#1| |ULTIMATE.start_main_~r~0#1|))} is VALID [2022-02-20 17:31:21,039 INFO L272 TraceCheckUtils]: 37: Hoare triple {1258#(and (<= (mod |ULTIMATE.start_main_~B~0#1| 4294967296) 1) (not (<= (mod |ULTIMATE.start_main_~B~0#1| 4294967296) (mod |ULTIMATE.start_main_~r~0#1| 4294967296))) (= |ULTIMATE.start_main_~q~0#1| 0) (= |ULTIMATE.start_main_~A~0#1| |ULTIMATE.start_main_~r~0#1|))} call __VERIFIER_assert((if main_~A~0#1 % 4294967296 == (main_~q~0#1 * main_~B~0#1 + main_~r~0#1) % 4294967296 then 1 else 0)); {1265#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-02-20 17:31:21,040 INFO L290 TraceCheckUtils]: 38: Hoare triple {1265#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1269#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-02-20 17:31:21,040 INFO L290 TraceCheckUtils]: 39: Hoare triple {1269#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1145#false} is VALID [2022-02-20 17:31:21,040 INFO L290 TraceCheckUtils]: 40: Hoare triple {1145#false} assume !false; {1145#false} is VALID [2022-02-20 17:31:21,041 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 9 proven. 3 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-02-20 17:31:21,041 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 17:31:21,785 INFO L290 TraceCheckUtils]: 40: Hoare triple {1145#false} assume !false; {1145#false} is VALID [2022-02-20 17:31:21,786 INFO L290 TraceCheckUtils]: 39: Hoare triple {1269#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1145#false} is VALID [2022-02-20 17:31:21,787 INFO L290 TraceCheckUtils]: 38: Hoare triple {1265#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1269#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-02-20 17:31:21,788 INFO L272 TraceCheckUtils]: 37: Hoare triple {1285#(= (mod (+ (* |ULTIMATE.start_main_~B~0#1| |ULTIMATE.start_main_~q~0#1|) |ULTIMATE.start_main_~r~0#1|) 4294967296) (mod |ULTIMATE.start_main_~A~0#1| 4294967296))} call __VERIFIER_assert((if main_~A~0#1 % 4294967296 == (main_~q~0#1 * main_~B~0#1 + main_~r~0#1) % 4294967296 then 1 else 0)); {1265#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-02-20 17:31:21,789 INFO L290 TraceCheckUtils]: 36: Hoare triple {1285#(= (mod (+ (* |ULTIMATE.start_main_~B~0#1| |ULTIMATE.start_main_~q~0#1|) |ULTIMATE.start_main_~r~0#1|) 4294967296) (mod |ULTIMATE.start_main_~A~0#1| 4294967296))} assume !false; {1285#(= (mod (+ (* |ULTIMATE.start_main_~B~0#1| |ULTIMATE.start_main_~q~0#1|) |ULTIMATE.start_main_~r~0#1|) 4294967296) (mod |ULTIMATE.start_main_~A~0#1| 4294967296))} is VALID [2022-02-20 17:31:21,789 INFO L290 TraceCheckUtils]: 35: Hoare triple {1292#(or (= (mod (+ (* |ULTIMATE.start_main_~B~0#1| |ULTIMATE.start_main_~q~0#1|) |ULTIMATE.start_main_~r~0#1|) 4294967296) (mod |ULTIMATE.start_main_~A~0#1| 4294967296)) (<= (mod |ULTIMATE.start_main_~d~0#1| 4294967296) (mod |ULTIMATE.start_main_~r~0#1| 4294967296)))} assume !(main_~r~0#1 % 4294967296 >= main_~d~0#1 % 4294967296); {1285#(= (mod (+ (* |ULTIMATE.start_main_~B~0#1| |ULTIMATE.start_main_~q~0#1|) |ULTIMATE.start_main_~r~0#1|) 4294967296) (mod |ULTIMATE.start_main_~A~0#1| 4294967296))} is VALID [2022-02-20 17:31:21,790 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {1144#true} {1292#(or (= (mod (+ (* |ULTIMATE.start_main_~B~0#1| |ULTIMATE.start_main_~q~0#1|) |ULTIMATE.start_main_~r~0#1|) 4294967296) (mod |ULTIMATE.start_main_~A~0#1| 4294967296)) (<= (mod |ULTIMATE.start_main_~d~0#1| 4294967296) (mod |ULTIMATE.start_main_~r~0#1| 4294967296)))} #88#return; {1292#(or (= (mod (+ (* |ULTIMATE.start_main_~B~0#1| |ULTIMATE.start_main_~q~0#1|) |ULTIMATE.start_main_~r~0#1|) 4294967296) (mod |ULTIMATE.start_main_~A~0#1| 4294967296)) (<= (mod |ULTIMATE.start_main_~d~0#1| 4294967296) (mod |ULTIMATE.start_main_~r~0#1| 4294967296)))} is VALID [2022-02-20 17:31:21,790 INFO L290 TraceCheckUtils]: 33: Hoare triple {1144#true} assume true; {1144#true} is VALID [2022-02-20 17:31:21,790 INFO L290 TraceCheckUtils]: 32: Hoare triple {1144#true} assume !(0 == ~cond); {1144#true} is VALID [2022-02-20 17:31:21,790 INFO L290 TraceCheckUtils]: 31: Hoare triple {1144#true} ~cond := #in~cond; {1144#true} is VALID [2022-02-20 17:31:21,791 INFO L272 TraceCheckUtils]: 30: Hoare triple {1292#(or (= (mod (+ (* |ULTIMATE.start_main_~B~0#1| |ULTIMATE.start_main_~q~0#1|) |ULTIMATE.start_main_~r~0#1|) 4294967296) (mod |ULTIMATE.start_main_~A~0#1| 4294967296)) (<= (mod |ULTIMATE.start_main_~d~0#1| 4294967296) (mod |ULTIMATE.start_main_~r~0#1| 4294967296)))} call __VERIFIER_assert((if main_~d~0#1 % 4294967296 == main_~B~0#1 * main_~p~0#1 % 4294967296 then 1 else 0)); {1144#true} is VALID [2022-02-20 17:31:21,791 INFO L284 TraceCheckUtils]: 29: Hoare quadruple {1144#true} {1292#(or (= (mod (+ (* |ULTIMATE.start_main_~B~0#1| |ULTIMATE.start_main_~q~0#1|) |ULTIMATE.start_main_~r~0#1|) 4294967296) (mod |ULTIMATE.start_main_~A~0#1| 4294967296)) (<= (mod |ULTIMATE.start_main_~d~0#1| 4294967296) (mod |ULTIMATE.start_main_~r~0#1| 4294967296)))} #86#return; {1292#(or (= (mod (+ (* |ULTIMATE.start_main_~B~0#1| |ULTIMATE.start_main_~q~0#1|) |ULTIMATE.start_main_~r~0#1|) 4294967296) (mod |ULTIMATE.start_main_~A~0#1| 4294967296)) (<= (mod |ULTIMATE.start_main_~d~0#1| 4294967296) (mod |ULTIMATE.start_main_~r~0#1| 4294967296)))} is VALID [2022-02-20 17:31:21,792 INFO L290 TraceCheckUtils]: 28: Hoare triple {1144#true} assume true; {1144#true} is VALID [2022-02-20 17:31:21,792 INFO L290 TraceCheckUtils]: 27: Hoare triple {1144#true} assume !(0 == ~cond); {1144#true} is VALID [2022-02-20 17:31:21,792 INFO L290 TraceCheckUtils]: 26: Hoare triple {1144#true} ~cond := #in~cond; {1144#true} is VALID [2022-02-20 17:31:21,792 INFO L272 TraceCheckUtils]: 25: Hoare triple {1292#(or (= (mod (+ (* |ULTIMATE.start_main_~B~0#1| |ULTIMATE.start_main_~q~0#1|) |ULTIMATE.start_main_~r~0#1|) 4294967296) (mod |ULTIMATE.start_main_~A~0#1| 4294967296)) (<= (mod |ULTIMATE.start_main_~d~0#1| 4294967296) (mod |ULTIMATE.start_main_~r~0#1| 4294967296)))} call __VERIFIER_assert((if main_~r~0#1 % 4294967296 == main_~A~0#1 % 4294967296 then 1 else 0)); {1144#true} is VALID [2022-02-20 17:31:21,793 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {1144#true} {1292#(or (= (mod (+ (* |ULTIMATE.start_main_~B~0#1| |ULTIMATE.start_main_~q~0#1|) |ULTIMATE.start_main_~r~0#1|) 4294967296) (mod |ULTIMATE.start_main_~A~0#1| 4294967296)) (<= (mod |ULTIMATE.start_main_~d~0#1| 4294967296) (mod |ULTIMATE.start_main_~r~0#1| 4294967296)))} #84#return; {1292#(or (= (mod (+ (* |ULTIMATE.start_main_~B~0#1| |ULTIMATE.start_main_~q~0#1|) |ULTIMATE.start_main_~r~0#1|) 4294967296) (mod |ULTIMATE.start_main_~A~0#1| 4294967296)) (<= (mod |ULTIMATE.start_main_~d~0#1| 4294967296) (mod |ULTIMATE.start_main_~r~0#1| 4294967296)))} is VALID [2022-02-20 17:31:21,793 INFO L290 TraceCheckUtils]: 23: Hoare triple {1144#true} assume true; {1144#true} is VALID [2022-02-20 17:31:21,794 INFO L290 TraceCheckUtils]: 22: Hoare triple {1144#true} assume !(0 == ~cond); {1144#true} is VALID [2022-02-20 17:31:21,795 INFO L290 TraceCheckUtils]: 21: Hoare triple {1144#true} ~cond := #in~cond; {1144#true} is VALID [2022-02-20 17:31:21,798 INFO L272 TraceCheckUtils]: 20: Hoare triple {1292#(or (= (mod (+ (* |ULTIMATE.start_main_~B~0#1| |ULTIMATE.start_main_~q~0#1|) |ULTIMATE.start_main_~r~0#1|) 4294967296) (mod |ULTIMATE.start_main_~A~0#1| 4294967296)) (<= (mod |ULTIMATE.start_main_~d~0#1| 4294967296) (mod |ULTIMATE.start_main_~r~0#1| 4294967296)))} call __VERIFIER_assert((if 0 == main_~q~0#1 % 4294967296 then 1 else 0)); {1144#true} is VALID [2022-02-20 17:31:21,800 INFO L290 TraceCheckUtils]: 19: Hoare triple {1292#(or (= (mod (+ (* |ULTIMATE.start_main_~B~0#1| |ULTIMATE.start_main_~q~0#1|) |ULTIMATE.start_main_~r~0#1|) 4294967296) (mod |ULTIMATE.start_main_~A~0#1| 4294967296)) (<= (mod |ULTIMATE.start_main_~d~0#1| 4294967296) (mod |ULTIMATE.start_main_~r~0#1| 4294967296)))} assume !false; {1292#(or (= (mod (+ (* |ULTIMATE.start_main_~B~0#1| |ULTIMATE.start_main_~q~0#1|) |ULTIMATE.start_main_~r~0#1|) 4294967296) (mod |ULTIMATE.start_main_~A~0#1| 4294967296)) (<= (mod |ULTIMATE.start_main_~d~0#1| 4294967296) (mod |ULTIMATE.start_main_~r~0#1| 4294967296)))} is VALID [2022-02-20 17:31:21,806 INFO L290 TraceCheckUtils]: 18: Hoare triple {1144#true} main_~r~0#1 := main_~A~0#1;main_~d~0#1 := main_~B~0#1;main_~p~0#1 := 1;main_~q~0#1 := 0; {1292#(or (= (mod (+ (* |ULTIMATE.start_main_~B~0#1| |ULTIMATE.start_main_~q~0#1|) |ULTIMATE.start_main_~r~0#1|) 4294967296) (mod |ULTIMATE.start_main_~A~0#1| 4294967296)) (<= (mod |ULTIMATE.start_main_~d~0#1| 4294967296) (mod |ULTIMATE.start_main_~r~0#1| 4294967296)))} is VALID [2022-02-20 17:31:21,807 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {1144#true} {1144#true} #82#return; {1144#true} is VALID [2022-02-20 17:31:21,807 INFO L290 TraceCheckUtils]: 16: Hoare triple {1144#true} assume true; {1144#true} is VALID [2022-02-20 17:31:21,807 INFO L290 TraceCheckUtils]: 15: Hoare triple {1144#true} assume !(0 == ~cond); {1144#true} is VALID [2022-02-20 17:31:21,807 INFO L290 TraceCheckUtils]: 14: Hoare triple {1144#true} ~cond := #in~cond; {1144#true} is VALID [2022-02-20 17:31:21,808 INFO L272 TraceCheckUtils]: 13: Hoare triple {1144#true} call assume_abort_if_not((if main_~B~0#1 % 4294967296 >= 1 then 1 else 0)); {1144#true} is VALID [2022-02-20 17:31:21,808 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {1144#true} {1144#true} #80#return; {1144#true} is VALID [2022-02-20 17:31:21,808 INFO L290 TraceCheckUtils]: 11: Hoare triple {1144#true} assume true; {1144#true} is VALID [2022-02-20 17:31:21,808 INFO L290 TraceCheckUtils]: 10: Hoare triple {1144#true} assume !(0 == ~cond); {1144#true} is VALID [2022-02-20 17:31:21,808 INFO L290 TraceCheckUtils]: 9: Hoare triple {1144#true} ~cond := #in~cond; {1144#true} is VALID [2022-02-20 17:31:21,808 INFO L272 TraceCheckUtils]: 8: Hoare triple {1144#true} call assume_abort_if_not((if main_~B~0#1 % 4294967296 >= 0 && main_~B~0#1 % 4294967296 <= 1 then 1 else 0)); {1144#true} is VALID [2022-02-20 17:31:21,809 INFO L290 TraceCheckUtils]: 7: Hoare triple {1144#true} main_~B~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; {1144#true} is VALID [2022-02-20 17:31:21,809 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {1144#true} {1144#true} #78#return; {1144#true} is VALID [2022-02-20 17:31:21,809 INFO L290 TraceCheckUtils]: 5: Hoare triple {1144#true} assume true; {1144#true} is VALID [2022-02-20 17:31:21,809 INFO L290 TraceCheckUtils]: 4: Hoare triple {1144#true} assume !(0 == ~cond); {1144#true} is VALID [2022-02-20 17:31:21,809 INFO L290 TraceCheckUtils]: 3: Hoare triple {1144#true} ~cond := #in~cond; {1144#true} is VALID [2022-02-20 17:31:21,809 INFO L272 TraceCheckUtils]: 2: Hoare triple {1144#true} call assume_abort_if_not((if main_~A~0#1 % 4294967296 >= 0 && main_~A~0#1 % 4294967296 <= 1 then 1 else 0)); {1144#true} is VALID [2022-02-20 17:31:21,810 INFO L290 TraceCheckUtils]: 1: Hoare triple {1144#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_~r~0#1, main_~d~0#1, main_~p~0#1, main_~q~0#1;havoc main_~A~0#1;havoc main_~B~0#1;havoc main_~r~0#1;havoc main_~d~0#1;havoc main_~p~0#1;havoc main_~q~0#1;main_~A~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; {1144#true} is VALID [2022-02-20 17:31:21,810 INFO L290 TraceCheckUtils]: 0: Hoare triple {1144#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3); {1144#true} is VALID [2022-02-20 17:31:21,810 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-02-20 17:31:21,810 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 17:31:21,810 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1904124584] [2022-02-20 17:31:21,811 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-20 17:31:21,811 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2098723399] [2022-02-20 17:31:21,814 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2098723399] provided 1 perfect and 1 imperfect interpolant sequences [2022-02-20 17:31:21,815 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-02-20 17:31:21,815 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [9] total 11 [2022-02-20 17:31:21,815 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [724334427] [2022-02-20 17:31:21,815 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 17:31:21,816 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 3 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 41 [2022-02-20 17:31:21,816 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 17:31:21,816 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 3 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-02-20 17:31:21,852 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 29 edges. 29 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:31:21,852 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-20 17:31:21,852 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 17:31:21,853 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-20 17:31:21,853 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2022-02-20 17:31:21,854 INFO L87 Difference]: Start difference. First operand 49 states and 62 transitions. Second operand has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 3 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-02-20 17:31:25,190 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-02-20 17:31:25,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:31:25,514 INFO L93 Difference]: Finished difference Result 62 states and 79 transitions. [2022-02-20 17:31:25,514 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 17:31:25,514 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 3 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 41 [2022-02-20 17:31:25,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 17:31:25,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 3 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-02-20 17:31:25,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 56 transitions. [2022-02-20 17:31:25,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 3 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-02-20 17:31:25,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 56 transitions. [2022-02-20 17:31:25,518 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 56 transitions. [2022-02-20 17:31:25,571 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 56 edges. 56 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:31:25,573 INFO L225 Difference]: With dead ends: 62 [2022-02-20 17:31:25,573 INFO L226 Difference]: Without dead ends: 60 [2022-02-20 17:31:25,573 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 70 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2022-02-20 17:31:25,574 INFO L933 BasicCegarLoop]: 38 mSDtfsCounter, 16 mSDsluCounter, 92 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 4 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 130 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2022-02-20 17:31:25,574 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [22 Valid, 130 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 34 Invalid, 1 Unknown, 0 Unchecked, 2.1s Time] [2022-02-20 17:31:25,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2022-02-20 17:31:25,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 58. [2022-02-20 17:31:25,601 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 17:31:25,601 INFO L82 GeneralOperation]: Start isEquivalent. First operand 60 states. Second operand has 58 states, 34 states have (on average 1.2058823529411764) internal successors, (41), 36 states have internal predecessors, (41), 17 states have call successors, (17), 6 states have call predecessors, (17), 6 states have return successors, (16), 15 states have call predecessors, (16), 16 states have call successors, (16) [2022-02-20 17:31:25,602 INFO L74 IsIncluded]: Start isIncluded. First operand 60 states. Second operand has 58 states, 34 states have (on average 1.2058823529411764) internal successors, (41), 36 states have internal predecessors, (41), 17 states have call successors, (17), 6 states have call predecessors, (17), 6 states have return successors, (16), 15 states have call predecessors, (16), 16 states have call successors, (16) [2022-02-20 17:31:25,602 INFO L87 Difference]: Start difference. First operand 60 states. Second operand has 58 states, 34 states have (on average 1.2058823529411764) internal successors, (41), 36 states have internal predecessors, (41), 17 states have call successors, (17), 6 states have call predecessors, (17), 6 states have return successors, (16), 15 states have call predecessors, (16), 16 states have call successors, (16) [2022-02-20 17:31:25,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:31:25,608 INFO L93 Difference]: Finished difference Result 60 states and 77 transitions. [2022-02-20 17:31:25,608 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 77 transitions. [2022-02-20 17:31:25,609 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:31:25,609 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:31:25,609 INFO L74 IsIncluded]: Start isIncluded. First operand has 58 states, 34 states have (on average 1.2058823529411764) internal successors, (41), 36 states have internal predecessors, (41), 17 states have call successors, (17), 6 states have call predecessors, (17), 6 states have return successors, (16), 15 states have call predecessors, (16), 16 states have call successors, (16) Second operand 60 states. [2022-02-20 17:31:25,609 INFO L87 Difference]: Start difference. First operand has 58 states, 34 states have (on average 1.2058823529411764) internal successors, (41), 36 states have internal predecessors, (41), 17 states have call successors, (17), 6 states have call predecessors, (17), 6 states have return successors, (16), 15 states have call predecessors, (16), 16 states have call successors, (16) Second operand 60 states. [2022-02-20 17:31:25,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:31:25,612 INFO L93 Difference]: Finished difference Result 60 states and 77 transitions. [2022-02-20 17:31:25,612 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 77 transitions. [2022-02-20 17:31:25,612 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:31:25,613 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:31:25,613 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 17:31:25,613 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 17:31:25,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 34 states have (on average 1.2058823529411764) internal successors, (41), 36 states have internal predecessors, (41), 17 states have call successors, (17), 6 states have call predecessors, (17), 6 states have return successors, (16), 15 states have call predecessors, (16), 16 states have call successors, (16) [2022-02-20 17:31:25,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 74 transitions. [2022-02-20 17:31:25,616 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 74 transitions. Word has length 41 [2022-02-20 17:31:25,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 17:31:25,616 INFO L470 AbstractCegarLoop]: Abstraction has 58 states and 74 transitions. [2022-02-20 17:31:25,616 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 3 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-02-20 17:31:25,616 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 74 transitions. [2022-02-20 17:31:25,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-02-20 17:31:25,617 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:31:25,617 INFO L514 BasicCegarLoop]: trace histogram [6, 5, 5, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 17:31:25,639 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-02-20 17:31:25,831 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 17:31:25,832 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 17:31:25,832 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:31:25,832 INFO L85 PathProgramCache]: Analyzing trace with hash 105343995, now seen corresponding path program 1 times [2022-02-20 17:31:25,832 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 17:31:25,832 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1496749945] [2022-02-20 17:31:25,832 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:31:25,832 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 17:31:25,857 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-20 17:31:25,863 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [918059988] [2022-02-20 17:31:25,863 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:31:25,864 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 17:31:25,864 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 17:31:25,865 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-20 17:31:25,888 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-02-20 17:31:26,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:31:26,024 INFO L263 TraceCheckSpWp]: Trace formula consists of 124 conjuncts, 11 conjunts are in the unsatisfiable core [2022-02-20 17:31:26,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:31:26,037 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 17:31:26,253 INFO L290 TraceCheckUtils]: 0: Hoare triple {1691#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3); {1691#true} is VALID [2022-02-20 17:31:26,253 INFO L290 TraceCheckUtils]: 1: Hoare triple {1691#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_~r~0#1, main_~d~0#1, main_~p~0#1, main_~q~0#1;havoc main_~A~0#1;havoc main_~B~0#1;havoc main_~r~0#1;havoc main_~d~0#1;havoc main_~p~0#1;havoc main_~q~0#1;main_~A~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; {1691#true} is VALID [2022-02-20 17:31:26,253 INFO L272 TraceCheckUtils]: 2: Hoare triple {1691#true} call assume_abort_if_not((if main_~A~0#1 % 4294967296 >= 0 && main_~A~0#1 % 4294967296 <= 1 then 1 else 0)); {1691#true} is VALID [2022-02-20 17:31:26,253 INFO L290 TraceCheckUtils]: 3: Hoare triple {1691#true} ~cond := #in~cond; {1691#true} is VALID [2022-02-20 17:31:26,253 INFO L290 TraceCheckUtils]: 4: Hoare triple {1691#true} assume !(0 == ~cond); {1691#true} is VALID [2022-02-20 17:31:26,253 INFO L290 TraceCheckUtils]: 5: Hoare triple {1691#true} assume true; {1691#true} is VALID [2022-02-20 17:31:26,254 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {1691#true} {1691#true} #78#return; {1691#true} is VALID [2022-02-20 17:31:26,254 INFO L290 TraceCheckUtils]: 7: Hoare triple {1691#true} main_~B~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; {1691#true} is VALID [2022-02-20 17:31:26,254 INFO L272 TraceCheckUtils]: 8: Hoare triple {1691#true} call assume_abort_if_not((if main_~B~0#1 % 4294967296 >= 0 && main_~B~0#1 % 4294967296 <= 1 then 1 else 0)); {1691#true} is VALID [2022-02-20 17:31:26,254 INFO L290 TraceCheckUtils]: 9: Hoare triple {1691#true} ~cond := #in~cond; {1691#true} is VALID [2022-02-20 17:31:26,254 INFO L290 TraceCheckUtils]: 10: Hoare triple {1691#true} assume !(0 == ~cond); {1691#true} is VALID [2022-02-20 17:31:26,254 INFO L290 TraceCheckUtils]: 11: Hoare triple {1691#true} assume true; {1691#true} is VALID [2022-02-20 17:31:26,254 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {1691#true} {1691#true} #80#return; {1691#true} is VALID [2022-02-20 17:31:26,254 INFO L272 TraceCheckUtils]: 13: Hoare triple {1691#true} call assume_abort_if_not((if main_~B~0#1 % 4294967296 >= 1 then 1 else 0)); {1691#true} is VALID [2022-02-20 17:31:26,254 INFO L290 TraceCheckUtils]: 14: Hoare triple {1691#true} ~cond := #in~cond; {1691#true} is VALID [2022-02-20 17:31:26,254 INFO L290 TraceCheckUtils]: 15: Hoare triple {1691#true} assume !(0 == ~cond); {1691#true} is VALID [2022-02-20 17:31:26,254 INFO L290 TraceCheckUtils]: 16: Hoare triple {1691#true} assume true; {1691#true} is VALID [2022-02-20 17:31:26,255 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {1691#true} {1691#true} #82#return; {1691#true} is VALID [2022-02-20 17:31:26,255 INFO L290 TraceCheckUtils]: 18: Hoare triple {1691#true} main_~r~0#1 := main_~A~0#1;main_~d~0#1 := main_~B~0#1;main_~p~0#1 := 1;main_~q~0#1 := 0; {1750#(and (= |ULTIMATE.start_main_~p~0#1| 1) (= |ULTIMATE.start_main_~B~0#1| |ULTIMATE.start_main_~d~0#1|))} is VALID [2022-02-20 17:31:26,256 INFO L290 TraceCheckUtils]: 19: Hoare triple {1750#(and (= |ULTIMATE.start_main_~p~0#1| 1) (= |ULTIMATE.start_main_~B~0#1| |ULTIMATE.start_main_~d~0#1|))} assume !false; {1750#(and (= |ULTIMATE.start_main_~p~0#1| 1) (= |ULTIMATE.start_main_~B~0#1| |ULTIMATE.start_main_~d~0#1|))} is VALID [2022-02-20 17:31:26,256 INFO L272 TraceCheckUtils]: 20: Hoare triple {1750#(and (= |ULTIMATE.start_main_~p~0#1| 1) (= |ULTIMATE.start_main_~B~0#1| |ULTIMATE.start_main_~d~0#1|))} call __VERIFIER_assert((if 0 == main_~q~0#1 % 4294967296 then 1 else 0)); {1691#true} is VALID [2022-02-20 17:31:26,256 INFO L290 TraceCheckUtils]: 21: Hoare triple {1691#true} ~cond := #in~cond; {1691#true} is VALID [2022-02-20 17:31:26,256 INFO L290 TraceCheckUtils]: 22: Hoare triple {1691#true} assume !(0 == ~cond); {1691#true} is VALID [2022-02-20 17:31:26,256 INFO L290 TraceCheckUtils]: 23: Hoare triple {1691#true} assume true; {1691#true} is VALID [2022-02-20 17:31:26,256 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {1691#true} {1750#(and (= |ULTIMATE.start_main_~p~0#1| 1) (= |ULTIMATE.start_main_~B~0#1| |ULTIMATE.start_main_~d~0#1|))} #84#return; {1750#(and (= |ULTIMATE.start_main_~p~0#1| 1) (= |ULTIMATE.start_main_~B~0#1| |ULTIMATE.start_main_~d~0#1|))} is VALID [2022-02-20 17:31:26,257 INFO L272 TraceCheckUtils]: 25: Hoare triple {1750#(and (= |ULTIMATE.start_main_~p~0#1| 1) (= |ULTIMATE.start_main_~B~0#1| |ULTIMATE.start_main_~d~0#1|))} call __VERIFIER_assert((if main_~r~0#1 % 4294967296 == main_~A~0#1 % 4294967296 then 1 else 0)); {1691#true} is VALID [2022-02-20 17:31:26,257 INFO L290 TraceCheckUtils]: 26: Hoare triple {1691#true} ~cond := #in~cond; {1691#true} is VALID [2022-02-20 17:31:26,257 INFO L290 TraceCheckUtils]: 27: Hoare triple {1691#true} assume !(0 == ~cond); {1691#true} is VALID [2022-02-20 17:31:26,257 INFO L290 TraceCheckUtils]: 28: Hoare triple {1691#true} assume true; {1691#true} is VALID [2022-02-20 17:31:26,257 INFO L284 TraceCheckUtils]: 29: Hoare quadruple {1691#true} {1750#(and (= |ULTIMATE.start_main_~p~0#1| 1) (= |ULTIMATE.start_main_~B~0#1| |ULTIMATE.start_main_~d~0#1|))} #86#return; {1750#(and (= |ULTIMATE.start_main_~p~0#1| 1) (= |ULTIMATE.start_main_~B~0#1| |ULTIMATE.start_main_~d~0#1|))} is VALID [2022-02-20 17:31:26,257 INFO L272 TraceCheckUtils]: 30: Hoare triple {1750#(and (= |ULTIMATE.start_main_~p~0#1| 1) (= |ULTIMATE.start_main_~B~0#1| |ULTIMATE.start_main_~d~0#1|))} call __VERIFIER_assert((if main_~d~0#1 % 4294967296 == main_~B~0#1 * main_~p~0#1 % 4294967296 then 1 else 0)); {1691#true} is VALID [2022-02-20 17:31:26,257 INFO L290 TraceCheckUtils]: 31: Hoare triple {1691#true} ~cond := #in~cond; {1691#true} is VALID [2022-02-20 17:31:26,258 INFO L290 TraceCheckUtils]: 32: Hoare triple {1691#true} assume !(0 == ~cond); {1691#true} is VALID [2022-02-20 17:31:26,258 INFO L290 TraceCheckUtils]: 33: Hoare triple {1691#true} assume true; {1691#true} is VALID [2022-02-20 17:31:26,258 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {1691#true} {1750#(and (= |ULTIMATE.start_main_~p~0#1| 1) (= |ULTIMATE.start_main_~B~0#1| |ULTIMATE.start_main_~d~0#1|))} #88#return; {1750#(and (= |ULTIMATE.start_main_~p~0#1| 1) (= |ULTIMATE.start_main_~B~0#1| |ULTIMATE.start_main_~d~0#1|))} is VALID [2022-02-20 17:31:26,259 INFO L290 TraceCheckUtils]: 35: Hoare triple {1750#(and (= |ULTIMATE.start_main_~p~0#1| 1) (= |ULTIMATE.start_main_~B~0#1| |ULTIMATE.start_main_~d~0#1|))} assume !!(main_~r~0#1 % 4294967296 >= main_~d~0#1 % 4294967296);main_~d~0#1 := 2 * main_~d~0#1;main_~p~0#1 := 2 * main_~p~0#1; {1802#(and (= |ULTIMATE.start_main_~d~0#1| (* 2 |ULTIMATE.start_main_~B~0#1|)) (= 2 |ULTIMATE.start_main_~p~0#1|))} is VALID [2022-02-20 17:31:26,259 INFO L290 TraceCheckUtils]: 36: Hoare triple {1802#(and (= |ULTIMATE.start_main_~d~0#1| (* 2 |ULTIMATE.start_main_~B~0#1|)) (= 2 |ULTIMATE.start_main_~p~0#1|))} assume !false; {1802#(and (= |ULTIMATE.start_main_~d~0#1| (* 2 |ULTIMATE.start_main_~B~0#1|)) (= 2 |ULTIMATE.start_main_~p~0#1|))} is VALID [2022-02-20 17:31:26,259 INFO L272 TraceCheckUtils]: 37: Hoare triple {1802#(and (= |ULTIMATE.start_main_~d~0#1| (* 2 |ULTIMATE.start_main_~B~0#1|)) (= 2 |ULTIMATE.start_main_~p~0#1|))} call __VERIFIER_assert((if 0 == main_~q~0#1 % 4294967296 then 1 else 0)); {1691#true} is VALID [2022-02-20 17:31:26,259 INFO L290 TraceCheckUtils]: 38: Hoare triple {1691#true} ~cond := #in~cond; {1691#true} is VALID [2022-02-20 17:31:26,259 INFO L290 TraceCheckUtils]: 39: Hoare triple {1691#true} assume !(0 == ~cond); {1691#true} is VALID [2022-02-20 17:31:26,259 INFO L290 TraceCheckUtils]: 40: Hoare triple {1691#true} assume true; {1691#true} is VALID [2022-02-20 17:31:26,260 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {1691#true} {1802#(and (= |ULTIMATE.start_main_~d~0#1| (* 2 |ULTIMATE.start_main_~B~0#1|)) (= 2 |ULTIMATE.start_main_~p~0#1|))} #84#return; {1802#(and (= |ULTIMATE.start_main_~d~0#1| (* 2 |ULTIMATE.start_main_~B~0#1|)) (= 2 |ULTIMATE.start_main_~p~0#1|))} is VALID [2022-02-20 17:31:26,260 INFO L272 TraceCheckUtils]: 42: Hoare triple {1802#(and (= |ULTIMATE.start_main_~d~0#1| (* 2 |ULTIMATE.start_main_~B~0#1|)) (= 2 |ULTIMATE.start_main_~p~0#1|))} call __VERIFIER_assert((if main_~r~0#1 % 4294967296 == main_~A~0#1 % 4294967296 then 1 else 0)); {1691#true} is VALID [2022-02-20 17:31:26,260 INFO L290 TraceCheckUtils]: 43: Hoare triple {1691#true} ~cond := #in~cond; {1691#true} is VALID [2022-02-20 17:31:26,260 INFO L290 TraceCheckUtils]: 44: Hoare triple {1691#true} assume !(0 == ~cond); {1691#true} is VALID [2022-02-20 17:31:26,261 INFO L290 TraceCheckUtils]: 45: Hoare triple {1691#true} assume true; {1691#true} is VALID [2022-02-20 17:31:26,261 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {1691#true} {1802#(and (= |ULTIMATE.start_main_~d~0#1| (* 2 |ULTIMATE.start_main_~B~0#1|)) (= 2 |ULTIMATE.start_main_~p~0#1|))} #86#return; {1802#(and (= |ULTIMATE.start_main_~d~0#1| (* 2 |ULTIMATE.start_main_~B~0#1|)) (= 2 |ULTIMATE.start_main_~p~0#1|))} is VALID [2022-02-20 17:31:26,263 INFO L272 TraceCheckUtils]: 47: Hoare triple {1802#(and (= |ULTIMATE.start_main_~d~0#1| (* 2 |ULTIMATE.start_main_~B~0#1|)) (= 2 |ULTIMATE.start_main_~p~0#1|))} call __VERIFIER_assert((if main_~d~0#1 % 4294967296 == main_~B~0#1 * main_~p~0#1 % 4294967296 then 1 else 0)); {1839#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-02-20 17:31:26,263 INFO L290 TraceCheckUtils]: 48: Hoare triple {1839#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1843#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-02-20 17:31:26,264 INFO L290 TraceCheckUtils]: 49: Hoare triple {1843#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1692#false} is VALID [2022-02-20 17:31:26,264 INFO L290 TraceCheckUtils]: 50: Hoare triple {1692#false} assume !false; {1692#false} is VALID [2022-02-20 17:31:26,264 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 10 proven. 4 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2022-02-20 17:31:26,264 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 17:31:27,187 INFO L290 TraceCheckUtils]: 50: Hoare triple {1692#false} assume !false; {1692#false} is VALID [2022-02-20 17:31:27,187 INFO L290 TraceCheckUtils]: 49: Hoare triple {1843#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1692#false} is VALID [2022-02-20 17:31:27,188 INFO L290 TraceCheckUtils]: 48: Hoare triple {1839#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1843#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-02-20 17:31:27,189 INFO L272 TraceCheckUtils]: 47: Hoare triple {1859#(= (mod (* |ULTIMATE.start_main_~B~0#1| |ULTIMATE.start_main_~p~0#1|) 4294967296) (mod |ULTIMATE.start_main_~d~0#1| 4294967296))} call __VERIFIER_assert((if main_~d~0#1 % 4294967296 == main_~B~0#1 * main_~p~0#1 % 4294967296 then 1 else 0)); {1839#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-02-20 17:31:27,189 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {1691#true} {1859#(= (mod (* |ULTIMATE.start_main_~B~0#1| |ULTIMATE.start_main_~p~0#1|) 4294967296) (mod |ULTIMATE.start_main_~d~0#1| 4294967296))} #86#return; {1859#(= (mod (* |ULTIMATE.start_main_~B~0#1| |ULTIMATE.start_main_~p~0#1|) 4294967296) (mod |ULTIMATE.start_main_~d~0#1| 4294967296))} is VALID [2022-02-20 17:31:27,189 INFO L290 TraceCheckUtils]: 45: Hoare triple {1691#true} assume true; {1691#true} is VALID [2022-02-20 17:31:27,189 INFO L290 TraceCheckUtils]: 44: Hoare triple {1691#true} assume !(0 == ~cond); {1691#true} is VALID [2022-02-20 17:31:27,190 INFO L290 TraceCheckUtils]: 43: Hoare triple {1691#true} ~cond := #in~cond; {1691#true} is VALID [2022-02-20 17:31:27,190 INFO L272 TraceCheckUtils]: 42: Hoare triple {1859#(= (mod (* |ULTIMATE.start_main_~B~0#1| |ULTIMATE.start_main_~p~0#1|) 4294967296) (mod |ULTIMATE.start_main_~d~0#1| 4294967296))} call __VERIFIER_assert((if main_~r~0#1 % 4294967296 == main_~A~0#1 % 4294967296 then 1 else 0)); {1691#true} is VALID [2022-02-20 17:31:27,190 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {1691#true} {1859#(= (mod (* |ULTIMATE.start_main_~B~0#1| |ULTIMATE.start_main_~p~0#1|) 4294967296) (mod |ULTIMATE.start_main_~d~0#1| 4294967296))} #84#return; {1859#(= (mod (* |ULTIMATE.start_main_~B~0#1| |ULTIMATE.start_main_~p~0#1|) 4294967296) (mod |ULTIMATE.start_main_~d~0#1| 4294967296))} is VALID [2022-02-20 17:31:27,190 INFO L290 TraceCheckUtils]: 40: Hoare triple {1691#true} assume true; {1691#true} is VALID [2022-02-20 17:31:27,190 INFO L290 TraceCheckUtils]: 39: Hoare triple {1691#true} assume !(0 == ~cond); {1691#true} is VALID [2022-02-20 17:31:27,191 INFO L290 TraceCheckUtils]: 38: Hoare triple {1691#true} ~cond := #in~cond; {1691#true} is VALID [2022-02-20 17:31:27,191 INFO L272 TraceCheckUtils]: 37: Hoare triple {1859#(= (mod (* |ULTIMATE.start_main_~B~0#1| |ULTIMATE.start_main_~p~0#1|) 4294967296) (mod |ULTIMATE.start_main_~d~0#1| 4294967296))} call __VERIFIER_assert((if 0 == main_~q~0#1 % 4294967296 then 1 else 0)); {1691#true} is VALID [2022-02-20 17:31:27,191 INFO L290 TraceCheckUtils]: 36: Hoare triple {1859#(= (mod (* |ULTIMATE.start_main_~B~0#1| |ULTIMATE.start_main_~p~0#1|) 4294967296) (mod |ULTIMATE.start_main_~d~0#1| 4294967296))} assume !false; {1859#(= (mod (* |ULTIMATE.start_main_~B~0#1| |ULTIMATE.start_main_~p~0#1|) 4294967296) (mod |ULTIMATE.start_main_~d~0#1| 4294967296))} is VALID [2022-02-20 17:31:29,196 WARN L290 TraceCheckUtils]: 35: Hoare triple {1896#(= (mod (* |ULTIMATE.start_main_~B~0#1| (* 2 |ULTIMATE.start_main_~p~0#1|)) 4294967296) (mod (* 2 |ULTIMATE.start_main_~d~0#1|) 4294967296))} assume !!(main_~r~0#1 % 4294967296 >= main_~d~0#1 % 4294967296);main_~d~0#1 := 2 * main_~d~0#1;main_~p~0#1 := 2 * main_~p~0#1; {1859#(= (mod (* |ULTIMATE.start_main_~B~0#1| |ULTIMATE.start_main_~p~0#1|) 4294967296) (mod |ULTIMATE.start_main_~d~0#1| 4294967296))} is UNKNOWN [2022-02-20 17:31:29,197 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {1691#true} {1896#(= (mod (* |ULTIMATE.start_main_~B~0#1| (* 2 |ULTIMATE.start_main_~p~0#1|)) 4294967296) (mod (* 2 |ULTIMATE.start_main_~d~0#1|) 4294967296))} #88#return; {1896#(= (mod (* |ULTIMATE.start_main_~B~0#1| (* 2 |ULTIMATE.start_main_~p~0#1|)) 4294967296) (mod (* 2 |ULTIMATE.start_main_~d~0#1|) 4294967296))} is VALID [2022-02-20 17:31:29,197 INFO L290 TraceCheckUtils]: 33: Hoare triple {1691#true} assume true; {1691#true} is VALID [2022-02-20 17:31:29,197 INFO L290 TraceCheckUtils]: 32: Hoare triple {1691#true} assume !(0 == ~cond); {1691#true} is VALID [2022-02-20 17:31:29,197 INFO L290 TraceCheckUtils]: 31: Hoare triple {1691#true} ~cond := #in~cond; {1691#true} is VALID [2022-02-20 17:31:29,197 INFO L272 TraceCheckUtils]: 30: Hoare triple {1896#(= (mod (* |ULTIMATE.start_main_~B~0#1| (* 2 |ULTIMATE.start_main_~p~0#1|)) 4294967296) (mod (* 2 |ULTIMATE.start_main_~d~0#1|) 4294967296))} call __VERIFIER_assert((if main_~d~0#1 % 4294967296 == main_~B~0#1 * main_~p~0#1 % 4294967296 then 1 else 0)); {1691#true} is VALID [2022-02-20 17:31:29,197 INFO L284 TraceCheckUtils]: 29: Hoare quadruple {1691#true} {1896#(= (mod (* |ULTIMATE.start_main_~B~0#1| (* 2 |ULTIMATE.start_main_~p~0#1|)) 4294967296) (mod (* 2 |ULTIMATE.start_main_~d~0#1|) 4294967296))} #86#return; {1896#(= (mod (* |ULTIMATE.start_main_~B~0#1| (* 2 |ULTIMATE.start_main_~p~0#1|)) 4294967296) (mod (* 2 |ULTIMATE.start_main_~d~0#1|) 4294967296))} is VALID [2022-02-20 17:31:29,198 INFO L290 TraceCheckUtils]: 28: Hoare triple {1691#true} assume true; {1691#true} is VALID [2022-02-20 17:31:29,198 INFO L290 TraceCheckUtils]: 27: Hoare triple {1691#true} assume !(0 == ~cond); {1691#true} is VALID [2022-02-20 17:31:29,198 INFO L290 TraceCheckUtils]: 26: Hoare triple {1691#true} ~cond := #in~cond; {1691#true} is VALID [2022-02-20 17:31:29,198 INFO L272 TraceCheckUtils]: 25: Hoare triple {1896#(= (mod (* |ULTIMATE.start_main_~B~0#1| (* 2 |ULTIMATE.start_main_~p~0#1|)) 4294967296) (mod (* 2 |ULTIMATE.start_main_~d~0#1|) 4294967296))} call __VERIFIER_assert((if main_~r~0#1 % 4294967296 == main_~A~0#1 % 4294967296 then 1 else 0)); {1691#true} is VALID [2022-02-20 17:31:29,198 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {1691#true} {1896#(= (mod (* |ULTIMATE.start_main_~B~0#1| (* 2 |ULTIMATE.start_main_~p~0#1|)) 4294967296) (mod (* 2 |ULTIMATE.start_main_~d~0#1|) 4294967296))} #84#return; {1896#(= (mod (* |ULTIMATE.start_main_~B~0#1| (* 2 |ULTIMATE.start_main_~p~0#1|)) 4294967296) (mod (* 2 |ULTIMATE.start_main_~d~0#1|) 4294967296))} is VALID [2022-02-20 17:31:29,198 INFO L290 TraceCheckUtils]: 23: Hoare triple {1691#true} assume true; {1691#true} is VALID [2022-02-20 17:31:29,198 INFO L290 TraceCheckUtils]: 22: Hoare triple {1691#true} assume !(0 == ~cond); {1691#true} is VALID [2022-02-20 17:31:29,198 INFO L290 TraceCheckUtils]: 21: Hoare triple {1691#true} ~cond := #in~cond; {1691#true} is VALID [2022-02-20 17:31:29,199 INFO L272 TraceCheckUtils]: 20: Hoare triple {1896#(= (mod (* |ULTIMATE.start_main_~B~0#1| (* 2 |ULTIMATE.start_main_~p~0#1|)) 4294967296) (mod (* 2 |ULTIMATE.start_main_~d~0#1|) 4294967296))} call __VERIFIER_assert((if 0 == main_~q~0#1 % 4294967296 then 1 else 0)); {1691#true} is VALID [2022-02-20 17:31:29,199 INFO L290 TraceCheckUtils]: 19: Hoare triple {1896#(= (mod (* |ULTIMATE.start_main_~B~0#1| (* 2 |ULTIMATE.start_main_~p~0#1|)) 4294967296) (mod (* 2 |ULTIMATE.start_main_~d~0#1|) 4294967296))} assume !false; {1896#(= (mod (* |ULTIMATE.start_main_~B~0#1| (* 2 |ULTIMATE.start_main_~p~0#1|)) 4294967296) (mod (* 2 |ULTIMATE.start_main_~d~0#1|) 4294967296))} is VALID [2022-02-20 17:31:29,199 INFO L290 TraceCheckUtils]: 18: Hoare triple {1691#true} main_~r~0#1 := main_~A~0#1;main_~d~0#1 := main_~B~0#1;main_~p~0#1 := 1;main_~q~0#1 := 0; {1896#(= (mod (* |ULTIMATE.start_main_~B~0#1| (* 2 |ULTIMATE.start_main_~p~0#1|)) 4294967296) (mod (* 2 |ULTIMATE.start_main_~d~0#1|) 4294967296))} is VALID [2022-02-20 17:31:29,199 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {1691#true} {1691#true} #82#return; {1691#true} is VALID [2022-02-20 17:31:29,200 INFO L290 TraceCheckUtils]: 16: Hoare triple {1691#true} assume true; {1691#true} is VALID [2022-02-20 17:31:29,200 INFO L290 TraceCheckUtils]: 15: Hoare triple {1691#true} assume !(0 == ~cond); {1691#true} is VALID [2022-02-20 17:31:29,200 INFO L290 TraceCheckUtils]: 14: Hoare triple {1691#true} ~cond := #in~cond; {1691#true} is VALID [2022-02-20 17:31:29,200 INFO L272 TraceCheckUtils]: 13: Hoare triple {1691#true} call assume_abort_if_not((if main_~B~0#1 % 4294967296 >= 1 then 1 else 0)); {1691#true} is VALID [2022-02-20 17:31:29,200 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {1691#true} {1691#true} #80#return; {1691#true} is VALID [2022-02-20 17:31:29,200 INFO L290 TraceCheckUtils]: 11: Hoare triple {1691#true} assume true; {1691#true} is VALID [2022-02-20 17:31:29,200 INFO L290 TraceCheckUtils]: 10: Hoare triple {1691#true} assume !(0 == ~cond); {1691#true} is VALID [2022-02-20 17:31:29,200 INFO L290 TraceCheckUtils]: 9: Hoare triple {1691#true} ~cond := #in~cond; {1691#true} is VALID [2022-02-20 17:31:29,200 INFO L272 TraceCheckUtils]: 8: Hoare triple {1691#true} call assume_abort_if_not((if main_~B~0#1 % 4294967296 >= 0 && main_~B~0#1 % 4294967296 <= 1 then 1 else 0)); {1691#true} is VALID [2022-02-20 17:31:29,200 INFO L290 TraceCheckUtils]: 7: Hoare triple {1691#true} main_~B~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; {1691#true} is VALID [2022-02-20 17:31:29,200 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {1691#true} {1691#true} #78#return; {1691#true} is VALID [2022-02-20 17:31:29,200 INFO L290 TraceCheckUtils]: 5: Hoare triple {1691#true} assume true; {1691#true} is VALID [2022-02-20 17:31:29,200 INFO L290 TraceCheckUtils]: 4: Hoare triple {1691#true} assume !(0 == ~cond); {1691#true} is VALID [2022-02-20 17:31:29,200 INFO L290 TraceCheckUtils]: 3: Hoare triple {1691#true} ~cond := #in~cond; {1691#true} is VALID [2022-02-20 17:31:29,200 INFO L272 TraceCheckUtils]: 2: Hoare triple {1691#true} call assume_abort_if_not((if main_~A~0#1 % 4294967296 >= 0 && main_~A~0#1 % 4294967296 <= 1 then 1 else 0)); {1691#true} is VALID [2022-02-20 17:31:29,201 INFO L290 TraceCheckUtils]: 1: Hoare triple {1691#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_~r~0#1, main_~d~0#1, main_~p~0#1, main_~q~0#1;havoc main_~A~0#1;havoc main_~B~0#1;havoc main_~r~0#1;havoc main_~d~0#1;havoc main_~p~0#1;havoc main_~q~0#1;main_~A~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; {1691#true} is VALID [2022-02-20 17:31:29,201 INFO L290 TraceCheckUtils]: 0: Hoare triple {1691#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3); {1691#true} is VALID [2022-02-20 17:31:29,201 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2022-02-20 17:31:29,201 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 17:31:29,201 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1496749945] [2022-02-20 17:31:29,201 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-20 17:31:29,201 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [918059988] [2022-02-20 17:31:29,201 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [918059988] provided 1 perfect and 1 imperfect interpolant sequences [2022-02-20 17:31:29,201 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-02-20 17:31:29,202 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 8 [2022-02-20 17:31:29,202 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1592421745] [2022-02-20 17:31:29,202 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 17:31:29,202 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 3 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) Word has length 51 [2022-02-20 17:31:29,202 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 17:31:29,203 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 3 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2022-02-20 17:31:31,243 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 33 edges. 32 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-02-20 17:31:31,243 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-20 17:31:31,243 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 17:31:31,243 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-20 17:31:31,244 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2022-02-20 17:31:31,244 INFO L87 Difference]: Start difference. First operand 58 states and 74 transitions. Second operand has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 3 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2022-02-20 17:31:34,651 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-02-20 17:31:36,858 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-02-20 17:31:38,925 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.07s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-02-20 17:31:41,037 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-02-20 17:31:44,181 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-02-20 17:31:46,310 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-02-20 17:31:46,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:31:46,445 INFO L93 Difference]: Finished difference Result 70 states and 89 transitions. [2022-02-20 17:31:46,445 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 17:31:46,445 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 3 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) Word has length 51 [2022-02-20 17:31:46,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 17:31:46,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 3 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2022-02-20 17:31:46,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 54 transitions. [2022-02-20 17:31:46,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 3 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2022-02-20 17:31:46,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 54 transitions. [2022-02-20 17:31:46,449 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 54 transitions. [2022-02-20 17:31:48,513 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 54 edges. 53 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-02-20 17:31:48,515 INFO L225 Difference]: With dead ends: 70 [2022-02-20 17:31:48,515 INFO L226 Difference]: Without dead ends: 68 [2022-02-20 17:31:48,515 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 93 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2022-02-20 17:31:48,516 INFO L933 BasicCegarLoop]: 37 mSDtfsCounter, 8 mSDsluCounter, 116 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 2 mSolverCounterUnsat, 6 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 12.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 153 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 6 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 12.7s IncrementalHoareTripleChecker+Time [2022-02-20 17:31:48,516 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [12 Valid, 153 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 43 Invalid, 6 Unknown, 0 Unchecked, 12.7s Time] [2022-02-20 17:31:48,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2022-02-20 17:31:48,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 53. [2022-02-20 17:31:48,534 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 17:31:48,534 INFO L82 GeneralOperation]: Start isEquivalent. First operand 68 states. Second operand has 53 states, 32 states have (on average 1.1875) internal successors, (38), 34 states have internal predecessors, (38), 14 states have call successors, (14), 6 states have call predecessors, (14), 6 states have return successors, (13), 12 states have call predecessors, (13), 13 states have call successors, (13) [2022-02-20 17:31:48,534 INFO L74 IsIncluded]: Start isIncluded. First operand 68 states. Second operand has 53 states, 32 states have (on average 1.1875) internal successors, (38), 34 states have internal predecessors, (38), 14 states have call successors, (14), 6 states have call predecessors, (14), 6 states have return successors, (13), 12 states have call predecessors, (13), 13 states have call successors, (13) [2022-02-20 17:31:48,535 INFO L87 Difference]: Start difference. First operand 68 states. Second operand has 53 states, 32 states have (on average 1.1875) internal successors, (38), 34 states have internal predecessors, (38), 14 states have call successors, (14), 6 states have call predecessors, (14), 6 states have return successors, (13), 12 states have call predecessors, (13), 13 states have call successors, (13) [2022-02-20 17:31:48,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:31:48,538 INFO L93 Difference]: Finished difference Result 68 states and 87 transitions. [2022-02-20 17:31:48,538 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 87 transitions. [2022-02-20 17:31:48,538 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:31:48,538 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:31:48,539 INFO L74 IsIncluded]: Start isIncluded. First operand has 53 states, 32 states have (on average 1.1875) internal successors, (38), 34 states have internal predecessors, (38), 14 states have call successors, (14), 6 states have call predecessors, (14), 6 states have return successors, (13), 12 states have call predecessors, (13), 13 states have call successors, (13) Second operand 68 states. [2022-02-20 17:31:48,539 INFO L87 Difference]: Start difference. First operand has 53 states, 32 states have (on average 1.1875) internal successors, (38), 34 states have internal predecessors, (38), 14 states have call successors, (14), 6 states have call predecessors, (14), 6 states have return successors, (13), 12 states have call predecessors, (13), 13 states have call successors, (13) Second operand 68 states. [2022-02-20 17:31:48,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:31:48,542 INFO L93 Difference]: Finished difference Result 68 states and 87 transitions. [2022-02-20 17:31:48,542 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 87 transitions. [2022-02-20 17:31:48,543 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:31:48,543 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:31:48,543 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 17:31:48,543 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 17:31:48,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 32 states have (on average 1.1875) internal successors, (38), 34 states have internal predecessors, (38), 14 states have call successors, (14), 6 states have call predecessors, (14), 6 states have return successors, (13), 12 states have call predecessors, (13), 13 states have call successors, (13) [2022-02-20 17:31:48,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 65 transitions. [2022-02-20 17:31:48,545 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 65 transitions. Word has length 51 [2022-02-20 17:31:48,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 17:31:48,546 INFO L470 AbstractCegarLoop]: Abstraction has 53 states and 65 transitions. [2022-02-20 17:31:48,546 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 3 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2022-02-20 17:31:48,546 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 65 transitions. [2022-02-20 17:31:48,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2022-02-20 17:31:48,547 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:31:48,547 INFO L514 BasicCegarLoop]: trace histogram [6, 5, 5, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 17:31:48,555 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-02-20 17:31:48,755 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 17:31:48,756 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 17:31:48,756 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:31:48,756 INFO L85 PathProgramCache]: Analyzing trace with hash 957489548, now seen corresponding path program 1 times [2022-02-20 17:31:48,756 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 17:31:48,757 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [856861182] [2022-02-20 17:31:48,757 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:31:48,757 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 17:31:48,772 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-20 17:31:48,779 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [460092895] [2022-02-20 17:31:48,779 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:31:48,779 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 17:31:48,779 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 17:31:48,780 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-20 17:31:48,782 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-02-20 17:31:48,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:31:48,831 INFO L263 TraceCheckSpWp]: Trace formula consists of 122 conjuncts, 17 conjunts are in the unsatisfiable core [2022-02-20 17:31:48,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:31:48,858 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 17:31:51,251 INFO L290 TraceCheckUtils]: 0: Hoare triple {2313#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3); {2313#true} is VALID [2022-02-20 17:31:51,251 INFO L290 TraceCheckUtils]: 1: Hoare triple {2313#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_~r~0#1, main_~d~0#1, main_~p~0#1, main_~q~0#1;havoc main_~A~0#1;havoc main_~B~0#1;havoc main_~r~0#1;havoc main_~d~0#1;havoc main_~p~0#1;havoc main_~q~0#1;main_~A~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; {2313#true} is VALID [2022-02-20 17:31:51,251 INFO L272 TraceCheckUtils]: 2: Hoare triple {2313#true} call assume_abort_if_not((if main_~A~0#1 % 4294967296 >= 0 && main_~A~0#1 % 4294967296 <= 1 then 1 else 0)); {2313#true} is VALID [2022-02-20 17:31:51,251 INFO L290 TraceCheckUtils]: 3: Hoare triple {2313#true} ~cond := #in~cond; {2313#true} is VALID [2022-02-20 17:31:51,252 INFO L290 TraceCheckUtils]: 4: Hoare triple {2313#true} assume !(0 == ~cond); {2313#true} is VALID [2022-02-20 17:31:51,252 INFO L290 TraceCheckUtils]: 5: Hoare triple {2313#true} assume true; {2313#true} is VALID [2022-02-20 17:31:51,252 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {2313#true} {2313#true} #78#return; {2313#true} is VALID [2022-02-20 17:31:51,252 INFO L290 TraceCheckUtils]: 7: Hoare triple {2313#true} main_~B~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; {2313#true} is VALID [2022-02-20 17:31:51,252 INFO L272 TraceCheckUtils]: 8: Hoare triple {2313#true} call assume_abort_if_not((if main_~B~0#1 % 4294967296 >= 0 && main_~B~0#1 % 4294967296 <= 1 then 1 else 0)); {2313#true} is VALID [2022-02-20 17:31:51,258 INFO L290 TraceCheckUtils]: 9: Hoare triple {2313#true} ~cond := #in~cond; {2345#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-02-20 17:31:51,258 INFO L290 TraceCheckUtils]: 10: Hoare triple {2345#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {2349#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-02-20 17:31:51,259 INFO L290 TraceCheckUtils]: 11: Hoare triple {2349#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {2349#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-02-20 17:31:51,259 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {2349#(not (= |assume_abort_if_not_#in~cond| 0))} {2313#true} #80#return; {2356#(<= (mod |ULTIMATE.start_main_~B~0#1| 4294967296) 1)} is VALID [2022-02-20 17:31:51,259 INFO L272 TraceCheckUtils]: 13: Hoare triple {2356#(<= (mod |ULTIMATE.start_main_~B~0#1| 4294967296) 1)} call assume_abort_if_not((if main_~B~0#1 % 4294967296 >= 1 then 1 else 0)); {2313#true} is VALID [2022-02-20 17:31:51,259 INFO L290 TraceCheckUtils]: 14: Hoare triple {2313#true} ~cond := #in~cond; {2313#true} is VALID [2022-02-20 17:31:51,259 INFO L290 TraceCheckUtils]: 15: Hoare triple {2313#true} assume !(0 == ~cond); {2313#true} is VALID [2022-02-20 17:31:51,260 INFO L290 TraceCheckUtils]: 16: Hoare triple {2313#true} assume true; {2313#true} is VALID [2022-02-20 17:31:51,263 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {2313#true} {2356#(<= (mod |ULTIMATE.start_main_~B~0#1| 4294967296) 1)} #82#return; {2356#(<= (mod |ULTIMATE.start_main_~B~0#1| 4294967296) 1)} is VALID [2022-02-20 17:31:51,264 INFO L290 TraceCheckUtils]: 18: Hoare triple {2356#(<= (mod |ULTIMATE.start_main_~B~0#1| 4294967296) 1)} main_~r~0#1 := main_~A~0#1;main_~d~0#1 := main_~B~0#1;main_~p~0#1 := 1;main_~q~0#1 := 0; {2375#(and (<= (mod |ULTIMATE.start_main_~d~0#1| 4294967296) 1) (= |ULTIMATE.start_main_~q~0#1| 0) (= |ULTIMATE.start_main_~A~0#1| |ULTIMATE.start_main_~r~0#1|))} is VALID [2022-02-20 17:31:51,264 INFO L290 TraceCheckUtils]: 19: Hoare triple {2375#(and (<= (mod |ULTIMATE.start_main_~d~0#1| 4294967296) 1) (= |ULTIMATE.start_main_~q~0#1| 0) (= |ULTIMATE.start_main_~A~0#1| |ULTIMATE.start_main_~r~0#1|))} assume !false; {2375#(and (<= (mod |ULTIMATE.start_main_~d~0#1| 4294967296) 1) (= |ULTIMATE.start_main_~q~0#1| 0) (= |ULTIMATE.start_main_~A~0#1| |ULTIMATE.start_main_~r~0#1|))} is VALID [2022-02-20 17:31:51,265 INFO L272 TraceCheckUtils]: 20: Hoare triple {2375#(and (<= (mod |ULTIMATE.start_main_~d~0#1| 4294967296) 1) (= |ULTIMATE.start_main_~q~0#1| 0) (= |ULTIMATE.start_main_~A~0#1| |ULTIMATE.start_main_~r~0#1|))} call __VERIFIER_assert((if 0 == main_~q~0#1 % 4294967296 then 1 else 0)); {2313#true} is VALID [2022-02-20 17:31:51,265 INFO L290 TraceCheckUtils]: 21: Hoare triple {2313#true} ~cond := #in~cond; {2313#true} is VALID [2022-02-20 17:31:51,265 INFO L290 TraceCheckUtils]: 22: Hoare triple {2313#true} assume !(0 == ~cond); {2313#true} is VALID [2022-02-20 17:31:51,265 INFO L290 TraceCheckUtils]: 23: Hoare triple {2313#true} assume true; {2313#true} is VALID [2022-02-20 17:31:51,265 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {2313#true} {2375#(and (<= (mod |ULTIMATE.start_main_~d~0#1| 4294967296) 1) (= |ULTIMATE.start_main_~q~0#1| 0) (= |ULTIMATE.start_main_~A~0#1| |ULTIMATE.start_main_~r~0#1|))} #84#return; {2375#(and (<= (mod |ULTIMATE.start_main_~d~0#1| 4294967296) 1) (= |ULTIMATE.start_main_~q~0#1| 0) (= |ULTIMATE.start_main_~A~0#1| |ULTIMATE.start_main_~r~0#1|))} is VALID [2022-02-20 17:31:51,266 INFO L272 TraceCheckUtils]: 25: Hoare triple {2375#(and (<= (mod |ULTIMATE.start_main_~d~0#1| 4294967296) 1) (= |ULTIMATE.start_main_~q~0#1| 0) (= |ULTIMATE.start_main_~A~0#1| |ULTIMATE.start_main_~r~0#1|))} call __VERIFIER_assert((if main_~r~0#1 % 4294967296 == main_~A~0#1 % 4294967296 then 1 else 0)); {2313#true} is VALID [2022-02-20 17:31:51,266 INFO L290 TraceCheckUtils]: 26: Hoare triple {2313#true} ~cond := #in~cond; {2313#true} is VALID [2022-02-20 17:31:51,266 INFO L290 TraceCheckUtils]: 27: Hoare triple {2313#true} assume !(0 == ~cond); {2313#true} is VALID [2022-02-20 17:31:51,266 INFO L290 TraceCheckUtils]: 28: Hoare triple {2313#true} assume true; {2313#true} is VALID [2022-02-20 17:31:51,271 INFO L284 TraceCheckUtils]: 29: Hoare quadruple {2313#true} {2375#(and (<= (mod |ULTIMATE.start_main_~d~0#1| 4294967296) 1) (= |ULTIMATE.start_main_~q~0#1| 0) (= |ULTIMATE.start_main_~A~0#1| |ULTIMATE.start_main_~r~0#1|))} #86#return; {2375#(and (<= (mod |ULTIMATE.start_main_~d~0#1| 4294967296) 1) (= |ULTIMATE.start_main_~q~0#1| 0) (= |ULTIMATE.start_main_~A~0#1| |ULTIMATE.start_main_~r~0#1|))} is VALID [2022-02-20 17:31:51,271 INFO L272 TraceCheckUtils]: 30: Hoare triple {2375#(and (<= (mod |ULTIMATE.start_main_~d~0#1| 4294967296) 1) (= |ULTIMATE.start_main_~q~0#1| 0) (= |ULTIMATE.start_main_~A~0#1| |ULTIMATE.start_main_~r~0#1|))} call __VERIFIER_assert((if main_~d~0#1 % 4294967296 == main_~B~0#1 * main_~p~0#1 % 4294967296 then 1 else 0)); {2313#true} is VALID [2022-02-20 17:31:51,271 INFO L290 TraceCheckUtils]: 31: Hoare triple {2313#true} ~cond := #in~cond; {2313#true} is VALID [2022-02-20 17:31:51,271 INFO L290 TraceCheckUtils]: 32: Hoare triple {2313#true} assume !(0 == ~cond); {2313#true} is VALID [2022-02-20 17:31:51,271 INFO L290 TraceCheckUtils]: 33: Hoare triple {2313#true} assume true; {2313#true} is VALID [2022-02-20 17:31:51,272 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {2313#true} {2375#(and (<= (mod |ULTIMATE.start_main_~d~0#1| 4294967296) 1) (= |ULTIMATE.start_main_~q~0#1| 0) (= |ULTIMATE.start_main_~A~0#1| |ULTIMATE.start_main_~r~0#1|))} #88#return; {2375#(and (<= (mod |ULTIMATE.start_main_~d~0#1| 4294967296) 1) (= |ULTIMATE.start_main_~q~0#1| 0) (= |ULTIMATE.start_main_~A~0#1| |ULTIMATE.start_main_~r~0#1|))} is VALID [2022-02-20 17:31:51,273 INFO L290 TraceCheckUtils]: 35: Hoare triple {2375#(and (<= (mod |ULTIMATE.start_main_~d~0#1| 4294967296) 1) (= |ULTIMATE.start_main_~q~0#1| 0) (= |ULTIMATE.start_main_~A~0#1| |ULTIMATE.start_main_~r~0#1|))} assume !(main_~r~0#1 % 4294967296 >= main_~d~0#1 % 4294967296); {2427#(and (<= (mod |ULTIMATE.start_main_~d~0#1| 4294967296) 1) (= |ULTIMATE.start_main_~q~0#1| 0) (= |ULTIMATE.start_main_~A~0#1| |ULTIMATE.start_main_~r~0#1|) (not (<= (mod |ULTIMATE.start_main_~d~0#1| 4294967296) (mod |ULTIMATE.start_main_~r~0#1| 4294967296))))} is VALID [2022-02-20 17:31:51,273 INFO L290 TraceCheckUtils]: 36: Hoare triple {2427#(and (<= (mod |ULTIMATE.start_main_~d~0#1| 4294967296) 1) (= |ULTIMATE.start_main_~q~0#1| 0) (= |ULTIMATE.start_main_~A~0#1| |ULTIMATE.start_main_~r~0#1|) (not (<= (mod |ULTIMATE.start_main_~d~0#1| 4294967296) (mod |ULTIMATE.start_main_~r~0#1| 4294967296))))} assume !false; {2427#(and (<= (mod |ULTIMATE.start_main_~d~0#1| 4294967296) 1) (= |ULTIMATE.start_main_~q~0#1| 0) (= |ULTIMATE.start_main_~A~0#1| |ULTIMATE.start_main_~r~0#1|) (not (<= (mod |ULTIMATE.start_main_~d~0#1| 4294967296) (mod |ULTIMATE.start_main_~r~0#1| 4294967296))))} is VALID [2022-02-20 17:31:51,273 INFO L272 TraceCheckUtils]: 37: Hoare triple {2427#(and (<= (mod |ULTIMATE.start_main_~d~0#1| 4294967296) 1) (= |ULTIMATE.start_main_~q~0#1| 0) (= |ULTIMATE.start_main_~A~0#1| |ULTIMATE.start_main_~r~0#1|) (not (<= (mod |ULTIMATE.start_main_~d~0#1| 4294967296) (mod |ULTIMATE.start_main_~r~0#1| 4294967296))))} call __VERIFIER_assert((if main_~A~0#1 % 4294967296 == (main_~q~0#1 * main_~B~0#1 + main_~r~0#1) % 4294967296 then 1 else 0)); {2313#true} is VALID [2022-02-20 17:31:51,274 INFO L290 TraceCheckUtils]: 38: Hoare triple {2313#true} ~cond := #in~cond; {2313#true} is VALID [2022-02-20 17:31:51,274 INFO L290 TraceCheckUtils]: 39: Hoare triple {2313#true} assume !(0 == ~cond); {2313#true} is VALID [2022-02-20 17:31:51,274 INFO L290 TraceCheckUtils]: 40: Hoare triple {2313#true} assume true; {2313#true} is VALID [2022-02-20 17:31:51,275 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {2313#true} {2427#(and (<= (mod |ULTIMATE.start_main_~d~0#1| 4294967296) 1) (= |ULTIMATE.start_main_~q~0#1| 0) (= |ULTIMATE.start_main_~A~0#1| |ULTIMATE.start_main_~r~0#1|) (not (<= (mod |ULTIMATE.start_main_~d~0#1| 4294967296) (mod |ULTIMATE.start_main_~r~0#1| 4294967296))))} #90#return; {2427#(and (<= (mod |ULTIMATE.start_main_~d~0#1| 4294967296) 1) (= |ULTIMATE.start_main_~q~0#1| 0) (= |ULTIMATE.start_main_~A~0#1| |ULTIMATE.start_main_~r~0#1|) (not (<= (mod |ULTIMATE.start_main_~d~0#1| 4294967296) (mod |ULTIMATE.start_main_~r~0#1| 4294967296))))} is VALID [2022-02-20 17:31:51,275 INFO L272 TraceCheckUtils]: 42: Hoare triple {2427#(and (<= (mod |ULTIMATE.start_main_~d~0#1| 4294967296) 1) (= |ULTIMATE.start_main_~q~0#1| 0) (= |ULTIMATE.start_main_~A~0#1| |ULTIMATE.start_main_~r~0#1|) (not (<= (mod |ULTIMATE.start_main_~d~0#1| 4294967296) (mod |ULTIMATE.start_main_~r~0#1| 4294967296))))} call __VERIFIER_assert((if main_~d~0#1 % 4294967296 == main_~B~0#1 * main_~p~0#1 % 4294967296 then 1 else 0)); {2313#true} is VALID [2022-02-20 17:31:51,275 INFO L290 TraceCheckUtils]: 43: Hoare triple {2313#true} ~cond := #in~cond; {2313#true} is VALID [2022-02-20 17:31:51,275 INFO L290 TraceCheckUtils]: 44: Hoare triple {2313#true} assume !(0 == ~cond); {2313#true} is VALID [2022-02-20 17:31:51,275 INFO L290 TraceCheckUtils]: 45: Hoare triple {2313#true} assume true; {2313#true} is VALID [2022-02-20 17:31:51,276 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {2313#true} {2427#(and (<= (mod |ULTIMATE.start_main_~d~0#1| 4294967296) 1) (= |ULTIMATE.start_main_~q~0#1| 0) (= |ULTIMATE.start_main_~A~0#1| |ULTIMATE.start_main_~r~0#1|) (not (<= (mod |ULTIMATE.start_main_~d~0#1| 4294967296) (mod |ULTIMATE.start_main_~r~0#1| 4294967296))))} #92#return; {2427#(and (<= (mod |ULTIMATE.start_main_~d~0#1| 4294967296) 1) (= |ULTIMATE.start_main_~q~0#1| 0) (= |ULTIMATE.start_main_~A~0#1| |ULTIMATE.start_main_~r~0#1|) (not (<= (mod |ULTIMATE.start_main_~d~0#1| 4294967296) (mod |ULTIMATE.start_main_~r~0#1| 4294967296))))} is VALID [2022-02-20 17:31:51,277 INFO L290 TraceCheckUtils]: 47: Hoare triple {2427#(and (<= (mod |ULTIMATE.start_main_~d~0#1| 4294967296) 1) (= |ULTIMATE.start_main_~q~0#1| 0) (= |ULTIMATE.start_main_~A~0#1| |ULTIMATE.start_main_~r~0#1|) (not (<= (mod |ULTIMATE.start_main_~d~0#1| 4294967296) (mod |ULTIMATE.start_main_~r~0#1| 4294967296))))} assume !(1 != main_~p~0#1 % 4294967296); {2427#(and (<= (mod |ULTIMATE.start_main_~d~0#1| 4294967296) 1) (= |ULTIMATE.start_main_~q~0#1| 0) (= |ULTIMATE.start_main_~A~0#1| |ULTIMATE.start_main_~r~0#1|) (not (<= (mod |ULTIMATE.start_main_~d~0#1| 4294967296) (mod |ULTIMATE.start_main_~r~0#1| 4294967296))))} is VALID [2022-02-20 17:31:51,277 INFO L272 TraceCheckUtils]: 48: Hoare triple {2427#(and (<= (mod |ULTIMATE.start_main_~d~0#1| 4294967296) 1) (= |ULTIMATE.start_main_~q~0#1| 0) (= |ULTIMATE.start_main_~A~0#1| |ULTIMATE.start_main_~r~0#1|) (not (<= (mod |ULTIMATE.start_main_~d~0#1| 4294967296) (mod |ULTIMATE.start_main_~r~0#1| 4294967296))))} call __VERIFIER_assert((if main_~A~0#1 % 4294967296 == (main_~d~0#1 * main_~q~0#1 + main_~r~0#1) % 4294967296 then 1 else 0)); {2467#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-02-20 17:31:51,278 INFO L290 TraceCheckUtils]: 49: Hoare triple {2467#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {2471#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-02-20 17:31:51,278 INFO L290 TraceCheckUtils]: 50: Hoare triple {2471#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2314#false} is VALID [2022-02-20 17:31:51,278 INFO L290 TraceCheckUtils]: 51: Hoare triple {2314#false} assume !false; {2314#false} is VALID [2022-02-20 17:31:51,279 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 13 proven. 3 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2022-02-20 17:31:51,279 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 17:31:52,377 INFO L290 TraceCheckUtils]: 51: Hoare triple {2314#false} assume !false; {2314#false} is VALID [2022-02-20 17:31:52,377 INFO L290 TraceCheckUtils]: 50: Hoare triple {2471#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2314#false} is VALID [2022-02-20 17:31:52,378 INFO L290 TraceCheckUtils]: 49: Hoare triple {2467#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {2471#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-02-20 17:31:52,378 INFO L272 TraceCheckUtils]: 48: Hoare triple {2487#(= (mod |ULTIMATE.start_main_~A~0#1| 4294967296) (mod (+ (* |ULTIMATE.start_main_~d~0#1| |ULTIMATE.start_main_~q~0#1|) |ULTIMATE.start_main_~r~0#1|) 4294967296))} call __VERIFIER_assert((if main_~A~0#1 % 4294967296 == (main_~d~0#1 * main_~q~0#1 + main_~r~0#1) % 4294967296 then 1 else 0)); {2467#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-02-20 17:31:52,379 INFO L290 TraceCheckUtils]: 47: Hoare triple {2487#(= (mod |ULTIMATE.start_main_~A~0#1| 4294967296) (mod (+ (* |ULTIMATE.start_main_~d~0#1| |ULTIMATE.start_main_~q~0#1|) |ULTIMATE.start_main_~r~0#1|) 4294967296))} assume !(1 != main_~p~0#1 % 4294967296); {2487#(= (mod |ULTIMATE.start_main_~A~0#1| 4294967296) (mod (+ (* |ULTIMATE.start_main_~d~0#1| |ULTIMATE.start_main_~q~0#1|) |ULTIMATE.start_main_~r~0#1|) 4294967296))} is VALID [2022-02-20 17:31:52,379 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {2313#true} {2487#(= (mod |ULTIMATE.start_main_~A~0#1| 4294967296) (mod (+ (* |ULTIMATE.start_main_~d~0#1| |ULTIMATE.start_main_~q~0#1|) |ULTIMATE.start_main_~r~0#1|) 4294967296))} #92#return; {2487#(= (mod |ULTIMATE.start_main_~A~0#1| 4294967296) (mod (+ (* |ULTIMATE.start_main_~d~0#1| |ULTIMATE.start_main_~q~0#1|) |ULTIMATE.start_main_~r~0#1|) 4294967296))} is VALID [2022-02-20 17:31:52,379 INFO L290 TraceCheckUtils]: 45: Hoare triple {2313#true} assume true; {2313#true} is VALID [2022-02-20 17:31:52,380 INFO L290 TraceCheckUtils]: 44: Hoare triple {2313#true} assume !(0 == ~cond); {2313#true} is VALID [2022-02-20 17:31:52,380 INFO L290 TraceCheckUtils]: 43: Hoare triple {2313#true} ~cond := #in~cond; {2313#true} is VALID [2022-02-20 17:31:52,380 INFO L272 TraceCheckUtils]: 42: Hoare triple {2487#(= (mod |ULTIMATE.start_main_~A~0#1| 4294967296) (mod (+ (* |ULTIMATE.start_main_~d~0#1| |ULTIMATE.start_main_~q~0#1|) |ULTIMATE.start_main_~r~0#1|) 4294967296))} call __VERIFIER_assert((if main_~d~0#1 % 4294967296 == main_~B~0#1 * main_~p~0#1 % 4294967296 then 1 else 0)); {2313#true} is VALID [2022-02-20 17:31:52,380 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {2313#true} {2487#(= (mod |ULTIMATE.start_main_~A~0#1| 4294967296) (mod (+ (* |ULTIMATE.start_main_~d~0#1| |ULTIMATE.start_main_~q~0#1|) |ULTIMATE.start_main_~r~0#1|) 4294967296))} #90#return; {2487#(= (mod |ULTIMATE.start_main_~A~0#1| 4294967296) (mod (+ (* |ULTIMATE.start_main_~d~0#1| |ULTIMATE.start_main_~q~0#1|) |ULTIMATE.start_main_~r~0#1|) 4294967296))} is VALID [2022-02-20 17:31:52,380 INFO L290 TraceCheckUtils]: 40: Hoare triple {2313#true} assume true; {2313#true} is VALID [2022-02-20 17:31:52,380 INFO L290 TraceCheckUtils]: 39: Hoare triple {2313#true} assume !(0 == ~cond); {2313#true} is VALID [2022-02-20 17:31:52,381 INFO L290 TraceCheckUtils]: 38: Hoare triple {2313#true} ~cond := #in~cond; {2313#true} is VALID [2022-02-20 17:31:52,381 INFO L272 TraceCheckUtils]: 37: Hoare triple {2487#(= (mod |ULTIMATE.start_main_~A~0#1| 4294967296) (mod (+ (* |ULTIMATE.start_main_~d~0#1| |ULTIMATE.start_main_~q~0#1|) |ULTIMATE.start_main_~r~0#1|) 4294967296))} call __VERIFIER_assert((if main_~A~0#1 % 4294967296 == (main_~q~0#1 * main_~B~0#1 + main_~r~0#1) % 4294967296 then 1 else 0)); {2313#true} is VALID [2022-02-20 17:31:52,381 INFO L290 TraceCheckUtils]: 36: Hoare triple {2487#(= (mod |ULTIMATE.start_main_~A~0#1| 4294967296) (mod (+ (* |ULTIMATE.start_main_~d~0#1| |ULTIMATE.start_main_~q~0#1|) |ULTIMATE.start_main_~r~0#1|) 4294967296))} assume !false; {2487#(= (mod |ULTIMATE.start_main_~A~0#1| 4294967296) (mod (+ (* |ULTIMATE.start_main_~d~0#1| |ULTIMATE.start_main_~q~0#1|) |ULTIMATE.start_main_~r~0#1|) 4294967296))} is VALID [2022-02-20 17:31:52,382 INFO L290 TraceCheckUtils]: 35: Hoare triple {2527#(or (= (mod |ULTIMATE.start_main_~A~0#1| 4294967296) (mod (+ (* |ULTIMATE.start_main_~d~0#1| |ULTIMATE.start_main_~q~0#1|) |ULTIMATE.start_main_~r~0#1|) 4294967296)) (<= (mod |ULTIMATE.start_main_~d~0#1| 4294967296) (mod |ULTIMATE.start_main_~r~0#1| 4294967296)))} assume !(main_~r~0#1 % 4294967296 >= main_~d~0#1 % 4294967296); {2487#(= (mod |ULTIMATE.start_main_~A~0#1| 4294967296) (mod (+ (* |ULTIMATE.start_main_~d~0#1| |ULTIMATE.start_main_~q~0#1|) |ULTIMATE.start_main_~r~0#1|) 4294967296))} is VALID [2022-02-20 17:31:52,383 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {2313#true} {2527#(or (= (mod |ULTIMATE.start_main_~A~0#1| 4294967296) (mod (+ (* |ULTIMATE.start_main_~d~0#1| |ULTIMATE.start_main_~q~0#1|) |ULTIMATE.start_main_~r~0#1|) 4294967296)) (<= (mod |ULTIMATE.start_main_~d~0#1| 4294967296) (mod |ULTIMATE.start_main_~r~0#1| 4294967296)))} #88#return; {2527#(or (= (mod |ULTIMATE.start_main_~A~0#1| 4294967296) (mod (+ (* |ULTIMATE.start_main_~d~0#1| |ULTIMATE.start_main_~q~0#1|) |ULTIMATE.start_main_~r~0#1|) 4294967296)) (<= (mod |ULTIMATE.start_main_~d~0#1| 4294967296) (mod |ULTIMATE.start_main_~r~0#1| 4294967296)))} is VALID [2022-02-20 17:31:52,383 INFO L290 TraceCheckUtils]: 33: Hoare triple {2313#true} assume true; {2313#true} is VALID [2022-02-20 17:31:52,383 INFO L290 TraceCheckUtils]: 32: Hoare triple {2313#true} assume !(0 == ~cond); {2313#true} is VALID [2022-02-20 17:31:52,383 INFO L290 TraceCheckUtils]: 31: Hoare triple {2313#true} ~cond := #in~cond; {2313#true} is VALID [2022-02-20 17:31:52,383 INFO L272 TraceCheckUtils]: 30: Hoare triple {2527#(or (= (mod |ULTIMATE.start_main_~A~0#1| 4294967296) (mod (+ (* |ULTIMATE.start_main_~d~0#1| |ULTIMATE.start_main_~q~0#1|) |ULTIMATE.start_main_~r~0#1|) 4294967296)) (<= (mod |ULTIMATE.start_main_~d~0#1| 4294967296) (mod |ULTIMATE.start_main_~r~0#1| 4294967296)))} call __VERIFIER_assert((if main_~d~0#1 % 4294967296 == main_~B~0#1 * main_~p~0#1 % 4294967296 then 1 else 0)); {2313#true} is VALID [2022-02-20 17:31:52,384 INFO L284 TraceCheckUtils]: 29: Hoare quadruple {2313#true} {2527#(or (= (mod |ULTIMATE.start_main_~A~0#1| 4294967296) (mod (+ (* |ULTIMATE.start_main_~d~0#1| |ULTIMATE.start_main_~q~0#1|) |ULTIMATE.start_main_~r~0#1|) 4294967296)) (<= (mod |ULTIMATE.start_main_~d~0#1| 4294967296) (mod |ULTIMATE.start_main_~r~0#1| 4294967296)))} #86#return; {2527#(or (= (mod |ULTIMATE.start_main_~A~0#1| 4294967296) (mod (+ (* |ULTIMATE.start_main_~d~0#1| |ULTIMATE.start_main_~q~0#1|) |ULTIMATE.start_main_~r~0#1|) 4294967296)) (<= (mod |ULTIMATE.start_main_~d~0#1| 4294967296) (mod |ULTIMATE.start_main_~r~0#1| 4294967296)))} is VALID [2022-02-20 17:31:52,384 INFO L290 TraceCheckUtils]: 28: Hoare triple {2313#true} assume true; {2313#true} is VALID [2022-02-20 17:31:52,384 INFO L290 TraceCheckUtils]: 27: Hoare triple {2313#true} assume !(0 == ~cond); {2313#true} is VALID [2022-02-20 17:31:52,384 INFO L290 TraceCheckUtils]: 26: Hoare triple {2313#true} ~cond := #in~cond; {2313#true} is VALID [2022-02-20 17:31:52,384 INFO L272 TraceCheckUtils]: 25: Hoare triple {2527#(or (= (mod |ULTIMATE.start_main_~A~0#1| 4294967296) (mod (+ (* |ULTIMATE.start_main_~d~0#1| |ULTIMATE.start_main_~q~0#1|) |ULTIMATE.start_main_~r~0#1|) 4294967296)) (<= (mod |ULTIMATE.start_main_~d~0#1| 4294967296) (mod |ULTIMATE.start_main_~r~0#1| 4294967296)))} call __VERIFIER_assert((if main_~r~0#1 % 4294967296 == main_~A~0#1 % 4294967296 then 1 else 0)); {2313#true} is VALID [2022-02-20 17:31:52,385 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {2313#true} {2527#(or (= (mod |ULTIMATE.start_main_~A~0#1| 4294967296) (mod (+ (* |ULTIMATE.start_main_~d~0#1| |ULTIMATE.start_main_~q~0#1|) |ULTIMATE.start_main_~r~0#1|) 4294967296)) (<= (mod |ULTIMATE.start_main_~d~0#1| 4294967296) (mod |ULTIMATE.start_main_~r~0#1| 4294967296)))} #84#return; {2527#(or (= (mod |ULTIMATE.start_main_~A~0#1| 4294967296) (mod (+ (* |ULTIMATE.start_main_~d~0#1| |ULTIMATE.start_main_~q~0#1|) |ULTIMATE.start_main_~r~0#1|) 4294967296)) (<= (mod |ULTIMATE.start_main_~d~0#1| 4294967296) (mod |ULTIMATE.start_main_~r~0#1| 4294967296)))} is VALID [2022-02-20 17:31:52,385 INFO L290 TraceCheckUtils]: 23: Hoare triple {2313#true} assume true; {2313#true} is VALID [2022-02-20 17:31:52,385 INFO L290 TraceCheckUtils]: 22: Hoare triple {2313#true} assume !(0 == ~cond); {2313#true} is VALID [2022-02-20 17:31:52,385 INFO L290 TraceCheckUtils]: 21: Hoare triple {2313#true} ~cond := #in~cond; {2313#true} is VALID [2022-02-20 17:31:52,385 INFO L272 TraceCheckUtils]: 20: Hoare triple {2527#(or (= (mod |ULTIMATE.start_main_~A~0#1| 4294967296) (mod (+ (* |ULTIMATE.start_main_~d~0#1| |ULTIMATE.start_main_~q~0#1|) |ULTIMATE.start_main_~r~0#1|) 4294967296)) (<= (mod |ULTIMATE.start_main_~d~0#1| 4294967296) (mod |ULTIMATE.start_main_~r~0#1| 4294967296)))} call __VERIFIER_assert((if 0 == main_~q~0#1 % 4294967296 then 1 else 0)); {2313#true} is VALID [2022-02-20 17:31:52,385 INFO L290 TraceCheckUtils]: 19: Hoare triple {2527#(or (= (mod |ULTIMATE.start_main_~A~0#1| 4294967296) (mod (+ (* |ULTIMATE.start_main_~d~0#1| |ULTIMATE.start_main_~q~0#1|) |ULTIMATE.start_main_~r~0#1|) 4294967296)) (<= (mod |ULTIMATE.start_main_~d~0#1| 4294967296) (mod |ULTIMATE.start_main_~r~0#1| 4294967296)))} assume !false; {2527#(or (= (mod |ULTIMATE.start_main_~A~0#1| 4294967296) (mod (+ (* |ULTIMATE.start_main_~d~0#1| |ULTIMATE.start_main_~q~0#1|) |ULTIMATE.start_main_~r~0#1|) 4294967296)) (<= (mod |ULTIMATE.start_main_~d~0#1| 4294967296) (mod |ULTIMATE.start_main_~r~0#1| 4294967296)))} is VALID [2022-02-20 17:31:52,386 INFO L290 TraceCheckUtils]: 18: Hoare triple {2313#true} main_~r~0#1 := main_~A~0#1;main_~d~0#1 := main_~B~0#1;main_~p~0#1 := 1;main_~q~0#1 := 0; {2527#(or (= (mod |ULTIMATE.start_main_~A~0#1| 4294967296) (mod (+ (* |ULTIMATE.start_main_~d~0#1| |ULTIMATE.start_main_~q~0#1|) |ULTIMATE.start_main_~r~0#1|) 4294967296)) (<= (mod |ULTIMATE.start_main_~d~0#1| 4294967296) (mod |ULTIMATE.start_main_~r~0#1| 4294967296)))} is VALID [2022-02-20 17:31:52,386 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {2313#true} {2313#true} #82#return; {2313#true} is VALID [2022-02-20 17:31:52,386 INFO L290 TraceCheckUtils]: 16: Hoare triple {2313#true} assume true; {2313#true} is VALID [2022-02-20 17:31:52,386 INFO L290 TraceCheckUtils]: 15: Hoare triple {2313#true} assume !(0 == ~cond); {2313#true} is VALID [2022-02-20 17:31:52,386 INFO L290 TraceCheckUtils]: 14: Hoare triple {2313#true} ~cond := #in~cond; {2313#true} is VALID [2022-02-20 17:31:52,386 INFO L272 TraceCheckUtils]: 13: Hoare triple {2313#true} call assume_abort_if_not((if main_~B~0#1 % 4294967296 >= 1 then 1 else 0)); {2313#true} is VALID [2022-02-20 17:31:52,386 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {2313#true} {2313#true} #80#return; {2313#true} is VALID [2022-02-20 17:31:52,386 INFO L290 TraceCheckUtils]: 11: Hoare triple {2313#true} assume true; {2313#true} is VALID [2022-02-20 17:31:52,386 INFO L290 TraceCheckUtils]: 10: Hoare triple {2313#true} assume !(0 == ~cond); {2313#true} is VALID [2022-02-20 17:31:52,386 INFO L290 TraceCheckUtils]: 9: Hoare triple {2313#true} ~cond := #in~cond; {2313#true} is VALID [2022-02-20 17:31:52,386 INFO L272 TraceCheckUtils]: 8: Hoare triple {2313#true} call assume_abort_if_not((if main_~B~0#1 % 4294967296 >= 0 && main_~B~0#1 % 4294967296 <= 1 then 1 else 0)); {2313#true} is VALID [2022-02-20 17:31:52,386 INFO L290 TraceCheckUtils]: 7: Hoare triple {2313#true} main_~B~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; {2313#true} is VALID [2022-02-20 17:31:52,387 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {2313#true} {2313#true} #78#return; {2313#true} is VALID [2022-02-20 17:31:52,387 INFO L290 TraceCheckUtils]: 5: Hoare triple {2313#true} assume true; {2313#true} is VALID [2022-02-20 17:31:52,387 INFO L290 TraceCheckUtils]: 4: Hoare triple {2313#true} assume !(0 == ~cond); {2313#true} is VALID [2022-02-20 17:31:52,387 INFO L290 TraceCheckUtils]: 3: Hoare triple {2313#true} ~cond := #in~cond; {2313#true} is VALID [2022-02-20 17:31:52,387 INFO L272 TraceCheckUtils]: 2: Hoare triple {2313#true} call assume_abort_if_not((if main_~A~0#1 % 4294967296 >= 0 && main_~A~0#1 % 4294967296 <= 1 then 1 else 0)); {2313#true} is VALID [2022-02-20 17:31:52,387 INFO L290 TraceCheckUtils]: 1: Hoare triple {2313#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_~r~0#1, main_~d~0#1, main_~p~0#1, main_~q~0#1;havoc main_~A~0#1;havoc main_~B~0#1;havoc main_~r~0#1;havoc main_~d~0#1;havoc main_~p~0#1;havoc main_~q~0#1;main_~A~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; {2313#true} is VALID [2022-02-20 17:31:52,387 INFO L290 TraceCheckUtils]: 0: Hoare triple {2313#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3); {2313#true} is VALID [2022-02-20 17:31:52,387 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2022-02-20 17:31:52,387 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 17:31:52,387 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [856861182] [2022-02-20 17:31:52,387 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-20 17:31:52,387 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [460092895] [2022-02-20 17:31:52,397 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [460092895] provided 1 perfect and 1 imperfect interpolant sequences [2022-02-20 17:31:52,397 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-02-20 17:31:52,397 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [9] total 11 [2022-02-20 17:31:52,397 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2011842582] [2022-02-20 17:31:52,397 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 17:31:52,398 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 5 states have internal predecessors, (17), 3 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) Word has length 52 [2022-02-20 17:31:52,398 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 17:31:52,398 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 5 states have internal predecessors, (17), 3 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2022-02-20 17:31:52,431 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 34 edges. 34 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:31:52,431 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-20 17:31:52,431 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 17:31:52,431 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-20 17:31:52,432 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2022-02-20 17:31:52,432 INFO L87 Difference]: Start difference. First operand 53 states and 65 transitions. Second operand has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 5 states have internal predecessors, (17), 3 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2022-02-20 17:31:56,457 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-02-20 17:31:58,986 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-02-20 17:31:59,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:31:59,310 INFO L93 Difference]: Finished difference Result 70 states and 89 transitions. [2022-02-20 17:31:59,310 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 17:31:59,310 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 5 states have internal predecessors, (17), 3 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) Word has length 52 [2022-02-20 17:31:59,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 17:31:59,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 5 states have internal predecessors, (17), 3 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2022-02-20 17:31:59,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 63 transitions. [2022-02-20 17:31:59,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 5 states have internal predecessors, (17), 3 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2022-02-20 17:31:59,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 63 transitions. [2022-02-20 17:31:59,314 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 63 transitions. [2022-02-20 17:31:59,387 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 63 edges. 63 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:31:59,389 INFO L225 Difference]: With dead ends: 70 [2022-02-20 17:31:59,389 INFO L226 Difference]: Without dead ends: 68 [2022-02-20 17:31:59,390 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 92 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2022-02-20 17:31:59,391 INFO L933 BasicCegarLoop]: 42 mSDtfsCounter, 9 mSDsluCounter, 137 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 3 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 179 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.6s IncrementalHoareTripleChecker+Time [2022-02-20 17:31:59,391 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [13 Valid, 179 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 40 Invalid, 2 Unknown, 0 Unchecked, 4.6s Time] [2022-02-20 17:31:59,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2022-02-20 17:31:59,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 67. [2022-02-20 17:31:59,421 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 17:31:59,421 INFO L82 GeneralOperation]: Start isEquivalent. First operand 68 states. Second operand has 67 states, 39 states have (on average 1.205128205128205) internal successors, (47), 42 states have internal predecessors, (47), 20 states have call successors, (20), 7 states have call predecessors, (20), 7 states have return successors, (19), 17 states have call predecessors, (19), 19 states have call successors, (19) [2022-02-20 17:31:59,421 INFO L74 IsIncluded]: Start isIncluded. First operand 68 states. Second operand has 67 states, 39 states have (on average 1.205128205128205) internal successors, (47), 42 states have internal predecessors, (47), 20 states have call successors, (20), 7 states have call predecessors, (20), 7 states have return successors, (19), 17 states have call predecessors, (19), 19 states have call successors, (19) [2022-02-20 17:31:59,422 INFO L87 Difference]: Start difference. First operand 68 states. Second operand has 67 states, 39 states have (on average 1.205128205128205) internal successors, (47), 42 states have internal predecessors, (47), 20 states have call successors, (20), 7 states have call predecessors, (20), 7 states have return successors, (19), 17 states have call predecessors, (19), 19 states have call successors, (19) [2022-02-20 17:31:59,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:31:59,425 INFO L93 Difference]: Finished difference Result 68 states and 87 transitions. [2022-02-20 17:31:59,425 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 87 transitions. [2022-02-20 17:31:59,425 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:31:59,425 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:31:59,426 INFO L74 IsIncluded]: Start isIncluded. First operand has 67 states, 39 states have (on average 1.205128205128205) internal successors, (47), 42 states have internal predecessors, (47), 20 states have call successors, (20), 7 states have call predecessors, (20), 7 states have return successors, (19), 17 states have call predecessors, (19), 19 states have call successors, (19) Second operand 68 states. [2022-02-20 17:31:59,426 INFO L87 Difference]: Start difference. First operand has 67 states, 39 states have (on average 1.205128205128205) internal successors, (47), 42 states have internal predecessors, (47), 20 states have call successors, (20), 7 states have call predecessors, (20), 7 states have return successors, (19), 17 states have call predecessors, (19), 19 states have call successors, (19) Second operand 68 states. [2022-02-20 17:31:59,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:31:59,429 INFO L93 Difference]: Finished difference Result 68 states and 87 transitions. [2022-02-20 17:31:59,429 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 87 transitions. [2022-02-20 17:31:59,430 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:31:59,430 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:31:59,430 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 17:31:59,430 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 17:31:59,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 39 states have (on average 1.205128205128205) internal successors, (47), 42 states have internal predecessors, (47), 20 states have call successors, (20), 7 states have call predecessors, (20), 7 states have return successors, (19), 17 states have call predecessors, (19), 19 states have call successors, (19) [2022-02-20 17:31:59,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 86 transitions. [2022-02-20 17:31:59,433 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 86 transitions. Word has length 52 [2022-02-20 17:31:59,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 17:31:59,433 INFO L470 AbstractCegarLoop]: Abstraction has 67 states and 86 transitions. [2022-02-20 17:31:59,434 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 5 states have internal predecessors, (17), 3 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2022-02-20 17:31:59,434 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 86 transitions. [2022-02-20 17:31:59,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2022-02-20 17:31:59,435 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:31:59,435 INFO L514 BasicCegarLoop]: trace histogram [6, 5, 5, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 17:31:59,460 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-02-20 17:31:59,655 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 17:31:59,655 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 17:31:59,656 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:31:59,656 INFO L85 PathProgramCache]: Analyzing trace with hash 1397226472, now seen corresponding path program 1 times [2022-02-20 17:31:59,656 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 17:31:59,656 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1174629834] [2022-02-20 17:31:59,656 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:31:59,656 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 17:31:59,669 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-20 17:31:59,669 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [908658512] [2022-02-20 17:31:59,669 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:31:59,669 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 17:31:59,670 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 17:31:59,671 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-20 17:31:59,708 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process