/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_unwindbound10.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-fb4f59a-m [2022-04-27 12:19:42,805 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-27 12:19:42,807 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-27 12:19:42,851 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-27 12:19:42,851 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-27 12:19:42,853 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-27 12:19:42,856 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-27 12:19:42,860 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-27 12:19:42,861 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-27 12:19:42,865 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-27 12:19:42,866 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-27 12:19:42,867 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-27 12:19:42,868 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-27 12:19:42,870 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-27 12:19:42,870 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-27 12:19:42,874 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-27 12:19:42,874 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-27 12:19:42,875 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-27 12:19:42,877 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-27 12:19:42,884 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-27 12:19:42,886 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-27 12:19:42,887 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-27 12:19:42,888 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-27 12:19:42,888 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-27 12:19:42,890 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-27 12:19:42,896 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-27 12:19:42,896 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-27 12:19:42,896 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-27 12:19:42,897 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-27 12:19:42,897 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-27 12:19:42,898 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-27 12:19:42,899 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-27 12:19:42,900 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-27 12:19:42,900 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-27 12:19:42,901 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-27 12:19:42,901 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-27 12:19:42,902 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-27 12:19:42,902 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-27 12:19:42,902 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-27 12:19:42,902 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-27 12:19:42,903 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-27 12:19:42,904 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-27 12:19:42,905 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:19:42,934 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-27 12:19:42,935 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-27 12:19:42,935 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-04-27 12:19:42,935 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-04-27 12:19:42,936 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-04-27 12:19:42,936 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-04-27 12:19:42,936 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-04-27 12:19:42,936 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-04-27 12:19:42,936 INFO L138 SettingsManager]: * Use SBE=true [2022-04-27 12:19:42,937 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-27 12:19:42,937 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-27 12:19:42,938 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-27 12:19:42,938 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-27 12:19:42,938 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-27 12:19:42,938 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-27 12:19:42,938 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-27 12:19:42,938 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-27 12:19:42,938 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-27 12:19:42,938 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-27 12:19:42,938 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-27 12:19:42,939 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-27 12:19:42,939 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-27 12:19:42,939 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-27 12:19:42,939 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-27 12:19:42,939 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 12:19:42,939 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-27 12:19:42,939 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-04-27 12:19:42,939 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-04-27 12:19:42,940 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-04-27 12:19:42,940 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-04-27 12:19:42,940 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-04-27 12:19:42,940 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-04-27 12:19:42,940 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-27 12:19:42,940 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:19:43,340 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-27 12:19:43,373 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-27 12:19:43,376 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-27 12:19:43,377 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-27 12:19:43,378 INFO L275 PluginConnector]: CDTParser initialized [2022-04-27 12:19:43,379 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/nla-digbench-scaling/divbin2_unwindbound10.i [2022-04-27 12:19:43,510 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6f11c8ffc/ca32d76b01d848aa9fc16d9d20cf8eab/FLAG0df89ae72 [2022-04-27 12:19:44,023 INFO L306 CDTParser]: Found 1 translation units. [2022-04-27 12:19:44,023 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/divbin2_unwindbound10.i [2022-04-27 12:19:44,030 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6f11c8ffc/ca32d76b01d848aa9fc16d9d20cf8eab/FLAG0df89ae72 [2022-04-27 12:19:44,432 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6f11c8ffc/ca32d76b01d848aa9fc16d9d20cf8eab [2022-04-27 12:19:44,434 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-27 12:19:44,435 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-27 12:19:44,444 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-27 12:19:44,459 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-27 12:19:44,462 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-27 12:19:44,464 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 12:19:44" (1/1) ... [2022-04-27 12:19:44,464 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@33318bed and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 12:19:44, skipping insertion in model container [2022-04-27 12:19:44,465 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 12:19:44" (1/1) ... [2022-04-27 12:19:44,470 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-27 12:19:44,487 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-27 12:19:44,721 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_unwindbound10.i[951,964] [2022-04-27 12:19:44,751 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 12:19:44,778 INFO L203 MainTranslator]: Completed pre-run [2022-04-27 12:19:44,796 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_unwindbound10.i[951,964] [2022-04-27 12:19:44,813 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 12:19:44,825 INFO L208 MainTranslator]: Completed translation [2022-04-27 12:19:44,826 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 12:19:44 WrapperNode [2022-04-27 12:19:44,826 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-27 12:19:44,827 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-27 12:19:44,827 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-27 12:19:44,828 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-27 12:19:44,848 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 12:19:44" (1/1) ... [2022-04-27 12:19:44,848 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 12:19:44" (1/1) ... [2022-04-27 12:19:44,853 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 12:19:44" (1/1) ... [2022-04-27 12:19:44,853 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 12:19:44" (1/1) ... [2022-04-27 12:19:44,858 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 12:19:44" (1/1) ... [2022-04-27 12:19:44,868 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 12:19:44" (1/1) ... [2022-04-27 12:19:44,869 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 12:19:44" (1/1) ... [2022-04-27 12:19:44,875 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-27 12:19:44,876 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-27 12:19:44,876 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-27 12:19:44,876 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-27 12:19:44,885 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 12:19:44" (1/1) ... [2022-04-27 12:19:44,896 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 12:19:44,919 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 12:19:44,937 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:19:44,963 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:19:44,985 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-27 12:19:44,985 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-27 12:19:44,985 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-27 12:19:44,986 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-27 12:19:44,986 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-27 12:19:44,986 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-27 12:19:44,986 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-27 12:19:44,986 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-27 12:19:44,986 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_perror_fail [2022-04-27 12:19:44,986 INFO L130 BoogieDeclarations]: Found specification of procedure __assert [2022-04-27 12:19:44,986 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-27 12:19:44,986 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-27 12:19:44,986 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uint [2022-04-27 12:19:44,987 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-27 12:19:44,987 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-27 12:19:44,987 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-27 12:19:44,987 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-27 12:19:44,987 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-27 12:19:44,987 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-27 12:19:44,987 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-27 12:19:44,987 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-27 12:19:44,987 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-27 12:19:45,046 INFO L234 CfgBuilder]: Building ICFG [2022-04-27 12:19:45,047 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-27 12:19:45,190 INFO L275 CfgBuilder]: Performing block encoding [2022-04-27 12:19:45,197 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-27 12:19:45,197 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-04-27 12:19:45,199 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 12:19:45 BoogieIcfgContainer [2022-04-27 12:19:45,199 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-27 12:19:45,200 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-27 12:19:45,201 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-27 12:19:45,204 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-27 12:19:45,204 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.04 12:19:44" (1/3) ... [2022-04-27 12:19:45,205 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@70bbbef6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 12:19:45, skipping insertion in model container [2022-04-27 12:19:45,205 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 12:19:44" (2/3) ... [2022-04-27 12:19:45,205 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@70bbbef6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 12:19:45, skipping insertion in model container [2022-04-27 12:19:45,205 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 12:19:45" (3/3) ... [2022-04-27 12:19:45,206 INFO L111 eAbstractionObserver]: Analyzing ICFG divbin2_unwindbound10.i [2022-04-27 12:19:45,219 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-04-27 12:19:45,220 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-27 12:19:45,269 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-27 12:19:45,281 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@15879423, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@196143d [2022-04-27 12:19:45,282 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-27 12:19:45,290 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:19:45,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-04-27 12:19:45,302 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 12:19:45,303 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 12:19:45,303 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 12:19:45,309 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 12:19:45,310 INFO L85 PathProgramCache]: Analyzing trace with hash -2126508982, now seen corresponding path program 1 times [2022-04-27 12:19:45,319 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 12:19:45,335 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [909328307] [2022-04-27 12:19:45,336 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 12:19:45,336 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 12:19:45,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:19:45,563 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 12:19:45,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:19:45,581 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:19:45,581 INFO L290 TraceCheckUtils]: 1: Hoare triple {29#true} assume true; {29#true} is VALID [2022-04-27 12:19:45,581 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {29#true} {29#true} #82#return; {29#true} is VALID [2022-04-27 12:19:45,583 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:19:45,584 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:19:45,584 INFO L290 TraceCheckUtils]: 2: Hoare triple {29#true} assume true; {29#true} is VALID [2022-04-27 12:19:45,584 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {29#true} {29#true} #82#return; {29#true} is VALID [2022-04-27 12:19:45,584 INFO L272 TraceCheckUtils]: 4: Hoare triple {29#true} call #t~ret4 := main(); {29#true} is VALID [2022-04-27 12:19:45,585 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:19:45,585 INFO L290 TraceCheckUtils]: 6: Hoare triple {29#true} assume !true; {30#false} is VALID [2022-04-27 12:19:45,586 INFO L290 TraceCheckUtils]: 7: Hoare triple {30#false} assume !true; {30#false} is VALID [2022-04-27 12:19:45,586 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:19:45,586 INFO L290 TraceCheckUtils]: 9: Hoare triple {30#false} ~cond := #in~cond; {30#false} is VALID [2022-04-27 12:19:45,586 INFO L290 TraceCheckUtils]: 10: Hoare triple {30#false} assume 0 == ~cond; {30#false} is VALID [2022-04-27 12:19:45,587 INFO L290 TraceCheckUtils]: 11: Hoare triple {30#false} assume !false; {30#false} is VALID [2022-04-27 12:19:45,587 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:19:45,587 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 12:19:45,588 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [909328307] [2022-04-27 12:19:45,588 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [909328307] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 12:19:45,588 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 12:19:45,589 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-27 12:19:45,590 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [814984610] [2022-04-27 12:19:45,591 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 12:19:45,595 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:19:45,597 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 12:19:45,599 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:19:45,616 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:19:45,616 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-27 12:19:45,616 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 12:19:45,633 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-27 12:19:45,634 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-27 12:19:45,636 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:19:45,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:19:45,795 INFO L93 Difference]: Finished difference Result 44 states and 60 transitions. [2022-04-27 12:19:45,796 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-27 12:19:45,796 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:19:45,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 12:19:45,797 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:19:45,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 60 transitions. [2022-04-27 12:19:45,813 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:19:45,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 60 transitions. [2022-04-27 12:19:45,823 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 60 transitions. [2022-04-27 12:19:45,927 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:19:45,941 INFO L225 Difference]: With dead ends: 44 [2022-04-27 12:19:45,942 INFO L226 Difference]: Without dead ends: 22 [2022-04-27 12:19:45,945 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:19:45,954 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:19:45,956 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:19:45,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2022-04-27 12:19:45,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 21. [2022-04-27 12:19:45,993 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 12:19:45,994 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:19:45,995 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:19:45,995 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:19:46,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:19:46,003 INFO L93 Difference]: Finished difference Result 22 states and 27 transitions. [2022-04-27 12:19:46,003 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 27 transitions. [2022-04-27 12:19:46,004 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 12:19:46,004 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 12:19:46,005 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:19:46,006 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:19:46,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:19:46,008 INFO L93 Difference]: Finished difference Result 22 states and 27 transitions. [2022-04-27 12:19:46,008 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 27 transitions. [2022-04-27 12:19:46,008 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 12:19:46,009 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 12:19:46,009 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 12:19:46,009 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 12:19:46,009 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:19:46,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 26 transitions. [2022-04-27 12:19:46,012 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 26 transitions. Word has length 12 [2022-04-27 12:19:46,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 12:19:46,016 INFO L495 AbstractCegarLoop]: Abstraction has 21 states and 26 transitions. [2022-04-27 12:19:46,020 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:19:46,021 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 26 transitions. [2022-04-27 12:19:46,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-04-27 12:19:46,024 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 12:19:46,025 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 12:19:46,025 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-27 12:19:46,025 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 12:19:46,026 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 12:19:46,026 INFO L85 PathProgramCache]: Analyzing trace with hash 941422680, now seen corresponding path program 1 times [2022-04-27 12:19:46,026 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 12:19:46,026 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [612025957] [2022-04-27 12:19:46,027 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 12:19:46,027 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 12:19:46,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:19:46,133 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 12:19:46,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:19:46,180 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:19:46,181 INFO L290 TraceCheckUtils]: 1: Hoare triple {171#(<= ~counter~0 0)} assume true; {171#(<= ~counter~0 0)} is VALID [2022-04-27 12:19:46,182 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {171#(<= ~counter~0 0)} {166#true} #82#return; {171#(<= ~counter~0 0)} is VALID [2022-04-27 12:19:46,182 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:19:46,183 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:19:46,187 INFO L290 TraceCheckUtils]: 2: Hoare triple {171#(<= ~counter~0 0)} assume true; {171#(<= ~counter~0 0)} is VALID [2022-04-27 12:19:46,188 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {171#(<= ~counter~0 0)} {166#true} #82#return; {171#(<= ~counter~0 0)} is VALID [2022-04-27 12:19:46,188 INFO L272 TraceCheckUtils]: 4: Hoare triple {171#(<= ~counter~0 0)} call #t~ret4 := main(); {171#(<= ~counter~0 0)} is VALID [2022-04-27 12:19:46,189 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:19:46,190 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:19:46,196 INFO L290 TraceCheckUtils]: 7: Hoare triple {172#(<= |main_#t~post2| 0)} assume !(#t~post2 < 10);havoc #t~post2; {167#false} is VALID [2022-04-27 12:19:46,196 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:19:46,196 INFO L290 TraceCheckUtils]: 9: Hoare triple {167#false} assume !(#t~post3 < 10);havoc #t~post3; {167#false} is VALID [2022-04-27 12:19:46,196 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:19:46,197 INFO L290 TraceCheckUtils]: 11: Hoare triple {167#false} ~cond := #in~cond; {167#false} is VALID [2022-04-27 12:19:46,197 INFO L290 TraceCheckUtils]: 12: Hoare triple {167#false} assume 0 == ~cond; {167#false} is VALID [2022-04-27 12:19:46,197 INFO L290 TraceCheckUtils]: 13: Hoare triple {167#false} assume !false; {167#false} is VALID [2022-04-27 12:19:46,197 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:19:46,197 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 12:19:46,203 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [612025957] [2022-04-27 12:19:46,203 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [612025957] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 12:19:46,203 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 12:19:46,203 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-27 12:19:46,203 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1143064779] [2022-04-27 12:19:46,203 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 12:19:46,205 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:19:46,205 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 12:19:46,205 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:19:46,340 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:19:46,341 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-27 12:19:46,341 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 12:19:46,341 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-27 12:19:46,342 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-27 12:19:46,342 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:19:46,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:19:46,487 INFO L93 Difference]: Finished difference Result 35 states and 44 transitions. [2022-04-27 12:19:46,487 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-27 12:19:46,487 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:19:46,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 12:19:46,488 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:19:46,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 44 transitions. [2022-04-27 12:19:46,490 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:19:46,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 44 transitions. [2022-04-27 12:19:46,491 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 44 transitions. [2022-04-27 12:19:46,550 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:19:46,551 INFO L225 Difference]: With dead ends: 35 [2022-04-27 12:19:46,551 INFO L226 Difference]: Without dead ends: 23 [2022-04-27 12:19:46,551 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:19:46,552 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:19:46,553 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:19:46,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2022-04-27 12:19:46,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2022-04-27 12:19:46,558 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 12:19:46,559 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:19:46,559 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:19:46,559 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:19:46,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:19:46,570 INFO L93 Difference]: Finished difference Result 23 states and 28 transitions. [2022-04-27 12:19:46,570 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 28 transitions. [2022-04-27 12:19:46,583 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 12:19:46,583 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 12:19:46,585 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:19:46,586 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:19:46,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:19:46,589 INFO L93 Difference]: Finished difference Result 23 states and 28 transitions. [2022-04-27 12:19:46,589 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 28 transitions. [2022-04-27 12:19:46,590 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 12:19:46,590 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 12:19:46,590 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 12:19:46,590 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 12:19:46,593 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:19:46,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 28 transitions. [2022-04-27 12:19:46,598 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 28 transitions. Word has length 14 [2022-04-27 12:19:46,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 12:19:46,599 INFO L495 AbstractCegarLoop]: Abstraction has 23 states and 28 transitions. [2022-04-27 12:19:46,599 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:19:46,600 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 28 transitions. [2022-04-27 12:19:46,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-04-27 12:19:46,600 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 12:19:46,600 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 12:19:46,601 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-27 12:19:46,601 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 12:19:46,603 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 12:19:46,603 INFO L85 PathProgramCache]: Analyzing trace with hash -1209133518, now seen corresponding path program 1 times [2022-04-27 12:19:46,603 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 12:19:46,603 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [591555949] [2022-04-27 12:19:46,603 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 12:19:46,604 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 12:19:46,628 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 12:19:46,628 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1757863242] [2022-04-27 12:19:46,628 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 12:19:46,628 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 12:19:46,628 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 12:19:46,633 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:19:46,635 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:19:46,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:19:46,697 INFO L263 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-27 12:19:46,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:19:46,716 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 12:19:46,899 INFO L272 TraceCheckUtils]: 0: Hoare triple {303#true} call ULTIMATE.init(); {303#true} is VALID [2022-04-27 12:19:46,900 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:19:46,901 INFO L290 TraceCheckUtils]: 2: Hoare triple {311#(<= ~counter~0 0)} assume true; {311#(<= ~counter~0 0)} is VALID [2022-04-27 12:19:46,901 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {311#(<= ~counter~0 0)} {303#true} #82#return; {311#(<= ~counter~0 0)} is VALID [2022-04-27 12:19:46,902 INFO L272 TraceCheckUtils]: 4: Hoare triple {311#(<= ~counter~0 0)} call #t~ret4 := main(); {311#(<= ~counter~0 0)} is VALID [2022-04-27 12:19:46,902 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:19:46,903 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:19:46,904 INFO L290 TraceCheckUtils]: 7: Hoare triple {327#(<= ~counter~0 1)} assume !!(#t~post2 < 10);havoc #t~post2; {327#(<= ~counter~0 1)} is VALID [2022-04-27 12:19:46,904 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:19:46,904 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:19:46,905 INFO L290 TraceCheckUtils]: 10: Hoare triple {337#(<= |main_#t~post3| 1)} assume !(#t~post3 < 10);havoc #t~post3; {304#false} is VALID [2022-04-27 12:19:46,906 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:19:46,909 INFO L290 TraceCheckUtils]: 12: Hoare triple {304#false} ~cond := #in~cond; {304#false} is VALID [2022-04-27 12:19:46,910 INFO L290 TraceCheckUtils]: 13: Hoare triple {304#false} assume 0 == ~cond; {304#false} is VALID [2022-04-27 12:19:46,910 INFO L290 TraceCheckUtils]: 14: Hoare triple {304#false} assume !false; {304#false} is VALID [2022-04-27 12:19:46,912 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:19:46,912 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-27 12:19:46,912 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 12:19:46,913 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [591555949] [2022-04-27 12:19:46,913 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 12:19:46,913 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1757863242] [2022-04-27 12:19:46,914 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1757863242] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 12:19:46,917 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 12:19:46,917 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-27 12:19:46,917 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1388814496] [2022-04-27 12:19:46,917 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 12:19:46,918 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:19:46,919 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 12:19:46,919 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:19:46,959 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:19:46,959 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-27 12:19:46,960 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 12:19:46,960 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-27 12:19:46,961 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-04-27 12:19:46,961 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:19:47,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:19:47,029 INFO L93 Difference]: Finished difference Result 34 states and 40 transitions. [2022-04-27 12:19:47,029 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-27 12:19:47,030 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:19:47,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 12:19:47,030 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:19:47,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 40 transitions. [2022-04-27 12:19:47,032 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:19:47,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 40 transitions. [2022-04-27 12:19:47,033 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 40 transitions. [2022-04-27 12:19:47,067 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:19:47,068 INFO L225 Difference]: With dead ends: 34 [2022-04-27 12:19:47,068 INFO L226 Difference]: Without dead ends: 27 [2022-04-27 12:19:47,068 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:19:47,069 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:19:47,070 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:19:47,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2022-04-27 12:19:47,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 26. [2022-04-27 12:19:47,086 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 12:19:47,086 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:19:47,087 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:19:47,087 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:19:47,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:19:47,088 INFO L93 Difference]: Finished difference Result 27 states and 33 transitions. [2022-04-27 12:19:47,089 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 33 transitions. [2022-04-27 12:19:47,089 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 12:19:47,089 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 12:19:47,089 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:19:47,089 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:19:47,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:19:47,091 INFO L93 Difference]: Finished difference Result 27 states and 33 transitions. [2022-04-27 12:19:47,091 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 33 transitions. [2022-04-27 12:19:47,091 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 12:19:47,091 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 12:19:47,091 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 12:19:47,091 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 12:19:47,092 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:19:47,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 32 transitions. [2022-04-27 12:19:47,093 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 32 transitions. Word has length 15 [2022-04-27 12:19:47,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 12:19:47,093 INFO L495 AbstractCegarLoop]: Abstraction has 26 states and 32 transitions. [2022-04-27 12:19:47,093 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:19:47,093 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 32 transitions. [2022-04-27 12:19:47,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-04-27 12:19:47,094 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 12:19:47,094 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 12:19:47,139 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:19:47,307 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:19:47,308 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 12:19:47,308 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 12:19:47,308 INFO L85 PathProgramCache]: Analyzing trace with hash -1207346058, now seen corresponding path program 1 times [2022-04-27 12:19:47,308 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 12:19:47,309 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [122617482] [2022-04-27 12:19:47,309 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 12:19:47,309 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 12:19:47,322 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 12:19:47,323 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [374584416] [2022-04-27 12:19:47,323 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 12:19:47,323 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 12:19:47,323 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 12:19:47,338 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:19:47,341 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:19:47,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:19:47,398 INFO L263 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 14 conjunts are in the unsatisfiable core [2022-04-27 12:19:47,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:19:47,410 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 12:19:48,008 INFO L272 TraceCheckUtils]: 0: Hoare triple {487#true} call ULTIMATE.init(); {487#true} is VALID [2022-04-27 12:19:48,009 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:19:48,013 INFO L290 TraceCheckUtils]: 2: Hoare triple {487#true} assume true; {487#true} is VALID [2022-04-27 12:19:48,013 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {487#true} {487#true} #82#return; {487#true} is VALID [2022-04-27 12:19:48,013 INFO L272 TraceCheckUtils]: 4: Hoare triple {487#true} call #t~ret4 := main(); {487#true} is VALID [2022-04-27 12:19:48,014 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:19:48,014 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:19:48,015 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 < 10);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:19:48,015 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:19:48,016 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:19:48,017 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 < 10);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:19:48,020 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:19:48,020 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:19:48,021 INFO L290 TraceCheckUtils]: 13: Hoare triple {531#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {488#false} is VALID [2022-04-27 12:19:48,021 INFO L290 TraceCheckUtils]: 14: Hoare triple {488#false} assume !false; {488#false} is VALID [2022-04-27 12:19:48,022 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:19:48,022 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-27 12:19:48,022 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 12:19:48,023 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [122617482] [2022-04-27 12:19:48,023 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 12:19:48,023 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [374584416] [2022-04-27 12:19:48,023 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [374584416] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 12:19:48,024 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 12:19:48,024 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-27 12:19:48,024 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [430603213] [2022-04-27 12:19:48,024 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 12:19:48,024 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:19:48,025 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 12:19:48,025 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:19:48,043 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:19:48,043 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-27 12:19:48,043 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 12:19:48,045 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-27 12:19:48,046 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-04-27 12:19:48,046 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:19:48,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:19:48,268 INFO L93 Difference]: Finished difference Result 35 states and 42 transitions. [2022-04-27 12:19:48,268 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-27 12:19:48,268 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:19:48,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 12:19:48,269 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:19:48,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 42 transitions. [2022-04-27 12:19:48,270 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:19:48,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 42 transitions. [2022-04-27 12:19:48,272 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 42 transitions. [2022-04-27 12:19:48,316 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:19:48,317 INFO L225 Difference]: With dead ends: 35 [2022-04-27 12:19:48,335 INFO L226 Difference]: Without dead ends: 32 [2022-04-27 12:19:48,336 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:19:48,337 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.1s IncrementalHoareTripleChecker+Time [2022-04-27 12:19:48,337 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.1s Time] [2022-04-27 12:19:48,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2022-04-27 12:19:48,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2022-04-27 12:19:48,364 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 12:19:48,364 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:19:48,364 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:19:48,364 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:19:48,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:19:48,366 INFO L93 Difference]: Finished difference Result 32 states and 38 transitions. [2022-04-27 12:19:48,366 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 38 transitions. [2022-04-27 12:19:48,366 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 12:19:48,367 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 12:19:48,367 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:19:48,367 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:19:48,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:19:48,369 INFO L93 Difference]: Finished difference Result 32 states and 38 transitions. [2022-04-27 12:19:48,369 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 38 transitions. [2022-04-27 12:19:48,369 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 12:19:48,369 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 12:19:48,369 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 12:19:48,369 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 12:19:48,370 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:19:48,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 38 transitions. [2022-04-27 12:19:48,371 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 38 transitions. Word has length 15 [2022-04-27 12:19:48,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 12:19:48,371 INFO L495 AbstractCegarLoop]: Abstraction has 32 states and 38 transitions. [2022-04-27 12:19:48,371 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:19:48,371 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 38 transitions. [2022-04-27 12:19:48,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-04-27 12:19:48,372 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 12:19:48,372 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:19:48,403 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:19:48,573 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:19:48,573 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 12:19:48,573 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 12:19:48,574 INFO L85 PathProgramCache]: Analyzing trace with hash -352921097, now seen corresponding path program 1 times [2022-04-27 12:19:48,574 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 12:19:48,574 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1438431323] [2022-04-27 12:19:48,574 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 12:19:48,574 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 12:19:48,588 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 12:19:48,588 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1648847729] [2022-04-27 12:19:48,588 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 12:19:48,588 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 12:19:48,588 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 12:19:48,597 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:19:48,598 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:19:48,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:19:48,654 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-27 12:19:48,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:19:48,661 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 12:19:48,805 INFO L272 TraceCheckUtils]: 0: Hoare triple {693#true} call ULTIMATE.init(); {693#true} is VALID [2022-04-27 12:19:48,806 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:19:48,806 INFO L290 TraceCheckUtils]: 2: Hoare triple {701#(<= ~counter~0 0)} assume true; {701#(<= ~counter~0 0)} is VALID [2022-04-27 12:19:48,807 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {701#(<= ~counter~0 0)} {693#true} #82#return; {701#(<= ~counter~0 0)} is VALID [2022-04-27 12:19:48,807 INFO L272 TraceCheckUtils]: 4: Hoare triple {701#(<= ~counter~0 0)} call #t~ret4 := main(); {701#(<= ~counter~0 0)} is VALID [2022-04-27 12:19:48,807 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:19:48,808 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:19:48,808 INFO L290 TraceCheckUtils]: 7: Hoare triple {717#(<= ~counter~0 1)} assume !!(#t~post2 < 10);havoc #t~post2; {717#(<= ~counter~0 1)} is VALID [2022-04-27 12:19:48,809 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:19:48,810 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:19:48,810 INFO L290 TraceCheckUtils]: 10: Hoare triple {727#(<= |main_#t~post2| 1)} assume !(#t~post2 < 10);havoc #t~post2; {694#false} is VALID [2022-04-27 12:19:48,810 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:19:48,811 INFO L290 TraceCheckUtils]: 12: Hoare triple {694#false} assume !(#t~post3 < 10);havoc #t~post3; {694#false} is VALID [2022-04-27 12:19:48,811 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:19:48,811 INFO L290 TraceCheckUtils]: 14: Hoare triple {694#false} ~cond := #in~cond; {694#false} is VALID [2022-04-27 12:19:48,811 INFO L290 TraceCheckUtils]: 15: Hoare triple {694#false} assume 0 == ~cond; {694#false} is VALID [2022-04-27 12:19:48,811 INFO L290 TraceCheckUtils]: 16: Hoare triple {694#false} assume !false; {694#false} is VALID [2022-04-27 12:19:48,811 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:19:48,811 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 12:19:48,966 INFO L290 TraceCheckUtils]: 16: Hoare triple {694#false} assume !false; {694#false} is VALID [2022-04-27 12:19:48,966 INFO L290 TraceCheckUtils]: 15: Hoare triple {694#false} assume 0 == ~cond; {694#false} is VALID [2022-04-27 12:19:48,966 INFO L290 TraceCheckUtils]: 14: Hoare triple {694#false} ~cond := #in~cond; {694#false} is VALID [2022-04-27 12:19:48,966 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:19:48,966 INFO L290 TraceCheckUtils]: 12: Hoare triple {694#false} assume !(#t~post3 < 10);havoc #t~post3; {694#false} is VALID [2022-04-27 12:19:48,966 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:19:48,967 INFO L290 TraceCheckUtils]: 10: Hoare triple {767#(< |main_#t~post2| 10)} assume !(#t~post2 < 10);havoc #t~post2; {694#false} is VALID [2022-04-27 12:19:48,967 INFO L290 TraceCheckUtils]: 9: Hoare triple {771#(< ~counter~0 10)} #t~post2 := ~counter~0;~counter~0 := 1 + #t~post2; {767#(< |main_#t~post2| 10)} is VALID [2022-04-27 12:19:48,968 INFO L290 TraceCheckUtils]: 8: Hoare triple {771#(< ~counter~0 10)} assume !!(~r~0 % 4294967296 >= ~b~0 % 4294967296);~b~0 := 2 * ~b~0; {771#(< ~counter~0 10)} is VALID [2022-04-27 12:19:48,968 INFO L290 TraceCheckUtils]: 7: Hoare triple {771#(< ~counter~0 10)} assume !!(#t~post2 < 10);havoc #t~post2; {771#(< ~counter~0 10)} is VALID [2022-04-27 12:19:48,969 INFO L290 TraceCheckUtils]: 6: Hoare triple {781#(< ~counter~0 9)} #t~post2 := ~counter~0;~counter~0 := 1 + #t~post2; {771#(< ~counter~0 10)} is VALID [2022-04-27 12:19:48,969 INFO L290 TraceCheckUtils]: 5: Hoare triple {781#(< ~counter~0 9)} 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 9)} is VALID [2022-04-27 12:19:48,970 INFO L272 TraceCheckUtils]: 4: Hoare triple {781#(< ~counter~0 9)} call #t~ret4 := main(); {781#(< ~counter~0 9)} is VALID [2022-04-27 12:19:48,971 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {781#(< ~counter~0 9)} {693#true} #82#return; {781#(< ~counter~0 9)} is VALID [2022-04-27 12:19:48,971 INFO L290 TraceCheckUtils]: 2: Hoare triple {781#(< ~counter~0 9)} assume true; {781#(< ~counter~0 9)} is VALID [2022-04-27 12:19:48,972 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 9)} is VALID [2022-04-27 12:19:48,972 INFO L272 TraceCheckUtils]: 0: Hoare triple {693#true} call ULTIMATE.init(); {693#true} is VALID [2022-04-27 12:19:48,972 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:19:48,972 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 12:19:48,972 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1438431323] [2022-04-27 12:19:48,972 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 12:19:48,973 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1648847729] [2022-04-27 12:19:48,973 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1648847729] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 12:19:48,973 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-27 12:19:48,973 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2022-04-27 12:19:48,973 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [466386119] [2022-04-27 12:19:48,973 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-27 12:19:48,974 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:19:48,974 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 12:19:48,974 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:19:48,995 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:19:48,995 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-27 12:19:48,995 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 12:19:48,996 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-27 12:19:48,996 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2022-04-27 12:19:48,996 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:19:49,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:19:49,204 INFO L93 Difference]: Finished difference Result 66 states and 84 transitions. [2022-04-27 12:19:49,204 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-04-27 12:19:49,205 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:19:49,205 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 12:19:49,205 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:19:49,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 84 transitions. [2022-04-27 12:19:49,208 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:19:49,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 84 transitions. [2022-04-27 12:19:49,211 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 10 states and 84 transitions. [2022-04-27 12:19:49,294 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:19:49,296 INFO L225 Difference]: With dead ends: 66 [2022-04-27 12:19:49,296 INFO L226 Difference]: Without dead ends: 54 [2022-04-27 12:19:49,296 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:19:49,297 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:19:49,298 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:19:49,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2022-04-27 12:19:49,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 40. [2022-04-27 12:19:49,311 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 12:19:49,311 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:19:49,312 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:19:49,312 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:19:49,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:19:49,314 INFO L93 Difference]: Finished difference Result 54 states and 66 transitions. [2022-04-27 12:19:49,314 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 66 transitions. [2022-04-27 12:19:49,315 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 12:19:49,315 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 12:19:49,315 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:19:49,315 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:19:49,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:19:49,318 INFO L93 Difference]: Finished difference Result 54 states and 66 transitions. [2022-04-27 12:19:49,318 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 66 transitions. [2022-04-27 12:19:49,318 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 12:19:49,318 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 12:19:49,318 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 12:19:49,318 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 12:19:49,319 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:19:49,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 48 transitions. [2022-04-27 12:19:49,320 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 48 transitions. Word has length 17 [2022-04-27 12:19:49,320 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 12:19:49,320 INFO L495 AbstractCegarLoop]: Abstraction has 40 states and 48 transitions. [2022-04-27 12:19:49,320 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:19:49,321 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 48 transitions. [2022-04-27 12:19:49,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-04-27 12:19:49,321 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 12:19:49,321 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:19:49,346 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2022-04-27 12:19:49,543 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:19:49,544 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 12:19:49,544 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 12:19:49,545 INFO L85 PathProgramCache]: Analyzing trace with hash 1615882355, now seen corresponding path program 1 times [2022-04-27 12:19:49,545 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 12:19:49,545 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1869140631] [2022-04-27 12:19:49,545 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 12:19:49,545 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 12:19:49,596 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 12:19:49,596 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1144718093] [2022-04-27 12:19:49,597 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 12:19:49,597 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 12:19:49,597 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 12:19:49,601 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:19:49,604 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:19:49,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:19:49,638 INFO L263 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-27 12:19:49,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:19:49,646 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 12:19:49,786 INFO L272 TraceCheckUtils]: 0: Hoare triple {1056#true} call ULTIMATE.init(); {1056#true} is VALID [2022-04-27 12:19:49,787 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:19:49,787 INFO L290 TraceCheckUtils]: 2: Hoare triple {1064#(<= ~counter~0 0)} assume true; {1064#(<= ~counter~0 0)} is VALID [2022-04-27 12:19:49,788 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1064#(<= ~counter~0 0)} {1056#true} #82#return; {1064#(<= ~counter~0 0)} is VALID [2022-04-27 12:19:49,788 INFO L272 TraceCheckUtils]: 4: Hoare triple {1064#(<= ~counter~0 0)} call #t~ret4 := main(); {1064#(<= ~counter~0 0)} is VALID [2022-04-27 12:19:49,789 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:19:49,789 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:19:49,790 INFO L290 TraceCheckUtils]: 7: Hoare triple {1080#(<= ~counter~0 1)} assume !!(#t~post2 < 10);havoc #t~post2; {1080#(<= ~counter~0 1)} is VALID [2022-04-27 12:19:49,795 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:19:49,796 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:19:49,796 INFO L290 TraceCheckUtils]: 10: Hoare triple {1090#(<= ~counter~0 2)} assume !!(#t~post2 < 10);havoc #t~post2; {1090#(<= ~counter~0 2)} is VALID [2022-04-27 12:19:49,797 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:19:49,797 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:19:49,797 INFO L290 TraceCheckUtils]: 13: Hoare triple {1100#(<= |main_#t~post3| 2)} assume !(#t~post3 < 10);havoc #t~post3; {1057#false} is VALID [2022-04-27 12:19:49,798 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:19:49,798 INFO L290 TraceCheckUtils]: 15: Hoare triple {1057#false} ~cond := #in~cond; {1057#false} is VALID [2022-04-27 12:19:49,798 INFO L290 TraceCheckUtils]: 16: Hoare triple {1057#false} assume 0 == ~cond; {1057#false} is VALID [2022-04-27 12:19:49,798 INFO L290 TraceCheckUtils]: 17: Hoare triple {1057#false} assume !false; {1057#false} is VALID [2022-04-27 12:19:49,798 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:19:49,798 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 12:19:49,963 INFO L290 TraceCheckUtils]: 17: Hoare triple {1057#false} assume !false; {1057#false} is VALID [2022-04-27 12:19:49,964 INFO L290 TraceCheckUtils]: 16: Hoare triple {1057#false} assume 0 == ~cond; {1057#false} is VALID [2022-04-27 12:19:49,964 INFO L290 TraceCheckUtils]: 15: Hoare triple {1057#false} ~cond := #in~cond; {1057#false} is VALID [2022-04-27 12:19:49,964 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:19:49,965 INFO L290 TraceCheckUtils]: 13: Hoare triple {1128#(< |main_#t~post3| 10)} assume !(#t~post3 < 10);havoc #t~post3; {1057#false} is VALID [2022-04-27 12:19:49,965 INFO L290 TraceCheckUtils]: 12: Hoare triple {1132#(< ~counter~0 10)} #t~post3 := ~counter~0;~counter~0 := 1 + #t~post3; {1128#(< |main_#t~post3| 10)} is VALID [2022-04-27 12:19:49,966 INFO L290 TraceCheckUtils]: 11: Hoare triple {1132#(< ~counter~0 10)} assume !(~r~0 % 4294967296 >= ~b~0 % 4294967296); {1132#(< ~counter~0 10)} is VALID [2022-04-27 12:19:49,967 INFO L290 TraceCheckUtils]: 10: Hoare triple {1132#(< ~counter~0 10)} assume !!(#t~post2 < 10);havoc #t~post2; {1132#(< ~counter~0 10)} is VALID [2022-04-27 12:19:49,968 INFO L290 TraceCheckUtils]: 9: Hoare triple {1142#(< ~counter~0 9)} #t~post2 := ~counter~0;~counter~0 := 1 + #t~post2; {1132#(< ~counter~0 10)} is VALID [2022-04-27 12:19:49,976 INFO L290 TraceCheckUtils]: 8: Hoare triple {1142#(< ~counter~0 9)} assume !!(~r~0 % 4294967296 >= ~b~0 % 4294967296);~b~0 := 2 * ~b~0; {1142#(< ~counter~0 9)} is VALID [2022-04-27 12:19:49,977 INFO L290 TraceCheckUtils]: 7: Hoare triple {1142#(< ~counter~0 9)} assume !!(#t~post2 < 10);havoc #t~post2; {1142#(< ~counter~0 9)} is VALID [2022-04-27 12:19:49,977 INFO L290 TraceCheckUtils]: 6: Hoare triple {1152#(< ~counter~0 8)} #t~post2 := ~counter~0;~counter~0 := 1 + #t~post2; {1142#(< ~counter~0 9)} is VALID [2022-04-27 12:19:49,978 INFO L290 TraceCheckUtils]: 5: Hoare triple {1152#(< ~counter~0 8)} 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 8)} is VALID [2022-04-27 12:19:49,978 INFO L272 TraceCheckUtils]: 4: Hoare triple {1152#(< ~counter~0 8)} call #t~ret4 := main(); {1152#(< ~counter~0 8)} is VALID [2022-04-27 12:19:49,979 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1152#(< ~counter~0 8)} {1056#true} #82#return; {1152#(< ~counter~0 8)} is VALID [2022-04-27 12:19:49,979 INFO L290 TraceCheckUtils]: 2: Hoare triple {1152#(< ~counter~0 8)} assume true; {1152#(< ~counter~0 8)} is VALID [2022-04-27 12:19:49,980 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 8)} is VALID [2022-04-27 12:19:49,980 INFO L272 TraceCheckUtils]: 0: Hoare triple {1056#true} call ULTIMATE.init(); {1056#true} is VALID [2022-04-27 12:19:49,980 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:19:49,980 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 12:19:49,980 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1869140631] [2022-04-27 12:19:49,980 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 12:19:49,981 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1144718093] [2022-04-27 12:19:49,981 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1144718093] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 12:19:49,981 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-27 12:19:49,981 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2022-04-27 12:19:49,981 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2145411023] [2022-04-27 12:19:49,981 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-27 12:19:49,982 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:19:49,982 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 12:19:49,982 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:19:50,010 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:19:50,010 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-27 12:19:50,010 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 12:19:50,011 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-27 12:19:50,011 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-04-27 12:19:50,011 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:19:50,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:19:50,467 INFO L93 Difference]: Finished difference Result 91 states and 112 transitions. [2022-04-27 12:19:50,468 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-04-27 12:19:50,475 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:19:50,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 12:19:50,476 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:19:50,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 112 transitions. [2022-04-27 12:19:50,479 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:19:50,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 112 transitions. [2022-04-27 12:19:50,482 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 13 states and 112 transitions. [2022-04-27 12:19:50,582 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:19:50,584 INFO L225 Difference]: With dead ends: 91 [2022-04-27 12:19:50,585 INFO L226 Difference]: Without dead ends: 84 [2022-04-27 12:19:50,585 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=119, Unknown=0, NotChecked=0, Total=182 [2022-04-27 12:19:50,586 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 80 mSDsluCounter, 139 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s 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.1s IncrementalHoareTripleChecker+Time [2022-04-27 12:19:50,586 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.1s Time] [2022-04-27 12:19:50,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2022-04-27 12:19:50,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 77. [2022-04-27 12:19:50,607 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 12:19:50,607 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:19:50,608 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:19:50,608 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:19:50,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:19:50,611 INFO L93 Difference]: Finished difference Result 84 states and 102 transitions. [2022-04-27 12:19:50,611 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 102 transitions. [2022-04-27 12:19:50,612 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 12:19:50,612 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 12:19:50,613 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:19:50,613 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:19:50,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:19:50,616 INFO L93 Difference]: Finished difference Result 84 states and 102 transitions. [2022-04-27 12:19:50,616 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 102 transitions. [2022-04-27 12:19:50,617 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 12:19:50,617 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 12:19:50,617 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 12:19:50,617 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 12:19:50,617 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:19:50,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 98 transitions. [2022-04-27 12:19:50,620 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 98 transitions. Word has length 18 [2022-04-27 12:19:50,620 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 12:19:50,620 INFO L495 AbstractCegarLoop]: Abstraction has 77 states and 98 transitions. [2022-04-27 12:19:50,620 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:19:50,620 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 98 transitions. [2022-04-27 12:19:50,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-04-27 12:19:50,621 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 12:19:50,621 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:19:50,648 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2022-04-27 12:19:50,843 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:19:50,844 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 12:19:50,844 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 12:19:50,844 INFO L85 PathProgramCache]: Analyzing trace with hash 1617669815, now seen corresponding path program 1 times [2022-04-27 12:19:50,844 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 12:19:50,844 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1550023493] [2022-04-27 12:19:50,845 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 12:19:50,845 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 12:19:50,903 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 12:19:50,903 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [546406107] [2022-04-27 12:19:50,904 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 12:19:50,904 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 12:19:50,904 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 12:19:50,905 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:19:50,906 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:19:50,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:19:50,962 INFO L263 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 14 conjunts are in the unsatisfiable core [2022-04-27 12:19:50,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:19:50,973 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 12:19:51,376 INFO L272 TraceCheckUtils]: 0: Hoare triple {1568#true} call ULTIMATE.init(); {1568#true} is VALID [2022-04-27 12:19:51,377 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:19:51,377 INFO L290 TraceCheckUtils]: 2: Hoare triple {1568#true} assume true; {1568#true} is VALID [2022-04-27 12:19:51,377 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1568#true} {1568#true} #82#return; {1568#true} is VALID [2022-04-27 12:19:51,377 INFO L272 TraceCheckUtils]: 4: Hoare triple {1568#true} call #t~ret4 := main(); {1568#true} is VALID [2022-04-27 12:19:51,377 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:19:51,378 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:19:51,378 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 < 10);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:19:51,379 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:19:51,379 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:19:51,380 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 < 10);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:19:51,380 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:19:51,381 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:19:51,381 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 < 10);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:19:51,382 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:19:51,383 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:19:51,383 INFO L290 TraceCheckUtils]: 16: Hoare triple {1621#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1569#false} is VALID [2022-04-27 12:19:51,383 INFO L290 TraceCheckUtils]: 17: Hoare triple {1569#false} assume !false; {1569#false} is VALID [2022-04-27 12:19:51,384 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:19:51,384 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 12:19:51,759 INFO L290 TraceCheckUtils]: 17: Hoare triple {1569#false} assume !false; {1569#false} is VALID [2022-04-27 12:19:51,759 INFO L290 TraceCheckUtils]: 16: Hoare triple {1621#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1569#false} is VALID [2022-04-27 12:19:51,760 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:19:51,762 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:19:51,762 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 < 10);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:19:51,763 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:19:51,763 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:19:51,764 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 < 10);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:19:51,764 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:19:51,765 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:19:51,765 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 < 10);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:19:51,766 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:19:51,767 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:19:51,767 INFO L272 TraceCheckUtils]: 4: Hoare triple {1568#true} call #t~ret4 := main(); {1568#true} is VALID [2022-04-27 12:19:51,767 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1568#true} {1568#true} #82#return; {1568#true} is VALID [2022-04-27 12:19:51,767 INFO L290 TraceCheckUtils]: 2: Hoare triple {1568#true} assume true; {1568#true} is VALID [2022-04-27 12:19:51,767 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:19:51,767 INFO L272 TraceCheckUtils]: 0: Hoare triple {1568#true} call ULTIMATE.init(); {1568#true} is VALID [2022-04-27 12:19:51,768 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:19:51,768 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 12:19:51,768 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1550023493] [2022-04-27 12:19:51,768 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 12:19:51,768 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [546406107] [2022-04-27 12:19:51,768 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [546406107] provided 1 perfect and 1 imperfect interpolant sequences [2022-04-27 12:19:51,768 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-04-27 12:19:51,768 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 8 [2022-04-27 12:19:51,768 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2027578793] [2022-04-27 12:19:51,768 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 12:19:51,769 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:19:51,769 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 12:19:51,769 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:19:52,827 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 12:19:52,828 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-27 12:19:52,828 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 12:19:52,828 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-27 12:19:52,828 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2022-04-27 12:19:52,829 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:19:53,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:19:53,146 INFO L93 Difference]: Finished difference Result 110 states and 135 transitions. [2022-04-27 12:19:53,146 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-27 12:19:53,147 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:19:53,147 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 12:19:53,147 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:19:53,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 41 transitions. [2022-04-27 12:19:53,148 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:19:53,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 41 transitions. [2022-04-27 12:19:53,150 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 41 transitions. [2022-04-27 12:19:55,201 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:19:55,203 INFO L225 Difference]: With dead ends: 110 [2022-04-27 12:19:55,203 INFO L226 Difference]: Without dead ends: 108 [2022-04-27 12:19:55,203 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:19:55,204 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:19:55,204 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:19:55,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2022-04-27 12:19:55,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 107. [2022-04-27 12:19:55,269 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 12:19:55,269 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:19:55,270 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:19:55,270 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:19:55,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:19:55,273 INFO L93 Difference]: Finished difference Result 108 states and 130 transitions. [2022-04-27 12:19:55,273 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 130 transitions. [2022-04-27 12:19:55,274 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 12:19:55,274 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 12:19:55,274 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:19:55,275 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:19:55,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:19:55,292 INFO L93 Difference]: Finished difference Result 108 states and 130 transitions. [2022-04-27 12:19:55,292 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 130 transitions. [2022-04-27 12:19:55,292 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 12:19:55,292 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 12:19:55,293 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 12:19:55,293 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 12:19:55,293 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:19:55,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 129 transitions. [2022-04-27 12:19:55,296 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 129 transitions. Word has length 18 [2022-04-27 12:19:55,296 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 12:19:55,296 INFO L495 AbstractCegarLoop]: Abstraction has 107 states and 129 transitions. [2022-04-27 12:19:55,296 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:19:55,296 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 129 transitions. [2022-04-27 12:19:55,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-04-27 12:19:55,297 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 12:19:55,297 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:19:55,324 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:19:55,511 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:19:55,511 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 12:19:55,511 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 12:19:55,512 INFO L85 PathProgramCache]: Analyzing trace with hash 1627795671, now seen corresponding path program 1 times [2022-04-27 12:19:55,512 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 12:19:55,512 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [682942435] [2022-04-27 12:19:55,512 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 12:19:55,512 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 12:19:55,523 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 12:19:55,523 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1486834300] [2022-04-27 12:19:55,523 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 12:19:55,523 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 12:19:55,523 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 12:19:55,532 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:19:55,532 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:19:55,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:19:55,568 INFO L263 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 5 conjunts are in the unsatisfiable core [2022-04-27 12:19:55,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:19:55,573 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 12:19:55,657 INFO L272 TraceCheckUtils]: 0: Hoare triple {2183#true} call ULTIMATE.init(); {2183#true} is VALID [2022-04-27 12:19:55,658 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:19:55,658 INFO L290 TraceCheckUtils]: 2: Hoare triple {2183#true} assume true; {2183#true} is VALID [2022-04-27 12:19:55,658 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2183#true} {2183#true} #82#return; {2183#true} is VALID [2022-04-27 12:19:55,658 INFO L272 TraceCheckUtils]: 4: Hoare triple {2183#true} call #t~ret4 := main(); {2183#true} is VALID [2022-04-27 12:19:55,658 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:19:55,659 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:19:55,659 INFO L290 TraceCheckUtils]: 7: Hoare triple {2203#(and (= main_~B~0 main_~b~0) (= main_~B~0 1))} assume !!(#t~post2 < 10);havoc #t~post2; {2203#(and (= main_~B~0 main_~b~0) (= main_~B~0 1))} is VALID [2022-04-27 12:19:55,661 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:19:55,661 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:19:55,661 INFO L290 TraceCheckUtils]: 10: Hoare triple {2203#(and (= main_~B~0 main_~b~0) (= main_~B~0 1))} assume !!(#t~post3 < 10);havoc #t~post3; {2203#(and (= main_~B~0 main_~b~0) (= main_~B~0 1))} is VALID [2022-04-27 12:19:55,661 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:19:55,662 INFO L290 TraceCheckUtils]: 12: Hoare triple {2183#true} ~cond := #in~cond; {2183#true} is VALID [2022-04-27 12:19:55,662 INFO L290 TraceCheckUtils]: 13: Hoare triple {2183#true} assume !(0 == ~cond); {2183#true} is VALID [2022-04-27 12:19:55,662 INFO L290 TraceCheckUtils]: 14: Hoare triple {2183#true} assume true; {2183#true} is VALID [2022-04-27 12:19:55,662 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:19:55,663 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:19:55,663 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:19:55,663 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:19:55,663 INFO L290 TraceCheckUtils]: 19: Hoare triple {2184#false} assume !!(#t~post3 < 10);havoc #t~post3; {2184#false} is VALID [2022-04-27 12:19:55,664 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:19:55,664 INFO L290 TraceCheckUtils]: 21: Hoare triple {2184#false} ~cond := #in~cond; {2184#false} is VALID [2022-04-27 12:19:55,664 INFO L290 TraceCheckUtils]: 22: Hoare triple {2184#false} assume 0 == ~cond; {2184#false} is VALID [2022-04-27 12:19:55,664 INFO L290 TraceCheckUtils]: 23: Hoare triple {2184#false} assume !false; {2184#false} is VALID [2022-04-27 12:19:55,664 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:19:55,664 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-27 12:19:55,664 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 12:19:55,664 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [682942435] [2022-04-27 12:19:55,665 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 12:19:55,665 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1486834300] [2022-04-27 12:19:55,665 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1486834300] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 12:19:55,665 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 12:19:55,665 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-27 12:19:55,665 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1894716437] [2022-04-27 12:19:55,665 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 12:19:55,666 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:19:55,666 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 12:19:55,666 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:19:55,684 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:19:55,684 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-27 12:19:55,685 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 12:19:55,685 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-27 12:19:55,685 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-27 12:19:55,685 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:19:55,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:19:55,754 INFO L93 Difference]: Finished difference Result 148 states and 181 transitions. [2022-04-27 12:19:55,754 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-27 12:19:55,755 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:19:55,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 12:19:55,755 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:19:55,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 50 transitions. [2022-04-27 12:19:55,756 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:19:55,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 50 transitions. [2022-04-27 12:19:55,758 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 50 transitions. [2022-04-27 12:19:55,794 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:19:55,795 INFO L225 Difference]: With dead ends: 148 [2022-04-27 12:19:55,796 INFO L226 Difference]: Without dead ends: 93 [2022-04-27 12:19:55,796 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:19:55,797 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:19:55,797 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:19:55,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2022-04-27 12:19:55,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2022-04-27 12:19:55,821 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 12:19:55,821 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:19:55,822 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:19:55,822 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:19:55,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:19:55,825 INFO L93 Difference]: Finished difference Result 93 states and 112 transitions. [2022-04-27 12:19:55,825 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 112 transitions. [2022-04-27 12:19:55,825 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 12:19:55,825 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 12:19:55,826 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:19:55,826 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:19:55,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:19:55,829 INFO L93 Difference]: Finished difference Result 93 states and 112 transitions. [2022-04-27 12:19:55,829 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 112 transitions. [2022-04-27 12:19:55,829 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 12:19:55,829 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 12:19:55,829 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 12:19:55,829 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 12:19:55,829 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:19:55,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 112 transitions. [2022-04-27 12:19:55,832 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 112 transitions. Word has length 24 [2022-04-27 12:19:55,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 12:19:55,832 INFO L495 AbstractCegarLoop]: Abstraction has 93 states and 112 transitions. [2022-04-27 12:19:55,832 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:19:55,833 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 112 transitions. [2022-04-27 12:19:55,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-04-27 12:19:55,833 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 12:19:55,833 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:19:55,862 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:19:56,059 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:19:56,060 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 12:19:56,060 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 12:19:56,060 INFO L85 PathProgramCache]: Analyzing trace with hash 145864044, now seen corresponding path program 1 times [2022-04-27 12:19:56,060 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 12:19:56,060 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2115162710] [2022-04-27 12:19:56,060 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 12:19:56,061 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 12:19:56,080 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 12:19:56,080 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [477787887] [2022-04-27 12:19:56,080 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 12:19:56,080 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 12:19:56,080 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 12:19:56,081 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:19:56,108 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:19:56,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:19:56,124 INFO L263 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 11 conjunts are in the unsatisfiable core [2022-04-27 12:19:56,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:19:56,136 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 12:19:56,330 INFO L272 TraceCheckUtils]: 0: Hoare triple {2756#true} call ULTIMATE.init(); {2756#true} is VALID [2022-04-27 12:19:56,330 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:19:56,330 INFO L290 TraceCheckUtils]: 2: Hoare triple {2756#true} assume true; {2756#true} is VALID [2022-04-27 12:19:56,330 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2756#true} {2756#true} #82#return; {2756#true} is VALID [2022-04-27 12:19:56,330 INFO L272 TraceCheckUtils]: 4: Hoare triple {2756#true} call #t~ret4 := main(); {2756#true} is VALID [2022-04-27 12:19:56,330 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:19:56,331 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:19:56,331 INFO L290 TraceCheckUtils]: 7: Hoare triple {2756#true} assume !!(#t~post2 < 10);havoc #t~post2; {2756#true} is VALID [2022-04-27 12:19:56,331 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:19:56,331 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:19:56,331 INFO L290 TraceCheckUtils]: 10: Hoare triple {2756#true} assume !!(#t~post2 < 10);havoc #t~post2; {2756#true} is VALID [2022-04-27 12:19:56,331 INFO L290 TraceCheckUtils]: 11: Hoare triple {2756#true} assume !(~r~0 % 4294967296 >= ~b~0 % 4294967296); {2756#true} is VALID [2022-04-27 12:19:56,331 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:19:56,331 INFO L290 TraceCheckUtils]: 13: Hoare triple {2756#true} assume !!(#t~post3 < 10);havoc #t~post3; {2756#true} is VALID [2022-04-27 12:19:56,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:19:56,332 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:19:56,332 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:19:56,333 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:19:56,334 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:19:56,334 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:19:56,335 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:19:56,335 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:19:56,336 INFO L290 TraceCheckUtils]: 22: Hoare triple {2828#(= __VERIFIER_assert_~cond 1)} assume 0 == ~cond; {2757#false} is VALID [2022-04-27 12:19:56,336 INFO L290 TraceCheckUtils]: 23: Hoare triple {2757#false} assume !false; {2757#false} is VALID [2022-04-27 12:19:56,336 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:19:56,336 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 12:19:57,210 INFO L290 TraceCheckUtils]: 23: Hoare triple {2757#false} assume !false; {2757#false} is VALID [2022-04-27 12:19:57,211 INFO L290 TraceCheckUtils]: 22: Hoare triple {2838#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {2757#false} is VALID [2022-04-27 12:19:57,211 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:19:57,212 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:19:57,213 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:19:57,214 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:19:57,214 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:19:57,214 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:19:57,215 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:19:57,215 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:19:57,215 INFO L290 TraceCheckUtils]: 13: Hoare triple {2756#true} assume !!(#t~post3 < 10);havoc #t~post3; {2756#true} is VALID [2022-04-27 12:19:57,215 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:19:57,215 INFO L290 TraceCheckUtils]: 11: Hoare triple {2756#true} assume !(~r~0 % 4294967296 >= ~b~0 % 4294967296); {2756#true} is VALID [2022-04-27 12:19:57,215 INFO L290 TraceCheckUtils]: 10: Hoare triple {2756#true} assume !!(#t~post2 < 10);havoc #t~post2; {2756#true} is VALID [2022-04-27 12:19:57,215 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:19:57,216 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:19:57,216 INFO L290 TraceCheckUtils]: 7: Hoare triple {2756#true} assume !!(#t~post2 < 10);havoc #t~post2; {2756#true} is VALID [2022-04-27 12:19:57,216 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:19:57,216 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:19:57,216 INFO L272 TraceCheckUtils]: 4: Hoare triple {2756#true} call #t~ret4 := main(); {2756#true} is VALID [2022-04-27 12:19:57,216 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2756#true} {2756#true} #82#return; {2756#true} is VALID [2022-04-27 12:19:57,216 INFO L290 TraceCheckUtils]: 2: Hoare triple {2756#true} assume true; {2756#true} is VALID [2022-04-27 12:19:57,217 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:19:57,217 INFO L272 TraceCheckUtils]: 0: Hoare triple {2756#true} call ULTIMATE.init(); {2756#true} is VALID [2022-04-27 12:19:57,218 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:19:57,218 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 12:19:57,218 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2115162710] [2022-04-27 12:19:57,218 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 12:19:57,218 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [477787887] [2022-04-27 12:19:57,218 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [477787887] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 12:19:57,218 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-27 12:19:57,218 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6] total 9 [2022-04-27 12:19:57,218 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [218027677] [2022-04-27 12:19:57,218 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-27 12:19:57,219 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:19:57,219 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 12:19:57,220 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:19:57,242 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:19:57,242 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-27 12:19:57,242 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 12:19:57,242 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-27 12:19:57,243 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2022-04-27 12:19:57,243 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:19:59,381 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:19:59,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:19:59,749 INFO L93 Difference]: Finished difference Result 108 states and 126 transitions. [2022-04-27 12:19:59,749 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-27 12:19:59,749 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:19:59,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 12:19:59,749 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:19:59,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 35 transitions. [2022-04-27 12:19:59,751 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:19:59,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 35 transitions. [2022-04-27 12:19:59,752 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 35 transitions. [2022-04-27 12:19:59,785 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:19:59,787 INFO L225 Difference]: With dead ends: 108 [2022-04-27 12:19:59,787 INFO L226 Difference]: Without dead ends: 88 [2022-04-27 12:19:59,788 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:19:59,788 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.3s IncrementalHoareTripleChecker+Time [2022-04-27 12:19:59,788 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.3s Time] [2022-04-27 12:19:59,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2022-04-27 12:19:59,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 88. [2022-04-27 12:19:59,822 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 12:19:59,822 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:19:59,822 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:19:59,823 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:19:59,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:19:59,833 INFO L93 Difference]: Finished difference Result 88 states and 103 transitions. [2022-04-27 12:19:59,833 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 103 transitions. [2022-04-27 12:19:59,833 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 12:19:59,833 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 12:19:59,841 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:19:59,842 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:19:59,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:19:59,844 INFO L93 Difference]: Finished difference Result 88 states and 103 transitions. [2022-04-27 12:19:59,844 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 103 transitions. [2022-04-27 12:19:59,845 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 12:19:59,845 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 12:19:59,845 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 12:19:59,845 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 12:19:59,845 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:19:59,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 103 transitions. [2022-04-27 12:19:59,847 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 103 transitions. Word has length 24 [2022-04-27 12:19:59,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 12:19:59,847 INFO L495 AbstractCegarLoop]: Abstraction has 88 states and 103 transitions. [2022-04-27 12:19:59,847 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:19:59,847 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 103 transitions. [2022-04-27 12:19:59,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-04-27 12:19:59,848 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 12:19:59,848 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:19:59,883 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:20:00,048 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:20:00,049 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 12:20:00,049 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 12:20:00,049 INFO L85 PathProgramCache]: Analyzing trace with hash -1815750730, now seen corresponding path program 1 times [2022-04-27 12:20:00,049 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 12:20:00,050 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [861829827] [2022-04-27 12:20:00,050 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 12:20:00,050 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 12:20:00,063 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 12:20:00,063 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1807833688] [2022-04-27 12:20:00,064 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 12:20:00,064 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 12:20:00,064 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 12:20:00,073 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:20:00,074 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:20:00,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:20:00,159 INFO L263 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 25 conjunts are in the unsatisfiable core [2022-04-27 12:20:00,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:20:00,171 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 12:20:01,191 INFO L272 TraceCheckUtils]: 0: Hoare triple {3342#true} call ULTIMATE.init(); {3342#true} is VALID [2022-04-27 12:20:01,191 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:20:01,191 INFO L290 TraceCheckUtils]: 2: Hoare triple {3342#true} assume true; {3342#true} is VALID [2022-04-27 12:20:01,191 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3342#true} {3342#true} #82#return; {3342#true} is VALID [2022-04-27 12:20:01,192 INFO L272 TraceCheckUtils]: 4: Hoare triple {3342#true} call #t~ret4 := main(); {3342#true} is VALID [2022-04-27 12:20:01,192 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:20:01,193 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:20:01,193 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 < 10);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:20:01,194 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:20:01,194 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:20:01,195 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 < 10);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:20:01,196 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:20:01,196 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:20:01,197 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 < 10);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:20:01,197 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:20:01,197 INFO L290 TraceCheckUtils]: 15: Hoare triple {3342#true} ~cond := #in~cond; {3342#true} is VALID [2022-04-27 12:20:01,197 INFO L290 TraceCheckUtils]: 16: Hoare triple {3342#true} assume !(0 == ~cond); {3342#true} is VALID [2022-04-27 12:20:01,197 INFO L290 TraceCheckUtils]: 17: Hoare triple {3342#true} assume true; {3342#true} is VALID [2022-04-27 12:20:01,198 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:20:01,200 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:20:01,201 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:20:01,202 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:20:01,203 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 < 10);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:20:01,204 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:20:01,205 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:20:01,205 INFO L290 TraceCheckUtils]: 25: Hoare triple {3425#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {3343#false} is VALID [2022-04-27 12:20:01,205 INFO L290 TraceCheckUtils]: 26: Hoare triple {3343#false} assume !false; {3343#false} is VALID [2022-04-27 12:20:01,205 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:20:01,206 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 12:20:31,439 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:20:52,843 INFO L290 TraceCheckUtils]: 26: Hoare triple {3343#false} assume !false; {3343#false} is VALID [2022-04-27 12:20:52,843 INFO L290 TraceCheckUtils]: 25: Hoare triple {3425#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {3343#false} is VALID [2022-04-27 12:20:52,844 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:20:52,845 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:20:52,845 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 < 10);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:20:52,846 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:20:54,850 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:20:56,956 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:20:56,957 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:20:56,958 INFO L290 TraceCheckUtils]: 17: Hoare triple {3342#true} assume true; {3342#true} is VALID [2022-04-27 12:20:56,958 INFO L290 TraceCheckUtils]: 16: Hoare triple {3342#true} assume !(0 == ~cond); {3342#true} is VALID [2022-04-27 12:20:56,958 INFO L290 TraceCheckUtils]: 15: Hoare triple {3342#true} ~cond := #in~cond; {3342#true} is VALID [2022-04-27 12:20:56,958 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:20:56,958 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 < 10);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:20:56,959 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:20:56,959 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:20:56,960 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 < 10);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:20:56,960 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:20:59,094 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:20:59,096 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 < 10);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:20:59,096 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:20:59,097 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:20:59,097 INFO L272 TraceCheckUtils]: 4: Hoare triple {3342#true} call #t~ret4 := main(); {3342#true} is VALID [2022-04-27 12:20:59,097 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3342#true} {3342#true} #82#return; {3342#true} is VALID [2022-04-27 12:20:59,097 INFO L290 TraceCheckUtils]: 2: Hoare triple {3342#true} assume true; {3342#true} is VALID [2022-04-27 12:20:59,097 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:20:59,097 INFO L272 TraceCheckUtils]: 0: Hoare triple {3342#true} call ULTIMATE.init(); {3342#true} is VALID [2022-04-27 12:20:59,097 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:20:59,098 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 12:20:59,098 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [861829827] [2022-04-27 12:20:59,098 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 12:20:59,098 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1807833688] [2022-04-27 12:20:59,098 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1807833688] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 12:20:59,098 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-27 12:20:59,098 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 13 [2022-04-27 12:20:59,098 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1972280880] [2022-04-27 12:20:59,099 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-27 12:20:59,101 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:20:59,101 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 12:20:59,101 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:21:05,316 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:21:05,316 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-04-27 12:21:05,316 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 12:21:05,317 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-04-27 12:21:05,317 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=95, Unknown=2, NotChecked=20, Total=156 [2022-04-27 12:21:05,317 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:21:12,092 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:21:14,214 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:21:16,371 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:21:18,468 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.10s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-27 12:21:20,589 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.12s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-27 12:21:31,682 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:21:35,987 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:21:38,437 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:21:41,977 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.22s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-27 12:21:46,269 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:21:46,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:21:46,397 INFO L93 Difference]: Finished difference Result 129 states and 152 transitions. [2022-04-27 12:21:46,397 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-04-27 12:21:46,397 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:21:46,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 12:21:46,398 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:21:46,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 77 transitions. [2022-04-27 12:21:46,399 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:21:46,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 77 transitions. [2022-04-27 12:21:46,405 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 11 states and 77 transitions. [2022-04-27 12:21:50,656 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:21:50,658 INFO L225 Difference]: With dead ends: 129 [2022-04-27 12:21:50,658 INFO L226 Difference]: Without dead ends: 97 [2022-04-27 12:21:50,659 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 40 SyntacticMatches, 3 SemanticMatches, 13 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 13.3s TimeCoverageRelationStatistics Valid=52, Invalid=131, Unknown=3, NotChecked=24, Total=210 [2022-04-27 12:21:50,659 INFO L413 NwaCegarLoop]: 23 mSDtfsCounter, 27 mSDsluCounter, 118 mSDsCounter, 0 mSdLazyCounter, 91 mSolverCounterSat, 13 mSolverCounterUnsat, 9 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 19.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 141 SdHoareTripleChecker+Invalid, 153 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 91 IncrementalHoareTripleChecker+Invalid, 9 IncrementalHoareTripleChecker+Unknown, 40 IncrementalHoareTripleChecker+Unchecked, 20.5s IncrementalHoareTripleChecker+Time [2022-04-27 12:21:50,660 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 141 Invalid, 153 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 91 Invalid, 9 Unknown, 40 Unchecked, 20.5s Time] [2022-04-27 12:21:50,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2022-04-27 12:21:50,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 90. [2022-04-27 12:21:50,688 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 12:21:50,689 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:21:50,689 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:21:50,689 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:21:50,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:21:50,691 INFO L93 Difference]: Finished difference Result 97 states and 111 transitions. [2022-04-27 12:21:50,691 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 111 transitions. [2022-04-27 12:21:50,692 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 12:21:50,692 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 12:21:50,692 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:21:50,692 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:21:50,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:21:50,694 INFO L93 Difference]: Finished difference Result 97 states and 111 transitions. [2022-04-27 12:21:50,694 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 111 transitions. [2022-04-27 12:21:50,695 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 12:21:50,695 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 12:21:50,695 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 12:21:50,695 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 12:21:50,695 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:21:50,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 104 transitions. [2022-04-27 12:21:50,697 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 104 transitions. Word has length 27 [2022-04-27 12:21:50,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 12:21:50,697 INFO L495 AbstractCegarLoop]: Abstraction has 90 states and 104 transitions. [2022-04-27 12:21:50,697 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:21:50,697 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 104 transitions. [2022-04-27 12:21:50,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-04-27 12:21:50,698 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 12:21:50,698 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:21:50,716 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:21:50,907 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:21:50,908 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 12:21:50,908 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 12:21:50,908 INFO L85 PathProgramCache]: Analyzing trace with hash -1437710599, now seen corresponding path program 1 times [2022-04-27 12:21:50,908 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 12:21:50,908 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1769065544] [2022-04-27 12:21:50,908 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 12:21:50,908 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 12:21:50,928 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 12:21:50,928 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1377546068] [2022-04-27 12:21:50,929 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 12:21:50,929 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 12:21:50,929 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 12:21:50,939 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:21:50,940 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process