/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/dijkstra-u_unwindbound20.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-34549b5 [2022-04-07 13:02:21,857 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-07 13:02:21,859 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-07 13:02:21,890 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-07 13:02:21,890 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-07 13:02:21,891 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-07 13:02:21,893 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-07 13:02:21,895 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-07 13:02:21,897 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-07 13:02:21,898 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-07 13:02:21,899 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-07 13:02:21,900 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-07 13:02:21,900 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-07 13:02:21,900 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-07 13:02:21,901 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-07 13:02:21,901 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-07 13:02:21,902 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-07 13:02:21,902 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-07 13:02:21,903 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-07 13:02:21,904 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-07 13:02:21,905 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-07 13:02:21,909 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-07 13:02:21,910 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-07 13:02:21,911 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-07 13:02:21,912 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-07 13:02:21,917 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-07 13:02:21,917 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-07 13:02:21,917 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-07 13:02:21,918 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-07 13:02:21,918 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-07 13:02:21,918 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-07 13:02:21,918 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-07 13:02:21,919 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-07 13:02:21,919 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-07 13:02:21,920 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-07 13:02:21,920 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-07 13:02:21,920 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-07 13:02:21,921 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-07 13:02:21,921 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-07 13:02:21,921 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-07 13:02:21,921 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-07 13:02:21,926 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-07 13:02:21,926 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-07 13:02:21,949 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-07 13:02:21,949 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-07 13:02:21,949 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-04-07 13:02:21,949 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-04-07 13:02:21,950 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-04-07 13:02:21,950 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-04-07 13:02:21,951 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-04-07 13:02:21,951 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-04-07 13:02:21,951 INFO L138 SettingsManager]: * Use SBE=true [2022-04-07 13:02:21,951 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-07 13:02:21,951 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-07 13:02:21,952 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-07 13:02:21,952 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-07 13:02:21,952 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-07 13:02:21,952 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-07 13:02:21,952 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-07 13:02:21,952 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-07 13:02:21,952 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-07 13:02:21,953 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-07 13:02:21,953 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-07 13:02:21,953 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-07 13:02:21,953 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-07 13:02:21,953 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-07 13:02:21,953 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-07 13:02:21,953 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-07 13:02:21,953 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-07 13:02:21,954 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-04-07 13:02:21,954 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-04-07 13:02:21,954 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-04-07 13:02:21,954 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-04-07 13:02:21,954 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-04-07 13:02:21,954 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-04-07 13:02:21,954 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-07 13:02:21,954 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-07 13:02:22,121 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-07 13:02:22,134 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-07 13:02:22,135 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-07 13:02:22,136 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-07 13:02:22,142 INFO L275 PluginConnector]: CDTParser initialized [2022-04-07 13:02:22,144 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/nla-digbench-scaling/dijkstra-u_unwindbound20.c [2022-04-07 13:02:22,208 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f2a417145/c3ca6864eba14c40acb7952dc2657ec7/FLAG3a2b693a2 [2022-04-07 13:02:22,540 INFO L306 CDTParser]: Found 1 translation units. [2022-04-07 13:02:22,541 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/dijkstra-u_unwindbound20.c [2022-04-07 13:02:22,545 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f2a417145/c3ca6864eba14c40acb7952dc2657ec7/FLAG3a2b693a2 [2022-04-07 13:02:22,552 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f2a417145/c3ca6864eba14c40acb7952dc2657ec7 [2022-04-07 13:02:22,554 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-07 13:02:22,555 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-07 13:02:22,555 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-07 13:02:22,555 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-07 13:02:22,557 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-07 13:02:22,558 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.04 01:02:22" (1/1) ... [2022-04-07 13:02:22,559 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@270f362c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 01:02:22, skipping insertion in model container [2022-04-07 13:02:22,559 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.04 01:02:22" (1/1) ... [2022-04-07 13:02:22,563 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-07 13:02:22,572 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-07 13:02:22,693 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/dijkstra-u_unwindbound20.c[525,538] [2022-04-07 13:02:22,713 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-07 13:02:22,720 INFO L203 MainTranslator]: Completed pre-run [2022-04-07 13:02:22,729 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/dijkstra-u_unwindbound20.c[525,538] [2022-04-07 13:02:22,742 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-07 13:02:22,750 INFO L208 MainTranslator]: Completed translation [2022-04-07 13:02:22,751 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 01:02:22 WrapperNode [2022-04-07 13:02:22,751 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-07 13:02:22,751 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-07 13:02:22,751 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-07 13:02:22,752 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-07 13:02:22,758 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 01:02:22" (1/1) ... [2022-04-07 13:02:22,758 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 01:02:22" (1/1) ... [2022-04-07 13:02:22,762 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 01:02:22" (1/1) ... [2022-04-07 13:02:22,762 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 01:02:22" (1/1) ... [2022-04-07 13:02:22,767 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 01:02:22" (1/1) ... [2022-04-07 13:02:22,770 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 01:02:22" (1/1) ... [2022-04-07 13:02:22,771 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 01:02:22" (1/1) ... [2022-04-07 13:02:22,772 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-07 13:02:22,772 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-07 13:02:22,772 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-07 13:02:22,772 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-07 13:02:22,773 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 01:02:22" (1/1) ... [2022-04-07 13:02:22,778 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-07 13:02:22,785 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 13:02:22,793 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-07 13:02:22,799 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-07 13:02:22,817 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-07 13:02:22,817 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-07 13:02:22,817 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-07 13:02:22,817 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-07 13:02:22,817 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-07 13:02:22,817 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-07 13:02:22,817 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-07 13:02:22,818 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-07 13:02:22,818 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-07 13:02:22,818 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-07 13:02:22,818 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uint [2022-04-07 13:02:22,818 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-07 13:02:22,818 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-07 13:02:22,818 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-07 13:02:22,818 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-07 13:02:22,818 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-07 13:02:22,818 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-07 13:02:22,818 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-07 13:02:22,818 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-07 13:02:22,818 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-07 13:02:22,857 INFO L234 CfgBuilder]: Building ICFG [2022-04-07 13:02:22,858 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-07 13:02:23,029 INFO L275 CfgBuilder]: Performing block encoding [2022-04-07 13:02:23,042 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-07 13:02:23,042 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-04-07 13:02:23,043 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.04 01:02:23 BoogieIcfgContainer [2022-04-07 13:02:23,043 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-07 13:02:23,044 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-07 13:02:23,044 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-07 13:02:23,053 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-07 13:02:23,053 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.04 01:02:22" (1/3) ... [2022-04-07 13:02:23,054 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@38eb1299 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.04 01:02:23, skipping insertion in model container [2022-04-07 13:02:23,054 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 01:02:22" (2/3) ... [2022-04-07 13:02:23,054 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@38eb1299 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.04 01:02:23, skipping insertion in model container [2022-04-07 13:02:23,054 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.04 01:02:23" (3/3) ... [2022-04-07 13:02:23,055 INFO L111 eAbstractionObserver]: Analyzing ICFG dijkstra-u_unwindbound20.c [2022-04-07 13:02:23,058 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-04-07 13:02:23,058 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-07 13:02:23,097 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-07 13:02:23,104 INFO L340 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 [2022-04-07 13:02:23,104 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-07 13:02:23,127 INFO L276 IsEmpty]: Start isEmpty. Operand has 39 states, 21 states have (on average 1.4761904761904763) internal successors, (31), 22 states have internal predecessors, (31), 12 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-07 13:02:23,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-04-07 13:02:23,132 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 13:02:23,132 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 13:02:23,133 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 13:02:23,139 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 13:02:23,139 INFO L85 PathProgramCache]: Analyzing trace with hash -2024343623, now seen corresponding path program 1 times [2022-04-07 13:02:23,146 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 13:02:23,146 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1887511035] [2022-04-07 13:02:23,146 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 13:02:23,147 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 13:02:23,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 13:02:23,301 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 13:02:23,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 13:02:23,317 INFO L290 TraceCheckUtils]: 0: Hoare triple {51#(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(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {42#true} is VALID [2022-04-07 13:02:23,317 INFO L290 TraceCheckUtils]: 1: Hoare triple {42#true} assume true; {42#true} is VALID [2022-04-07 13:02:23,318 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {42#true} {42#true} #102#return; {42#true} is VALID [2022-04-07 13:02:23,318 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-07 13:02:23,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 13:02:23,332 INFO L290 TraceCheckUtils]: 0: Hoare triple {42#true} ~cond := #in~cond; {42#true} is VALID [2022-04-07 13:02:23,333 INFO L290 TraceCheckUtils]: 1: Hoare triple {42#true} assume 0 == ~cond;assume false; {43#false} is VALID [2022-04-07 13:02:23,333 INFO L290 TraceCheckUtils]: 2: Hoare triple {43#false} assume true; {43#false} is VALID [2022-04-07 13:02:23,333 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {43#false} {42#true} #82#return; {43#false} is VALID [2022-04-07 13:02:23,335 INFO L272 TraceCheckUtils]: 0: Hoare triple {42#true} call ULTIMATE.init(); {51#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-07 13:02:23,335 INFO L290 TraceCheckUtils]: 1: Hoare triple {51#(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(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {42#true} is VALID [2022-04-07 13:02:23,335 INFO L290 TraceCheckUtils]: 2: Hoare triple {42#true} assume true; {42#true} is VALID [2022-04-07 13:02:23,335 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {42#true} {42#true} #102#return; {42#true} is VALID [2022-04-07 13:02:23,336 INFO L272 TraceCheckUtils]: 4: Hoare triple {42#true} call #t~ret7 := main(); {42#true} is VALID [2022-04-07 13:02:23,336 INFO L290 TraceCheckUtils]: 5: Hoare triple {42#true} havoc ~n~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~h~0;~n~0 := #t~nondet4;havoc #t~nondet4; {42#true} is VALID [2022-04-07 13:02:23,336 INFO L272 TraceCheckUtils]: 6: Hoare triple {42#true} call assume_abort_if_not((if ~n~0 % 4294967296 < 1073741823 then 1 else 0)); {42#true} is VALID [2022-04-07 13:02:23,336 INFO L290 TraceCheckUtils]: 7: Hoare triple {42#true} ~cond := #in~cond; {42#true} is VALID [2022-04-07 13:02:23,336 INFO L290 TraceCheckUtils]: 8: Hoare triple {42#true} assume 0 == ~cond;assume false; {43#false} is VALID [2022-04-07 13:02:23,337 INFO L290 TraceCheckUtils]: 9: Hoare triple {43#false} assume true; {43#false} is VALID [2022-04-07 13:02:23,337 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {43#false} {42#true} #82#return; {43#false} is VALID [2022-04-07 13:02:23,337 INFO L290 TraceCheckUtils]: 11: Hoare triple {43#false} ~p~0 := 0;~q~0 := 1;~r~0 := ~n~0;~h~0 := 0; {43#false} is VALID [2022-04-07 13:02:23,337 INFO L290 TraceCheckUtils]: 12: Hoare triple {43#false} assume !true; {43#false} is VALID [2022-04-07 13:02:23,337 INFO L290 TraceCheckUtils]: 13: Hoare triple {43#false} assume !true; {43#false} is VALID [2022-04-07 13:02:23,337 INFO L272 TraceCheckUtils]: 14: Hoare triple {43#false} call __VERIFIER_assert((if 0 == (~h~0 * ~h~0 * ~h~0 - 12 * ~h~0 * ~n~0 + 16 * ~n~0 * ~p~0 + 12 * ~h~0 * ~r~0 - 16 * ~p~0 * ~r~0 - ~h~0 - 4 * ~p~0) % 4294967296 then 1 else 0)); {43#false} is VALID [2022-04-07 13:02:23,338 INFO L290 TraceCheckUtils]: 15: Hoare triple {43#false} ~cond := #in~cond; {43#false} is VALID [2022-04-07 13:02:23,338 INFO L290 TraceCheckUtils]: 16: Hoare triple {43#false} assume 0 == ~cond; {43#false} is VALID [2022-04-07 13:02:23,338 INFO L290 TraceCheckUtils]: 17: Hoare triple {43#false} assume !false; {43#false} is VALID [2022-04-07 13:02:23,338 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-07 13:02:23,339 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 13:02:23,339 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1887511035] [2022-04-07 13:02:23,339 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1887511035] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 13:02:23,339 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 13:02:23,339 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-07 13:02:23,343 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1536729548] [2022-04-07 13:02:23,344 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 13:02:23,347 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (4), 3 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-07 13:02:23,349 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 13:02:23,351 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (4), 3 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-07 13:02:23,372 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-07 13:02:23,372 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-07 13:02:23,373 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 13:02:23,386 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-07 13:02:23,386 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-07 13:02:23,388 INFO L87 Difference]: Start difference. First operand has 39 states, 21 states have (on average 1.4761904761904763) internal successors, (31), 22 states have internal predecessors, (31), 12 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (4), 3 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-07 13:02:27,644 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-07 13:02:27,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 13:02:27,717 INFO L93 Difference]: Finished difference Result 70 states and 111 transitions. [2022-04-07 13:02:27,717 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-07 13:02:27,717 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (4), 3 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-07 13:02:27,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 13:02:27,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (4), 3 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-07 13:02:27,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 111 transitions. [2022-04-07 13:02:27,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (4), 3 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-07 13:02:27,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 111 transitions. [2022-04-07 13:02:27,742 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 111 transitions. [2022-04-07 13:02:27,901 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 111 edges. 111 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 13:02:27,913 INFO L225 Difference]: With dead ends: 70 [2022-04-07 13:02:27,913 INFO L226 Difference]: Without dead ends: 35 [2022-04-07 13:02:27,916 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 6 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-07 13:02:27,920 INFO L913 BasicCegarLoop]: 49 mSDtfsCounter, 10 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 11 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 53 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2022-04-07 13:02:27,921 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [11 Valid, 53 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 25 Invalid, 1 Unknown, 0 Unchecked, 2.1s Time] [2022-04-07 13:02:27,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2022-04-07 13:02:27,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 34. [2022-04-07 13:02:27,958 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 13:02:27,960 INFO L82 GeneralOperation]: Start isEquivalent. First operand 35 states. Second operand has 34 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 19 states have internal predecessors, (24), 12 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-07 13:02:27,960 INFO L74 IsIncluded]: Start isIncluded. First operand 35 states. Second operand has 34 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 19 states have internal predecessors, (24), 12 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-07 13:02:27,961 INFO L87 Difference]: Start difference. First operand 35 states. Second operand has 34 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 19 states have internal predecessors, (24), 12 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-07 13:02:27,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 13:02:27,984 INFO L93 Difference]: Finished difference Result 35 states and 47 transitions. [2022-04-07 13:02:27,984 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 47 transitions. [2022-04-07 13:02:27,985 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 13:02:27,985 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 13:02:27,986 INFO L74 IsIncluded]: Start isIncluded. First operand has 34 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 19 states have internal predecessors, (24), 12 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand 35 states. [2022-04-07 13:02:27,986 INFO L87 Difference]: Start difference. First operand has 34 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 19 states have internal predecessors, (24), 12 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand 35 states. [2022-04-07 13:02:27,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 13:02:27,989 INFO L93 Difference]: Finished difference Result 35 states and 47 transitions. [2022-04-07 13:02:27,989 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 47 transitions. [2022-04-07 13:02:27,990 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 13:02:27,990 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 13:02:27,990 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 13:02:27,990 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 13:02:27,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 19 states have internal predecessors, (24), 12 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-07 13:02:27,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 46 transitions. [2022-04-07 13:02:27,997 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 46 transitions. Word has length 18 [2022-04-07 13:02:27,998 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 13:02:27,998 INFO L478 AbstractCegarLoop]: Abstraction has 34 states and 46 transitions. [2022-04-07 13:02:27,998 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (4), 3 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-07 13:02:27,998 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 46 transitions. [2022-04-07 13:02:27,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-04-07 13:02:27,999 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 13:02:27,999 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 13:02:27,999 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-07 13:02:28,000 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 13:02:28,000 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 13:02:28,001 INFO L85 PathProgramCache]: Analyzing trace with hash -96361696, now seen corresponding path program 1 times [2022-04-07 13:02:28,001 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 13:02:28,001 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1359298131] [2022-04-07 13:02:28,001 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 13:02:28,001 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 13:02:28,025 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-07 13:02:28,026 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [624016909] [2022-04-07 13:02:28,026 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 13:02:28,026 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 13:02:28,026 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 13:02:28,032 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-07 13:02:28,067 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-07 13:02:28,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 13:02:28,089 INFO L263 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 5 conjunts are in the unsatisfiable core [2022-04-07 13:02:28,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 13:02:28,117 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-07 13:02:28,250 INFO L272 TraceCheckUtils]: 0: Hoare triple {274#true} call ULTIMATE.init(); {274#true} is VALID [2022-04-07 13:02:28,252 INFO L290 TraceCheckUtils]: 1: Hoare triple {274#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {282#(<= ~counter~0 0)} is VALID [2022-04-07 13:02:28,252 INFO L290 TraceCheckUtils]: 2: Hoare triple {282#(<= ~counter~0 0)} assume true; {282#(<= ~counter~0 0)} is VALID [2022-04-07 13:02:28,253 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {282#(<= ~counter~0 0)} {274#true} #102#return; {282#(<= ~counter~0 0)} is VALID [2022-04-07 13:02:28,254 INFO L272 TraceCheckUtils]: 4: Hoare triple {282#(<= ~counter~0 0)} call #t~ret7 := main(); {282#(<= ~counter~0 0)} is VALID [2022-04-07 13:02:28,254 INFO L290 TraceCheckUtils]: 5: Hoare triple {282#(<= ~counter~0 0)} havoc ~n~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~h~0;~n~0 := #t~nondet4;havoc #t~nondet4; {282#(<= ~counter~0 0)} is VALID [2022-04-07 13:02:28,255 INFO L272 TraceCheckUtils]: 6: Hoare triple {282#(<= ~counter~0 0)} call assume_abort_if_not((if ~n~0 % 4294967296 < 1073741823 then 1 else 0)); {282#(<= ~counter~0 0)} is VALID [2022-04-07 13:02:28,255 INFO L290 TraceCheckUtils]: 7: Hoare triple {282#(<= ~counter~0 0)} ~cond := #in~cond; {282#(<= ~counter~0 0)} is VALID [2022-04-07 13:02:28,255 INFO L290 TraceCheckUtils]: 8: Hoare triple {282#(<= ~counter~0 0)} assume !(0 == ~cond); {282#(<= ~counter~0 0)} is VALID [2022-04-07 13:02:28,256 INFO L290 TraceCheckUtils]: 9: Hoare triple {282#(<= ~counter~0 0)} assume true; {282#(<= ~counter~0 0)} is VALID [2022-04-07 13:02:28,256 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {282#(<= ~counter~0 0)} {282#(<= ~counter~0 0)} #82#return; {282#(<= ~counter~0 0)} is VALID [2022-04-07 13:02:28,257 INFO L290 TraceCheckUtils]: 11: Hoare triple {282#(<= ~counter~0 0)} ~p~0 := 0;~q~0 := 1;~r~0 := ~n~0;~h~0 := 0; {282#(<= ~counter~0 0)} is VALID [2022-04-07 13:02:28,258 INFO L290 TraceCheckUtils]: 12: Hoare triple {282#(<= ~counter~0 0)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {316#(<= |main_#t~post5| 0)} is VALID [2022-04-07 13:02:28,259 INFO L290 TraceCheckUtils]: 13: Hoare triple {316#(<= |main_#t~post5| 0)} assume !(#t~post5 < 20);havoc #t~post5; {275#false} is VALID [2022-04-07 13:02:28,259 INFO L290 TraceCheckUtils]: 14: Hoare triple {275#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {275#false} is VALID [2022-04-07 13:02:28,259 INFO L290 TraceCheckUtils]: 15: Hoare triple {275#false} assume !(#t~post6 < 20);havoc #t~post6; {275#false} is VALID [2022-04-07 13:02:28,259 INFO L272 TraceCheckUtils]: 16: Hoare triple {275#false} call __VERIFIER_assert((if 0 == (~h~0 * ~h~0 * ~h~0 - 12 * ~h~0 * ~n~0 + 16 * ~n~0 * ~p~0 + 12 * ~h~0 * ~r~0 - 16 * ~p~0 * ~r~0 - ~h~0 - 4 * ~p~0) % 4294967296 then 1 else 0)); {275#false} is VALID [2022-04-07 13:02:28,259 INFO L290 TraceCheckUtils]: 17: Hoare triple {275#false} ~cond := #in~cond; {275#false} is VALID [2022-04-07 13:02:28,260 INFO L290 TraceCheckUtils]: 18: Hoare triple {275#false} assume 0 == ~cond; {275#false} is VALID [2022-04-07 13:02:28,260 INFO L290 TraceCheckUtils]: 19: Hoare triple {275#false} assume !false; {275#false} is VALID [2022-04-07 13:02:28,260 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-07 13:02:28,261 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-07 13:02:28,261 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 13:02:28,261 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1359298131] [2022-04-07 13:02:28,261 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-07 13:02:28,264 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [624016909] [2022-04-07 13:02:28,264 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [624016909] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 13:02:28,265 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 13:02:28,265 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-07 13:02:28,265 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1018294497] [2022-04-07 13:02:28,267 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 13:02:28,268 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 20 [2022-04-07 13:02:28,268 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 13:02:28,268 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-07 13:02:28,284 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 13:02:28,285 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-07 13:02:28,285 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 13:02:28,285 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-07 13:02:28,285 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-07 13:02:28,286 INFO L87 Difference]: Start difference. First operand 34 states and 46 transitions. Second operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-07 13:02:31,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 13:02:31,036 INFO L93 Difference]: Finished difference Result 55 states and 78 transitions. [2022-04-07 13:02:31,037 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-07 13:02:31,037 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 20 [2022-04-07 13:02:31,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 13:02:31,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-07 13:02:31,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 78 transitions. [2022-04-07 13:02:31,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-07 13:02:31,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 78 transitions. [2022-04-07 13:02:31,047 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 78 transitions. [2022-04-07 13:02:31,126 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 78 edges. 78 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 13:02:31,127 INFO L225 Difference]: With dead ends: 55 [2022-04-07 13:02:31,127 INFO L226 Difference]: Without dead ends: 36 [2022-04-07 13:02:31,128 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-07 13:02:31,129 INFO L913 BasicCegarLoop]: 44 mSDtfsCounter, 0 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 119 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-07 13:02:31,129 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 119 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-07 13:02:31,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2022-04-07 13:02:31,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2022-04-07 13:02:31,136 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 13:02:31,137 INFO L82 GeneralOperation]: Start isEquivalent. First operand 36 states. Second operand has 36 states, 20 states have (on average 1.3) internal successors, (26), 21 states have internal predecessors, (26), 12 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-07 13:02:31,137 INFO L74 IsIncluded]: Start isIncluded. First operand 36 states. Second operand has 36 states, 20 states have (on average 1.3) internal successors, (26), 21 states have internal predecessors, (26), 12 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-07 13:02:31,137 INFO L87 Difference]: Start difference. First operand 36 states. Second operand has 36 states, 20 states have (on average 1.3) internal successors, (26), 21 states have internal predecessors, (26), 12 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-07 13:02:31,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 13:02:31,141 INFO L93 Difference]: Finished difference Result 36 states and 48 transitions. [2022-04-07 13:02:31,141 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 48 transitions. [2022-04-07 13:02:31,142 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 13:02:31,142 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 13:02:31,142 INFO L74 IsIncluded]: Start isIncluded. First operand has 36 states, 20 states have (on average 1.3) internal successors, (26), 21 states have internal predecessors, (26), 12 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand 36 states. [2022-04-07 13:02:31,143 INFO L87 Difference]: Start difference. First operand has 36 states, 20 states have (on average 1.3) internal successors, (26), 21 states have internal predecessors, (26), 12 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand 36 states. [2022-04-07 13:02:31,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 13:02:31,145 INFO L93 Difference]: Finished difference Result 36 states and 48 transitions. [2022-04-07 13:02:31,145 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 48 transitions. [2022-04-07 13:02:31,145 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 13:02:31,145 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 13:02:31,145 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 13:02:31,146 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 13:02:31,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 20 states have (on average 1.3) internal successors, (26), 21 states have internal predecessors, (26), 12 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-07 13:02:31,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 48 transitions. [2022-04-07 13:02:31,148 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 48 transitions. Word has length 20 [2022-04-07 13:02:31,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 13:02:31,148 INFO L478 AbstractCegarLoop]: Abstraction has 36 states and 48 transitions. [2022-04-07 13:02:31,149 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-07 13:02:31,149 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 48 transitions. [2022-04-07 13:02:31,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-04-07 13:02:31,150 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 13:02:31,150 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 13:02:31,168 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-07 13:02:31,359 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 13:02:31,360 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 13:02:31,360 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 13:02:31,360 INFO L85 PathProgramCache]: Analyzing trace with hash 962099791, now seen corresponding path program 1 times [2022-04-07 13:02:31,360 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 13:02:31,361 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1071929209] [2022-04-07 13:02:31,361 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 13:02:31,361 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 13:02:31,375 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-07 13:02:31,375 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [49558912] [2022-04-07 13:02:31,375 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 13:02:31,375 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 13:02:31,375 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 13:02:31,383 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-07 13:02:31,384 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-07 13:02:31,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 13:02:31,427 INFO L263 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-07 13:02:31,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 13:02:31,435 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-07 13:02:31,575 INFO L272 TraceCheckUtils]: 0: Hoare triple {546#true} call ULTIMATE.init(); {546#true} is VALID [2022-04-07 13:02:31,576 INFO L290 TraceCheckUtils]: 1: Hoare triple {546#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {554#(<= ~counter~0 0)} is VALID [2022-04-07 13:02:31,577 INFO L290 TraceCheckUtils]: 2: Hoare triple {554#(<= ~counter~0 0)} assume true; {554#(<= ~counter~0 0)} is VALID [2022-04-07 13:02:31,577 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {554#(<= ~counter~0 0)} {546#true} #102#return; {554#(<= ~counter~0 0)} is VALID [2022-04-07 13:02:31,577 INFO L272 TraceCheckUtils]: 4: Hoare triple {554#(<= ~counter~0 0)} call #t~ret7 := main(); {554#(<= ~counter~0 0)} is VALID [2022-04-07 13:02:31,580 INFO L290 TraceCheckUtils]: 5: Hoare triple {554#(<= ~counter~0 0)} havoc ~n~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~h~0;~n~0 := #t~nondet4;havoc #t~nondet4; {554#(<= ~counter~0 0)} is VALID [2022-04-07 13:02:31,581 INFO L272 TraceCheckUtils]: 6: Hoare triple {554#(<= ~counter~0 0)} call assume_abort_if_not((if ~n~0 % 4294967296 < 1073741823 then 1 else 0)); {554#(<= ~counter~0 0)} is VALID [2022-04-07 13:02:31,581 INFO L290 TraceCheckUtils]: 7: Hoare triple {554#(<= ~counter~0 0)} ~cond := #in~cond; {554#(<= ~counter~0 0)} is VALID [2022-04-07 13:02:31,582 INFO L290 TraceCheckUtils]: 8: Hoare triple {554#(<= ~counter~0 0)} assume !(0 == ~cond); {554#(<= ~counter~0 0)} is VALID [2022-04-07 13:02:31,582 INFO L290 TraceCheckUtils]: 9: Hoare triple {554#(<= ~counter~0 0)} assume true; {554#(<= ~counter~0 0)} is VALID [2022-04-07 13:02:31,583 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {554#(<= ~counter~0 0)} {554#(<= ~counter~0 0)} #82#return; {554#(<= ~counter~0 0)} is VALID [2022-04-07 13:02:31,583 INFO L290 TraceCheckUtils]: 11: Hoare triple {554#(<= ~counter~0 0)} ~p~0 := 0;~q~0 := 1;~r~0 := ~n~0;~h~0 := 0; {554#(<= ~counter~0 0)} is VALID [2022-04-07 13:02:31,584 INFO L290 TraceCheckUtils]: 12: Hoare triple {554#(<= ~counter~0 0)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {588#(<= ~counter~0 1)} is VALID [2022-04-07 13:02:31,584 INFO L290 TraceCheckUtils]: 13: Hoare triple {588#(<= ~counter~0 1)} assume !!(#t~post5 < 20);havoc #t~post5; {588#(<= ~counter~0 1)} is VALID [2022-04-07 13:02:31,586 INFO L290 TraceCheckUtils]: 14: Hoare triple {588#(<= ~counter~0 1)} assume !(~q~0 % 4294967296 <= ~n~0 % 4294967296); {588#(<= ~counter~0 1)} is VALID [2022-04-07 13:02:31,586 INFO L290 TraceCheckUtils]: 15: Hoare triple {588#(<= ~counter~0 1)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {598#(<= |main_#t~post6| 1)} is VALID [2022-04-07 13:02:31,587 INFO L290 TraceCheckUtils]: 16: Hoare triple {598#(<= |main_#t~post6| 1)} assume !(#t~post6 < 20);havoc #t~post6; {547#false} is VALID [2022-04-07 13:02:31,587 INFO L272 TraceCheckUtils]: 17: Hoare triple {547#false} call __VERIFIER_assert((if 0 == (~h~0 * ~h~0 * ~h~0 - 12 * ~h~0 * ~n~0 + 16 * ~n~0 * ~p~0 + 12 * ~h~0 * ~r~0 - 16 * ~p~0 * ~r~0 - ~h~0 - 4 * ~p~0) % 4294967296 then 1 else 0)); {547#false} is VALID [2022-04-07 13:02:31,587 INFO L290 TraceCheckUtils]: 18: Hoare triple {547#false} ~cond := #in~cond; {547#false} is VALID [2022-04-07 13:02:31,587 INFO L290 TraceCheckUtils]: 19: Hoare triple {547#false} assume 0 == ~cond; {547#false} is VALID [2022-04-07 13:02:31,587 INFO L290 TraceCheckUtils]: 20: Hoare triple {547#false} assume !false; {547#false} is VALID [2022-04-07 13:02:31,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-07 13:02:31,588 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-07 13:02:31,588 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 13:02:31,588 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1071929209] [2022-04-07 13:02:31,588 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-07 13:02:31,588 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [49558912] [2022-04-07 13:02:31,588 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [49558912] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 13:02:31,588 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 13:02:31,588 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-07 13:02:31,588 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [262100685] [2022-04-07 13:02:31,588 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 13:02:31,589 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 21 [2022-04-07 13:02:31,589 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 13:02:31,589 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-07 13:02:31,602 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 21 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 13:02:31,603 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-07 13:02:31,603 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 13:02:31,603 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-07 13:02:31,603 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-04-07 13:02:31,604 INFO L87 Difference]: Start difference. First operand 36 states and 48 transitions. Second operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-07 13:02:39,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 13:02:39,006 INFO L93 Difference]: Finished difference Result 49 states and 64 transitions. [2022-04-07 13:02:39,006 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-07 13:02:39,006 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 21 [2022-04-07 13:02:39,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 13:02:39,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-07 13:02:39,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 64 transitions. [2022-04-07 13:02:39,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-07 13:02:39,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 64 transitions. [2022-04-07 13:02:39,009 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 64 transitions. [2022-04-07 13:02:39,070 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 64 edges. 64 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 13:02:39,071 INFO L225 Difference]: With dead ends: 49 [2022-04-07 13:02:39,071 INFO L226 Difference]: Without dead ends: 40 [2022-04-07 13:02:39,071 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 17 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-07 13:02:39,072 INFO L913 BasicCegarLoop]: 43 mSDtfsCounter, 7 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 120 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-07 13:02:39,072 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [7 Valid, 120 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-07 13:02:39,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2022-04-07 13:02:39,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 39. [2022-04-07 13:02:39,078 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 13:02:39,079 INFO L82 GeneralOperation]: Start isEquivalent. First operand 40 states. Second operand has 39 states, 23 states have (on average 1.3043478260869565) internal successors, (30), 24 states have internal predecessors, (30), 12 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-07 13:02:39,079 INFO L74 IsIncluded]: Start isIncluded. First operand 40 states. Second operand has 39 states, 23 states have (on average 1.3043478260869565) internal successors, (30), 24 states have internal predecessors, (30), 12 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-07 13:02:39,079 INFO L87 Difference]: Start difference. First operand 40 states. Second operand has 39 states, 23 states have (on average 1.3043478260869565) internal successors, (30), 24 states have internal predecessors, (30), 12 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-07 13:02:39,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 13:02:39,081 INFO L93 Difference]: Finished difference Result 40 states and 53 transitions. [2022-04-07 13:02:39,081 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 53 transitions. [2022-04-07 13:02:39,082 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 13:02:39,082 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 13:02:39,082 INFO L74 IsIncluded]: Start isIncluded. First operand has 39 states, 23 states have (on average 1.3043478260869565) internal successors, (30), 24 states have internal predecessors, (30), 12 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand 40 states. [2022-04-07 13:02:39,082 INFO L87 Difference]: Start difference. First operand has 39 states, 23 states have (on average 1.3043478260869565) internal successors, (30), 24 states have internal predecessors, (30), 12 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand 40 states. [2022-04-07 13:02:39,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 13:02:39,084 INFO L93 Difference]: Finished difference Result 40 states and 53 transitions. [2022-04-07 13:02:39,084 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 53 transitions. [2022-04-07 13:02:39,085 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 13:02:39,085 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 13:02:39,085 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 13:02:39,085 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 13:02:39,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 23 states have (on average 1.3043478260869565) internal successors, (30), 24 states have internal predecessors, (30), 12 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-07 13:02:39,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 52 transitions. [2022-04-07 13:02:39,087 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 52 transitions. Word has length 21 [2022-04-07 13:02:39,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 13:02:39,087 INFO L478 AbstractCegarLoop]: Abstraction has 39 states and 52 transitions. [2022-04-07 13:02:39,087 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-07 13:02:39,087 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 52 transitions. [2022-04-07 13:02:39,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-04-07 13:02:39,087 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 13:02:39,087 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 13:02:39,105 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-07 13:02:39,299 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2022-04-07 13:02:39,300 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 13:02:39,300 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 13:02:39,300 INFO L85 PathProgramCache]: Analyzing trace with hash 963589341, now seen corresponding path program 1 times [2022-04-07 13:02:39,300 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 13:02:39,300 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [148557790] [2022-04-07 13:02:39,300 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 13:02:39,300 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 13:02:39,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 13:02:39,477 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 13:02:39,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 13:02:39,488 INFO L290 TraceCheckUtils]: 0: Hoare triple {835#(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(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {822#true} is VALID [2022-04-07 13:02:39,489 INFO L290 TraceCheckUtils]: 1: Hoare triple {822#true} assume true; {822#true} is VALID [2022-04-07 13:02:39,489 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {822#true} {822#true} #102#return; {822#true} is VALID [2022-04-07 13:02:39,489 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-07 13:02:39,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 13:02:39,496 INFO L290 TraceCheckUtils]: 0: Hoare triple {822#true} ~cond := #in~cond; {822#true} is VALID [2022-04-07 13:02:39,496 INFO L290 TraceCheckUtils]: 1: Hoare triple {822#true} assume !(0 == ~cond); {822#true} is VALID [2022-04-07 13:02:39,496 INFO L290 TraceCheckUtils]: 2: Hoare triple {822#true} assume true; {822#true} is VALID [2022-04-07 13:02:39,496 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {822#true} {822#true} #82#return; {822#true} is VALID [2022-04-07 13:02:39,497 INFO L272 TraceCheckUtils]: 0: Hoare triple {822#true} call ULTIMATE.init(); {835#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-07 13:02:39,497 INFO L290 TraceCheckUtils]: 1: Hoare triple {835#(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(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {822#true} is VALID [2022-04-07 13:02:39,497 INFO L290 TraceCheckUtils]: 2: Hoare triple {822#true} assume true; {822#true} is VALID [2022-04-07 13:02:39,497 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {822#true} {822#true} #102#return; {822#true} is VALID [2022-04-07 13:02:39,497 INFO L272 TraceCheckUtils]: 4: Hoare triple {822#true} call #t~ret7 := main(); {822#true} is VALID [2022-04-07 13:02:39,498 INFO L290 TraceCheckUtils]: 5: Hoare triple {822#true} havoc ~n~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~h~0;~n~0 := #t~nondet4;havoc #t~nondet4; {822#true} is VALID [2022-04-07 13:02:39,498 INFO L272 TraceCheckUtils]: 6: Hoare triple {822#true} call assume_abort_if_not((if ~n~0 % 4294967296 < 1073741823 then 1 else 0)); {822#true} is VALID [2022-04-07 13:02:39,499 INFO L290 TraceCheckUtils]: 7: Hoare triple {822#true} ~cond := #in~cond; {822#true} is VALID [2022-04-07 13:02:39,499 INFO L290 TraceCheckUtils]: 8: Hoare triple {822#true} assume !(0 == ~cond); {822#true} is VALID [2022-04-07 13:02:39,503 INFO L290 TraceCheckUtils]: 9: Hoare triple {822#true} assume true; {822#true} is VALID [2022-04-07 13:02:39,504 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {822#true} {822#true} #82#return; {822#true} is VALID [2022-04-07 13:02:39,505 INFO L290 TraceCheckUtils]: 11: Hoare triple {822#true} ~p~0 := 0;~q~0 := 1;~r~0 := ~n~0;~h~0 := 0; {831#(and (= main_~p~0 0) (= main_~n~0 main_~r~0) (= main_~q~0 1))} is VALID [2022-04-07 13:02:39,505 INFO L290 TraceCheckUtils]: 12: Hoare triple {831#(and (= main_~p~0 0) (= main_~n~0 main_~r~0) (= main_~q~0 1))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {831#(and (= main_~p~0 0) (= main_~n~0 main_~r~0) (= main_~q~0 1))} is VALID [2022-04-07 13:02:39,506 INFO L290 TraceCheckUtils]: 13: Hoare triple {831#(and (= main_~p~0 0) (= main_~n~0 main_~r~0) (= main_~q~0 1))} assume !!(#t~post5 < 20);havoc #t~post5; {831#(and (= main_~p~0 0) (= main_~n~0 main_~r~0) (= main_~q~0 1))} is VALID [2022-04-07 13:02:39,507 INFO L290 TraceCheckUtils]: 14: Hoare triple {831#(and (= main_~p~0 0) (= main_~n~0 main_~r~0) (= main_~q~0 1))} assume !(~q~0 % 4294967296 <= ~n~0 % 4294967296); {832#(and (<= (+ (* (div (+ (* main_~p~0 2) main_~q~0) 4294967296) 4294967296) main_~r~0 1) (+ main_~q~0 (* (div main_~r~0 4294967296) 4294967296))) (= main_~p~0 0) (= (+ (- 1) main_~q~0) 0))} is VALID [2022-04-07 13:02:39,507 INFO L290 TraceCheckUtils]: 15: Hoare triple {832#(and (<= (+ (* (div (+ (* main_~p~0 2) main_~q~0) 4294967296) 4294967296) main_~r~0 1) (+ main_~q~0 (* (div main_~r~0 4294967296) 4294967296))) (= main_~p~0 0) (= (+ (- 1) main_~q~0) 0))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {832#(and (<= (+ (* (div (+ (* main_~p~0 2) main_~q~0) 4294967296) 4294967296) main_~r~0 1) (+ main_~q~0 (* (div main_~r~0 4294967296) 4294967296))) (= main_~p~0 0) (= (+ (- 1) main_~q~0) 0))} is VALID [2022-04-07 13:02:39,508 INFO L290 TraceCheckUtils]: 16: Hoare triple {832#(and (<= (+ (* (div (+ (* main_~p~0 2) main_~q~0) 4294967296) 4294967296) main_~r~0 1) (+ main_~q~0 (* (div main_~r~0 4294967296) 4294967296))) (= main_~p~0 0) (= (+ (- 1) main_~q~0) 0))} assume !!(#t~post6 < 20);havoc #t~post6; {832#(and (<= (+ (* (div (+ (* main_~p~0 2) main_~q~0) 4294967296) 4294967296) main_~r~0 1) (+ main_~q~0 (* (div main_~r~0 4294967296) 4294967296))) (= main_~p~0 0) (= (+ (- 1) main_~q~0) 0))} is VALID [2022-04-07 13:02:39,509 INFO L272 TraceCheckUtils]: 17: Hoare triple {832#(and (<= (+ (* (div (+ (* main_~p~0 2) main_~q~0) 4294967296) 4294967296) main_~r~0 1) (+ main_~q~0 (* (div main_~r~0 4294967296) 4294967296))) (= main_~p~0 0) (= (+ (- 1) main_~q~0) 0))} call __VERIFIER_assert((if ~r~0 % 4294967296 < (2 * ~p~0 + ~q~0) % 4294967296 then 1 else 0)); {833#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-07 13:02:39,509 INFO L290 TraceCheckUtils]: 18: Hoare triple {833#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {834#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-07 13:02:39,510 INFO L290 TraceCheckUtils]: 19: Hoare triple {834#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {823#false} is VALID [2022-04-07 13:02:39,510 INFO L290 TraceCheckUtils]: 20: Hoare triple {823#false} assume !false; {823#false} is VALID [2022-04-07 13:02:39,511 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-07 13:02:39,511 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 13:02:39,512 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [148557790] [2022-04-07 13:02:39,514 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [148557790] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 13:02:39,515 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 13:02:39,515 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-07 13:02:39,515 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1557729056] [2022-04-07 13:02:39,515 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 13:02:39,515 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 5 states have internal predecessors, (15), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 21 [2022-04-07 13:02:39,516 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 13:02:39,516 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 5 states have internal predecessors, (15), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-07 13:02:39,535 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 21 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 13:02:39,535 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-07 13:02:39,535 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 13:02:39,536 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-07 13:02:39,537 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-04-07 13:02:39,537 INFO L87 Difference]: Start difference. First operand 39 states and 52 transitions. Second operand has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 5 states have internal predecessors, (15), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-07 13:02:49,961 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-07 13:02:52,014 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.32s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-07 13:02:54,036 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-07 13:02:56,041 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-07 13:03:00,378 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-07 13:03:04,547 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.98s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-07 13:03:07,450 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-07 13:03:09,458 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-07 13:03:11,462 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-07 13:03:13,471 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-07 13:03:13,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 13:03:13,525 INFO L93 Difference]: Finished difference Result 72 states and 104 transitions. [2022-04-07 13:03:13,526 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-07 13:03:13,526 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 5 states have internal predecessors, (15), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 21 [2022-04-07 13:03:13,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 13:03:13,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 5 states have internal predecessors, (15), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-07 13:03:13,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 104 transitions. [2022-04-07 13:03:13,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 5 states have internal predecessors, (15), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-07 13:03:13,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 104 transitions. [2022-04-07 13:03:13,530 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 104 transitions. [2022-04-07 13:03:13,641 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 104 edges. 104 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 13:03:13,643 INFO L225 Difference]: With dead ends: 72 [2022-04-07 13:03:13,643 INFO L226 Difference]: Without dead ends: 51 [2022-04-07 13:03:13,643 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2022-04-07 13:03:13,653 INFO L913 BasicCegarLoop]: 49 mSDtfsCounter, 24 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 200 mSolverCounterSat, 37 mSolverCounterUnsat, 9 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 26.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 107 SdHoareTripleChecker+Invalid, 246 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 200 IncrementalHoareTripleChecker+Invalid, 9 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 26.8s IncrementalHoareTripleChecker+Time [2022-04-07 13:03:13,654 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [25 Valid, 107 Invalid, 246 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 200 Invalid, 9 Unknown, 0 Unchecked, 26.8s Time] [2022-04-07 13:03:13,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2022-04-07 13:03:13,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2022-04-07 13:03:13,673 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 13:03:13,673 INFO L82 GeneralOperation]: Start isEquivalent. First operand 51 states. Second operand has 51 states, 27 states have (on average 1.2592592592592593) internal successors, (34), 29 states have internal predecessors, (34), 19 states have call successors, (19), 5 states have call predecessors, (19), 4 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-07 13:03:13,674 INFO L74 IsIncluded]: Start isIncluded. First operand 51 states. Second operand has 51 states, 27 states have (on average 1.2592592592592593) internal successors, (34), 29 states have internal predecessors, (34), 19 states have call successors, (19), 5 states have call predecessors, (19), 4 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-07 13:03:13,674 INFO L87 Difference]: Start difference. First operand 51 states. Second operand has 51 states, 27 states have (on average 1.2592592592592593) internal successors, (34), 29 states have internal predecessors, (34), 19 states have call successors, (19), 5 states have call predecessors, (19), 4 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-07 13:03:13,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 13:03:13,678 INFO L93 Difference]: Finished difference Result 51 states and 69 transitions. [2022-04-07 13:03:13,678 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 69 transitions. [2022-04-07 13:03:13,681 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 13:03:13,681 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 13:03:13,681 INFO L74 IsIncluded]: Start isIncluded. First operand has 51 states, 27 states have (on average 1.2592592592592593) internal successors, (34), 29 states have internal predecessors, (34), 19 states have call successors, (19), 5 states have call predecessors, (19), 4 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) Second operand 51 states. [2022-04-07 13:03:13,682 INFO L87 Difference]: Start difference. First operand has 51 states, 27 states have (on average 1.2592592592592593) internal successors, (34), 29 states have internal predecessors, (34), 19 states have call successors, (19), 5 states have call predecessors, (19), 4 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) Second operand 51 states. [2022-04-07 13:03:13,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 13:03:13,685 INFO L93 Difference]: Finished difference Result 51 states and 69 transitions. [2022-04-07 13:03:13,685 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 69 transitions. [2022-04-07 13:03:13,686 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 13:03:13,686 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 13:03:13,686 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 13:03:13,686 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 13:03:13,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 27 states have (on average 1.2592592592592593) internal successors, (34), 29 states have internal predecessors, (34), 19 states have call successors, (19), 5 states have call predecessors, (19), 4 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-07 13:03:13,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 69 transitions. [2022-04-07 13:03:13,690 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 69 transitions. Word has length 21 [2022-04-07 13:03:13,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 13:03:13,690 INFO L478 AbstractCegarLoop]: Abstraction has 51 states and 69 transitions. [2022-04-07 13:03:13,690 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 5 states have internal predecessors, (15), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-07 13:03:13,690 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 69 transitions. [2022-04-07 13:03:13,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-04-07 13:03:13,691 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 13:03:13,691 INFO L499 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 13:03:13,691 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-04-07 13:03:13,691 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 13:03:13,691 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 13:03:13,691 INFO L85 PathProgramCache]: Analyzing trace with hash -1701877900, now seen corresponding path program 1 times [2022-04-07 13:03:13,691 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 13:03:13,691 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [219428215] [2022-04-07 13:03:13,691 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 13:03:13,692 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 13:03:13,711 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-07 13:03:13,711 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1590908850] [2022-04-07 13:03:13,711 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 13:03:13,712 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 13:03:13,712 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 13:03:13,720 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-07 13:03:13,721 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-07 13:03:13,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 13:03:13,757 INFO L263 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-07 13:03:13,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 13:03:13,764 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-07 13:03:13,876 INFO L272 TraceCheckUtils]: 0: Hoare triple {1137#true} call ULTIMATE.init(); {1137#true} is VALID [2022-04-07 13:03:13,877 INFO L290 TraceCheckUtils]: 1: Hoare triple {1137#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {1145#(<= ~counter~0 0)} is VALID [2022-04-07 13:03:13,878 INFO L290 TraceCheckUtils]: 2: Hoare triple {1145#(<= ~counter~0 0)} assume true; {1145#(<= ~counter~0 0)} is VALID [2022-04-07 13:03:13,878 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1145#(<= ~counter~0 0)} {1137#true} #102#return; {1145#(<= ~counter~0 0)} is VALID [2022-04-07 13:03:13,878 INFO L272 TraceCheckUtils]: 4: Hoare triple {1145#(<= ~counter~0 0)} call #t~ret7 := main(); {1145#(<= ~counter~0 0)} is VALID [2022-04-07 13:03:13,879 INFO L290 TraceCheckUtils]: 5: Hoare triple {1145#(<= ~counter~0 0)} havoc ~n~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~h~0;~n~0 := #t~nondet4;havoc #t~nondet4; {1145#(<= ~counter~0 0)} is VALID [2022-04-07 13:03:13,879 INFO L272 TraceCheckUtils]: 6: Hoare triple {1145#(<= ~counter~0 0)} call assume_abort_if_not((if ~n~0 % 4294967296 < 1073741823 then 1 else 0)); {1145#(<= ~counter~0 0)} is VALID [2022-04-07 13:03:13,879 INFO L290 TraceCheckUtils]: 7: Hoare triple {1145#(<= ~counter~0 0)} ~cond := #in~cond; {1145#(<= ~counter~0 0)} is VALID [2022-04-07 13:03:13,880 INFO L290 TraceCheckUtils]: 8: Hoare triple {1145#(<= ~counter~0 0)} assume !(0 == ~cond); {1145#(<= ~counter~0 0)} is VALID [2022-04-07 13:03:13,882 INFO L290 TraceCheckUtils]: 9: Hoare triple {1145#(<= ~counter~0 0)} assume true; {1145#(<= ~counter~0 0)} is VALID [2022-04-07 13:03:13,883 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1145#(<= ~counter~0 0)} {1145#(<= ~counter~0 0)} #82#return; {1145#(<= ~counter~0 0)} is VALID [2022-04-07 13:03:13,883 INFO L290 TraceCheckUtils]: 11: Hoare triple {1145#(<= ~counter~0 0)} ~p~0 := 0;~q~0 := 1;~r~0 := ~n~0;~h~0 := 0; {1145#(<= ~counter~0 0)} is VALID [2022-04-07 13:03:13,883 INFO L290 TraceCheckUtils]: 12: Hoare triple {1145#(<= ~counter~0 0)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {1179#(<= ~counter~0 1)} is VALID [2022-04-07 13:03:13,884 INFO L290 TraceCheckUtils]: 13: Hoare triple {1179#(<= ~counter~0 1)} assume !!(#t~post5 < 20);havoc #t~post5; {1179#(<= ~counter~0 1)} is VALID [2022-04-07 13:03:13,884 INFO L290 TraceCheckUtils]: 14: Hoare triple {1179#(<= ~counter~0 1)} assume !!(~q~0 % 4294967296 <= ~n~0 % 4294967296);~q~0 := 4 * ~q~0; {1179#(<= ~counter~0 1)} is VALID [2022-04-07 13:03:13,884 INFO L290 TraceCheckUtils]: 15: Hoare triple {1179#(<= ~counter~0 1)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {1189#(<= |main_#t~post5| 1)} is VALID [2022-04-07 13:03:13,885 INFO L290 TraceCheckUtils]: 16: Hoare triple {1189#(<= |main_#t~post5| 1)} assume !(#t~post5 < 20);havoc #t~post5; {1138#false} is VALID [2022-04-07 13:03:13,885 INFO L290 TraceCheckUtils]: 17: Hoare triple {1138#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {1138#false} is VALID [2022-04-07 13:03:13,885 INFO L290 TraceCheckUtils]: 18: Hoare triple {1138#false} assume !(#t~post6 < 20);havoc #t~post6; {1138#false} is VALID [2022-04-07 13:03:13,885 INFO L272 TraceCheckUtils]: 19: Hoare triple {1138#false} call __VERIFIER_assert((if 0 == (~h~0 * ~h~0 * ~h~0 - 12 * ~h~0 * ~n~0 + 16 * ~n~0 * ~p~0 + 12 * ~h~0 * ~r~0 - 16 * ~p~0 * ~r~0 - ~h~0 - 4 * ~p~0) % 4294967296 then 1 else 0)); {1138#false} is VALID [2022-04-07 13:03:13,886 INFO L290 TraceCheckUtils]: 20: Hoare triple {1138#false} ~cond := #in~cond; {1138#false} is VALID [2022-04-07 13:03:13,887 INFO L290 TraceCheckUtils]: 21: Hoare triple {1138#false} assume 0 == ~cond; {1138#false} is VALID [2022-04-07 13:03:13,887 INFO L290 TraceCheckUtils]: 22: Hoare triple {1138#false} assume !false; {1138#false} is VALID [2022-04-07 13:03:13,889 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-07 13:03:13,889 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-07 13:03:14,022 INFO L290 TraceCheckUtils]: 22: Hoare triple {1138#false} assume !false; {1138#false} is VALID [2022-04-07 13:03:14,023 INFO L290 TraceCheckUtils]: 21: Hoare triple {1138#false} assume 0 == ~cond; {1138#false} is VALID [2022-04-07 13:03:14,023 INFO L290 TraceCheckUtils]: 20: Hoare triple {1138#false} ~cond := #in~cond; {1138#false} is VALID [2022-04-07 13:03:14,023 INFO L272 TraceCheckUtils]: 19: Hoare triple {1138#false} call __VERIFIER_assert((if 0 == (~h~0 * ~h~0 * ~h~0 - 12 * ~h~0 * ~n~0 + 16 * ~n~0 * ~p~0 + 12 * ~h~0 * ~r~0 - 16 * ~p~0 * ~r~0 - ~h~0 - 4 * ~p~0) % 4294967296 then 1 else 0)); {1138#false} is VALID [2022-04-07 13:03:14,023 INFO L290 TraceCheckUtils]: 18: Hoare triple {1138#false} assume !(#t~post6 < 20);havoc #t~post6; {1138#false} is VALID [2022-04-07 13:03:14,023 INFO L290 TraceCheckUtils]: 17: Hoare triple {1138#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {1138#false} is VALID [2022-04-07 13:03:14,024 INFO L290 TraceCheckUtils]: 16: Hoare triple {1229#(< |main_#t~post5| 20)} assume !(#t~post5 < 20);havoc #t~post5; {1138#false} is VALID [2022-04-07 13:03:14,024 INFO L290 TraceCheckUtils]: 15: Hoare triple {1233#(< ~counter~0 20)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {1229#(< |main_#t~post5| 20)} is VALID [2022-04-07 13:03:14,025 INFO L290 TraceCheckUtils]: 14: Hoare triple {1233#(< ~counter~0 20)} assume !!(~q~0 % 4294967296 <= ~n~0 % 4294967296);~q~0 := 4 * ~q~0; {1233#(< ~counter~0 20)} is VALID [2022-04-07 13:03:14,025 INFO L290 TraceCheckUtils]: 13: Hoare triple {1233#(< ~counter~0 20)} assume !!(#t~post5 < 20);havoc #t~post5; {1233#(< ~counter~0 20)} is VALID [2022-04-07 13:03:14,026 INFO L290 TraceCheckUtils]: 12: Hoare triple {1243#(< ~counter~0 19)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {1233#(< ~counter~0 20)} is VALID [2022-04-07 13:03:14,026 INFO L290 TraceCheckUtils]: 11: Hoare triple {1243#(< ~counter~0 19)} ~p~0 := 0;~q~0 := 1;~r~0 := ~n~0;~h~0 := 0; {1243#(< ~counter~0 19)} is VALID [2022-04-07 13:03:14,027 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1137#true} {1243#(< ~counter~0 19)} #82#return; {1243#(< ~counter~0 19)} is VALID [2022-04-07 13:03:14,027 INFO L290 TraceCheckUtils]: 9: Hoare triple {1137#true} assume true; {1137#true} is VALID [2022-04-07 13:03:14,027 INFO L290 TraceCheckUtils]: 8: Hoare triple {1137#true} assume !(0 == ~cond); {1137#true} is VALID [2022-04-07 13:03:14,027 INFO L290 TraceCheckUtils]: 7: Hoare triple {1137#true} ~cond := #in~cond; {1137#true} is VALID [2022-04-07 13:03:14,027 INFO L272 TraceCheckUtils]: 6: Hoare triple {1243#(< ~counter~0 19)} call assume_abort_if_not((if ~n~0 % 4294967296 < 1073741823 then 1 else 0)); {1137#true} is VALID [2022-04-07 13:03:14,027 INFO L290 TraceCheckUtils]: 5: Hoare triple {1243#(< ~counter~0 19)} havoc ~n~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~h~0;~n~0 := #t~nondet4;havoc #t~nondet4; {1243#(< ~counter~0 19)} is VALID [2022-04-07 13:03:14,028 INFO L272 TraceCheckUtils]: 4: Hoare triple {1243#(< ~counter~0 19)} call #t~ret7 := main(); {1243#(< ~counter~0 19)} is VALID [2022-04-07 13:03:14,028 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1243#(< ~counter~0 19)} {1137#true} #102#return; {1243#(< ~counter~0 19)} is VALID [2022-04-07 13:03:14,033 INFO L290 TraceCheckUtils]: 2: Hoare triple {1243#(< ~counter~0 19)} assume true; {1243#(< ~counter~0 19)} is VALID [2022-04-07 13:03:14,033 INFO L290 TraceCheckUtils]: 1: Hoare triple {1137#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {1243#(< ~counter~0 19)} is VALID [2022-04-07 13:03:14,034 INFO L272 TraceCheckUtils]: 0: Hoare triple {1137#true} call ULTIMATE.init(); {1137#true} is VALID [2022-04-07 13:03:14,034 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-07 13:03:14,034 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 13:03:14,034 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [219428215] [2022-04-07 13:03:14,034 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-07 13:03:14,034 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1590908850] [2022-04-07 13:03:14,039 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1590908850] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-07 13:03:14,039 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-07 13:03:14,039 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2022-04-07 13:03:14,040 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1862898510] [2022-04-07 13:03:14,040 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-07 13:03:14,041 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.625) internal successors, (29), 8 states have internal predecessors, (29), 4 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) Word has length 23 [2022-04-07 13:03:14,041 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 13:03:14,041 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 3.625) internal successors, (29), 8 states have internal predecessors, (29), 4 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) [2022-04-07 13:03:14,064 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 39 edges. 39 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 13:03:14,065 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-07 13:03:14,065 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 13:03:14,065 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-07 13:03:14,065 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2022-04-07 13:03:14,065 INFO L87 Difference]: Start difference. First operand 51 states and 69 transitions. Second operand has 8 states, 8 states have (on average 3.625) internal successors, (29), 8 states have internal predecessors, (29), 4 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) [2022-04-07 13:03:23,119 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-07 13:03:27,278 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-07 13:03:36,047 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-07 13:03:38,054 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-07 13:03:38,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 13:03:38,187 INFO L93 Difference]: Finished difference Result 108 states and 149 transitions. [2022-04-07 13:03:38,187 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-04-07 13:03:38,188 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.625) internal successors, (29), 8 states have internal predecessors, (29), 4 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) Word has length 23 [2022-04-07 13:03:38,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 13:03:38,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 3.625) internal successors, (29), 8 states have internal predecessors, (29), 4 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) [2022-04-07 13:03:38,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 135 transitions. [2022-04-07 13:03:38,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 3.625) internal successors, (29), 8 states have internal predecessors, (29), 4 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) [2022-04-07 13:03:38,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 135 transitions. [2022-04-07 13:03:38,193 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 10 states and 135 transitions. [2022-04-07 13:03:38,297 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 135 edges. 135 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 13:03:38,299 INFO L225 Difference]: With dead ends: 108 [2022-04-07 13:03:38,299 INFO L226 Difference]: Without dead ends: 89 [2022-04-07 13:03:38,300 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 39 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-07 13:03:38,300 INFO L913 BasicCegarLoop]: 57 mSDtfsCounter, 62 mSDsluCounter, 187 mSDsCounter, 0 mSdLazyCounter, 76 mSolverCounterSat, 22 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 14.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 244 SdHoareTripleChecker+Invalid, 102 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 76 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 14.0s IncrementalHoareTripleChecker+Time [2022-04-07 13:03:38,300 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [62 Valid, 244 Invalid, 102 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 76 Invalid, 4 Unknown, 0 Unchecked, 14.0s Time] [2022-04-07 13:03:38,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2022-04-07 13:03:38,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 67. [2022-04-07 13:03:38,320 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 13:03:38,320 INFO L82 GeneralOperation]: Start isEquivalent. First operand 89 states. Second operand has 67 states, 41 states have (on average 1.2439024390243902) internal successors, (51), 43 states have internal predecessors, (51), 19 states have call successors, (19), 7 states have call predecessors, (19), 6 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-07 13:03:38,320 INFO L74 IsIncluded]: Start isIncluded. First operand 89 states. Second operand has 67 states, 41 states have (on average 1.2439024390243902) internal successors, (51), 43 states have internal predecessors, (51), 19 states have call successors, (19), 7 states have call predecessors, (19), 6 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-07 13:03:38,321 INFO L87 Difference]: Start difference. First operand 89 states. Second operand has 67 states, 41 states have (on average 1.2439024390243902) internal successors, (51), 43 states have internal predecessors, (51), 19 states have call successors, (19), 7 states have call predecessors, (19), 6 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-07 13:03:38,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 13:03:38,324 INFO L93 Difference]: Finished difference Result 89 states and 117 transitions. [2022-04-07 13:03:38,324 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 117 transitions. [2022-04-07 13:03:38,325 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 13:03:38,325 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 13:03:38,325 INFO L74 IsIncluded]: Start isIncluded. First operand has 67 states, 41 states have (on average 1.2439024390243902) internal successors, (51), 43 states have internal predecessors, (51), 19 states have call successors, (19), 7 states have call predecessors, (19), 6 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) Second operand 89 states. [2022-04-07 13:03:38,325 INFO L87 Difference]: Start difference. First operand has 67 states, 41 states have (on average 1.2439024390243902) internal successors, (51), 43 states have internal predecessors, (51), 19 states have call successors, (19), 7 states have call predecessors, (19), 6 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) Second operand 89 states. [2022-04-07 13:03:38,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 13:03:38,329 INFO L93 Difference]: Finished difference Result 89 states and 117 transitions. [2022-04-07 13:03:38,329 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 117 transitions. [2022-04-07 13:03:38,330 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 13:03:38,330 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 13:03:38,330 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 13:03:38,330 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 13:03:38,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 41 states have (on average 1.2439024390243902) internal successors, (51), 43 states have internal predecessors, (51), 19 states have call successors, (19), 7 states have call predecessors, (19), 6 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-07 13:03:38,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 86 transitions. [2022-04-07 13:03:38,333 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 86 transitions. Word has length 23 [2022-04-07 13:03:38,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 13:03:38,334 INFO L478 AbstractCegarLoop]: Abstraction has 67 states and 86 transitions. [2022-04-07 13:03:38,334 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.625) internal successors, (29), 8 states have internal predecessors, (29), 4 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) [2022-04-07 13:03:38,334 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 86 transitions. [2022-04-07 13:03:38,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-04-07 13:03:38,334 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 13:03:38,334 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 13:03:38,352 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-04-07 13:03:38,547 WARN L460 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-07 13:03:38,548 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 13:03:38,548 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 13:03:38,548 INFO L85 PathProgramCache]: Analyzing trace with hash -1564262277, now seen corresponding path program 1 times [2022-04-07 13:03:38,548 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 13:03:38,548 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [745673342] [2022-04-07 13:03:38,548 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 13:03:38,548 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 13:03:38,566 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-07 13:03:38,566 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1807187454] [2022-04-07 13:03:38,566 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 13:03:38,566 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 13:03:38,566 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 13:03:38,571 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-07 13:03:38,572 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-07 13:03:38,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 13:03:38,603 INFO L263 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-07 13:03:38,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 13:03:38,610 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-07 13:03:38,749 INFO L272 TraceCheckUtils]: 0: Hoare triple {1723#true} call ULTIMATE.init(); {1723#true} is VALID [2022-04-07 13:03:38,749 INFO L290 TraceCheckUtils]: 1: Hoare triple {1723#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {1731#(<= ~counter~0 0)} is VALID [2022-04-07 13:03:38,750 INFO L290 TraceCheckUtils]: 2: Hoare triple {1731#(<= ~counter~0 0)} assume true; {1731#(<= ~counter~0 0)} is VALID [2022-04-07 13:03:38,750 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1731#(<= ~counter~0 0)} {1723#true} #102#return; {1731#(<= ~counter~0 0)} is VALID [2022-04-07 13:03:38,750 INFO L272 TraceCheckUtils]: 4: Hoare triple {1731#(<= ~counter~0 0)} call #t~ret7 := main(); {1731#(<= ~counter~0 0)} is VALID [2022-04-07 13:03:38,751 INFO L290 TraceCheckUtils]: 5: Hoare triple {1731#(<= ~counter~0 0)} havoc ~n~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~h~0;~n~0 := #t~nondet4;havoc #t~nondet4; {1731#(<= ~counter~0 0)} is VALID [2022-04-07 13:03:38,751 INFO L272 TraceCheckUtils]: 6: Hoare triple {1731#(<= ~counter~0 0)} call assume_abort_if_not((if ~n~0 % 4294967296 < 1073741823 then 1 else 0)); {1731#(<= ~counter~0 0)} is VALID [2022-04-07 13:03:38,751 INFO L290 TraceCheckUtils]: 7: Hoare triple {1731#(<= ~counter~0 0)} ~cond := #in~cond; {1731#(<= ~counter~0 0)} is VALID [2022-04-07 13:03:38,752 INFO L290 TraceCheckUtils]: 8: Hoare triple {1731#(<= ~counter~0 0)} assume !(0 == ~cond); {1731#(<= ~counter~0 0)} is VALID [2022-04-07 13:03:38,752 INFO L290 TraceCheckUtils]: 9: Hoare triple {1731#(<= ~counter~0 0)} assume true; {1731#(<= ~counter~0 0)} is VALID [2022-04-07 13:03:38,752 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1731#(<= ~counter~0 0)} {1731#(<= ~counter~0 0)} #82#return; {1731#(<= ~counter~0 0)} is VALID [2022-04-07 13:03:38,753 INFO L290 TraceCheckUtils]: 11: Hoare triple {1731#(<= ~counter~0 0)} ~p~0 := 0;~q~0 := 1;~r~0 := ~n~0;~h~0 := 0; {1731#(<= ~counter~0 0)} is VALID [2022-04-07 13:03:38,753 INFO L290 TraceCheckUtils]: 12: Hoare triple {1731#(<= ~counter~0 0)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {1765#(<= ~counter~0 1)} is VALID [2022-04-07 13:03:38,753 INFO L290 TraceCheckUtils]: 13: Hoare triple {1765#(<= ~counter~0 1)} assume !!(#t~post5 < 20);havoc #t~post5; {1765#(<= ~counter~0 1)} is VALID [2022-04-07 13:03:38,754 INFO L290 TraceCheckUtils]: 14: Hoare triple {1765#(<= ~counter~0 1)} assume !!(~q~0 % 4294967296 <= ~n~0 % 4294967296);~q~0 := 4 * ~q~0; {1765#(<= ~counter~0 1)} is VALID [2022-04-07 13:03:38,754 INFO L290 TraceCheckUtils]: 15: Hoare triple {1765#(<= ~counter~0 1)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {1775#(<= ~counter~0 2)} is VALID [2022-04-07 13:03:38,755 INFO L290 TraceCheckUtils]: 16: Hoare triple {1775#(<= ~counter~0 2)} assume !!(#t~post5 < 20);havoc #t~post5; {1775#(<= ~counter~0 2)} is VALID [2022-04-07 13:03:38,755 INFO L290 TraceCheckUtils]: 17: Hoare triple {1775#(<= ~counter~0 2)} assume !(~q~0 % 4294967296 <= ~n~0 % 4294967296); {1775#(<= ~counter~0 2)} is VALID [2022-04-07 13:03:38,755 INFO L290 TraceCheckUtils]: 18: Hoare triple {1775#(<= ~counter~0 2)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {1785#(<= |main_#t~post6| 2)} is VALID [2022-04-07 13:03:38,756 INFO L290 TraceCheckUtils]: 19: Hoare triple {1785#(<= |main_#t~post6| 2)} assume !(#t~post6 < 20);havoc #t~post6; {1724#false} is VALID [2022-04-07 13:03:38,756 INFO L272 TraceCheckUtils]: 20: Hoare triple {1724#false} call __VERIFIER_assert((if 0 == (~h~0 * ~h~0 * ~h~0 - 12 * ~h~0 * ~n~0 + 16 * ~n~0 * ~p~0 + 12 * ~h~0 * ~r~0 - 16 * ~p~0 * ~r~0 - ~h~0 - 4 * ~p~0) % 4294967296 then 1 else 0)); {1724#false} is VALID [2022-04-07 13:03:38,756 INFO L290 TraceCheckUtils]: 21: Hoare triple {1724#false} ~cond := #in~cond; {1724#false} is VALID [2022-04-07 13:03:38,767 INFO L290 TraceCheckUtils]: 22: Hoare triple {1724#false} assume 0 == ~cond; {1724#false} is VALID [2022-04-07 13:03:38,767 INFO L290 TraceCheckUtils]: 23: Hoare triple {1724#false} assume !false; {1724#false} is VALID [2022-04-07 13:03:38,767 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-07 13:03:38,767 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-07 13:03:38,948 INFO L290 TraceCheckUtils]: 23: Hoare triple {1724#false} assume !false; {1724#false} is VALID [2022-04-07 13:03:38,948 INFO L290 TraceCheckUtils]: 22: Hoare triple {1724#false} assume 0 == ~cond; {1724#false} is VALID [2022-04-07 13:03:38,949 INFO L290 TraceCheckUtils]: 21: Hoare triple {1724#false} ~cond := #in~cond; {1724#false} is VALID [2022-04-07 13:03:38,949 INFO L272 TraceCheckUtils]: 20: Hoare triple {1724#false} call __VERIFIER_assert((if 0 == (~h~0 * ~h~0 * ~h~0 - 12 * ~h~0 * ~n~0 + 16 * ~n~0 * ~p~0 + 12 * ~h~0 * ~r~0 - 16 * ~p~0 * ~r~0 - ~h~0 - 4 * ~p~0) % 4294967296 then 1 else 0)); {1724#false} is VALID [2022-04-07 13:03:38,949 INFO L290 TraceCheckUtils]: 19: Hoare triple {1813#(< |main_#t~post6| 20)} assume !(#t~post6 < 20);havoc #t~post6; {1724#false} is VALID [2022-04-07 13:03:38,949 INFO L290 TraceCheckUtils]: 18: Hoare triple {1817#(< ~counter~0 20)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {1813#(< |main_#t~post6| 20)} is VALID [2022-04-07 13:03:38,951 INFO L290 TraceCheckUtils]: 17: Hoare triple {1817#(< ~counter~0 20)} assume !(~q~0 % 4294967296 <= ~n~0 % 4294967296); {1817#(< ~counter~0 20)} is VALID [2022-04-07 13:03:38,952 INFO L290 TraceCheckUtils]: 16: Hoare triple {1817#(< ~counter~0 20)} assume !!(#t~post5 < 20);havoc #t~post5; {1817#(< ~counter~0 20)} is VALID [2022-04-07 13:03:38,952 INFO L290 TraceCheckUtils]: 15: Hoare triple {1827#(< ~counter~0 19)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {1817#(< ~counter~0 20)} is VALID [2022-04-07 13:03:38,953 INFO L290 TraceCheckUtils]: 14: Hoare triple {1827#(< ~counter~0 19)} assume !!(~q~0 % 4294967296 <= ~n~0 % 4294967296);~q~0 := 4 * ~q~0; {1827#(< ~counter~0 19)} is VALID [2022-04-07 13:03:38,953 INFO L290 TraceCheckUtils]: 13: Hoare triple {1827#(< ~counter~0 19)} assume !!(#t~post5 < 20);havoc #t~post5; {1827#(< ~counter~0 19)} is VALID [2022-04-07 13:03:38,953 INFO L290 TraceCheckUtils]: 12: Hoare triple {1837#(< ~counter~0 18)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {1827#(< ~counter~0 19)} is VALID [2022-04-07 13:03:38,954 INFO L290 TraceCheckUtils]: 11: Hoare triple {1837#(< ~counter~0 18)} ~p~0 := 0;~q~0 := 1;~r~0 := ~n~0;~h~0 := 0; {1837#(< ~counter~0 18)} is VALID [2022-04-07 13:03:38,954 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1723#true} {1837#(< ~counter~0 18)} #82#return; {1837#(< ~counter~0 18)} is VALID [2022-04-07 13:03:38,954 INFO L290 TraceCheckUtils]: 9: Hoare triple {1723#true} assume true; {1723#true} is VALID [2022-04-07 13:03:38,954 INFO L290 TraceCheckUtils]: 8: Hoare triple {1723#true} assume !(0 == ~cond); {1723#true} is VALID [2022-04-07 13:03:38,954 INFO L290 TraceCheckUtils]: 7: Hoare triple {1723#true} ~cond := #in~cond; {1723#true} is VALID [2022-04-07 13:03:38,955 INFO L272 TraceCheckUtils]: 6: Hoare triple {1837#(< ~counter~0 18)} call assume_abort_if_not((if ~n~0 % 4294967296 < 1073741823 then 1 else 0)); {1723#true} is VALID [2022-04-07 13:03:38,955 INFO L290 TraceCheckUtils]: 5: Hoare triple {1837#(< ~counter~0 18)} havoc ~n~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~h~0;~n~0 := #t~nondet4;havoc #t~nondet4; {1837#(< ~counter~0 18)} is VALID [2022-04-07 13:03:38,956 INFO L272 TraceCheckUtils]: 4: Hoare triple {1837#(< ~counter~0 18)} call #t~ret7 := main(); {1837#(< ~counter~0 18)} is VALID [2022-04-07 13:03:38,956 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1837#(< ~counter~0 18)} {1723#true} #102#return; {1837#(< ~counter~0 18)} is VALID [2022-04-07 13:03:38,958 INFO L290 TraceCheckUtils]: 2: Hoare triple {1837#(< ~counter~0 18)} assume true; {1837#(< ~counter~0 18)} is VALID [2022-04-07 13:03:38,958 INFO L290 TraceCheckUtils]: 1: Hoare triple {1723#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {1837#(< ~counter~0 18)} is VALID [2022-04-07 13:03:38,958 INFO L272 TraceCheckUtils]: 0: Hoare triple {1723#true} call ULTIMATE.init(); {1723#true} is VALID [2022-04-07 13:03:38,958 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-07 13:03:38,959 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 13:03:38,959 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [745673342] [2022-04-07 13:03:38,959 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-07 13:03:38,959 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1807187454] [2022-04-07 13:03:38,959 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1807187454] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-07 13:03:38,959 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-07 13:03:38,959 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2022-04-07 13:03:38,959 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [583676081] [2022-04-07 13:03:38,959 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-07 13:03:38,960 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.3) internal successors, (33), 10 states have internal predecessors, (33), 4 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) Word has length 24 [2022-04-07 13:03:38,960 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 13:03:38,960 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 10 states, 10 states have (on average 3.3) internal successors, (33), 10 states have internal predecessors, (33), 4 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) [2022-04-07 13:03:38,988 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 43 edges. 43 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 13:03:38,988 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-07 13:03:38,988 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 13:03:38,989 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-07 13:03:38,989 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-04-07 13:03:38,989 INFO L87 Difference]: Start difference. First operand 67 states and 86 transitions. Second operand has 10 states, 10 states have (on average 3.3) internal successors, (33), 10 states have internal predecessors, (33), 4 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) [2022-04-07 13:03:40,487 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.17s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-07 13:03:42,532 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-07 13:03:49,342 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-07 13:03:54,819 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.83s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-07 13:03:58,996 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-07 13:04:08,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 13:04:08,438 INFO L93 Difference]: Finished difference Result 134 states and 180 transitions. [2022-04-07 13:04:08,438 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-04-07 13:04:08,438 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.3) internal successors, (33), 10 states have internal predecessors, (33), 4 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) Word has length 24 [2022-04-07 13:04:08,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 13:04:08,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 3.3) internal successors, (33), 10 states have internal predecessors, (33), 4 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) [2022-04-07 13:04:08,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 166 transitions. [2022-04-07 13:04:08,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 3.3) internal successors, (33), 10 states have internal predecessors, (33), 4 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) [2022-04-07 13:04:08,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 166 transitions. [2022-04-07 13:04:08,444 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 13 states and 166 transitions. [2022-04-07 13:04:08,584 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 166 edges. 166 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 13:04:08,586 INFO L225 Difference]: With dead ends: 134 [2022-04-07 13:04:08,586 INFO L226 Difference]: Without dead ends: 125 [2022-04-07 13:04:08,586 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 39 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-07 13:04:08,587 INFO L913 BasicCegarLoop]: 80 mSDtfsCounter, 111 mSDsluCounter, 268 mSDsCounter, 0 mSdLazyCounter, 110 mSolverCounterSat, 42 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 16.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 348 SdHoareTripleChecker+Invalid, 155 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 110 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 16.2s IncrementalHoareTripleChecker+Time [2022-04-07 13:04:08,587 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [111 Valid, 348 Invalid, 155 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 110 Invalid, 3 Unknown, 0 Unchecked, 16.2s Time] [2022-04-07 13:04:08,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2022-04-07 13:04:08,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 116. [2022-04-07 13:04:08,630 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 13:04:08,630 INFO L82 GeneralOperation]: Start isEquivalent. First operand 125 states. Second operand has 116 states, 66 states have (on average 1.303030303030303) internal successors, (86), 71 states have internal predecessors, (86), 40 states have call successors, (40), 10 states have call predecessors, (40), 9 states have return successors, (35), 34 states have call predecessors, (35), 35 states have call successors, (35) [2022-04-07 13:04:08,631 INFO L74 IsIncluded]: Start isIncluded. First operand 125 states. Second operand has 116 states, 66 states have (on average 1.303030303030303) internal successors, (86), 71 states have internal predecessors, (86), 40 states have call successors, (40), 10 states have call predecessors, (40), 9 states have return successors, (35), 34 states have call predecessors, (35), 35 states have call successors, (35) [2022-04-07 13:04:08,631 INFO L87 Difference]: Start difference. First operand 125 states. Second operand has 116 states, 66 states have (on average 1.303030303030303) internal successors, (86), 71 states have internal predecessors, (86), 40 states have call successors, (40), 10 states have call predecessors, (40), 9 states have return successors, (35), 34 states have call predecessors, (35), 35 states have call successors, (35) [2022-04-07 13:04:08,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 13:04:08,634 INFO L93 Difference]: Finished difference Result 125 states and 166 transitions. [2022-04-07 13:04:08,634 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 166 transitions. [2022-04-07 13:04:08,635 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 13:04:08,635 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 13:04:08,635 INFO L74 IsIncluded]: Start isIncluded. First operand has 116 states, 66 states have (on average 1.303030303030303) internal successors, (86), 71 states have internal predecessors, (86), 40 states have call successors, (40), 10 states have call predecessors, (40), 9 states have return successors, (35), 34 states have call predecessors, (35), 35 states have call successors, (35) Second operand 125 states. [2022-04-07 13:04:08,636 INFO L87 Difference]: Start difference. First operand has 116 states, 66 states have (on average 1.303030303030303) internal successors, (86), 71 states have internal predecessors, (86), 40 states have call successors, (40), 10 states have call predecessors, (40), 9 states have return successors, (35), 34 states have call predecessors, (35), 35 states have call successors, (35) Second operand 125 states. [2022-04-07 13:04:08,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 13:04:08,639 INFO L93 Difference]: Finished difference Result 125 states and 166 transitions. [2022-04-07 13:04:08,639 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 166 transitions. [2022-04-07 13:04:08,640 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 13:04:08,640 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 13:04:08,640 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 13:04:08,640 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 13:04:08,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 66 states have (on average 1.303030303030303) internal successors, (86), 71 states have internal predecessors, (86), 40 states have call successors, (40), 10 states have call predecessors, (40), 9 states have return successors, (35), 34 states have call predecessors, (35), 35 states have call successors, (35) [2022-04-07 13:04:08,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 161 transitions. [2022-04-07 13:04:08,643 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 161 transitions. Word has length 24 [2022-04-07 13:04:08,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 13:04:08,643 INFO L478 AbstractCegarLoop]: Abstraction has 116 states and 161 transitions. [2022-04-07 13:04:08,643 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.3) internal successors, (33), 10 states have internal predecessors, (33), 4 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) [2022-04-07 13:04:08,643 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 161 transitions. [2022-04-07 13:04:08,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-04-07 13:04:08,644 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 13:04:08,644 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 13:04:08,662 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-04-07 13:04:08,859 WARN L460 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-07 13:04:08,859 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 13:04:08,860 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 13:04:08,860 INFO L85 PathProgramCache]: Analyzing trace with hash -1562772727, now seen corresponding path program 1 times [2022-04-07 13:04:08,860 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 13:04:08,860 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2109831983] [2022-04-07 13:04:08,860 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 13:04:08,860 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 13:04:08,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 13:04:09,034 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 13:04:09,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 13:04:09,045 INFO L290 TraceCheckUtils]: 0: Hoare triple {2515#(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(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {2501#true} is VALID [2022-04-07 13:04:09,045 INFO L290 TraceCheckUtils]: 1: Hoare triple {2501#true} assume true; {2501#true} is VALID [2022-04-07 13:04:09,045 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {2501#true} {2501#true} #102#return; {2501#true} is VALID [2022-04-07 13:04:09,045 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-07 13:04:09,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 13:04:09,056 INFO L290 TraceCheckUtils]: 0: Hoare triple {2501#true} ~cond := #in~cond; {2501#true} is VALID [2022-04-07 13:04:09,056 INFO L290 TraceCheckUtils]: 1: Hoare triple {2501#true} assume !(0 == ~cond); {2501#true} is VALID [2022-04-07 13:04:09,056 INFO L290 TraceCheckUtils]: 2: Hoare triple {2501#true} assume true; {2501#true} is VALID [2022-04-07 13:04:09,056 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2501#true} {2501#true} #82#return; {2501#true} is VALID [2022-04-07 13:04:09,056 INFO L272 TraceCheckUtils]: 0: Hoare triple {2501#true} call ULTIMATE.init(); {2515#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-07 13:04:09,057 INFO L290 TraceCheckUtils]: 1: Hoare triple {2515#(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(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {2501#true} is VALID [2022-04-07 13:04:09,057 INFO L290 TraceCheckUtils]: 2: Hoare triple {2501#true} assume true; {2501#true} is VALID [2022-04-07 13:04:09,057 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2501#true} {2501#true} #102#return; {2501#true} is VALID [2022-04-07 13:04:09,057 INFO L272 TraceCheckUtils]: 4: Hoare triple {2501#true} call #t~ret7 := main(); {2501#true} is VALID [2022-04-07 13:04:09,059 INFO L290 TraceCheckUtils]: 5: Hoare triple {2501#true} havoc ~n~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~h~0;~n~0 := #t~nondet4;havoc #t~nondet4; {2501#true} is VALID [2022-04-07 13:04:09,059 INFO L272 TraceCheckUtils]: 6: Hoare triple {2501#true} call assume_abort_if_not((if ~n~0 % 4294967296 < 1073741823 then 1 else 0)); {2501#true} is VALID [2022-04-07 13:04:09,060 INFO L290 TraceCheckUtils]: 7: Hoare triple {2501#true} ~cond := #in~cond; {2501#true} is VALID [2022-04-07 13:04:09,060 INFO L290 TraceCheckUtils]: 8: Hoare triple {2501#true} assume !(0 == ~cond); {2501#true} is VALID [2022-04-07 13:04:09,060 INFO L290 TraceCheckUtils]: 9: Hoare triple {2501#true} assume true; {2501#true} is VALID [2022-04-07 13:04:09,060 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2501#true} {2501#true} #82#return; {2501#true} is VALID [2022-04-07 13:04:09,060 INFO L290 TraceCheckUtils]: 11: Hoare triple {2501#true} ~p~0 := 0;~q~0 := 1;~r~0 := ~n~0;~h~0 := 0; {2510#(and (= main_~p~0 0) (= (+ (- 1) main_~q~0) 0) (= (+ main_~n~0 (* (- 1) main_~r~0)) 0))} is VALID [2022-04-07 13:04:09,061 INFO L290 TraceCheckUtils]: 12: Hoare triple {2510#(and (= main_~p~0 0) (= (+ (- 1) main_~q~0) 0) (= (+ main_~n~0 (* (- 1) main_~r~0)) 0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {2510#(and (= main_~p~0 0) (= (+ (- 1) main_~q~0) 0) (= (+ main_~n~0 (* (- 1) main_~r~0)) 0))} is VALID [2022-04-07 13:04:09,061 INFO L290 TraceCheckUtils]: 13: Hoare triple {2510#(and (= main_~p~0 0) (= (+ (- 1) main_~q~0) 0) (= (+ main_~n~0 (* (- 1) main_~r~0)) 0))} assume !!(#t~post5 < 20);havoc #t~post5; {2510#(and (= main_~p~0 0) (= (+ (- 1) main_~q~0) 0) (= (+ main_~n~0 (* (- 1) main_~r~0)) 0))} is VALID [2022-04-07 13:04:09,062 INFO L290 TraceCheckUtils]: 14: Hoare triple {2510#(and (= main_~p~0 0) (= (+ (- 1) main_~q~0) 0) (= (+ main_~n~0 (* (- 1) main_~r~0)) 0))} assume !!(~q~0 % 4294967296 <= ~n~0 % 4294967296);~q~0 := 4 * ~q~0; {2511#(and (= main_~p~0 0) (= main_~n~0 main_~r~0))} is VALID [2022-04-07 13:04:09,062 INFO L290 TraceCheckUtils]: 15: Hoare triple {2511#(and (= main_~p~0 0) (= main_~n~0 main_~r~0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {2511#(and (= main_~p~0 0) (= main_~n~0 main_~r~0))} is VALID [2022-04-07 13:04:09,062 INFO L290 TraceCheckUtils]: 16: Hoare triple {2511#(and (= main_~p~0 0) (= main_~n~0 main_~r~0))} assume !!(#t~post5 < 20);havoc #t~post5; {2511#(and (= main_~p~0 0) (= main_~n~0 main_~r~0))} is VALID [2022-04-07 13:04:09,063 INFO L290 TraceCheckUtils]: 17: Hoare triple {2511#(and (= main_~p~0 0) (= main_~n~0 main_~r~0))} assume !(~q~0 % 4294967296 <= ~n~0 % 4294967296); {2512#(and (<= (+ (* (div (+ (* main_~p~0 2) main_~q~0) 4294967296) 4294967296) main_~r~0 1) (+ main_~q~0 (* (div main_~r~0 4294967296) 4294967296))) (= main_~p~0 0))} is VALID [2022-04-07 13:04:09,063 INFO L290 TraceCheckUtils]: 18: Hoare triple {2512#(and (<= (+ (* (div (+ (* main_~p~0 2) main_~q~0) 4294967296) 4294967296) main_~r~0 1) (+ main_~q~0 (* (div main_~r~0 4294967296) 4294967296))) (= main_~p~0 0))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {2512#(and (<= (+ (* (div (+ (* main_~p~0 2) main_~q~0) 4294967296) 4294967296) main_~r~0 1) (+ main_~q~0 (* (div main_~r~0 4294967296) 4294967296))) (= main_~p~0 0))} is VALID [2022-04-07 13:04:09,064 INFO L290 TraceCheckUtils]: 19: Hoare triple {2512#(and (<= (+ (* (div (+ (* main_~p~0 2) main_~q~0) 4294967296) 4294967296) main_~r~0 1) (+ main_~q~0 (* (div main_~r~0 4294967296) 4294967296))) (= main_~p~0 0))} assume !!(#t~post6 < 20);havoc #t~post6; {2512#(and (<= (+ (* (div (+ (* main_~p~0 2) main_~q~0) 4294967296) 4294967296) main_~r~0 1) (+ main_~q~0 (* (div main_~r~0 4294967296) 4294967296))) (= main_~p~0 0))} is VALID [2022-04-07 13:04:09,065 INFO L272 TraceCheckUtils]: 20: Hoare triple {2512#(and (<= (+ (* (div (+ (* main_~p~0 2) main_~q~0) 4294967296) 4294967296) main_~r~0 1) (+ main_~q~0 (* (div main_~r~0 4294967296) 4294967296))) (= main_~p~0 0))} call __VERIFIER_assert((if ~r~0 % 4294967296 < (2 * ~p~0 + ~q~0) % 4294967296 then 1 else 0)); {2513#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-07 13:04:09,065 INFO L290 TraceCheckUtils]: 21: Hoare triple {2513#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {2514#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-07 13:04:09,065 INFO L290 TraceCheckUtils]: 22: Hoare triple {2514#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {2502#false} is VALID [2022-04-07 13:04:09,065 INFO L290 TraceCheckUtils]: 23: Hoare triple {2502#false} assume !false; {2502#false} is VALID [2022-04-07 13:04:09,066 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-07 13:04:09,066 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 13:04:09,066 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2109831983] [2022-04-07 13:04:09,066 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2109831983] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-07 13:04:09,066 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2012180444] [2022-04-07 13:04:09,066 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 13:04:09,067 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 13:04:09,067 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 13:04:09,067 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-07 13:04:09,069 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-07 13:04:09,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 13:04:09,110 INFO L263 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 12 conjunts are in the unsatisfiable core [2022-04-07 13:04:09,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 13:04:09,120 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-07 13:04:09,374 INFO L272 TraceCheckUtils]: 0: Hoare triple {2501#true} call ULTIMATE.init(); {2501#true} is VALID [2022-04-07 13:04:09,374 INFO L290 TraceCheckUtils]: 1: Hoare triple {2501#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {2501#true} is VALID [2022-04-07 13:04:09,374 INFO L290 TraceCheckUtils]: 2: Hoare triple {2501#true} assume true; {2501#true} is VALID [2022-04-07 13:04:09,374 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2501#true} {2501#true} #102#return; {2501#true} is VALID [2022-04-07 13:04:09,375 INFO L272 TraceCheckUtils]: 4: Hoare triple {2501#true} call #t~ret7 := main(); {2501#true} is VALID [2022-04-07 13:04:09,375 INFO L290 TraceCheckUtils]: 5: Hoare triple {2501#true} havoc ~n~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~h~0;~n~0 := #t~nondet4;havoc #t~nondet4; {2501#true} is VALID [2022-04-07 13:04:09,375 INFO L272 TraceCheckUtils]: 6: Hoare triple {2501#true} call assume_abort_if_not((if ~n~0 % 4294967296 < 1073741823 then 1 else 0)); {2501#true} is VALID [2022-04-07 13:04:09,375 INFO L290 TraceCheckUtils]: 7: Hoare triple {2501#true} ~cond := #in~cond; {2501#true} is VALID [2022-04-07 13:04:09,375 INFO L290 TraceCheckUtils]: 8: Hoare triple {2501#true} assume !(0 == ~cond); {2501#true} is VALID [2022-04-07 13:04:09,375 INFO L290 TraceCheckUtils]: 9: Hoare triple {2501#true} assume true; {2501#true} is VALID [2022-04-07 13:04:09,375 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2501#true} {2501#true} #82#return; {2501#true} is VALID [2022-04-07 13:04:09,375 INFO L290 TraceCheckUtils]: 11: Hoare triple {2501#true} ~p~0 := 0;~q~0 := 1;~r~0 := ~n~0;~h~0 := 0; {2510#(and (= main_~p~0 0) (= (+ (- 1) main_~q~0) 0) (= (+ main_~n~0 (* (- 1) main_~r~0)) 0))} is VALID [2022-04-07 13:04:09,376 INFO L290 TraceCheckUtils]: 12: Hoare triple {2510#(and (= main_~p~0 0) (= (+ (- 1) main_~q~0) 0) (= (+ main_~n~0 (* (- 1) main_~r~0)) 0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {2510#(and (= main_~p~0 0) (= (+ (- 1) main_~q~0) 0) (= (+ main_~n~0 (* (- 1) main_~r~0)) 0))} is VALID [2022-04-07 13:04:09,377 INFO L290 TraceCheckUtils]: 13: Hoare triple {2510#(and (= main_~p~0 0) (= (+ (- 1) main_~q~0) 0) (= (+ main_~n~0 (* (- 1) main_~r~0)) 0))} assume !!(#t~post5 < 20);havoc #t~post5; {2510#(and (= main_~p~0 0) (= (+ (- 1) main_~q~0) 0) (= (+ main_~n~0 (* (- 1) main_~r~0)) 0))} is VALID [2022-04-07 13:04:09,404 INFO L290 TraceCheckUtils]: 14: Hoare triple {2510#(and (= main_~p~0 0) (= (+ (- 1) main_~q~0) 0) (= (+ main_~n~0 (* (- 1) main_~r~0)) 0))} assume !!(~q~0 % 4294967296 <= ~n~0 % 4294967296);~q~0 := 4 * ~q~0; {2561#(and (= main_~p~0 0) (= main_~q~0 4) (= (+ main_~n~0 (* (- 1) main_~r~0)) 0))} is VALID [2022-04-07 13:04:09,404 INFO L290 TraceCheckUtils]: 15: Hoare triple {2561#(and (= main_~p~0 0) (= main_~q~0 4) (= (+ main_~n~0 (* (- 1) main_~r~0)) 0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {2561#(and (= main_~p~0 0) (= main_~q~0 4) (= (+ main_~n~0 (* (- 1) main_~r~0)) 0))} is VALID [2022-04-07 13:04:09,405 INFO L290 TraceCheckUtils]: 16: Hoare triple {2561#(and (= main_~p~0 0) (= main_~q~0 4) (= (+ main_~n~0 (* (- 1) main_~r~0)) 0))} assume !!(#t~post5 < 20);havoc #t~post5; {2561#(and (= main_~p~0 0) (= main_~q~0 4) (= (+ main_~n~0 (* (- 1) main_~r~0)) 0))} is VALID [2022-04-07 13:04:09,406 INFO L290 TraceCheckUtils]: 17: Hoare triple {2561#(and (= main_~p~0 0) (= main_~q~0 4) (= (+ main_~n~0 (* (- 1) main_~r~0)) 0))} assume !(~q~0 % 4294967296 <= ~n~0 % 4294967296); {2571#(and (not (<= (mod main_~q~0 4294967296) (mod main_~r~0 4294967296))) (= main_~p~0 0) (= main_~q~0 4))} is VALID [2022-04-07 13:04:09,406 INFO L290 TraceCheckUtils]: 18: Hoare triple {2571#(and (not (<= (mod main_~q~0 4294967296) (mod main_~r~0 4294967296))) (= main_~p~0 0) (= main_~q~0 4))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {2571#(and (not (<= (mod main_~q~0 4294967296) (mod main_~r~0 4294967296))) (= main_~p~0 0) (= main_~q~0 4))} is VALID [2022-04-07 13:04:09,407 INFO L290 TraceCheckUtils]: 19: Hoare triple {2571#(and (not (<= (mod main_~q~0 4294967296) (mod main_~r~0 4294967296))) (= main_~p~0 0) (= main_~q~0 4))} assume !!(#t~post6 < 20);havoc #t~post6; {2571#(and (not (<= (mod main_~q~0 4294967296) (mod main_~r~0 4294967296))) (= main_~p~0 0) (= main_~q~0 4))} is VALID [2022-04-07 13:04:09,407 INFO L272 TraceCheckUtils]: 20: Hoare triple {2571#(and (not (<= (mod main_~q~0 4294967296) (mod main_~r~0 4294967296))) (= main_~p~0 0) (= main_~q~0 4))} call __VERIFIER_assert((if ~r~0 % 4294967296 < (2 * ~p~0 + ~q~0) % 4294967296 then 1 else 0)); {2581#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-07 13:04:09,408 INFO L290 TraceCheckUtils]: 21: Hoare triple {2581#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {2585#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-07 13:04:09,408 INFO L290 TraceCheckUtils]: 22: Hoare triple {2585#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2502#false} is VALID [2022-04-07 13:04:09,408 INFO L290 TraceCheckUtils]: 23: Hoare triple {2502#false} assume !false; {2502#false} is VALID [2022-04-07 13:04:09,408 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-07 13:04:09,408 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-07 13:04:09,629 INFO L290 TraceCheckUtils]: 23: Hoare triple {2502#false} assume !false; {2502#false} is VALID [2022-04-07 13:04:09,629 INFO L290 TraceCheckUtils]: 22: Hoare triple {2585#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2502#false} is VALID [2022-04-07 13:04:09,630 INFO L290 TraceCheckUtils]: 21: Hoare triple {2581#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {2585#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-07 13:04:09,644 INFO L272 TraceCheckUtils]: 20: Hoare triple {2601#(< (mod main_~r~0 4294967296) (mod (+ (* main_~p~0 2) main_~q~0) 4294967296))} call __VERIFIER_assert((if ~r~0 % 4294967296 < (2 * ~p~0 + ~q~0) % 4294967296 then 1 else 0)); {2581#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-07 13:04:09,644 INFO L290 TraceCheckUtils]: 19: Hoare triple {2601#(< (mod main_~r~0 4294967296) (mod (+ (* main_~p~0 2) main_~q~0) 4294967296))} assume !!(#t~post6 < 20);havoc #t~post6; {2601#(< (mod main_~r~0 4294967296) (mod (+ (* main_~p~0 2) main_~q~0) 4294967296))} is VALID [2022-04-07 13:04:09,645 INFO L290 TraceCheckUtils]: 18: Hoare triple {2601#(< (mod main_~r~0 4294967296) (mod (+ (* main_~p~0 2) main_~q~0) 4294967296))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {2601#(< (mod main_~r~0 4294967296) (mod (+ (* main_~p~0 2) main_~q~0) 4294967296))} is VALID [2022-04-07 13:04:09,646 INFO L290 TraceCheckUtils]: 17: Hoare triple {2611#(or (<= (mod main_~q~0 4294967296) (mod main_~n~0 4294967296)) (< (mod main_~r~0 4294967296) (mod (+ (* main_~p~0 2) main_~q~0) 4294967296)))} assume !(~q~0 % 4294967296 <= ~n~0 % 4294967296); {2601#(< (mod main_~r~0 4294967296) (mod (+ (* main_~p~0 2) main_~q~0) 4294967296))} is VALID [2022-04-07 13:04:09,647 INFO L290 TraceCheckUtils]: 16: Hoare triple {2611#(or (<= (mod main_~q~0 4294967296) (mod main_~n~0 4294967296)) (< (mod main_~r~0 4294967296) (mod (+ (* main_~p~0 2) main_~q~0) 4294967296)))} assume !!(#t~post5 < 20);havoc #t~post5; {2611#(or (<= (mod main_~q~0 4294967296) (mod main_~n~0 4294967296)) (< (mod main_~r~0 4294967296) (mod (+ (* main_~p~0 2) main_~q~0) 4294967296)))} is VALID [2022-04-07 13:04:09,648 INFO L290 TraceCheckUtils]: 15: Hoare triple {2611#(or (<= (mod main_~q~0 4294967296) (mod main_~n~0 4294967296)) (< (mod main_~r~0 4294967296) (mod (+ (* main_~p~0 2) main_~q~0) 4294967296)))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {2611#(or (<= (mod main_~q~0 4294967296) (mod main_~n~0 4294967296)) (< (mod main_~r~0 4294967296) (mod (+ (* main_~p~0 2) main_~q~0) 4294967296)))} is VALID [2022-04-07 13:04:09,662 INFO L290 TraceCheckUtils]: 14: Hoare triple {2621#(or (<= (mod (* main_~q~0 4) 4294967296) (mod main_~n~0 4294967296)) (< (mod main_~r~0 4294967296) (mod (+ (* main_~p~0 2) (* main_~q~0 4)) 4294967296)))} assume !!(~q~0 % 4294967296 <= ~n~0 % 4294967296);~q~0 := 4 * ~q~0; {2611#(or (<= (mod main_~q~0 4294967296) (mod main_~n~0 4294967296)) (< (mod main_~r~0 4294967296) (mod (+ (* main_~p~0 2) main_~q~0) 4294967296)))} is VALID [2022-04-07 13:04:09,663 INFO L290 TraceCheckUtils]: 13: Hoare triple {2621#(or (<= (mod (* main_~q~0 4) 4294967296) (mod main_~n~0 4294967296)) (< (mod main_~r~0 4294967296) (mod (+ (* main_~p~0 2) (* main_~q~0 4)) 4294967296)))} assume !!(#t~post5 < 20);havoc #t~post5; {2621#(or (<= (mod (* main_~q~0 4) 4294967296) (mod main_~n~0 4294967296)) (< (mod main_~r~0 4294967296) (mod (+ (* main_~p~0 2) (* main_~q~0 4)) 4294967296)))} is VALID [2022-04-07 13:04:09,663 INFO L290 TraceCheckUtils]: 12: Hoare triple {2621#(or (<= (mod (* main_~q~0 4) 4294967296) (mod main_~n~0 4294967296)) (< (mod main_~r~0 4294967296) (mod (+ (* main_~p~0 2) (* main_~q~0 4)) 4294967296)))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {2621#(or (<= (mod (* main_~q~0 4) 4294967296) (mod main_~n~0 4294967296)) (< (mod main_~r~0 4294967296) (mod (+ (* main_~p~0 2) (* main_~q~0 4)) 4294967296)))} is VALID [2022-04-07 13:04:09,666 INFO L290 TraceCheckUtils]: 11: Hoare triple {2501#true} ~p~0 := 0;~q~0 := 1;~r~0 := ~n~0;~h~0 := 0; {2621#(or (<= (mod (* main_~q~0 4) 4294967296) (mod main_~n~0 4294967296)) (< (mod main_~r~0 4294967296) (mod (+ (* main_~p~0 2) (* main_~q~0 4)) 4294967296)))} is VALID [2022-04-07 13:04:09,666 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2501#true} {2501#true} #82#return; {2501#true} is VALID [2022-04-07 13:04:09,666 INFO L290 TraceCheckUtils]: 9: Hoare triple {2501#true} assume true; {2501#true} is VALID [2022-04-07 13:04:09,666 INFO L290 TraceCheckUtils]: 8: Hoare triple {2501#true} assume !(0 == ~cond); {2501#true} is VALID [2022-04-07 13:04:09,666 INFO L290 TraceCheckUtils]: 7: Hoare triple {2501#true} ~cond := #in~cond; {2501#true} is VALID [2022-04-07 13:04:09,666 INFO L272 TraceCheckUtils]: 6: Hoare triple {2501#true} call assume_abort_if_not((if ~n~0 % 4294967296 < 1073741823 then 1 else 0)); {2501#true} is VALID [2022-04-07 13:04:09,666 INFO L290 TraceCheckUtils]: 5: Hoare triple {2501#true} havoc ~n~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~h~0;~n~0 := #t~nondet4;havoc #t~nondet4; {2501#true} is VALID [2022-04-07 13:04:09,666 INFO L272 TraceCheckUtils]: 4: Hoare triple {2501#true} call #t~ret7 := main(); {2501#true} is VALID [2022-04-07 13:04:09,666 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2501#true} {2501#true} #102#return; {2501#true} is VALID [2022-04-07 13:04:09,666 INFO L290 TraceCheckUtils]: 2: Hoare triple {2501#true} assume true; {2501#true} is VALID [2022-04-07 13:04:09,666 INFO L290 TraceCheckUtils]: 1: Hoare triple {2501#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {2501#true} is VALID [2022-04-07 13:04:09,667 INFO L272 TraceCheckUtils]: 0: Hoare triple {2501#true} call ULTIMATE.init(); {2501#true} is VALID [2022-04-07 13:04:09,667 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-07 13:04:09,667 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2012180444] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-07 13:04:09,667 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-07 13:04:09,667 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 15 [2022-04-07 13:04:09,667 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1151916913] [2022-04-07 13:04:09,667 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-07 13:04:09,667 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 2.4) internal successors, (36), 12 states have internal predecessors, (36), 4 states have call successors, (7), 4 states have call predecessors, (7), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 24 [2022-04-07 13:04:09,668 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 13:04:09,668 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 15 states, 15 states have (on average 2.4) internal successors, (36), 12 states have internal predecessors, (36), 4 states have call successors, (7), 4 states have call predecessors, (7), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-07 13:04:09,706 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 45 edges. 45 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 13:04:09,706 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-04-07 13:04:09,706 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 13:04:09,706 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-04-07 13:04:09,706 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=166, Unknown=0, NotChecked=0, Total=210 [2022-04-07 13:04:09,707 INFO L87 Difference]: Start difference. First operand 116 states and 161 transitions. Second operand has 15 states, 15 states have (on average 2.4) internal successors, (36), 12 states have internal predecessors, (36), 4 states have call successors, (7), 4 states have call predecessors, (7), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-07 13:04:14,934 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-07 13:04:16,994 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-07 13:04:18,995 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-07 13:04:21,339 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-07 13:04:26,731 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-07 13:04:28,733 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-07 13:04:37,632 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-07 13:04:39,762 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.13s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-07 13:04:44,024 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-07 13:04:46,153 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.13s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-07 13:04:48,358 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.20s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-07 13:04:51,294 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-07 13:04:53,485 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-07 13:04:55,629 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-07 13:05:14,019 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.49s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-07 13:05:23,425 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-07 13:05:33,704 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-07 13:05:42,778 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-07 13:05:48,611 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.42s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-07 13:06:00,138 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-07 13:06:10,205 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-07 13:06:12,389 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.18s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-07 13:06:17,309 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-07 13:06:19,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 13:06:19,395 INFO L93 Difference]: Finished difference Result 200 states and 290 transitions. [2022-04-07 13:06:19,395 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-04-07 13:06:19,395 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 2.4) internal successors, (36), 12 states have internal predecessors, (36), 4 states have call successors, (7), 4 states have call predecessors, (7), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 24 [2022-04-07 13:06:19,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 13:06:19,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 15 states have (on average 2.4) internal successors, (36), 12 states have internal predecessors, (36), 4 states have call successors, (7), 4 states have call predecessors, (7), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-07 13:06:19,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 169 transitions. [2022-04-07 13:06:19,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 15 states have (on average 2.4) internal successors, (36), 12 states have internal predecessors, (36), 4 states have call successors, (7), 4 states have call predecessors, (7), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-07 13:06:19,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 169 transitions. [2022-04-07 13:06:19,401 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 14 states and 169 transitions. [2022-04-07 13:06:22,147 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 169 edges. 168 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-07 13:06:22,150 INFO L225 Difference]: With dead ends: 200 [2022-04-07 13:06:22,150 INFO L226 Difference]: Without dead ends: 185 [2022-04-07 13:06:22,151 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 43 SyntacticMatches, 2 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=95, Invalid=367, Unknown=0, NotChecked=0, Total=462 [2022-04-07 13:06:22,151 INFO L913 BasicCegarLoop]: 64 mSDtfsCounter, 64 mSDsluCounter, 95 mSDsCounter, 0 mSdLazyCounter, 590 mSolverCounterSat, 157 mSolverCounterUnsat, 21 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 68.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 81 SdHoareTripleChecker+Valid, 159 SdHoareTripleChecker+Invalid, 768 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 157 IncrementalHoareTripleChecker+Valid, 590 IncrementalHoareTripleChecker+Invalid, 21 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 69.5s IncrementalHoareTripleChecker+Time [2022-04-07 13:06:22,151 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [81 Valid, 159 Invalid, 768 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [157 Valid, 590 Invalid, 21 Unknown, 0 Unchecked, 69.5s Time] [2022-04-07 13:06:22,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2022-04-07 13:06:22,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 171. [2022-04-07 13:06:22,226 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 13:06:22,226 INFO L82 GeneralOperation]: Start isEquivalent. First operand 185 states. Second operand has 171 states, 95 states have (on average 1.2736842105263158) internal successors, (121), 102 states have internal predecessors, (121), 62 states have call successors, (62), 14 states have call predecessors, (62), 13 states have return successors, (57), 54 states have call predecessors, (57), 57 states have call successors, (57) [2022-04-07 13:06:22,227 INFO L74 IsIncluded]: Start isIncluded. First operand 185 states. Second operand has 171 states, 95 states have (on average 1.2736842105263158) internal successors, (121), 102 states have internal predecessors, (121), 62 states have call successors, (62), 14 states have call predecessors, (62), 13 states have return successors, (57), 54 states have call predecessors, (57), 57 states have call successors, (57) [2022-04-07 13:06:22,227 INFO L87 Difference]: Start difference. First operand 185 states. Second operand has 171 states, 95 states have (on average 1.2736842105263158) internal successors, (121), 102 states have internal predecessors, (121), 62 states have call successors, (62), 14 states have call predecessors, (62), 13 states have return successors, (57), 54 states have call predecessors, (57), 57 states have call successors, (57) [2022-04-07 13:06:22,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 13:06:22,232 INFO L93 Difference]: Finished difference Result 185 states and 263 transitions. [2022-04-07 13:06:22,232 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 263 transitions. [2022-04-07 13:06:22,233 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 13:06:22,233 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 13:06:22,233 INFO L74 IsIncluded]: Start isIncluded. First operand has 171 states, 95 states have (on average 1.2736842105263158) internal successors, (121), 102 states have internal predecessors, (121), 62 states have call successors, (62), 14 states have call predecessors, (62), 13 states have return successors, (57), 54 states have call predecessors, (57), 57 states have call successors, (57) Second operand 185 states. [2022-04-07 13:06:22,234 INFO L87 Difference]: Start difference. First operand has 171 states, 95 states have (on average 1.2736842105263158) internal successors, (121), 102 states have internal predecessors, (121), 62 states have call successors, (62), 14 states have call predecessors, (62), 13 states have return successors, (57), 54 states have call predecessors, (57), 57 states have call successors, (57) Second operand 185 states. [2022-04-07 13:06:22,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 13:06:22,239 INFO L93 Difference]: Finished difference Result 185 states and 263 transitions. [2022-04-07 13:06:22,239 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 263 transitions. [2022-04-07 13:06:22,240 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 13:06:22,240 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 13:06:22,240 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 13:06:22,240 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 13:06:22,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 171 states, 95 states have (on average 1.2736842105263158) internal successors, (121), 102 states have internal predecessors, (121), 62 states have call successors, (62), 14 states have call predecessors, (62), 13 states have return successors, (57), 54 states have call predecessors, (57), 57 states have call successors, (57) [2022-04-07 13:06:22,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 240 transitions. [2022-04-07 13:06:22,245 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 240 transitions. Word has length 24 [2022-04-07 13:06:22,245 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 13:06:22,245 INFO L478 AbstractCegarLoop]: Abstraction has 171 states and 240 transitions. [2022-04-07 13:06:22,245 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 2.4) internal successors, (36), 12 states have internal predecessors, (36), 4 states have call successors, (7), 4 states have call predecessors, (7), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-07 13:06:22,245 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 240 transitions. [2022-04-07 13:06:22,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-04-07 13:06:22,245 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 13:06:22,245 INFO L499 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 13:06:22,262 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-07 13:06:22,455 WARN L460 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-07 13:06:22,455 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 13:06:22,456 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 13:06:22,456 INFO L85 PathProgramCache]: Analyzing trace with hash -45171523, now seen corresponding path program 1 times [2022-04-07 13:06:22,456 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 13:06:22,456 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [820871195] [2022-04-07 13:06:22,456 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 13:06:22,456 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 13:06:22,478 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-07 13:06:22,479 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [20024099] [2022-04-07 13:06:22,479 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 13:06:22,479 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 13:06:22,479 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 13:06:22,490 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-07 13:06:22,491 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-07 13:06:22,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 13:06:22,606 INFO L263 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-07 13:06:22,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 13:06:22,616 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-07 13:06:22,755 INFO L272 TraceCheckUtils]: 0: Hoare triple {3606#true} call ULTIMATE.init(); {3606#true} is VALID [2022-04-07 13:06:22,755 INFO L290 TraceCheckUtils]: 1: Hoare triple {3606#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {3606#true} is VALID [2022-04-07 13:06:22,755 INFO L290 TraceCheckUtils]: 2: Hoare triple {3606#true} assume true; {3606#true} is VALID [2022-04-07 13:06:22,755 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3606#true} {3606#true} #102#return; {3606#true} is VALID [2022-04-07 13:06:22,755 INFO L272 TraceCheckUtils]: 4: Hoare triple {3606#true} call #t~ret7 := main(); {3606#true} is VALID [2022-04-07 13:06:22,755 INFO L290 TraceCheckUtils]: 5: Hoare triple {3606#true} havoc ~n~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~h~0;~n~0 := #t~nondet4;havoc #t~nondet4; {3606#true} is VALID [2022-04-07 13:06:22,755 INFO L272 TraceCheckUtils]: 6: Hoare triple {3606#true} call assume_abort_if_not((if ~n~0 % 4294967296 < 1073741823 then 1 else 0)); {3606#true} is VALID [2022-04-07 13:06:22,755 INFO L290 TraceCheckUtils]: 7: Hoare triple {3606#true} ~cond := #in~cond; {3606#true} is VALID [2022-04-07 13:06:22,755 INFO L290 TraceCheckUtils]: 8: Hoare triple {3606#true} assume !(0 == ~cond); {3606#true} is VALID [2022-04-07 13:06:22,756 INFO L290 TraceCheckUtils]: 9: Hoare triple {3606#true} assume true; {3606#true} is VALID [2022-04-07 13:06:22,756 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {3606#true} {3606#true} #82#return; {3606#true} is VALID [2022-04-07 13:06:22,759 INFO L290 TraceCheckUtils]: 11: Hoare triple {3606#true} ~p~0 := 0;~q~0 := 1;~r~0 := ~n~0;~h~0 := 0; {3644#(and (= main_~p~0 0) (= main_~h~0 0) (= main_~q~0 1))} is VALID [2022-04-07 13:06:22,759 INFO L290 TraceCheckUtils]: 12: Hoare triple {3644#(and (= main_~p~0 0) (= main_~h~0 0) (= main_~q~0 1))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {3644#(and (= main_~p~0 0) (= main_~h~0 0) (= main_~q~0 1))} is VALID [2022-04-07 13:06:22,760 INFO L290 TraceCheckUtils]: 13: Hoare triple {3644#(and (= main_~p~0 0) (= main_~h~0 0) (= main_~q~0 1))} assume !!(#t~post5 < 20);havoc #t~post5; {3644#(and (= main_~p~0 0) (= main_~h~0 0) (= main_~q~0 1))} is VALID [2022-04-07 13:06:22,760 INFO L290 TraceCheckUtils]: 14: Hoare triple {3644#(and (= main_~p~0 0) (= main_~h~0 0) (= main_~q~0 1))} assume !(~q~0 % 4294967296 <= ~n~0 % 4294967296); {3644#(and (= main_~p~0 0) (= main_~h~0 0) (= main_~q~0 1))} is VALID [2022-04-07 13:06:22,760 INFO L290 TraceCheckUtils]: 15: Hoare triple {3644#(and (= main_~p~0 0) (= main_~h~0 0) (= main_~q~0 1))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {3644#(and (= main_~p~0 0) (= main_~h~0 0) (= main_~q~0 1))} is VALID [2022-04-07 13:06:22,761 INFO L290 TraceCheckUtils]: 16: Hoare triple {3644#(and (= main_~p~0 0) (= main_~h~0 0) (= main_~q~0 1))} assume !!(#t~post6 < 20);havoc #t~post6; {3644#(and (= main_~p~0 0) (= main_~h~0 0) (= main_~q~0 1))} is VALID [2022-04-07 13:06:22,761 INFO L272 TraceCheckUtils]: 17: Hoare triple {3644#(and (= main_~p~0 0) (= main_~h~0 0) (= main_~q~0 1))} call __VERIFIER_assert((if ~r~0 % 4294967296 < (2 * ~p~0 + ~q~0) % 4294967296 then 1 else 0)); {3606#true} is VALID [2022-04-07 13:06:22,761 INFO L290 TraceCheckUtils]: 18: Hoare triple {3606#true} ~cond := #in~cond; {3606#true} is VALID [2022-04-07 13:06:22,761 INFO L290 TraceCheckUtils]: 19: Hoare triple {3606#true} assume !(0 == ~cond); {3606#true} is VALID [2022-04-07 13:06:22,761 INFO L290 TraceCheckUtils]: 20: Hoare triple {3606#true} assume true; {3606#true} is VALID [2022-04-07 13:06:22,762 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {3606#true} {3644#(and (= main_~p~0 0) (= main_~h~0 0) (= main_~q~0 1))} #84#return; {3644#(and (= main_~p~0 0) (= main_~h~0 0) (= main_~q~0 1))} is VALID [2022-04-07 13:06:22,762 INFO L272 TraceCheckUtils]: 22: Hoare triple {3644#(and (= main_~p~0 0) (= main_~h~0 0) (= main_~q~0 1))} call __VERIFIER_assert((if (~p~0 * ~p~0 + ~r~0 * ~q~0) % 4294967296 == ~n~0 * ~q~0 % 4294967296 then 1 else 0)); {3606#true} is VALID [2022-04-07 13:06:22,762 INFO L290 TraceCheckUtils]: 23: Hoare triple {3606#true} ~cond := #in~cond; {3606#true} is VALID [2022-04-07 13:06:22,762 INFO L290 TraceCheckUtils]: 24: Hoare triple {3606#true} assume !(0 == ~cond); {3606#true} is VALID [2022-04-07 13:06:22,762 INFO L290 TraceCheckUtils]: 25: Hoare triple {3606#true} assume true; {3606#true} is VALID [2022-04-07 13:06:22,762 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {3606#true} {3644#(and (= main_~p~0 0) (= main_~h~0 0) (= main_~q~0 1))} #86#return; {3644#(and (= main_~p~0 0) (= main_~h~0 0) (= main_~q~0 1))} is VALID [2022-04-07 13:06:22,763 INFO L272 TraceCheckUtils]: 27: Hoare triple {3644#(and (= main_~p~0 0) (= main_~h~0 0) (= main_~q~0 1))} call __VERIFIER_assert((if 0 == (~h~0 * ~h~0 * ~h~0 - 12 * ~h~0 * ~n~0 * ~q~0 + 16 * ~n~0 * ~p~0 * ~q~0 - ~h~0 * ~q~0 * ~q~0 - 4 * ~p~0 * ~q~0 * ~q~0 + 12 * ~h~0 * ~q~0 * ~r~0 - 16 * ~p~0 * ~q~0 * ~r~0) % 4294967296 then 1 else 0)); {3693#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-07 13:06:22,763 INFO L290 TraceCheckUtils]: 28: Hoare triple {3693#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {3697#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-07 13:06:22,764 INFO L290 TraceCheckUtils]: 29: Hoare triple {3697#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {3607#false} is VALID [2022-04-07 13:06:22,764 INFO L290 TraceCheckUtils]: 30: Hoare triple {3607#false} assume !false; {3607#false} is VALID [2022-04-07 13:06:22,764 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-07 13:06:22,764 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-07 13:06:22,764 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 13:06:22,764 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [820871195] [2022-04-07 13:06:22,764 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-07 13:06:22,764 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [20024099] [2022-04-07 13:06:22,764 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [20024099] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 13:06:22,764 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 13:06:22,764 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-07 13:06:22,765 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1029356951] [2022-04-07 13:06:22,765 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 13:06:22,765 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 31 [2022-04-07 13:06:22,765 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 13:06:22,765 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-07 13:06:22,789 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 28 edges. 28 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 13:06:22,789 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-07 13:06:22,789 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 13:06:22,789 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-07 13:06:22,789 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-07 13:06:22,790 INFO L87 Difference]: Start difference. First operand 171 states and 240 transitions. Second operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-07 13:06:28,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 13:06:28,699 INFO L93 Difference]: Finished difference Result 182 states and 249 transitions. [2022-04-07 13:06:28,699 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-07 13:06:28,699 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 31 [2022-04-07 13:06:28,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 13:06:28,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-07 13:06:28,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 71 transitions. [2022-04-07 13:06:28,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-07 13:06:28,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 71 transitions. [2022-04-07 13:06:28,701 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 71 transitions. [2022-04-07 13:06:28,767 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 71 edges. 71 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 13:06:28,769 INFO L225 Difference]: With dead ends: 182 [2022-04-07 13:06:28,770 INFO L226 Difference]: Without dead ends: 150 [2022-04-07 13:06:28,770 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 27 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-07 13:06:28,770 INFO L913 BasicCegarLoop]: 49 mSDtfsCounter, 6 mSDsluCounter, 105 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 154 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2022-04-07 13:06:28,770 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [10 Valid, 154 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2022-04-07 13:06:28,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2022-04-07 13:06:28,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 150. [2022-04-07 13:06:28,824 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 13:06:28,825 INFO L82 GeneralOperation]: Start isEquivalent. First operand 150 states. Second operand has 150 states, 83 states have (on average 1.2891566265060241) internal successors, (107), 90 states have internal predecessors, (107), 56 states have call successors, (56), 11 states have call predecessors, (56), 10 states have return successors, (51), 48 states have call predecessors, (51), 51 states have call successors, (51) [2022-04-07 13:06:28,825 INFO L74 IsIncluded]: Start isIncluded. First operand 150 states. Second operand has 150 states, 83 states have (on average 1.2891566265060241) internal successors, (107), 90 states have internal predecessors, (107), 56 states have call successors, (56), 11 states have call predecessors, (56), 10 states have return successors, (51), 48 states have call predecessors, (51), 51 states have call successors, (51) [2022-04-07 13:06:28,825 INFO L87 Difference]: Start difference. First operand 150 states. Second operand has 150 states, 83 states have (on average 1.2891566265060241) internal successors, (107), 90 states have internal predecessors, (107), 56 states have call successors, (56), 11 states have call predecessors, (56), 10 states have return successors, (51), 48 states have call predecessors, (51), 51 states have call successors, (51) [2022-04-07 13:06:28,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 13:06:28,829 INFO L93 Difference]: Finished difference Result 150 states and 214 transitions. [2022-04-07 13:06:28,829 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 214 transitions. [2022-04-07 13:06:28,830 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 13:06:28,830 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 13:06:28,830 INFO L74 IsIncluded]: Start isIncluded. First operand has 150 states, 83 states have (on average 1.2891566265060241) internal successors, (107), 90 states have internal predecessors, (107), 56 states have call successors, (56), 11 states have call predecessors, (56), 10 states have return successors, (51), 48 states have call predecessors, (51), 51 states have call successors, (51) Second operand 150 states. [2022-04-07 13:06:28,831 INFO L87 Difference]: Start difference. First operand has 150 states, 83 states have (on average 1.2891566265060241) internal successors, (107), 90 states have internal predecessors, (107), 56 states have call successors, (56), 11 states have call predecessors, (56), 10 states have return successors, (51), 48 states have call predecessors, (51), 51 states have call successors, (51) Second operand 150 states. [2022-04-07 13:06:28,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 13:06:28,835 INFO L93 Difference]: Finished difference Result 150 states and 214 transitions. [2022-04-07 13:06:28,835 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 214 transitions. [2022-04-07 13:06:28,836 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 13:06:28,836 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 13:06:28,836 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 13:06:28,836 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 13:06:28,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 150 states, 83 states have (on average 1.2891566265060241) internal successors, (107), 90 states have internal predecessors, (107), 56 states have call successors, (56), 11 states have call predecessors, (56), 10 states have return successors, (51), 48 states have call predecessors, (51), 51 states have call successors, (51) [2022-04-07 13:06:28,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 214 transitions. [2022-04-07 13:06:28,840 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 214 transitions. Word has length 31 [2022-04-07 13:06:28,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 13:06:28,840 INFO L478 AbstractCegarLoop]: Abstraction has 150 states and 214 transitions. [2022-04-07 13:06:28,840 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-07 13:06:28,840 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 214 transitions. [2022-04-07 13:06:28,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-04-07 13:06:28,842 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 13:06:28,842 INFO L499 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 13:06:28,849 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-07 13:06:29,050 WARN L460 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-07 13:06:29,050 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 13:06:29,051 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 13:06:29,051 INFO L85 PathProgramCache]: Analyzing trace with hash -1547125783, now seen corresponding path program 1 times [2022-04-07 13:06:29,051 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 13:06:29,051 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [414818172] [2022-04-07 13:06:29,051 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 13:06:29,051 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 13:06:29,070 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-07 13:06:29,070 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1269940658] [2022-04-07 13:06:29,070 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 13:06:29,070 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 13:06:29,070 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 13:06:29,071 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-07 13:06:29,072 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-07 13:06:29,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 13:06:29,142 INFO L263 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-07 13:06:29,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 13:06:29,151 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-07 13:06:29,315 INFO L272 TraceCheckUtils]: 0: Hoare triple {4495#true} call ULTIMATE.init(); {4495#true} is VALID [2022-04-07 13:06:29,316 INFO L290 TraceCheckUtils]: 1: Hoare triple {4495#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {4495#true} is VALID [2022-04-07 13:06:29,316 INFO L290 TraceCheckUtils]: 2: Hoare triple {4495#true} assume true; {4495#true} is VALID [2022-04-07 13:06:29,316 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4495#true} {4495#true} #102#return; {4495#true} is VALID [2022-04-07 13:06:29,316 INFO L272 TraceCheckUtils]: 4: Hoare triple {4495#true} call #t~ret7 := main(); {4495#true} is VALID [2022-04-07 13:06:29,316 INFO L290 TraceCheckUtils]: 5: Hoare triple {4495#true} havoc ~n~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~h~0;~n~0 := #t~nondet4;havoc #t~nondet4; {4495#true} is VALID [2022-04-07 13:06:29,316 INFO L272 TraceCheckUtils]: 6: Hoare triple {4495#true} call assume_abort_if_not((if ~n~0 % 4294967296 < 1073741823 then 1 else 0)); {4495#true} is VALID [2022-04-07 13:06:29,316 INFO L290 TraceCheckUtils]: 7: Hoare triple {4495#true} ~cond := #in~cond; {4495#true} is VALID [2022-04-07 13:06:29,316 INFO L290 TraceCheckUtils]: 8: Hoare triple {4495#true} assume !(0 == ~cond); {4495#true} is VALID [2022-04-07 13:06:29,316 INFO L290 TraceCheckUtils]: 9: Hoare triple {4495#true} assume true; {4495#true} is VALID [2022-04-07 13:06:29,316 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {4495#true} {4495#true} #82#return; {4495#true} is VALID [2022-04-07 13:06:29,318 INFO L290 TraceCheckUtils]: 11: Hoare triple {4495#true} ~p~0 := 0;~q~0 := 1;~r~0 := ~n~0;~h~0 := 0; {4533#(and (= main_~p~0 0) (= main_~h~0 0))} is VALID [2022-04-07 13:06:29,318 INFO L290 TraceCheckUtils]: 12: Hoare triple {4533#(and (= main_~p~0 0) (= main_~h~0 0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {4533#(and (= main_~p~0 0) (= main_~h~0 0))} is VALID [2022-04-07 13:06:29,318 INFO L290 TraceCheckUtils]: 13: Hoare triple {4533#(and (= main_~p~0 0) (= main_~h~0 0))} assume !!(#t~post5 < 20);havoc #t~post5; {4533#(and (= main_~p~0 0) (= main_~h~0 0))} is VALID [2022-04-07 13:06:29,319 INFO L290 TraceCheckUtils]: 14: Hoare triple {4533#(and (= main_~p~0 0) (= main_~h~0 0))} assume !!(~q~0 % 4294967296 <= ~n~0 % 4294967296);~q~0 := 4 * ~q~0; {4533#(and (= main_~p~0 0) (= main_~h~0 0))} is VALID [2022-04-07 13:06:29,319 INFO L290 TraceCheckUtils]: 15: Hoare triple {4533#(and (= main_~p~0 0) (= main_~h~0 0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {4533#(and (= main_~p~0 0) (= main_~h~0 0))} is VALID [2022-04-07 13:06:29,320 INFO L290 TraceCheckUtils]: 16: Hoare triple {4533#(and (= main_~p~0 0) (= main_~h~0 0))} assume !!(#t~post5 < 20);havoc #t~post5; {4533#(and (= main_~p~0 0) (= main_~h~0 0))} is VALID [2022-04-07 13:06:29,320 INFO L290 TraceCheckUtils]: 17: Hoare triple {4533#(and (= main_~p~0 0) (= main_~h~0 0))} assume !(~q~0 % 4294967296 <= ~n~0 % 4294967296); {4533#(and (= main_~p~0 0) (= main_~h~0 0))} is VALID [2022-04-07 13:06:29,320 INFO L290 TraceCheckUtils]: 18: Hoare triple {4533#(and (= main_~p~0 0) (= main_~h~0 0))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {4533#(and (= main_~p~0 0) (= main_~h~0 0))} is VALID [2022-04-07 13:06:29,321 INFO L290 TraceCheckUtils]: 19: Hoare triple {4533#(and (= main_~p~0 0) (= main_~h~0 0))} assume !!(#t~post6 < 20);havoc #t~post6; {4533#(and (= main_~p~0 0) (= main_~h~0 0))} is VALID [2022-04-07 13:06:29,321 INFO L272 TraceCheckUtils]: 20: Hoare triple {4533#(and (= main_~p~0 0) (= main_~h~0 0))} call __VERIFIER_assert((if ~r~0 % 4294967296 < (2 * ~p~0 + ~q~0) % 4294967296 then 1 else 0)); {4495#true} is VALID [2022-04-07 13:06:29,321 INFO L290 TraceCheckUtils]: 21: Hoare triple {4495#true} ~cond := #in~cond; {4495#true} is VALID [2022-04-07 13:06:29,321 INFO L290 TraceCheckUtils]: 22: Hoare triple {4495#true} assume !(0 == ~cond); {4495#true} is VALID [2022-04-07 13:06:29,321 INFO L290 TraceCheckUtils]: 23: Hoare triple {4495#true} assume true; {4495#true} is VALID [2022-04-07 13:06:29,321 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {4495#true} {4533#(and (= main_~p~0 0) (= main_~h~0 0))} #84#return; {4533#(and (= main_~p~0 0) (= main_~h~0 0))} is VALID [2022-04-07 13:06:29,321 INFO L272 TraceCheckUtils]: 25: Hoare triple {4533#(and (= main_~p~0 0) (= main_~h~0 0))} call __VERIFIER_assert((if (~p~0 * ~p~0 + ~r~0 * ~q~0) % 4294967296 == ~n~0 * ~q~0 % 4294967296 then 1 else 0)); {4495#true} is VALID [2022-04-07 13:06:29,322 INFO L290 TraceCheckUtils]: 26: Hoare triple {4495#true} ~cond := #in~cond; {4495#true} is VALID [2022-04-07 13:06:29,322 INFO L290 TraceCheckUtils]: 27: Hoare triple {4495#true} assume !(0 == ~cond); {4495#true} is VALID [2022-04-07 13:06:29,322 INFO L290 TraceCheckUtils]: 28: Hoare triple {4495#true} assume true; {4495#true} is VALID [2022-04-07 13:06:29,322 INFO L284 TraceCheckUtils]: 29: Hoare quadruple {4495#true} {4533#(and (= main_~p~0 0) (= main_~h~0 0))} #86#return; {4533#(and (= main_~p~0 0) (= main_~h~0 0))} is VALID [2022-04-07 13:06:29,323 INFO L272 TraceCheckUtils]: 30: Hoare triple {4533#(and (= main_~p~0 0) (= main_~h~0 0))} call __VERIFIER_assert((if 0 == (~h~0 * ~h~0 * ~h~0 - 12 * ~h~0 * ~n~0 * ~q~0 + 16 * ~n~0 * ~p~0 * ~q~0 - ~h~0 * ~q~0 * ~q~0 - 4 * ~p~0 * ~q~0 * ~q~0 + 12 * ~h~0 * ~q~0 * ~r~0 - 16 * ~p~0 * ~q~0 * ~r~0) % 4294967296 then 1 else 0)); {4591#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-07 13:06:29,323 INFO L290 TraceCheckUtils]: 31: Hoare triple {4591#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {4595#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-07 13:06:29,324 INFO L290 TraceCheckUtils]: 32: Hoare triple {4595#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {4496#false} is VALID [2022-04-07 13:06:29,324 INFO L290 TraceCheckUtils]: 33: Hoare triple {4496#false} assume !false; {4496#false} is VALID [2022-04-07 13:06:29,324 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-04-07 13:06:29,324 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-07 13:06:29,324 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 13:06:29,324 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [414818172] [2022-04-07 13:06:29,324 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-07 13:06:29,324 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1269940658] [2022-04-07 13:06:29,324 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1269940658] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 13:06:29,324 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 13:06:29,324 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-07 13:06:29,325 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [468239436] [2022-04-07 13:06:29,325 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 13:06:29,325 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.8) internal successors, (19), 4 states have internal predecessors, (19), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 34 [2022-04-07 13:06:29,325 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 13:06:29,325 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 3.8) internal successors, (19), 4 states have internal predecessors, (19), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-07 13:06:29,352 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 29 edges. 29 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 13:06:29,352 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-07 13:06:29,352 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 13:06:29,352 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-07 13:06:29,353 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-07 13:06:29,353 INFO L87 Difference]: Start difference. First operand 150 states and 214 transitions. Second operand has 5 states, 5 states have (on average 3.8) internal successors, (19), 4 states have internal predecessors, (19), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-07 13:06:35,533 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-07 13:06:38,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 13:06:38,331 INFO L93 Difference]: Finished difference Result 186 states and 254 transitions. [2022-04-07 13:06:38,331 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-07 13:06:38,331 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.8) internal successors, (19), 4 states have internal predecessors, (19), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 34 [2022-04-07 13:06:38,331 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 13:06:38,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.8) internal successors, (19), 4 states have internal predecessors, (19), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-07 13:06:38,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 69 transitions. [2022-04-07 13:06:38,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.8) internal successors, (19), 4 states have internal predecessors, (19), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-07 13:06:38,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 69 transitions. [2022-04-07 13:06:38,339 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 69 transitions. [2022-04-07 13:06:38,408 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 69 edges. 69 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 13:06:38,411 INFO L225 Difference]: With dead ends: 186 [2022-04-07 13:06:38,411 INFO L226 Difference]: Without dead ends: 182 [2022-04-07 13:06:38,412 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 30 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-07 13:06:38,412 INFO L913 BasicCegarLoop]: 50 mSDtfsCounter, 8 mSDsluCounter, 106 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 2 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 156 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2022-04-07 13:06:38,412 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [12 Valid, 156 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 45 Invalid, 1 Unknown, 0 Unchecked, 2.7s Time] [2022-04-07 13:06:38,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2022-04-07 13:06:38,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 175. [2022-04-07 13:06:38,476 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 13:06:38,477 INFO L82 GeneralOperation]: Start isEquivalent. First operand 182 states. Second operand has 175 states, 97 states have (on average 1.1855670103092784) internal successors, (115), 103 states have internal predecessors, (115), 61 states have call successors, (61), 17 states have call predecessors, (61), 16 states have return successors, (57), 54 states have call predecessors, (57), 57 states have call successors, (57) [2022-04-07 13:06:38,477 INFO L74 IsIncluded]: Start isIncluded. First operand 182 states. Second operand has 175 states, 97 states have (on average 1.1855670103092784) internal successors, (115), 103 states have internal predecessors, (115), 61 states have call successors, (61), 17 states have call predecessors, (61), 16 states have return successors, (57), 54 states have call predecessors, (57), 57 states have call successors, (57) [2022-04-07 13:06:38,477 INFO L87 Difference]: Start difference. First operand 182 states. Second operand has 175 states, 97 states have (on average 1.1855670103092784) internal successors, (115), 103 states have internal predecessors, (115), 61 states have call successors, (61), 17 states have call predecessors, (61), 16 states have return successors, (57), 54 states have call predecessors, (57), 57 states have call successors, (57) [2022-04-07 13:06:38,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 13:06:38,482 INFO L93 Difference]: Finished difference Result 182 states and 242 transitions. [2022-04-07 13:06:38,482 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 242 transitions. [2022-04-07 13:06:38,483 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 13:06:38,483 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 13:06:38,483 INFO L74 IsIncluded]: Start isIncluded. First operand has 175 states, 97 states have (on average 1.1855670103092784) internal successors, (115), 103 states have internal predecessors, (115), 61 states have call successors, (61), 17 states have call predecessors, (61), 16 states have return successors, (57), 54 states have call predecessors, (57), 57 states have call successors, (57) Second operand 182 states. [2022-04-07 13:06:38,485 INFO L87 Difference]: Start difference. First operand has 175 states, 97 states have (on average 1.1855670103092784) internal successors, (115), 103 states have internal predecessors, (115), 61 states have call successors, (61), 17 states have call predecessors, (61), 16 states have return successors, (57), 54 states have call predecessors, (57), 57 states have call successors, (57) Second operand 182 states. [2022-04-07 13:06:38,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 13:06:38,501 INFO L93 Difference]: Finished difference Result 182 states and 242 transitions. [2022-04-07 13:06:38,501 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 242 transitions. [2022-04-07 13:06:38,502 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 13:06:38,502 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 13:06:38,502 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 13:06:38,502 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 13:06:38,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 175 states, 97 states have (on average 1.1855670103092784) internal successors, (115), 103 states have internal predecessors, (115), 61 states have call successors, (61), 17 states have call predecessors, (61), 16 states have return successors, (57), 54 states have call predecessors, (57), 57 states have call successors, (57) [2022-04-07 13:06:38,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 233 transitions. [2022-04-07 13:06:38,506 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 233 transitions. Word has length 34 [2022-04-07 13:06:38,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 13:06:38,506 INFO L478 AbstractCegarLoop]: Abstraction has 175 states and 233 transitions. [2022-04-07 13:06:38,506 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.8) internal successors, (19), 4 states have internal predecessors, (19), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-07 13:06:38,506 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 233 transitions. [2022-04-07 13:06:38,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-04-07 13:06:38,506 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 13:06:38,506 INFO L499 BasicCegarLoop]: trace histogram [5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 13:06:38,513 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-07 13:06:38,710 WARN L460 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-07 13:06:38,711 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 13:06:38,712 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 13:06:38,712 INFO L85 PathProgramCache]: Analyzing trace with hash 821435566, now seen corresponding path program 1 times [2022-04-07 13:06:38,712 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 13:06:38,712 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1238435041] [2022-04-07 13:06:38,712 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 13:06:38,712 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 13:06:38,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 13:06:38,807 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 13:06:38,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 13:06:38,815 INFO L290 TraceCheckUtils]: 0: Hoare triple {5512#(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(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {5502#(<= ~counter~0 0)} is VALID [2022-04-07 13:06:38,815 INFO L290 TraceCheckUtils]: 1: Hoare triple {5502#(<= ~counter~0 0)} assume true; {5502#(<= ~counter~0 0)} is VALID [2022-04-07 13:06:38,816 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {5502#(<= ~counter~0 0)} {5497#true} #102#return; {5502#(<= ~counter~0 0)} is VALID [2022-04-07 13:06:38,816 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-07 13:06:38,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 13:06:38,820 INFO L290 TraceCheckUtils]: 0: Hoare triple {5497#true} ~cond := #in~cond; {5497#true} is VALID [2022-04-07 13:06:38,820 INFO L290 TraceCheckUtils]: 1: Hoare triple {5497#true} assume !(0 == ~cond); {5497#true} is VALID [2022-04-07 13:06:38,820 INFO L290 TraceCheckUtils]: 2: Hoare triple {5497#true} assume true; {5497#true} is VALID [2022-04-07 13:06:38,821 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5497#true} {5502#(<= ~counter~0 0)} #82#return; {5502#(<= ~counter~0 0)} is VALID [2022-04-07 13:06:38,821 INFO L272 TraceCheckUtils]: 0: Hoare triple {5497#true} call ULTIMATE.init(); {5512#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-07 13:06:38,822 INFO L290 TraceCheckUtils]: 1: Hoare triple {5512#(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(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {5502#(<= ~counter~0 0)} is VALID [2022-04-07 13:06:38,822 INFO L290 TraceCheckUtils]: 2: Hoare triple {5502#(<= ~counter~0 0)} assume true; {5502#(<= ~counter~0 0)} is VALID [2022-04-07 13:06:38,822 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5502#(<= ~counter~0 0)} {5497#true} #102#return; {5502#(<= ~counter~0 0)} is VALID [2022-04-07 13:06:38,823 INFO L272 TraceCheckUtils]: 4: Hoare triple {5502#(<= ~counter~0 0)} call #t~ret7 := main(); {5502#(<= ~counter~0 0)} is VALID [2022-04-07 13:06:38,823 INFO L290 TraceCheckUtils]: 5: Hoare triple {5502#(<= ~counter~0 0)} havoc ~n~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~h~0;~n~0 := #t~nondet4;havoc #t~nondet4; {5502#(<= ~counter~0 0)} is VALID [2022-04-07 13:06:38,823 INFO L272 TraceCheckUtils]: 6: Hoare triple {5502#(<= ~counter~0 0)} call assume_abort_if_not((if ~n~0 % 4294967296 < 1073741823 then 1 else 0)); {5497#true} is VALID [2022-04-07 13:06:38,823 INFO L290 TraceCheckUtils]: 7: Hoare triple {5497#true} ~cond := #in~cond; {5497#true} is VALID [2022-04-07 13:06:38,823 INFO L290 TraceCheckUtils]: 8: Hoare triple {5497#true} assume !(0 == ~cond); {5497#true} is VALID [2022-04-07 13:06:38,823 INFO L290 TraceCheckUtils]: 9: Hoare triple {5497#true} assume true; {5497#true} is VALID [2022-04-07 13:06:38,823 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {5497#true} {5502#(<= ~counter~0 0)} #82#return; {5502#(<= ~counter~0 0)} is VALID [2022-04-07 13:06:38,824 INFO L290 TraceCheckUtils]: 11: Hoare triple {5502#(<= ~counter~0 0)} ~p~0 := 0;~q~0 := 1;~r~0 := ~n~0;~h~0 := 0; {5502#(<= ~counter~0 0)} is VALID [2022-04-07 13:06:38,824 INFO L290 TraceCheckUtils]: 12: Hoare triple {5502#(<= ~counter~0 0)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {5507#(<= ~counter~0 1)} is VALID [2022-04-07 13:06:38,825 INFO L290 TraceCheckUtils]: 13: Hoare triple {5507#(<= ~counter~0 1)} assume !!(#t~post5 < 20);havoc #t~post5; {5507#(<= ~counter~0 1)} is VALID [2022-04-07 13:06:38,825 INFO L290 TraceCheckUtils]: 14: Hoare triple {5507#(<= ~counter~0 1)} assume !!(~q~0 % 4294967296 <= ~n~0 % 4294967296);~q~0 := 4 * ~q~0; {5507#(<= ~counter~0 1)} is VALID [2022-04-07 13:06:38,825 INFO L290 TraceCheckUtils]: 15: Hoare triple {5507#(<= ~counter~0 1)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {5508#(<= ~counter~0 2)} is VALID [2022-04-07 13:06:38,827 INFO L290 TraceCheckUtils]: 16: Hoare triple {5508#(<= ~counter~0 2)} assume !!(#t~post5 < 20);havoc #t~post5; {5508#(<= ~counter~0 2)} is VALID [2022-04-07 13:06:38,827 INFO L290 TraceCheckUtils]: 17: Hoare triple {5508#(<= ~counter~0 2)} assume !!(~q~0 % 4294967296 <= ~n~0 % 4294967296);~q~0 := 4 * ~q~0; {5508#(<= ~counter~0 2)} is VALID [2022-04-07 13:06:38,827 INFO L290 TraceCheckUtils]: 18: Hoare triple {5508#(<= ~counter~0 2)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {5509#(<= ~counter~0 3)} is VALID [2022-04-07 13:06:38,828 INFO L290 TraceCheckUtils]: 19: Hoare triple {5509#(<= ~counter~0 3)} assume !!(#t~post5 < 20);havoc #t~post5; {5509#(<= ~counter~0 3)} is VALID [2022-04-07 13:06:38,828 INFO L290 TraceCheckUtils]: 20: Hoare triple {5509#(<= ~counter~0 3)} assume !!(~q~0 % 4294967296 <= ~n~0 % 4294967296);~q~0 := 4 * ~q~0; {5509#(<= ~counter~0 3)} is VALID [2022-04-07 13:06:38,828 INFO L290 TraceCheckUtils]: 21: Hoare triple {5509#(<= ~counter~0 3)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {5510#(<= ~counter~0 4)} is VALID [2022-04-07 13:06:38,829 INFO L290 TraceCheckUtils]: 22: Hoare triple {5510#(<= ~counter~0 4)} assume !!(#t~post5 < 20);havoc #t~post5; {5510#(<= ~counter~0 4)} is VALID [2022-04-07 13:06:38,829 INFO L290 TraceCheckUtils]: 23: Hoare triple {5510#(<= ~counter~0 4)} assume !!(~q~0 % 4294967296 <= ~n~0 % 4294967296);~q~0 := 4 * ~q~0; {5510#(<= ~counter~0 4)} is VALID [2022-04-07 13:06:38,829 INFO L290 TraceCheckUtils]: 24: Hoare triple {5510#(<= ~counter~0 4)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {5511#(<= |main_#t~post5| 4)} is VALID [2022-04-07 13:06:38,830 INFO L290 TraceCheckUtils]: 25: Hoare triple {5511#(<= |main_#t~post5| 4)} assume !(#t~post5 < 20);havoc #t~post5; {5498#false} is VALID [2022-04-07 13:06:38,830 INFO L290 TraceCheckUtils]: 26: Hoare triple {5498#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {5498#false} is VALID [2022-04-07 13:06:38,830 INFO L290 TraceCheckUtils]: 27: Hoare triple {5498#false} assume !!(#t~post6 < 20);havoc #t~post6; {5498#false} is VALID [2022-04-07 13:06:38,830 INFO L272 TraceCheckUtils]: 28: Hoare triple {5498#false} call __VERIFIER_assert((if ~r~0 % 4294967296 < (2 * ~p~0 + ~q~0) % 4294967296 then 1 else 0)); {5498#false} is VALID [2022-04-07 13:06:38,830 INFO L290 TraceCheckUtils]: 29: Hoare triple {5498#false} ~cond := #in~cond; {5498#false} is VALID [2022-04-07 13:06:38,830 INFO L290 TraceCheckUtils]: 30: Hoare triple {5498#false} assume 0 == ~cond; {5498#false} is VALID [2022-04-07 13:06:38,830 INFO L290 TraceCheckUtils]: 31: Hoare triple {5498#false} assume !false; {5498#false} is VALID [2022-04-07 13:06:38,830 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-07 13:06:38,830 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 13:06:38,830 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1238435041] [2022-04-07 13:06:38,830 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1238435041] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-07 13:06:38,830 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1693203045] [2022-04-07 13:06:38,830 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 13:06:38,831 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 13:06:38,831 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 13:06:38,831 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-07 13:06:38,832 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-07 13:06:38,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 13:06:38,864 INFO L263 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 13 conjunts are in the unsatisfiable core [2022-04-07 13:06:38,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 13:06:38,879 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-07 13:06:39,078 INFO L272 TraceCheckUtils]: 0: Hoare triple {5497#true} call ULTIMATE.init(); {5497#true} is VALID [2022-04-07 13:06:39,078 INFO L290 TraceCheckUtils]: 1: Hoare triple {5497#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {5502#(<= ~counter~0 0)} is VALID [2022-04-07 13:06:39,079 INFO L290 TraceCheckUtils]: 2: Hoare triple {5502#(<= ~counter~0 0)} assume true; {5502#(<= ~counter~0 0)} is VALID [2022-04-07 13:06:39,080 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5502#(<= ~counter~0 0)} {5497#true} #102#return; {5502#(<= ~counter~0 0)} is VALID [2022-04-07 13:06:39,080 INFO L272 TraceCheckUtils]: 4: Hoare triple {5502#(<= ~counter~0 0)} call #t~ret7 := main(); {5502#(<= ~counter~0 0)} is VALID [2022-04-07 13:06:39,081 INFO L290 TraceCheckUtils]: 5: Hoare triple {5502#(<= ~counter~0 0)} havoc ~n~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~h~0;~n~0 := #t~nondet4;havoc #t~nondet4; {5502#(<= ~counter~0 0)} is VALID [2022-04-07 13:06:39,081 INFO L272 TraceCheckUtils]: 6: Hoare triple {5502#(<= ~counter~0 0)} call assume_abort_if_not((if ~n~0 % 4294967296 < 1073741823 then 1 else 0)); {5502#(<= ~counter~0 0)} is VALID [2022-04-07 13:06:39,084 INFO L290 TraceCheckUtils]: 7: Hoare triple {5502#(<= ~counter~0 0)} ~cond := #in~cond; {5502#(<= ~counter~0 0)} is VALID [2022-04-07 13:06:39,085 INFO L290 TraceCheckUtils]: 8: Hoare triple {5502#(<= ~counter~0 0)} assume !(0 == ~cond); {5502#(<= ~counter~0 0)} is VALID [2022-04-07 13:06:39,085 INFO L290 TraceCheckUtils]: 9: Hoare triple {5502#(<= ~counter~0 0)} assume true; {5502#(<= ~counter~0 0)} is VALID [2022-04-07 13:06:39,086 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {5502#(<= ~counter~0 0)} {5502#(<= ~counter~0 0)} #82#return; {5502#(<= ~counter~0 0)} is VALID [2022-04-07 13:06:39,086 INFO L290 TraceCheckUtils]: 11: Hoare triple {5502#(<= ~counter~0 0)} ~p~0 := 0;~q~0 := 1;~r~0 := ~n~0;~h~0 := 0; {5502#(<= ~counter~0 0)} is VALID [2022-04-07 13:06:39,086 INFO L290 TraceCheckUtils]: 12: Hoare triple {5502#(<= ~counter~0 0)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {5507#(<= ~counter~0 1)} is VALID [2022-04-07 13:06:39,088 INFO L290 TraceCheckUtils]: 13: Hoare triple {5507#(<= ~counter~0 1)} assume !!(#t~post5 < 20);havoc #t~post5; {5507#(<= ~counter~0 1)} is VALID [2022-04-07 13:06:39,088 INFO L290 TraceCheckUtils]: 14: Hoare triple {5507#(<= ~counter~0 1)} assume !!(~q~0 % 4294967296 <= ~n~0 % 4294967296);~q~0 := 4 * ~q~0; {5507#(<= ~counter~0 1)} is VALID [2022-04-07 13:06:39,088 INFO L290 TraceCheckUtils]: 15: Hoare triple {5507#(<= ~counter~0 1)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {5508#(<= ~counter~0 2)} is VALID [2022-04-07 13:06:39,089 INFO L290 TraceCheckUtils]: 16: Hoare triple {5508#(<= ~counter~0 2)} assume !!(#t~post5 < 20);havoc #t~post5; {5508#(<= ~counter~0 2)} is VALID [2022-04-07 13:06:39,089 INFO L290 TraceCheckUtils]: 17: Hoare triple {5508#(<= ~counter~0 2)} assume !!(~q~0 % 4294967296 <= ~n~0 % 4294967296);~q~0 := 4 * ~q~0; {5508#(<= ~counter~0 2)} is VALID [2022-04-07 13:06:39,089 INFO L290 TraceCheckUtils]: 18: Hoare triple {5508#(<= ~counter~0 2)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {5509#(<= ~counter~0 3)} is VALID [2022-04-07 13:06:39,090 INFO L290 TraceCheckUtils]: 19: Hoare triple {5509#(<= ~counter~0 3)} assume !!(#t~post5 < 20);havoc #t~post5; {5509#(<= ~counter~0 3)} is VALID [2022-04-07 13:06:39,091 INFO L290 TraceCheckUtils]: 20: Hoare triple {5509#(<= ~counter~0 3)} assume !!(~q~0 % 4294967296 <= ~n~0 % 4294967296);~q~0 := 4 * ~q~0; {5509#(<= ~counter~0 3)} is VALID [2022-04-07 13:06:39,092 INFO L290 TraceCheckUtils]: 21: Hoare triple {5509#(<= ~counter~0 3)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {5510#(<= ~counter~0 4)} is VALID [2022-04-07 13:06:39,092 INFO L290 TraceCheckUtils]: 22: Hoare triple {5510#(<= ~counter~0 4)} assume !!(#t~post5 < 20);havoc #t~post5; {5510#(<= ~counter~0 4)} is VALID [2022-04-07 13:06:39,092 INFO L290 TraceCheckUtils]: 23: Hoare triple {5510#(<= ~counter~0 4)} assume !!(~q~0 % 4294967296 <= ~n~0 % 4294967296);~q~0 := 4 * ~q~0; {5510#(<= ~counter~0 4)} is VALID [2022-04-07 13:06:39,092 INFO L290 TraceCheckUtils]: 24: Hoare triple {5510#(<= ~counter~0 4)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {5511#(<= |main_#t~post5| 4)} is VALID [2022-04-07 13:06:39,093 INFO L290 TraceCheckUtils]: 25: Hoare triple {5511#(<= |main_#t~post5| 4)} assume !(#t~post5 < 20);havoc #t~post5; {5498#false} is VALID [2022-04-07 13:06:39,093 INFO L290 TraceCheckUtils]: 26: Hoare triple {5498#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {5498#false} is VALID [2022-04-07 13:06:39,093 INFO L290 TraceCheckUtils]: 27: Hoare triple {5498#false} assume !!(#t~post6 < 20);havoc #t~post6; {5498#false} is VALID [2022-04-07 13:06:39,093 INFO L272 TraceCheckUtils]: 28: Hoare triple {5498#false} call __VERIFIER_assert((if ~r~0 % 4294967296 < (2 * ~p~0 + ~q~0) % 4294967296 then 1 else 0)); {5498#false} is VALID [2022-04-07 13:06:39,093 INFO L290 TraceCheckUtils]: 29: Hoare triple {5498#false} ~cond := #in~cond; {5498#false} is VALID [2022-04-07 13:06:39,093 INFO L290 TraceCheckUtils]: 30: Hoare triple {5498#false} assume 0 == ~cond; {5498#false} is VALID [2022-04-07 13:06:39,093 INFO L290 TraceCheckUtils]: 31: Hoare triple {5498#false} assume !false; {5498#false} is VALID [2022-04-07 13:06:39,093 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-07 13:06:39,093 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-07 13:06:39,388 INFO L290 TraceCheckUtils]: 31: Hoare triple {5498#false} assume !false; {5498#false} is VALID [2022-04-07 13:06:39,388 INFO L290 TraceCheckUtils]: 30: Hoare triple {5498#false} assume 0 == ~cond; {5498#false} is VALID [2022-04-07 13:06:39,388 INFO L290 TraceCheckUtils]: 29: Hoare triple {5498#false} ~cond := #in~cond; {5498#false} is VALID [2022-04-07 13:06:39,388 INFO L272 TraceCheckUtils]: 28: Hoare triple {5498#false} call __VERIFIER_assert((if ~r~0 % 4294967296 < (2 * ~p~0 + ~q~0) % 4294967296 then 1 else 0)); {5498#false} is VALID [2022-04-07 13:06:39,388 INFO L290 TraceCheckUtils]: 27: Hoare triple {5498#false} assume !!(#t~post6 < 20);havoc #t~post6; {5498#false} is VALID [2022-04-07 13:06:39,388 INFO L290 TraceCheckUtils]: 26: Hoare triple {5498#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {5498#false} is VALID [2022-04-07 13:06:39,389 INFO L290 TraceCheckUtils]: 25: Hoare triple {5627#(< |main_#t~post5| 20)} assume !(#t~post5 < 20);havoc #t~post5; {5498#false} is VALID [2022-04-07 13:06:39,389 INFO L290 TraceCheckUtils]: 24: Hoare triple {5631#(< ~counter~0 20)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {5627#(< |main_#t~post5| 20)} is VALID [2022-04-07 13:06:39,389 INFO L290 TraceCheckUtils]: 23: Hoare triple {5631#(< ~counter~0 20)} assume !!(~q~0 % 4294967296 <= ~n~0 % 4294967296);~q~0 := 4 * ~q~0; {5631#(< ~counter~0 20)} is VALID [2022-04-07 13:06:39,390 INFO L290 TraceCheckUtils]: 22: Hoare triple {5631#(< ~counter~0 20)} assume !!(#t~post5 < 20);havoc #t~post5; {5631#(< ~counter~0 20)} is VALID [2022-04-07 13:06:39,390 INFO L290 TraceCheckUtils]: 21: Hoare triple {5641#(< ~counter~0 19)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {5631#(< ~counter~0 20)} is VALID [2022-04-07 13:06:39,390 INFO L290 TraceCheckUtils]: 20: Hoare triple {5641#(< ~counter~0 19)} assume !!(~q~0 % 4294967296 <= ~n~0 % 4294967296);~q~0 := 4 * ~q~0; {5641#(< ~counter~0 19)} is VALID [2022-04-07 13:06:39,391 INFO L290 TraceCheckUtils]: 19: Hoare triple {5641#(< ~counter~0 19)} assume !!(#t~post5 < 20);havoc #t~post5; {5641#(< ~counter~0 19)} is VALID [2022-04-07 13:06:39,391 INFO L290 TraceCheckUtils]: 18: Hoare triple {5651#(< ~counter~0 18)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {5641#(< ~counter~0 19)} is VALID [2022-04-07 13:06:39,391 INFO L290 TraceCheckUtils]: 17: Hoare triple {5651#(< ~counter~0 18)} assume !!(~q~0 % 4294967296 <= ~n~0 % 4294967296);~q~0 := 4 * ~q~0; {5651#(< ~counter~0 18)} is VALID [2022-04-07 13:06:39,392 INFO L290 TraceCheckUtils]: 16: Hoare triple {5651#(< ~counter~0 18)} assume !!(#t~post5 < 20);havoc #t~post5; {5651#(< ~counter~0 18)} is VALID [2022-04-07 13:06:39,392 INFO L290 TraceCheckUtils]: 15: Hoare triple {5661#(< ~counter~0 17)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {5651#(< ~counter~0 18)} is VALID [2022-04-07 13:06:39,392 INFO L290 TraceCheckUtils]: 14: Hoare triple {5661#(< ~counter~0 17)} assume !!(~q~0 % 4294967296 <= ~n~0 % 4294967296);~q~0 := 4 * ~q~0; {5661#(< ~counter~0 17)} is VALID [2022-04-07 13:06:39,393 INFO L290 TraceCheckUtils]: 13: Hoare triple {5661#(< ~counter~0 17)} assume !!(#t~post5 < 20);havoc #t~post5; {5661#(< ~counter~0 17)} is VALID [2022-04-07 13:06:39,393 INFO L290 TraceCheckUtils]: 12: Hoare triple {5671#(< ~counter~0 16)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {5661#(< ~counter~0 17)} is VALID [2022-04-07 13:06:39,393 INFO L290 TraceCheckUtils]: 11: Hoare triple {5671#(< ~counter~0 16)} ~p~0 := 0;~q~0 := 1;~r~0 := ~n~0;~h~0 := 0; {5671#(< ~counter~0 16)} is VALID [2022-04-07 13:06:39,394 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {5497#true} {5671#(< ~counter~0 16)} #82#return; {5671#(< ~counter~0 16)} is VALID [2022-04-07 13:06:39,394 INFO L290 TraceCheckUtils]: 9: Hoare triple {5497#true} assume true; {5497#true} is VALID [2022-04-07 13:06:39,394 INFO L290 TraceCheckUtils]: 8: Hoare triple {5497#true} assume !(0 == ~cond); {5497#true} is VALID [2022-04-07 13:06:39,394 INFO L290 TraceCheckUtils]: 7: Hoare triple {5497#true} ~cond := #in~cond; {5497#true} is VALID [2022-04-07 13:06:39,394 INFO L272 TraceCheckUtils]: 6: Hoare triple {5671#(< ~counter~0 16)} call assume_abort_if_not((if ~n~0 % 4294967296 < 1073741823 then 1 else 0)); {5497#true} is VALID [2022-04-07 13:06:39,394 INFO L290 TraceCheckUtils]: 5: Hoare triple {5671#(< ~counter~0 16)} havoc ~n~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~h~0;~n~0 := #t~nondet4;havoc #t~nondet4; {5671#(< ~counter~0 16)} is VALID [2022-04-07 13:06:39,395 INFO L272 TraceCheckUtils]: 4: Hoare triple {5671#(< ~counter~0 16)} call #t~ret7 := main(); {5671#(< ~counter~0 16)} is VALID [2022-04-07 13:06:39,395 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5671#(< ~counter~0 16)} {5497#true} #102#return; {5671#(< ~counter~0 16)} is VALID [2022-04-07 13:06:39,395 INFO L290 TraceCheckUtils]: 2: Hoare triple {5671#(< ~counter~0 16)} assume true; {5671#(< ~counter~0 16)} is VALID [2022-04-07 13:06:39,396 INFO L290 TraceCheckUtils]: 1: Hoare triple {5497#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {5671#(< ~counter~0 16)} is VALID [2022-04-07 13:06:39,396 INFO L272 TraceCheckUtils]: 0: Hoare triple {5497#true} call ULTIMATE.init(); {5497#true} is VALID [2022-04-07 13:06:39,396 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-07 13:06:39,396 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1693203045] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-07 13:06:39,396 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-07 13:06:39,396 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 15 [2022-04-07 13:06:39,396 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [722884583] [2022-04-07 13:06:39,396 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-07 13:06:39,397 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 3.2) internal successors, (48), 14 states have internal predecessors, (48), 4 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (5), 2 states have call predecessors, (5), 3 states have call successors, (5) Word has length 32 [2022-04-07 13:06:39,397 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 13:06:39,397 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 15 states, 15 states have (on average 3.2) internal successors, (48), 14 states have internal predecessors, (48), 4 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (5), 2 states have call predecessors, (5), 3 states have call successors, (5) [2022-04-07 13:06:39,439 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 61 edges. 61 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 13:06:39,440 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-04-07 13:06:39,440 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 13:06:39,440 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-04-07 13:06:39,440 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=137, Unknown=0, NotChecked=0, Total=210 [2022-04-07 13:06:39,440 INFO L87 Difference]: Start difference. First operand 175 states and 233 transitions. Second operand has 15 states, 15 states have (on average 3.2) internal successors, (48), 14 states have internal predecessors, (48), 4 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (5), 2 states have call predecessors, (5), 3 states have call successors, (5) [2022-04-07 13:06:47,091 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.29s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-07 13:06:48,848 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.67s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-07 13:06:50,873 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-07 13:06:53,324 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-07 13:06:55,407 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-07 13:06:57,411 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-07 13:06:59,569 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.95s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-07 13:07:04,564 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-07 13:07:07,216 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-07 13:07:12,692 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-07 13:07:19,016 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-07 13:07:21,019 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-07 13:07:27,777 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-07 13:07:30,214 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.43s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-07 13:07:33,744 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.53s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-07 13:07:38,107 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.39s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-07 13:07:41,198 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-07 13:07:45,601 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-07 13:07:47,976 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.36s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-07 13:07:50,804 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.69s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-07 13:07:54,664 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-07 13:07:57,086 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.48s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-07 13:08:09,168 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-07 13:08:11,226 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-07 13:08:13,230 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-07 13:08:15,234 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-07 13:08:17,240 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-07 13:08:17,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 13:08:17,263 INFO L93 Difference]: Finished difference Result 411 states and 536 transitions. [2022-04-07 13:08:17,264 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-04-07 13:08:17,265 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 3.2) internal successors, (48), 14 states have internal predecessors, (48), 4 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (5), 2 states have call predecessors, (5), 3 states have call successors, (5) Word has length 32 [2022-04-07 13:08:17,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 13:08:17,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 15 states have (on average 3.2) internal successors, (48), 14 states have internal predecessors, (48), 4 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (5), 2 states have call predecessors, (5), 3 states have call successors, (5) [2022-04-07 13:08:17,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 264 transitions. [2022-04-07 13:08:17,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 15 states have (on average 3.2) internal successors, (48), 14 states have internal predecessors, (48), 4 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (5), 2 states have call predecessors, (5), 3 states have call successors, (5) [2022-04-07 13:08:17,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 264 transitions. [2022-04-07 13:08:17,269 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 31 states and 264 transitions. [2022-04-07 13:08:17,532 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 264 edges. 264 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 13:08:17,543 INFO L225 Difference]: With dead ends: 411 [2022-04-07 13:08:17,543 INFO L226 Difference]: Without dead ends: 371 [2022-04-07 13:08:17,544 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 165 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=276, Invalid=716, Unknown=0, NotChecked=0, Total=992 [2022-04-07 13:08:17,544 INFO L913 BasicCegarLoop]: 51 mSDtfsCounter, 194 mSDsluCounter, 153 mSDsCounter, 0 mSdLazyCounter, 498 mSolverCounterSat, 132 mSolverCounterUnsat, 22 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 74.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 230 SdHoareTripleChecker+Valid, 204 SdHoareTripleChecker+Invalid, 652 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 132 IncrementalHoareTripleChecker+Valid, 498 IncrementalHoareTripleChecker+Invalid, 22 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 74.9s IncrementalHoareTripleChecker+Time [2022-04-07 13:08:17,544 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [230 Valid, 204 Invalid, 652 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [132 Valid, 498 Invalid, 22 Unknown, 0 Unchecked, 74.9s Time] [2022-04-07 13:08:17,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 371 states. [2022-04-07 13:08:17,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 371 to 353. [2022-04-07 13:08:17,687 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 13:08:17,688 INFO L82 GeneralOperation]: Start isEquivalent. First operand 371 states. Second operand has 353 states, 199 states have (on average 1.1909547738693467) internal successors, (237), 216 states have internal predecessors, (237), 117 states have call successors, (117), 37 states have call predecessors, (117), 36 states have return successors, (108), 99 states have call predecessors, (108), 108 states have call successors, (108) [2022-04-07 13:08:17,688 INFO L74 IsIncluded]: Start isIncluded. First operand 371 states. Second operand has 353 states, 199 states have (on average 1.1909547738693467) internal successors, (237), 216 states have internal predecessors, (237), 117 states have call successors, (117), 37 states have call predecessors, (117), 36 states have return successors, (108), 99 states have call predecessors, (108), 108 states have call successors, (108) [2022-04-07 13:08:17,689 INFO L87 Difference]: Start difference. First operand 371 states. Second operand has 353 states, 199 states have (on average 1.1909547738693467) internal successors, (237), 216 states have internal predecessors, (237), 117 states have call successors, (117), 37 states have call predecessors, (117), 36 states have return successors, (108), 99 states have call predecessors, (108), 108 states have call successors, (108) [2022-04-07 13:08:17,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 13:08:17,696 INFO L93 Difference]: Finished difference Result 371 states and 477 transitions. [2022-04-07 13:08:17,696 INFO L276 IsEmpty]: Start isEmpty. Operand 371 states and 477 transitions. [2022-04-07 13:08:17,697 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 13:08:17,697 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 13:08:17,698 INFO L74 IsIncluded]: Start isIncluded. First operand has 353 states, 199 states have (on average 1.1909547738693467) internal successors, (237), 216 states have internal predecessors, (237), 117 states have call successors, (117), 37 states have call predecessors, (117), 36 states have return successors, (108), 99 states have call predecessors, (108), 108 states have call successors, (108) Second operand 371 states. [2022-04-07 13:08:17,698 INFO L87 Difference]: Start difference. First operand has 353 states, 199 states have (on average 1.1909547738693467) internal successors, (237), 216 states have internal predecessors, (237), 117 states have call successors, (117), 37 states have call predecessors, (117), 36 states have return successors, (108), 99 states have call predecessors, (108), 108 states have call successors, (108) Second operand 371 states. [2022-04-07 13:08:17,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 13:08:17,706 INFO L93 Difference]: Finished difference Result 371 states and 477 transitions. [2022-04-07 13:08:17,706 INFO L276 IsEmpty]: Start isEmpty. Operand 371 states and 477 transitions. [2022-04-07 13:08:17,707 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 13:08:17,707 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 13:08:17,707 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 13:08:17,707 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 13:08:17,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 353 states, 199 states have (on average 1.1909547738693467) internal successors, (237), 216 states have internal predecessors, (237), 117 states have call successors, (117), 37 states have call predecessors, (117), 36 states have return successors, (108), 99 states have call predecessors, (108), 108 states have call successors, (108) [2022-04-07 13:08:17,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 353 states to 353 states and 462 transitions. [2022-04-07 13:08:17,716 INFO L78 Accepts]: Start accepts. Automaton has 353 states and 462 transitions. Word has length 32 [2022-04-07 13:08:17,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 13:08:17,716 INFO L478 AbstractCegarLoop]: Abstraction has 353 states and 462 transitions. [2022-04-07 13:08:17,716 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 3.2) internal successors, (48), 14 states have internal predecessors, (48), 4 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (5), 2 states have call predecessors, (5), 3 states have call successors, (5) [2022-04-07 13:08:17,717 INFO L276 IsEmpty]: Start isEmpty. Operand 353 states and 462 transitions. [2022-04-07 13:08:17,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2022-04-07 13:08:17,717 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 13:08:17,717 INFO L499 BasicCegarLoop]: trace histogram [11, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 13:08:17,737 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-07 13:08:17,931 WARN L460 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-07 13:08:17,932 INFO L403 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 13:08:17,932 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 13:08:17,932 INFO L85 PathProgramCache]: Analyzing trace with hash -271152338, now seen corresponding path program 2 times [2022-04-07 13:08:17,932 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 13:08:17,932 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [355289338] [2022-04-07 13:08:17,932 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 13:08:17,932 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 13:08:17,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 13:08:18,178 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 13:08:18,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 13:08:18,190 INFO L290 TraceCheckUtils]: 0: Hoare triple {7623#(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(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {7607#(<= ~counter~0 0)} is VALID [2022-04-07 13:08:18,191 INFO L290 TraceCheckUtils]: 1: Hoare triple {7607#(<= ~counter~0 0)} assume true; {7607#(<= ~counter~0 0)} is VALID [2022-04-07 13:08:18,191 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {7607#(<= ~counter~0 0)} {7602#true} #102#return; {7607#(<= ~counter~0 0)} is VALID [2022-04-07 13:08:18,191 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-07 13:08:18,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 13:08:18,197 INFO L290 TraceCheckUtils]: 0: Hoare triple {7602#true} ~cond := #in~cond; {7602#true} is VALID [2022-04-07 13:08:18,197 INFO L290 TraceCheckUtils]: 1: Hoare triple {7602#true} assume !(0 == ~cond); {7602#true} is VALID [2022-04-07 13:08:18,197 INFO L290 TraceCheckUtils]: 2: Hoare triple {7602#true} assume true; {7602#true} is VALID [2022-04-07 13:08:18,198 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7602#true} {7607#(<= ~counter~0 0)} #82#return; {7607#(<= ~counter~0 0)} is VALID [2022-04-07 13:08:18,198 INFO L272 TraceCheckUtils]: 0: Hoare triple {7602#true} call ULTIMATE.init(); {7623#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-07 13:08:18,199 INFO L290 TraceCheckUtils]: 1: Hoare triple {7623#(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(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {7607#(<= ~counter~0 0)} is VALID [2022-04-07 13:08:18,199 INFO L290 TraceCheckUtils]: 2: Hoare triple {7607#(<= ~counter~0 0)} assume true; {7607#(<= ~counter~0 0)} is VALID [2022-04-07 13:08:18,199 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7607#(<= ~counter~0 0)} {7602#true} #102#return; {7607#(<= ~counter~0 0)} is VALID [2022-04-07 13:08:18,199 INFO L272 TraceCheckUtils]: 4: Hoare triple {7607#(<= ~counter~0 0)} call #t~ret7 := main(); {7607#(<= ~counter~0 0)} is VALID [2022-04-07 13:08:18,200 INFO L290 TraceCheckUtils]: 5: Hoare triple {7607#(<= ~counter~0 0)} havoc ~n~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~h~0;~n~0 := #t~nondet4;havoc #t~nondet4; {7607#(<= ~counter~0 0)} is VALID [2022-04-07 13:08:18,200 INFO L272 TraceCheckUtils]: 6: Hoare triple {7607#(<= ~counter~0 0)} call assume_abort_if_not((if ~n~0 % 4294967296 < 1073741823 then 1 else 0)); {7602#true} is VALID [2022-04-07 13:08:18,200 INFO L290 TraceCheckUtils]: 7: Hoare triple {7602#true} ~cond := #in~cond; {7602#true} is VALID [2022-04-07 13:08:18,200 INFO L290 TraceCheckUtils]: 8: Hoare triple {7602#true} assume !(0 == ~cond); {7602#true} is VALID [2022-04-07 13:08:18,200 INFO L290 TraceCheckUtils]: 9: Hoare triple {7602#true} assume true; {7602#true} is VALID [2022-04-07 13:08:18,200 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {7602#true} {7607#(<= ~counter~0 0)} #82#return; {7607#(<= ~counter~0 0)} is VALID [2022-04-07 13:08:18,201 INFO L290 TraceCheckUtils]: 11: Hoare triple {7607#(<= ~counter~0 0)} ~p~0 := 0;~q~0 := 1;~r~0 := ~n~0;~h~0 := 0; {7607#(<= ~counter~0 0)} is VALID [2022-04-07 13:08:18,201 INFO L290 TraceCheckUtils]: 12: Hoare triple {7607#(<= ~counter~0 0)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {7612#(<= ~counter~0 1)} is VALID [2022-04-07 13:08:18,201 INFO L290 TraceCheckUtils]: 13: Hoare triple {7612#(<= ~counter~0 1)} assume !!(#t~post5 < 20);havoc #t~post5; {7612#(<= ~counter~0 1)} is VALID [2022-04-07 13:08:18,202 INFO L290 TraceCheckUtils]: 14: Hoare triple {7612#(<= ~counter~0 1)} assume !!(~q~0 % 4294967296 <= ~n~0 % 4294967296);~q~0 := 4 * ~q~0; {7612#(<= ~counter~0 1)} is VALID [2022-04-07 13:08:18,202 INFO L290 TraceCheckUtils]: 15: Hoare triple {7612#(<= ~counter~0 1)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {7613#(<= ~counter~0 2)} is VALID [2022-04-07 13:08:18,202 INFO L290 TraceCheckUtils]: 16: Hoare triple {7613#(<= ~counter~0 2)} assume !!(#t~post5 < 20);havoc #t~post5; {7613#(<= ~counter~0 2)} is VALID [2022-04-07 13:08:18,203 INFO L290 TraceCheckUtils]: 17: Hoare triple {7613#(<= ~counter~0 2)} assume !!(~q~0 % 4294967296 <= ~n~0 % 4294967296);~q~0 := 4 * ~q~0; {7613#(<= ~counter~0 2)} is VALID [2022-04-07 13:08:18,203 INFO L290 TraceCheckUtils]: 18: Hoare triple {7613#(<= ~counter~0 2)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {7614#(<= ~counter~0 3)} is VALID [2022-04-07 13:08:18,203 INFO L290 TraceCheckUtils]: 19: Hoare triple {7614#(<= ~counter~0 3)} assume !!(#t~post5 < 20);havoc #t~post5; {7614#(<= ~counter~0 3)} is VALID [2022-04-07 13:08:18,204 INFO L290 TraceCheckUtils]: 20: Hoare triple {7614#(<= ~counter~0 3)} assume !!(~q~0 % 4294967296 <= ~n~0 % 4294967296);~q~0 := 4 * ~q~0; {7614#(<= ~counter~0 3)} is VALID [2022-04-07 13:08:18,204 INFO L290 TraceCheckUtils]: 21: Hoare triple {7614#(<= ~counter~0 3)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {7615#(<= ~counter~0 4)} is VALID [2022-04-07 13:08:18,204 INFO L290 TraceCheckUtils]: 22: Hoare triple {7615#(<= ~counter~0 4)} assume !!(#t~post5 < 20);havoc #t~post5; {7615#(<= ~counter~0 4)} is VALID [2022-04-07 13:08:18,205 INFO L290 TraceCheckUtils]: 23: Hoare triple {7615#(<= ~counter~0 4)} assume !!(~q~0 % 4294967296 <= ~n~0 % 4294967296);~q~0 := 4 * ~q~0; {7615#(<= ~counter~0 4)} is VALID [2022-04-07 13:08:18,205 INFO L290 TraceCheckUtils]: 24: Hoare triple {7615#(<= ~counter~0 4)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {7616#(<= ~counter~0 5)} is VALID [2022-04-07 13:08:18,205 INFO L290 TraceCheckUtils]: 25: Hoare triple {7616#(<= ~counter~0 5)} assume !!(#t~post5 < 20);havoc #t~post5; {7616#(<= ~counter~0 5)} is VALID [2022-04-07 13:08:18,206 INFO L290 TraceCheckUtils]: 26: Hoare triple {7616#(<= ~counter~0 5)} assume !!(~q~0 % 4294967296 <= ~n~0 % 4294967296);~q~0 := 4 * ~q~0; {7616#(<= ~counter~0 5)} is VALID [2022-04-07 13:08:18,206 INFO L290 TraceCheckUtils]: 27: Hoare triple {7616#(<= ~counter~0 5)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {7617#(<= ~counter~0 6)} is VALID [2022-04-07 13:08:18,206 INFO L290 TraceCheckUtils]: 28: Hoare triple {7617#(<= ~counter~0 6)} assume !!(#t~post5 < 20);havoc #t~post5; {7617#(<= ~counter~0 6)} is VALID [2022-04-07 13:08:18,207 INFO L290 TraceCheckUtils]: 29: Hoare triple {7617#(<= ~counter~0 6)} assume !!(~q~0 % 4294967296 <= ~n~0 % 4294967296);~q~0 := 4 * ~q~0; {7617#(<= ~counter~0 6)} is VALID [2022-04-07 13:08:18,207 INFO L290 TraceCheckUtils]: 30: Hoare triple {7617#(<= ~counter~0 6)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {7618#(<= ~counter~0 7)} is VALID [2022-04-07 13:08:18,207 INFO L290 TraceCheckUtils]: 31: Hoare triple {7618#(<= ~counter~0 7)} assume !!(#t~post5 < 20);havoc #t~post5; {7618#(<= ~counter~0 7)} is VALID [2022-04-07 13:08:18,208 INFO L290 TraceCheckUtils]: 32: Hoare triple {7618#(<= ~counter~0 7)} assume !!(~q~0 % 4294967296 <= ~n~0 % 4294967296);~q~0 := 4 * ~q~0; {7618#(<= ~counter~0 7)} is VALID [2022-04-07 13:08:18,208 INFO L290 TraceCheckUtils]: 33: Hoare triple {7618#(<= ~counter~0 7)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {7619#(<= ~counter~0 8)} is VALID [2022-04-07 13:08:18,208 INFO L290 TraceCheckUtils]: 34: Hoare triple {7619#(<= ~counter~0 8)} assume !!(#t~post5 < 20);havoc #t~post5; {7619#(<= ~counter~0 8)} is VALID [2022-04-07 13:08:18,209 INFO L290 TraceCheckUtils]: 35: Hoare triple {7619#(<= ~counter~0 8)} assume !!(~q~0 % 4294967296 <= ~n~0 % 4294967296);~q~0 := 4 * ~q~0; {7619#(<= ~counter~0 8)} is VALID [2022-04-07 13:08:18,209 INFO L290 TraceCheckUtils]: 36: Hoare triple {7619#(<= ~counter~0 8)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {7620#(<= ~counter~0 9)} is VALID [2022-04-07 13:08:18,209 INFO L290 TraceCheckUtils]: 37: Hoare triple {7620#(<= ~counter~0 9)} assume !!(#t~post5 < 20);havoc #t~post5; {7620#(<= ~counter~0 9)} is VALID [2022-04-07 13:08:18,210 INFO L290 TraceCheckUtils]: 38: Hoare triple {7620#(<= ~counter~0 9)} assume !!(~q~0 % 4294967296 <= ~n~0 % 4294967296);~q~0 := 4 * ~q~0; {7620#(<= ~counter~0 9)} is VALID [2022-04-07 13:08:18,210 INFO L290 TraceCheckUtils]: 39: Hoare triple {7620#(<= ~counter~0 9)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {7621#(<= ~counter~0 10)} is VALID [2022-04-07 13:08:18,210 INFO L290 TraceCheckUtils]: 40: Hoare triple {7621#(<= ~counter~0 10)} assume !!(#t~post5 < 20);havoc #t~post5; {7621#(<= ~counter~0 10)} is VALID [2022-04-07 13:08:18,211 INFO L290 TraceCheckUtils]: 41: Hoare triple {7621#(<= ~counter~0 10)} assume !!(~q~0 % 4294967296 <= ~n~0 % 4294967296);~q~0 := 4 * ~q~0; {7621#(<= ~counter~0 10)} is VALID [2022-04-07 13:08:18,211 INFO L290 TraceCheckUtils]: 42: Hoare triple {7621#(<= ~counter~0 10)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {7622#(<= |main_#t~post5| 10)} is VALID [2022-04-07 13:08:18,211 INFO L290 TraceCheckUtils]: 43: Hoare triple {7622#(<= |main_#t~post5| 10)} assume !(#t~post5 < 20);havoc #t~post5; {7603#false} is VALID [2022-04-07 13:08:18,211 INFO L290 TraceCheckUtils]: 44: Hoare triple {7603#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {7603#false} is VALID [2022-04-07 13:08:18,211 INFO L290 TraceCheckUtils]: 45: Hoare triple {7603#false} assume !!(#t~post6 < 20);havoc #t~post6; {7603#false} is VALID [2022-04-07 13:08:18,211 INFO L272 TraceCheckUtils]: 46: Hoare triple {7603#false} call __VERIFIER_assert((if ~r~0 % 4294967296 < (2 * ~p~0 + ~q~0) % 4294967296 then 1 else 0)); {7603#false} is VALID [2022-04-07 13:08:18,211 INFO L290 TraceCheckUtils]: 47: Hoare triple {7603#false} ~cond := #in~cond; {7603#false} is VALID [2022-04-07 13:08:18,212 INFO L290 TraceCheckUtils]: 48: Hoare triple {7603#false} assume 0 == ~cond; {7603#false} is VALID [2022-04-07 13:08:18,212 INFO L290 TraceCheckUtils]: 49: Hoare triple {7603#false} assume !false; {7603#false} is VALID [2022-04-07 13:08:18,212 INFO L134 CoverageAnalysis]: Checked inductivity of 155 backedges. 0 proven. 155 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-07 13:08:18,213 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 13:08:18,213 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [355289338] [2022-04-07 13:08:18,213 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [355289338] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-07 13:08:18,213 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1456853905] [2022-04-07 13:08:18,213 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-07 13:08:18,213 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 13:08:18,213 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 13:08:18,214 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-07 13:08:18,215 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-04-07 13:08:18,251 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-04-07 13:08:18,252 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-07 13:08:18,252 INFO L263 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 4 conjunts are in the unsatisfiable core [2022-04-07 13:08:18,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 13:08:18,264 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-07 13:08:18,432 INFO L272 TraceCheckUtils]: 0: Hoare triple {7602#true} call ULTIMATE.init(); {7602#true} is VALID [2022-04-07 13:08:18,432 INFO L290 TraceCheckUtils]: 1: Hoare triple {7602#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {7602#true} is VALID [2022-04-07 13:08:18,432 INFO L290 TraceCheckUtils]: 2: Hoare triple {7602#true} assume true; {7602#true} is VALID [2022-04-07 13:08:18,433 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7602#true} {7602#true} #102#return; {7602#true} is VALID [2022-04-07 13:08:18,433 INFO L272 TraceCheckUtils]: 4: Hoare triple {7602#true} call #t~ret7 := main(); {7602#true} is VALID [2022-04-07 13:08:18,433 INFO L290 TraceCheckUtils]: 5: Hoare triple {7602#true} havoc ~n~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~h~0;~n~0 := #t~nondet4;havoc #t~nondet4; {7602#true} is VALID [2022-04-07 13:08:18,433 INFO L272 TraceCheckUtils]: 6: Hoare triple {7602#true} call assume_abort_if_not((if ~n~0 % 4294967296 < 1073741823 then 1 else 0)); {7602#true} is VALID [2022-04-07 13:08:18,433 INFO L290 TraceCheckUtils]: 7: Hoare triple {7602#true} ~cond := #in~cond; {7602#true} is VALID [2022-04-07 13:08:18,433 INFO L290 TraceCheckUtils]: 8: Hoare triple {7602#true} assume !(0 == ~cond); {7602#true} is VALID [2022-04-07 13:08:18,433 INFO L290 TraceCheckUtils]: 9: Hoare triple {7602#true} assume true; {7602#true} is VALID [2022-04-07 13:08:18,433 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {7602#true} {7602#true} #82#return; {7602#true} is VALID [2022-04-07 13:08:18,433 INFO L290 TraceCheckUtils]: 11: Hoare triple {7602#true} ~p~0 := 0;~q~0 := 1;~r~0 := ~n~0;~h~0 := 0; {7602#true} is VALID [2022-04-07 13:08:18,433 INFO L290 TraceCheckUtils]: 12: Hoare triple {7602#true} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {7602#true} is VALID [2022-04-07 13:08:18,433 INFO L290 TraceCheckUtils]: 13: Hoare triple {7602#true} assume !!(#t~post5 < 20);havoc #t~post5; {7602#true} is VALID [2022-04-07 13:08:18,433 INFO L290 TraceCheckUtils]: 14: Hoare triple {7602#true} assume !!(~q~0 % 4294967296 <= ~n~0 % 4294967296);~q~0 := 4 * ~q~0; {7602#true} is VALID [2022-04-07 13:08:18,433 INFO L290 TraceCheckUtils]: 15: Hoare triple {7602#true} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {7602#true} is VALID [2022-04-07 13:08:18,433 INFO L290 TraceCheckUtils]: 16: Hoare triple {7602#true} assume !!(#t~post5 < 20);havoc #t~post5; {7602#true} is VALID [2022-04-07 13:08:18,433 INFO L290 TraceCheckUtils]: 17: Hoare triple {7602#true} assume !!(~q~0 % 4294967296 <= ~n~0 % 4294967296);~q~0 := 4 * ~q~0; {7602#true} is VALID [2022-04-07 13:08:18,433 INFO L290 TraceCheckUtils]: 18: Hoare triple {7602#true} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {7602#true} is VALID [2022-04-07 13:08:18,433 INFO L290 TraceCheckUtils]: 19: Hoare triple {7602#true} assume !!(#t~post5 < 20);havoc #t~post5; {7602#true} is VALID [2022-04-07 13:08:18,433 INFO L290 TraceCheckUtils]: 20: Hoare triple {7602#true} assume !!(~q~0 % 4294967296 <= ~n~0 % 4294967296);~q~0 := 4 * ~q~0; {7602#true} is VALID [2022-04-07 13:08:18,433 INFO L290 TraceCheckUtils]: 21: Hoare triple {7602#true} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {7602#true} is VALID [2022-04-07 13:08:18,434 INFO L290 TraceCheckUtils]: 22: Hoare triple {7602#true} assume !!(#t~post5 < 20);havoc #t~post5; {7602#true} is VALID [2022-04-07 13:08:18,434 INFO L290 TraceCheckUtils]: 23: Hoare triple {7602#true} assume !!(~q~0 % 4294967296 <= ~n~0 % 4294967296);~q~0 := 4 * ~q~0; {7602#true} is VALID [2022-04-07 13:08:18,434 INFO L290 TraceCheckUtils]: 24: Hoare triple {7602#true} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {7602#true} is VALID [2022-04-07 13:08:18,434 INFO L290 TraceCheckUtils]: 25: Hoare triple {7602#true} assume !!(#t~post5 < 20);havoc #t~post5; {7602#true} is VALID [2022-04-07 13:08:18,434 INFO L290 TraceCheckUtils]: 26: Hoare triple {7602#true} assume !!(~q~0 % 4294967296 <= ~n~0 % 4294967296);~q~0 := 4 * ~q~0; {7602#true} is VALID [2022-04-07 13:08:18,434 INFO L290 TraceCheckUtils]: 27: Hoare triple {7602#true} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {7602#true} is VALID [2022-04-07 13:08:18,434 INFO L290 TraceCheckUtils]: 28: Hoare triple {7602#true} assume !!(#t~post5 < 20);havoc #t~post5; {7602#true} is VALID [2022-04-07 13:08:18,434 INFO L290 TraceCheckUtils]: 29: Hoare triple {7602#true} assume !!(~q~0 % 4294967296 <= ~n~0 % 4294967296);~q~0 := 4 * ~q~0; {7602#true} is VALID [2022-04-07 13:08:18,434 INFO L290 TraceCheckUtils]: 30: Hoare triple {7602#true} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {7602#true} is VALID [2022-04-07 13:08:18,434 INFO L290 TraceCheckUtils]: 31: Hoare triple {7602#true} assume !!(#t~post5 < 20);havoc #t~post5; {7602#true} is VALID [2022-04-07 13:08:18,434 INFO L290 TraceCheckUtils]: 32: Hoare triple {7602#true} assume !!(~q~0 % 4294967296 <= ~n~0 % 4294967296);~q~0 := 4 * ~q~0; {7602#true} is VALID [2022-04-07 13:08:18,434 INFO L290 TraceCheckUtils]: 33: Hoare triple {7602#true} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {7602#true} is VALID [2022-04-07 13:08:18,434 INFO L290 TraceCheckUtils]: 34: Hoare triple {7602#true} assume !!(#t~post5 < 20);havoc #t~post5; {7602#true} is VALID [2022-04-07 13:08:18,434 INFO L290 TraceCheckUtils]: 35: Hoare triple {7602#true} assume !!(~q~0 % 4294967296 <= ~n~0 % 4294967296);~q~0 := 4 * ~q~0; {7602#true} is VALID [2022-04-07 13:08:18,434 INFO L290 TraceCheckUtils]: 36: Hoare triple {7602#true} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {7602#true} is VALID [2022-04-07 13:08:18,434 INFO L290 TraceCheckUtils]: 37: Hoare triple {7602#true} assume !!(#t~post5 < 20);havoc #t~post5; {7602#true} is VALID [2022-04-07 13:08:18,434 INFO L290 TraceCheckUtils]: 38: Hoare triple {7602#true} assume !!(~q~0 % 4294967296 <= ~n~0 % 4294967296);~q~0 := 4 * ~q~0; {7602#true} is VALID [2022-04-07 13:08:18,434 INFO L290 TraceCheckUtils]: 39: Hoare triple {7602#true} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {7602#true} is VALID [2022-04-07 13:08:18,434 INFO L290 TraceCheckUtils]: 40: Hoare triple {7602#true} assume !!(#t~post5 < 20);havoc #t~post5; {7602#true} is VALID [2022-04-07 13:08:18,435 INFO L290 TraceCheckUtils]: 41: Hoare triple {7602#true} assume !!(~q~0 % 4294967296 <= ~n~0 % 4294967296);~q~0 := 4 * ~q~0; {7602#true} is VALID [2022-04-07 13:08:18,435 INFO L290 TraceCheckUtils]: 42: Hoare triple {7602#true} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {7753#(<= (+ |main_#t~post5| 1) ~counter~0)} is VALID [2022-04-07 13:08:18,436 INFO L290 TraceCheckUtils]: 43: Hoare triple {7753#(<= (+ |main_#t~post5| 1) ~counter~0)} assume !(#t~post5 < 20);havoc #t~post5; {7757#(<= 21 ~counter~0)} is VALID [2022-04-07 13:08:18,436 INFO L290 TraceCheckUtils]: 44: Hoare triple {7757#(<= 21 ~counter~0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {7761#(<= 21 |main_#t~post6|)} is VALID [2022-04-07 13:08:18,436 INFO L290 TraceCheckUtils]: 45: Hoare triple {7761#(<= 21 |main_#t~post6|)} assume !!(#t~post6 < 20);havoc #t~post6; {7603#false} is VALID [2022-04-07 13:08:18,436 INFO L272 TraceCheckUtils]: 46: Hoare triple {7603#false} call __VERIFIER_assert((if ~r~0 % 4294967296 < (2 * ~p~0 + ~q~0) % 4294967296 then 1 else 0)); {7603#false} is VALID [2022-04-07 13:08:18,436 INFO L290 TraceCheckUtils]: 47: Hoare triple {7603#false} ~cond := #in~cond; {7603#false} is VALID [2022-04-07 13:08:18,436 INFO L290 TraceCheckUtils]: 48: Hoare triple {7603#false} assume 0 == ~cond; {7603#false} is VALID [2022-04-07 13:08:18,437 INFO L290 TraceCheckUtils]: 49: Hoare triple {7603#false} assume !false; {7603#false} is VALID [2022-04-07 13:08:18,437 INFO L134 CoverageAnalysis]: Checked inductivity of 155 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2022-04-07 13:08:18,437 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-07 13:08:18,437 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1456853905] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 13:08:18,437 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-04-07 13:08:18,437 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [15] total 18 [2022-04-07 13:08:18,437 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [350885663] [2022-04-07 13:08:18,437 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 13:08:18,438 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 50 [2022-04-07 13:08:18,438 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 13:08:18,438 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-07 13:08:18,453 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 13:08:18,453 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-07 13:08:18,453 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 13:08:18,454 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-07 13:08:18,454 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=218, Unknown=0, NotChecked=0, Total=306 [2022-04-07 13:08:18,454 INFO L87 Difference]: Start difference. First operand 353 states and 462 transitions. Second operand has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-07 13:08:21,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 13:08:21,603 INFO L93 Difference]: Finished difference Result 384 states and 500 transitions. [2022-04-07 13:08:21,603 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-07 13:08:21,603 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 50 [2022-04-07 13:08:21,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 13:08:21,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-07 13:08:21,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 77 transitions. [2022-04-07 13:08:21,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-07 13:08:21,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 77 transitions. [2022-04-07 13:08:21,605 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 77 transitions. [2022-04-07 13:08:21,665 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 77 edges. 77 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 13:08:21,672 INFO L225 Difference]: With dead ends: 384 [2022-04-07 13:08:21,672 INFO L226 Difference]: Without dead ends: 344 [2022-04-07 13:08:21,673 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=92, Invalid=250, Unknown=0, NotChecked=0, Total=342 [2022-04-07 13:08:21,673 INFO L913 BasicCegarLoop]: 44 mSDtfsCounter, 0 mSDsluCounter, 123 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 167 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-07 13:08:21,673 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 167 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-07 13:08:21,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 344 states. [2022-04-07 13:08:21,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 344 to 339. [2022-04-07 13:08:21,793 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 13:08:21,793 INFO L82 GeneralOperation]: Start isEquivalent. First operand 344 states. Second operand has 339 states, 191 states have (on average 1.1884816753926701) internal successors, (227), 208 states have internal predecessors, (227), 111 states have call successors, (111), 37 states have call predecessors, (111), 36 states have return successors, (102), 93 states have call predecessors, (102), 102 states have call successors, (102) [2022-04-07 13:08:21,794 INFO L74 IsIncluded]: Start isIncluded. First operand 344 states. Second operand has 339 states, 191 states have (on average 1.1884816753926701) internal successors, (227), 208 states have internal predecessors, (227), 111 states have call successors, (111), 37 states have call predecessors, (111), 36 states have return successors, (102), 93 states have call predecessors, (102), 102 states have call successors, (102) [2022-04-07 13:08:21,794 INFO L87 Difference]: Start difference. First operand 344 states. Second operand has 339 states, 191 states have (on average 1.1884816753926701) internal successors, (227), 208 states have internal predecessors, (227), 111 states have call successors, (111), 37 states have call predecessors, (111), 36 states have return successors, (102), 93 states have call predecessors, (102), 102 states have call successors, (102) [2022-04-07 13:08:21,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 13:08:21,801 INFO L93 Difference]: Finished difference Result 344 states and 446 transitions. [2022-04-07 13:08:21,801 INFO L276 IsEmpty]: Start isEmpty. Operand 344 states and 446 transitions. [2022-04-07 13:08:21,815 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 13:08:21,816 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 13:08:21,817 INFO L74 IsIncluded]: Start isIncluded. First operand has 339 states, 191 states have (on average 1.1884816753926701) internal successors, (227), 208 states have internal predecessors, (227), 111 states have call successors, (111), 37 states have call predecessors, (111), 36 states have return successors, (102), 93 states have call predecessors, (102), 102 states have call successors, (102) Second operand 344 states. [2022-04-07 13:08:21,817 INFO L87 Difference]: Start difference. First operand has 339 states, 191 states have (on average 1.1884816753926701) internal successors, (227), 208 states have internal predecessors, (227), 111 states have call successors, (111), 37 states have call predecessors, (111), 36 states have return successors, (102), 93 states have call predecessors, (102), 102 states have call successors, (102) Second operand 344 states. [2022-04-07 13:08:21,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 13:08:21,824 INFO L93 Difference]: Finished difference Result 344 states and 446 transitions. [2022-04-07 13:08:21,824 INFO L276 IsEmpty]: Start isEmpty. Operand 344 states and 446 transitions. [2022-04-07 13:08:21,825 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 13:08:21,825 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 13:08:21,825 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 13:08:21,825 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 13:08:21,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 339 states, 191 states have (on average 1.1884816753926701) internal successors, (227), 208 states have internal predecessors, (227), 111 states have call successors, (111), 37 states have call predecessors, (111), 36 states have return successors, (102), 93 states have call predecessors, (102), 102 states have call successors, (102) [2022-04-07 13:08:21,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 339 states to 339 states and 440 transitions. [2022-04-07 13:08:21,833 INFO L78 Accepts]: Start accepts. Automaton has 339 states and 440 transitions. Word has length 50 [2022-04-07 13:08:21,833 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 13:08:21,833 INFO L478 AbstractCegarLoop]: Abstraction has 339 states and 440 transitions. [2022-04-07 13:08:21,833 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-07 13:08:21,833 INFO L276 IsEmpty]: Start isEmpty. Operand 339 states and 440 transitions. [2022-04-07 13:08:21,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-04-07 13:08:21,834 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 13:08:21,834 INFO L499 BasicCegarLoop]: trace histogram [7, 6, 6, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 13:08:21,853 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-04-07 13:08:22,040 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 13:08:22,041 INFO L403 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 13:08:22,041 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 13:08:22,041 INFO L85 PathProgramCache]: Analyzing trace with hash 109392637, now seen corresponding path program 1 times [2022-04-07 13:08:22,041 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 13:08:22,041 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1899858502] [2022-04-07 13:08:22,041 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 13:08:22,041 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 13:08:22,051 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-07 13:08:22,052 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1559284067] [2022-04-07 13:08:22,052 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 13:08:22,052 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 13:08:22,052 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 13:08:22,063 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-07 13:08:22,065 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process