/usr/bin/java -ea -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --core.log.level.for.class de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/nla-digbench-scaling/divbin2_unwindbound100.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-fb4f59a-m [2022-04-27 12:22:52,737 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-27 12:22:52,739 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-27 12:22:52,782 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-27 12:22:52,783 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-27 12:22:52,784 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-27 12:22:52,786 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-27 12:22:52,788 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-27 12:22:52,789 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-27 12:22:52,793 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-27 12:22:52,794 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-27 12:22:52,795 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-27 12:22:52,795 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-27 12:22:52,797 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-27 12:22:52,798 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-27 12:22:52,801 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-27 12:22:52,802 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-27 12:22:52,802 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-27 12:22:52,804 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-27 12:22:52,808 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-27 12:22:52,810 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-27 12:22:52,811 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-27 12:22:52,812 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-27 12:22:52,813 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-27 12:22:52,814 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-27 12:22:52,819 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-27 12:22:52,820 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-27 12:22:52,820 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-27 12:22:52,821 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-27 12:22:52,821 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-27 12:22:52,822 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-27 12:22:52,822 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-27 12:22:52,823 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-27 12:22:52,824 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-27 12:22:52,824 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-27 12:22:52,825 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-27 12:22:52,825 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-27 12:22:52,825 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-27 12:22:52,825 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-27 12:22:52,826 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-27 12:22:52,827 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-27 12:22:52,827 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-27 12:22:52,828 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2022-04-27 12:22:52,855 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-27 12:22:52,856 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-27 12:22:52,856 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-04-27 12:22:52,856 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-04-27 12:22:52,857 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-04-27 12:22:52,857 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-04-27 12:22:52,857 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-04-27 12:22:52,857 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-04-27 12:22:52,857 INFO L138 SettingsManager]: * Use SBE=true [2022-04-27 12:22:52,858 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-27 12:22:52,858 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-27 12:22:52,858 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-27 12:22:52,858 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-27 12:22:52,858 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-27 12:22:52,859 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-27 12:22:52,859 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-27 12:22:52,859 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-27 12:22:52,860 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-27 12:22:52,860 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-27 12:22:52,860 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-27 12:22:52,860 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-27 12:22:52,860 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-27 12:22:52,860 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-27 12:22:52,860 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-27 12:22:52,860 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 12:22:52,861 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-27 12:22:52,861 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-04-27 12:22:52,861 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-04-27 12:22:52,861 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-04-27 12:22:52,861 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-04-27 12:22:52,861 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-04-27 12:22:52,861 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-04-27 12:22:52,861 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-27 12:22:52,861 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.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-04-27 12:22:53,065 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-27 12:22:53,082 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-27 12:22:53,084 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-27 12:22:53,085 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-27 12:22:53,085 INFO L275 PluginConnector]: CDTParser initialized [2022-04-27 12:22:53,086 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/nla-digbench-scaling/divbin2_unwindbound100.i [2022-04-27 12:22:53,148 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c23f00c91/881ba7c69b1146b9ace23e5651f0f3b8/FLAGe4a2f2a53 [2022-04-27 12:22:53,508 INFO L306 CDTParser]: Found 1 translation units. [2022-04-27 12:22:53,508 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/divbin2_unwindbound100.i [2022-04-27 12:22:53,513 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c23f00c91/881ba7c69b1146b9ace23e5651f0f3b8/FLAGe4a2f2a53 [2022-04-27 12:22:53,524 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c23f00c91/881ba7c69b1146b9ace23e5651f0f3b8 [2022-04-27 12:22:53,526 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-27 12:22:53,527 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-27 12:22:53,528 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-27 12:22:53,528 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-27 12:22:53,530 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-27 12:22:53,531 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 12:22:53" (1/1) ... [2022-04-27 12:22:53,532 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3caa3edb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 12:22:53, skipping insertion in model container [2022-04-27 12:22:53,532 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 12:22:53" (1/1) ... [2022-04-27 12:22:53,537 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-27 12:22:53,547 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-27 12:22:53,697 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/divbin2_unwindbound100.i[951,964] [2022-04-27 12:22:53,743 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 12:22:53,749 INFO L203 MainTranslator]: Completed pre-run [2022-04-27 12:22:53,764 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/divbin2_unwindbound100.i[951,964] [2022-04-27 12:22:53,768 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 12:22:53,778 INFO L208 MainTranslator]: Completed translation [2022-04-27 12:22:53,778 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 12:22:53 WrapperNode [2022-04-27 12:22:53,778 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-27 12:22:53,779 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-27 12:22:53,779 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-27 12:22:53,779 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-27 12:22:53,786 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 12:22:53" (1/1) ... [2022-04-27 12:22:53,787 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 12:22:53" (1/1) ... [2022-04-27 12:22:53,792 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 12:22:53" (1/1) ... [2022-04-27 12:22:53,792 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 12:22:53" (1/1) ... [2022-04-27 12:22:53,805 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 12:22:53" (1/1) ... [2022-04-27 12:22:53,809 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 12:22:53" (1/1) ... [2022-04-27 12:22:53,810 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 12:22:53" (1/1) ... [2022-04-27 12:22:53,811 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-27 12:22:53,812 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-27 12:22:53,812 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-27 12:22:53,812 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-27 12:22:53,818 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 12:22:53" (1/1) ... [2022-04-27 12:22:53,828 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 12:22:53,840 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 12:22:53,861 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-04-27 12:22:53,877 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-04-27 12:22:53,907 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-27 12:22:53,907 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-27 12:22:53,908 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-27 12:22:53,908 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-27 12:22:53,911 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-27 12:22:53,911 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-27 12:22:53,911 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-27 12:22:53,911 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-27 12:22:53,911 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_perror_fail [2022-04-27 12:22:53,911 INFO L130 BoogieDeclarations]: Found specification of procedure __assert [2022-04-27 12:22:53,911 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-27 12:22:53,911 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-27 12:22:53,911 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uint [2022-04-27 12:22:53,912 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-27 12:22:53,912 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-27 12:22:53,912 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-27 12:22:53,912 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-27 12:22:53,912 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-27 12:22:53,912 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-27 12:22:53,912 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-27 12:22:53,912 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-27 12:22:53,912 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-27 12:22:53,956 INFO L234 CfgBuilder]: Building ICFG [2022-04-27 12:22:53,957 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-27 12:22:54,063 INFO L275 CfgBuilder]: Performing block encoding [2022-04-27 12:22:54,068 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-27 12:22:54,068 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-04-27 12:22:54,070 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 12:22:54 BoogieIcfgContainer [2022-04-27 12:22:54,070 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-27 12:22:54,071 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-27 12:22:54,071 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-27 12:22:54,074 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-27 12:22:54,074 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.04 12:22:53" (1/3) ... [2022-04-27 12:22:54,075 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@19641b69 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 12:22:54, skipping insertion in model container [2022-04-27 12:22:54,075 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 12:22:53" (2/3) ... [2022-04-27 12:22:54,075 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@19641b69 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 12:22:54, skipping insertion in model container [2022-04-27 12:22:54,075 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 12:22:54" (3/3) ... [2022-04-27 12:22:54,076 INFO L111 eAbstractionObserver]: Analyzing ICFG divbin2_unwindbound100.i [2022-04-27 12:22:54,087 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-04-27 12:22:54,088 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-27 12:22:54,135 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-27 12:22:54,140 INFO L357 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, mPorIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@4bd317dc, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@12ed3c31 [2022-04-27 12:22:54,140 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-27 12:22:54,156 INFO L276 IsEmpty]: Start isEmpty. Operand has 26 states, 17 states have (on average 1.5294117647058822) internal successors, (26), 18 states have internal predecessors, (26), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-27 12:22:54,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-04-27 12:22:54,162 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 12:22:54,162 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 12:22:54,163 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 12:22:54,167 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 12:22:54,167 INFO L85 PathProgramCache]: Analyzing trace with hash -2126508982, now seen corresponding path program 1 times [2022-04-27 12:22:54,189 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 12:22:54,189 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [597408568] [2022-04-27 12:22:54,189 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 12:22:54,190 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 12:22:54,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:22:54,376 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 12:22:54,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:22:54,401 INFO L290 TraceCheckUtils]: 0: Hoare triple {34#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #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(10, 2);~counter~0 := 0; {29#true} is VALID [2022-04-27 12:22:54,402 INFO L290 TraceCheckUtils]: 1: Hoare triple {29#true} assume true; {29#true} is VALID [2022-04-27 12:22:54,402 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {29#true} {29#true} #82#return; {29#true} is VALID [2022-04-27 12:22:54,405 INFO L272 TraceCheckUtils]: 0: Hoare triple {29#true} call ULTIMATE.init(); {34#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 12:22:54,405 INFO L290 TraceCheckUtils]: 1: Hoare triple {34#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #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(10, 2);~counter~0 := 0; {29#true} is VALID [2022-04-27 12:22:54,406 INFO L290 TraceCheckUtils]: 2: Hoare triple {29#true} assume true; {29#true} is VALID [2022-04-27 12:22:54,406 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {29#true} {29#true} #82#return; {29#true} is VALID [2022-04-27 12:22:54,406 INFO L272 TraceCheckUtils]: 4: Hoare triple {29#true} call #t~ret4 := main(); {29#true} is VALID [2022-04-27 12:22:54,407 INFO L290 TraceCheckUtils]: 5: Hoare triple {29#true} havoc ~A~0;havoc ~B~0;havoc ~q~0;havoc ~r~0;havoc ~b~0;~A~0 := #t~nondet1;havoc #t~nondet1;~B~0 := 1;~q~0 := 0;~r~0 := ~A~0;~b~0 := ~B~0; {29#true} is VALID [2022-04-27 12:22:54,407 INFO L290 TraceCheckUtils]: 6: Hoare triple {29#true} assume !true; {30#false} is VALID [2022-04-27 12:22:54,408 INFO L290 TraceCheckUtils]: 7: Hoare triple {30#false} assume !true; {30#false} is VALID [2022-04-27 12:22:54,408 INFO L272 TraceCheckUtils]: 8: Hoare triple {30#false} call __VERIFIER_assert((if ~A~0 % 4294967296 == (~q~0 * ~b~0 + ~r~0) % 4294967296 then 1 else 0)); {30#false} is VALID [2022-04-27 12:22:54,408 INFO L290 TraceCheckUtils]: 9: Hoare triple {30#false} ~cond := #in~cond; {30#false} is VALID [2022-04-27 12:22:54,408 INFO L290 TraceCheckUtils]: 10: Hoare triple {30#false} assume 0 == ~cond; {30#false} is VALID [2022-04-27 12:22:54,408 INFO L290 TraceCheckUtils]: 11: Hoare triple {30#false} assume !false; {30#false} is VALID [2022-04-27 12:22:54,409 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 12:22:54,409 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 12:22:54,410 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [597408568] [2022-04-27 12:22:54,411 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [597408568] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 12:22:54,411 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 12:22:54,411 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-27 12:22:54,414 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1277121283] [2022-04-27 12:22:54,415 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 12:22:54,421 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2022-04-27 12:22:54,422 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 12:22:54,425 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 12:22:54,449 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 12 edges. 12 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 12:22:54,449 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-27 12:22:54,449 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 12:22:54,470 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-27 12:22:54,471 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-27 12:22:54,474 INFO L87 Difference]: Start difference. First operand has 26 states, 17 states have (on average 1.5294117647058822) internal successors, (26), 18 states have internal predecessors, (26), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 12:22:54,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:22:54,592 INFO L93 Difference]: Finished difference Result 44 states and 60 transitions. [2022-04-27 12:22:54,592 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-27 12:22:54,592 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2022-04-27 12:22:54,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 12:22:54,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 12:22:54,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 60 transitions. [2022-04-27 12:22:54,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 12:22:54,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 60 transitions. [2022-04-27 12:22:54,601 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 60 transitions. [2022-04-27 12:22:54,650 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 60 edges. 60 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 12:22:54,657 INFO L225 Difference]: With dead ends: 44 [2022-04-27 12:22:54,657 INFO L226 Difference]: Without dead ends: 22 [2022-04-27 12:22:54,659 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-27 12:22:54,661 INFO L413 NwaCegarLoop]: 30 mSDtfsCounter, 6 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 12:22:54,662 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 34 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 12:22:54,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2022-04-27 12:22:54,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 21. [2022-04-27 12:22:54,682 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 12:22:54,682 INFO L82 GeneralOperation]: Start isEquivalent. First operand 22 states. Second operand has 21 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 15 states have internal predecessors, (20), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-27 12:22:54,683 INFO L74 IsIncluded]: Start isIncluded. First operand 22 states. Second operand has 21 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 15 states have internal predecessors, (20), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-27 12:22:54,683 INFO L87 Difference]: Start difference. First operand 22 states. Second operand has 21 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 15 states have internal predecessors, (20), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-27 12:22:54,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:22:54,685 INFO L93 Difference]: Finished difference Result 22 states and 27 transitions. [2022-04-27 12:22:54,686 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 27 transitions. [2022-04-27 12:22:54,686 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 12:22:54,686 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 12:22:54,686 INFO L74 IsIncluded]: Start isIncluded. First operand has 21 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 15 states have internal predecessors, (20), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 22 states. [2022-04-27 12:22:54,687 INFO L87 Difference]: Start difference. First operand has 21 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 15 states have internal predecessors, (20), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 22 states. [2022-04-27 12:22:54,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:22:54,688 INFO L93 Difference]: Finished difference Result 22 states and 27 transitions. [2022-04-27 12:22:54,689 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 27 transitions. [2022-04-27 12:22:54,689 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 12:22:54,689 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 12:22:54,689 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 12:22:54,689 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 12:22:54,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 15 states have internal predecessors, (20), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-27 12:22:54,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 26 transitions. [2022-04-27 12:22:54,692 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 26 transitions. Word has length 12 [2022-04-27 12:22:54,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 12:22:54,692 INFO L495 AbstractCegarLoop]: Abstraction has 21 states and 26 transitions. [2022-04-27 12:22:54,692 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 12:22:54,692 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 26 transitions. [2022-04-27 12:22:54,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-04-27 12:22:54,693 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 12:22:54,693 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 12:22:54,693 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-27 12:22:54,693 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 12:22:54,694 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 12:22:54,694 INFO L85 PathProgramCache]: Analyzing trace with hash 941422680, now seen corresponding path program 1 times [2022-04-27 12:22:54,694 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 12:22:54,694 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [706141099] [2022-04-27 12:22:54,694 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 12:22:54,695 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 12:22:54,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:22:54,745 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 12:22:54,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:22:54,757 INFO L290 TraceCheckUtils]: 0: Hoare triple {173#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #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(10, 2);~counter~0 := 0; {171#(<= ~counter~0 0)} is VALID [2022-04-27 12:22:54,758 INFO L290 TraceCheckUtils]: 1: Hoare triple {171#(<= ~counter~0 0)} assume true; {171#(<= ~counter~0 0)} is VALID [2022-04-27 12:22:54,758 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {171#(<= ~counter~0 0)} {166#true} #82#return; {171#(<= ~counter~0 0)} is VALID [2022-04-27 12:22:54,759 INFO L272 TraceCheckUtils]: 0: Hoare triple {166#true} call ULTIMATE.init(); {173#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 12:22:54,760 INFO L290 TraceCheckUtils]: 1: Hoare triple {173#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #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(10, 2);~counter~0 := 0; {171#(<= ~counter~0 0)} is VALID [2022-04-27 12:22:54,760 INFO L290 TraceCheckUtils]: 2: Hoare triple {171#(<= ~counter~0 0)} assume true; {171#(<= ~counter~0 0)} is VALID [2022-04-27 12:22:54,761 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {171#(<= ~counter~0 0)} {166#true} #82#return; {171#(<= ~counter~0 0)} is VALID [2022-04-27 12:22:54,761 INFO L272 TraceCheckUtils]: 4: Hoare triple {171#(<= ~counter~0 0)} call #t~ret4 := main(); {171#(<= ~counter~0 0)} is VALID [2022-04-27 12:22:54,762 INFO L290 TraceCheckUtils]: 5: Hoare triple {171#(<= ~counter~0 0)} havoc ~A~0;havoc ~B~0;havoc ~q~0;havoc ~r~0;havoc ~b~0;~A~0 := #t~nondet1;havoc #t~nondet1;~B~0 := 1;~q~0 := 0;~r~0 := ~A~0;~b~0 := ~B~0; {171#(<= ~counter~0 0)} is VALID [2022-04-27 12:22:54,762 INFO L290 TraceCheckUtils]: 6: Hoare triple {171#(<= ~counter~0 0)} #t~post2 := ~counter~0;~counter~0 := 1 + #t~post2; {172#(<= |main_#t~post2| 0)} is VALID [2022-04-27 12:22:54,763 INFO L290 TraceCheckUtils]: 7: Hoare triple {172#(<= |main_#t~post2| 0)} assume !(#t~post2 < 100);havoc #t~post2; {167#false} is VALID [2022-04-27 12:22:54,763 INFO L290 TraceCheckUtils]: 8: Hoare triple {167#false} #t~post3 := ~counter~0;~counter~0 := 1 + #t~post3; {167#false} is VALID [2022-04-27 12:22:54,763 INFO L290 TraceCheckUtils]: 9: Hoare triple {167#false} assume !(#t~post3 < 100);havoc #t~post3; {167#false} is VALID [2022-04-27 12:22:54,764 INFO L272 TraceCheckUtils]: 10: Hoare triple {167#false} call __VERIFIER_assert((if ~A~0 % 4294967296 == (~q~0 * ~b~0 + ~r~0) % 4294967296 then 1 else 0)); {167#false} is VALID [2022-04-27 12:22:54,764 INFO L290 TraceCheckUtils]: 11: Hoare triple {167#false} ~cond := #in~cond; {167#false} is VALID [2022-04-27 12:22:54,764 INFO L290 TraceCheckUtils]: 12: Hoare triple {167#false} assume 0 == ~cond; {167#false} is VALID [2022-04-27 12:22:54,764 INFO L290 TraceCheckUtils]: 13: Hoare triple {167#false} assume !false; {167#false} is VALID [2022-04-27 12:22:54,765 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 12:22:54,765 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 12:22:54,765 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [706141099] [2022-04-27 12:22:54,765 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [706141099] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 12:22:54,765 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 12:22:54,765 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-27 12:22:54,766 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1615739929] [2022-04-27 12:22:54,766 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 12:22:54,767 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.5) internal successors, (10), 3 states have internal predecessors, (10), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14 [2022-04-27 12:22:54,767 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 12:22:54,767 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 4 states have (on average 2.5) internal successors, (10), 3 states have internal predecessors, (10), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 12:22:54,779 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 14 edges. 14 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 12:22:54,779 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-27 12:22:54,779 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 12:22:54,780 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-27 12:22:54,780 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-27 12:22:54,780 INFO L87 Difference]: Start difference. First operand 21 states and 26 transitions. Second operand has 5 states, 4 states have (on average 2.5) internal successors, (10), 3 states have internal predecessors, (10), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 12:22:54,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:22:54,873 INFO L93 Difference]: Finished difference Result 35 states and 44 transitions. [2022-04-27 12:22:54,873 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-27 12:22:54,874 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.5) internal successors, (10), 3 states have internal predecessors, (10), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14 [2022-04-27 12:22:54,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 12:22:54,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 4 states have (on average 2.5) internal successors, (10), 3 states have internal predecessors, (10), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 12:22:54,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 44 transitions. [2022-04-27 12:22:54,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 4 states have (on average 2.5) internal successors, (10), 3 states have internal predecessors, (10), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 12:22:54,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 44 transitions. [2022-04-27 12:22:54,877 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 44 transitions. [2022-04-27 12:22:54,910 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 44 edges. 44 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 12:22:54,911 INFO L225 Difference]: With dead ends: 35 [2022-04-27 12:22:54,911 INFO L226 Difference]: Without dead ends: 23 [2022-04-27 12:22:54,911 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 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-04-27 12:22:54,912 INFO L413 NwaCegarLoop]: 24 mSDtfsCounter, 6 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 53 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 12:22:54,912 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 53 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 12:22:54,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2022-04-27 12:22:54,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2022-04-27 12:22:54,917 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 12:22:54,917 INFO L82 GeneralOperation]: Start isEquivalent. First operand 23 states. Second operand has 23 states, 16 states have (on average 1.375) internal successors, (22), 17 states have internal predecessors, (22), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-27 12:22:54,917 INFO L74 IsIncluded]: Start isIncluded. First operand 23 states. Second operand has 23 states, 16 states have (on average 1.375) internal successors, (22), 17 states have internal predecessors, (22), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-27 12:22:54,918 INFO L87 Difference]: Start difference. First operand 23 states. Second operand has 23 states, 16 states have (on average 1.375) internal successors, (22), 17 states have internal predecessors, (22), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-27 12:22:54,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:22:54,919 INFO L93 Difference]: Finished difference Result 23 states and 28 transitions. [2022-04-27 12:22:54,919 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 28 transitions. [2022-04-27 12:22:54,920 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 12:22:54,920 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 12:22:54,920 INFO L74 IsIncluded]: Start isIncluded. First operand has 23 states, 16 states have (on average 1.375) internal successors, (22), 17 states have internal predecessors, (22), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 23 states. [2022-04-27 12:22:54,921 INFO L87 Difference]: Start difference. First operand has 23 states, 16 states have (on average 1.375) internal successors, (22), 17 states have internal predecessors, (22), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 23 states. [2022-04-27 12:22:54,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:22:54,922 INFO L93 Difference]: Finished difference Result 23 states and 28 transitions. [2022-04-27 12:22:54,922 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 28 transitions. [2022-04-27 12:22:54,922 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 12:22:54,922 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 12:22:54,923 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 12:22:54,923 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 12:22:54,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 16 states have (on average 1.375) internal successors, (22), 17 states have internal predecessors, (22), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-27 12:22:54,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 28 transitions. [2022-04-27 12:22:54,924 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 28 transitions. Word has length 14 [2022-04-27 12:22:54,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 12:22:54,924 INFO L495 AbstractCegarLoop]: Abstraction has 23 states and 28 transitions. [2022-04-27 12:22:54,924 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.5) internal successors, (10), 3 states have internal predecessors, (10), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 12:22:54,924 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 28 transitions. [2022-04-27 12:22:54,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-04-27 12:22:54,925 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 12:22:54,925 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 12:22:54,925 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-27 12:22:54,925 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 12:22:54,926 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 12:22:54,926 INFO L85 PathProgramCache]: Analyzing trace with hash -1209133518, now seen corresponding path program 1 times [2022-04-27 12:22:54,926 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 12:22:54,926 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [402720559] [2022-04-27 12:22:54,926 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 12:22:54,926 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 12:22:54,939 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 12:22:54,939 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [221728648] [2022-04-27 12:22:54,939 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 12:22:54,940 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 12:22:54,940 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 12:22:54,941 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-04-27 12:22:54,959 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-04-27 12:22:55,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:22:55,007 INFO L263 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-27 12:22:55,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:22:55,018 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 12:22:55,168 INFO L272 TraceCheckUtils]: 0: Hoare triple {303#true} call ULTIMATE.init(); {303#true} is VALID [2022-04-27 12:22:55,169 INFO L290 TraceCheckUtils]: 1: Hoare triple {303#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(10, 2);~counter~0 := 0; {311#(<= ~counter~0 0)} is VALID [2022-04-27 12:22:55,169 INFO L290 TraceCheckUtils]: 2: Hoare triple {311#(<= ~counter~0 0)} assume true; {311#(<= ~counter~0 0)} is VALID [2022-04-27 12:22:55,170 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {311#(<= ~counter~0 0)} {303#true} #82#return; {311#(<= ~counter~0 0)} is VALID [2022-04-27 12:22:55,170 INFO L272 TraceCheckUtils]: 4: Hoare triple {311#(<= ~counter~0 0)} call #t~ret4 := main(); {311#(<= ~counter~0 0)} is VALID [2022-04-27 12:22:55,171 INFO L290 TraceCheckUtils]: 5: Hoare triple {311#(<= ~counter~0 0)} havoc ~A~0;havoc ~B~0;havoc ~q~0;havoc ~r~0;havoc ~b~0;~A~0 := #t~nondet1;havoc #t~nondet1;~B~0 := 1;~q~0 := 0;~r~0 := ~A~0;~b~0 := ~B~0; {311#(<= ~counter~0 0)} is VALID [2022-04-27 12:22:55,171 INFO L290 TraceCheckUtils]: 6: Hoare triple {311#(<= ~counter~0 0)} #t~post2 := ~counter~0;~counter~0 := 1 + #t~post2; {327#(<= ~counter~0 1)} is VALID [2022-04-27 12:22:55,172 INFO L290 TraceCheckUtils]: 7: Hoare triple {327#(<= ~counter~0 1)} assume !!(#t~post2 < 100);havoc #t~post2; {327#(<= ~counter~0 1)} is VALID [2022-04-27 12:22:55,172 INFO L290 TraceCheckUtils]: 8: Hoare triple {327#(<= ~counter~0 1)} assume !(~r~0 % 4294967296 >= ~b~0 % 4294967296); {327#(<= ~counter~0 1)} is VALID [2022-04-27 12:22:55,173 INFO L290 TraceCheckUtils]: 9: Hoare triple {327#(<= ~counter~0 1)} #t~post3 := ~counter~0;~counter~0 := 1 + #t~post3; {337#(<= |main_#t~post3| 1)} is VALID [2022-04-27 12:22:55,173 INFO L290 TraceCheckUtils]: 10: Hoare triple {337#(<= |main_#t~post3| 1)} assume !(#t~post3 < 100);havoc #t~post3; {304#false} is VALID [2022-04-27 12:22:55,173 INFO L272 TraceCheckUtils]: 11: Hoare triple {304#false} call __VERIFIER_assert((if ~A~0 % 4294967296 == (~q~0 * ~b~0 + ~r~0) % 4294967296 then 1 else 0)); {304#false} is VALID [2022-04-27 12:22:55,173 INFO L290 TraceCheckUtils]: 12: Hoare triple {304#false} ~cond := #in~cond; {304#false} is VALID [2022-04-27 12:22:55,174 INFO L290 TraceCheckUtils]: 13: Hoare triple {304#false} assume 0 == ~cond; {304#false} is VALID [2022-04-27 12:22:55,174 INFO L290 TraceCheckUtils]: 14: Hoare triple {304#false} assume !false; {304#false} is VALID [2022-04-27 12:22:55,174 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 12:22:55,174 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-27 12:22:55,174 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 12:22:55,174 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [402720559] [2022-04-27 12:22:55,174 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 12:22:55,175 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [221728648] [2022-04-27 12:22:55,175 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [221728648] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 12:22:55,175 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 12:22:55,175 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-27 12:22:55,175 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1642841168] [2022-04-27 12:22:55,175 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 12:22:55,176 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2022-04-27 12:22:55,176 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 12:22:55,176 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 12:22:55,187 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 15 edges. 15 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 12:22:55,187 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-27 12:22:55,187 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 12:22:55,188 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-27 12:22:55,188 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-04-27 12:22:55,188 INFO L87 Difference]: Start difference. First operand 23 states and 28 transitions. Second operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 12:22:55,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:22:55,253 INFO L93 Difference]: Finished difference Result 34 states and 40 transitions. [2022-04-27 12:22:55,253 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-27 12:22:55,254 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2022-04-27 12:22:55,254 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 12:22:55,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 12:22:55,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 40 transitions. [2022-04-27 12:22:55,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 12:22:55,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 40 transitions. [2022-04-27 12:22:55,261 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 40 transitions. [2022-04-27 12:22:55,292 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 40 edges. 40 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 12:22:55,294 INFO L225 Difference]: With dead ends: 34 [2022-04-27 12:22:55,294 INFO L226 Difference]: Without dead ends: 27 [2022-04-27 12:22:55,296 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 11 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-04-27 12:22:55,299 INFO L413 NwaCegarLoop]: 23 mSDtfsCounter, 3 mSDsluCounter, 43 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 66 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 12:22:55,300 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 66 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 12:22:55,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2022-04-27 12:22:55,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 26. [2022-04-27 12:22:55,305 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 12:22:55,305 INFO L82 GeneralOperation]: Start isEquivalent. First operand 27 states. Second operand has 26 states, 19 states have (on average 1.368421052631579) internal successors, (26), 20 states have internal predecessors, (26), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-27 12:22:55,306 INFO L74 IsIncluded]: Start isIncluded. First operand 27 states. Second operand has 26 states, 19 states have (on average 1.368421052631579) internal successors, (26), 20 states have internal predecessors, (26), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-27 12:22:55,306 INFO L87 Difference]: Start difference. First operand 27 states. Second operand has 26 states, 19 states have (on average 1.368421052631579) internal successors, (26), 20 states have internal predecessors, (26), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-27 12:22:55,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:22:55,308 INFO L93 Difference]: Finished difference Result 27 states and 33 transitions. [2022-04-27 12:22:55,308 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 33 transitions. [2022-04-27 12:22:55,309 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 12:22:55,309 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 12:22:55,309 INFO L74 IsIncluded]: Start isIncluded. First operand has 26 states, 19 states have (on average 1.368421052631579) internal successors, (26), 20 states have internal predecessors, (26), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 27 states. [2022-04-27 12:22:55,310 INFO L87 Difference]: Start difference. First operand has 26 states, 19 states have (on average 1.368421052631579) internal successors, (26), 20 states have internal predecessors, (26), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 27 states. [2022-04-27 12:22:55,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:22:55,314 INFO L93 Difference]: Finished difference Result 27 states and 33 transitions. [2022-04-27 12:22:55,314 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 33 transitions. [2022-04-27 12:22:55,315 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 12:22:55,315 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 12:22:55,316 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 12:22:55,316 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 12:22:55,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 19 states have (on average 1.368421052631579) internal successors, (26), 20 states have internal predecessors, (26), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-27 12:22:55,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 32 transitions. [2022-04-27 12:22:55,318 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 32 transitions. Word has length 15 [2022-04-27 12:22:55,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 12:22:55,318 INFO L495 AbstractCegarLoop]: Abstraction has 26 states and 32 transitions. [2022-04-27 12:22:55,318 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 12:22:55,319 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 32 transitions. [2022-04-27 12:22:55,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-04-27 12:22:55,322 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 12:22:55,322 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 12:22:55,355 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-04-27 12:22:55,553 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 12:22:55,554 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 12:22:55,556 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 12:22:55,556 INFO L85 PathProgramCache]: Analyzing trace with hash -1207346058, now seen corresponding path program 1 times [2022-04-27 12:22:55,557 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 12:22:55,557 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1226897083] [2022-04-27 12:22:55,557 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 12:22:55,557 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 12:22:55,566 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 12:22:55,566 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [167265213] [2022-04-27 12:22:55,567 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 12:22:55,567 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 12:22:55,567 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 12:22:55,568 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-04-27 12:22:55,569 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-04-27 12:22:55,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:22:55,606 INFO L263 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 14 conjunts are in the unsatisfiable core [2022-04-27 12:22:55,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:22:55,613 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 12:22:55,859 INFO L272 TraceCheckUtils]: 0: Hoare triple {487#true} call ULTIMATE.init(); {487#true} is VALID [2022-04-27 12:22:55,860 INFO L290 TraceCheckUtils]: 1: Hoare triple {487#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(10, 2);~counter~0 := 0; {487#true} is VALID [2022-04-27 12:22:55,862 INFO L290 TraceCheckUtils]: 2: Hoare triple {487#true} assume true; {487#true} is VALID [2022-04-27 12:22:55,862 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {487#true} {487#true} #82#return; {487#true} is VALID [2022-04-27 12:22:55,862 INFO L272 TraceCheckUtils]: 4: Hoare triple {487#true} call #t~ret4 := main(); {487#true} is VALID [2022-04-27 12:22:55,863 INFO L290 TraceCheckUtils]: 5: Hoare triple {487#true} havoc ~A~0;havoc ~B~0;havoc ~q~0;havoc ~r~0;havoc ~b~0;~A~0 := #t~nondet1;havoc #t~nondet1;~B~0 := 1;~q~0 := 0;~r~0 := ~A~0;~b~0 := ~B~0; {507#(and (= main_~b~0 1) (= main_~A~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-27 12:22:55,864 INFO L290 TraceCheckUtils]: 6: Hoare triple {507#(and (= main_~b~0 1) (= main_~A~0 main_~r~0) (= main_~q~0 0))} #t~post2 := ~counter~0;~counter~0 := 1 + #t~post2; {507#(and (= main_~b~0 1) (= main_~A~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-27 12:22:55,865 INFO L290 TraceCheckUtils]: 7: Hoare triple {507#(and (= main_~b~0 1) (= main_~A~0 main_~r~0) (= main_~q~0 0))} assume !!(#t~post2 < 100);havoc #t~post2; {507#(and (= main_~b~0 1) (= main_~A~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-27 12:22:55,866 INFO L290 TraceCheckUtils]: 8: Hoare triple {507#(and (= main_~b~0 1) (= main_~A~0 main_~r~0) (= main_~q~0 0))} assume !(~r~0 % 4294967296 >= ~b~0 % 4294967296); {517#(and (= main_~b~0 1) (not (<= (mod main_~b~0 4294967296) (mod main_~r~0 4294967296))) (= main_~A~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-27 12:22:55,867 INFO L290 TraceCheckUtils]: 9: Hoare triple {517#(and (= main_~b~0 1) (not (<= (mod main_~b~0 4294967296) (mod main_~r~0 4294967296))) (= main_~A~0 main_~r~0) (= main_~q~0 0))} #t~post3 := ~counter~0;~counter~0 := 1 + #t~post3; {517#(and (= main_~b~0 1) (not (<= (mod main_~b~0 4294967296) (mod main_~r~0 4294967296))) (= main_~A~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-27 12:22:55,868 INFO L290 TraceCheckUtils]: 10: Hoare triple {517#(and (= main_~b~0 1) (not (<= (mod main_~b~0 4294967296) (mod main_~r~0 4294967296))) (= main_~A~0 main_~r~0) (= main_~q~0 0))} assume !!(#t~post3 < 100);havoc #t~post3; {517#(and (= main_~b~0 1) (not (<= (mod main_~b~0 4294967296) (mod main_~r~0 4294967296))) (= main_~A~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-27 12:22:55,869 INFO L272 TraceCheckUtils]: 11: Hoare triple {517#(and (= main_~b~0 1) (not (<= (mod main_~b~0 4294967296) (mod main_~r~0 4294967296))) (= main_~A~0 main_~r~0) (= main_~q~0 0))} call __VERIFIER_assert((if ~A~0 % 4294967296 == (~q~0 * ~b~0 + ~r~0) % 4294967296 then 1 else 0)); {527#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 12:22:55,869 INFO L290 TraceCheckUtils]: 12: Hoare triple {527#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {531#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 12:22:55,870 INFO L290 TraceCheckUtils]: 13: Hoare triple {531#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {488#false} is VALID [2022-04-27 12:22:55,870 INFO L290 TraceCheckUtils]: 14: Hoare triple {488#false} assume !false; {488#false} is VALID [2022-04-27 12:22:55,870 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 12:22:55,870 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-27 12:22:55,871 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 12:22:55,871 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1226897083] [2022-04-27 12:22:55,871 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 12:22:55,871 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [167265213] [2022-04-27 12:22:55,872 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [167265213] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 12:22:55,874 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 12:22:55,874 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-27 12:22:55,875 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [766660269] [2022-04-27 12:22:55,875 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 12:22:55,875 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 5 states have internal predecessors, (11), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2022-04-27 12:22:55,875 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 12:22:55,876 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 5 states have internal predecessors, (11), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 12:22:55,889 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 15 edges. 15 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 12:22:55,889 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-27 12:22:55,889 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 12:22:55,890 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-27 12:22:55,890 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-04-27 12:22:55,891 INFO L87 Difference]: Start difference. First operand 26 states and 32 transitions. Second operand has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 5 states have internal predecessors, (11), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 12:22:56,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:22:56,019 INFO L93 Difference]: Finished difference Result 35 states and 42 transitions. [2022-04-27 12:22:56,019 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-27 12:22:56,019 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 5 states have internal predecessors, (11), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2022-04-27 12:22:56,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 12:22:56,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 5 states have internal predecessors, (11), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 12:22:56,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 42 transitions. [2022-04-27 12:22:56,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 5 states have internal predecessors, (11), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 12:22:56,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 42 transitions. [2022-04-27 12:22:56,022 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 42 transitions. [2022-04-27 12:22:56,054 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 42 edges. 42 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 12:22:56,055 INFO L225 Difference]: With dead ends: 35 [2022-04-27 12:22:56,055 INFO L226 Difference]: Without dead ends: 32 [2022-04-27 12:22:56,055 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-04-27 12:22:56,056 INFO L413 NwaCegarLoop]: 21 mSDtfsCounter, 10 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 75 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 12:22:56,056 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 75 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 12:22:56,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2022-04-27 12:22:56,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2022-04-27 12:22:56,061 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 12:22:56,062 INFO L82 GeneralOperation]: Start isEquivalent. First operand 32 states. Second operand has 32 states, 23 states have (on average 1.3043478260869565) internal successors, (30), 24 states have internal predecessors, (30), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-27 12:22:56,062 INFO L74 IsIncluded]: Start isIncluded. First operand 32 states. Second operand has 32 states, 23 states have (on average 1.3043478260869565) internal successors, (30), 24 states have internal predecessors, (30), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-27 12:22:56,062 INFO L87 Difference]: Start difference. First operand 32 states. Second operand has 32 states, 23 states have (on average 1.3043478260869565) internal successors, (30), 24 states have internal predecessors, (30), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-27 12:22:56,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:22:56,063 INFO L93 Difference]: Finished difference Result 32 states and 38 transitions. [2022-04-27 12:22:56,063 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 38 transitions. [2022-04-27 12:22:56,063 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 12:22:56,063 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 12:22:56,064 INFO L74 IsIncluded]: Start isIncluded. First operand has 32 states, 23 states have (on average 1.3043478260869565) internal successors, (30), 24 states have internal predecessors, (30), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 32 states. [2022-04-27 12:22:56,064 INFO L87 Difference]: Start difference. First operand has 32 states, 23 states have (on average 1.3043478260869565) internal successors, (30), 24 states have internal predecessors, (30), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 32 states. [2022-04-27 12:22:56,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:22:56,065 INFO L93 Difference]: Finished difference Result 32 states and 38 transitions. [2022-04-27 12:22:56,065 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 38 transitions. [2022-04-27 12:22:56,065 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 12:22:56,065 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 12:22:56,065 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 12:22:56,065 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 12:22:56,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 23 states have (on average 1.3043478260869565) internal successors, (30), 24 states have internal predecessors, (30), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-27 12:22:56,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 38 transitions. [2022-04-27 12:22:56,067 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 38 transitions. Word has length 15 [2022-04-27 12:22:56,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 12:22:56,067 INFO L495 AbstractCegarLoop]: Abstraction has 32 states and 38 transitions. [2022-04-27 12:22:56,067 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 5 states have internal predecessors, (11), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 12:22:56,067 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 38 transitions. [2022-04-27 12:22:56,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-04-27 12:22:56,067 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 12:22:56,067 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 12:22:56,116 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-04-27 12:22:56,268 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2022-04-27 12:22:56,268 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 12:22:56,269 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 12:22:56,269 INFO L85 PathProgramCache]: Analyzing trace with hash -352921097, now seen corresponding path program 1 times [2022-04-27 12:22:56,269 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 12:22:56,269 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [117109537] [2022-04-27 12:22:56,269 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 12:22:56,273 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 12:22:56,283 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 12:22:56,283 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [483152310] [2022-04-27 12:22:56,283 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 12:22:56,284 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 12:22:56,284 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 12:22:56,297 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-04-27 12:22:56,315 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-04-27 12:22:56,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:22:56,357 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-27 12:22:56,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:22:56,363 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 12:22:56,460 INFO L272 TraceCheckUtils]: 0: Hoare triple {693#true} call ULTIMATE.init(); {693#true} is VALID [2022-04-27 12:22:56,461 INFO L290 TraceCheckUtils]: 1: Hoare triple {693#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(10, 2);~counter~0 := 0; {701#(<= ~counter~0 0)} is VALID [2022-04-27 12:22:56,461 INFO L290 TraceCheckUtils]: 2: Hoare triple {701#(<= ~counter~0 0)} assume true; {701#(<= ~counter~0 0)} is VALID [2022-04-27 12:22:56,462 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {701#(<= ~counter~0 0)} {693#true} #82#return; {701#(<= ~counter~0 0)} is VALID [2022-04-27 12:22:56,462 INFO L272 TraceCheckUtils]: 4: Hoare triple {701#(<= ~counter~0 0)} call #t~ret4 := main(); {701#(<= ~counter~0 0)} is VALID [2022-04-27 12:22:56,462 INFO L290 TraceCheckUtils]: 5: Hoare triple {701#(<= ~counter~0 0)} havoc ~A~0;havoc ~B~0;havoc ~q~0;havoc ~r~0;havoc ~b~0;~A~0 := #t~nondet1;havoc #t~nondet1;~B~0 := 1;~q~0 := 0;~r~0 := ~A~0;~b~0 := ~B~0; {701#(<= ~counter~0 0)} is VALID [2022-04-27 12:22:56,463 INFO L290 TraceCheckUtils]: 6: Hoare triple {701#(<= ~counter~0 0)} #t~post2 := ~counter~0;~counter~0 := 1 + #t~post2; {717#(<= ~counter~0 1)} is VALID [2022-04-27 12:22:56,463 INFO L290 TraceCheckUtils]: 7: Hoare triple {717#(<= ~counter~0 1)} assume !!(#t~post2 < 100);havoc #t~post2; {717#(<= ~counter~0 1)} is VALID [2022-04-27 12:22:56,464 INFO L290 TraceCheckUtils]: 8: Hoare triple {717#(<= ~counter~0 1)} assume !!(~r~0 % 4294967296 >= ~b~0 % 4294967296);~b~0 := 2 * ~b~0; {717#(<= ~counter~0 1)} is VALID [2022-04-27 12:22:56,464 INFO L290 TraceCheckUtils]: 9: Hoare triple {717#(<= ~counter~0 1)} #t~post2 := ~counter~0;~counter~0 := 1 + #t~post2; {727#(<= |main_#t~post2| 1)} is VALID [2022-04-27 12:22:56,464 INFO L290 TraceCheckUtils]: 10: Hoare triple {727#(<= |main_#t~post2| 1)} assume !(#t~post2 < 100);havoc #t~post2; {694#false} is VALID [2022-04-27 12:22:56,464 INFO L290 TraceCheckUtils]: 11: Hoare triple {694#false} #t~post3 := ~counter~0;~counter~0 := 1 + #t~post3; {694#false} is VALID [2022-04-27 12:22:56,465 INFO L290 TraceCheckUtils]: 12: Hoare triple {694#false} assume !(#t~post3 < 100);havoc #t~post3; {694#false} is VALID [2022-04-27 12:22:56,465 INFO L272 TraceCheckUtils]: 13: Hoare triple {694#false} call __VERIFIER_assert((if ~A~0 % 4294967296 == (~q~0 * ~b~0 + ~r~0) % 4294967296 then 1 else 0)); {694#false} is VALID [2022-04-27 12:22:56,465 INFO L290 TraceCheckUtils]: 14: Hoare triple {694#false} ~cond := #in~cond; {694#false} is VALID [2022-04-27 12:22:56,465 INFO L290 TraceCheckUtils]: 15: Hoare triple {694#false} assume 0 == ~cond; {694#false} is VALID [2022-04-27 12:22:56,465 INFO L290 TraceCheckUtils]: 16: Hoare triple {694#false} assume !false; {694#false} is VALID [2022-04-27 12:22:56,465 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 12:22:56,465 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 12:22:56,570 INFO L290 TraceCheckUtils]: 16: Hoare triple {694#false} assume !false; {694#false} is VALID [2022-04-27 12:22:56,570 INFO L290 TraceCheckUtils]: 15: Hoare triple {694#false} assume 0 == ~cond; {694#false} is VALID [2022-04-27 12:22:56,570 INFO L290 TraceCheckUtils]: 14: Hoare triple {694#false} ~cond := #in~cond; {694#false} is VALID [2022-04-27 12:22:56,570 INFO L272 TraceCheckUtils]: 13: Hoare triple {694#false} call __VERIFIER_assert((if ~A~0 % 4294967296 == (~q~0 * ~b~0 + ~r~0) % 4294967296 then 1 else 0)); {694#false} is VALID [2022-04-27 12:22:56,570 INFO L290 TraceCheckUtils]: 12: Hoare triple {694#false} assume !(#t~post3 < 100);havoc #t~post3; {694#false} is VALID [2022-04-27 12:22:56,570 INFO L290 TraceCheckUtils]: 11: Hoare triple {694#false} #t~post3 := ~counter~0;~counter~0 := 1 + #t~post3; {694#false} is VALID [2022-04-27 12:22:56,571 INFO L290 TraceCheckUtils]: 10: Hoare triple {767#(< |main_#t~post2| 100)} assume !(#t~post2 < 100);havoc #t~post2; {694#false} is VALID [2022-04-27 12:22:56,571 INFO L290 TraceCheckUtils]: 9: Hoare triple {771#(< ~counter~0 100)} #t~post2 := ~counter~0;~counter~0 := 1 + #t~post2; {767#(< |main_#t~post2| 100)} is VALID [2022-04-27 12:22:56,571 INFO L290 TraceCheckUtils]: 8: Hoare triple {771#(< ~counter~0 100)} assume !!(~r~0 % 4294967296 >= ~b~0 % 4294967296);~b~0 := 2 * ~b~0; {771#(< ~counter~0 100)} is VALID [2022-04-27 12:22:56,572 INFO L290 TraceCheckUtils]: 7: Hoare triple {771#(< ~counter~0 100)} assume !!(#t~post2 < 100);havoc #t~post2; {771#(< ~counter~0 100)} is VALID [2022-04-27 12:22:56,572 INFO L290 TraceCheckUtils]: 6: Hoare triple {781#(< ~counter~0 99)} #t~post2 := ~counter~0;~counter~0 := 1 + #t~post2; {771#(< ~counter~0 100)} is VALID [2022-04-27 12:22:56,572 INFO L290 TraceCheckUtils]: 5: Hoare triple {781#(< ~counter~0 99)} havoc ~A~0;havoc ~B~0;havoc ~q~0;havoc ~r~0;havoc ~b~0;~A~0 := #t~nondet1;havoc #t~nondet1;~B~0 := 1;~q~0 := 0;~r~0 := ~A~0;~b~0 := ~B~0; {781#(< ~counter~0 99)} is VALID [2022-04-27 12:22:56,573 INFO L272 TraceCheckUtils]: 4: Hoare triple {781#(< ~counter~0 99)} call #t~ret4 := main(); {781#(< ~counter~0 99)} is VALID [2022-04-27 12:22:56,573 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {781#(< ~counter~0 99)} {693#true} #82#return; {781#(< ~counter~0 99)} is VALID [2022-04-27 12:22:56,573 INFO L290 TraceCheckUtils]: 2: Hoare triple {781#(< ~counter~0 99)} assume true; {781#(< ~counter~0 99)} is VALID [2022-04-27 12:22:56,574 INFO L290 TraceCheckUtils]: 1: Hoare triple {693#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(10, 2);~counter~0 := 0; {781#(< ~counter~0 99)} is VALID [2022-04-27 12:22:56,574 INFO L272 TraceCheckUtils]: 0: Hoare triple {693#true} call ULTIMATE.init(); {693#true} is VALID [2022-04-27 12:22:56,574 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 12:22:56,574 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 12:22:56,574 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [117109537] [2022-04-27 12:22:56,575 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 12:22:56,575 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [483152310] [2022-04-27 12:22:56,575 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [483152310] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 12:22:56,575 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-27 12:22:56,575 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2022-04-27 12:22:56,575 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [128936307] [2022-04-27 12:22:56,575 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-27 12:22:56,575 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.625) internal successors, (21), 7 states have internal predecessors, (21), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 17 [2022-04-27 12:22:56,576 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 12:22:56,576 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 2.625) internal successors, (21), 7 states have internal predecessors, (21), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-27 12:22:56,591 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 12:22:56,591 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-27 12:22:56,591 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 12:22:56,592 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-27 12:22:56,592 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2022-04-27 12:22:56,592 INFO L87 Difference]: Start difference. First operand 32 states and 38 transitions. Second operand has 8 states, 8 states have (on average 2.625) internal successors, (21), 7 states have internal predecessors, (21), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-27 12:22:56,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:22:56,738 INFO L93 Difference]: Finished difference Result 66 states and 84 transitions. [2022-04-27 12:22:56,738 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-04-27 12:22:56,738 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.625) internal successors, (21), 7 states have internal predecessors, (21), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 17 [2022-04-27 12:22:56,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 12:22:56,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 2.625) internal successors, (21), 7 states have internal predecessors, (21), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-27 12:22:56,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 84 transitions. [2022-04-27 12:22:56,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 2.625) internal successors, (21), 7 states have internal predecessors, (21), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-27 12:22:56,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 84 transitions. [2022-04-27 12:22:56,742 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 10 states and 84 transitions. [2022-04-27 12:22:56,796 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 84 edges. 84 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 12:22:56,797 INFO L225 Difference]: With dead ends: 66 [2022-04-27 12:22:56,798 INFO L226 Difference]: Without dead ends: 54 [2022-04-27 12:22:56,798 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2022-04-27 12:22:56,798 INFO L413 NwaCegarLoop]: 25 mSDtfsCounter, 31 mSDsluCounter, 107 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 132 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 12:22:56,799 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 132 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 12:22:56,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2022-04-27 12:22:56,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 40. [2022-04-27 12:22:56,807 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 12:22:56,807 INFO L82 GeneralOperation]: Start isEquivalent. First operand 54 states. Second operand has 40 states, 31 states have (on average 1.2903225806451613) internal successors, (40), 32 states have internal predecessors, (40), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-27 12:22:56,807 INFO L74 IsIncluded]: Start isIncluded. First operand 54 states. Second operand has 40 states, 31 states have (on average 1.2903225806451613) internal successors, (40), 32 states have internal predecessors, (40), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-27 12:22:56,807 INFO L87 Difference]: Start difference. First operand 54 states. Second operand has 40 states, 31 states have (on average 1.2903225806451613) internal successors, (40), 32 states have internal predecessors, (40), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-27 12:22:56,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:22:56,808 INFO L93 Difference]: Finished difference Result 54 states and 66 transitions. [2022-04-27 12:22:56,809 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 66 transitions. [2022-04-27 12:22:56,809 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 12:22:56,809 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 12:22:56,809 INFO L74 IsIncluded]: Start isIncluded. First operand has 40 states, 31 states have (on average 1.2903225806451613) internal successors, (40), 32 states have internal predecessors, (40), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 54 states. [2022-04-27 12:22:56,809 INFO L87 Difference]: Start difference. First operand has 40 states, 31 states have (on average 1.2903225806451613) internal successors, (40), 32 states have internal predecessors, (40), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 54 states. [2022-04-27 12:22:56,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:22:56,810 INFO L93 Difference]: Finished difference Result 54 states and 66 transitions. [2022-04-27 12:22:56,811 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 66 transitions. [2022-04-27 12:22:56,811 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 12:22:56,811 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 12:22:56,811 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 12:22:56,811 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 12:22:56,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 31 states have (on average 1.2903225806451613) internal successors, (40), 32 states have internal predecessors, (40), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-27 12:22:56,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 48 transitions. [2022-04-27 12:22:56,812 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 48 transitions. Word has length 17 [2022-04-27 12:22:56,812 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 12:22:56,812 INFO L495 AbstractCegarLoop]: Abstraction has 40 states and 48 transitions. [2022-04-27 12:22:56,812 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.625) internal successors, (21), 7 states have internal predecessors, (21), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-27 12:22:56,812 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 48 transitions. [2022-04-27 12:22:56,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-04-27 12:22:56,813 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 12:22:56,813 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 12:22:56,829 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-04-27 12:22:57,029 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 12:22:57,029 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 12:22:57,030 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 12:22:57,030 INFO L85 PathProgramCache]: Analyzing trace with hash 1615882355, now seen corresponding path program 1 times [2022-04-27 12:22:57,030 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 12:22:57,030 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [618994381] [2022-04-27 12:22:57,030 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 12:22:57,030 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 12:22:57,042 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 12:22:57,042 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [872980346] [2022-04-27 12:22:57,042 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 12:22:57,042 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 12:22:57,042 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 12:22:57,047 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-04-27 12:22:57,052 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-04-27 12:22:57,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:22:57,090 INFO L263 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-27 12:22:57,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:22:57,096 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 12:22:57,192 INFO L272 TraceCheckUtils]: 0: Hoare triple {1056#true} call ULTIMATE.init(); {1056#true} is VALID [2022-04-27 12:22:57,193 INFO L290 TraceCheckUtils]: 1: Hoare triple {1056#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(10, 2);~counter~0 := 0; {1064#(<= ~counter~0 0)} is VALID [2022-04-27 12:22:57,193 INFO L290 TraceCheckUtils]: 2: Hoare triple {1064#(<= ~counter~0 0)} assume true; {1064#(<= ~counter~0 0)} is VALID [2022-04-27 12:22:57,194 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1064#(<= ~counter~0 0)} {1056#true} #82#return; {1064#(<= ~counter~0 0)} is VALID [2022-04-27 12:22:57,194 INFO L272 TraceCheckUtils]: 4: Hoare triple {1064#(<= ~counter~0 0)} call #t~ret4 := main(); {1064#(<= ~counter~0 0)} is VALID [2022-04-27 12:22:57,194 INFO L290 TraceCheckUtils]: 5: Hoare triple {1064#(<= ~counter~0 0)} havoc ~A~0;havoc ~B~0;havoc ~q~0;havoc ~r~0;havoc ~b~0;~A~0 := #t~nondet1;havoc #t~nondet1;~B~0 := 1;~q~0 := 0;~r~0 := ~A~0;~b~0 := ~B~0; {1064#(<= ~counter~0 0)} is VALID [2022-04-27 12:22:57,195 INFO L290 TraceCheckUtils]: 6: Hoare triple {1064#(<= ~counter~0 0)} #t~post2 := ~counter~0;~counter~0 := 1 + #t~post2; {1080#(<= ~counter~0 1)} is VALID [2022-04-27 12:22:57,195 INFO L290 TraceCheckUtils]: 7: Hoare triple {1080#(<= ~counter~0 1)} assume !!(#t~post2 < 100);havoc #t~post2; {1080#(<= ~counter~0 1)} is VALID [2022-04-27 12:22:57,195 INFO L290 TraceCheckUtils]: 8: Hoare triple {1080#(<= ~counter~0 1)} assume !!(~r~0 % 4294967296 >= ~b~0 % 4294967296);~b~0 := 2 * ~b~0; {1080#(<= ~counter~0 1)} is VALID [2022-04-27 12:22:57,196 INFO L290 TraceCheckUtils]: 9: Hoare triple {1080#(<= ~counter~0 1)} #t~post2 := ~counter~0;~counter~0 := 1 + #t~post2; {1090#(<= ~counter~0 2)} is VALID [2022-04-27 12:22:57,196 INFO L290 TraceCheckUtils]: 10: Hoare triple {1090#(<= ~counter~0 2)} assume !!(#t~post2 < 100);havoc #t~post2; {1090#(<= ~counter~0 2)} is VALID [2022-04-27 12:22:57,197 INFO L290 TraceCheckUtils]: 11: Hoare triple {1090#(<= ~counter~0 2)} assume !(~r~0 % 4294967296 >= ~b~0 % 4294967296); {1090#(<= ~counter~0 2)} is VALID [2022-04-27 12:22:57,197 INFO L290 TraceCheckUtils]: 12: Hoare triple {1090#(<= ~counter~0 2)} #t~post3 := ~counter~0;~counter~0 := 1 + #t~post3; {1100#(<= |main_#t~post3| 2)} is VALID [2022-04-27 12:22:57,197 INFO L290 TraceCheckUtils]: 13: Hoare triple {1100#(<= |main_#t~post3| 2)} assume !(#t~post3 < 100);havoc #t~post3; {1057#false} is VALID [2022-04-27 12:22:57,197 INFO L272 TraceCheckUtils]: 14: Hoare triple {1057#false} call __VERIFIER_assert((if ~A~0 % 4294967296 == (~q~0 * ~b~0 + ~r~0) % 4294967296 then 1 else 0)); {1057#false} is VALID [2022-04-27 12:22:57,198 INFO L290 TraceCheckUtils]: 15: Hoare triple {1057#false} ~cond := #in~cond; {1057#false} is VALID [2022-04-27 12:22:57,198 INFO L290 TraceCheckUtils]: 16: Hoare triple {1057#false} assume 0 == ~cond; {1057#false} is VALID [2022-04-27 12:22:57,198 INFO L290 TraceCheckUtils]: 17: Hoare triple {1057#false} assume !false; {1057#false} is VALID [2022-04-27 12:22:57,198 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 12:22:57,198 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 12:22:57,316 INFO L290 TraceCheckUtils]: 17: Hoare triple {1057#false} assume !false; {1057#false} is VALID [2022-04-27 12:22:57,316 INFO L290 TraceCheckUtils]: 16: Hoare triple {1057#false} assume 0 == ~cond; {1057#false} is VALID [2022-04-27 12:22:57,316 INFO L290 TraceCheckUtils]: 15: Hoare triple {1057#false} ~cond := #in~cond; {1057#false} is VALID [2022-04-27 12:22:57,317 INFO L272 TraceCheckUtils]: 14: Hoare triple {1057#false} call __VERIFIER_assert((if ~A~0 % 4294967296 == (~q~0 * ~b~0 + ~r~0) % 4294967296 then 1 else 0)); {1057#false} is VALID [2022-04-27 12:22:57,317 INFO L290 TraceCheckUtils]: 13: Hoare triple {1128#(< |main_#t~post3| 100)} assume !(#t~post3 < 100);havoc #t~post3; {1057#false} is VALID [2022-04-27 12:22:57,317 INFO L290 TraceCheckUtils]: 12: Hoare triple {1132#(< ~counter~0 100)} #t~post3 := ~counter~0;~counter~0 := 1 + #t~post3; {1128#(< |main_#t~post3| 100)} is VALID [2022-04-27 12:22:57,318 INFO L290 TraceCheckUtils]: 11: Hoare triple {1132#(< ~counter~0 100)} assume !(~r~0 % 4294967296 >= ~b~0 % 4294967296); {1132#(< ~counter~0 100)} is VALID [2022-04-27 12:22:57,318 INFO L290 TraceCheckUtils]: 10: Hoare triple {1132#(< ~counter~0 100)} assume !!(#t~post2 < 100);havoc #t~post2; {1132#(< ~counter~0 100)} is VALID [2022-04-27 12:22:57,318 INFO L290 TraceCheckUtils]: 9: Hoare triple {1142#(< ~counter~0 99)} #t~post2 := ~counter~0;~counter~0 := 1 + #t~post2; {1132#(< ~counter~0 100)} is VALID [2022-04-27 12:22:57,319 INFO L290 TraceCheckUtils]: 8: Hoare triple {1142#(< ~counter~0 99)} assume !!(~r~0 % 4294967296 >= ~b~0 % 4294967296);~b~0 := 2 * ~b~0; {1142#(< ~counter~0 99)} is VALID [2022-04-27 12:22:57,319 INFO L290 TraceCheckUtils]: 7: Hoare triple {1142#(< ~counter~0 99)} assume !!(#t~post2 < 100);havoc #t~post2; {1142#(< ~counter~0 99)} is VALID [2022-04-27 12:22:57,320 INFO L290 TraceCheckUtils]: 6: Hoare triple {1152#(< ~counter~0 98)} #t~post2 := ~counter~0;~counter~0 := 1 + #t~post2; {1142#(< ~counter~0 99)} is VALID [2022-04-27 12:22:57,320 INFO L290 TraceCheckUtils]: 5: Hoare triple {1152#(< ~counter~0 98)} havoc ~A~0;havoc ~B~0;havoc ~q~0;havoc ~r~0;havoc ~b~0;~A~0 := #t~nondet1;havoc #t~nondet1;~B~0 := 1;~q~0 := 0;~r~0 := ~A~0;~b~0 := ~B~0; {1152#(< ~counter~0 98)} is VALID [2022-04-27 12:22:57,320 INFO L272 TraceCheckUtils]: 4: Hoare triple {1152#(< ~counter~0 98)} call #t~ret4 := main(); {1152#(< ~counter~0 98)} is VALID [2022-04-27 12:22:57,321 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1152#(< ~counter~0 98)} {1056#true} #82#return; {1152#(< ~counter~0 98)} is VALID [2022-04-27 12:22:57,321 INFO L290 TraceCheckUtils]: 2: Hoare triple {1152#(< ~counter~0 98)} assume true; {1152#(< ~counter~0 98)} is VALID [2022-04-27 12:22:57,321 INFO L290 TraceCheckUtils]: 1: Hoare triple {1056#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(10, 2);~counter~0 := 0; {1152#(< ~counter~0 98)} is VALID [2022-04-27 12:22:57,322 INFO L272 TraceCheckUtils]: 0: Hoare triple {1056#true} call ULTIMATE.init(); {1056#true} is VALID [2022-04-27 12:22:57,322 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 12:22:57,322 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 12:22:57,322 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [618994381] [2022-04-27 12:22:57,322 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 12:22:57,322 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [872980346] [2022-04-27 12:22:57,322 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [872980346] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 12:22:57,322 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-27 12:22:57,322 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2022-04-27 12:22:57,322 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1028621207] [2022-04-27 12:22:57,322 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-27 12:22:57,323 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.5) internal successors, (25), 9 states have internal predecessors, (25), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 18 [2022-04-27 12:22:57,323 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 12:22:57,323 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 10 states, 10 states have (on average 2.5) internal successors, (25), 9 states have internal predecessors, (25), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-27 12:22:57,357 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 31 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 12:22:57,357 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-27 12:22:57,358 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 12:22:57,358 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-27 12:22:57,358 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-04-27 12:22:57,358 INFO L87 Difference]: Start difference. First operand 40 states and 48 transitions. Second operand has 10 states, 10 states have (on average 2.5) internal successors, (25), 9 states have internal predecessors, (25), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-27 12:22:57,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:22:57,609 INFO L93 Difference]: Finished difference Result 91 states and 112 transitions. [2022-04-27 12:22:57,609 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-04-27 12:22:57,609 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.5) internal successors, (25), 9 states have internal predecessors, (25), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 18 [2022-04-27 12:22:57,610 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 12:22:57,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 2.5) internal successors, (25), 9 states have internal predecessors, (25), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-27 12:22:57,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 112 transitions. [2022-04-27 12:22:57,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 2.5) internal successors, (25), 9 states have internal predecessors, (25), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-27 12:22:57,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 112 transitions. [2022-04-27 12:22:57,614 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 13 states and 112 transitions. [2022-04-27 12:22:57,668 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 112 edges. 112 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 12:22:57,669 INFO L225 Difference]: With dead ends: 91 [2022-04-27 12:22:57,669 INFO L226 Difference]: Without dead ends: 84 [2022-04-27 12:22:57,670 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=63, Invalid=119, Unknown=0, NotChecked=0, Total=182 [2022-04-27 12:22:57,670 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 80 mSDsluCounter, 139 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 166 SdHoareTripleChecker+Invalid, 76 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 12:22:57,670 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [80 Valid, 166 Invalid, 76 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 12:22:57,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2022-04-27 12:22:57,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 77. [2022-04-27 12:22:57,683 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 12:22:57,684 INFO L82 GeneralOperation]: Start isEquivalent. First operand 84 states. Second operand has 77 states, 59 states have (on average 1.3728813559322033) internal successors, (81), 63 states have internal predecessors, (81), 11 states have call successors, (11), 7 states have call predecessors, (11), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-27 12:22:57,684 INFO L74 IsIncluded]: Start isIncluded. First operand 84 states. Second operand has 77 states, 59 states have (on average 1.3728813559322033) internal successors, (81), 63 states have internal predecessors, (81), 11 states have call successors, (11), 7 states have call predecessors, (11), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-27 12:22:57,684 INFO L87 Difference]: Start difference. First operand 84 states. Second operand has 77 states, 59 states have (on average 1.3728813559322033) internal successors, (81), 63 states have internal predecessors, (81), 11 states have call successors, (11), 7 states have call predecessors, (11), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-27 12:22:57,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:22:57,686 INFO L93 Difference]: Finished difference Result 84 states and 102 transitions. [2022-04-27 12:22:57,686 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 102 transitions. [2022-04-27 12:22:57,686 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 12:22:57,686 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 12:22:57,687 INFO L74 IsIncluded]: Start isIncluded. First operand has 77 states, 59 states have (on average 1.3728813559322033) internal successors, (81), 63 states have internal predecessors, (81), 11 states have call successors, (11), 7 states have call predecessors, (11), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand 84 states. [2022-04-27 12:22:57,687 INFO L87 Difference]: Start difference. First operand has 77 states, 59 states have (on average 1.3728813559322033) internal successors, (81), 63 states have internal predecessors, (81), 11 states have call successors, (11), 7 states have call predecessors, (11), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand 84 states. [2022-04-27 12:22:57,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:22:57,689 INFO L93 Difference]: Finished difference Result 84 states and 102 transitions. [2022-04-27 12:22:57,689 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 102 transitions. [2022-04-27 12:22:57,689 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 12:22:57,689 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 12:22:57,689 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 12:22:57,689 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 12:22:57,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 59 states have (on average 1.3728813559322033) internal successors, (81), 63 states have internal predecessors, (81), 11 states have call successors, (11), 7 states have call predecessors, (11), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-27 12:22:57,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 98 transitions. [2022-04-27 12:22:57,698 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 98 transitions. Word has length 18 [2022-04-27 12:22:57,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 12:22:57,699 INFO L495 AbstractCegarLoop]: Abstraction has 77 states and 98 transitions. [2022-04-27 12:22:57,699 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.5) internal successors, (25), 9 states have internal predecessors, (25), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-27 12:22:57,699 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 98 transitions. [2022-04-27 12:22:57,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-04-27 12:22:57,699 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 12:22:57,699 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 12:22:57,742 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-04-27 12:22:57,919 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 12:22:57,919 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 12:22:57,920 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 12:22:57,920 INFO L85 PathProgramCache]: Analyzing trace with hash 1617669815, now seen corresponding path program 1 times [2022-04-27 12:22:57,920 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 12:22:57,920 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1061782312] [2022-04-27 12:22:57,920 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 12:22:57,920 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 12:22:57,930 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 12:22:57,930 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [825538447] [2022-04-27 12:22:57,930 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 12:22:57,930 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 12:22:57,930 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 12:22:57,931 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-04-27 12:22:57,932 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-04-27 12:22:57,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:22:57,973 INFO L263 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 14 conjunts are in the unsatisfiable core [2022-04-27 12:22:57,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:22:57,981 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 12:22:58,225 INFO L272 TraceCheckUtils]: 0: Hoare triple {1568#true} call ULTIMATE.init(); {1568#true} is VALID [2022-04-27 12:22:58,226 INFO L290 TraceCheckUtils]: 1: Hoare triple {1568#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(10, 2);~counter~0 := 0; {1568#true} is VALID [2022-04-27 12:22:58,226 INFO L290 TraceCheckUtils]: 2: Hoare triple {1568#true} assume true; {1568#true} is VALID [2022-04-27 12:22:58,226 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1568#true} {1568#true} #82#return; {1568#true} is VALID [2022-04-27 12:22:58,226 INFO L272 TraceCheckUtils]: 4: Hoare triple {1568#true} call #t~ret4 := main(); {1568#true} is VALID [2022-04-27 12:22:58,226 INFO L290 TraceCheckUtils]: 5: Hoare triple {1568#true} havoc ~A~0;havoc ~B~0;havoc ~q~0;havoc ~r~0;havoc ~b~0;~A~0 := #t~nondet1;havoc #t~nondet1;~B~0 := 1;~q~0 := 0;~r~0 := ~A~0;~b~0 := ~B~0; {1588#(and (= main_~b~0 1) (= main_~A~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-27 12:22:58,227 INFO L290 TraceCheckUtils]: 6: Hoare triple {1588#(and (= main_~b~0 1) (= main_~A~0 main_~r~0) (= main_~q~0 0))} #t~post2 := ~counter~0;~counter~0 := 1 + #t~post2; {1588#(and (= main_~b~0 1) (= main_~A~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-27 12:22:58,227 INFO L290 TraceCheckUtils]: 7: Hoare triple {1588#(and (= main_~b~0 1) (= main_~A~0 main_~r~0) (= main_~q~0 0))} assume !!(#t~post2 < 100);havoc #t~post2; {1588#(and (= main_~b~0 1) (= main_~A~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-27 12:22:58,228 INFO L290 TraceCheckUtils]: 8: Hoare triple {1588#(and (= main_~b~0 1) (= main_~A~0 main_~r~0) (= main_~q~0 0))} assume !!(~r~0 % 4294967296 >= ~b~0 % 4294967296);~b~0 := 2 * ~b~0; {1598#(and (= main_~A~0 main_~r~0) (<= 1 (mod main_~r~0 4294967296)) (= main_~q~0 0))} is VALID [2022-04-27 12:22:58,228 INFO L290 TraceCheckUtils]: 9: Hoare triple {1598#(and (= main_~A~0 main_~r~0) (<= 1 (mod main_~r~0 4294967296)) (= main_~q~0 0))} #t~post2 := ~counter~0;~counter~0 := 1 + #t~post2; {1598#(and (= main_~A~0 main_~r~0) (<= 1 (mod main_~r~0 4294967296)) (= main_~q~0 0))} is VALID [2022-04-27 12:22:58,228 INFO L290 TraceCheckUtils]: 10: Hoare triple {1598#(and (= main_~A~0 main_~r~0) (<= 1 (mod main_~r~0 4294967296)) (= main_~q~0 0))} assume !!(#t~post2 < 100);havoc #t~post2; {1598#(and (= main_~A~0 main_~r~0) (<= 1 (mod main_~r~0 4294967296)) (= main_~q~0 0))} is VALID [2022-04-27 12:22:58,229 INFO L290 TraceCheckUtils]: 11: Hoare triple {1598#(and (= main_~A~0 main_~r~0) (<= 1 (mod main_~r~0 4294967296)) (= main_~q~0 0))} assume !(~r~0 % 4294967296 >= ~b~0 % 4294967296); {1598#(and (= main_~A~0 main_~r~0) (<= 1 (mod main_~r~0 4294967296)) (= main_~q~0 0))} is VALID [2022-04-27 12:22:58,229 INFO L290 TraceCheckUtils]: 12: Hoare triple {1598#(and (= main_~A~0 main_~r~0) (<= 1 (mod main_~r~0 4294967296)) (= main_~q~0 0))} #t~post3 := ~counter~0;~counter~0 := 1 + #t~post3; {1598#(and (= main_~A~0 main_~r~0) (<= 1 (mod main_~r~0 4294967296)) (= main_~q~0 0))} is VALID [2022-04-27 12:22:58,230 INFO L290 TraceCheckUtils]: 13: Hoare triple {1598#(and (= main_~A~0 main_~r~0) (<= 1 (mod main_~r~0 4294967296)) (= main_~q~0 0))} assume !!(#t~post3 < 100);havoc #t~post3; {1598#(and (= main_~A~0 main_~r~0) (<= 1 (mod main_~r~0 4294967296)) (= main_~q~0 0))} is VALID [2022-04-27 12:22:58,230 INFO L272 TraceCheckUtils]: 14: Hoare triple {1598#(and (= main_~A~0 main_~r~0) (<= 1 (mod main_~r~0 4294967296)) (= main_~q~0 0))} call __VERIFIER_assert((if ~A~0 % 4294967296 == (~q~0 * ~b~0 + ~r~0) % 4294967296 then 1 else 0)); {1617#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 12:22:58,231 INFO L290 TraceCheckUtils]: 15: Hoare triple {1617#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1621#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 12:22:58,231 INFO L290 TraceCheckUtils]: 16: Hoare triple {1621#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1569#false} is VALID [2022-04-27 12:22:58,231 INFO L290 TraceCheckUtils]: 17: Hoare triple {1569#false} assume !false; {1569#false} is VALID [2022-04-27 12:22:58,232 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 12:22:58,232 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 12:22:58,535 INFO L290 TraceCheckUtils]: 17: Hoare triple {1569#false} assume !false; {1569#false} is VALID [2022-04-27 12:22:58,536 INFO L290 TraceCheckUtils]: 16: Hoare triple {1621#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1569#false} is VALID [2022-04-27 12:22:58,536 INFO L290 TraceCheckUtils]: 15: Hoare triple {1617#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1621#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 12:22:58,537 INFO L272 TraceCheckUtils]: 14: Hoare triple {1637#(forall ((main_~b~0 Int)) (= (mod main_~A~0 4294967296) (mod (+ main_~r~0 (* main_~b~0 main_~q~0)) 4294967296)))} call __VERIFIER_assert((if ~A~0 % 4294967296 == (~q~0 * ~b~0 + ~r~0) % 4294967296 then 1 else 0)); {1617#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 12:22:58,538 INFO L290 TraceCheckUtils]: 13: Hoare triple {1637#(forall ((main_~b~0 Int)) (= (mod main_~A~0 4294967296) (mod (+ main_~r~0 (* main_~b~0 main_~q~0)) 4294967296)))} assume !!(#t~post3 < 100);havoc #t~post3; {1637#(forall ((main_~b~0 Int)) (= (mod main_~A~0 4294967296) (mod (+ main_~r~0 (* main_~b~0 main_~q~0)) 4294967296)))} is VALID [2022-04-27 12:22:58,538 INFO L290 TraceCheckUtils]: 12: Hoare triple {1637#(forall ((main_~b~0 Int)) (= (mod main_~A~0 4294967296) (mod (+ main_~r~0 (* main_~b~0 main_~q~0)) 4294967296)))} #t~post3 := ~counter~0;~counter~0 := 1 + #t~post3; {1637#(forall ((main_~b~0 Int)) (= (mod main_~A~0 4294967296) (mod (+ main_~r~0 (* main_~b~0 main_~q~0)) 4294967296)))} is VALID [2022-04-27 12:22:58,539 INFO L290 TraceCheckUtils]: 11: Hoare triple {1637#(forall ((main_~b~0 Int)) (= (mod main_~A~0 4294967296) (mod (+ main_~r~0 (* main_~b~0 main_~q~0)) 4294967296)))} assume !(~r~0 % 4294967296 >= ~b~0 % 4294967296); {1637#(forall ((main_~b~0 Int)) (= (mod main_~A~0 4294967296) (mod (+ main_~r~0 (* main_~b~0 main_~q~0)) 4294967296)))} is VALID [2022-04-27 12:22:58,539 INFO L290 TraceCheckUtils]: 10: Hoare triple {1637#(forall ((main_~b~0 Int)) (= (mod main_~A~0 4294967296) (mod (+ main_~r~0 (* main_~b~0 main_~q~0)) 4294967296)))} assume !!(#t~post2 < 100);havoc #t~post2; {1637#(forall ((main_~b~0 Int)) (= (mod main_~A~0 4294967296) (mod (+ main_~r~0 (* main_~b~0 main_~q~0)) 4294967296)))} is VALID [2022-04-27 12:22:58,539 INFO L290 TraceCheckUtils]: 9: Hoare triple {1637#(forall ((main_~b~0 Int)) (= (mod main_~A~0 4294967296) (mod (+ main_~r~0 (* main_~b~0 main_~q~0)) 4294967296)))} #t~post2 := ~counter~0;~counter~0 := 1 + #t~post2; {1637#(forall ((main_~b~0 Int)) (= (mod main_~A~0 4294967296) (mod (+ main_~r~0 (* main_~b~0 main_~q~0)) 4294967296)))} is VALID [2022-04-27 12:22:58,540 INFO L290 TraceCheckUtils]: 8: Hoare triple {1656#(or (not (<= (mod main_~b~0 4294967296) (mod main_~r~0 4294967296))) (forall ((main_~b~0 Int)) (= (mod main_~A~0 4294967296) (mod (+ main_~r~0 (* main_~b~0 main_~q~0)) 4294967296))))} assume !!(~r~0 % 4294967296 >= ~b~0 % 4294967296);~b~0 := 2 * ~b~0; {1637#(forall ((main_~b~0 Int)) (= (mod main_~A~0 4294967296) (mod (+ main_~r~0 (* main_~b~0 main_~q~0)) 4294967296)))} is VALID [2022-04-27 12:22:58,540 INFO L290 TraceCheckUtils]: 7: Hoare triple {1656#(or (not (<= (mod main_~b~0 4294967296) (mod main_~r~0 4294967296))) (forall ((main_~b~0 Int)) (= (mod main_~A~0 4294967296) (mod (+ main_~r~0 (* main_~b~0 main_~q~0)) 4294967296))))} assume !!(#t~post2 < 100);havoc #t~post2; {1656#(or (not (<= (mod main_~b~0 4294967296) (mod main_~r~0 4294967296))) (forall ((main_~b~0 Int)) (= (mod main_~A~0 4294967296) (mod (+ main_~r~0 (* main_~b~0 main_~q~0)) 4294967296))))} is VALID [2022-04-27 12:22:58,541 INFO L290 TraceCheckUtils]: 6: Hoare triple {1656#(or (not (<= (mod main_~b~0 4294967296) (mod main_~r~0 4294967296))) (forall ((main_~b~0 Int)) (= (mod main_~A~0 4294967296) (mod (+ main_~r~0 (* main_~b~0 main_~q~0)) 4294967296))))} #t~post2 := ~counter~0;~counter~0 := 1 + #t~post2; {1656#(or (not (<= (mod main_~b~0 4294967296) (mod main_~r~0 4294967296))) (forall ((main_~b~0 Int)) (= (mod main_~A~0 4294967296) (mod (+ main_~r~0 (* main_~b~0 main_~q~0)) 4294967296))))} is VALID [2022-04-27 12:22:58,541 INFO L290 TraceCheckUtils]: 5: Hoare triple {1568#true} havoc ~A~0;havoc ~B~0;havoc ~q~0;havoc ~r~0;havoc ~b~0;~A~0 := #t~nondet1;havoc #t~nondet1;~B~0 := 1;~q~0 := 0;~r~0 := ~A~0;~b~0 := ~B~0; {1656#(or (not (<= (mod main_~b~0 4294967296) (mod main_~r~0 4294967296))) (forall ((main_~b~0 Int)) (= (mod main_~A~0 4294967296) (mod (+ main_~r~0 (* main_~b~0 main_~q~0)) 4294967296))))} is VALID [2022-04-27 12:22:58,541 INFO L272 TraceCheckUtils]: 4: Hoare triple {1568#true} call #t~ret4 := main(); {1568#true} is VALID [2022-04-27 12:22:58,542 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1568#true} {1568#true} #82#return; {1568#true} is VALID [2022-04-27 12:22:58,542 INFO L290 TraceCheckUtils]: 2: Hoare triple {1568#true} assume true; {1568#true} is VALID [2022-04-27 12:22:58,542 INFO L290 TraceCheckUtils]: 1: Hoare triple {1568#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(10, 2);~counter~0 := 0; {1568#true} is VALID [2022-04-27 12:22:58,542 INFO L272 TraceCheckUtils]: 0: Hoare triple {1568#true} call ULTIMATE.init(); {1568#true} is VALID [2022-04-27 12:22:58,542 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 12:22:58,542 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 12:22:58,542 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1061782312] [2022-04-27 12:22:58,542 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 12:22:58,542 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [825538447] [2022-04-27 12:22:58,542 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [825538447] provided 1 perfect and 1 imperfect interpolant sequences [2022-04-27 12:22:58,542 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-04-27 12:22:58,542 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 8 [2022-04-27 12:22:58,543 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [767976151] [2022-04-27 12:22:58,543 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 12:22:58,543 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 18 [2022-04-27 12:22:58,543 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 12:22:58,543 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 12:23:00,566 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 17 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-27 12:23:00,566 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-27 12:23:00,567 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 12:23:00,567 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-27 12:23:00,567 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2022-04-27 12:23:00,567 INFO L87 Difference]: Start difference. First operand 77 states and 98 transitions. Second operand has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 12:23:00,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:23:00,706 INFO L93 Difference]: Finished difference Result 110 states and 135 transitions. [2022-04-27 12:23:00,706 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-27 12:23:00,707 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 18 [2022-04-27 12:23:00,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 12:23:00,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 12:23:00,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 41 transitions. [2022-04-27 12:23:00,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 12:23:00,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 41 transitions. [2022-04-27 12:23:00,709 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 41 transitions. [2022-04-27 12:23:02,762 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 41 edges. 40 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-27 12:23:02,764 INFO L225 Difference]: With dead ends: 110 [2022-04-27 12:23:02,764 INFO L226 Difference]: Without dead ends: 108 [2022-04-27 12:23:02,764 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 28 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2022-04-27 12:23:02,765 INFO L413 NwaCegarLoop]: 31 mSDtfsCounter, 11 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 98 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 17 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 12:23:02,765 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 98 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 17 Unchecked, 0.0s Time] [2022-04-27 12:23:02,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2022-04-27 12:23:02,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 107. [2022-04-27 12:23:02,790 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 12:23:02,790 INFO L82 GeneralOperation]: Start isEquivalent. First operand 108 states. Second operand has 107 states, 81 states have (on average 1.2839506172839505) internal successors, (104), 89 states have internal predecessors, (104), 15 states have call successors, (15), 11 states have call predecessors, (15), 10 states have return successors, (10), 6 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-27 12:23:02,790 INFO L74 IsIncluded]: Start isIncluded. First operand 108 states. Second operand has 107 states, 81 states have (on average 1.2839506172839505) internal successors, (104), 89 states have internal predecessors, (104), 15 states have call successors, (15), 11 states have call predecessors, (15), 10 states have return successors, (10), 6 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-27 12:23:02,790 INFO L87 Difference]: Start difference. First operand 108 states. Second operand has 107 states, 81 states have (on average 1.2839506172839505) internal successors, (104), 89 states have internal predecessors, (104), 15 states have call successors, (15), 11 states have call predecessors, (15), 10 states have return successors, (10), 6 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-27 12:23:02,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:23:02,793 INFO L93 Difference]: Finished difference Result 108 states and 130 transitions. [2022-04-27 12:23:02,793 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 130 transitions. [2022-04-27 12:23:02,793 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 12:23:02,793 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 12:23:02,793 INFO L74 IsIncluded]: Start isIncluded. First operand has 107 states, 81 states have (on average 1.2839506172839505) internal successors, (104), 89 states have internal predecessors, (104), 15 states have call successors, (15), 11 states have call predecessors, (15), 10 states have return successors, (10), 6 states have call predecessors, (10), 10 states have call successors, (10) Second operand 108 states. [2022-04-27 12:23:02,794 INFO L87 Difference]: Start difference. First operand has 107 states, 81 states have (on average 1.2839506172839505) internal successors, (104), 89 states have internal predecessors, (104), 15 states have call successors, (15), 11 states have call predecessors, (15), 10 states have return successors, (10), 6 states have call predecessors, (10), 10 states have call successors, (10) Second operand 108 states. [2022-04-27 12:23:02,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:23:02,796 INFO L93 Difference]: Finished difference Result 108 states and 130 transitions. [2022-04-27 12:23:02,796 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 130 transitions. [2022-04-27 12:23:02,796 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 12:23:02,796 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 12:23:02,797 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 12:23:02,797 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 12:23:02,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 81 states have (on average 1.2839506172839505) internal successors, (104), 89 states have internal predecessors, (104), 15 states have call successors, (15), 11 states have call predecessors, (15), 10 states have return successors, (10), 6 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-27 12:23:02,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 129 transitions. [2022-04-27 12:23:02,799 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 129 transitions. Word has length 18 [2022-04-27 12:23:02,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 12:23:02,799 INFO L495 AbstractCegarLoop]: Abstraction has 107 states and 129 transitions. [2022-04-27 12:23:02,799 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 12:23:02,799 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 129 transitions. [2022-04-27 12:23:02,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-04-27 12:23:02,800 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 12:23:02,800 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 12:23:02,816 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-04-27 12:23:03,015 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 12:23:03,016 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 12:23:03,016 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 12:23:03,016 INFO L85 PathProgramCache]: Analyzing trace with hash 1627795671, now seen corresponding path program 1 times [2022-04-27 12:23:03,016 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 12:23:03,016 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [794834743] [2022-04-27 12:23:03,016 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 12:23:03,016 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 12:23:03,025 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 12:23:03,025 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [173713397] [2022-04-27 12:23:03,025 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 12:23:03,025 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 12:23:03,025 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 12:23:03,026 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-04-27 12:23:03,027 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-04-27 12:23:03,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:23:03,065 INFO L263 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 5 conjunts are in the unsatisfiable core [2022-04-27 12:23:03,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:23:03,070 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 12:23:03,138 INFO L272 TraceCheckUtils]: 0: Hoare triple {2183#true} call ULTIMATE.init(); {2183#true} is VALID [2022-04-27 12:23:03,139 INFO L290 TraceCheckUtils]: 1: Hoare triple {2183#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(10, 2);~counter~0 := 0; {2183#true} is VALID [2022-04-27 12:23:03,139 INFO L290 TraceCheckUtils]: 2: Hoare triple {2183#true} assume true; {2183#true} is VALID [2022-04-27 12:23:03,139 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2183#true} {2183#true} #82#return; {2183#true} is VALID [2022-04-27 12:23:03,139 INFO L272 TraceCheckUtils]: 4: Hoare triple {2183#true} call #t~ret4 := main(); {2183#true} is VALID [2022-04-27 12:23:03,139 INFO L290 TraceCheckUtils]: 5: Hoare triple {2183#true} havoc ~A~0;havoc ~B~0;havoc ~q~0;havoc ~r~0;havoc ~b~0;~A~0 := #t~nondet1;havoc #t~nondet1;~B~0 := 1;~q~0 := 0;~r~0 := ~A~0;~b~0 := ~B~0; {2203#(and (= main_~B~0 main_~b~0) (= main_~B~0 1))} is VALID [2022-04-27 12:23:03,140 INFO L290 TraceCheckUtils]: 6: Hoare triple {2203#(and (= main_~B~0 main_~b~0) (= main_~B~0 1))} #t~post2 := ~counter~0;~counter~0 := 1 + #t~post2; {2203#(and (= main_~B~0 main_~b~0) (= main_~B~0 1))} is VALID [2022-04-27 12:23:03,140 INFO L290 TraceCheckUtils]: 7: Hoare triple {2203#(and (= main_~B~0 main_~b~0) (= main_~B~0 1))} assume !!(#t~post2 < 100);havoc #t~post2; {2203#(and (= main_~B~0 main_~b~0) (= main_~B~0 1))} is VALID [2022-04-27 12:23:03,140 INFO L290 TraceCheckUtils]: 8: Hoare triple {2203#(and (= main_~B~0 main_~b~0) (= main_~B~0 1))} assume !(~r~0 % 4294967296 >= ~b~0 % 4294967296); {2203#(and (= main_~B~0 main_~b~0) (= main_~B~0 1))} is VALID [2022-04-27 12:23:03,141 INFO L290 TraceCheckUtils]: 9: Hoare triple {2203#(and (= main_~B~0 main_~b~0) (= main_~B~0 1))} #t~post3 := ~counter~0;~counter~0 := 1 + #t~post3; {2203#(and (= main_~B~0 main_~b~0) (= main_~B~0 1))} is VALID [2022-04-27 12:23:03,141 INFO L290 TraceCheckUtils]: 10: Hoare triple {2203#(and (= main_~B~0 main_~b~0) (= main_~B~0 1))} assume !!(#t~post3 < 100);havoc #t~post3; {2203#(and (= main_~B~0 main_~b~0) (= main_~B~0 1))} is VALID [2022-04-27 12:23:03,141 INFO L272 TraceCheckUtils]: 11: Hoare triple {2203#(and (= main_~B~0 main_~b~0) (= main_~B~0 1))} call __VERIFIER_assert((if ~A~0 % 4294967296 == (~q~0 * ~b~0 + ~r~0) % 4294967296 then 1 else 0)); {2183#true} is VALID [2022-04-27 12:23:03,141 INFO L290 TraceCheckUtils]: 12: Hoare triple {2183#true} ~cond := #in~cond; {2183#true} is VALID [2022-04-27 12:23:03,141 INFO L290 TraceCheckUtils]: 13: Hoare triple {2183#true} assume !(0 == ~cond); {2183#true} is VALID [2022-04-27 12:23:03,141 INFO L290 TraceCheckUtils]: 14: Hoare triple {2183#true} assume true; {2183#true} is VALID [2022-04-27 12:23:03,142 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {2183#true} {2203#(and (= main_~B~0 main_~b~0) (= main_~B~0 1))} #78#return; {2203#(and (= main_~B~0 main_~b~0) (= main_~B~0 1))} is VALID [2022-04-27 12:23:03,143 INFO L290 TraceCheckUtils]: 16: Hoare triple {2203#(and (= main_~B~0 main_~b~0) (= main_~B~0 1))} assume !!(~b~0 % 4294967296 != ~B~0 % 4294967296);~q~0 := 2 * ~q~0;~b~0 := (if ~b~0 % 4294967296 < 0 && 0 != ~b~0 % 4294967296 % 2 then 1 + ~b~0 % 4294967296 / 2 else ~b~0 % 4294967296 / 2); {2184#false} is VALID [2022-04-27 12:23:03,143 INFO L290 TraceCheckUtils]: 17: Hoare triple {2184#false} assume ~r~0 % 4294967296 >= ~b~0 % 4294967296;~q~0 := 1 + ~q~0;~r~0 := ~r~0 - ~b~0; {2184#false} is VALID [2022-04-27 12:23:03,143 INFO L290 TraceCheckUtils]: 18: Hoare triple {2184#false} #t~post3 := ~counter~0;~counter~0 := 1 + #t~post3; {2184#false} is VALID [2022-04-27 12:23:03,143 INFO L290 TraceCheckUtils]: 19: Hoare triple {2184#false} assume !!(#t~post3 < 100);havoc #t~post3; {2184#false} is VALID [2022-04-27 12:23:03,143 INFO L272 TraceCheckUtils]: 20: Hoare triple {2184#false} call __VERIFIER_assert((if ~A~0 % 4294967296 == (~q~0 * ~b~0 + ~r~0) % 4294967296 then 1 else 0)); {2184#false} is VALID [2022-04-27 12:23:03,143 INFO L290 TraceCheckUtils]: 21: Hoare triple {2184#false} ~cond := #in~cond; {2184#false} is VALID [2022-04-27 12:23:03,143 INFO L290 TraceCheckUtils]: 22: Hoare triple {2184#false} assume 0 == ~cond; {2184#false} is VALID [2022-04-27 12:23:03,143 INFO L290 TraceCheckUtils]: 23: Hoare triple {2184#false} assume !false; {2184#false} is VALID [2022-04-27 12:23:03,143 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 12:23:03,143 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-27 12:23:03,144 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 12:23:03,144 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [794834743] [2022-04-27 12:23:03,144 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 12:23:03,144 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [173713397] [2022-04-27 12:23:03,144 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [173713397] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 12:23:03,144 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 12:23:03,144 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-27 12:23:03,144 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [102959813] [2022-04-27 12:23:03,144 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 12:23:03,144 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 24 [2022-04-27 12:23:03,145 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 12:23:03,145 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-27 12:23:03,160 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 12:23:03,161 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-27 12:23:03,161 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 12:23:03,161 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-27 12:23:03,161 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-27 12:23:03,161 INFO L87 Difference]: Start difference. First operand 107 states and 129 transitions. Second operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-27 12:23:03,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:23:03,219 INFO L93 Difference]: Finished difference Result 148 states and 181 transitions. [2022-04-27 12:23:03,219 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-27 12:23:03,219 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 24 [2022-04-27 12:23:03,219 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 12:23:03,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-27 12:23:03,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 50 transitions. [2022-04-27 12:23:03,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-27 12:23:03,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 50 transitions. [2022-04-27 12:23:03,221 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 50 transitions. [2022-04-27 12:23:03,256 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 50 edges. 50 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 12:23:03,257 INFO L225 Difference]: With dead ends: 148 [2022-04-27 12:23:03,257 INFO L226 Difference]: Without dead ends: 93 [2022-04-27 12:23:03,257 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-27 12:23:03,258 INFO L413 NwaCegarLoop]: 25 mSDtfsCounter, 0 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 42 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 12:23:03,258 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 42 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 12:23:03,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2022-04-27 12:23:03,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2022-04-27 12:23:03,279 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 12:23:03,279 INFO L82 GeneralOperation]: Start isEquivalent. First operand 93 states. Second operand has 93 states, 71 states have (on average 1.2816901408450705) internal successors, (91), 77 states have internal predecessors, (91), 13 states have call successors, (13), 10 states have call predecessors, (13), 8 states have return successors, (8), 5 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-27 12:23:03,279 INFO L74 IsIncluded]: Start isIncluded. First operand 93 states. Second operand has 93 states, 71 states have (on average 1.2816901408450705) internal successors, (91), 77 states have internal predecessors, (91), 13 states have call successors, (13), 10 states have call predecessors, (13), 8 states have return successors, (8), 5 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-27 12:23:03,279 INFO L87 Difference]: Start difference. First operand 93 states. Second operand has 93 states, 71 states have (on average 1.2816901408450705) internal successors, (91), 77 states have internal predecessors, (91), 13 states have call successors, (13), 10 states have call predecessors, (13), 8 states have return successors, (8), 5 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-27 12:23:03,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:23:03,281 INFO L93 Difference]: Finished difference Result 93 states and 112 transitions. [2022-04-27 12:23:03,281 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 112 transitions. [2022-04-27 12:23:03,281 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 12:23:03,281 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 12:23:03,282 INFO L74 IsIncluded]: Start isIncluded. First operand has 93 states, 71 states have (on average 1.2816901408450705) internal successors, (91), 77 states have internal predecessors, (91), 13 states have call successors, (13), 10 states have call predecessors, (13), 8 states have return successors, (8), 5 states have call predecessors, (8), 8 states have call successors, (8) Second operand 93 states. [2022-04-27 12:23:03,282 INFO L87 Difference]: Start difference. First operand has 93 states, 71 states have (on average 1.2816901408450705) internal successors, (91), 77 states have internal predecessors, (91), 13 states have call successors, (13), 10 states have call predecessors, (13), 8 states have return successors, (8), 5 states have call predecessors, (8), 8 states have call successors, (8) Second operand 93 states. [2022-04-27 12:23:03,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:23:03,284 INFO L93 Difference]: Finished difference Result 93 states and 112 transitions. [2022-04-27 12:23:03,284 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 112 transitions. [2022-04-27 12:23:03,284 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 12:23:03,284 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 12:23:03,284 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 12:23:03,284 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 12:23:03,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 71 states have (on average 1.2816901408450705) internal successors, (91), 77 states have internal predecessors, (91), 13 states have call successors, (13), 10 states have call predecessors, (13), 8 states have return successors, (8), 5 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-27 12:23:03,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 112 transitions. [2022-04-27 12:23:03,286 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 112 transitions. Word has length 24 [2022-04-27 12:23:03,286 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 12:23:03,286 INFO L495 AbstractCegarLoop]: Abstraction has 93 states and 112 transitions. [2022-04-27 12:23:03,286 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-27 12:23:03,287 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 112 transitions. [2022-04-27 12:23:03,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-04-27 12:23:03,287 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 12:23:03,287 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 12:23:03,315 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-04-27 12:23:03,503 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 12:23:03,503 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 12:23:03,504 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 12:23:03,504 INFO L85 PathProgramCache]: Analyzing trace with hash 145864044, now seen corresponding path program 1 times [2022-04-27 12:23:03,504 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 12:23:03,504 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [962421183] [2022-04-27 12:23:03,504 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 12:23:03,504 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 12:23:03,529 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 12:23:03,529 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [772523331] [2022-04-27 12:23:03,529 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 12:23:03,530 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 12:23:03,530 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 12:23:03,530 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-04-27 12:23:03,531 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-04-27 12:23:03,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:23:03,560 INFO L263 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 11 conjunts are in the unsatisfiable core [2022-04-27 12:23:03,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:23:03,565 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 12:23:03,720 INFO L272 TraceCheckUtils]: 0: Hoare triple {2756#true} call ULTIMATE.init(); {2756#true} is VALID [2022-04-27 12:23:03,721 INFO L290 TraceCheckUtils]: 1: Hoare triple {2756#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(10, 2);~counter~0 := 0; {2756#true} is VALID [2022-04-27 12:23:03,721 INFO L290 TraceCheckUtils]: 2: Hoare triple {2756#true} assume true; {2756#true} is VALID [2022-04-27 12:23:03,721 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2756#true} {2756#true} #82#return; {2756#true} is VALID [2022-04-27 12:23:03,721 INFO L272 TraceCheckUtils]: 4: Hoare triple {2756#true} call #t~ret4 := main(); {2756#true} is VALID [2022-04-27 12:23:03,721 INFO L290 TraceCheckUtils]: 5: Hoare triple {2756#true} havoc ~A~0;havoc ~B~0;havoc ~q~0;havoc ~r~0;havoc ~b~0;~A~0 := #t~nondet1;havoc #t~nondet1;~B~0 := 1;~q~0 := 0;~r~0 := ~A~0;~b~0 := ~B~0; {2756#true} is VALID [2022-04-27 12:23:03,721 INFO L290 TraceCheckUtils]: 6: Hoare triple {2756#true} #t~post2 := ~counter~0;~counter~0 := 1 + #t~post2; {2756#true} is VALID [2022-04-27 12:23:03,721 INFO L290 TraceCheckUtils]: 7: Hoare triple {2756#true} assume !!(#t~post2 < 100);havoc #t~post2; {2756#true} is VALID [2022-04-27 12:23:03,721 INFO L290 TraceCheckUtils]: 8: Hoare triple {2756#true} assume !!(~r~0 % 4294967296 >= ~b~0 % 4294967296);~b~0 := 2 * ~b~0; {2756#true} is VALID [2022-04-27 12:23:03,721 INFO L290 TraceCheckUtils]: 9: Hoare triple {2756#true} #t~post2 := ~counter~0;~counter~0 := 1 + #t~post2; {2756#true} is VALID [2022-04-27 12:23:03,722 INFO L290 TraceCheckUtils]: 10: Hoare triple {2756#true} assume !!(#t~post2 < 100);havoc #t~post2; {2756#true} is VALID [2022-04-27 12:23:03,722 INFO L290 TraceCheckUtils]: 11: Hoare triple {2756#true} assume !(~r~0 % 4294967296 >= ~b~0 % 4294967296); {2756#true} is VALID [2022-04-27 12:23:03,722 INFO L290 TraceCheckUtils]: 12: Hoare triple {2756#true} #t~post3 := ~counter~0;~counter~0 := 1 + #t~post3; {2756#true} is VALID [2022-04-27 12:23:03,722 INFO L290 TraceCheckUtils]: 13: Hoare triple {2756#true} assume !!(#t~post3 < 100);havoc #t~post3; {2756#true} is VALID [2022-04-27 12:23:03,722 INFO L272 TraceCheckUtils]: 14: Hoare triple {2756#true} call __VERIFIER_assert((if ~A~0 % 4294967296 == (~q~0 * ~b~0 + ~r~0) % 4294967296 then 1 else 0)); {2756#true} is VALID [2022-04-27 12:23:03,722 INFO L290 TraceCheckUtils]: 15: Hoare triple {2756#true} ~cond := #in~cond; {2806#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-27 12:23:03,723 INFO L290 TraceCheckUtils]: 16: Hoare triple {2806#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {2810#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 12:23:03,723 INFO L290 TraceCheckUtils]: 17: Hoare triple {2810#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {2810#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 12:23:03,724 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {2810#(not (= |__VERIFIER_assert_#in~cond| 0))} {2756#true} #78#return; {2817#(= (mod main_~A~0 4294967296) (mod (+ main_~r~0 (* main_~b~0 main_~q~0)) 4294967296))} is VALID [2022-04-27 12:23:03,724 INFO L290 TraceCheckUtils]: 19: Hoare triple {2817#(= (mod main_~A~0 4294967296) (mod (+ main_~r~0 (* main_~b~0 main_~q~0)) 4294967296))} assume !(~b~0 % 4294967296 != ~B~0 % 4294967296); {2817#(= (mod main_~A~0 4294967296) (mod (+ main_~r~0 (* main_~b~0 main_~q~0)) 4294967296))} is VALID [2022-04-27 12:23:03,725 INFO L272 TraceCheckUtils]: 20: Hoare triple {2817#(= (mod main_~A~0 4294967296) (mod (+ main_~r~0 (* main_~b~0 main_~q~0)) 4294967296))} call __VERIFIER_assert((if ~A~0 % 4294967296 == (~q~0 * ~b~0 + ~r~0) % 4294967296 then 1 else 0)); {2824#(= |__VERIFIER_assert_#in~cond| 1)} is VALID [2022-04-27 12:23:03,725 INFO L290 TraceCheckUtils]: 21: Hoare triple {2824#(= |__VERIFIER_assert_#in~cond| 1)} ~cond := #in~cond; {2828#(= __VERIFIER_assert_~cond 1)} is VALID [2022-04-27 12:23:03,725 INFO L290 TraceCheckUtils]: 22: Hoare triple {2828#(= __VERIFIER_assert_~cond 1)} assume 0 == ~cond; {2757#false} is VALID [2022-04-27 12:23:03,725 INFO L290 TraceCheckUtils]: 23: Hoare triple {2757#false} assume !false; {2757#false} is VALID [2022-04-27 12:23:03,726 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-04-27 12:23:03,726 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 12:23:04,328 INFO L290 TraceCheckUtils]: 23: Hoare triple {2757#false} assume !false; {2757#false} is VALID [2022-04-27 12:23:04,328 INFO L290 TraceCheckUtils]: 22: Hoare triple {2838#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {2757#false} is VALID [2022-04-27 12:23:04,329 INFO L290 TraceCheckUtils]: 21: Hoare triple {2810#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {2838#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-27 12:23:04,329 INFO L272 TraceCheckUtils]: 20: Hoare triple {2817#(= (mod main_~A~0 4294967296) (mod (+ main_~r~0 (* main_~b~0 main_~q~0)) 4294967296))} call __VERIFIER_assert((if ~A~0 % 4294967296 == (~q~0 * ~b~0 + ~r~0) % 4294967296 then 1 else 0)); {2810#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 12:23:04,330 INFO L290 TraceCheckUtils]: 19: Hoare triple {2817#(= (mod main_~A~0 4294967296) (mod (+ main_~r~0 (* main_~b~0 main_~q~0)) 4294967296))} assume !(~b~0 % 4294967296 != ~B~0 % 4294967296); {2817#(= (mod main_~A~0 4294967296) (mod (+ main_~r~0 (* main_~b~0 main_~q~0)) 4294967296))} is VALID [2022-04-27 12:23:04,330 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {2810#(not (= |__VERIFIER_assert_#in~cond| 0))} {2756#true} #78#return; {2817#(= (mod main_~A~0 4294967296) (mod (+ main_~r~0 (* main_~b~0 main_~q~0)) 4294967296))} is VALID [2022-04-27 12:23:04,331 INFO L290 TraceCheckUtils]: 17: Hoare triple {2810#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {2810#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 12:23:04,331 INFO L290 TraceCheckUtils]: 16: Hoare triple {2860#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {2810#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 12:23:04,331 INFO L290 TraceCheckUtils]: 15: Hoare triple {2756#true} ~cond := #in~cond; {2860#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-27 12:23:04,331 INFO L272 TraceCheckUtils]: 14: Hoare triple {2756#true} call __VERIFIER_assert((if ~A~0 % 4294967296 == (~q~0 * ~b~0 + ~r~0) % 4294967296 then 1 else 0)); {2756#true} is VALID [2022-04-27 12:23:04,332 INFO L290 TraceCheckUtils]: 13: Hoare triple {2756#true} assume !!(#t~post3 < 100);havoc #t~post3; {2756#true} is VALID [2022-04-27 12:23:04,332 INFO L290 TraceCheckUtils]: 12: Hoare triple {2756#true} #t~post3 := ~counter~0;~counter~0 := 1 + #t~post3; {2756#true} is VALID [2022-04-27 12:23:04,332 INFO L290 TraceCheckUtils]: 11: Hoare triple {2756#true} assume !(~r~0 % 4294967296 >= ~b~0 % 4294967296); {2756#true} is VALID [2022-04-27 12:23:04,332 INFO L290 TraceCheckUtils]: 10: Hoare triple {2756#true} assume !!(#t~post2 < 100);havoc #t~post2; {2756#true} is VALID [2022-04-27 12:23:04,332 INFO L290 TraceCheckUtils]: 9: Hoare triple {2756#true} #t~post2 := ~counter~0;~counter~0 := 1 + #t~post2; {2756#true} is VALID [2022-04-27 12:23:04,332 INFO L290 TraceCheckUtils]: 8: Hoare triple {2756#true} assume !!(~r~0 % 4294967296 >= ~b~0 % 4294967296);~b~0 := 2 * ~b~0; {2756#true} is VALID [2022-04-27 12:23:04,332 INFO L290 TraceCheckUtils]: 7: Hoare triple {2756#true} assume !!(#t~post2 < 100);havoc #t~post2; {2756#true} is VALID [2022-04-27 12:23:04,332 INFO L290 TraceCheckUtils]: 6: Hoare triple {2756#true} #t~post2 := ~counter~0;~counter~0 := 1 + #t~post2; {2756#true} is VALID [2022-04-27 12:23:04,332 INFO L290 TraceCheckUtils]: 5: Hoare triple {2756#true} havoc ~A~0;havoc ~B~0;havoc ~q~0;havoc ~r~0;havoc ~b~0;~A~0 := #t~nondet1;havoc #t~nondet1;~B~0 := 1;~q~0 := 0;~r~0 := ~A~0;~b~0 := ~B~0; {2756#true} is VALID [2022-04-27 12:23:04,332 INFO L272 TraceCheckUtils]: 4: Hoare triple {2756#true} call #t~ret4 := main(); {2756#true} is VALID [2022-04-27 12:23:04,332 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2756#true} {2756#true} #82#return; {2756#true} is VALID [2022-04-27 12:23:04,332 INFO L290 TraceCheckUtils]: 2: Hoare triple {2756#true} assume true; {2756#true} is VALID [2022-04-27 12:23:04,332 INFO L290 TraceCheckUtils]: 1: Hoare triple {2756#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(10, 2);~counter~0 := 0; {2756#true} is VALID [2022-04-27 12:23:04,333 INFO L272 TraceCheckUtils]: 0: Hoare triple {2756#true} call ULTIMATE.init(); {2756#true} is VALID [2022-04-27 12:23:04,333 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-04-27 12:23:04,333 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 12:23:04,333 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [962421183] [2022-04-27 12:23:04,333 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 12:23:04,333 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [772523331] [2022-04-27 12:23:04,333 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [772523331] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 12:23:04,333 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-27 12:23:04,333 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6] total 9 [2022-04-27 12:23:04,333 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2025803526] [2022-04-27 12:23:04,333 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-27 12:23:04,334 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.2222222222222223) internal successors, (20), 8 states have internal predecessors, (20), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 24 [2022-04-27 12:23:04,334 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 12:23:04,334 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 9 states, 9 states have (on average 2.2222222222222223) internal successors, (20), 8 states have internal predecessors, (20), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-27 12:23:04,351 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 12:23:04,351 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-27 12:23:04,351 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 12:23:04,351 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-27 12:23:04,351 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2022-04-27 12:23:04,351 INFO L87 Difference]: Start difference. First operand 93 states and 112 transitions. Second operand has 9 states, 9 states have (on average 2.2222222222222223) internal successors, (20), 8 states have internal predecessors, (20), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-27 12:23:06,529 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-04-27 12:23:06,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:23:06,770 INFO L93 Difference]: Finished difference Result 108 states and 126 transitions. [2022-04-27 12:23:06,770 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-27 12:23:06,770 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.2222222222222223) internal successors, (20), 8 states have internal predecessors, (20), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 24 [2022-04-27 12:23:06,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 12:23:06,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 2.2222222222222223) internal successors, (20), 8 states have internal predecessors, (20), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-27 12:23:06,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 35 transitions. [2022-04-27 12:23:06,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 2.2222222222222223) internal successors, (20), 8 states have internal predecessors, (20), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-27 12:23:06,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 35 transitions. [2022-04-27 12:23:06,773 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 35 transitions. [2022-04-27 12:23:06,799 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 35 edges. 35 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 12:23:06,801 INFO L225 Difference]: With dead ends: 108 [2022-04-27 12:23:06,801 INFO L226 Difference]: Without dead ends: 88 [2022-04-27 12:23:06,801 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2022-04-27 12:23:06,801 INFO L413 NwaCegarLoop]: 21 mSDtfsCounter, 13 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 3 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 101 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2022-04-27 12:23:06,802 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 101 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 47 Invalid, 1 Unknown, 0 Unchecked, 2.2s Time] [2022-04-27 12:23:06,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2022-04-27 12:23:06,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 88. [2022-04-27 12:23:06,820 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 12:23:06,820 INFO L82 GeneralOperation]: Start isEquivalent. First operand 88 states. Second operand has 88 states, 69 states have (on average 1.2318840579710144) internal successors, (85), 73 states have internal predecessors, (85), 10 states have call successors, (10), 9 states have call predecessors, (10), 8 states have return successors, (8), 5 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-27 12:23:06,820 INFO L74 IsIncluded]: Start isIncluded. First operand 88 states. Second operand has 88 states, 69 states have (on average 1.2318840579710144) internal successors, (85), 73 states have internal predecessors, (85), 10 states have call successors, (10), 9 states have call predecessors, (10), 8 states have return successors, (8), 5 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-27 12:23:06,820 INFO L87 Difference]: Start difference. First operand 88 states. Second operand has 88 states, 69 states have (on average 1.2318840579710144) internal successors, (85), 73 states have internal predecessors, (85), 10 states have call successors, (10), 9 states have call predecessors, (10), 8 states have return successors, (8), 5 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-27 12:23:06,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:23:06,822 INFO L93 Difference]: Finished difference Result 88 states and 103 transitions. [2022-04-27 12:23:06,822 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 103 transitions. [2022-04-27 12:23:06,823 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 12:23:06,823 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 12:23:06,823 INFO L74 IsIncluded]: Start isIncluded. First operand has 88 states, 69 states have (on average 1.2318840579710144) internal successors, (85), 73 states have internal predecessors, (85), 10 states have call successors, (10), 9 states have call predecessors, (10), 8 states have return successors, (8), 5 states have call predecessors, (8), 8 states have call successors, (8) Second operand 88 states. [2022-04-27 12:23:06,823 INFO L87 Difference]: Start difference. First operand has 88 states, 69 states have (on average 1.2318840579710144) internal successors, (85), 73 states have internal predecessors, (85), 10 states have call successors, (10), 9 states have call predecessors, (10), 8 states have return successors, (8), 5 states have call predecessors, (8), 8 states have call successors, (8) Second operand 88 states. [2022-04-27 12:23:06,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:23:06,825 INFO L93 Difference]: Finished difference Result 88 states and 103 transitions. [2022-04-27 12:23:06,825 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 103 transitions. [2022-04-27 12:23:06,825 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 12:23:06,825 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 12:23:06,825 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 12:23:06,825 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 12:23:06,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 69 states have (on average 1.2318840579710144) internal successors, (85), 73 states have internal predecessors, (85), 10 states have call successors, (10), 9 states have call predecessors, (10), 8 states have return successors, (8), 5 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-27 12:23:06,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 103 transitions. [2022-04-27 12:23:06,827 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 103 transitions. Word has length 24 [2022-04-27 12:23:06,828 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 12:23:06,828 INFO L495 AbstractCegarLoop]: Abstraction has 88 states and 103 transitions. [2022-04-27 12:23:06,828 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.2222222222222223) internal successors, (20), 8 states have internal predecessors, (20), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-27 12:23:06,828 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 103 transitions. [2022-04-27 12:23:06,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-04-27 12:23:06,828 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 12:23:06,828 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 12:23:06,845 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-04-27 12:23:07,045 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 12:23:07,045 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 12:23:07,046 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 12:23:07,046 INFO L85 PathProgramCache]: Analyzing trace with hash -1815750730, now seen corresponding path program 1 times [2022-04-27 12:23:07,046 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 12:23:07,046 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [709836567] [2022-04-27 12:23:07,046 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 12:23:07,046 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 12:23:07,061 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 12:23:07,061 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1380705987] [2022-04-27 12:23:07,061 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 12:23:07,061 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 12:23:07,061 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 12:23:07,067 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 12:23:07,068 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-04-27 12:23:07,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:23:07,120 INFO L263 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 25 conjunts are in the unsatisfiable core [2022-04-27 12:23:07,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:23:07,130 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 12:23:07,960 INFO L272 TraceCheckUtils]: 0: Hoare triple {3342#true} call ULTIMATE.init(); {3342#true} is VALID [2022-04-27 12:23:07,960 INFO L290 TraceCheckUtils]: 1: Hoare triple {3342#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(10, 2);~counter~0 := 0; {3342#true} is VALID [2022-04-27 12:23:07,960 INFO L290 TraceCheckUtils]: 2: Hoare triple {3342#true} assume true; {3342#true} is VALID [2022-04-27 12:23:07,965 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3342#true} {3342#true} #82#return; {3342#true} is VALID [2022-04-27 12:23:07,966 INFO L272 TraceCheckUtils]: 4: Hoare triple {3342#true} call #t~ret4 := main(); {3342#true} is VALID [2022-04-27 12:23:07,968 INFO L290 TraceCheckUtils]: 5: Hoare triple {3342#true} havoc ~A~0;havoc ~B~0;havoc ~q~0;havoc ~r~0;havoc ~b~0;~A~0 := #t~nondet1;havoc #t~nondet1;~B~0 := 1;~q~0 := 0;~r~0 := ~A~0;~b~0 := ~B~0; {3362#(and (= main_~b~0 1) (= main_~A~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-27 12:23:07,971 INFO L290 TraceCheckUtils]: 6: Hoare triple {3362#(and (= main_~b~0 1) (= main_~A~0 main_~r~0) (= main_~q~0 0))} #t~post2 := ~counter~0;~counter~0 := 1 + #t~post2; {3362#(and (= main_~b~0 1) (= main_~A~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-27 12:23:07,973 INFO L290 TraceCheckUtils]: 7: Hoare triple {3362#(and (= main_~b~0 1) (= main_~A~0 main_~r~0) (= main_~q~0 0))} assume !!(#t~post2 < 100);havoc #t~post2; {3362#(and (= main_~b~0 1) (= main_~A~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-27 12:23:07,974 INFO L290 TraceCheckUtils]: 8: Hoare triple {3362#(and (= main_~b~0 1) (= main_~A~0 main_~r~0) (= main_~q~0 0))} assume !!(~r~0 % 4294967296 >= ~b~0 % 4294967296);~b~0 := 2 * ~b~0; {3372#(and (= main_~b~0 2) (= main_~A~0 main_~r~0) (<= 1 (mod main_~r~0 4294967296)) (= main_~q~0 0))} is VALID [2022-04-27 12:23:07,974 INFO L290 TraceCheckUtils]: 9: Hoare triple {3372#(and (= main_~b~0 2) (= main_~A~0 main_~r~0) (<= 1 (mod main_~r~0 4294967296)) (= main_~q~0 0))} #t~post2 := ~counter~0;~counter~0 := 1 + #t~post2; {3372#(and (= main_~b~0 2) (= main_~A~0 main_~r~0) (<= 1 (mod main_~r~0 4294967296)) (= main_~q~0 0))} is VALID [2022-04-27 12:23:07,975 INFO L290 TraceCheckUtils]: 10: Hoare triple {3372#(and (= main_~b~0 2) (= main_~A~0 main_~r~0) (<= 1 (mod main_~r~0 4294967296)) (= main_~q~0 0))} assume !!(#t~post2 < 100);havoc #t~post2; {3372#(and (= main_~b~0 2) (= main_~A~0 main_~r~0) (<= 1 (mod main_~r~0 4294967296)) (= main_~q~0 0))} is VALID [2022-04-27 12:23:07,976 INFO L290 TraceCheckUtils]: 11: Hoare triple {3372#(and (= main_~b~0 2) (= main_~A~0 main_~r~0) (<= 1 (mod main_~r~0 4294967296)) (= main_~q~0 0))} assume !(~r~0 % 4294967296 >= ~b~0 % 4294967296); {3382#(and (= main_~b~0 2) (not (<= (mod main_~b~0 4294967296) (mod main_~r~0 4294967296))) (= main_~A~0 main_~r~0) (<= 1 (mod main_~r~0 4294967296)) (= main_~q~0 0))} is VALID [2022-04-27 12:23:07,978 INFO L290 TraceCheckUtils]: 12: Hoare triple {3382#(and (= main_~b~0 2) (not (<= (mod main_~b~0 4294967296) (mod main_~r~0 4294967296))) (= main_~A~0 main_~r~0) (<= 1 (mod main_~r~0 4294967296)) (= main_~q~0 0))} #t~post3 := ~counter~0;~counter~0 := 1 + #t~post3; {3382#(and (= main_~b~0 2) (not (<= (mod main_~b~0 4294967296) (mod main_~r~0 4294967296))) (= main_~A~0 main_~r~0) (<= 1 (mod main_~r~0 4294967296)) (= main_~q~0 0))} is VALID [2022-04-27 12:23:07,978 INFO L290 TraceCheckUtils]: 13: Hoare triple {3382#(and (= main_~b~0 2) (not (<= (mod main_~b~0 4294967296) (mod main_~r~0 4294967296))) (= main_~A~0 main_~r~0) (<= 1 (mod main_~r~0 4294967296)) (= main_~q~0 0))} assume !!(#t~post3 < 100);havoc #t~post3; {3382#(and (= main_~b~0 2) (not (<= (mod main_~b~0 4294967296) (mod main_~r~0 4294967296))) (= main_~A~0 main_~r~0) (<= 1 (mod main_~r~0 4294967296)) (= main_~q~0 0))} is VALID [2022-04-27 12:23:07,978 INFO L272 TraceCheckUtils]: 14: Hoare triple {3382#(and (= main_~b~0 2) (not (<= (mod main_~b~0 4294967296) (mod main_~r~0 4294967296))) (= main_~A~0 main_~r~0) (<= 1 (mod main_~r~0 4294967296)) (= main_~q~0 0))} call __VERIFIER_assert((if ~A~0 % 4294967296 == (~q~0 * ~b~0 + ~r~0) % 4294967296 then 1 else 0)); {3342#true} is VALID [2022-04-27 12:23:07,981 INFO L290 TraceCheckUtils]: 15: Hoare triple {3342#true} ~cond := #in~cond; {3342#true} is VALID [2022-04-27 12:23:07,981 INFO L290 TraceCheckUtils]: 16: Hoare triple {3342#true} assume !(0 == ~cond); {3342#true} is VALID [2022-04-27 12:23:07,981 INFO L290 TraceCheckUtils]: 17: Hoare triple {3342#true} assume true; {3342#true} is VALID [2022-04-27 12:23:07,982 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {3342#true} {3382#(and (= main_~b~0 2) (not (<= (mod main_~b~0 4294967296) (mod main_~r~0 4294967296))) (= main_~A~0 main_~r~0) (<= 1 (mod main_~r~0 4294967296)) (= main_~q~0 0))} #78#return; {3382#(and (= main_~b~0 2) (not (<= (mod main_~b~0 4294967296) (mod main_~r~0 4294967296))) (= main_~A~0 main_~r~0) (<= 1 (mod main_~r~0 4294967296)) (= main_~q~0 0))} is VALID [2022-04-27 12:23:07,984 INFO L290 TraceCheckUtils]: 19: Hoare triple {3382#(and (= main_~b~0 2) (not (<= (mod main_~b~0 4294967296) (mod main_~r~0 4294967296))) (= main_~A~0 main_~r~0) (<= 1 (mod main_~r~0 4294967296)) (= main_~q~0 0))} assume !!(~b~0 % 4294967296 != ~B~0 % 4294967296);~q~0 := 2 * ~q~0;~b~0 := (if ~b~0 % 4294967296 < 0 && 0 != ~b~0 % 4294967296 % 2 then 1 + ~b~0 % 4294967296 / 2 else ~b~0 % 4294967296 / 2); {3407#(and (= main_~b~0 1) (= main_~A~0 main_~r~0) (not (<= 2 (mod main_~r~0 4294967296))) (<= 1 (mod main_~r~0 4294967296)) (= main_~q~0 0))} is VALID [2022-04-27 12:23:07,984 INFO L290 TraceCheckUtils]: 20: Hoare triple {3407#(and (= main_~b~0 1) (= main_~A~0 main_~r~0) (not (<= 2 (mod main_~r~0 4294967296))) (<= 1 (mod main_~r~0 4294967296)) (= main_~q~0 0))} assume ~r~0 % 4294967296 >= ~b~0 % 4294967296;~q~0 := 1 + ~q~0;~r~0 := ~r~0 - ~b~0; {3411#(and (= (+ main_~A~0 (* (- 1) main_~b~0)) main_~r~0) (= main_~b~0 1) (not (<= 2 (mod main_~A~0 4294967296))) (<= 1 (mod main_~A~0 4294967296)) (= main_~q~0 1))} is VALID [2022-04-27 12:23:07,989 INFO L290 TraceCheckUtils]: 21: Hoare triple {3411#(and (= (+ main_~A~0 (* (- 1) main_~b~0)) main_~r~0) (= main_~b~0 1) (not (<= 2 (mod main_~A~0 4294967296))) (<= 1 (mod main_~A~0 4294967296)) (= main_~q~0 1))} #t~post3 := ~counter~0;~counter~0 := 1 + #t~post3; {3411#(and (= (+ main_~A~0 (* (- 1) main_~b~0)) main_~r~0) (= main_~b~0 1) (not (<= 2 (mod main_~A~0 4294967296))) (<= 1 (mod main_~A~0 4294967296)) (= main_~q~0 1))} is VALID [2022-04-27 12:23:07,991 INFO L290 TraceCheckUtils]: 22: Hoare triple {3411#(and (= (+ main_~A~0 (* (- 1) main_~b~0)) main_~r~0) (= main_~b~0 1) (not (<= 2 (mod main_~A~0 4294967296))) (<= 1 (mod main_~A~0 4294967296)) (= main_~q~0 1))} assume !!(#t~post3 < 100);havoc #t~post3; {3411#(and (= (+ main_~A~0 (* (- 1) main_~b~0)) main_~r~0) (= main_~b~0 1) (not (<= 2 (mod main_~A~0 4294967296))) (<= 1 (mod main_~A~0 4294967296)) (= main_~q~0 1))} is VALID [2022-04-27 12:23:07,992 INFO L272 TraceCheckUtils]: 23: Hoare triple {3411#(and (= (+ main_~A~0 (* (- 1) main_~b~0)) main_~r~0) (= main_~b~0 1) (not (<= 2 (mod main_~A~0 4294967296))) (<= 1 (mod main_~A~0 4294967296)) (= main_~q~0 1))} call __VERIFIER_assert((if ~A~0 % 4294967296 == (~q~0 * ~b~0 + ~r~0) % 4294967296 then 1 else 0)); {3421#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 12:23:07,993 INFO L290 TraceCheckUtils]: 24: Hoare triple {3421#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {3425#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 12:23:07,993 INFO L290 TraceCheckUtils]: 25: Hoare triple {3425#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {3343#false} is VALID [2022-04-27 12:23:07,993 INFO L290 TraceCheckUtils]: 26: Hoare triple {3343#false} assume !false; {3343#false} is VALID [2022-04-27 12:23:07,994 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 12:23:07,994 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 12:23:18,802 WARN L855 $PredicateComparison]: unable to prove that (let ((.cse0 (mod c_main_~b~0 4294967296))) (or (= (mod c_main_~A~0 4294967296) (mod (+ (* (div .cse0 2) (* c_main_~q~0 2)) c_main_~r~0) 4294967296)) (<= .cse0 (mod c_main_~r~0 4294967296)))) is different from true [2022-04-27 12:23:38,527 WARN L855 $PredicateComparison]: unable to prove that (let ((.cse1 (mod (* c_main_~b~0 2) 4294967296)) (.cse0 (mod c_main_~r~0 4294967296))) (or (not (<= (mod c_main_~b~0 4294967296) .cse0)) (= (mod c_main_~A~0 4294967296) (mod (+ (* (div .cse1 2) (* c_main_~q~0 2)) c_main_~r~0) 4294967296)) (<= .cse1 .cse0))) is different from true [2022-04-27 12:23:59,811 INFO L290 TraceCheckUtils]: 26: Hoare triple {3343#false} assume !false; {3343#false} is VALID [2022-04-27 12:23:59,811 INFO L290 TraceCheckUtils]: 25: Hoare triple {3425#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {3343#false} is VALID [2022-04-27 12:23:59,812 INFO L290 TraceCheckUtils]: 24: Hoare triple {3421#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {3425#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 12:23:59,812 INFO L272 TraceCheckUtils]: 23: Hoare triple {3441#(= (mod main_~A~0 4294967296) (mod (+ main_~r~0 (* main_~b~0 main_~q~0)) 4294967296))} call __VERIFIER_assert((if ~A~0 % 4294967296 == (~q~0 * ~b~0 + ~r~0) % 4294967296 then 1 else 0)); {3421#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 12:23:59,813 INFO L290 TraceCheckUtils]: 22: Hoare triple {3441#(= (mod main_~A~0 4294967296) (mod (+ main_~r~0 (* main_~b~0 main_~q~0)) 4294967296))} assume !!(#t~post3 < 100);havoc #t~post3; {3441#(= (mod main_~A~0 4294967296) (mod (+ main_~r~0 (* main_~b~0 main_~q~0)) 4294967296))} is VALID [2022-04-27 12:23:59,813 INFO L290 TraceCheckUtils]: 21: Hoare triple {3441#(= (mod main_~A~0 4294967296) (mod (+ main_~r~0 (* main_~b~0 main_~q~0)) 4294967296))} #t~post3 := ~counter~0;~counter~0 := 1 + #t~post3; {3441#(= (mod main_~A~0 4294967296) (mod (+ main_~r~0 (* main_~b~0 main_~q~0)) 4294967296))} is VALID [2022-04-27 12:24:01,861 WARN L290 TraceCheckUtils]: 20: Hoare triple {3441#(= (mod main_~A~0 4294967296) (mod (+ main_~r~0 (* main_~b~0 main_~q~0)) 4294967296))} assume ~r~0 % 4294967296 >= ~b~0 % 4294967296;~q~0 := 1 + ~q~0;~r~0 := ~r~0 - ~b~0; {3441#(= (mod main_~A~0 4294967296) (mod (+ main_~r~0 (* main_~b~0 main_~q~0)) 4294967296))} is UNKNOWN [2022-04-27 12:24:03,866 WARN L290 TraceCheckUtils]: 19: Hoare triple {3454#(= (mod main_~A~0 4294967296) (mod (+ main_~r~0 (* (div (mod main_~b~0 4294967296) 2) (* main_~q~0 2))) 4294967296))} assume !!(~b~0 % 4294967296 != ~B~0 % 4294967296);~q~0 := 2 * ~q~0;~b~0 := (if ~b~0 % 4294967296 < 0 && 0 != ~b~0 % 4294967296 % 2 then 1 + ~b~0 % 4294967296 / 2 else ~b~0 % 4294967296 / 2); {3441#(= (mod main_~A~0 4294967296) (mod (+ main_~r~0 (* main_~b~0 main_~q~0)) 4294967296))} is UNKNOWN [2022-04-27 12:24:03,867 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {3342#true} {3454#(= (mod main_~A~0 4294967296) (mod (+ main_~r~0 (* (div (mod main_~b~0 4294967296) 2) (* main_~q~0 2))) 4294967296))} #78#return; {3454#(= (mod main_~A~0 4294967296) (mod (+ main_~r~0 (* (div (mod main_~b~0 4294967296) 2) (* main_~q~0 2))) 4294967296))} is VALID [2022-04-27 12:24:03,867 INFO L290 TraceCheckUtils]: 17: Hoare triple {3342#true} assume true; {3342#true} is VALID [2022-04-27 12:24:03,867 INFO L290 TraceCheckUtils]: 16: Hoare triple {3342#true} assume !(0 == ~cond); {3342#true} is VALID [2022-04-27 12:24:03,868 INFO L290 TraceCheckUtils]: 15: Hoare triple {3342#true} ~cond := #in~cond; {3342#true} is VALID [2022-04-27 12:24:03,868 INFO L272 TraceCheckUtils]: 14: Hoare triple {3454#(= (mod main_~A~0 4294967296) (mod (+ main_~r~0 (* (div (mod main_~b~0 4294967296) 2) (* main_~q~0 2))) 4294967296))} call __VERIFIER_assert((if ~A~0 % 4294967296 == (~q~0 * ~b~0 + ~r~0) % 4294967296 then 1 else 0)); {3342#true} is VALID [2022-04-27 12:24:03,868 INFO L290 TraceCheckUtils]: 13: Hoare triple {3454#(= (mod main_~A~0 4294967296) (mod (+ main_~r~0 (* (div (mod main_~b~0 4294967296) 2) (* main_~q~0 2))) 4294967296))} assume !!(#t~post3 < 100);havoc #t~post3; {3454#(= (mod main_~A~0 4294967296) (mod (+ main_~r~0 (* (div (mod main_~b~0 4294967296) 2) (* main_~q~0 2))) 4294967296))} is VALID [2022-04-27 12:24:03,869 INFO L290 TraceCheckUtils]: 12: Hoare triple {3454#(= (mod main_~A~0 4294967296) (mod (+ main_~r~0 (* (div (mod main_~b~0 4294967296) 2) (* main_~q~0 2))) 4294967296))} #t~post3 := ~counter~0;~counter~0 := 1 + #t~post3; {3454#(= (mod main_~A~0 4294967296) (mod (+ main_~r~0 (* (div (mod main_~b~0 4294967296) 2) (* main_~q~0 2))) 4294967296))} is VALID [2022-04-27 12:24:03,869 INFO L290 TraceCheckUtils]: 11: Hoare triple {3479#(or (= (mod main_~A~0 4294967296) (mod (+ main_~r~0 (* (div (mod main_~b~0 4294967296) 2) (* main_~q~0 2))) 4294967296)) (<= (mod main_~b~0 4294967296) (mod main_~r~0 4294967296)))} assume !(~r~0 % 4294967296 >= ~b~0 % 4294967296); {3454#(= (mod main_~A~0 4294967296) (mod (+ main_~r~0 (* (div (mod main_~b~0 4294967296) 2) (* main_~q~0 2))) 4294967296))} is VALID [2022-04-27 12:24:03,869 INFO L290 TraceCheckUtils]: 10: Hoare triple {3479#(or (= (mod main_~A~0 4294967296) (mod (+ main_~r~0 (* (div (mod main_~b~0 4294967296) 2) (* main_~q~0 2))) 4294967296)) (<= (mod main_~b~0 4294967296) (mod main_~r~0 4294967296)))} assume !!(#t~post2 < 100);havoc #t~post2; {3479#(or (= (mod main_~A~0 4294967296) (mod (+ main_~r~0 (* (div (mod main_~b~0 4294967296) 2) (* main_~q~0 2))) 4294967296)) (<= (mod main_~b~0 4294967296) (mod main_~r~0 4294967296)))} is VALID [2022-04-27 12:24:03,870 INFO L290 TraceCheckUtils]: 9: Hoare triple {3479#(or (= (mod main_~A~0 4294967296) (mod (+ main_~r~0 (* (div (mod main_~b~0 4294967296) 2) (* main_~q~0 2))) 4294967296)) (<= (mod main_~b~0 4294967296) (mod main_~r~0 4294967296)))} #t~post2 := ~counter~0;~counter~0 := 1 + #t~post2; {3479#(or (= (mod main_~A~0 4294967296) (mod (+ main_~r~0 (* (div (mod main_~b~0 4294967296) 2) (* main_~q~0 2))) 4294967296)) (<= (mod main_~b~0 4294967296) (mod main_~r~0 4294967296)))} is VALID [2022-04-27 12:24:05,984 WARN L290 TraceCheckUtils]: 8: Hoare triple {3489#(or (= (mod main_~A~0 4294967296) (mod (+ (* (* main_~q~0 2) (div (mod (* main_~b~0 2) 4294967296) 2)) main_~r~0) 4294967296)) (not (<= (mod main_~b~0 4294967296) (mod main_~r~0 4294967296))) (<= (mod (* main_~b~0 2) 4294967296) (mod main_~r~0 4294967296)))} assume !!(~r~0 % 4294967296 >= ~b~0 % 4294967296);~b~0 := 2 * ~b~0; {3479#(or (= (mod main_~A~0 4294967296) (mod (+ main_~r~0 (* (div (mod main_~b~0 4294967296) 2) (* main_~q~0 2))) 4294967296)) (<= (mod main_~b~0 4294967296) (mod main_~r~0 4294967296)))} is UNKNOWN [2022-04-27 12:24:05,987 INFO L290 TraceCheckUtils]: 7: Hoare triple {3489#(or (= (mod main_~A~0 4294967296) (mod (+ (* (* main_~q~0 2) (div (mod (* main_~b~0 2) 4294967296) 2)) main_~r~0) 4294967296)) (not (<= (mod main_~b~0 4294967296) (mod main_~r~0 4294967296))) (<= (mod (* main_~b~0 2) 4294967296) (mod main_~r~0 4294967296)))} assume !!(#t~post2 < 100);havoc #t~post2; {3489#(or (= (mod main_~A~0 4294967296) (mod (+ (* (* main_~q~0 2) (div (mod (* main_~b~0 2) 4294967296) 2)) main_~r~0) 4294967296)) (not (<= (mod main_~b~0 4294967296) (mod main_~r~0 4294967296))) (<= (mod (* main_~b~0 2) 4294967296) (mod main_~r~0 4294967296)))} is VALID [2022-04-27 12:24:05,988 INFO L290 TraceCheckUtils]: 6: Hoare triple {3489#(or (= (mod main_~A~0 4294967296) (mod (+ (* (* main_~q~0 2) (div (mod (* main_~b~0 2) 4294967296) 2)) main_~r~0) 4294967296)) (not (<= (mod main_~b~0 4294967296) (mod main_~r~0 4294967296))) (<= (mod (* main_~b~0 2) 4294967296) (mod main_~r~0 4294967296)))} #t~post2 := ~counter~0;~counter~0 := 1 + #t~post2; {3489#(or (= (mod main_~A~0 4294967296) (mod (+ (* (* main_~q~0 2) (div (mod (* main_~b~0 2) 4294967296) 2)) main_~r~0) 4294967296)) (not (<= (mod main_~b~0 4294967296) (mod main_~r~0 4294967296))) (<= (mod (* main_~b~0 2) 4294967296) (mod main_~r~0 4294967296)))} is VALID [2022-04-27 12:24:05,988 INFO L290 TraceCheckUtils]: 5: Hoare triple {3342#true} havoc ~A~0;havoc ~B~0;havoc ~q~0;havoc ~r~0;havoc ~b~0;~A~0 := #t~nondet1;havoc #t~nondet1;~B~0 := 1;~q~0 := 0;~r~0 := ~A~0;~b~0 := ~B~0; {3489#(or (= (mod main_~A~0 4294967296) (mod (+ (* (* main_~q~0 2) (div (mod (* main_~b~0 2) 4294967296) 2)) main_~r~0) 4294967296)) (not (<= (mod main_~b~0 4294967296) (mod main_~r~0 4294967296))) (<= (mod (* main_~b~0 2) 4294967296) (mod main_~r~0 4294967296)))} is VALID [2022-04-27 12:24:05,988 INFO L272 TraceCheckUtils]: 4: Hoare triple {3342#true} call #t~ret4 := main(); {3342#true} is VALID [2022-04-27 12:24:05,989 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3342#true} {3342#true} #82#return; {3342#true} is VALID [2022-04-27 12:24:05,989 INFO L290 TraceCheckUtils]: 2: Hoare triple {3342#true} assume true; {3342#true} is VALID [2022-04-27 12:24:05,989 INFO L290 TraceCheckUtils]: 1: Hoare triple {3342#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(10, 2);~counter~0 := 0; {3342#true} is VALID [2022-04-27 12:24:05,989 INFO L272 TraceCheckUtils]: 0: Hoare triple {3342#true} call ULTIMATE.init(); {3342#true} is VALID [2022-04-27 12:24:05,989 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 3 not checked. [2022-04-27 12:24:05,989 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 12:24:05,989 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [709836567] [2022-04-27 12:24:05,989 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 12:24:05,989 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1380705987] [2022-04-27 12:24:05,990 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1380705987] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 12:24:05,990 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-27 12:24:05,990 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 13 [2022-04-27 12:24:05,990 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1111457355] [2022-04-27 12:24:05,990 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-27 12:24:05,990 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.6153846153846154) internal successors, (34), 12 states have internal predecessors, (34), 5 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 27 [2022-04-27 12:24:05,991 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 12:24:05,991 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 13 states, 13 states have (on average 2.6153846153846154) internal successors, (34), 12 states have internal predecessors, (34), 5 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-27 12:24:12,176 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 43 edges. 40 inductive. 0 not inductive. 3 times theorem prover too weak to decide inductivity. [2022-04-27 12:24:12,176 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-04-27 12:24:12,177 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 12:24:12,177 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-04-27 12:24:12,177 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=80, Unknown=4, NotChecked=38, Total=156 [2022-04-27 12:24:12,177 INFO L87 Difference]: Start difference. First operand 88 states and 103 transitions. Second operand has 13 states, 13 states have (on average 2.6153846153846154) internal successors, (34), 12 states have internal predecessors, (34), 5 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-27 12:24:24,045 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-04-27 12:24:26,276 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-04-27 12:24:28,414 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.14s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-27 12:24:35,400 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-04-27 12:24:37,812 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-04-27 12:24:39,958 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.15s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-27 12:24:42,529 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-04-27 12:24:47,265 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-04-27 12:24:47,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:24:47,268 INFO L93 Difference]: Finished difference Result 129 states and 152 transitions. [2022-04-27 12:24:47,384 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-04-27 12:24:47,384 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.6153846153846154) internal successors, (34), 12 states have internal predecessors, (34), 5 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 27 [2022-04-27 12:24:47,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 12:24:47,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 2.6153846153846154) internal successors, (34), 12 states have internal predecessors, (34), 5 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-27 12:24:47,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 77 transitions. [2022-04-27 12:24:47,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 2.6153846153846154) internal successors, (34), 12 states have internal predecessors, (34), 5 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-27 12:24:47,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 77 transitions. [2022-04-27 12:24:47,387 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 11 states and 77 transitions. [2022-04-27 12:24:51,695 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 77 edges. 75 inductive. 0 not inductive. 2 times theorem prover too weak to decide inductivity. [2022-04-27 12:24:51,696 INFO L225 Difference]: With dead ends: 129 [2022-04-27 12:24:51,696 INFO L226 Difference]: Without dead ends: 97 [2022-04-27 12:24:51,697 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 40 SyntacticMatches, 4 SemanticMatches, 13 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 16.1s TimeCoverageRelationStatistics Valid=46, Invalid=112, Unknown=6, NotChecked=46, Total=210 [2022-04-27 12:24:51,697 INFO L413 NwaCegarLoop]: 23 mSDtfsCounter, 22 mSDsluCounter, 119 mSDsCounter, 0 mSdLazyCounter, 89 mSolverCounterSat, 9 mSolverCounterUnsat, 8 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 17.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 142 SdHoareTripleChecker+Invalid, 185 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 89 IncrementalHoareTripleChecker+Invalid, 8 IncrementalHoareTripleChecker+Unknown, 79 IncrementalHoareTripleChecker+Unchecked, 17.5s IncrementalHoareTripleChecker+Time [2022-04-27 12:24:51,697 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 142 Invalid, 185 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 89 Invalid, 8 Unknown, 79 Unchecked, 17.5s Time] [2022-04-27 12:24:51,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2022-04-27 12:24:51,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 90. [2022-04-27 12:24:51,732 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 12:24:51,732 INFO L82 GeneralOperation]: Start isEquivalent. First operand 97 states. Second operand has 90 states, 71 states have (on average 1.2112676056338028) internal successors, (86), 74 states have internal predecessors, (86), 10 states have call successors, (10), 9 states have call predecessors, (10), 8 states have return successors, (8), 6 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-27 12:24:51,733 INFO L74 IsIncluded]: Start isIncluded. First operand 97 states. Second operand has 90 states, 71 states have (on average 1.2112676056338028) internal successors, (86), 74 states have internal predecessors, (86), 10 states have call successors, (10), 9 states have call predecessors, (10), 8 states have return successors, (8), 6 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-27 12:24:51,733 INFO L87 Difference]: Start difference. First operand 97 states. Second operand has 90 states, 71 states have (on average 1.2112676056338028) internal successors, (86), 74 states have internal predecessors, (86), 10 states have call successors, (10), 9 states have call predecessors, (10), 8 states have return successors, (8), 6 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-27 12:24:51,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:24:51,734 INFO L93 Difference]: Finished difference Result 97 states and 111 transitions. [2022-04-27 12:24:51,734 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 111 transitions. [2022-04-27 12:24:51,735 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 12:24:51,735 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 12:24:51,735 INFO L74 IsIncluded]: Start isIncluded. First operand has 90 states, 71 states have (on average 1.2112676056338028) internal successors, (86), 74 states have internal predecessors, (86), 10 states have call successors, (10), 9 states have call predecessors, (10), 8 states have return successors, (8), 6 states have call predecessors, (8), 8 states have call successors, (8) Second operand 97 states. [2022-04-27 12:24:51,735 INFO L87 Difference]: Start difference. First operand has 90 states, 71 states have (on average 1.2112676056338028) internal successors, (86), 74 states have internal predecessors, (86), 10 states have call successors, (10), 9 states have call predecessors, (10), 8 states have return successors, (8), 6 states have call predecessors, (8), 8 states have call successors, (8) Second operand 97 states. [2022-04-27 12:24:51,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:24:51,736 INFO L93 Difference]: Finished difference Result 97 states and 111 transitions. [2022-04-27 12:24:51,737 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 111 transitions. [2022-04-27 12:24:51,737 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 12:24:51,737 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 12:24:51,737 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 12:24:51,737 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 12:24:51,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 71 states have (on average 1.2112676056338028) internal successors, (86), 74 states have internal predecessors, (86), 10 states have call successors, (10), 9 states have call predecessors, (10), 8 states have return successors, (8), 6 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-27 12:24:51,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 104 transitions. [2022-04-27 12:24:51,738 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 104 transitions. Word has length 27 [2022-04-27 12:24:51,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 12:24:51,738 INFO L495 AbstractCegarLoop]: Abstraction has 90 states and 104 transitions. [2022-04-27 12:24:51,739 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.6153846153846154) internal successors, (34), 12 states have internal predecessors, (34), 5 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-27 12:24:51,739 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 104 transitions. [2022-04-27 12:24:51,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-04-27 12:24:51,739 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 12:24:51,739 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 12:24:51,771 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-04-27 12:24:51,967 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-04-27 12:24:51,968 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 12:24:51,968 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 12:24:51,968 INFO L85 PathProgramCache]: Analyzing trace with hash -1437710599, now seen corresponding path program 1 times [2022-04-27 12:24:51,968 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 12:24:51,968 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [565823723] [2022-04-27 12:24:51,968 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 12:24:51,969 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 12:24:51,991 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 12:24:51,991 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [390533490] [2022-04-27 12:24:51,992 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 12:24:51,992 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 12:24:51,992 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 12:24:51,997 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 12:24:51,998 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process