./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/nla-digbench-scaling/hard-u_unwindbound20.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_unwindbound20.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 28cfabe4b70eff8f7baaccb87c67f08c79dbf056ceeb2a0d56109f4b60f10f62 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 17:31:00,856 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 17:31:00,858 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 17:31:00,905 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 17:31:00,905 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 17:31:00,908 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 17:31:00,909 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 17:31:00,911 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 17:31:00,912 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 17:31:00,914 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 17:31:00,915 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 17:31:00,916 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 17:31:00,916 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 17:31:00,920 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 17:31:00,921 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 17:31:00,922 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 17:31:00,924 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 17:31:00,925 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 17:31:00,926 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 17:31:00,927 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 17:31:00,928 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 17:31:00,930 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 17:31:00,930 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 17:31:00,931 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 17:31:00,933 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 17:31:00,933 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 17:31:00,933 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 17:31:00,934 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 17:31:00,934 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 17:31:00,935 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 17:31:00,935 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 17:31:00,935 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 17:31:00,936 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 17:31:00,936 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 17:31:00,937 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 17:31:00,937 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 17:31:00,938 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 17:31:00,938 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 17:31:00,938 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 17:31:00,938 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 17:31:00,939 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 17:31:00,943 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:00,960 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 17:31:00,961 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 17:31:00,961 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 17:31:00,962 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 17:31:00,962 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 17:31:00,962 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 17:31:00,963 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 17:31:00,963 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 17:31:00,963 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 17:31:00,963 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 17:31:00,964 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 17:31:00,964 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 17:31:00,964 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 17:31:00,964 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 17:31:00,964 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 17:31:00,965 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 17:31:00,965 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 17:31:00,965 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 17:31:00,965 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 17:31:00,965 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 17:31:00,965 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 17:31:00,965 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 17:31:00,966 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 17:31:00,966 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 17:31:00,966 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 17:31:00,966 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 17:31:00,966 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 17:31:00,966 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 17:31:00,966 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-20 17:31:00,967 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-20 17:31:00,967 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 17:31:00,967 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 17:31:00,967 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 17:31:00,967 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 -> 28cfabe4b70eff8f7baaccb87c67f08c79dbf056ceeb2a0d56109f4b60f10f62 [2022-02-20 17:31:01,159 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 17:31:01,185 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 17:31:01,187 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 17:31:01,188 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 17:31:01,188 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 17:31:01,189 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/nla-digbench-scaling/hard-u_unwindbound20.c [2022-02-20 17:31:01,254 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7d48fcbf2/d38880064df547e2b879947c8524125a/FLAGbf973fdab [2022-02-20 17:31:01,616 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 17:31:01,622 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/hard-u_unwindbound20.c [2022-02-20 17:31:01,630 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7d48fcbf2/d38880064df547e2b879947c8524125a/FLAGbf973fdab [2022-02-20 17:31:01,640 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7d48fcbf2/d38880064df547e2b879947c8524125a [2022-02-20 17:31:01,642 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 17:31:01,645 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 17:31:01,646 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 17:31:01,646 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 17:31:01,648 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 17:31:01,649 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 05:31:01" (1/1) ... [2022-02-20 17:31:01,650 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6a0d879b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:31:01, skipping insertion in model container [2022-02-20 17:31:01,650 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 05:31:01" (1/1) ... [2022-02-20 17:31:01,655 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 17:31:01,665 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 17:31:01,783 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_unwindbound20.c[537,550] [2022-02-20 17:31:01,810 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 17:31:01,818 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 17:31:01,827 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_unwindbound20.c[537,550] [2022-02-20 17:31:01,841 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 17:31:01,851 INFO L208 MainTranslator]: Completed translation [2022-02-20 17:31:01,851 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:31:01 WrapperNode [2022-02-20 17:31:01,852 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 17:31:01,852 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 17:31:01,853 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 17:31:01,853 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 17:31:01,857 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:01" (1/1) ... [2022-02-20 17:31:01,866 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:01" (1/1) ... [2022-02-20 17:31:01,887 INFO L137 Inliner]: procedures = 14, calls = 15, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 65 [2022-02-20 17:31:01,887 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 17:31:01,888 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 17:31:01,888 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 17:31:01,888 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 17:31:01,893 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:01" (1/1) ... [2022-02-20 17:31:01,893 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:01" (1/1) ... [2022-02-20 17:31:01,895 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:01" (1/1) ... [2022-02-20 17:31:01,896 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:01" (1/1) ... [2022-02-20 17:31:01,903 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:01" (1/1) ... [2022-02-20 17:31:01,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:01" (1/1) ... [2022-02-20 17:31:01,910 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:01" (1/1) ... [2022-02-20 17:31:01,913 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 17:31:01,914 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 17:31:01,914 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 17:31:01,915 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 17:31:01,915 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:31:01" (1/1) ... [2022-02-20 17:31:01,920 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 17:31:01,926 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 17:31:01,964 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:01,998 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:02,025 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 17:31:02,025 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-20 17:31:02,025 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 17:31:02,026 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 17:31:02,026 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-02-20 17:31:02,026 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-02-20 17:31:02,068 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 17:31:02,069 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 17:31:02,197 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 17:31:02,215 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 17:31:02,216 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-02-20 17:31:02,217 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 05:31:02 BoogieIcfgContainer [2022-02-20 17:31:02,217 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 17:31:02,218 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 17:31:02,218 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 17:31:02,220 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 17:31:02,220 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 05:31:01" (1/3) ... [2022-02-20 17:31:02,221 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4e328213 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 05:31:02, skipping insertion in model container [2022-02-20 17:31:02,221 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:31:01" (2/3) ... [2022-02-20 17:31:02,221 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4e328213 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 05:31:02, skipping insertion in model container [2022-02-20 17:31:02,221 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 05:31:02" (3/3) ... [2022-02-20 17:31:02,222 INFO L111 eAbstractionObserver]: Analyzing ICFG hard-u_unwindbound20.c [2022-02-20 17:31:02,225 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 17:31:02,225 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-02-20 17:31:02,252 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 17:31:02,256 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:02,256 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-02-20 17:31:02,270 INFO L276 IsEmpty]: Start isEmpty. Operand has 28 states, 18 states have (on average 1.5555555555555556) internal successors, (28), 19 states have internal predecessors, (28), 7 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-02-20 17:31:02,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-02-20 17:31:02,273 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:31:02,273 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 17:31:02,274 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 17:31:02,277 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:31:02,277 INFO L85 PathProgramCache]: Analyzing trace with hash -712527539, now seen corresponding path program 1 times [2022-02-20 17:31:02,282 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 17:31:02,283 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1221930917] [2022-02-20 17:31:02,283 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:31:02,284 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 17:31:02,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:31:02,402 INFO L290 TraceCheckUtils]: 0: Hoare triple {31#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);~counter~0 := 0; {31#true} is VALID [2022-02-20 17:31:02,403 INFO L290 TraceCheckUtils]: 1: Hoare triple {31#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~post6#1, main_#t~post7#1, main_~A~0#1, main_~B~0#1, main_~r~0#1, main_~d~0#1, main_~p~0#1, main_~q~0#1;havoc main_~A~0#1;havoc main_~B~0#1;havoc main_~r~0#1;havoc main_~d~0#1;havoc main_~p~0#1;havoc main_~q~0#1;main_~A~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;main_~B~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := (if main_~B~0#1 % 4294967296 >= 1 then 1 else 0);havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {31#true} is VALID [2022-02-20 17:31:02,404 INFO L290 TraceCheckUtils]: 2: Hoare triple {31#true} assume 0 == assume_abort_if_not_~cond#1;assume false; {32#false} is VALID [2022-02-20 17:31:02,404 INFO L290 TraceCheckUtils]: 3: Hoare triple {32#false} assume { :end_inline_assume_abort_if_not } 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; {32#false} is VALID [2022-02-20 17:31:02,404 INFO L290 TraceCheckUtils]: 4: Hoare triple {32#false} assume !true; {32#false} is VALID [2022-02-20 17:31:02,405 INFO L290 TraceCheckUtils]: 5: Hoare triple {32#false} assume !true; {32#false} is VALID [2022-02-20 17:31:02,405 INFO L272 TraceCheckUtils]: 6: Hoare triple {32#false} 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)); {32#false} is VALID [2022-02-20 17:31:02,406 INFO L290 TraceCheckUtils]: 7: Hoare triple {32#false} ~cond := #in~cond; {32#false} is VALID [2022-02-20 17:31:02,406 INFO L290 TraceCheckUtils]: 8: Hoare triple {32#false} assume 0 == ~cond; {32#false} is VALID [2022-02-20 17:31:02,406 INFO L290 TraceCheckUtils]: 9: Hoare triple {32#false} assume !false; {32#false} is VALID [2022-02-20 17:31:02,407 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 17:31:02,407 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 17:31:02,408 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1221930917] [2022-02-20 17:31:02,408 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1221930917] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 17:31:02,409 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 17:31:02,409 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-20 17:31:02,410 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [690112649] [2022-02-20 17:31:02,411 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 17:31:02,415 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2022-02-20 17:31:02,416 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 17:31:02,418 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:31:02,440 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 10 edges. 10 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:31:02,440 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-02-20 17:31:02,440 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 17:31:02,453 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-02-20 17:31:02,453 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-02-20 17:31:02,455 INFO L87 Difference]: Start difference. First operand has 28 states, 18 states have (on average 1.5555555555555556) internal successors, (28), 19 states have internal predecessors, (28), 7 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:31:02,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:31:02,528 INFO L93 Difference]: Finished difference Result 53 states and 87 transitions. [2022-02-20 17:31:02,528 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-20 17:31:02,528 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2022-02-20 17:31:02,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 17:31:02,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:31:02,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 87 transitions. [2022-02-20 17:31:02,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:31:02,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 87 transitions. [2022-02-20 17:31:02,550 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 87 transitions. [2022-02-20 17:31:02,650 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 87 edges. 87 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:31:02,657 INFO L225 Difference]: With dead ends: 53 [2022-02-20 17:31:02,658 INFO L226 Difference]: Without dead ends: 24 [2022-02-20 17:31:02,660 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-02-20 17:31:02,664 INFO L933 BasicCegarLoop]: 38 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, 38 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:02,665 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 38 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:02,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2022-02-20 17:31:02,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2022-02-20 17:31:02,689 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 17:31:02,689 INFO L82 GeneralOperation]: Start isEquivalent. First operand 24 states. Second operand has 24 states, 15 states have (on average 1.4) internal successors, (21), 16 states have internal predecessors, (21), 7 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-02-20 17:31:02,690 INFO L74 IsIncluded]: Start isIncluded. First operand 24 states. Second operand has 24 states, 15 states have (on average 1.4) internal successors, (21), 16 states have internal predecessors, (21), 7 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-02-20 17:31:02,690 INFO L87 Difference]: Start difference. First operand 24 states. Second operand has 24 states, 15 states have (on average 1.4) internal successors, (21), 16 states have internal predecessors, (21), 7 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-02-20 17:31:02,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:31:02,695 INFO L93 Difference]: Finished difference Result 24 states and 34 transitions. [2022-02-20 17:31:02,695 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 34 transitions. [2022-02-20 17:31:02,696 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:31:02,696 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:31:02,697 INFO L74 IsIncluded]: Start isIncluded. First operand has 24 states, 15 states have (on average 1.4) internal successors, (21), 16 states have internal predecessors, (21), 7 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand 24 states. [2022-02-20 17:31:02,697 INFO L87 Difference]: Start difference. First operand has 24 states, 15 states have (on average 1.4) internal successors, (21), 16 states have internal predecessors, (21), 7 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand 24 states. [2022-02-20 17:31:02,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:31:02,700 INFO L93 Difference]: Finished difference Result 24 states and 34 transitions. [2022-02-20 17:31:02,701 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 34 transitions. [2022-02-20 17:31:02,702 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:31:02,702 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:31:02,702 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 17:31:02,702 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 17:31:02,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 15 states have (on average 1.4) internal successors, (21), 16 states have internal predecessors, (21), 7 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-02-20 17:31:02,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 34 transitions. [2022-02-20 17:31:02,706 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 34 transitions. Word has length 10 [2022-02-20 17:31:02,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 17:31:02,706 INFO L470 AbstractCegarLoop]: Abstraction has 24 states and 34 transitions. [2022-02-20 17:31:02,706 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:31:02,707 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 34 transitions. [2022-02-20 17:31:02,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-02-20 17:31:02,708 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:31:02,708 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 17:31:02,708 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-20 17:31:02,708 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 17:31:02,710 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:31:02,711 INFO L85 PathProgramCache]: Analyzing trace with hash -1983932575, now seen corresponding path program 1 times [2022-02-20 17:31:02,711 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 17:31:02,713 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [271623085] [2022-02-20 17:31:02,713 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:31:02,713 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 17:31:02,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:31:02,794 INFO L290 TraceCheckUtils]: 0: Hoare triple {189#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);~counter~0 := 0; {189#true} is VALID [2022-02-20 17:31:02,795 INFO L290 TraceCheckUtils]: 1: Hoare triple {189#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~post6#1, main_#t~post7#1, main_~A~0#1, main_~B~0#1, main_~r~0#1, main_~d~0#1, main_~p~0#1, main_~q~0#1;havoc main_~A~0#1;havoc main_~B~0#1;havoc main_~r~0#1;havoc main_~d~0#1;havoc main_~p~0#1;havoc main_~q~0#1;main_~A~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;main_~B~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := (if main_~B~0#1 % 4294967296 >= 1 then 1 else 0);havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {189#true} is VALID [2022-02-20 17:31:02,795 INFO L290 TraceCheckUtils]: 2: Hoare triple {189#true} assume !(0 == assume_abort_if_not_~cond#1); {189#true} is VALID [2022-02-20 17:31:02,795 INFO L290 TraceCheckUtils]: 3: Hoare triple {189#true} assume { :end_inline_assume_abort_if_not } 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; {191#(= |ULTIMATE.start_main_~q~0#1| 0)} is VALID [2022-02-20 17:31:02,796 INFO L290 TraceCheckUtils]: 4: Hoare triple {191#(= |ULTIMATE.start_main_~q~0#1| 0)} main_#t~post6#1 := ~counter~0;~counter~0 := 1 + main_#t~post6#1; {191#(= |ULTIMATE.start_main_~q~0#1| 0)} is VALID [2022-02-20 17:31:02,801 INFO L290 TraceCheckUtils]: 5: Hoare triple {191#(= |ULTIMATE.start_main_~q~0#1| 0)} assume !!(main_#t~post6#1 < 20);havoc main_#t~post6#1; {191#(= |ULTIMATE.start_main_~q~0#1| 0)} is VALID [2022-02-20 17:31:02,802 INFO L272 TraceCheckUtils]: 6: Hoare triple {191#(= |ULTIMATE.start_main_~q~0#1| 0)} call __VERIFIER_assert((if 0 == main_~q~0#1 % 4294967296 then 1 else 0)); {192#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-02-20 17:31:02,803 INFO L290 TraceCheckUtils]: 7: Hoare triple {192#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {193#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-02-20 17:31:02,804 INFO L290 TraceCheckUtils]: 8: Hoare triple {193#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {190#false} is VALID [2022-02-20 17:31:02,804 INFO L290 TraceCheckUtils]: 9: Hoare triple {190#false} assume !false; {190#false} is VALID [2022-02-20 17:31:02,804 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 17:31:02,805 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 17:31:02,805 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [271623085] [2022-02-20 17:31:02,805 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [271623085] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 17:31:02,805 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 17:31:02,805 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 17:31:02,806 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1698452766] [2022-02-20 17:31:02,806 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 17:31:02,807 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2022-02-20 17:31:02,807 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 17:31:02,808 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:31:02,830 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 10 edges. 10 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:31:02,830 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 17:31:02,830 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 17:31:02,831 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 17:31:02,832 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 17:31:02,832 INFO L87 Difference]: Start difference. First operand 24 states and 34 transitions. Second operand has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:31:02,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:31:02,953 INFO L93 Difference]: Finished difference Result 38 states and 53 transitions. [2022-02-20 17:31:02,953 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-20 17:31:02,953 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2022-02-20 17:31:02,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 17:31:02,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:31:02,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 53 transitions. [2022-02-20 17:31:02,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:31:02,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 53 transitions. [2022-02-20 17:31:02,957 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 53 transitions. [2022-02-20 17:31:02,997 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 53 edges. 53 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:31:02,998 INFO L225 Difference]: With dead ends: 38 [2022-02-20 17:31:02,998 INFO L226 Difference]: Without dead ends: 36 [2022-02-20 17:31:02,998 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-02-20 17:31:02,999 INFO L933 BasicCegarLoop]: 33 mSDtfsCounter, 15 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 112 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:03,000 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [21 Valid, 112 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:03,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2022-02-20 17:31:03,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 28. [2022-02-20 17:31:03,003 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 17:31:03,003 INFO L82 GeneralOperation]: Start isEquivalent. First operand 36 states. Second operand has 28 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 19 states have internal predecessors, (24), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-02-20 17:31:03,004 INFO L74 IsIncluded]: Start isIncluded. First operand 36 states. Second operand has 28 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 19 states have internal predecessors, (24), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-02-20 17:31:03,004 INFO L87 Difference]: Start difference. First operand 36 states. Second operand has 28 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 19 states have internal predecessors, (24), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-02-20 17:31:03,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:31:03,006 INFO L93 Difference]: Finished difference Result 36 states and 51 transitions. [2022-02-20 17:31:03,006 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 51 transitions. [2022-02-20 17:31:03,006 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:31:03,007 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:31:03,007 INFO L74 IsIncluded]: Start isIncluded. First operand has 28 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 19 states have internal predecessors, (24), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand 36 states. [2022-02-20 17:31:03,007 INFO L87 Difference]: Start difference. First operand has 28 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 19 states have internal predecessors, (24), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand 36 states. [2022-02-20 17:31:03,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:31:03,009 INFO L93 Difference]: Finished difference Result 36 states and 51 transitions. [2022-02-20 17:31:03,009 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 51 transitions. [2022-02-20 17:31:03,010 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:31:03,010 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:31:03,010 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 17:31:03,010 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 17:31:03,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 19 states have internal predecessors, (24), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-02-20 17:31:03,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 37 transitions. [2022-02-20 17:31:03,011 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 37 transitions. Word has length 10 [2022-02-20 17:31:03,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 17:31:03,012 INFO L470 AbstractCegarLoop]: Abstraction has 28 states and 37 transitions. [2022-02-20 17:31:03,012 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:31:03,012 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 37 transitions. [2022-02-20 17:31:03,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-02-20 17:31:03,012 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:31:03,013 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 17:31:03,013 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-02-20 17:31:03,013 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 17:31:03,013 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:31:03,013 INFO L85 PathProgramCache]: Analyzing trace with hash 1787143384, now seen corresponding path program 1 times [2022-02-20 17:31:03,014 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 17:31:03,014 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1379094650] [2022-02-20 17:31:03,014 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:31:03,014 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 17:31:03,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:31:03,037 INFO L290 TraceCheckUtils]: 0: Hoare triple {360#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);~counter~0 := 0; {362#(= ~counter~0 0)} is VALID [2022-02-20 17:31:03,038 INFO L290 TraceCheckUtils]: 1: Hoare triple {362#(= ~counter~0 0)} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~post6#1, main_#t~post7#1, main_~A~0#1, main_~B~0#1, main_~r~0#1, main_~d~0#1, main_~p~0#1, main_~q~0#1;havoc main_~A~0#1;havoc main_~B~0#1;havoc main_~r~0#1;havoc main_~d~0#1;havoc main_~p~0#1;havoc main_~q~0#1;main_~A~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;main_~B~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := (if main_~B~0#1 % 4294967296 >= 1 then 1 else 0);havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {362#(= ~counter~0 0)} is VALID [2022-02-20 17:31:03,038 INFO L290 TraceCheckUtils]: 2: Hoare triple {362#(= ~counter~0 0)} assume !(0 == assume_abort_if_not_~cond#1); {362#(= ~counter~0 0)} is VALID [2022-02-20 17:31:03,039 INFO L290 TraceCheckUtils]: 3: Hoare triple {362#(= ~counter~0 0)} assume { :end_inline_assume_abort_if_not } 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; {362#(= ~counter~0 0)} is VALID [2022-02-20 17:31:03,039 INFO L290 TraceCheckUtils]: 4: Hoare triple {362#(= ~counter~0 0)} main_#t~post6#1 := ~counter~0;~counter~0 := 1 + main_#t~post6#1; {363#(= |ULTIMATE.start_main_#t~post6#1| 0)} is VALID [2022-02-20 17:31:03,040 INFO L290 TraceCheckUtils]: 5: Hoare triple {363#(= |ULTIMATE.start_main_#t~post6#1| 0)} assume !(main_#t~post6#1 < 20);havoc main_#t~post6#1; {361#false} is VALID [2022-02-20 17:31:03,040 INFO L290 TraceCheckUtils]: 6: Hoare triple {361#false} main_#t~post7#1 := ~counter~0;~counter~0 := 1 + main_#t~post7#1; {361#false} is VALID [2022-02-20 17:31:03,040 INFO L290 TraceCheckUtils]: 7: Hoare triple {361#false} assume !(main_#t~post7#1 < 20);havoc main_#t~post7#1; {361#false} is VALID [2022-02-20 17:31:03,040 INFO L272 TraceCheckUtils]: 8: Hoare triple {361#false} 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)); {361#false} is VALID [2022-02-20 17:31:03,040 INFO L290 TraceCheckUtils]: 9: Hoare triple {361#false} ~cond := #in~cond; {361#false} is VALID [2022-02-20 17:31:03,041 INFO L290 TraceCheckUtils]: 10: Hoare triple {361#false} assume 0 == ~cond; {361#false} is VALID [2022-02-20 17:31:03,041 INFO L290 TraceCheckUtils]: 11: Hoare triple {361#false} assume !false; {361#false} is VALID [2022-02-20 17:31:03,041 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 17:31:03,041 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 17:31:03,041 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1379094650] [2022-02-20 17:31:03,042 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1379094650] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 17:31:03,042 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 17:31:03,042 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 17:31:03,042 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1481633377] [2022-02-20 17:31:03,042 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 17:31:03,042 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2022-02-20 17:31:03,043 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 17:31:03,043 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:31:03,051 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 12 edges. 12 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:31:03,051 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-20 17:31:03,051 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 17:31:03,052 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-20 17:31:03,052 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-20 17:31:03,052 INFO L87 Difference]: Start difference. First operand 28 states and 37 transitions. Second operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:31:03,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:31:03,112 INFO L93 Difference]: Finished difference Result 44 states and 59 transitions. [2022-02-20 17:31:03,112 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-20 17:31:03,112 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2022-02-20 17:31:03,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 17:31:03,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:31:03,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 56 transitions. [2022-02-20 17:31:03,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:31:03,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 56 transitions. [2022-02-20 17:31:03,115 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 56 transitions. [2022-02-20 17:31:03,155 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:03,156 INFO L225 Difference]: With dead ends: 44 [2022-02-20 17:31:03,156 INFO L226 Difference]: Without dead ends: 30 [2022-02-20 17:31:03,157 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-20 17:31:03,158 INFO L933 BasicCegarLoop]: 32 mSDtfsCounter, 0 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 89 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 17:31:03,158 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 89 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 17:31:03,159 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2022-02-20 17:31:03,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2022-02-20 17:31:03,161 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 17:31:03,161 INFO L82 GeneralOperation]: Start isEquivalent. First operand 30 states. Second operand has 30 states, 20 states have (on average 1.3) internal successors, (26), 21 states have internal predecessors, (26), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-02-20 17:31:03,161 INFO L74 IsIncluded]: Start isIncluded. First operand 30 states. Second operand has 30 states, 20 states have (on average 1.3) internal successors, (26), 21 states have internal predecessors, (26), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-02-20 17:31:03,162 INFO L87 Difference]: Start difference. First operand 30 states. Second operand has 30 states, 20 states have (on average 1.3) internal successors, (26), 21 states have internal predecessors, (26), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-02-20 17:31:03,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:31:03,163 INFO L93 Difference]: Finished difference Result 30 states and 39 transitions. [2022-02-20 17:31:03,163 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 39 transitions. [2022-02-20 17:31:03,164 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:31:03,164 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:31:03,164 INFO L74 IsIncluded]: Start isIncluded. First operand has 30 states, 20 states have (on average 1.3) internal successors, (26), 21 states have internal predecessors, (26), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand 30 states. [2022-02-20 17:31:03,164 INFO L87 Difference]: Start difference. First operand has 30 states, 20 states have (on average 1.3) internal successors, (26), 21 states have internal predecessors, (26), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand 30 states. [2022-02-20 17:31:03,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:31:03,166 INFO L93 Difference]: Finished difference Result 30 states and 39 transitions. [2022-02-20 17:31:03,166 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 39 transitions. [2022-02-20 17:31:03,166 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:31:03,166 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:31:03,166 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 17:31:03,166 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 17:31:03,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 20 states have (on average 1.3) internal successors, (26), 21 states have internal predecessors, (26), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-02-20 17:31:03,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 39 transitions. [2022-02-20 17:31:03,168 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 39 transitions. Word has length 12 [2022-02-20 17:31:03,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 17:31:03,168 INFO L470 AbstractCegarLoop]: Abstraction has 30 states and 39 transitions. [2022-02-20 17:31:03,168 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:31:03,169 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 39 transitions. [2022-02-20 17:31:03,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-02-20 17:31:03,169 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:31:03,169 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 17:31:03,169 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-02-20 17:31:03,169 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 17:31:03,170 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:31:03,170 INFO L85 PathProgramCache]: Analyzing trace with hash 472519838, now seen corresponding path program 1 times [2022-02-20 17:31:03,170 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 17:31:03,170 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1348609385] [2022-02-20 17:31:03,170 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:31:03,170 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 17:31:03,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:31:03,229 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-02-20 17:31:03,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:31:03,236 INFO L290 TraceCheckUtils]: 0: Hoare triple {527#true} ~cond := #in~cond; {527#true} is VALID [2022-02-20 17:31:03,236 INFO L290 TraceCheckUtils]: 1: Hoare triple {527#true} assume !(0 == ~cond); {527#true} is VALID [2022-02-20 17:31:03,236 INFO L290 TraceCheckUtils]: 2: Hoare triple {527#true} assume true; {527#true} is VALID [2022-02-20 17:31:03,237 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {527#true} {529#(= (+ (* (- 1) |ULTIMATE.start_main_~r~0#1|) |ULTIMATE.start_main_~A~0#1|) 0)} #74#return; {529#(= (+ (* (- 1) |ULTIMATE.start_main_~r~0#1|) |ULTIMATE.start_main_~A~0#1|) 0)} is VALID [2022-02-20 17:31:03,237 INFO L290 TraceCheckUtils]: 0: Hoare triple {527#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);~counter~0 := 0; {527#true} is VALID [2022-02-20 17:31:03,237 INFO L290 TraceCheckUtils]: 1: Hoare triple {527#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~post6#1, main_#t~post7#1, main_~A~0#1, main_~B~0#1, main_~r~0#1, main_~d~0#1, main_~p~0#1, main_~q~0#1;havoc main_~A~0#1;havoc main_~B~0#1;havoc main_~r~0#1;havoc main_~d~0#1;havoc main_~p~0#1;havoc main_~q~0#1;main_~A~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;main_~B~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := (if main_~B~0#1 % 4294967296 >= 1 then 1 else 0);havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {527#true} is VALID [2022-02-20 17:31:03,238 INFO L290 TraceCheckUtils]: 2: Hoare triple {527#true} assume !(0 == assume_abort_if_not_~cond#1); {527#true} is VALID [2022-02-20 17:31:03,238 INFO L290 TraceCheckUtils]: 3: Hoare triple {527#true} assume { :end_inline_assume_abort_if_not } 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; {529#(= (+ (* (- 1) |ULTIMATE.start_main_~r~0#1|) |ULTIMATE.start_main_~A~0#1|) 0)} is VALID [2022-02-20 17:31:03,239 INFO L290 TraceCheckUtils]: 4: Hoare triple {529#(= (+ (* (- 1) |ULTIMATE.start_main_~r~0#1|) |ULTIMATE.start_main_~A~0#1|) 0)} main_#t~post6#1 := ~counter~0;~counter~0 := 1 + main_#t~post6#1; {529#(= (+ (* (- 1) |ULTIMATE.start_main_~r~0#1|) |ULTIMATE.start_main_~A~0#1|) 0)} is VALID [2022-02-20 17:31:03,239 INFO L290 TraceCheckUtils]: 5: Hoare triple {529#(= (+ (* (- 1) |ULTIMATE.start_main_~r~0#1|) |ULTIMATE.start_main_~A~0#1|) 0)} assume !!(main_#t~post6#1 < 20);havoc main_#t~post6#1; {529#(= (+ (* (- 1) |ULTIMATE.start_main_~r~0#1|) |ULTIMATE.start_main_~A~0#1|) 0)} is VALID [2022-02-20 17:31:03,239 INFO L272 TraceCheckUtils]: 6: Hoare triple {529#(= (+ (* (- 1) |ULTIMATE.start_main_~r~0#1|) |ULTIMATE.start_main_~A~0#1|) 0)} call __VERIFIER_assert((if 0 == main_~q~0#1 % 4294967296 then 1 else 0)); {527#true} is VALID [2022-02-20 17:31:03,239 INFO L290 TraceCheckUtils]: 7: Hoare triple {527#true} ~cond := #in~cond; {527#true} is VALID [2022-02-20 17:31:03,240 INFO L290 TraceCheckUtils]: 8: Hoare triple {527#true} assume !(0 == ~cond); {527#true} is VALID [2022-02-20 17:31:03,240 INFO L290 TraceCheckUtils]: 9: Hoare triple {527#true} assume true; {527#true} is VALID [2022-02-20 17:31:03,240 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {527#true} {529#(= (+ (* (- 1) |ULTIMATE.start_main_~r~0#1|) |ULTIMATE.start_main_~A~0#1|) 0)} #74#return; {529#(= (+ (* (- 1) |ULTIMATE.start_main_~r~0#1|) |ULTIMATE.start_main_~A~0#1|) 0)} is VALID [2022-02-20 17:31:03,241 INFO L272 TraceCheckUtils]: 11: Hoare triple {529#(= (+ (* (- 1) |ULTIMATE.start_main_~r~0#1|) |ULTIMATE.start_main_~A~0#1|) 0)} call __VERIFIER_assert((if main_~r~0#1 % 4294967296 == main_~A~0#1 % 4294967296 then 1 else 0)); {534#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-02-20 17:31:03,242 INFO L290 TraceCheckUtils]: 12: Hoare triple {534#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {535#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-02-20 17:31:03,242 INFO L290 TraceCheckUtils]: 13: Hoare triple {535#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {528#false} is VALID [2022-02-20 17:31:03,242 INFO L290 TraceCheckUtils]: 14: Hoare triple {528#false} assume !false; {528#false} is VALID [2022-02-20 17:31:03,242 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 17:31:03,243 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 17:31:03,243 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1348609385] [2022-02-20 17:31:03,243 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1348609385] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 17:31:03,243 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 17:31:03,243 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 17:31:03,243 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1798176372] [2022-02-20 17:31:03,244 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 17:31:03,244 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2022-02-20 17:31:03,244 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 17:31:03,244 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 17:31:03,254 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 15 edges. 15 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:31:03,255 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 17:31:03,255 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 17:31:03,255 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 17:31:03,255 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 17:31:03,256 INFO L87 Difference]: Start difference. First operand 30 states and 39 transitions. Second operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 17:31:03,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:31:03,389 INFO L93 Difference]: Finished difference Result 44 states and 58 transitions. [2022-02-20 17:31:03,389 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-20 17:31:03,389 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2022-02-20 17:31:03,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 17:31:03,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 17:31:03,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 53 transitions. [2022-02-20 17:31:03,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 17:31:03,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 53 transitions. [2022-02-20 17:31:03,392 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 53 transitions. [2022-02-20 17:31:03,451 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 53 edges. 53 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:31:03,452 INFO L225 Difference]: With dead ends: 44 [2022-02-20 17:31:03,452 INFO L226 Difference]: Without dead ends: 42 [2022-02-20 17:31:03,452 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-02-20 17:31:03,453 INFO L933 BasicCegarLoop]: 33 mSDtfsCounter, 13 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 108 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.0s IncrementalHoareTripleChecker+Time [2022-02-20 17:31:03,454 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [18 Valid, 108 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 17:31:03,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2022-02-20 17:31:03,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 34. [2022-02-20 17:31:03,457 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 17:31:03,458 INFO L82 GeneralOperation]: Start isEquivalent. First operand 42 states. Second operand has 34 states, 23 states have (on average 1.2608695652173914) internal successors, (29), 24 states have internal predecessors, (29), 7 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-02-20 17:31:03,458 INFO L74 IsIncluded]: Start isIncluded. First operand 42 states. Second operand has 34 states, 23 states have (on average 1.2608695652173914) internal successors, (29), 24 states have internal predecessors, (29), 7 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-02-20 17:31:03,458 INFO L87 Difference]: Start difference. First operand 42 states. Second operand has 34 states, 23 states have (on average 1.2608695652173914) internal successors, (29), 24 states have internal predecessors, (29), 7 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-02-20 17:31:03,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:31:03,460 INFO L93 Difference]: Finished difference Result 42 states and 56 transitions. [2022-02-20 17:31:03,460 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 56 transitions. [2022-02-20 17:31:03,460 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:31:03,460 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:31:03,461 INFO L74 IsIncluded]: Start isIncluded. First operand has 34 states, 23 states have (on average 1.2608695652173914) internal successors, (29), 24 states have internal predecessors, (29), 7 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand 42 states. [2022-02-20 17:31:03,461 INFO L87 Difference]: Start difference. First operand has 34 states, 23 states have (on average 1.2608695652173914) internal successors, (29), 24 states have internal predecessors, (29), 7 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand 42 states. [2022-02-20 17:31:03,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:31:03,462 INFO L93 Difference]: Finished difference Result 42 states and 56 transitions. [2022-02-20 17:31:03,463 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 56 transitions. [2022-02-20 17:31:03,463 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:31:03,463 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:31:03,463 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 17:31:03,463 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 17:31:03,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 23 states have (on average 1.2608695652173914) internal successors, (29), 24 states have internal predecessors, (29), 7 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-02-20 17:31:03,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 42 transitions. [2022-02-20 17:31:03,465 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 42 transitions. Word has length 15 [2022-02-20 17:31:03,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 17:31:03,465 INFO L470 AbstractCegarLoop]: Abstraction has 34 states and 42 transitions. [2022-02-20 17:31:03,465 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 17:31:03,465 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 42 transitions. [2022-02-20 17:31:03,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-02-20 17:31:03,466 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:31:03,466 INFO L514 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 17:31:03,466 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-02-20 17:31:03,466 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 17:31:03,466 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:31:03,467 INFO L85 PathProgramCache]: Analyzing trace with hash 838495553, now seen corresponding path program 1 times [2022-02-20 17:31:03,467 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 17:31:03,467 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1972917395] [2022-02-20 17:31:03,467 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:31:03,467 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 17:31:03,478 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-20 17:31:03,479 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1240989375] [2022-02-20 17:31:03,479 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:31:03,479 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 17:31:03,479 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 17:31:03,481 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:03,515 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:03,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:31:03,521 INFO L263 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 7 conjunts are in the unsatisfiable core [2022-02-20 17:31:03,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:31:03,530 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 17:31:03,642 INFO L290 TraceCheckUtils]: 0: Hoare triple {730#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);~counter~0 := 0; {730#true} is VALID [2022-02-20 17:31:03,642 INFO L290 TraceCheckUtils]: 1: Hoare triple {730#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~post6#1, main_#t~post7#1, main_~A~0#1, main_~B~0#1, main_~r~0#1, main_~d~0#1, main_~p~0#1, main_~q~0#1;havoc main_~A~0#1;havoc main_~B~0#1;havoc main_~r~0#1;havoc main_~d~0#1;havoc main_~p~0#1;havoc main_~q~0#1;main_~A~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;main_~B~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := (if main_~B~0#1 % 4294967296 >= 1 then 1 else 0);havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {730#true} is VALID [2022-02-20 17:31:03,642 INFO L290 TraceCheckUtils]: 2: Hoare triple {730#true} assume !(0 == assume_abort_if_not_~cond#1); {730#true} is VALID [2022-02-20 17:31:03,643 INFO L290 TraceCheckUtils]: 3: Hoare triple {730#true} assume { :end_inline_assume_abort_if_not } 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; {744#(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:03,643 INFO L290 TraceCheckUtils]: 4: Hoare triple {744#(and (= |ULTIMATE.start_main_~p~0#1| 1) (= |ULTIMATE.start_main_~B~0#1| |ULTIMATE.start_main_~d~0#1|))} main_#t~post6#1 := ~counter~0;~counter~0 := 1 + main_#t~post6#1; {744#(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:03,644 INFO L290 TraceCheckUtils]: 5: Hoare triple {744#(and (= |ULTIMATE.start_main_~p~0#1| 1) (= |ULTIMATE.start_main_~B~0#1| |ULTIMATE.start_main_~d~0#1|))} assume !!(main_#t~post6#1 < 20);havoc main_#t~post6#1; {744#(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:03,644 INFO L272 TraceCheckUtils]: 6: Hoare triple {744#(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)); {730#true} is VALID [2022-02-20 17:31:03,644 INFO L290 TraceCheckUtils]: 7: Hoare triple {730#true} ~cond := #in~cond; {730#true} is VALID [2022-02-20 17:31:03,644 INFO L290 TraceCheckUtils]: 8: Hoare triple {730#true} assume !(0 == ~cond); {730#true} is VALID [2022-02-20 17:31:03,644 INFO L290 TraceCheckUtils]: 9: Hoare triple {730#true} assume true; {730#true} is VALID [2022-02-20 17:31:03,645 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {730#true} {744#(and (= |ULTIMATE.start_main_~p~0#1| 1) (= |ULTIMATE.start_main_~B~0#1| |ULTIMATE.start_main_~d~0#1|))} #74#return; {744#(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:03,645 INFO L272 TraceCheckUtils]: 11: Hoare triple {744#(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)); {730#true} is VALID [2022-02-20 17:31:03,646 INFO L290 TraceCheckUtils]: 12: Hoare triple {730#true} ~cond := #in~cond; {730#true} is VALID [2022-02-20 17:31:03,646 INFO L290 TraceCheckUtils]: 13: Hoare triple {730#true} assume !(0 == ~cond); {730#true} is VALID [2022-02-20 17:31:03,646 INFO L290 TraceCheckUtils]: 14: Hoare triple {730#true} assume true; {730#true} is VALID [2022-02-20 17:31:03,646 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {730#true} {744#(and (= |ULTIMATE.start_main_~p~0#1| 1) (= |ULTIMATE.start_main_~B~0#1| |ULTIMATE.start_main_~d~0#1|))} #76#return; {744#(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:03,647 INFO L272 TraceCheckUtils]: 16: Hoare triple {744#(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)); {784#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-02-20 17:31:03,648 INFO L290 TraceCheckUtils]: 17: Hoare triple {784#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {788#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-02-20 17:31:03,648 INFO L290 TraceCheckUtils]: 18: Hoare triple {788#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {731#false} is VALID [2022-02-20 17:31:03,648 INFO L290 TraceCheckUtils]: 19: Hoare triple {731#false} assume !false; {731#false} is VALID [2022-02-20 17:31:03,648 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-02-20 17:31:03,649 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 17:31:03,649 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 17:31:03,649 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1972917395] [2022-02-20 17:31:03,649 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-20 17:31:03,649 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1240989375] [2022-02-20 17:31:03,649 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1240989375] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 17:31:03,650 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 17:31:03,650 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 17:31:03,650 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1529182167] [2022-02-20 17:31:03,650 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 17:31:03,650 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 20 [2022-02-20 17:31:03,651 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 17:31:03,651 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 17:31:03,663 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:31:03,664 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 17:31:03,664 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 17:31:03,664 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 17:31:03,664 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 17:31:03,664 INFO L87 Difference]: Start difference. First operand 34 states and 42 transitions. Second operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 17:31:05,787 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-02-20 17:31:05,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:31:05,983 INFO L93 Difference]: Finished difference Result 51 states and 67 transitions. [2022-02-20 17:31:05,983 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 17:31:05,983 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 20 [2022-02-20 17:31:05,983 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 17:31:05,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 17:31:05,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 61 transitions. [2022-02-20 17:31:05,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 17:31:05,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 61 transitions. [2022-02-20 17:31:05,986 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 61 transitions. [2022-02-20 17:31:06,046 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 61 edges. 61 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:31:06,047 INFO L225 Difference]: With dead ends: 51 [2022-02-20 17:31:06,047 INFO L226 Difference]: Without dead ends: 48 [2022-02-20 17:31:06,047 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 16 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:06,048 INFO L933 BasicCegarLoop]: 35 mSDtfsCounter, 10 mSDsluCounter, 84 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 2 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 119 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2022-02-20 17:31:06,048 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [14 Valid, 119 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 36 Invalid, 1 Unknown, 0 Unchecked, 2.0s Time] [2022-02-20 17:31:06,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2022-02-20 17:31:06,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2022-02-20 17:31:06,054 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 17:31:06,054 INFO L82 GeneralOperation]: Start isEquivalent. First operand 48 states. Second operand has 48 states, 30 states have (on average 1.3) internal successors, (39), 32 states have internal predecessors, (39), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-02-20 17:31:06,055 INFO L74 IsIncluded]: Start isIncluded. First operand 48 states. Second operand has 48 states, 30 states have (on average 1.3) internal successors, (39), 32 states have internal predecessors, (39), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-02-20 17:31:06,055 INFO L87 Difference]: Start difference. First operand 48 states. Second operand has 48 states, 30 states have (on average 1.3) internal successors, (39), 32 states have internal predecessors, (39), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-02-20 17:31:06,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:31:06,057 INFO L93 Difference]: Finished difference Result 48 states and 63 transitions. [2022-02-20 17:31:06,057 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 63 transitions. [2022-02-20 17:31:06,057 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:31:06,058 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:31:06,058 INFO L74 IsIncluded]: Start isIncluded. First operand has 48 states, 30 states have (on average 1.3) internal successors, (39), 32 states have internal predecessors, (39), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand 48 states. [2022-02-20 17:31:06,058 INFO L87 Difference]: Start difference. First operand has 48 states, 30 states have (on average 1.3) internal successors, (39), 32 states have internal predecessors, (39), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand 48 states. [2022-02-20 17:31:06,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:31:06,060 INFO L93 Difference]: Finished difference Result 48 states and 63 transitions. [2022-02-20 17:31:06,060 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 63 transitions. [2022-02-20 17:31:06,060 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:31:06,061 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:31:06,061 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 17:31:06,061 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 17:31:06,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 30 states have (on average 1.3) internal successors, (39), 32 states have internal predecessors, (39), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-02-20 17:31:06,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 63 transitions. [2022-02-20 17:31:06,063 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 63 transitions. Word has length 20 [2022-02-20 17:31:06,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 17:31:06,063 INFO L470 AbstractCegarLoop]: Abstraction has 48 states and 63 transitions. [2022-02-20 17:31:06,063 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 17:31:06,064 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 63 transitions. [2022-02-20 17:31:06,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-02-20 17:31:06,064 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:31:06,064 INFO L514 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 17:31:06,083 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:06,270 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 17:31:06,270 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 17:31:06,271 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:31:06,271 INFO L85 PathProgramCache]: Analyzing trace with hash 414140572, now seen corresponding path program 1 times [2022-02-20 17:31:06,271 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 17:31:06,271 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1260149391] [2022-02-20 17:31:06,271 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:31:06,271 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 17:31:06,283 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-20 17:31:06,283 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1906432455] [2022-02-20 17:31:06,283 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:31:06,284 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 17:31:06,284 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 17:31:06,285 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:06,286 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:06,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:31:06,315 INFO L263 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 5 conjunts are in the unsatisfiable core [2022-02-20 17:31:06,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:31:06,323 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 17:31:06,482 INFO L290 TraceCheckUtils]: 0: Hoare triple {1030#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);~counter~0 := 0; {1035#(<= ~counter~0 0)} is VALID [2022-02-20 17:31:06,483 INFO L290 TraceCheckUtils]: 1: Hoare triple {1035#(<= ~counter~0 0)} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~post6#1, main_#t~post7#1, main_~A~0#1, main_~B~0#1, main_~r~0#1, main_~d~0#1, main_~p~0#1, main_~q~0#1;havoc main_~A~0#1;havoc main_~B~0#1;havoc main_~r~0#1;havoc main_~d~0#1;havoc main_~p~0#1;havoc main_~q~0#1;main_~A~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;main_~B~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := (if main_~B~0#1 % 4294967296 >= 1 then 1 else 0);havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {1035#(<= ~counter~0 0)} is VALID [2022-02-20 17:31:06,484 INFO L290 TraceCheckUtils]: 2: Hoare triple {1035#(<= ~counter~0 0)} assume !(0 == assume_abort_if_not_~cond#1); {1035#(<= ~counter~0 0)} is VALID [2022-02-20 17:31:06,484 INFO L290 TraceCheckUtils]: 3: Hoare triple {1035#(<= ~counter~0 0)} assume { :end_inline_assume_abort_if_not } 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; {1035#(<= ~counter~0 0)} is VALID [2022-02-20 17:31:06,485 INFO L290 TraceCheckUtils]: 4: Hoare triple {1035#(<= ~counter~0 0)} main_#t~post6#1 := ~counter~0;~counter~0 := 1 + main_#t~post6#1; {1048#(<= ~counter~0 1)} is VALID [2022-02-20 17:31:06,485 INFO L290 TraceCheckUtils]: 5: Hoare triple {1048#(<= ~counter~0 1)} assume !!(main_#t~post6#1 < 20);havoc main_#t~post6#1; {1048#(<= ~counter~0 1)} is VALID [2022-02-20 17:31:06,486 INFO L272 TraceCheckUtils]: 6: Hoare triple {1048#(<= ~counter~0 1)} call __VERIFIER_assert((if 0 == main_~q~0#1 % 4294967296 then 1 else 0)); {1048#(<= ~counter~0 1)} is VALID [2022-02-20 17:31:06,486 INFO L290 TraceCheckUtils]: 7: Hoare triple {1048#(<= ~counter~0 1)} ~cond := #in~cond; {1048#(<= ~counter~0 1)} is VALID [2022-02-20 17:31:06,487 INFO L290 TraceCheckUtils]: 8: Hoare triple {1048#(<= ~counter~0 1)} assume !(0 == ~cond); {1048#(<= ~counter~0 1)} is VALID [2022-02-20 17:31:06,487 INFO L290 TraceCheckUtils]: 9: Hoare triple {1048#(<= ~counter~0 1)} assume true; {1048#(<= ~counter~0 1)} is VALID [2022-02-20 17:31:06,487 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1048#(<= ~counter~0 1)} {1048#(<= ~counter~0 1)} #74#return; {1048#(<= ~counter~0 1)} is VALID [2022-02-20 17:31:06,488 INFO L272 TraceCheckUtils]: 11: Hoare triple {1048#(<= ~counter~0 1)} call __VERIFIER_assert((if main_~r~0#1 % 4294967296 == main_~A~0#1 % 4294967296 then 1 else 0)); {1048#(<= ~counter~0 1)} is VALID [2022-02-20 17:31:06,488 INFO L290 TraceCheckUtils]: 12: Hoare triple {1048#(<= ~counter~0 1)} ~cond := #in~cond; {1048#(<= ~counter~0 1)} is VALID [2022-02-20 17:31:06,489 INFO L290 TraceCheckUtils]: 13: Hoare triple {1048#(<= ~counter~0 1)} assume !(0 == ~cond); {1048#(<= ~counter~0 1)} is VALID [2022-02-20 17:31:06,489 INFO L290 TraceCheckUtils]: 14: Hoare triple {1048#(<= ~counter~0 1)} assume true; {1048#(<= ~counter~0 1)} is VALID [2022-02-20 17:31:06,490 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {1048#(<= ~counter~0 1)} {1048#(<= ~counter~0 1)} #76#return; {1048#(<= ~counter~0 1)} is VALID [2022-02-20 17:31:06,491 INFO L272 TraceCheckUtils]: 16: Hoare triple {1048#(<= ~counter~0 1)} call __VERIFIER_assert((if main_~d~0#1 % 4294967296 == main_~B~0#1 * main_~p~0#1 % 4294967296 then 1 else 0)); {1048#(<= ~counter~0 1)} is VALID [2022-02-20 17:31:06,491 INFO L290 TraceCheckUtils]: 17: Hoare triple {1048#(<= ~counter~0 1)} ~cond := #in~cond; {1048#(<= ~counter~0 1)} is VALID [2022-02-20 17:31:06,491 INFO L290 TraceCheckUtils]: 18: Hoare triple {1048#(<= ~counter~0 1)} assume !(0 == ~cond); {1048#(<= ~counter~0 1)} is VALID [2022-02-20 17:31:06,492 INFO L290 TraceCheckUtils]: 19: Hoare triple {1048#(<= ~counter~0 1)} assume true; {1048#(<= ~counter~0 1)} is VALID [2022-02-20 17:31:06,493 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {1048#(<= ~counter~0 1)} {1048#(<= ~counter~0 1)} #78#return; {1048#(<= ~counter~0 1)} is VALID [2022-02-20 17:31:06,493 INFO L290 TraceCheckUtils]: 21: Hoare triple {1048#(<= ~counter~0 1)} assume !(main_~r~0#1 % 4294967296 >= main_~d~0#1 % 4294967296); {1048#(<= ~counter~0 1)} is VALID [2022-02-20 17:31:06,494 INFO L290 TraceCheckUtils]: 22: Hoare triple {1048#(<= ~counter~0 1)} main_#t~post7#1 := ~counter~0;~counter~0 := 1 + main_#t~post7#1; {1103#(<= |ULTIMATE.start_main_#t~post7#1| 1)} is VALID [2022-02-20 17:31:06,494 INFO L290 TraceCheckUtils]: 23: Hoare triple {1103#(<= |ULTIMATE.start_main_#t~post7#1| 1)} assume !(main_#t~post7#1 < 20);havoc main_#t~post7#1; {1031#false} is VALID [2022-02-20 17:31:06,495 INFO L272 TraceCheckUtils]: 24: Hoare triple {1031#false} 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)); {1031#false} is VALID [2022-02-20 17:31:06,495 INFO L290 TraceCheckUtils]: 25: Hoare triple {1031#false} ~cond := #in~cond; {1031#false} is VALID [2022-02-20 17:31:06,495 INFO L290 TraceCheckUtils]: 26: Hoare triple {1031#false} assume 0 == ~cond; {1031#false} is VALID [2022-02-20 17:31:06,495 INFO L290 TraceCheckUtils]: 27: Hoare triple {1031#false} assume !false; {1031#false} is VALID [2022-02-20 17:31:06,496 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-02-20 17:31:06,496 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 17:31:06,496 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 17:31:06,496 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1260149391] [2022-02-20 17:31:06,496 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-20 17:31:06,496 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1906432455] [2022-02-20 17:31:06,496 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1906432455] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 17:31:06,497 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 17:31:06,497 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-20 17:31:06,497 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [619966606] [2022-02-20 17:31:06,497 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 17:31:06,498 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 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 28 [2022-02-20 17:31:06,498 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 17:31:06,498 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 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:06,518 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:31:06,519 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 17:31:06,519 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 17:31:06,519 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 17:31:06,519 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-02-20 17:31:06,520 INFO L87 Difference]: Start difference. First operand 48 states and 63 transitions. Second operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 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:06,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:31:06,677 INFO L93 Difference]: Finished difference Result 68 states and 79 transitions. [2022-02-20 17:31:06,677 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 17:31:06,677 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 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 28 [2022-02-20 17:31:06,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 17:31:06,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 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:06,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 57 transitions. [2022-02-20 17:31:06,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 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:06,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 57 transitions. [2022-02-20 17:31:06,680 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 57 transitions. [2022-02-20 17:31:06,728 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 57 edges. 57 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:31:06,729 INFO L225 Difference]: With dead ends: 68 [2022-02-20 17:31:06,729 INFO L226 Difference]: Without dead ends: 61 [2022-02-20 17:31:06,729 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-02-20 17:31:06,730 INFO L933 BasicCegarLoop]: 34 mSDtfsCounter, 4 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 99 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 17:31:06,730 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [4 Valid, 99 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 17:31:06,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2022-02-20 17:31:06,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 60. [2022-02-20 17:31:06,740 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 17:31:06,741 INFO L82 GeneralOperation]: Start isEquivalent. First operand 61 states. Second operand has 60 states, 39 states have (on average 1.205128205128205) internal successors, (47), 41 states have internal predecessors, (47), 13 states have call successors, (13), 7 states have call predecessors, (13), 7 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-02-20 17:31:06,741 INFO L74 IsIncluded]: Start isIncluded. First operand 61 states. Second operand has 60 states, 39 states have (on average 1.205128205128205) internal successors, (47), 41 states have internal predecessors, (47), 13 states have call successors, (13), 7 states have call predecessors, (13), 7 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-02-20 17:31:06,741 INFO L87 Difference]: Start difference. First operand 61 states. Second operand has 60 states, 39 states have (on average 1.205128205128205) internal successors, (47), 41 states have internal predecessors, (47), 13 states have call successors, (13), 7 states have call predecessors, (13), 7 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-02-20 17:31:06,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:31:06,743 INFO L93 Difference]: Finished difference Result 61 states and 72 transitions. [2022-02-20 17:31:06,743 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 72 transitions. [2022-02-20 17:31:06,743 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:31:06,743 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:31:06,744 INFO L74 IsIncluded]: Start isIncluded. First operand has 60 states, 39 states have (on average 1.205128205128205) internal successors, (47), 41 states have internal predecessors, (47), 13 states have call successors, (13), 7 states have call predecessors, (13), 7 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand 61 states. [2022-02-20 17:31:06,744 INFO L87 Difference]: Start difference. First operand has 60 states, 39 states have (on average 1.205128205128205) internal successors, (47), 41 states have internal predecessors, (47), 13 states have call successors, (13), 7 states have call predecessors, (13), 7 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand 61 states. [2022-02-20 17:31:06,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:31:06,746 INFO L93 Difference]: Finished difference Result 61 states and 72 transitions. [2022-02-20 17:31:06,746 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 72 transitions. [2022-02-20 17:31:06,746 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:31:06,746 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:31:06,746 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 17:31:06,746 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 17:31:06,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 39 states have (on average 1.205128205128205) internal successors, (47), 41 states have internal predecessors, (47), 13 states have call successors, (13), 7 states have call predecessors, (13), 7 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-02-20 17:31:06,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 71 transitions. [2022-02-20 17:31:06,748 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 71 transitions. Word has length 28 [2022-02-20 17:31:06,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 17:31:06,748 INFO L470 AbstractCegarLoop]: Abstraction has 60 states and 71 transitions. [2022-02-20 17:31:06,749 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 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:06,749 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 71 transitions. [2022-02-20 17:31:06,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-02-20 17:31:06,749 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:31:06,749 INFO L514 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 17:31:06,769 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:06,967 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2022-02-20 17:31:06,967 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 17:31:06,967 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:31:06,968 INFO L85 PathProgramCache]: Analyzing trace with hash 415868450, now seen corresponding path program 1 times [2022-02-20 17:31:06,968 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 17:31:06,968 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1035186902] [2022-02-20 17:31:06,968 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:31:06,968 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 17:31:07,001 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-20 17:31:07,001 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1266797105] [2022-02-20 17:31:07,001 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:31:07,001 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 17:31:07,001 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 17:31:07,010 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:07,036 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:07,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:31:07,084 INFO L263 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 10 conjunts are in the unsatisfiable core [2022-02-20 17:31:07,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:31:07,091 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 17:31:07,734 INFO L290 TraceCheckUtils]: 0: Hoare triple {1415#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);~counter~0 := 0; {1415#true} is VALID [2022-02-20 17:31:07,734 INFO L290 TraceCheckUtils]: 1: Hoare triple {1415#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~post6#1, main_#t~post7#1, main_~A~0#1, main_~B~0#1, main_~r~0#1, main_~d~0#1, main_~p~0#1, main_~q~0#1;havoc main_~A~0#1;havoc main_~B~0#1;havoc main_~r~0#1;havoc main_~d~0#1;havoc main_~p~0#1;havoc main_~q~0#1;main_~A~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;main_~B~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := (if main_~B~0#1 % 4294967296 >= 1 then 1 else 0);havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {1415#true} is VALID [2022-02-20 17:31:07,734 INFO L290 TraceCheckUtils]: 2: Hoare triple {1415#true} assume !(0 == assume_abort_if_not_~cond#1); {1415#true} is VALID [2022-02-20 17:31:07,735 INFO L290 TraceCheckUtils]: 3: Hoare triple {1415#true} assume { :end_inline_assume_abort_if_not } 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; {1429#(and (= |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:07,735 INFO L290 TraceCheckUtils]: 4: Hoare triple {1429#(and (= |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|))} main_#t~post6#1 := ~counter~0;~counter~0 := 1 + main_#t~post6#1; {1429#(and (= |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:07,736 INFO L290 TraceCheckUtils]: 5: Hoare triple {1429#(and (= |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_#t~post6#1 < 20);havoc main_#t~post6#1; {1429#(and (= |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:07,736 INFO L272 TraceCheckUtils]: 6: Hoare triple {1429#(and (= |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)); {1415#true} is VALID [2022-02-20 17:31:07,736 INFO L290 TraceCheckUtils]: 7: Hoare triple {1415#true} ~cond := #in~cond; {1415#true} is VALID [2022-02-20 17:31:07,736 INFO L290 TraceCheckUtils]: 8: Hoare triple {1415#true} assume !(0 == ~cond); {1415#true} is VALID [2022-02-20 17:31:07,736 INFO L290 TraceCheckUtils]: 9: Hoare triple {1415#true} assume true; {1415#true} is VALID [2022-02-20 17:31:07,739 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1415#true} {1429#(and (= |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|))} #74#return; {1429#(and (= |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:07,739 INFO L272 TraceCheckUtils]: 11: Hoare triple {1429#(and (= |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)); {1415#true} is VALID [2022-02-20 17:31:07,739 INFO L290 TraceCheckUtils]: 12: Hoare triple {1415#true} ~cond := #in~cond; {1415#true} is VALID [2022-02-20 17:31:07,739 INFO L290 TraceCheckUtils]: 13: Hoare triple {1415#true} assume !(0 == ~cond); {1415#true} is VALID [2022-02-20 17:31:07,739 INFO L290 TraceCheckUtils]: 14: Hoare triple {1415#true} assume true; {1415#true} is VALID [2022-02-20 17:31:07,740 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {1415#true} {1429#(and (= |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|))} #76#return; {1429#(and (= |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:07,740 INFO L272 TraceCheckUtils]: 16: Hoare triple {1429#(and (= |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)); {1415#true} is VALID [2022-02-20 17:31:07,740 INFO L290 TraceCheckUtils]: 17: Hoare triple {1415#true} ~cond := #in~cond; {1415#true} is VALID [2022-02-20 17:31:07,740 INFO L290 TraceCheckUtils]: 18: Hoare triple {1415#true} assume !(0 == ~cond); {1415#true} is VALID [2022-02-20 17:31:07,740 INFO L290 TraceCheckUtils]: 19: Hoare triple {1415#true} assume true; {1415#true} is VALID [2022-02-20 17:31:07,741 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {1415#true} {1429#(and (= |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|))} #78#return; {1429#(and (= |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:07,751 INFO L290 TraceCheckUtils]: 21: Hoare triple {1429#(and (= |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); {1484#(and (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:07,752 INFO L290 TraceCheckUtils]: 22: Hoare triple {1484#(and (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|))} main_#t~post7#1 := ~counter~0;~counter~0 := 1 + main_#t~post7#1; {1484#(and (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:07,753 INFO L290 TraceCheckUtils]: 23: Hoare triple {1484#(and (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 !!(main_#t~post7#1 < 20);havoc main_#t~post7#1; {1484#(and (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:07,754 INFO L272 TraceCheckUtils]: 24: Hoare triple {1484#(and (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)); {1494#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-02-20 17:31:07,754 INFO L290 TraceCheckUtils]: 25: Hoare triple {1494#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1498#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-02-20 17:31:07,754 INFO L290 TraceCheckUtils]: 26: Hoare triple {1498#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1416#false} is VALID [2022-02-20 17:31:07,755 INFO L290 TraceCheckUtils]: 27: Hoare triple {1416#false} assume !false; {1416#false} is VALID [2022-02-20 17:31:07,755 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-02-20 17:31:07,755 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 17:31:07,755 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 17:31:07,755 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1035186902] [2022-02-20 17:31:07,755 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-20 17:31:07,755 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1266797105] [2022-02-20 17:31:07,755 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1266797105] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 17:31:07,755 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 17:31:07,755 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-02-20 17:31:07,755 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1363457419] [2022-02-20 17:31:07,755 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 17:31:07,756 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 states have internal predecessors, (15), 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 28 [2022-02-20 17:31:07,756 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 17:31:07,756 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 states have internal predecessors, (15), 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:07,778 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:31:07,778 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-20 17:31:07,778 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 17:31:07,778 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-20 17:31:07,778 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-02-20 17:31:07,779 INFO L87 Difference]: Start difference. First operand 60 states and 71 transitions. Second operand has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 states have internal predecessors, (15), 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,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:31:08,293 INFO L93 Difference]: Finished difference Result 74 states and 90 transitions. [2022-02-20 17:31:08,293 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-02-20 17:31:08,293 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 states have internal predecessors, (15), 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 28 [2022-02-20 17:31:08,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 17:31:08,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 states have internal predecessors, (15), 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,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 72 transitions. [2022-02-20 17:31:08,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 states have internal predecessors, (15), 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,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 72 transitions. [2022-02-20 17:31:08,297 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 72 transitions. [2022-02-20 17:31:08,378 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 72 edges. 72 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:31:08,380 INFO L225 Difference]: With dead ends: 74 [2022-02-20 17:31:08,380 INFO L226 Difference]: Without dead ends: 71 [2022-02-20 17:31:08,380 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-02-20 17:31:08,381 INFO L933 BasicCegarLoop]: 33 mSDtfsCounter, 14 mSDsluCounter, 116 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 149 SdHoareTripleChecker+Invalid, 75 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 17:31:08,381 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [17 Valid, 149 Invalid, 75 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 17:31:08,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2022-02-20 17:31:08,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 70. [2022-02-20 17:31:08,397 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 17:31:08,397 INFO L82 GeneralOperation]: Start isEquivalent. First operand 71 states. Second operand has 70 states, 46 states have (on average 1.2173913043478262) internal successors, (56), 48 states have internal predecessors, (56), 15 states have call successors, (15), 8 states have call predecessors, (15), 8 states have return successors, (14), 13 states have call predecessors, (14), 14 states have call successors, (14) [2022-02-20 17:31:08,398 INFO L74 IsIncluded]: Start isIncluded. First operand 71 states. Second operand has 70 states, 46 states have (on average 1.2173913043478262) internal successors, (56), 48 states have internal predecessors, (56), 15 states have call successors, (15), 8 states have call predecessors, (15), 8 states have return successors, (14), 13 states have call predecessors, (14), 14 states have call successors, (14) [2022-02-20 17:31:08,398 INFO L87 Difference]: Start difference. First operand 71 states. Second operand has 70 states, 46 states have (on average 1.2173913043478262) internal successors, (56), 48 states have internal predecessors, (56), 15 states have call successors, (15), 8 states have call predecessors, (15), 8 states have return successors, (14), 13 states have call predecessors, (14), 14 states have call successors, (14) [2022-02-20 17:31:08,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:31:08,400 INFO L93 Difference]: Finished difference Result 71 states and 86 transitions. [2022-02-20 17:31:08,400 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 86 transitions. [2022-02-20 17:31:08,401 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:31:08,401 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:31:08,401 INFO L74 IsIncluded]: Start isIncluded. First operand has 70 states, 46 states have (on average 1.2173913043478262) internal successors, (56), 48 states have internal predecessors, (56), 15 states have call successors, (15), 8 states have call predecessors, (15), 8 states have return successors, (14), 13 states have call predecessors, (14), 14 states have call successors, (14) Second operand 71 states. [2022-02-20 17:31:08,401 INFO L87 Difference]: Start difference. First operand has 70 states, 46 states have (on average 1.2173913043478262) internal successors, (56), 48 states have internal predecessors, (56), 15 states have call successors, (15), 8 states have call predecessors, (15), 8 states have return successors, (14), 13 states have call predecessors, (14), 14 states have call successors, (14) Second operand 71 states. [2022-02-20 17:31:08,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:31:08,403 INFO L93 Difference]: Finished difference Result 71 states and 86 transitions. [2022-02-20 17:31:08,403 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 86 transitions. [2022-02-20 17:31:08,404 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:31:08,404 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:31:08,404 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 17:31:08,404 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 17:31:08,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 46 states have (on average 1.2173913043478262) internal successors, (56), 48 states have internal predecessors, (56), 15 states have call successors, (15), 8 states have call predecessors, (15), 8 states have return successors, (14), 13 states have call predecessors, (14), 14 states have call successors, (14) [2022-02-20 17:31:08,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 85 transitions. [2022-02-20 17:31:08,406 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 85 transitions. Word has length 28 [2022-02-20 17:31:08,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 17:31:08,406 INFO L470 AbstractCegarLoop]: Abstraction has 70 states and 85 transitions. [2022-02-20 17:31:08,407 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 states have internal predecessors, (15), 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,407 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 85 transitions. [2022-02-20 17:31:08,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-02-20 17:31:08,407 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:31:08,407 INFO L514 BasicCegarLoop]: trace histogram [4, 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,427 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:08,624 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 17:31:08,625 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 17:31:08,625 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:31:08,625 INFO L85 PathProgramCache]: Analyzing trace with hash 1040101153, now seen corresponding path program 1 times [2022-02-20 17:31:08,625 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 17:31:08,625 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1756639642] [2022-02-20 17:31:08,625 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:31:08,625 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 17:31:08,640 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-20 17:31:08,640 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2070913904] [2022-02-20 17:31:08,640 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:31:08,640 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 17:31:08,640 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 17:31:08,655 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:08,656 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:08,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:31:08,697 INFO L263 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 5 conjunts are in the unsatisfiable core [2022-02-20 17:31:08,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:31:08,719 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 17:31:08,907 INFO L290 TraceCheckUtils]: 0: Hoare triple {1846#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);~counter~0 := 0; {1851#(<= ~counter~0 0)} is VALID [2022-02-20 17:31:08,907 INFO L290 TraceCheckUtils]: 1: Hoare triple {1851#(<= ~counter~0 0)} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~post6#1, main_#t~post7#1, main_~A~0#1, main_~B~0#1, main_~r~0#1, main_~d~0#1, main_~p~0#1, main_~q~0#1;havoc main_~A~0#1;havoc main_~B~0#1;havoc main_~r~0#1;havoc main_~d~0#1;havoc main_~p~0#1;havoc main_~q~0#1;main_~A~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;main_~B~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := (if main_~B~0#1 % 4294967296 >= 1 then 1 else 0);havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {1851#(<= ~counter~0 0)} is VALID [2022-02-20 17:31:08,908 INFO L290 TraceCheckUtils]: 2: Hoare triple {1851#(<= ~counter~0 0)} assume !(0 == assume_abort_if_not_~cond#1); {1851#(<= ~counter~0 0)} is VALID [2022-02-20 17:31:08,908 INFO L290 TraceCheckUtils]: 3: Hoare triple {1851#(<= ~counter~0 0)} assume { :end_inline_assume_abort_if_not } 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; {1851#(<= ~counter~0 0)} is VALID [2022-02-20 17:31:08,908 INFO L290 TraceCheckUtils]: 4: Hoare triple {1851#(<= ~counter~0 0)} main_#t~post6#1 := ~counter~0;~counter~0 := 1 + main_#t~post6#1; {1864#(<= ~counter~0 1)} is VALID [2022-02-20 17:31:08,909 INFO L290 TraceCheckUtils]: 5: Hoare triple {1864#(<= ~counter~0 1)} assume !!(main_#t~post6#1 < 20);havoc main_#t~post6#1; {1864#(<= ~counter~0 1)} is VALID [2022-02-20 17:31:08,909 INFO L272 TraceCheckUtils]: 6: Hoare triple {1864#(<= ~counter~0 1)} call __VERIFIER_assert((if 0 == main_~q~0#1 % 4294967296 then 1 else 0)); {1864#(<= ~counter~0 1)} is VALID [2022-02-20 17:31:08,910 INFO L290 TraceCheckUtils]: 7: Hoare triple {1864#(<= ~counter~0 1)} ~cond := #in~cond; {1864#(<= ~counter~0 1)} is VALID [2022-02-20 17:31:08,910 INFO L290 TraceCheckUtils]: 8: Hoare triple {1864#(<= ~counter~0 1)} assume !(0 == ~cond); {1864#(<= ~counter~0 1)} is VALID [2022-02-20 17:31:08,910 INFO L290 TraceCheckUtils]: 9: Hoare triple {1864#(<= ~counter~0 1)} assume true; {1864#(<= ~counter~0 1)} is VALID [2022-02-20 17:31:08,911 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1864#(<= ~counter~0 1)} {1864#(<= ~counter~0 1)} #74#return; {1864#(<= ~counter~0 1)} is VALID [2022-02-20 17:31:08,911 INFO L272 TraceCheckUtils]: 11: Hoare triple {1864#(<= ~counter~0 1)} call __VERIFIER_assert((if main_~r~0#1 % 4294967296 == main_~A~0#1 % 4294967296 then 1 else 0)); {1864#(<= ~counter~0 1)} is VALID [2022-02-20 17:31:08,911 INFO L290 TraceCheckUtils]: 12: Hoare triple {1864#(<= ~counter~0 1)} ~cond := #in~cond; {1864#(<= ~counter~0 1)} is VALID [2022-02-20 17:31:08,912 INFO L290 TraceCheckUtils]: 13: Hoare triple {1864#(<= ~counter~0 1)} assume !(0 == ~cond); {1864#(<= ~counter~0 1)} is VALID [2022-02-20 17:31:08,912 INFO L290 TraceCheckUtils]: 14: Hoare triple {1864#(<= ~counter~0 1)} assume true; {1864#(<= ~counter~0 1)} is VALID [2022-02-20 17:31:08,912 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {1864#(<= ~counter~0 1)} {1864#(<= ~counter~0 1)} #76#return; {1864#(<= ~counter~0 1)} is VALID [2022-02-20 17:31:08,913 INFO L272 TraceCheckUtils]: 16: Hoare triple {1864#(<= ~counter~0 1)} call __VERIFIER_assert((if main_~d~0#1 % 4294967296 == main_~B~0#1 * main_~p~0#1 % 4294967296 then 1 else 0)); {1864#(<= ~counter~0 1)} is VALID [2022-02-20 17:31:08,913 INFO L290 TraceCheckUtils]: 17: Hoare triple {1864#(<= ~counter~0 1)} ~cond := #in~cond; {1864#(<= ~counter~0 1)} is VALID [2022-02-20 17:31:08,914 INFO L290 TraceCheckUtils]: 18: Hoare triple {1864#(<= ~counter~0 1)} assume !(0 == ~cond); {1864#(<= ~counter~0 1)} is VALID [2022-02-20 17:31:08,914 INFO L290 TraceCheckUtils]: 19: Hoare triple {1864#(<= ~counter~0 1)} assume true; {1864#(<= ~counter~0 1)} is VALID [2022-02-20 17:31:08,914 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {1864#(<= ~counter~0 1)} {1864#(<= ~counter~0 1)} #78#return; {1864#(<= ~counter~0 1)} is VALID [2022-02-20 17:31:08,915 INFO L290 TraceCheckUtils]: 21: Hoare triple {1864#(<= ~counter~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; {1864#(<= ~counter~0 1)} is VALID [2022-02-20 17:31:08,915 INFO L290 TraceCheckUtils]: 22: Hoare triple {1864#(<= ~counter~0 1)} main_#t~post6#1 := ~counter~0;~counter~0 := 1 + main_#t~post6#1; {1919#(<= |ULTIMATE.start_main_#t~post6#1| 1)} is VALID [2022-02-20 17:31:08,915 INFO L290 TraceCheckUtils]: 23: Hoare triple {1919#(<= |ULTIMATE.start_main_#t~post6#1| 1)} assume !(main_#t~post6#1 < 20);havoc main_#t~post6#1; {1847#false} is VALID [2022-02-20 17:31:08,916 INFO L290 TraceCheckUtils]: 24: Hoare triple {1847#false} main_#t~post7#1 := ~counter~0;~counter~0 := 1 + main_#t~post7#1; {1847#false} is VALID [2022-02-20 17:31:08,916 INFO L290 TraceCheckUtils]: 25: Hoare triple {1847#false} assume !(main_#t~post7#1 < 20);havoc main_#t~post7#1; {1847#false} is VALID [2022-02-20 17:31:08,916 INFO L272 TraceCheckUtils]: 26: Hoare triple {1847#false} 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)); {1847#false} is VALID [2022-02-20 17:31:08,916 INFO L290 TraceCheckUtils]: 27: Hoare triple {1847#false} ~cond := #in~cond; {1847#false} is VALID [2022-02-20 17:31:08,916 INFO L290 TraceCheckUtils]: 28: Hoare triple {1847#false} assume 0 == ~cond; {1847#false} is VALID [2022-02-20 17:31:08,916 INFO L290 TraceCheckUtils]: 29: Hoare triple {1847#false} assume !false; {1847#false} is VALID [2022-02-20 17:31:08,916 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-02-20 17:31:08,916 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 17:31:09,096 INFO L290 TraceCheckUtils]: 29: Hoare triple {1847#false} assume !false; {1847#false} is VALID [2022-02-20 17:31:09,097 INFO L290 TraceCheckUtils]: 28: Hoare triple {1847#false} assume 0 == ~cond; {1847#false} is VALID [2022-02-20 17:31:09,097 INFO L290 TraceCheckUtils]: 27: Hoare triple {1847#false} ~cond := #in~cond; {1847#false} is VALID [2022-02-20 17:31:09,097 INFO L272 TraceCheckUtils]: 26: Hoare triple {1847#false} 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)); {1847#false} is VALID [2022-02-20 17:31:09,097 INFO L290 TraceCheckUtils]: 25: Hoare triple {1847#false} assume !(main_#t~post7#1 < 20);havoc main_#t~post7#1; {1847#false} is VALID [2022-02-20 17:31:09,097 INFO L290 TraceCheckUtils]: 24: Hoare triple {1847#false} main_#t~post7#1 := ~counter~0;~counter~0 := 1 + main_#t~post7#1; {1847#false} is VALID [2022-02-20 17:31:09,098 INFO L290 TraceCheckUtils]: 23: Hoare triple {1959#(< |ULTIMATE.start_main_#t~post6#1| 20)} assume !(main_#t~post6#1 < 20);havoc main_#t~post6#1; {1847#false} is VALID [2022-02-20 17:31:09,098 INFO L290 TraceCheckUtils]: 22: Hoare triple {1963#(< ~counter~0 20)} main_#t~post6#1 := ~counter~0;~counter~0 := 1 + main_#t~post6#1; {1959#(< |ULTIMATE.start_main_#t~post6#1| 20)} is VALID [2022-02-20 17:31:09,099 INFO L290 TraceCheckUtils]: 21: Hoare triple {1963#(< ~counter~0 20)} 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; {1963#(< ~counter~0 20)} is VALID [2022-02-20 17:31:09,099 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {1846#true} {1963#(< ~counter~0 20)} #78#return; {1963#(< ~counter~0 20)} is VALID [2022-02-20 17:31:09,099 INFO L290 TraceCheckUtils]: 19: Hoare triple {1846#true} assume true; {1846#true} is VALID [2022-02-20 17:31:09,100 INFO L290 TraceCheckUtils]: 18: Hoare triple {1846#true} assume !(0 == ~cond); {1846#true} is VALID [2022-02-20 17:31:09,100 INFO L290 TraceCheckUtils]: 17: Hoare triple {1846#true} ~cond := #in~cond; {1846#true} is VALID [2022-02-20 17:31:09,100 INFO L272 TraceCheckUtils]: 16: Hoare triple {1963#(< ~counter~0 20)} call __VERIFIER_assert((if main_~d~0#1 % 4294967296 == main_~B~0#1 * main_~p~0#1 % 4294967296 then 1 else 0)); {1846#true} is VALID [2022-02-20 17:31:09,100 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {1846#true} {1963#(< ~counter~0 20)} #76#return; {1963#(< ~counter~0 20)} is VALID [2022-02-20 17:31:09,101 INFO L290 TraceCheckUtils]: 14: Hoare triple {1846#true} assume true; {1846#true} is VALID [2022-02-20 17:31:09,101 INFO L290 TraceCheckUtils]: 13: Hoare triple {1846#true} assume !(0 == ~cond); {1846#true} is VALID [2022-02-20 17:31:09,101 INFO L290 TraceCheckUtils]: 12: Hoare triple {1846#true} ~cond := #in~cond; {1846#true} is VALID [2022-02-20 17:31:09,101 INFO L272 TraceCheckUtils]: 11: Hoare triple {1963#(< ~counter~0 20)} call __VERIFIER_assert((if main_~r~0#1 % 4294967296 == main_~A~0#1 % 4294967296 then 1 else 0)); {1846#true} is VALID [2022-02-20 17:31:09,102 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1846#true} {1963#(< ~counter~0 20)} #74#return; {1963#(< ~counter~0 20)} is VALID [2022-02-20 17:31:09,102 INFO L290 TraceCheckUtils]: 9: Hoare triple {1846#true} assume true; {1846#true} is VALID [2022-02-20 17:31:09,102 INFO L290 TraceCheckUtils]: 8: Hoare triple {1846#true} assume !(0 == ~cond); {1846#true} is VALID [2022-02-20 17:31:09,103 INFO L290 TraceCheckUtils]: 7: Hoare triple {1846#true} ~cond := #in~cond; {1846#true} is VALID [2022-02-20 17:31:09,103 INFO L272 TraceCheckUtils]: 6: Hoare triple {1963#(< ~counter~0 20)} call __VERIFIER_assert((if 0 == main_~q~0#1 % 4294967296 then 1 else 0)); {1846#true} is VALID [2022-02-20 17:31:09,103 INFO L290 TraceCheckUtils]: 5: Hoare triple {1963#(< ~counter~0 20)} assume !!(main_#t~post6#1 < 20);havoc main_#t~post6#1; {1963#(< ~counter~0 20)} is VALID [2022-02-20 17:31:09,105 INFO L290 TraceCheckUtils]: 4: Hoare triple {2018#(< ~counter~0 19)} main_#t~post6#1 := ~counter~0;~counter~0 := 1 + main_#t~post6#1; {1963#(< ~counter~0 20)} is VALID [2022-02-20 17:31:09,105 INFO L290 TraceCheckUtils]: 3: Hoare triple {2018#(< ~counter~0 19)} assume { :end_inline_assume_abort_if_not } 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; {2018#(< ~counter~0 19)} is VALID [2022-02-20 17:31:09,106 INFO L290 TraceCheckUtils]: 2: Hoare triple {2018#(< ~counter~0 19)} assume !(0 == assume_abort_if_not_~cond#1); {2018#(< ~counter~0 19)} is VALID [2022-02-20 17:31:09,106 INFO L290 TraceCheckUtils]: 1: Hoare triple {2018#(< ~counter~0 19)} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~post6#1, main_#t~post7#1, main_~A~0#1, main_~B~0#1, main_~r~0#1, main_~d~0#1, main_~p~0#1, main_~q~0#1;havoc main_~A~0#1;havoc main_~B~0#1;havoc main_~r~0#1;havoc main_~d~0#1;havoc main_~p~0#1;havoc main_~q~0#1;main_~A~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;main_~B~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := (if main_~B~0#1 % 4294967296 >= 1 then 1 else 0);havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {2018#(< ~counter~0 19)} is VALID [2022-02-20 17:31:09,107 INFO L290 TraceCheckUtils]: 0: Hoare triple {1846#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);~counter~0 := 0; {2018#(< ~counter~0 19)} is VALID [2022-02-20 17:31:09,107 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-02-20 17:31:09,107 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 17:31:09,107 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1756639642] [2022-02-20 17:31:09,107 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-20 17:31:09,107 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2070913904] [2022-02-20 17:31:09,108 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2070913904] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 17:31:09,108 INFO L191 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-02-20 17:31:09,108 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5] total 8 [2022-02-20 17:31:09,108 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1096915320] [2022-02-20 17:31:09,108 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-02-20 17:31:09,109 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.625) internal successors, (29), 8 states have internal predecessors, (29), 3 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 30 [2022-02-20 17:31:09,109 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 17:31:09,109 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 3.625) internal successors, (29), 8 states have internal predecessors, (29), 3 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-02-20 17:31:09,154 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 42 edges. 42 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:31:09,155 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-02-20 17:31:09,155 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 17:31:09,155 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-02-20 17:31:09,155 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2022-02-20 17:31:09,156 INFO L87 Difference]: Start difference. First operand 70 states and 85 transitions. Second operand has 8 states, 8 states have (on average 3.625) internal successors, (29), 8 states have internal predecessors, (29), 3 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-02-20 17:31:09,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:31:09,837 INFO L93 Difference]: Finished difference Result 152 states and 188 transitions. [2022-02-20 17:31:09,837 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-02-20 17:31:09,837 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.625) internal successors, (29), 8 states have internal predecessors, (29), 3 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 30 [2022-02-20 17:31:09,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 17:31:09,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 3.625) internal successors, (29), 8 states have internal predecessors, (29), 3 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-02-20 17:31:09,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 125 transitions. [2022-02-20 17:31:09,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 3.625) internal successors, (29), 8 states have internal predecessors, (29), 3 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-02-20 17:31:09,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 125 transitions. [2022-02-20 17:31:09,842 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 125 transitions. [2022-02-20 17:31:09,946 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 125 edges. 125 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:31:09,949 INFO L225 Difference]: With dead ends: 152 [2022-02-20 17:31:09,949 INFO L226 Difference]: Without dead ends: 138 [2022-02-20 17:31:09,949 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2022-02-20 17:31:09,950 INFO L933 BasicCegarLoop]: 45 mSDtfsCounter, 69 mSDsluCounter, 157 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 202 SdHoareTripleChecker+Invalid, 94 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-02-20 17:31:09,950 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [69 Valid, 202 Invalid, 94 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-02-20 17:31:09,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2022-02-20 17:31:09,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 130. [2022-02-20 17:31:09,986 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 17:31:09,986 INFO L82 GeneralOperation]: Start isEquivalent. First operand 138 states. Second operand has 130 states, 85 states have (on average 1.223529411764706) internal successors, (104), 89 states have internal predecessors, (104), 28 states have call successors, (28), 16 states have call predecessors, (28), 16 states have return successors, (26), 24 states have call predecessors, (26), 26 states have call successors, (26) [2022-02-20 17:31:09,987 INFO L74 IsIncluded]: Start isIncluded. First operand 138 states. Second operand has 130 states, 85 states have (on average 1.223529411764706) internal successors, (104), 89 states have internal predecessors, (104), 28 states have call successors, (28), 16 states have call predecessors, (28), 16 states have return successors, (26), 24 states have call predecessors, (26), 26 states have call successors, (26) [2022-02-20 17:31:09,987 INFO L87 Difference]: Start difference. First operand 138 states. Second operand has 130 states, 85 states have (on average 1.223529411764706) internal successors, (104), 89 states have internal predecessors, (104), 28 states have call successors, (28), 16 states have call predecessors, (28), 16 states have return successors, (26), 24 states have call predecessors, (26), 26 states have call successors, (26) [2022-02-20 17:31:09,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:31:09,990 INFO L93 Difference]: Finished difference Result 138 states and 166 transitions. [2022-02-20 17:31:09,990 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 166 transitions. [2022-02-20 17:31:09,991 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:31:09,991 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:31:09,991 INFO L74 IsIncluded]: Start isIncluded. First operand has 130 states, 85 states have (on average 1.223529411764706) internal successors, (104), 89 states have internal predecessors, (104), 28 states have call successors, (28), 16 states have call predecessors, (28), 16 states have return successors, (26), 24 states have call predecessors, (26), 26 states have call successors, (26) Second operand 138 states. [2022-02-20 17:31:09,991 INFO L87 Difference]: Start difference. First operand has 130 states, 85 states have (on average 1.223529411764706) internal successors, (104), 89 states have internal predecessors, (104), 28 states have call successors, (28), 16 states have call predecessors, (28), 16 states have return successors, (26), 24 states have call predecessors, (26), 26 states have call successors, (26) Second operand 138 states. [2022-02-20 17:31:09,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:31:09,995 INFO L93 Difference]: Finished difference Result 138 states and 166 transitions. [2022-02-20 17:31:09,995 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 166 transitions. [2022-02-20 17:31:09,995 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:31:09,995 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:31:09,995 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 17:31:09,995 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 17:31:09,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 130 states, 85 states have (on average 1.223529411764706) internal successors, (104), 89 states have internal predecessors, (104), 28 states have call successors, (28), 16 states have call predecessors, (28), 16 states have return successors, (26), 24 states have call predecessors, (26), 26 states have call successors, (26) [2022-02-20 17:31:09,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 158 transitions. [2022-02-20 17:31:09,999 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 158 transitions. Word has length 30 [2022-02-20 17:31:09,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 17:31:09,999 INFO L470 AbstractCegarLoop]: Abstraction has 130 states and 158 transitions. [2022-02-20 17:31:09,999 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.625) internal successors, (29), 8 states have internal predecessors, (29), 3 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-02-20 17:31:09,999 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 158 transitions. [2022-02-20 17:31:09,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-02-20 17:31:10,000 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:31:10,000 INFO L514 BasicCegarLoop]: trace histogram [6, 5, 5, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 17:31:10,017 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:10,216 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 17:31:10,217 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 17:31:10,217 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:31:10,217 INFO L85 PathProgramCache]: Analyzing trace with hash 1884102282, now seen corresponding path program 1 times [2022-02-20 17:31:10,217 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 17:31:10,217 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [487968567] [2022-02-20 17:31:10,217 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:31:10,217 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 17:31:10,230 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-20 17:31:10,230 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1217957572] [2022-02-20 17:31:10,230 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:31:10,230 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 17:31:10,230 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 17:31:10,231 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:10,233 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-02-20 17:31:10,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:31:10,331 INFO L263 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 23 conjunts are in the unsatisfiable core [2022-02-20 17:31:10,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:31:10,346 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 17:31:11,357 INFO L290 TraceCheckUtils]: 0: Hoare triple {2697#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);~counter~0 := 0; {2697#true} is VALID [2022-02-20 17:31:11,358 INFO L290 TraceCheckUtils]: 1: Hoare triple {2697#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~post6#1, main_#t~post7#1, main_~A~0#1, main_~B~0#1, main_~r~0#1, main_~d~0#1, main_~p~0#1, main_~q~0#1;havoc main_~A~0#1;havoc main_~B~0#1;havoc main_~r~0#1;havoc main_~d~0#1;havoc main_~p~0#1;havoc main_~q~0#1;main_~A~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;main_~B~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := (if main_~B~0#1 % 4294967296 >= 1 then 1 else 0);havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {2705#(or (and (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (<= 1 (mod |ULTIMATE.start_main_~B~0#1| 4294967296))) (and (not (<= 1 (mod |ULTIMATE.start_main_~B~0#1| 4294967296))) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)))} is VALID [2022-02-20 17:31:11,358 INFO L290 TraceCheckUtils]: 2: Hoare triple {2705#(or (and (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (<= 1 (mod |ULTIMATE.start_main_~B~0#1| 4294967296))) (and (not (<= 1 (mod |ULTIMATE.start_main_~B~0#1| 4294967296))) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)))} assume !(0 == assume_abort_if_not_~cond#1); {2709#(<= 1 (mod |ULTIMATE.start_main_~B~0#1| 4294967296))} is VALID [2022-02-20 17:31:11,359 INFO L290 TraceCheckUtils]: 3: Hoare triple {2709#(<= 1 (mod |ULTIMATE.start_main_~B~0#1| 4294967296))} assume { :end_inline_assume_abort_if_not } 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; {2713#(and (= |ULTIMATE.start_main_~p~0#1| 1) (<= 1 (mod |ULTIMATE.start_main_~B~0#1| 4294967296)) (= |ULTIMATE.start_main_~B~0#1| |ULTIMATE.start_main_~d~0#1|) (= |ULTIMATE.start_main_~A~0#1| |ULTIMATE.start_main_~r~0#1|))} is VALID [2022-02-20 17:31:11,359 INFO L290 TraceCheckUtils]: 4: Hoare triple {2713#(and (= |ULTIMATE.start_main_~p~0#1| 1) (<= 1 (mod |ULTIMATE.start_main_~B~0#1| 4294967296)) (= |ULTIMATE.start_main_~B~0#1| |ULTIMATE.start_main_~d~0#1|) (= |ULTIMATE.start_main_~A~0#1| |ULTIMATE.start_main_~r~0#1|))} main_#t~post6#1 := ~counter~0;~counter~0 := 1 + main_#t~post6#1; {2713#(and (= |ULTIMATE.start_main_~p~0#1| 1) (<= 1 (mod |ULTIMATE.start_main_~B~0#1| 4294967296)) (= |ULTIMATE.start_main_~B~0#1| |ULTIMATE.start_main_~d~0#1|) (= |ULTIMATE.start_main_~A~0#1| |ULTIMATE.start_main_~r~0#1|))} is VALID [2022-02-20 17:31:11,360 INFO L290 TraceCheckUtils]: 5: Hoare triple {2713#(and (= |ULTIMATE.start_main_~p~0#1| 1) (<= 1 (mod |ULTIMATE.start_main_~B~0#1| 4294967296)) (= |ULTIMATE.start_main_~B~0#1| |ULTIMATE.start_main_~d~0#1|) (= |ULTIMATE.start_main_~A~0#1| |ULTIMATE.start_main_~r~0#1|))} assume !!(main_#t~post6#1 < 20);havoc main_#t~post6#1; {2713#(and (= |ULTIMATE.start_main_~p~0#1| 1) (<= 1 (mod |ULTIMATE.start_main_~B~0#1| 4294967296)) (= |ULTIMATE.start_main_~B~0#1| |ULTIMATE.start_main_~d~0#1|) (= |ULTIMATE.start_main_~A~0#1| |ULTIMATE.start_main_~r~0#1|))} is VALID [2022-02-20 17:31:11,360 INFO L272 TraceCheckUtils]: 6: Hoare triple {2713#(and (= |ULTIMATE.start_main_~p~0#1| 1) (<= 1 (mod |ULTIMATE.start_main_~B~0#1| 4294967296)) (= |ULTIMATE.start_main_~B~0#1| |ULTIMATE.start_main_~d~0#1|) (= |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)); {2697#true} is VALID [2022-02-20 17:31:11,360 INFO L290 TraceCheckUtils]: 7: Hoare triple {2697#true} ~cond := #in~cond; {2697#true} is VALID [2022-02-20 17:31:11,360 INFO L290 TraceCheckUtils]: 8: Hoare triple {2697#true} assume !(0 == ~cond); {2697#true} is VALID [2022-02-20 17:31:11,360 INFO L290 TraceCheckUtils]: 9: Hoare triple {2697#true} assume true; {2697#true} is VALID [2022-02-20 17:31:11,361 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2697#true} {2713#(and (= |ULTIMATE.start_main_~p~0#1| 1) (<= 1 (mod |ULTIMATE.start_main_~B~0#1| 4294967296)) (= |ULTIMATE.start_main_~B~0#1| |ULTIMATE.start_main_~d~0#1|) (= |ULTIMATE.start_main_~A~0#1| |ULTIMATE.start_main_~r~0#1|))} #74#return; {2713#(and (= |ULTIMATE.start_main_~p~0#1| 1) (<= 1 (mod |ULTIMATE.start_main_~B~0#1| 4294967296)) (= |ULTIMATE.start_main_~B~0#1| |ULTIMATE.start_main_~d~0#1|) (= |ULTIMATE.start_main_~A~0#1| |ULTIMATE.start_main_~r~0#1|))} is VALID [2022-02-20 17:31:11,361 INFO L272 TraceCheckUtils]: 11: Hoare triple {2713#(and (= |ULTIMATE.start_main_~p~0#1| 1) (<= 1 (mod |ULTIMATE.start_main_~B~0#1| 4294967296)) (= |ULTIMATE.start_main_~B~0#1| |ULTIMATE.start_main_~d~0#1|) (= |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)); {2697#true} is VALID [2022-02-20 17:31:11,362 INFO L290 TraceCheckUtils]: 12: Hoare triple {2697#true} ~cond := #in~cond; {2741#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-02-20 17:31:11,362 INFO L290 TraceCheckUtils]: 13: Hoare triple {2741#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {2745#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-02-20 17:31:11,365 INFO L290 TraceCheckUtils]: 14: Hoare triple {2745#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {2745#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-02-20 17:31:11,366 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {2745#(not (= |__VERIFIER_assert_#in~cond| 0))} {2713#(and (= |ULTIMATE.start_main_~p~0#1| 1) (<= 1 (mod |ULTIMATE.start_main_~B~0#1| 4294967296)) (= |ULTIMATE.start_main_~B~0#1| |ULTIMATE.start_main_~d~0#1|) (= |ULTIMATE.start_main_~A~0#1| |ULTIMATE.start_main_~r~0#1|))} #76#return; {2752#(and (= |ULTIMATE.start_main_~p~0#1| 1) (<= 1 (mod |ULTIMATE.start_main_~B~0#1| 4294967296)) (= |ULTIMATE.start_main_~B~0#1| |ULTIMATE.start_main_~d~0#1|))} is VALID [2022-02-20 17:31:11,367 INFO L272 TraceCheckUtils]: 16: Hoare triple {2752#(and (= |ULTIMATE.start_main_~p~0#1| 1) (<= 1 (mod |ULTIMATE.start_main_~B~0#1| 4294967296)) (= |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)); {2697#true} is VALID [2022-02-20 17:31:11,367 INFO L290 TraceCheckUtils]: 17: Hoare triple {2697#true} ~cond := #in~cond; {2697#true} is VALID [2022-02-20 17:31:11,367 INFO L290 TraceCheckUtils]: 18: Hoare triple {2697#true} assume !(0 == ~cond); {2697#true} is VALID [2022-02-20 17:31:11,367 INFO L290 TraceCheckUtils]: 19: Hoare triple {2697#true} assume true; {2697#true} is VALID [2022-02-20 17:31:11,367 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {2697#true} {2752#(and (= |ULTIMATE.start_main_~p~0#1| 1) (<= 1 (mod |ULTIMATE.start_main_~B~0#1| 4294967296)) (= |ULTIMATE.start_main_~B~0#1| |ULTIMATE.start_main_~d~0#1|))} #78#return; {2752#(and (= |ULTIMATE.start_main_~p~0#1| 1) (<= 1 (mod |ULTIMATE.start_main_~B~0#1| 4294967296)) (= |ULTIMATE.start_main_~B~0#1| |ULTIMATE.start_main_~d~0#1|))} is VALID [2022-02-20 17:31:11,368 INFO L290 TraceCheckUtils]: 21: Hoare triple {2752#(and (= |ULTIMATE.start_main_~p~0#1| 1) (<= 1 (mod |ULTIMATE.start_main_~B~0#1| 4294967296)) (= |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; {2771#(and (= |ULTIMATE.start_main_~d~0#1| (* 2 |ULTIMATE.start_main_~B~0#1|)) (<= 1 (mod |ULTIMATE.start_main_~B~0#1| 4294967296)) (= 2 |ULTIMATE.start_main_~p~0#1|))} is VALID [2022-02-20 17:31:11,369 INFO L290 TraceCheckUtils]: 22: Hoare triple {2771#(and (= |ULTIMATE.start_main_~d~0#1| (* 2 |ULTIMATE.start_main_~B~0#1|)) (<= 1 (mod |ULTIMATE.start_main_~B~0#1| 4294967296)) (= 2 |ULTIMATE.start_main_~p~0#1|))} main_#t~post6#1 := ~counter~0;~counter~0 := 1 + main_#t~post6#1; {2771#(and (= |ULTIMATE.start_main_~d~0#1| (* 2 |ULTIMATE.start_main_~B~0#1|)) (<= 1 (mod |ULTIMATE.start_main_~B~0#1| 4294967296)) (= 2 |ULTIMATE.start_main_~p~0#1|))} is VALID [2022-02-20 17:31:11,369 INFO L290 TraceCheckUtils]: 23: Hoare triple {2771#(and (= |ULTIMATE.start_main_~d~0#1| (* 2 |ULTIMATE.start_main_~B~0#1|)) (<= 1 (mod |ULTIMATE.start_main_~B~0#1| 4294967296)) (= 2 |ULTIMATE.start_main_~p~0#1|))} assume !!(main_#t~post6#1 < 20);havoc main_#t~post6#1; {2771#(and (= |ULTIMATE.start_main_~d~0#1| (* 2 |ULTIMATE.start_main_~B~0#1|)) (<= 1 (mod |ULTIMATE.start_main_~B~0#1| 4294967296)) (= 2 |ULTIMATE.start_main_~p~0#1|))} is VALID [2022-02-20 17:31:11,369 INFO L272 TraceCheckUtils]: 24: Hoare triple {2771#(and (= |ULTIMATE.start_main_~d~0#1| (* 2 |ULTIMATE.start_main_~B~0#1|)) (<= 1 (mod |ULTIMATE.start_main_~B~0#1| 4294967296)) (= 2 |ULTIMATE.start_main_~p~0#1|))} call __VERIFIER_assert((if 0 == main_~q~0#1 % 4294967296 then 1 else 0)); {2697#true} is VALID [2022-02-20 17:31:11,369 INFO L290 TraceCheckUtils]: 25: Hoare triple {2697#true} ~cond := #in~cond; {2697#true} is VALID [2022-02-20 17:31:11,369 INFO L290 TraceCheckUtils]: 26: Hoare triple {2697#true} assume !(0 == ~cond); {2697#true} is VALID [2022-02-20 17:31:11,370 INFO L290 TraceCheckUtils]: 27: Hoare triple {2697#true} assume true; {2697#true} is VALID [2022-02-20 17:31:11,370 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {2697#true} {2771#(and (= |ULTIMATE.start_main_~d~0#1| (* 2 |ULTIMATE.start_main_~B~0#1|)) (<= 1 (mod |ULTIMATE.start_main_~B~0#1| 4294967296)) (= 2 |ULTIMATE.start_main_~p~0#1|))} #74#return; {2771#(and (= |ULTIMATE.start_main_~d~0#1| (* 2 |ULTIMATE.start_main_~B~0#1|)) (<= 1 (mod |ULTIMATE.start_main_~B~0#1| 4294967296)) (= 2 |ULTIMATE.start_main_~p~0#1|))} is VALID [2022-02-20 17:31:11,370 INFO L272 TraceCheckUtils]: 29: Hoare triple {2771#(and (= |ULTIMATE.start_main_~d~0#1| (* 2 |ULTIMATE.start_main_~B~0#1|)) (<= 1 (mod |ULTIMATE.start_main_~B~0#1| 4294967296)) (= 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)); {2697#true} is VALID [2022-02-20 17:31:11,370 INFO L290 TraceCheckUtils]: 30: Hoare triple {2697#true} ~cond := #in~cond; {2697#true} is VALID [2022-02-20 17:31:11,371 INFO L290 TraceCheckUtils]: 31: Hoare triple {2697#true} assume !(0 == ~cond); {2697#true} is VALID [2022-02-20 17:31:11,371 INFO L290 TraceCheckUtils]: 32: Hoare triple {2697#true} assume true; {2697#true} is VALID [2022-02-20 17:31:11,371 INFO L284 TraceCheckUtils]: 33: Hoare quadruple {2697#true} {2771#(and (= |ULTIMATE.start_main_~d~0#1| (* 2 |ULTIMATE.start_main_~B~0#1|)) (<= 1 (mod |ULTIMATE.start_main_~B~0#1| 4294967296)) (= 2 |ULTIMATE.start_main_~p~0#1|))} #76#return; {2771#(and (= |ULTIMATE.start_main_~d~0#1| (* 2 |ULTIMATE.start_main_~B~0#1|)) (<= 1 (mod |ULTIMATE.start_main_~B~0#1| 4294967296)) (= 2 |ULTIMATE.start_main_~p~0#1|))} is VALID [2022-02-20 17:31:11,375 INFO L272 TraceCheckUtils]: 34: Hoare triple {2771#(and (= |ULTIMATE.start_main_~d~0#1| (* 2 |ULTIMATE.start_main_~B~0#1|)) (<= 1 (mod |ULTIMATE.start_main_~B~0#1| 4294967296)) (= 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)); {2811#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-02-20 17:31:11,376 INFO L290 TraceCheckUtils]: 35: Hoare triple {2811#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {2815#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-02-20 17:31:11,376 INFO L290 TraceCheckUtils]: 36: Hoare triple {2815#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2698#false} is VALID [2022-02-20 17:31:11,376 INFO L290 TraceCheckUtils]: 37: Hoare triple {2698#false} assume !false; {2698#false} is VALID [2022-02-20 17:31:11,376 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 12 proven. 15 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2022-02-20 17:31:11,377 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 17:31:14,033 INFO L290 TraceCheckUtils]: 37: Hoare triple {2698#false} assume !false; {2698#false} is VALID [2022-02-20 17:31:14,033 INFO L290 TraceCheckUtils]: 36: Hoare triple {2815#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2698#false} is VALID [2022-02-20 17:31:14,034 INFO L290 TraceCheckUtils]: 35: Hoare triple {2811#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {2815#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-02-20 17:31:14,034 INFO L272 TraceCheckUtils]: 34: Hoare triple {2831#(= (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)); {2811#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-02-20 17:31:14,035 INFO L284 TraceCheckUtils]: 33: Hoare quadruple {2697#true} {2831#(= (mod (* |ULTIMATE.start_main_~B~0#1| |ULTIMATE.start_main_~p~0#1|) 4294967296) (mod |ULTIMATE.start_main_~d~0#1| 4294967296))} #76#return; {2831#(= (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:14,035 INFO L290 TraceCheckUtils]: 32: Hoare triple {2697#true} assume true; {2697#true} is VALID [2022-02-20 17:31:14,035 INFO L290 TraceCheckUtils]: 31: Hoare triple {2697#true} assume !(0 == ~cond); {2697#true} is VALID [2022-02-20 17:31:14,035 INFO L290 TraceCheckUtils]: 30: Hoare triple {2697#true} ~cond := #in~cond; {2697#true} is VALID [2022-02-20 17:31:14,035 INFO L272 TraceCheckUtils]: 29: Hoare triple {2831#(= (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)); {2697#true} is VALID [2022-02-20 17:31:14,036 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {2697#true} {2831#(= (mod (* |ULTIMATE.start_main_~B~0#1| |ULTIMATE.start_main_~p~0#1|) 4294967296) (mod |ULTIMATE.start_main_~d~0#1| 4294967296))} #74#return; {2831#(= (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:14,036 INFO L290 TraceCheckUtils]: 27: Hoare triple {2697#true} assume true; {2697#true} is VALID [2022-02-20 17:31:14,036 INFO L290 TraceCheckUtils]: 26: Hoare triple {2697#true} assume !(0 == ~cond); {2697#true} is VALID [2022-02-20 17:31:14,036 INFO L290 TraceCheckUtils]: 25: Hoare triple {2697#true} ~cond := #in~cond; {2697#true} is VALID [2022-02-20 17:31:14,036 INFO L272 TraceCheckUtils]: 24: Hoare triple {2831#(= (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)); {2697#true} is VALID [2022-02-20 17:31:14,037 INFO L290 TraceCheckUtils]: 23: Hoare triple {2831#(= (mod (* |ULTIMATE.start_main_~B~0#1| |ULTIMATE.start_main_~p~0#1|) 4294967296) (mod |ULTIMATE.start_main_~d~0#1| 4294967296))} assume !!(main_#t~post6#1 < 20);havoc main_#t~post6#1; {2831#(= (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:14,037 INFO L290 TraceCheckUtils]: 22: Hoare triple {2831#(= (mod (* |ULTIMATE.start_main_~B~0#1| |ULTIMATE.start_main_~p~0#1|) 4294967296) (mod |ULTIMATE.start_main_~d~0#1| 4294967296))} main_#t~post6#1 := ~counter~0;~counter~0 := 1 + main_#t~post6#1; {2831#(= (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:16,041 WARN L290 TraceCheckUtils]: 21: Hoare triple {2871#(= (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; {2831#(= (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:16,043 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {2697#true} {2871#(= (mod (* |ULTIMATE.start_main_~B~0#1| (* 2 |ULTIMATE.start_main_~p~0#1|)) 4294967296) (mod (* 2 |ULTIMATE.start_main_~d~0#1|) 4294967296))} #78#return; {2871#(= (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:16,043 INFO L290 TraceCheckUtils]: 19: Hoare triple {2697#true} assume true; {2697#true} is VALID [2022-02-20 17:31:16,043 INFO L290 TraceCheckUtils]: 18: Hoare triple {2697#true} assume !(0 == ~cond); {2697#true} is VALID [2022-02-20 17:31:16,044 INFO L290 TraceCheckUtils]: 17: Hoare triple {2697#true} ~cond := #in~cond; {2697#true} is VALID [2022-02-20 17:31:16,044 INFO L272 TraceCheckUtils]: 16: Hoare triple {2871#(= (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)); {2697#true} is VALID [2022-02-20 17:31:16,052 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {2745#(not (= |__VERIFIER_assert_#in~cond| 0))} {2890#(or (= (mod (* |ULTIMATE.start_main_~B~0#1| (* 2 |ULTIMATE.start_main_~p~0#1|)) 4294967296) (mod (* 2 |ULTIMATE.start_main_~d~0#1|) 4294967296)) (not (= (mod |ULTIMATE.start_main_~r~0#1| 4294967296) (mod |ULTIMATE.start_main_~A~0#1| 4294967296))))} #76#return; {2871#(= (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:16,052 INFO L290 TraceCheckUtils]: 14: Hoare triple {2745#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {2745#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-02-20 17:31:16,053 INFO L290 TraceCheckUtils]: 13: Hoare triple {2900#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {2745#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-02-20 17:31:16,053 INFO L290 TraceCheckUtils]: 12: Hoare triple {2697#true} ~cond := #in~cond; {2900#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-02-20 17:31:16,053 INFO L272 TraceCheckUtils]: 11: Hoare triple {2890#(or (= (mod (* |ULTIMATE.start_main_~B~0#1| (* 2 |ULTIMATE.start_main_~p~0#1|)) 4294967296) (mod (* 2 |ULTIMATE.start_main_~d~0#1|) 4294967296)) (not (= (mod |ULTIMATE.start_main_~r~0#1| 4294967296) (mod |ULTIMATE.start_main_~A~0#1| 4294967296))))} call __VERIFIER_assert((if main_~r~0#1 % 4294967296 == main_~A~0#1 % 4294967296 then 1 else 0)); {2697#true} is VALID [2022-02-20 17:31:16,054 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2697#true} {2890#(or (= (mod (* |ULTIMATE.start_main_~B~0#1| (* 2 |ULTIMATE.start_main_~p~0#1|)) 4294967296) (mod (* 2 |ULTIMATE.start_main_~d~0#1|) 4294967296)) (not (= (mod |ULTIMATE.start_main_~r~0#1| 4294967296) (mod |ULTIMATE.start_main_~A~0#1| 4294967296))))} #74#return; {2890#(or (= (mod (* |ULTIMATE.start_main_~B~0#1| (* 2 |ULTIMATE.start_main_~p~0#1|)) 4294967296) (mod (* 2 |ULTIMATE.start_main_~d~0#1|) 4294967296)) (not (= (mod |ULTIMATE.start_main_~r~0#1| 4294967296) (mod |ULTIMATE.start_main_~A~0#1| 4294967296))))} is VALID [2022-02-20 17:31:16,054 INFO L290 TraceCheckUtils]: 9: Hoare triple {2697#true} assume true; {2697#true} is VALID [2022-02-20 17:31:16,054 INFO L290 TraceCheckUtils]: 8: Hoare triple {2697#true} assume !(0 == ~cond); {2697#true} is VALID [2022-02-20 17:31:16,054 INFO L290 TraceCheckUtils]: 7: Hoare triple {2697#true} ~cond := #in~cond; {2697#true} is VALID [2022-02-20 17:31:16,054 INFO L272 TraceCheckUtils]: 6: Hoare triple {2890#(or (= (mod (* |ULTIMATE.start_main_~B~0#1| (* 2 |ULTIMATE.start_main_~p~0#1|)) 4294967296) (mod (* 2 |ULTIMATE.start_main_~d~0#1|) 4294967296)) (not (= (mod |ULTIMATE.start_main_~r~0#1| 4294967296) (mod |ULTIMATE.start_main_~A~0#1| 4294967296))))} call __VERIFIER_assert((if 0 == main_~q~0#1 % 4294967296 then 1 else 0)); {2697#true} is VALID [2022-02-20 17:31:16,055 INFO L290 TraceCheckUtils]: 5: Hoare triple {2890#(or (= (mod (* |ULTIMATE.start_main_~B~0#1| (* 2 |ULTIMATE.start_main_~p~0#1|)) 4294967296) (mod (* 2 |ULTIMATE.start_main_~d~0#1|) 4294967296)) (not (= (mod |ULTIMATE.start_main_~r~0#1| 4294967296) (mod |ULTIMATE.start_main_~A~0#1| 4294967296))))} assume !!(main_#t~post6#1 < 20);havoc main_#t~post6#1; {2890#(or (= (mod (* |ULTIMATE.start_main_~B~0#1| (* 2 |ULTIMATE.start_main_~p~0#1|)) 4294967296) (mod (* 2 |ULTIMATE.start_main_~d~0#1|) 4294967296)) (not (= (mod |ULTIMATE.start_main_~r~0#1| 4294967296) (mod |ULTIMATE.start_main_~A~0#1| 4294967296))))} is VALID [2022-02-20 17:31:16,055 INFO L290 TraceCheckUtils]: 4: Hoare triple {2890#(or (= (mod (* |ULTIMATE.start_main_~B~0#1| (* 2 |ULTIMATE.start_main_~p~0#1|)) 4294967296) (mod (* 2 |ULTIMATE.start_main_~d~0#1|) 4294967296)) (not (= (mod |ULTIMATE.start_main_~r~0#1| 4294967296) (mod |ULTIMATE.start_main_~A~0#1| 4294967296))))} main_#t~post6#1 := ~counter~0;~counter~0 := 1 + main_#t~post6#1; {2890#(or (= (mod (* |ULTIMATE.start_main_~B~0#1| (* 2 |ULTIMATE.start_main_~p~0#1|)) 4294967296) (mod (* 2 |ULTIMATE.start_main_~d~0#1|) 4294967296)) (not (= (mod |ULTIMATE.start_main_~r~0#1| 4294967296) (mod |ULTIMATE.start_main_~A~0#1| 4294967296))))} is VALID [2022-02-20 17:31:16,056 INFO L290 TraceCheckUtils]: 3: Hoare triple {2697#true} assume { :end_inline_assume_abort_if_not } 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; {2890#(or (= (mod (* |ULTIMATE.start_main_~B~0#1| (* 2 |ULTIMATE.start_main_~p~0#1|)) 4294967296) (mod (* 2 |ULTIMATE.start_main_~d~0#1|) 4294967296)) (not (= (mod |ULTIMATE.start_main_~r~0#1| 4294967296) (mod |ULTIMATE.start_main_~A~0#1| 4294967296))))} is VALID [2022-02-20 17:31:16,056 INFO L290 TraceCheckUtils]: 2: Hoare triple {2697#true} assume !(0 == assume_abort_if_not_~cond#1); {2697#true} is VALID [2022-02-20 17:31:16,056 INFO L290 TraceCheckUtils]: 1: Hoare triple {2697#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~post6#1, main_#t~post7#1, main_~A~0#1, main_~B~0#1, main_~r~0#1, main_~d~0#1, main_~p~0#1, main_~q~0#1;havoc main_~A~0#1;havoc main_~B~0#1;havoc main_~r~0#1;havoc main_~d~0#1;havoc main_~p~0#1;havoc main_~q~0#1;main_~A~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;main_~B~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := (if main_~B~0#1 % 4294967296 >= 1 then 1 else 0);havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {2697#true} is VALID [2022-02-20 17:31:16,056 INFO L290 TraceCheckUtils]: 0: Hoare triple {2697#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);~counter~0 := 0; {2697#true} is VALID [2022-02-20 17:31:16,056 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 17 proven. 10 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2022-02-20 17:31:16,056 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 17:31:16,057 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [487968567] [2022-02-20 17:31:16,057 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-20 17:31:16,057 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1217957572] [2022-02-20 17:31:16,057 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1217957572] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 17:31:16,057 INFO L191 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-02-20 17:31:16,057 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9] total 15 [2022-02-20 17:31:16,057 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [654144022] [2022-02-20 17:31:16,057 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-02-20 17:31:16,057 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 1.8666666666666667) internal successors, (28), 12 states have internal predecessors, (28), 6 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (10), 6 states have call predecessors, (10), 6 states have call successors, (10) Word has length 38 [2022-02-20 17:31:16,058 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 17:31:16,058 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 15 states, 15 states have (on average 1.8666666666666667) internal successors, (28), 12 states have internal predecessors, (28), 6 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (10), 6 states have call predecessors, (10), 6 states have call successors, (10) [2022-02-20 17:31:18,756 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 50 edges. 49 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-02-20 17:31:18,756 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-02-20 17:31:18,756 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 17:31:18,756 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-02-20 17:31:18,756 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=163, Unknown=0, NotChecked=0, Total=210 [2022-02-20 17:31:18,757 INFO L87 Difference]: Start difference. First operand 130 states and 158 transitions. Second operand has 15 states, 15 states have (on average 1.8666666666666667) internal successors, (28), 12 states have internal predecessors, (28), 6 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (10), 6 states have call predecessors, (10), 6 states have call successors, (10) [2022-02-20 17:31:24,314 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-02-20 17:31:27,380 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.03s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-02-20 17:31:31,615 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:33,628 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:40,686 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.42s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-02-20 17:31:44,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:31:44,660 INFO L93 Difference]: Finished difference Result 166 states and 208 transitions. [2022-02-20 17:31:44,660 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-02-20 17:31:44,660 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 1.8666666666666667) internal successors, (28), 12 states have internal predecessors, (28), 6 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (10), 6 states have call predecessors, (10), 6 states have call successors, (10) Word has length 38 [2022-02-20 17:31:44,661 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 17:31:44,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 15 states have (on average 1.8666666666666667) internal successors, (28), 12 states have internal predecessors, (28), 6 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (10), 6 states have call predecessors, (10), 6 states have call successors, (10) [2022-02-20 17:31:44,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 100 transitions. [2022-02-20 17:31:44,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 15 states have (on average 1.8666666666666667) internal successors, (28), 12 states have internal predecessors, (28), 6 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (10), 6 states have call predecessors, (10), 6 states have call successors, (10) [2022-02-20 17:31:44,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 100 transitions. [2022-02-20 17:31:44,670 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states and 100 transitions. [2022-02-20 17:31:48,129 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 100 edges. 99 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-02-20 17:31:48,132 INFO L225 Difference]: With dead ends: 166 [2022-02-20 17:31:48,132 INFO L226 Difference]: Without dead ends: 158 [2022-02-20 17:31:48,132 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 61 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=93, Invalid=327, Unknown=0, NotChecked=0, Total=420 [2022-02-20 17:31:48,133 INFO L933 BasicCegarLoop]: 34 mSDtfsCounter, 86 mSDsluCounter, 179 mSDsCounter, 0 mSdLazyCounter, 239 mSolverCounterSat, 84 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 15.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 87 SdHoareTripleChecker+Valid, 213 SdHoareTripleChecker+Invalid, 326 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 84 IncrementalHoareTripleChecker+Valid, 239 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 15.4s IncrementalHoareTripleChecker+Time [2022-02-20 17:31:48,133 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [87 Valid, 213 Invalid, 326 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [84 Valid, 239 Invalid, 3 Unknown, 0 Unchecked, 15.4s Time] [2022-02-20 17:31:48,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2022-02-20 17:31:48,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 147. [2022-02-20 17:31:48,187 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 17:31:48,188 INFO L82 GeneralOperation]: Start isEquivalent. First operand 158 states. Second operand has 147 states, 96 states have (on average 1.2083333333333333) internal successors, (116), 101 states have internal predecessors, (116), 32 states have call successors, (32), 18 states have call predecessors, (32), 18 states have return successors, (30), 27 states have call predecessors, (30), 30 states have call successors, (30) [2022-02-20 17:31:48,188 INFO L74 IsIncluded]: Start isIncluded. First operand 158 states. Second operand has 147 states, 96 states have (on average 1.2083333333333333) internal successors, (116), 101 states have internal predecessors, (116), 32 states have call successors, (32), 18 states have call predecessors, (32), 18 states have return successors, (30), 27 states have call predecessors, (30), 30 states have call successors, (30) [2022-02-20 17:31:48,188 INFO L87 Difference]: Start difference. First operand 158 states. Second operand has 147 states, 96 states have (on average 1.2083333333333333) internal successors, (116), 101 states have internal predecessors, (116), 32 states have call successors, (32), 18 states have call predecessors, (32), 18 states have return successors, (30), 27 states have call predecessors, (30), 30 states have call successors, (30) [2022-02-20 17:31:48,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:31:48,192 INFO L93 Difference]: Finished difference Result 158 states and 196 transitions. [2022-02-20 17:31:48,192 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 196 transitions. [2022-02-20 17:31:48,192 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:31:48,192 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:31:48,192 INFO L74 IsIncluded]: Start isIncluded. First operand has 147 states, 96 states have (on average 1.2083333333333333) internal successors, (116), 101 states have internal predecessors, (116), 32 states have call successors, (32), 18 states have call predecessors, (32), 18 states have return successors, (30), 27 states have call predecessors, (30), 30 states have call successors, (30) Second operand 158 states. [2022-02-20 17:31:48,193 INFO L87 Difference]: Start difference. First operand has 147 states, 96 states have (on average 1.2083333333333333) internal successors, (116), 101 states have internal predecessors, (116), 32 states have call successors, (32), 18 states have call predecessors, (32), 18 states have return successors, (30), 27 states have call predecessors, (30), 30 states have call successors, (30) Second operand 158 states. [2022-02-20 17:31:48,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:31:48,195 INFO L93 Difference]: Finished difference Result 158 states and 196 transitions. [2022-02-20 17:31:48,195 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 196 transitions. [2022-02-20 17:31:48,216 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:31:48,216 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:31:48,217 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 17:31:48,217 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 17:31:48,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 147 states, 96 states have (on average 1.2083333333333333) internal successors, (116), 101 states have internal predecessors, (116), 32 states have call successors, (32), 18 states have call predecessors, (32), 18 states have return successors, (30), 27 states have call predecessors, (30), 30 states have call successors, (30) [2022-02-20 17:31:48,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 178 transitions. [2022-02-20 17:31:48,220 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 178 transitions. Word has length 38 [2022-02-20 17:31:48,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 17:31:48,220 INFO L470 AbstractCegarLoop]: Abstraction has 147 states and 178 transitions. [2022-02-20 17:31:48,220 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 1.8666666666666667) internal successors, (28), 12 states have internal predecessors, (28), 6 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (10), 6 states have call predecessors, (10), 6 states have call successors, (10) [2022-02-20 17:31:48,220 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 178 transitions. [2022-02-20 17:31:48,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-02-20 17:31:48,221 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:31:48,221 INFO L514 BasicCegarLoop]: trace histogram [6, 5, 5, 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] [2022-02-20 17:31:48,225 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2022-02-20 17:31:48,425 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 17:31:48,425 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 17:31:48,426 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:31:48,426 INFO L85 PathProgramCache]: Analyzing trace with hash -1109899640, now seen corresponding path program 1 times [2022-02-20 17:31:48,426 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 17:31:48,426 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [587081224] [2022-02-20 17:31:48,426 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:31:48,426 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 17:31:48,436 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-20 17:31:48,436 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1880169050] [2022-02-20 17:31:48,436 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:31:48,436 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 17:31:48,436 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 17:31:48,438 INFO L229 MonitoredProcess]: Starting monitored process 7 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,438 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-02-20 17:31:48,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:31:48,495 INFO L263 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 7 conjunts are in the unsatisfiable core [2022-02-20 17:31:48,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:31:48,507 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 17:31:48,690 INFO L290 TraceCheckUtils]: 0: Hoare triple {3701#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);~counter~0 := 0; {3706#(<= ~counter~0 0)} is VALID [2022-02-20 17:31:48,691 INFO L290 TraceCheckUtils]: 1: Hoare triple {3706#(<= ~counter~0 0)} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~post6#1, main_#t~post7#1, main_~A~0#1, main_~B~0#1, main_~r~0#1, main_~d~0#1, main_~p~0#1, main_~q~0#1;havoc main_~A~0#1;havoc main_~B~0#1;havoc main_~r~0#1;havoc main_~d~0#1;havoc main_~p~0#1;havoc main_~q~0#1;main_~A~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;main_~B~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := (if main_~B~0#1 % 4294967296 >= 1 then 1 else 0);havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {3706#(<= ~counter~0 0)} is VALID [2022-02-20 17:31:48,691 INFO L290 TraceCheckUtils]: 2: Hoare triple {3706#(<= ~counter~0 0)} assume !(0 == assume_abort_if_not_~cond#1); {3706#(<= ~counter~0 0)} is VALID [2022-02-20 17:31:48,691 INFO L290 TraceCheckUtils]: 3: Hoare triple {3706#(<= ~counter~0 0)} assume { :end_inline_assume_abort_if_not } 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; {3706#(<= ~counter~0 0)} is VALID [2022-02-20 17:31:48,692 INFO L290 TraceCheckUtils]: 4: Hoare triple {3706#(<= ~counter~0 0)} main_#t~post6#1 := ~counter~0;~counter~0 := 1 + main_#t~post6#1; {3719#(<= ~counter~0 1)} is VALID [2022-02-20 17:31:48,692 INFO L290 TraceCheckUtils]: 5: Hoare triple {3719#(<= ~counter~0 1)} assume !!(main_#t~post6#1 < 20);havoc main_#t~post6#1; {3719#(<= ~counter~0 1)} is VALID [2022-02-20 17:31:48,692 INFO L272 TraceCheckUtils]: 6: Hoare triple {3719#(<= ~counter~0 1)} call __VERIFIER_assert((if 0 == main_~q~0#1 % 4294967296 then 1 else 0)); {3719#(<= ~counter~0 1)} is VALID [2022-02-20 17:31:48,693 INFO L290 TraceCheckUtils]: 7: Hoare triple {3719#(<= ~counter~0 1)} ~cond := #in~cond; {3719#(<= ~counter~0 1)} is VALID [2022-02-20 17:31:48,693 INFO L290 TraceCheckUtils]: 8: Hoare triple {3719#(<= ~counter~0 1)} assume !(0 == ~cond); {3719#(<= ~counter~0 1)} is VALID [2022-02-20 17:31:48,693 INFO L290 TraceCheckUtils]: 9: Hoare triple {3719#(<= ~counter~0 1)} assume true; {3719#(<= ~counter~0 1)} is VALID [2022-02-20 17:31:48,694 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {3719#(<= ~counter~0 1)} {3719#(<= ~counter~0 1)} #74#return; {3719#(<= ~counter~0 1)} is VALID [2022-02-20 17:31:48,694 INFO L272 TraceCheckUtils]: 11: Hoare triple {3719#(<= ~counter~0 1)} call __VERIFIER_assert((if main_~r~0#1 % 4294967296 == main_~A~0#1 % 4294967296 then 1 else 0)); {3719#(<= ~counter~0 1)} is VALID [2022-02-20 17:31:48,694 INFO L290 TraceCheckUtils]: 12: Hoare triple {3719#(<= ~counter~0 1)} ~cond := #in~cond; {3719#(<= ~counter~0 1)} is VALID [2022-02-20 17:31:48,695 INFO L290 TraceCheckUtils]: 13: Hoare triple {3719#(<= ~counter~0 1)} assume !(0 == ~cond); {3719#(<= ~counter~0 1)} is VALID [2022-02-20 17:31:48,695 INFO L290 TraceCheckUtils]: 14: Hoare triple {3719#(<= ~counter~0 1)} assume true; {3719#(<= ~counter~0 1)} is VALID [2022-02-20 17:31:48,696 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {3719#(<= ~counter~0 1)} {3719#(<= ~counter~0 1)} #76#return; {3719#(<= ~counter~0 1)} is VALID [2022-02-20 17:31:48,696 INFO L272 TraceCheckUtils]: 16: Hoare triple {3719#(<= ~counter~0 1)} call __VERIFIER_assert((if main_~d~0#1 % 4294967296 == main_~B~0#1 * main_~p~0#1 % 4294967296 then 1 else 0)); {3719#(<= ~counter~0 1)} is VALID [2022-02-20 17:31:48,696 INFO L290 TraceCheckUtils]: 17: Hoare triple {3719#(<= ~counter~0 1)} ~cond := #in~cond; {3719#(<= ~counter~0 1)} is VALID [2022-02-20 17:31:48,697 INFO L290 TraceCheckUtils]: 18: Hoare triple {3719#(<= ~counter~0 1)} assume !(0 == ~cond); {3719#(<= ~counter~0 1)} is VALID [2022-02-20 17:31:48,697 INFO L290 TraceCheckUtils]: 19: Hoare triple {3719#(<= ~counter~0 1)} assume true; {3719#(<= ~counter~0 1)} is VALID [2022-02-20 17:31:48,697 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {3719#(<= ~counter~0 1)} {3719#(<= ~counter~0 1)} #78#return; {3719#(<= ~counter~0 1)} is VALID [2022-02-20 17:31:48,698 INFO L290 TraceCheckUtils]: 21: Hoare triple {3719#(<= ~counter~0 1)} assume !(main_~r~0#1 % 4294967296 >= main_~d~0#1 % 4294967296); {3719#(<= ~counter~0 1)} is VALID [2022-02-20 17:31:48,698 INFO L290 TraceCheckUtils]: 22: Hoare triple {3719#(<= ~counter~0 1)} main_#t~post7#1 := ~counter~0;~counter~0 := 1 + main_#t~post7#1; {3774#(<= ~counter~0 2)} is VALID [2022-02-20 17:31:48,699 INFO L290 TraceCheckUtils]: 23: Hoare triple {3774#(<= ~counter~0 2)} assume !!(main_#t~post7#1 < 20);havoc main_#t~post7#1; {3774#(<= ~counter~0 2)} is VALID [2022-02-20 17:31:48,699 INFO L272 TraceCheckUtils]: 24: Hoare triple {3774#(<= ~counter~0 2)} 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)); {3774#(<= ~counter~0 2)} is VALID [2022-02-20 17:31:48,699 INFO L290 TraceCheckUtils]: 25: Hoare triple {3774#(<= ~counter~0 2)} ~cond := #in~cond; {3774#(<= ~counter~0 2)} is VALID [2022-02-20 17:31:48,700 INFO L290 TraceCheckUtils]: 26: Hoare triple {3774#(<= ~counter~0 2)} assume !(0 == ~cond); {3774#(<= ~counter~0 2)} is VALID [2022-02-20 17:31:48,700 INFO L290 TraceCheckUtils]: 27: Hoare triple {3774#(<= ~counter~0 2)} assume true; {3774#(<= ~counter~0 2)} is VALID [2022-02-20 17:31:48,700 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {3774#(<= ~counter~0 2)} {3774#(<= ~counter~0 2)} #80#return; {3774#(<= ~counter~0 2)} is VALID [2022-02-20 17:31:48,701 INFO L272 TraceCheckUtils]: 29: Hoare triple {3774#(<= ~counter~0 2)} call __VERIFIER_assert((if main_~d~0#1 % 4294967296 == main_~B~0#1 * main_~p~0#1 % 4294967296 then 1 else 0)); {3774#(<= ~counter~0 2)} is VALID [2022-02-20 17:31:48,701 INFO L290 TraceCheckUtils]: 30: Hoare triple {3774#(<= ~counter~0 2)} ~cond := #in~cond; {3774#(<= ~counter~0 2)} is VALID [2022-02-20 17:31:48,702 INFO L290 TraceCheckUtils]: 31: Hoare triple {3774#(<= ~counter~0 2)} assume !(0 == ~cond); {3774#(<= ~counter~0 2)} is VALID [2022-02-20 17:31:48,702 INFO L290 TraceCheckUtils]: 32: Hoare triple {3774#(<= ~counter~0 2)} assume true; {3774#(<= ~counter~0 2)} is VALID [2022-02-20 17:31:48,702 INFO L284 TraceCheckUtils]: 33: Hoare quadruple {3774#(<= ~counter~0 2)} {3774#(<= ~counter~0 2)} #82#return; {3774#(<= ~counter~0 2)} is VALID [2022-02-20 17:31:48,703 INFO L290 TraceCheckUtils]: 34: Hoare triple {3774#(<= ~counter~0 2)} assume !!(1 != main_~p~0#1 % 4294967296);main_~d~0#1 := (if main_~d~0#1 % 4294967296 < 0 && 0 != main_~d~0#1 % 4294967296 % 2 then 1 + main_~d~0#1 % 4294967296 / 2 else main_~d~0#1 % 4294967296 / 2);main_~p~0#1 := (if main_~p~0#1 % 4294967296 < 0 && 0 != main_~p~0#1 % 4294967296 % 2 then 1 + main_~p~0#1 % 4294967296 / 2 else main_~p~0#1 % 4294967296 / 2); {3774#(<= ~counter~0 2)} is VALID [2022-02-20 17:31:48,703 INFO L290 TraceCheckUtils]: 35: Hoare triple {3774#(<= ~counter~0 2)} assume main_~r~0#1 % 4294967296 >= main_~d~0#1 % 4294967296;main_~r~0#1 := main_~r~0#1 - main_~d~0#1;main_~q~0#1 := main_~q~0#1 + main_~p~0#1; {3774#(<= ~counter~0 2)} is VALID [2022-02-20 17:31:48,707 INFO L290 TraceCheckUtils]: 36: Hoare triple {3774#(<= ~counter~0 2)} main_#t~post7#1 := ~counter~0;~counter~0 := 1 + main_#t~post7#1; {3817#(<= |ULTIMATE.start_main_#t~post7#1| 2)} is VALID [2022-02-20 17:31:48,708 INFO L290 TraceCheckUtils]: 37: Hoare triple {3817#(<= |ULTIMATE.start_main_#t~post7#1| 2)} assume !(main_#t~post7#1 < 20);havoc main_#t~post7#1; {3702#false} is VALID [2022-02-20 17:31:48,708 INFO L272 TraceCheckUtils]: 38: Hoare triple {3702#false} 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)); {3702#false} is VALID [2022-02-20 17:31:48,708 INFO L290 TraceCheckUtils]: 39: Hoare triple {3702#false} ~cond := #in~cond; {3702#false} is VALID [2022-02-20 17:31:48,708 INFO L290 TraceCheckUtils]: 40: Hoare triple {3702#false} assume 0 == ~cond; {3702#false} is VALID [2022-02-20 17:31:48,708 INFO L290 TraceCheckUtils]: 41: Hoare triple {3702#false} assume !false; {3702#false} is VALID [2022-02-20 17:31:48,708 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 10 proven. 26 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-02-20 17:31:48,708 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 17:31:48,887 INFO L290 TraceCheckUtils]: 41: Hoare triple {3702#false} assume !false; {3702#false} is VALID [2022-02-20 17:31:48,887 INFO L290 TraceCheckUtils]: 40: Hoare triple {3702#false} assume 0 == ~cond; {3702#false} is VALID [2022-02-20 17:31:48,887 INFO L290 TraceCheckUtils]: 39: Hoare triple {3702#false} ~cond := #in~cond; {3702#false} is VALID [2022-02-20 17:31:48,887 INFO L272 TraceCheckUtils]: 38: Hoare triple {3702#false} 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)); {3702#false} is VALID [2022-02-20 17:31:48,887 INFO L290 TraceCheckUtils]: 37: Hoare triple {3845#(< |ULTIMATE.start_main_#t~post7#1| 20)} assume !(main_#t~post7#1 < 20);havoc main_#t~post7#1; {3702#false} is VALID [2022-02-20 17:31:48,888 INFO L290 TraceCheckUtils]: 36: Hoare triple {3849#(< ~counter~0 20)} main_#t~post7#1 := ~counter~0;~counter~0 := 1 + main_#t~post7#1; {3845#(< |ULTIMATE.start_main_#t~post7#1| 20)} is VALID [2022-02-20 17:31:48,888 INFO L290 TraceCheckUtils]: 35: Hoare triple {3849#(< ~counter~0 20)} assume main_~r~0#1 % 4294967296 >= main_~d~0#1 % 4294967296;main_~r~0#1 := main_~r~0#1 - main_~d~0#1;main_~q~0#1 := main_~q~0#1 + main_~p~0#1; {3849#(< ~counter~0 20)} is VALID [2022-02-20 17:31:48,888 INFO L290 TraceCheckUtils]: 34: Hoare triple {3849#(< ~counter~0 20)} assume !!(1 != main_~p~0#1 % 4294967296);main_~d~0#1 := (if main_~d~0#1 % 4294967296 < 0 && 0 != main_~d~0#1 % 4294967296 % 2 then 1 + main_~d~0#1 % 4294967296 / 2 else main_~d~0#1 % 4294967296 / 2);main_~p~0#1 := (if main_~p~0#1 % 4294967296 < 0 && 0 != main_~p~0#1 % 4294967296 % 2 then 1 + main_~p~0#1 % 4294967296 / 2 else main_~p~0#1 % 4294967296 / 2); {3849#(< ~counter~0 20)} is VALID [2022-02-20 17:31:48,889 INFO L284 TraceCheckUtils]: 33: Hoare quadruple {3701#true} {3849#(< ~counter~0 20)} #82#return; {3849#(< ~counter~0 20)} is VALID [2022-02-20 17:31:48,889 INFO L290 TraceCheckUtils]: 32: Hoare triple {3701#true} assume true; {3701#true} is VALID [2022-02-20 17:31:48,889 INFO L290 TraceCheckUtils]: 31: Hoare triple {3701#true} assume !(0 == ~cond); {3701#true} is VALID [2022-02-20 17:31:48,889 INFO L290 TraceCheckUtils]: 30: Hoare triple {3701#true} ~cond := #in~cond; {3701#true} is VALID [2022-02-20 17:31:48,889 INFO L272 TraceCheckUtils]: 29: Hoare triple {3849#(< ~counter~0 20)} call __VERIFIER_assert((if main_~d~0#1 % 4294967296 == main_~B~0#1 * main_~p~0#1 % 4294967296 then 1 else 0)); {3701#true} is VALID [2022-02-20 17:31:48,890 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {3701#true} {3849#(< ~counter~0 20)} #80#return; {3849#(< ~counter~0 20)} is VALID [2022-02-20 17:31:48,890 INFO L290 TraceCheckUtils]: 27: Hoare triple {3701#true} assume true; {3701#true} is VALID [2022-02-20 17:31:48,890 INFO L290 TraceCheckUtils]: 26: Hoare triple {3701#true} assume !(0 == ~cond); {3701#true} is VALID [2022-02-20 17:31:48,890 INFO L290 TraceCheckUtils]: 25: Hoare triple {3701#true} ~cond := #in~cond; {3701#true} is VALID [2022-02-20 17:31:48,890 INFO L272 TraceCheckUtils]: 24: Hoare triple {3849#(< ~counter~0 20)} 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)); {3701#true} is VALID [2022-02-20 17:31:48,890 INFO L290 TraceCheckUtils]: 23: Hoare triple {3849#(< ~counter~0 20)} assume !!(main_#t~post7#1 < 20);havoc main_#t~post7#1; {3849#(< ~counter~0 20)} is VALID [2022-02-20 17:31:48,891 INFO L290 TraceCheckUtils]: 22: Hoare triple {3892#(< ~counter~0 19)} main_#t~post7#1 := ~counter~0;~counter~0 := 1 + main_#t~post7#1; {3849#(< ~counter~0 20)} is VALID [2022-02-20 17:31:48,891 INFO L290 TraceCheckUtils]: 21: Hoare triple {3892#(< ~counter~0 19)} assume !(main_~r~0#1 % 4294967296 >= main_~d~0#1 % 4294967296); {3892#(< ~counter~0 19)} is VALID [2022-02-20 17:31:48,892 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {3701#true} {3892#(< ~counter~0 19)} #78#return; {3892#(< ~counter~0 19)} is VALID [2022-02-20 17:31:48,892 INFO L290 TraceCheckUtils]: 19: Hoare triple {3701#true} assume true; {3701#true} is VALID [2022-02-20 17:31:48,892 INFO L290 TraceCheckUtils]: 18: Hoare triple {3701#true} assume !(0 == ~cond); {3701#true} is VALID [2022-02-20 17:31:48,892 INFO L290 TraceCheckUtils]: 17: Hoare triple {3701#true} ~cond := #in~cond; {3701#true} is VALID [2022-02-20 17:31:48,892 INFO L272 TraceCheckUtils]: 16: Hoare triple {3892#(< ~counter~0 19)} call __VERIFIER_assert((if main_~d~0#1 % 4294967296 == main_~B~0#1 * main_~p~0#1 % 4294967296 then 1 else 0)); {3701#true} is VALID [2022-02-20 17:31:48,893 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {3701#true} {3892#(< ~counter~0 19)} #76#return; {3892#(< ~counter~0 19)} is VALID [2022-02-20 17:31:48,893 INFO L290 TraceCheckUtils]: 14: Hoare triple {3701#true} assume true; {3701#true} is VALID [2022-02-20 17:31:48,893 INFO L290 TraceCheckUtils]: 13: Hoare triple {3701#true} assume !(0 == ~cond); {3701#true} is VALID [2022-02-20 17:31:48,893 INFO L290 TraceCheckUtils]: 12: Hoare triple {3701#true} ~cond := #in~cond; {3701#true} is VALID [2022-02-20 17:31:48,893 INFO L272 TraceCheckUtils]: 11: Hoare triple {3892#(< ~counter~0 19)} call __VERIFIER_assert((if main_~r~0#1 % 4294967296 == main_~A~0#1 % 4294967296 then 1 else 0)); {3701#true} is VALID [2022-02-20 17:31:48,894 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {3701#true} {3892#(< ~counter~0 19)} #74#return; {3892#(< ~counter~0 19)} is VALID [2022-02-20 17:31:48,894 INFO L290 TraceCheckUtils]: 9: Hoare triple {3701#true} assume true; {3701#true} is VALID [2022-02-20 17:31:48,894 INFO L290 TraceCheckUtils]: 8: Hoare triple {3701#true} assume !(0 == ~cond); {3701#true} is VALID [2022-02-20 17:31:48,894 INFO L290 TraceCheckUtils]: 7: Hoare triple {3701#true} ~cond := #in~cond; {3701#true} is VALID [2022-02-20 17:31:48,894 INFO L272 TraceCheckUtils]: 6: Hoare triple {3892#(< ~counter~0 19)} call __VERIFIER_assert((if 0 == main_~q~0#1 % 4294967296 then 1 else 0)); {3701#true} is VALID [2022-02-20 17:31:48,895 INFO L290 TraceCheckUtils]: 5: Hoare triple {3892#(< ~counter~0 19)} assume !!(main_#t~post6#1 < 20);havoc main_#t~post6#1; {3892#(< ~counter~0 19)} is VALID [2022-02-20 17:31:48,895 INFO L290 TraceCheckUtils]: 4: Hoare triple {3947#(< ~counter~0 18)} main_#t~post6#1 := ~counter~0;~counter~0 := 1 + main_#t~post6#1; {3892#(< ~counter~0 19)} is VALID [2022-02-20 17:31:48,896 INFO L290 TraceCheckUtils]: 3: Hoare triple {3947#(< ~counter~0 18)} assume { :end_inline_assume_abort_if_not } 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; {3947#(< ~counter~0 18)} is VALID [2022-02-20 17:31:48,896 INFO L290 TraceCheckUtils]: 2: Hoare triple {3947#(< ~counter~0 18)} assume !(0 == assume_abort_if_not_~cond#1); {3947#(< ~counter~0 18)} is VALID [2022-02-20 17:31:48,896 INFO L290 TraceCheckUtils]: 1: Hoare triple {3947#(< ~counter~0 18)} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~post6#1, main_#t~post7#1, main_~A~0#1, main_~B~0#1, main_~r~0#1, main_~d~0#1, main_~p~0#1, main_~q~0#1;havoc main_~A~0#1;havoc main_~B~0#1;havoc main_~r~0#1;havoc main_~d~0#1;havoc main_~p~0#1;havoc main_~q~0#1;main_~A~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;main_~B~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := (if main_~B~0#1 % 4294967296 >= 1 then 1 else 0);havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {3947#(< ~counter~0 18)} is VALID [2022-02-20 17:31:48,897 INFO L290 TraceCheckUtils]: 0: Hoare triple {3701#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);~counter~0 := 0; {3947#(< ~counter~0 18)} is VALID [2022-02-20 17:31:48,897 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 10 proven. 2 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2022-02-20 17:31:48,897 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 17:31:48,897 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [587081224] [2022-02-20 17:31:48,897 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-20 17:31:48,897 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1880169050] [2022-02-20 17:31:48,897 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1880169050] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 17:31:48,897 INFO L191 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-02-20 17:31:48,897 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6] total 10 [2022-02-20 17:31:48,898 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1510904498] [2022-02-20 17:31:48,898 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-02-20 17:31:48,899 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.8) internal successors, (38), 10 states have internal predecessors, (38), 5 states have call successors, (11), 4 states have call predecessors, (11), 3 states have return successors, (10), 4 states have call predecessors, (10), 4 states have call successors, (10) Word has length 42 [2022-02-20 17:31:48,899 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 17:31:48,899 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 10 states, 10 states have (on average 3.8) internal successors, (38), 10 states have internal predecessors, (38), 5 states have call successors, (11), 4 states have call predecessors, (11), 3 states have return successors, (10), 4 states have call predecessors, (10), 4 states have call successors, (10) [2022-02-20 17:31:48,951 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 59 edges. 59 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:31:48,951 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-02-20 17:31:48,951 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 17:31:48,951 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-02-20 17:31:48,952 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-02-20 17:31:48,952 INFO L87 Difference]: Start difference. First operand 147 states and 178 transitions. Second operand has 10 states, 10 states have (on average 3.8) internal successors, (38), 10 states have internal predecessors, (38), 5 states have call successors, (11), 4 states have call predecessors, (11), 3 states have return successors, (10), 4 states have call predecessors, (10), 4 states have call successors, (10) [2022-02-20 17:31:50,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:31:50,536 INFO L93 Difference]: Finished difference Result 274 states and 339 transitions. [2022-02-20 17:31:50,536 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-02-20 17:31:50,536 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.8) internal successors, (38), 10 states have internal predecessors, (38), 5 states have call successors, (11), 4 states have call predecessors, (11), 3 states have return successors, (10), 4 states have call predecessors, (10), 4 states have call successors, (10) Word has length 42 [2022-02-20 17:31:50,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 17:31:50,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 3.8) internal successors, (38), 10 states have internal predecessors, (38), 5 states have call successors, (11), 4 states have call predecessors, (11), 3 states have return successors, (10), 4 states have call predecessors, (10), 4 states have call successors, (10) [2022-02-20 17:31:50,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 169 transitions. [2022-02-20 17:31:50,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 3.8) internal successors, (38), 10 states have internal predecessors, (38), 5 states have call successors, (11), 4 states have call predecessors, (11), 3 states have return successors, (10), 4 states have call predecessors, (10), 4 states have call successors, (10) [2022-02-20 17:31:50,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 169 transitions. [2022-02-20 17:31:50,550 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 13 states and 169 transitions. [2022-02-20 17:31:50,685 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 169 edges. 169 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:31:50,692 INFO L225 Difference]: With dead ends: 274 [2022-02-20 17:31:50,693 INFO L226 Difference]: Without dead ends: 250 [2022-02-20 17:31:50,695 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 74 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=119, Unknown=0, NotChecked=0, Total=182 [2022-02-20 17:31:50,696 INFO L933 BasicCegarLoop]: 60 mSDtfsCounter, 137 mSDsluCounter, 211 mSDsCounter, 0 mSdLazyCounter, 114 mSolverCounterSat, 81 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 137 SdHoareTripleChecker+Valid, 271 SdHoareTripleChecker+Invalid, 195 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 81 IncrementalHoareTripleChecker+Valid, 114 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-02-20 17:31:50,697 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [137 Valid, 271 Invalid, 195 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [81 Valid, 114 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-02-20 17:31:50,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 250 states. [2022-02-20 17:31:50,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 250 to 243. [2022-02-20 17:31:50,802 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 17:31:50,803 INFO L82 GeneralOperation]: Start isEquivalent. First operand 250 states. Second operand has 243 states, 158 states have (on average 1.2025316455696202) internal successors, (190), 169 states have internal predecessors, (190), 56 states have call successors, (56), 28 states have call predecessors, (56), 28 states have return successors, (52), 45 states have call predecessors, (52), 52 states have call successors, (52) [2022-02-20 17:31:50,804 INFO L74 IsIncluded]: Start isIncluded. First operand 250 states. Second operand has 243 states, 158 states have (on average 1.2025316455696202) internal successors, (190), 169 states have internal predecessors, (190), 56 states have call successors, (56), 28 states have call predecessors, (56), 28 states have return successors, (52), 45 states have call predecessors, (52), 52 states have call successors, (52) [2022-02-20 17:31:50,804 INFO L87 Difference]: Start difference. First operand 250 states. Second operand has 243 states, 158 states have (on average 1.2025316455696202) internal successors, (190), 169 states have internal predecessors, (190), 56 states have call successors, (56), 28 states have call predecessors, (56), 28 states have return successors, (52), 45 states have call predecessors, (52), 52 states have call successors, (52) [2022-02-20 17:31:50,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:31:50,809 INFO L93 Difference]: Finished difference Result 250 states and 302 transitions. [2022-02-20 17:31:50,809 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 302 transitions. [2022-02-20 17:31:50,810 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:31:50,810 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:31:50,811 INFO L74 IsIncluded]: Start isIncluded. First operand has 243 states, 158 states have (on average 1.2025316455696202) internal successors, (190), 169 states have internal predecessors, (190), 56 states have call successors, (56), 28 states have call predecessors, (56), 28 states have return successors, (52), 45 states have call predecessors, (52), 52 states have call successors, (52) Second operand 250 states. [2022-02-20 17:31:50,811 INFO L87 Difference]: Start difference. First operand has 243 states, 158 states have (on average 1.2025316455696202) internal successors, (190), 169 states have internal predecessors, (190), 56 states have call successors, (56), 28 states have call predecessors, (56), 28 states have return successors, (52), 45 states have call predecessors, (52), 52 states have call successors, (52) Second operand 250 states. [2022-02-20 17:31:50,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:31:50,821 INFO L93 Difference]: Finished difference Result 250 states and 302 transitions. [2022-02-20 17:31:50,821 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 302 transitions. [2022-02-20 17:31:50,822 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:31:50,822 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:31:50,822 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 17:31:50,822 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 17:31:50,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 243 states, 158 states have (on average 1.2025316455696202) internal successors, (190), 169 states have internal predecessors, (190), 56 states have call successors, (56), 28 states have call predecessors, (56), 28 states have return successors, (52), 45 states have call predecessors, (52), 52 states have call successors, (52) [2022-02-20 17:31:50,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 243 states to 243 states and 298 transitions. [2022-02-20 17:31:50,827 INFO L78 Accepts]: Start accepts. Automaton has 243 states and 298 transitions. Word has length 42 [2022-02-20 17:31:50,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 17:31:50,827 INFO L470 AbstractCegarLoop]: Abstraction has 243 states and 298 transitions. [2022-02-20 17:31:50,828 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.8) internal successors, (38), 10 states have internal predecessors, (38), 5 states have call successors, (11), 4 states have call predecessors, (11), 3 states have return successors, (10), 4 states have call predecessors, (10), 4 states have call successors, (10) [2022-02-20 17:31:50,828 INFO L276 IsEmpty]: Start isEmpty. Operand 243 states and 298 transitions. [2022-02-20 17:31:50,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-02-20 17:31:50,828 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:31:50,828 INFO L514 BasicCegarLoop]: trace histogram [6, 5, 5, 2, 2, 2, 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:50,846 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-02-20 17:31:51,028 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 17:31:51,029 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 17:31:51,029 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:31:51,029 INFO L85 PathProgramCache]: Analyzing trace with hash -1108171762, now seen corresponding path program 1 times [2022-02-20 17:31:51,029 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 17:31:51,029 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1905928444] [2022-02-20 17:31:51,029 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:31:51,029 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 17:31:51,038 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-20 17:31:51,039 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [536860394] [2022-02-20 17:31:51,039 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:31:51,039 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 17:31:51,039 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 17:31:51,040 INFO L229 MonitoredProcess]: Starting monitored process 8 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:51,047 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process