/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-fb4f59a-m [2022-04-27 12:17:34,113 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-27 12:17:34,114 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-27 12:17:34,138 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-27 12:17:34,139 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-27 12:17:34,139 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-27 12:17:34,140 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-27 12:17:34,141 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-27 12:17:34,142 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-27 12:17:34,143 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-27 12:17:34,144 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-27 12:17:34,144 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-27 12:17:34,145 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-27 12:17:34,145 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-27 12:17:34,146 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-27 12:17:34,147 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-27 12:17:34,150 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-27 12:17:34,152 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-27 12:17:34,157 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-27 12:17:34,159 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-27 12:17:34,160 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-27 12:17:34,160 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-27 12:17:34,161 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-27 12:17:34,162 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-27 12:17:34,162 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-27 12:17:34,163 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-27 12:17:34,164 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-27 12:17:34,164 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-27 12:17:34,164 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-27 12:17:34,165 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-27 12:17:34,165 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-27 12:17:34,165 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-27 12:17:34,166 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-27 12:17:34,166 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-27 12:17:34,166 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-27 12:17:34,167 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-27 12:17:34,167 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-27 12:17:34,168 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-27 12:17:34,168 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-27 12:17:34,168 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-27 12:17:34,168 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-27 12:17:34,169 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-27 12:17:34,170 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2022-04-27 12:17:34,188 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-27 12:17:34,189 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-27 12:17:34,189 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-04-27 12:17:34,189 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-04-27 12:17:34,190 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-04-27 12:17:34,190 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-04-27 12:17:34,190 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-04-27 12:17:34,190 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-04-27 12:17:34,191 INFO L138 SettingsManager]: * Use SBE=true [2022-04-27 12:17:34,191 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-27 12:17:34,191 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-27 12:17:34,191 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-27 12:17:34,191 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-27 12:17:34,192 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-27 12:17:34,192 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-27 12:17:34,192 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-27 12:17:34,192 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-27 12:17:34,192 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-27 12:17:34,192 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-27 12:17:34,192 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-27 12:17:34,192 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-27 12:17:34,192 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-27 12:17:34,192 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-27 12:17:34,193 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-27 12:17:34,193 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 12:17:34,193 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-27 12:17:34,193 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-04-27 12:17:34,193 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-04-27 12:17:34,193 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-04-27 12:17:34,193 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-04-27 12:17:34,193 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-04-27 12:17:34,193 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-04-27 12:17:34,194 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-27 12:17:34,194 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-04-27 12:17:34,359 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-27 12:17:34,376 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-27 12:17:34,378 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-27 12:17:34,378 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-27 12:17:34,379 INFO L275 PluginConnector]: CDTParser initialized [2022-04-27 12:17:34,379 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-27 12:17:34,430 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b5a60b1b2/4d99ac58d4af4d2da44a1d0f3ee6c076/FLAGb356bc4f9 [2022-04-27 12:17:34,778 INFO L306 CDTParser]: Found 1 translation units. [2022-04-27 12:17:34,778 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/dijkstra-u_unwindbound20.c [2022-04-27 12:17:34,782 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b5a60b1b2/4d99ac58d4af4d2da44a1d0f3ee6c076/FLAGb356bc4f9 [2022-04-27 12:17:34,791 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b5a60b1b2/4d99ac58d4af4d2da44a1d0f3ee6c076 [2022-04-27 12:17:34,792 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-27 12:17:34,793 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-27 12:17:34,794 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-27 12:17:34,794 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-27 12:17:34,796 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-27 12:17:34,797 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 12:17:34" (1/1) ... [2022-04-27 12:17:34,798 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@362b78c0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 12:17:34, skipping insertion in model container [2022-04-27 12:17:34,798 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 12:17:34" (1/1) ... [2022-04-27 12:17:34,802 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-27 12:17:34,817 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-27 12:17:34,962 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-27 12:17:34,986 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 12:17:34,992 INFO L203 MainTranslator]: Completed pre-run [2022-04-27 12:17:35,000 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-27 12:17:35,014 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 12:17:35,023 INFO L208 MainTranslator]: Completed translation [2022-04-27 12:17:35,023 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 12:17:35 WrapperNode [2022-04-27 12:17:35,024 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-27 12:17:35,024 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-27 12:17:35,024 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-27 12:17:35,024 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-27 12:17:35,032 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 12:17:35" (1/1) ... [2022-04-27 12:17:35,032 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 12:17:35" (1/1) ... [2022-04-27 12:17:35,047 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 12:17:35" (1/1) ... [2022-04-27 12:17:35,048 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 12:17:35" (1/1) ... [2022-04-27 12:17:35,053 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 12:17:35" (1/1) ... [2022-04-27 12:17:35,056 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 12:17:35" (1/1) ... [2022-04-27 12:17:35,057 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 12:17:35" (1/1) ... [2022-04-27 12:17:35,058 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-27 12:17:35,058 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-27 12:17:35,058 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-27 12:17:35,059 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-27 12:17:35,067 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 12:17:35" (1/1) ... [2022-04-27 12:17:35,077 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 12:17:35,085 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 12:17:35,109 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-04-27 12:17:35,126 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-04-27 12:17:35,142 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-27 12:17:35,143 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-27 12:17:35,143 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-27 12:17:35,144 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-27 12:17:35,145 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-27 12:17:35,145 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-27 12:17:35,145 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-27 12:17:35,145 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-27 12:17:35,145 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-27 12:17:35,146 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-27 12:17:35,146 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uint [2022-04-27 12:17:35,146 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-27 12:17:35,146 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-27 12:17:35,146 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-27 12:17:35,146 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-27 12:17:35,146 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-27 12:17:35,146 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-27 12:17:35,147 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-27 12:17:35,147 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-27 12:17:35,147 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-27 12:17:35,192 INFO L234 CfgBuilder]: Building ICFG [2022-04-27 12:17:35,193 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-27 12:17:35,387 INFO L275 CfgBuilder]: Performing block encoding [2022-04-27 12:17:35,392 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-27 12:17:35,392 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-04-27 12:17:35,394 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 12:17:35 BoogieIcfgContainer [2022-04-27 12:17:35,394 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-27 12:17:35,395 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-27 12:17:35,395 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-27 12:17:35,397 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-27 12:17:35,397 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.04 12:17:34" (1/3) ... [2022-04-27 12:17:35,398 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1d423f1a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 12:17:35, skipping insertion in model container [2022-04-27 12:17:35,398 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 12:17:35" (2/3) ... [2022-04-27 12:17:35,399 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1d423f1a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 12:17:35, skipping insertion in model container [2022-04-27 12:17:35,400 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 12:17:35" (3/3) ... [2022-04-27 12:17:35,400 INFO L111 eAbstractionObserver]: Analyzing ICFG dijkstra-u_unwindbound20.c [2022-04-27 12:17:35,410 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-04-27 12:17:35,410 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-27 12:17:35,454 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-27 12:17:35,459 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@2138eaa3, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@5b08bd82 [2022-04-27 12:17:35,459 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-27 12:17:35,476 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-27 12:17:35,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-04-27 12:17:35,481 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 12:17:35,481 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 12:17:35,482 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 12:17:35,485 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 12:17:35,485 INFO L85 PathProgramCache]: Analyzing trace with hash -2024343623, now seen corresponding path program 1 times [2022-04-27 12:17:35,491 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 12:17:35,491 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [262268778] [2022-04-27 12:17:35,492 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 12:17:35,492 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 12:17:35,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:17:35,593 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 12:17:35,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:17:35,607 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-27 12:17:35,607 INFO L290 TraceCheckUtils]: 1: Hoare triple {42#true} assume true; {42#true} is VALID [2022-04-27 12:17:35,607 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {42#true} {42#true} #102#return; {42#true} is VALID [2022-04-27 12:17:35,609 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-27 12:17:35,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:17:35,615 INFO L290 TraceCheckUtils]: 0: Hoare triple {42#true} ~cond := #in~cond; {42#true} is VALID [2022-04-27 12:17:35,616 INFO L290 TraceCheckUtils]: 1: Hoare triple {42#true} assume 0 == ~cond;assume false; {43#false} is VALID [2022-04-27 12:17:35,616 INFO L290 TraceCheckUtils]: 2: Hoare triple {43#false} assume true; {43#false} is VALID [2022-04-27 12:17:35,616 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {43#false} {42#true} #82#return; {43#false} is VALID [2022-04-27 12:17:35,617 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-27 12:17:35,618 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-27 12:17:35,618 INFO L290 TraceCheckUtils]: 2: Hoare triple {42#true} assume true; {42#true} is VALID [2022-04-27 12:17:35,618 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {42#true} {42#true} #102#return; {42#true} is VALID [2022-04-27 12:17:35,618 INFO L272 TraceCheckUtils]: 4: Hoare triple {42#true} call #t~ret7 := main(); {42#true} is VALID [2022-04-27 12:17:35,618 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-27 12:17:35,619 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-27 12:17:35,619 INFO L290 TraceCheckUtils]: 7: Hoare triple {42#true} ~cond := #in~cond; {42#true} is VALID [2022-04-27 12:17:35,619 INFO L290 TraceCheckUtils]: 8: Hoare triple {42#true} assume 0 == ~cond;assume false; {43#false} is VALID [2022-04-27 12:17:35,619 INFO L290 TraceCheckUtils]: 9: Hoare triple {43#false} assume true; {43#false} is VALID [2022-04-27 12:17:35,620 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {43#false} {42#true} #82#return; {43#false} is VALID [2022-04-27 12:17:35,620 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-27 12:17:35,620 INFO L290 TraceCheckUtils]: 12: Hoare triple {43#false} assume !true; {43#false} is VALID [2022-04-27 12:17:35,620 INFO L290 TraceCheckUtils]: 13: Hoare triple {43#false} assume !true; {43#false} is VALID [2022-04-27 12:17:35,620 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-27 12:17:35,620 INFO L290 TraceCheckUtils]: 15: Hoare triple {43#false} ~cond := #in~cond; {43#false} is VALID [2022-04-27 12:17:35,621 INFO L290 TraceCheckUtils]: 16: Hoare triple {43#false} assume 0 == ~cond; {43#false} is VALID [2022-04-27 12:17:35,621 INFO L290 TraceCheckUtils]: 17: Hoare triple {43#false} assume !false; {43#false} is VALID [2022-04-27 12:17:35,621 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 12:17:35,621 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 12:17:35,622 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [262268778] [2022-04-27 12:17:35,622 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [262268778] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 12:17:35,622 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 12:17:35,622 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-27 12:17:35,623 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [657239240] [2022-04-27 12:17:35,624 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 12:17:35,628 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-27 12:17:35,629 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 12:17:35,631 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-27 12:17:35,652 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 12:17:35,652 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-27 12:17:35,652 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 12:17:35,666 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-27 12:17:35,666 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-27 12:17:35,668 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-27 12:17:41,700 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.73s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-27 12:17:42,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:17:42,450 INFO L93 Difference]: Finished difference Result 70 states and 111 transitions. [2022-04-27 12:17:42,450 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-27 12:17:42,450 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-27 12:17:42,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 12:17:42,451 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-27 12:17:42,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 111 transitions. [2022-04-27 12:17:42,458 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-27 12:17:42,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 111 transitions. [2022-04-27 12:17:42,467 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 111 transitions. [2022-04-27 12:17:42,579 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-27 12:17:42,585 INFO L225 Difference]: With dead ends: 70 [2022-04-27 12:17:42,586 INFO L226 Difference]: Without dead ends: 35 [2022-04-27 12:17:42,587 INFO L412 NwaCegarLoop]: 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-27 12:17:42,589 INFO L413 NwaCegarLoop]: 49 mSDtfsCounter, 10 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 53 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2022-04-27 12:17:42,590 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 53 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2022-04-27 12:17:42,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2022-04-27 12:17:42,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 34. [2022-04-27 12:17:42,611 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 12:17:42,611 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-27 12:17:42,612 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-27 12:17:42,612 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-27 12:17:42,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:17:42,616 INFO L93 Difference]: Finished difference Result 35 states and 47 transitions. [2022-04-27 12:17:42,616 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 47 transitions. [2022-04-27 12:17:42,617 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 12:17:42,617 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 12:17:42,618 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-27 12:17:42,618 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-27 12:17:42,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:17:42,621 INFO L93 Difference]: Finished difference Result 35 states and 47 transitions. [2022-04-27 12:17:42,621 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 47 transitions. [2022-04-27 12:17:42,622 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 12:17:42,622 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 12:17:42,622 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 12:17:42,622 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 12:17:42,622 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-27 12:17:42,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 46 transitions. [2022-04-27 12:17:42,625 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 46 transitions. Word has length 18 [2022-04-27 12:17:42,625 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 12:17:42,626 INFO L495 AbstractCegarLoop]: Abstraction has 34 states and 46 transitions. [2022-04-27 12:17:42,626 INFO L496 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-27 12:17:42,626 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 46 transitions. [2022-04-27 12:17:42,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-04-27 12:17:42,626 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 12:17:42,627 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 12:17:42,627 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-27 12:17:42,627 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 12:17:42,628 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 12:17:42,628 INFO L85 PathProgramCache]: Analyzing trace with hash -96361696, now seen corresponding path program 1 times [2022-04-27 12:17:42,628 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 12:17:42,628 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [19427455] [2022-04-27 12:17:42,628 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 12:17:42,628 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 12:17:42,642 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 12:17:42,643 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1390903631] [2022-04-27 12:17:42,643 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 12:17:42,643 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 12:17:42,643 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 12:17:42,644 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 12:17:42,645 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-04-27 12:17:42,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:17:42,707 INFO L263 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 5 conjunts are in the unsatisfiable core [2022-04-27 12:17:42,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:17:42,718 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 12:17:42,853 INFO L272 TraceCheckUtils]: 0: Hoare triple {274#true} call ULTIMATE.init(); {274#true} is VALID [2022-04-27 12:17:42,854 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-27 12:17:42,854 INFO L290 TraceCheckUtils]: 2: Hoare triple {282#(<= ~counter~0 0)} assume true; {282#(<= ~counter~0 0)} is VALID [2022-04-27 12:17:42,855 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {282#(<= ~counter~0 0)} {274#true} #102#return; {282#(<= ~counter~0 0)} is VALID [2022-04-27 12:17:42,855 INFO L272 TraceCheckUtils]: 4: Hoare triple {282#(<= ~counter~0 0)} call #t~ret7 := main(); {282#(<= ~counter~0 0)} is VALID [2022-04-27 12:17:42,855 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-27 12:17:42,856 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-27 12:17:42,856 INFO L290 TraceCheckUtils]: 7: Hoare triple {282#(<= ~counter~0 0)} ~cond := #in~cond; {282#(<= ~counter~0 0)} is VALID [2022-04-27 12:17:42,857 INFO L290 TraceCheckUtils]: 8: Hoare triple {282#(<= ~counter~0 0)} assume !(0 == ~cond); {282#(<= ~counter~0 0)} is VALID [2022-04-27 12:17:42,857 INFO L290 TraceCheckUtils]: 9: Hoare triple {282#(<= ~counter~0 0)} assume true; {282#(<= ~counter~0 0)} is VALID [2022-04-27 12:17:42,858 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {282#(<= ~counter~0 0)} {282#(<= ~counter~0 0)} #82#return; {282#(<= ~counter~0 0)} is VALID [2022-04-27 12:17:42,858 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-27 12:17:42,859 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-27 12:17:42,860 INFO L290 TraceCheckUtils]: 13: Hoare triple {316#(<= |main_#t~post5| 0)} assume !(#t~post5 < 20);havoc #t~post5; {275#false} is VALID [2022-04-27 12:17:42,860 INFO L290 TraceCheckUtils]: 14: Hoare triple {275#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {275#false} is VALID [2022-04-27 12:17:42,860 INFO L290 TraceCheckUtils]: 15: Hoare triple {275#false} assume !(#t~post6 < 20);havoc #t~post6; {275#false} is VALID [2022-04-27 12:17:42,860 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-27 12:17:42,860 INFO L290 TraceCheckUtils]: 17: Hoare triple {275#false} ~cond := #in~cond; {275#false} is VALID [2022-04-27 12:17:42,861 INFO L290 TraceCheckUtils]: 18: Hoare triple {275#false} assume 0 == ~cond; {275#false} is VALID [2022-04-27 12:17:42,861 INFO L290 TraceCheckUtils]: 19: Hoare triple {275#false} assume !false; {275#false} is VALID [2022-04-27 12:17:42,861 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 12:17:42,862 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-27 12:17:42,862 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 12:17:42,864 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [19427455] [2022-04-27 12:17:42,864 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 12:17:42,865 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1390903631] [2022-04-27 12:17:42,865 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1390903631] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 12:17:42,865 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 12:17:42,865 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-27 12:17:42,866 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1506109616] [2022-04-27 12:17:42,867 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 12:17:42,868 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-27 12:17:42,868 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 12:17:42,869 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-27 12:17:42,884 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-27 12:17:42,884 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-27 12:17:42,885 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 12:17:42,885 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-27 12:17:42,885 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-27 12:17:42,886 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-27 12:17:49,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:17:49,028 INFO L93 Difference]: Finished difference Result 55 states and 78 transitions. [2022-04-27 12:17:49,028 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-27 12:17:49,028 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-27 12:17:49,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 12:17:49,028 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-27 12:17:49,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 78 transitions. [2022-04-27 12:17:49,031 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-27 12:17:49,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 78 transitions. [2022-04-27 12:17:49,033 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 78 transitions. [2022-04-27 12:17:49,104 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-27 12:17:49,106 INFO L225 Difference]: With dead ends: 55 [2022-04-27 12:17:49,106 INFO L226 Difference]: Without dead ends: 36 [2022-04-27 12:17:49,107 INFO L412 NwaCegarLoop]: 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-27 12:17:49,107 INFO L413 NwaCegarLoop]: 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-27 12:17:49,108 INFO L414 NwaCegarLoop]: 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-27 12:17:49,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2022-04-27 12:17:49,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2022-04-27 12:17:49,115 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 12:17:49,116 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-27 12:17:49,116 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-27 12:17:49,116 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-27 12:17:49,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:17:49,118 INFO L93 Difference]: Finished difference Result 36 states and 48 transitions. [2022-04-27 12:17:49,119 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 48 transitions. [2022-04-27 12:17:49,119 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 12:17:49,119 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 12:17:49,119 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-27 12:17:49,120 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-27 12:17:49,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:17:49,122 INFO L93 Difference]: Finished difference Result 36 states and 48 transitions. [2022-04-27 12:17:49,122 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 48 transitions. [2022-04-27 12:17:49,122 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 12:17:49,123 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 12:17:49,123 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 12:17:49,123 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 12:17:49,123 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-27 12:17:49,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 48 transitions. [2022-04-27 12:17:49,125 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 48 transitions. Word has length 20 [2022-04-27 12:17:49,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 12:17:49,125 INFO L495 AbstractCegarLoop]: Abstraction has 36 states and 48 transitions. [2022-04-27 12:17:49,125 INFO L496 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-27 12:17:49,125 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 48 transitions. [2022-04-27 12:17:49,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-04-27 12:17:49,126 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 12:17:49,126 INFO L195 NwaCegarLoop]: 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-27 12:17:49,146 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-04-27 12:17:49,348 WARN L477 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-27 12:17:49,349 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 12:17:49,349 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 12:17:49,350 INFO L85 PathProgramCache]: Analyzing trace with hash 962099791, now seen corresponding path program 1 times [2022-04-27 12:17:49,350 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 12:17:49,350 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [109901815] [2022-04-27 12:17:49,350 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 12:17:49,350 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 12:17:49,363 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 12:17:49,364 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1619907086] [2022-04-27 12:17:49,364 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 12:17:49,364 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 12:17:49,364 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 12:17:49,365 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 12:17:49,366 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-04-27 12:17:49,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:17:49,400 INFO L263 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-27 12:17:49,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:17:49,408 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 12:17:49,525 INFO L272 TraceCheckUtils]: 0: Hoare triple {546#true} call ULTIMATE.init(); {546#true} is VALID [2022-04-27 12:17:49,525 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-27 12:17:49,526 INFO L290 TraceCheckUtils]: 2: Hoare triple {554#(<= ~counter~0 0)} assume true; {554#(<= ~counter~0 0)} is VALID [2022-04-27 12:17:49,526 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {554#(<= ~counter~0 0)} {546#true} #102#return; {554#(<= ~counter~0 0)} is VALID [2022-04-27 12:17:49,527 INFO L272 TraceCheckUtils]: 4: Hoare triple {554#(<= ~counter~0 0)} call #t~ret7 := main(); {554#(<= ~counter~0 0)} is VALID [2022-04-27 12:17:49,527 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-27 12:17:49,528 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-27 12:17:49,528 INFO L290 TraceCheckUtils]: 7: Hoare triple {554#(<= ~counter~0 0)} ~cond := #in~cond; {554#(<= ~counter~0 0)} is VALID [2022-04-27 12:17:49,529 INFO L290 TraceCheckUtils]: 8: Hoare triple {554#(<= ~counter~0 0)} assume !(0 == ~cond); {554#(<= ~counter~0 0)} is VALID [2022-04-27 12:17:49,529 INFO L290 TraceCheckUtils]: 9: Hoare triple {554#(<= ~counter~0 0)} assume true; {554#(<= ~counter~0 0)} is VALID [2022-04-27 12:17:49,529 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {554#(<= ~counter~0 0)} {554#(<= ~counter~0 0)} #82#return; {554#(<= ~counter~0 0)} is VALID [2022-04-27 12:17:49,530 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-27 12:17:49,530 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-27 12:17:49,531 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-27 12:17:49,531 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-27 12:17:49,532 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-27 12:17:49,532 INFO L290 TraceCheckUtils]: 16: Hoare triple {598#(<= |main_#t~post6| 1)} assume !(#t~post6 < 20);havoc #t~post6; {547#false} is VALID [2022-04-27 12:17:49,532 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-27 12:17:49,532 INFO L290 TraceCheckUtils]: 18: Hoare triple {547#false} ~cond := #in~cond; {547#false} is VALID [2022-04-27 12:17:49,533 INFO L290 TraceCheckUtils]: 19: Hoare triple {547#false} assume 0 == ~cond; {547#false} is VALID [2022-04-27 12:17:49,533 INFO L290 TraceCheckUtils]: 20: Hoare triple {547#false} assume !false; {547#false} is VALID [2022-04-27 12:17:49,533 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 12:17:49,533 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-27 12:17:49,533 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 12:17:49,533 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [109901815] [2022-04-27 12:17:49,533 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 12:17:49,533 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1619907086] [2022-04-27 12:17:49,534 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1619907086] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 12:17:49,534 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 12:17:49,534 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-27 12:17:49,534 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [102613190] [2022-04-27 12:17:49,534 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 12:17:49,534 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-27 12:17:49,535 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 12:17:49,535 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-27 12:17:49,550 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-27 12:17:49,550 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-27 12:17:49,550 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 12:17:49,551 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-27 12:17:49,551 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-04-27 12:17:49,551 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-27 12:17:52,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:17:52,913 INFO L93 Difference]: Finished difference Result 49 states and 64 transitions. [2022-04-27 12:17:52,913 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-27 12:17:52,913 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-27 12:17:52,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 12:17:52,914 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-27 12:17:52,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 64 transitions. [2022-04-27 12:17:52,915 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-27 12:17:52,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 64 transitions. [2022-04-27 12:17:52,917 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 64 transitions. [2022-04-27 12:17:52,982 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-27 12:17:52,983 INFO L225 Difference]: With dead ends: 49 [2022-04-27 12:17:52,983 INFO L226 Difference]: Without dead ends: 40 [2022-04-27 12:17:52,983 INFO L412 NwaCegarLoop]: 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-27 12:17:52,984 INFO L413 NwaCegarLoop]: 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-27 12:17:52,984 INFO L414 NwaCegarLoop]: 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-27 12:17:52,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2022-04-27 12:17:52,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 39. [2022-04-27 12:17:52,990 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 12:17:52,991 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-27 12:17:52,991 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-27 12:17:52,991 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-27 12:17:52,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:17:52,993 INFO L93 Difference]: Finished difference Result 40 states and 53 transitions. [2022-04-27 12:17:52,993 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 53 transitions. [2022-04-27 12:17:52,994 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 12:17:52,994 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 12:17:52,994 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-27 12:17:52,994 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-27 12:17:52,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:17:52,996 INFO L93 Difference]: Finished difference Result 40 states and 53 transitions. [2022-04-27 12:17:52,996 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 53 transitions. [2022-04-27 12:17:52,997 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 12:17:52,997 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 12:17:52,997 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 12:17:52,997 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 12:17:52,997 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-27 12:17:52,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 52 transitions. [2022-04-27 12:17:52,999 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 52 transitions. Word has length 21 [2022-04-27 12:17:52,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 12:17:52,999 INFO L495 AbstractCegarLoop]: Abstraction has 39 states and 52 transitions. [2022-04-27 12:17:52,999 INFO L496 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-27 12:17:52,999 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 52 transitions. [2022-04-27 12:17:52,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-04-27 12:17:52,999 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 12:17:53,000 INFO L195 NwaCegarLoop]: 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-27 12:17:53,025 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-04-27 12:17:53,216 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2022-04-27 12:17:53,217 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 12:17:53,217 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 12:17:53,217 INFO L85 PathProgramCache]: Analyzing trace with hash 963589341, now seen corresponding path program 1 times [2022-04-27 12:17:53,217 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 12:17:53,217 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [833915852] [2022-04-27 12:17:53,217 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 12:17:53,217 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 12:17:53,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:17:53,412 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 12:17:53,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:17:53,421 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-27 12:17:53,421 INFO L290 TraceCheckUtils]: 1: Hoare triple {822#true} assume true; {822#true} is VALID [2022-04-27 12:17:53,421 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {822#true} {822#true} #102#return; {822#true} is VALID [2022-04-27 12:17:53,421 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-27 12:17:53,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:17:53,425 INFO L290 TraceCheckUtils]: 0: Hoare triple {822#true} ~cond := #in~cond; {822#true} is VALID [2022-04-27 12:17:53,425 INFO L290 TraceCheckUtils]: 1: Hoare triple {822#true} assume !(0 == ~cond); {822#true} is VALID [2022-04-27 12:17:53,425 INFO L290 TraceCheckUtils]: 2: Hoare triple {822#true} assume true; {822#true} is VALID [2022-04-27 12:17:53,425 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {822#true} {822#true} #82#return; {822#true} is VALID [2022-04-27 12:17:53,426 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-27 12:17:53,426 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-27 12:17:53,426 INFO L290 TraceCheckUtils]: 2: Hoare triple {822#true} assume true; {822#true} is VALID [2022-04-27 12:17:53,426 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {822#true} {822#true} #102#return; {822#true} is VALID [2022-04-27 12:17:53,426 INFO L272 TraceCheckUtils]: 4: Hoare triple {822#true} call #t~ret7 := main(); {822#true} is VALID [2022-04-27 12:17:53,426 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-27 12:17:53,426 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-27 12:17:53,427 INFO L290 TraceCheckUtils]: 7: Hoare triple {822#true} ~cond := #in~cond; {822#true} is VALID [2022-04-27 12:17:53,427 INFO L290 TraceCheckUtils]: 8: Hoare triple {822#true} assume !(0 == ~cond); {822#true} is VALID [2022-04-27 12:17:53,427 INFO L290 TraceCheckUtils]: 9: Hoare triple {822#true} assume true; {822#true} is VALID [2022-04-27 12:17:53,427 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {822#true} {822#true} #82#return; {822#true} is VALID [2022-04-27 12:17:53,427 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-27 12:17:53,428 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-27 12:17:53,428 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-27 12:17:53,429 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-27 12:17:53,430 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-27 12:17:53,430 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-27 12:17:53,431 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-27 12:17:53,431 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-27 12:17:53,432 INFO L290 TraceCheckUtils]: 19: Hoare triple {834#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {823#false} is VALID [2022-04-27 12:17:53,432 INFO L290 TraceCheckUtils]: 20: Hoare triple {823#false} assume !false; {823#false} is VALID [2022-04-27 12:17:53,432 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 12:17:53,432 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 12:17:53,432 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [833915852] [2022-04-27 12:17:53,432 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [833915852] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 12:17:53,433 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 12:17:53,433 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-27 12:17:53,433 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [763466247] [2022-04-27 12:17:53,433 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 12:17:53,433 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-27 12:17:53,433 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 12:17:53,434 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-27 12:17:53,451 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-27 12:17:53,451 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-27 12:17:53,451 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 12:17:53,452 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-27 12:17:53,452 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-04-27 12:17:53,452 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-27 12:17:57,661 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-27 12:18:09,295 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-27 12:18:10,479 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.14s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-27 12:18:12,481 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-27 12:18:14,796 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-27 12:18:17,120 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-27 12:18:19,126 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-27 12:18:21,127 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-27 12:18:21,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:18:21,180 INFO L93 Difference]: Finished difference Result 72 states and 104 transitions. [2022-04-27 12:18:21,180 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-27 12:18:21,180 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-27 12:18:21,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 12:18:21,182 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-27 12:18:21,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 104 transitions. [2022-04-27 12:18:21,188 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-27 12:18:21,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 104 transitions. [2022-04-27 12:18:21,191 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 104 transitions. [2022-04-27 12:18:21,297 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-27 12:18:21,299 INFO L225 Difference]: With dead ends: 72 [2022-04-27 12:18:21,299 INFO L226 Difference]: Without dead ends: 51 [2022-04-27 12:18:21,300 INFO L412 NwaCegarLoop]: 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-27 12:18:21,300 INFO L413 NwaCegarLoop]: 49 mSDtfsCounter, 24 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 202 mSolverCounterSat, 37 mSolverCounterUnsat, 7 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 21.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 107 SdHoareTripleChecker+Invalid, 246 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 202 IncrementalHoareTripleChecker+Invalid, 7 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 21.5s IncrementalHoareTripleChecker+Time [2022-04-27 12:18:21,300 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 107 Invalid, 246 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 202 Invalid, 7 Unknown, 0 Unchecked, 21.5s Time] [2022-04-27 12:18:21,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2022-04-27 12:18:21,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2022-04-27 12:18:21,317 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 12:18:21,317 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-27 12:18:21,317 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-27 12:18:21,318 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-27 12:18:21,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:18:21,320 INFO L93 Difference]: Finished difference Result 51 states and 69 transitions. [2022-04-27 12:18:21,320 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 69 transitions. [2022-04-27 12:18:21,321 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 12:18:21,321 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 12:18:21,321 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-27 12:18:21,321 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-27 12:18:21,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:18:21,323 INFO L93 Difference]: Finished difference Result 51 states and 69 transitions. [2022-04-27 12:18:21,323 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 69 transitions. [2022-04-27 12:18:21,324 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 12:18:21,324 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 12:18:21,324 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 12:18:21,324 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 12:18:21,324 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-27 12:18:21,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 69 transitions. [2022-04-27 12:18:21,326 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 69 transitions. Word has length 21 [2022-04-27 12:18:21,326 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 12:18:21,326 INFO L495 AbstractCegarLoop]: Abstraction has 51 states and 69 transitions. [2022-04-27 12:18:21,326 INFO L496 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-27 12:18:21,326 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 69 transitions. [2022-04-27 12:18:21,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-04-27 12:18:21,327 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 12:18:21,327 INFO L195 NwaCegarLoop]: 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-27 12:18:21,327 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-04-27 12:18:21,327 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 12:18:21,327 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 12:18:21,327 INFO L85 PathProgramCache]: Analyzing trace with hash -1701877900, now seen corresponding path program 1 times [2022-04-27 12:18:21,328 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 12:18:21,328 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [862081398] [2022-04-27 12:18:21,328 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 12:18:21,328 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 12:18:21,337 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 12:18:21,337 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1273682819] [2022-04-27 12:18:21,337 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 12:18:21,337 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 12:18:21,337 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 12:18:21,338 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 12:18:21,339 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-04-27 12:18:21,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:18:21,373 INFO L263 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-27 12:18:21,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:18:21,380 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 12:18:21,484 INFO L272 TraceCheckUtils]: 0: Hoare triple {1137#true} call ULTIMATE.init(); {1137#true} is VALID [2022-04-27 12:18:21,484 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-27 12:18:21,485 INFO L290 TraceCheckUtils]: 2: Hoare triple {1145#(<= ~counter~0 0)} assume true; {1145#(<= ~counter~0 0)} is VALID [2022-04-27 12:18:21,485 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1145#(<= ~counter~0 0)} {1137#true} #102#return; {1145#(<= ~counter~0 0)} is VALID [2022-04-27 12:18:21,486 INFO L272 TraceCheckUtils]: 4: Hoare triple {1145#(<= ~counter~0 0)} call #t~ret7 := main(); {1145#(<= ~counter~0 0)} is VALID [2022-04-27 12:18:21,486 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-27 12:18:21,486 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-27 12:18:21,487 INFO L290 TraceCheckUtils]: 7: Hoare triple {1145#(<= ~counter~0 0)} ~cond := #in~cond; {1145#(<= ~counter~0 0)} is VALID [2022-04-27 12:18:21,487 INFO L290 TraceCheckUtils]: 8: Hoare triple {1145#(<= ~counter~0 0)} assume !(0 == ~cond); {1145#(<= ~counter~0 0)} is VALID [2022-04-27 12:18:21,489 INFO L290 TraceCheckUtils]: 9: Hoare triple {1145#(<= ~counter~0 0)} assume true; {1145#(<= ~counter~0 0)} is VALID [2022-04-27 12:18:21,489 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1145#(<= ~counter~0 0)} {1145#(<= ~counter~0 0)} #82#return; {1145#(<= ~counter~0 0)} is VALID [2022-04-27 12:18:21,490 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-27 12:18:21,490 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-27 12:18:21,491 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-27 12:18:21,491 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-27 12:18:21,492 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-27 12:18:21,492 INFO L290 TraceCheckUtils]: 16: Hoare triple {1189#(<= |main_#t~post5| 1)} assume !(#t~post5 < 20);havoc #t~post5; {1138#false} is VALID [2022-04-27 12:18:21,492 INFO L290 TraceCheckUtils]: 17: Hoare triple {1138#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {1138#false} is VALID [2022-04-27 12:18:21,492 INFO L290 TraceCheckUtils]: 18: Hoare triple {1138#false} assume !(#t~post6 < 20);havoc #t~post6; {1138#false} is VALID [2022-04-27 12:18:21,492 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-27 12:18:21,494 INFO L290 TraceCheckUtils]: 20: Hoare triple {1138#false} ~cond := #in~cond; {1138#false} is VALID [2022-04-27 12:18:21,494 INFO L290 TraceCheckUtils]: 21: Hoare triple {1138#false} assume 0 == ~cond; {1138#false} is VALID [2022-04-27 12:18:21,494 INFO L290 TraceCheckUtils]: 22: Hoare triple {1138#false} assume !false; {1138#false} is VALID [2022-04-27 12:18:21,494 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 12:18:21,495 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 12:18:21,634 INFO L290 TraceCheckUtils]: 22: Hoare triple {1138#false} assume !false; {1138#false} is VALID [2022-04-27 12:18:21,634 INFO L290 TraceCheckUtils]: 21: Hoare triple {1138#false} assume 0 == ~cond; {1138#false} is VALID [2022-04-27 12:18:21,634 INFO L290 TraceCheckUtils]: 20: Hoare triple {1138#false} ~cond := #in~cond; {1138#false} is VALID [2022-04-27 12:18:21,635 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-27 12:18:21,635 INFO L290 TraceCheckUtils]: 18: Hoare triple {1138#false} assume !(#t~post6 < 20);havoc #t~post6; {1138#false} is VALID [2022-04-27 12:18:21,635 INFO L290 TraceCheckUtils]: 17: Hoare triple {1138#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {1138#false} is VALID [2022-04-27 12:18:21,640 INFO L290 TraceCheckUtils]: 16: Hoare triple {1229#(< |main_#t~post5| 20)} assume !(#t~post5 < 20);havoc #t~post5; {1138#false} is VALID [2022-04-27 12:18:21,640 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-27 12:18:21,641 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-27 12:18:21,641 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-27 12:18:21,641 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-27 12:18:21,642 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-27 12:18:21,642 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1137#true} {1243#(< ~counter~0 19)} #82#return; {1243#(< ~counter~0 19)} is VALID [2022-04-27 12:18:21,642 INFO L290 TraceCheckUtils]: 9: Hoare triple {1137#true} assume true; {1137#true} is VALID [2022-04-27 12:18:21,642 INFO L290 TraceCheckUtils]: 8: Hoare triple {1137#true} assume !(0 == ~cond); {1137#true} is VALID [2022-04-27 12:18:21,642 INFO L290 TraceCheckUtils]: 7: Hoare triple {1137#true} ~cond := #in~cond; {1137#true} is VALID [2022-04-27 12:18:21,643 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-27 12:18:21,643 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-27 12:18:21,643 INFO L272 TraceCheckUtils]: 4: Hoare triple {1243#(< ~counter~0 19)} call #t~ret7 := main(); {1243#(< ~counter~0 19)} is VALID [2022-04-27 12:18:21,644 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1243#(< ~counter~0 19)} {1137#true} #102#return; {1243#(< ~counter~0 19)} is VALID [2022-04-27 12:18:21,644 INFO L290 TraceCheckUtils]: 2: Hoare triple {1243#(< ~counter~0 19)} assume true; {1243#(< ~counter~0 19)} is VALID [2022-04-27 12:18:21,644 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-27 12:18:21,645 INFO L272 TraceCheckUtils]: 0: Hoare triple {1137#true} call ULTIMATE.init(); {1137#true} is VALID [2022-04-27 12:18:21,645 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 12:18:21,645 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 12:18:21,645 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [862081398] [2022-04-27 12:18:21,645 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 12:18:21,645 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1273682819] [2022-04-27 12:18:21,645 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1273682819] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 12:18:21,645 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-27 12:18:21,645 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2022-04-27 12:18:21,645 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [188954633] [2022-04-27 12:18:21,645 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-27 12:18:21,646 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-27 12:18:21,646 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 12:18:21,646 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-27 12:18:21,670 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-27 12:18:21,670 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-27 12:18:21,670 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 12:18:21,670 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-27 12:18:21,670 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2022-04-27 12:18:21,671 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-27 12:18:23,785 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-27 12:18:30,843 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-27 12:18:33,015 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-27 12:18:41,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:18:41,484 INFO L93 Difference]: Finished difference Result 104 states and 146 transitions. [2022-04-27 12:18:41,484 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-04-27 12:18:41,484 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-27 12:18:41,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 12:18:41,486 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-27 12:18:41,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 143 transitions. [2022-04-27 12:18:41,489 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-27 12:18:41,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 143 transitions. [2022-04-27 12:18:41,491 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 10 states and 143 transitions. [2022-04-27 12:18:41,597 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 143 edges. 143 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 12:18:41,599 INFO L225 Difference]: With dead ends: 104 [2022-04-27 12:18:41,599 INFO L226 Difference]: Without dead ends: 83 [2022-04-27 12:18:41,599 INFO L412 NwaCegarLoop]: 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-27 12:18:41,600 INFO L413 NwaCegarLoop]: 64 mSDtfsCounter, 70 mSDsluCounter, 203 mSDsCounter, 0 mSdLazyCounter, 92 mSolverCounterSat, 24 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 267 SdHoareTripleChecker+Invalid, 119 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 92 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9.7s IncrementalHoareTripleChecker+Time [2022-04-27 12:18:41,600 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 267 Invalid, 119 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 92 Invalid, 3 Unknown, 0 Unchecked, 9.7s Time] [2022-04-27 12:18:41,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2022-04-27 12:18:41,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 77. [2022-04-27 12:18:41,625 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 12:18:41,625 INFO L82 GeneralOperation]: Start isEquivalent. First operand 83 states. Second operand has 77 states, 43 states have (on average 1.2790697674418605) internal successors, (55), 45 states have internal predecessors, (55), 28 states have call successors, (28), 7 states have call predecessors, (28), 5 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2022-04-27 12:18:41,625 INFO L74 IsIncluded]: Start isIncluded. First operand 83 states. Second operand has 77 states, 43 states have (on average 1.2790697674418605) internal successors, (55), 45 states have internal predecessors, (55), 28 states have call successors, (28), 7 states have call predecessors, (28), 5 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2022-04-27 12:18:41,626 INFO L87 Difference]: Start difference. First operand 83 states. Second operand has 77 states, 43 states have (on average 1.2790697674418605) internal successors, (55), 45 states have internal predecessors, (55), 28 states have call successors, (28), 7 states have call predecessors, (28), 5 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2022-04-27 12:18:41,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:18:41,629 INFO L93 Difference]: Finished difference Result 83 states and 112 transitions. [2022-04-27 12:18:41,629 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 112 transitions. [2022-04-27 12:18:41,629 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 12:18:41,629 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 12:18:41,629 INFO L74 IsIncluded]: Start isIncluded. First operand has 77 states, 43 states have (on average 1.2790697674418605) internal successors, (55), 45 states have internal predecessors, (55), 28 states have call successors, (28), 7 states have call predecessors, (28), 5 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) Second operand 83 states. [2022-04-27 12:18:41,630 INFO L87 Difference]: Start difference. First operand has 77 states, 43 states have (on average 1.2790697674418605) internal successors, (55), 45 states have internal predecessors, (55), 28 states have call successors, (28), 7 states have call predecessors, (28), 5 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) Second operand 83 states. [2022-04-27 12:18:41,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:18:41,654 INFO L93 Difference]: Finished difference Result 83 states and 112 transitions. [2022-04-27 12:18:41,654 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 112 transitions. [2022-04-27 12:18:41,654 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 12:18:41,655 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 12:18:41,655 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 12:18:41,655 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 12:18:41,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 43 states have (on average 1.2790697674418605) internal successors, (55), 45 states have internal predecessors, (55), 28 states have call successors, (28), 7 states have call predecessors, (28), 5 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2022-04-27 12:18:41,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 107 transitions. [2022-04-27 12:18:41,657 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 107 transitions. Word has length 23 [2022-04-27 12:18:41,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 12:18:41,658 INFO L495 AbstractCegarLoop]: Abstraction has 77 states and 107 transitions. [2022-04-27 12:18:41,658 INFO L496 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-27 12:18:41,658 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 107 transitions. [2022-04-27 12:18:41,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-04-27 12:18:41,658 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 12:18:41,658 INFO L195 NwaCegarLoop]: 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-27 12:18:41,676 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-04-27 12:18:41,858 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 12:18:41,859 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 12:18:41,860 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 12:18:41,860 INFO L85 PathProgramCache]: Analyzing trace with hash -1564262277, now seen corresponding path program 1 times [2022-04-27 12:18:41,860 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 12:18:41,860 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1074579958] [2022-04-27 12:18:41,860 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 12:18:41,860 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 12:18:41,870 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 12:18:41,870 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1958499136] [2022-04-27 12:18:41,870 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 12:18:41,870 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 12:18:41,870 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 12:18:41,880 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 12:18:41,881 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-04-27 12:18:41,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:18:41,917 INFO L263 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-27 12:18:41,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:18:41,923 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 12:18:42,056 INFO L272 TraceCheckUtils]: 0: Hoare triple {1725#true} call ULTIMATE.init(); {1725#true} is VALID [2022-04-27 12:18:42,056 INFO L290 TraceCheckUtils]: 1: Hoare triple {1725#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; {1733#(<= ~counter~0 0)} is VALID [2022-04-27 12:18:42,057 INFO L290 TraceCheckUtils]: 2: Hoare triple {1733#(<= ~counter~0 0)} assume true; {1733#(<= ~counter~0 0)} is VALID [2022-04-27 12:18:42,057 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1733#(<= ~counter~0 0)} {1725#true} #102#return; {1733#(<= ~counter~0 0)} is VALID [2022-04-27 12:18:42,057 INFO L272 TraceCheckUtils]: 4: Hoare triple {1733#(<= ~counter~0 0)} call #t~ret7 := main(); {1733#(<= ~counter~0 0)} is VALID [2022-04-27 12:18:42,058 INFO L290 TraceCheckUtils]: 5: Hoare triple {1733#(<= ~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; {1733#(<= ~counter~0 0)} is VALID [2022-04-27 12:18:42,058 INFO L272 TraceCheckUtils]: 6: Hoare triple {1733#(<= ~counter~0 0)} call assume_abort_if_not((if ~n~0 % 4294967296 < 1073741823 then 1 else 0)); {1733#(<= ~counter~0 0)} is VALID [2022-04-27 12:18:42,058 INFO L290 TraceCheckUtils]: 7: Hoare triple {1733#(<= ~counter~0 0)} ~cond := #in~cond; {1733#(<= ~counter~0 0)} is VALID [2022-04-27 12:18:42,059 INFO L290 TraceCheckUtils]: 8: Hoare triple {1733#(<= ~counter~0 0)} assume !(0 == ~cond); {1733#(<= ~counter~0 0)} is VALID [2022-04-27 12:18:42,059 INFO L290 TraceCheckUtils]: 9: Hoare triple {1733#(<= ~counter~0 0)} assume true; {1733#(<= ~counter~0 0)} is VALID [2022-04-27 12:18:42,059 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1733#(<= ~counter~0 0)} {1733#(<= ~counter~0 0)} #82#return; {1733#(<= ~counter~0 0)} is VALID [2022-04-27 12:18:42,060 INFO L290 TraceCheckUtils]: 11: Hoare triple {1733#(<= ~counter~0 0)} ~p~0 := 0;~q~0 := 1;~r~0 := ~n~0;~h~0 := 0; {1733#(<= ~counter~0 0)} is VALID [2022-04-27 12:18:42,060 INFO L290 TraceCheckUtils]: 12: Hoare triple {1733#(<= ~counter~0 0)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {1767#(<= ~counter~0 1)} is VALID [2022-04-27 12:18:42,060 INFO L290 TraceCheckUtils]: 13: Hoare triple {1767#(<= ~counter~0 1)} assume !!(#t~post5 < 20);havoc #t~post5; {1767#(<= ~counter~0 1)} is VALID [2022-04-27 12:18:42,061 INFO L290 TraceCheckUtils]: 14: Hoare triple {1767#(<= ~counter~0 1)} assume !!(~q~0 % 4294967296 <= ~n~0 % 4294967296);~q~0 := 4 * ~q~0; {1767#(<= ~counter~0 1)} is VALID [2022-04-27 12:18:42,061 INFO L290 TraceCheckUtils]: 15: Hoare triple {1767#(<= ~counter~0 1)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {1777#(<= ~counter~0 2)} is VALID [2022-04-27 12:18:42,061 INFO L290 TraceCheckUtils]: 16: Hoare triple {1777#(<= ~counter~0 2)} assume !!(#t~post5 < 20);havoc #t~post5; {1777#(<= ~counter~0 2)} is VALID [2022-04-27 12:18:42,061 INFO L290 TraceCheckUtils]: 17: Hoare triple {1777#(<= ~counter~0 2)} assume !(~q~0 % 4294967296 <= ~n~0 % 4294967296); {1777#(<= ~counter~0 2)} is VALID [2022-04-27 12:18:42,062 INFO L290 TraceCheckUtils]: 18: Hoare triple {1777#(<= ~counter~0 2)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {1787#(<= |main_#t~post6| 2)} is VALID [2022-04-27 12:18:42,063 INFO L290 TraceCheckUtils]: 19: Hoare triple {1787#(<= |main_#t~post6| 2)} assume !(#t~post6 < 20);havoc #t~post6; {1726#false} is VALID [2022-04-27 12:18:42,063 INFO L272 TraceCheckUtils]: 20: Hoare triple {1726#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)); {1726#false} is VALID [2022-04-27 12:18:42,063 INFO L290 TraceCheckUtils]: 21: Hoare triple {1726#false} ~cond := #in~cond; {1726#false} is VALID [2022-04-27 12:18:42,063 INFO L290 TraceCheckUtils]: 22: Hoare triple {1726#false} assume 0 == ~cond; {1726#false} is VALID [2022-04-27 12:18:42,063 INFO L290 TraceCheckUtils]: 23: Hoare triple {1726#false} assume !false; {1726#false} is VALID [2022-04-27 12:18:42,063 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 12:18:42,063 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 12:18:42,205 INFO L290 TraceCheckUtils]: 23: Hoare triple {1726#false} assume !false; {1726#false} is VALID [2022-04-27 12:18:42,205 INFO L290 TraceCheckUtils]: 22: Hoare triple {1726#false} assume 0 == ~cond; {1726#false} is VALID [2022-04-27 12:18:42,205 INFO L290 TraceCheckUtils]: 21: Hoare triple {1726#false} ~cond := #in~cond; {1726#false} is VALID [2022-04-27 12:18:42,205 INFO L272 TraceCheckUtils]: 20: Hoare triple {1726#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)); {1726#false} is VALID [2022-04-27 12:18:42,206 INFO L290 TraceCheckUtils]: 19: Hoare triple {1815#(< |main_#t~post6| 20)} assume !(#t~post6 < 20);havoc #t~post6; {1726#false} is VALID [2022-04-27 12:18:42,206 INFO L290 TraceCheckUtils]: 18: Hoare triple {1819#(< ~counter~0 20)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {1815#(< |main_#t~post6| 20)} is VALID [2022-04-27 12:18:42,206 INFO L290 TraceCheckUtils]: 17: Hoare triple {1819#(< ~counter~0 20)} assume !(~q~0 % 4294967296 <= ~n~0 % 4294967296); {1819#(< ~counter~0 20)} is VALID [2022-04-27 12:18:42,207 INFO L290 TraceCheckUtils]: 16: Hoare triple {1819#(< ~counter~0 20)} assume !!(#t~post5 < 20);havoc #t~post5; {1819#(< ~counter~0 20)} is VALID [2022-04-27 12:18:42,207 INFO L290 TraceCheckUtils]: 15: Hoare triple {1829#(< ~counter~0 19)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {1819#(< ~counter~0 20)} is VALID [2022-04-27 12:18:42,208 INFO L290 TraceCheckUtils]: 14: Hoare triple {1829#(< ~counter~0 19)} assume !!(~q~0 % 4294967296 <= ~n~0 % 4294967296);~q~0 := 4 * ~q~0; {1829#(< ~counter~0 19)} is VALID [2022-04-27 12:18:42,208 INFO L290 TraceCheckUtils]: 13: Hoare triple {1829#(< ~counter~0 19)} assume !!(#t~post5 < 20);havoc #t~post5; {1829#(< ~counter~0 19)} is VALID [2022-04-27 12:18:42,209 INFO L290 TraceCheckUtils]: 12: Hoare triple {1839#(< ~counter~0 18)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {1829#(< ~counter~0 19)} is VALID [2022-04-27 12:18:42,209 INFO L290 TraceCheckUtils]: 11: Hoare triple {1839#(< ~counter~0 18)} ~p~0 := 0;~q~0 := 1;~r~0 := ~n~0;~h~0 := 0; {1839#(< ~counter~0 18)} is VALID [2022-04-27 12:18:42,209 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1725#true} {1839#(< ~counter~0 18)} #82#return; {1839#(< ~counter~0 18)} is VALID [2022-04-27 12:18:42,209 INFO L290 TraceCheckUtils]: 9: Hoare triple {1725#true} assume true; {1725#true} is VALID [2022-04-27 12:18:42,210 INFO L290 TraceCheckUtils]: 8: Hoare triple {1725#true} assume !(0 == ~cond); {1725#true} is VALID [2022-04-27 12:18:42,210 INFO L290 TraceCheckUtils]: 7: Hoare triple {1725#true} ~cond := #in~cond; {1725#true} is VALID [2022-04-27 12:18:42,210 INFO L272 TraceCheckUtils]: 6: Hoare triple {1839#(< ~counter~0 18)} call assume_abort_if_not((if ~n~0 % 4294967296 < 1073741823 then 1 else 0)); {1725#true} is VALID [2022-04-27 12:18:42,210 INFO L290 TraceCheckUtils]: 5: Hoare triple {1839#(< ~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; {1839#(< ~counter~0 18)} is VALID [2022-04-27 12:18:42,210 INFO L272 TraceCheckUtils]: 4: Hoare triple {1839#(< ~counter~0 18)} call #t~ret7 := main(); {1839#(< ~counter~0 18)} is VALID [2022-04-27 12:18:42,211 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1839#(< ~counter~0 18)} {1725#true} #102#return; {1839#(< ~counter~0 18)} is VALID [2022-04-27 12:18:42,211 INFO L290 TraceCheckUtils]: 2: Hoare triple {1839#(< ~counter~0 18)} assume true; {1839#(< ~counter~0 18)} is VALID [2022-04-27 12:18:42,212 INFO L290 TraceCheckUtils]: 1: Hoare triple {1725#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; {1839#(< ~counter~0 18)} is VALID [2022-04-27 12:18:42,212 INFO L272 TraceCheckUtils]: 0: Hoare triple {1725#true} call ULTIMATE.init(); {1725#true} is VALID [2022-04-27 12:18:42,212 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 12:18:42,212 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 12:18:42,212 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1074579958] [2022-04-27 12:18:42,212 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 12:18:42,212 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1958499136] [2022-04-27 12:18:42,212 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1958499136] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 12:18:42,212 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-27 12:18:42,212 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2022-04-27 12:18:42,213 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [685540030] [2022-04-27 12:18:42,213 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-27 12:18:42,213 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-27 12:18:42,213 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 12:18:42,213 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-27 12:18:42,238 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-27 12:18:42,239 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-27 12:18:42,239 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 12:18:42,239 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-27 12:18:42,239 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-04-27 12:18:42,239 INFO L87 Difference]: Start difference. First operand 77 states and 107 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-27 12:18:45,176 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-27 12:18:48,467 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-27 12:18:56,602 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-27 12:19:01,862 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-27 12:19:08,037 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-27 12:19:10,131 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-27 12:19:11,757 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.62s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-27 12:19:15,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:19:15,760 INFO L93 Difference]: Finished difference Result 147 states and 203 transitions. [2022-04-27 12:19:15,760 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-04-27 12:19:15,760 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-27 12:19:15,761 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 12:19:15,761 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-27 12:19:15,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 189 transitions. [2022-04-27 12:19:15,764 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-27 12:19:15,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 189 transitions. [2022-04-27 12:19:15,766 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 13 states and 189 transitions. [2022-04-27 12:19:15,925 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 189 edges. 189 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 12:19:15,929 INFO L225 Difference]: With dead ends: 147 [2022-04-27 12:19:15,929 INFO L226 Difference]: Without dead ends: 131 [2022-04-27 12:19:15,929 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=63, Invalid=119, Unknown=0, NotChecked=0, Total=182 [2022-04-27 12:19:15,930 INFO L413 NwaCegarLoop]: 78 mSDtfsCounter, 148 mSDsluCounter, 264 mSDsCounter, 0 mSdLazyCounter, 131 mSolverCounterSat, 71 mSolverCounterUnsat, 6 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 20.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 148 SdHoareTripleChecker+Valid, 342 SdHoareTripleChecker+Invalid, 208 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 71 IncrementalHoareTripleChecker+Valid, 131 IncrementalHoareTripleChecker+Invalid, 6 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 20.0s IncrementalHoareTripleChecker+Time [2022-04-27 12:19:15,930 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [148 Valid, 342 Invalid, 208 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [71 Valid, 131 Invalid, 6 Unknown, 0 Unchecked, 20.0s Time] [2022-04-27 12:19:15,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2022-04-27 12:19:15,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 122. [2022-04-27 12:19:15,975 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 12:19:15,976 INFO L82 GeneralOperation]: Start isEquivalent. First operand 131 states. Second operand has 122 states, 67 states have (on average 1.328358208955224) internal successors, (89), 71 states have internal predecessors, (89), 46 states have call successors, (46), 10 states have call predecessors, (46), 8 states have return successors, (40), 40 states have call predecessors, (40), 40 states have call successors, (40) [2022-04-27 12:19:15,976 INFO L74 IsIncluded]: Start isIncluded. First operand 131 states. Second operand has 122 states, 67 states have (on average 1.328358208955224) internal successors, (89), 71 states have internal predecessors, (89), 46 states have call successors, (46), 10 states have call predecessors, (46), 8 states have return successors, (40), 40 states have call predecessors, (40), 40 states have call successors, (40) [2022-04-27 12:19:15,976 INFO L87 Difference]: Start difference. First operand 131 states. Second operand has 122 states, 67 states have (on average 1.328358208955224) internal successors, (89), 71 states have internal predecessors, (89), 46 states have call successors, (46), 10 states have call predecessors, (46), 8 states have return successors, (40), 40 states have call predecessors, (40), 40 states have call successors, (40) [2022-04-27 12:19:15,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:19:15,980 INFO L93 Difference]: Finished difference Result 131 states and 180 transitions. [2022-04-27 12:19:15,980 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 180 transitions. [2022-04-27 12:19:15,981 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 12:19:15,981 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 12:19:15,981 INFO L74 IsIncluded]: Start isIncluded. First operand has 122 states, 67 states have (on average 1.328358208955224) internal successors, (89), 71 states have internal predecessors, (89), 46 states have call successors, (46), 10 states have call predecessors, (46), 8 states have return successors, (40), 40 states have call predecessors, (40), 40 states have call successors, (40) Second operand 131 states. [2022-04-27 12:19:15,982 INFO L87 Difference]: Start difference. First operand has 122 states, 67 states have (on average 1.328358208955224) internal successors, (89), 71 states have internal predecessors, (89), 46 states have call successors, (46), 10 states have call predecessors, (46), 8 states have return successors, (40), 40 states have call predecessors, (40), 40 states have call successors, (40) Second operand 131 states. [2022-04-27 12:19:15,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:19:15,985 INFO L93 Difference]: Finished difference Result 131 states and 180 transitions. [2022-04-27 12:19:15,985 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 180 transitions. [2022-04-27 12:19:15,986 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 12:19:15,986 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 12:19:15,986 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 12:19:15,986 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 12:19:15,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122 states, 67 states have (on average 1.328358208955224) internal successors, (89), 71 states have internal predecessors, (89), 46 states have call successors, (46), 10 states have call predecessors, (46), 8 states have return successors, (40), 40 states have call predecessors, (40), 40 states have call successors, (40) [2022-04-27 12:19:15,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 175 transitions. [2022-04-27 12:19:15,990 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 175 transitions. Word has length 24 [2022-04-27 12:19:15,990 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 12:19:15,990 INFO L495 AbstractCegarLoop]: Abstraction has 122 states and 175 transitions. [2022-04-27 12:19:15,990 INFO L496 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-27 12:19:15,990 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 175 transitions. [2022-04-27 12:19:15,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-04-27 12:19:15,990 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 12:19:15,991 INFO L195 NwaCegarLoop]: 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-27 12:19:16,019 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-04-27 12:19:16,203 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 12:19:16,203 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 12:19:16,204 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 12:19:16,204 INFO L85 PathProgramCache]: Analyzing trace with hash -1562772727, now seen corresponding path program 1 times [2022-04-27 12:19:16,204 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 12:19:16,204 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1276184050] [2022-04-27 12:19:16,204 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 12:19:16,204 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 12:19:16,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:19:16,401 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 12:19:16,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:19:16,419 INFO L290 TraceCheckUtils]: 0: Hoare triple {2564#(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; {2550#true} is VALID [2022-04-27 12:19:16,420 INFO L290 TraceCheckUtils]: 1: Hoare triple {2550#true} assume true; {2550#true} is VALID [2022-04-27 12:19:16,420 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {2550#true} {2550#true} #102#return; {2550#true} is VALID [2022-04-27 12:19:16,420 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-27 12:19:16,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:19:16,433 INFO L290 TraceCheckUtils]: 0: Hoare triple {2550#true} ~cond := #in~cond; {2550#true} is VALID [2022-04-27 12:19:16,434 INFO L290 TraceCheckUtils]: 1: Hoare triple {2550#true} assume !(0 == ~cond); {2550#true} is VALID [2022-04-27 12:19:16,434 INFO L290 TraceCheckUtils]: 2: Hoare triple {2550#true} assume true; {2550#true} is VALID [2022-04-27 12:19:16,434 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2550#true} {2550#true} #82#return; {2550#true} is VALID [2022-04-27 12:19:16,434 INFO L272 TraceCheckUtils]: 0: Hoare triple {2550#true} call ULTIMATE.init(); {2564#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 12:19:16,435 INFO L290 TraceCheckUtils]: 1: Hoare triple {2564#(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; {2550#true} is VALID [2022-04-27 12:19:16,435 INFO L290 TraceCheckUtils]: 2: Hoare triple {2550#true} assume true; {2550#true} is VALID [2022-04-27 12:19:16,435 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2550#true} {2550#true} #102#return; {2550#true} is VALID [2022-04-27 12:19:16,435 INFO L272 TraceCheckUtils]: 4: Hoare triple {2550#true} call #t~ret7 := main(); {2550#true} is VALID [2022-04-27 12:19:16,435 INFO L290 TraceCheckUtils]: 5: Hoare triple {2550#true} havoc ~n~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~h~0;~n~0 := #t~nondet4;havoc #t~nondet4; {2550#true} is VALID [2022-04-27 12:19:16,435 INFO L272 TraceCheckUtils]: 6: Hoare triple {2550#true} call assume_abort_if_not((if ~n~0 % 4294967296 < 1073741823 then 1 else 0)); {2550#true} is VALID [2022-04-27 12:19:16,435 INFO L290 TraceCheckUtils]: 7: Hoare triple {2550#true} ~cond := #in~cond; {2550#true} is VALID [2022-04-27 12:19:16,435 INFO L290 TraceCheckUtils]: 8: Hoare triple {2550#true} assume !(0 == ~cond); {2550#true} is VALID [2022-04-27 12:19:16,435 INFO L290 TraceCheckUtils]: 9: Hoare triple {2550#true} assume true; {2550#true} is VALID [2022-04-27 12:19:16,435 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2550#true} {2550#true} #82#return; {2550#true} is VALID [2022-04-27 12:19:16,439 INFO L290 TraceCheckUtils]: 11: Hoare triple {2550#true} ~p~0 := 0;~q~0 := 1;~r~0 := ~n~0;~h~0 := 0; {2559#(and (= main_~p~0 0) (= (+ (- 1) main_~q~0) 0) (= (+ main_~n~0 (* (- 1) main_~r~0)) 0))} is VALID [2022-04-27 12:19:16,439 INFO L290 TraceCheckUtils]: 12: Hoare triple {2559#(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; {2559#(and (= main_~p~0 0) (= (+ (- 1) main_~q~0) 0) (= (+ main_~n~0 (* (- 1) main_~r~0)) 0))} is VALID [2022-04-27 12:19:16,440 INFO L290 TraceCheckUtils]: 13: Hoare triple {2559#(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; {2559#(and (= main_~p~0 0) (= (+ (- 1) main_~q~0) 0) (= (+ main_~n~0 (* (- 1) main_~r~0)) 0))} is VALID [2022-04-27 12:19:16,441 INFO L290 TraceCheckUtils]: 14: Hoare triple {2559#(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; {2560#(and (= main_~p~0 0) (= main_~n~0 main_~r~0))} is VALID [2022-04-27 12:19:16,441 INFO L290 TraceCheckUtils]: 15: Hoare triple {2560#(and (= main_~p~0 0) (= main_~n~0 main_~r~0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {2560#(and (= main_~p~0 0) (= main_~n~0 main_~r~0))} is VALID [2022-04-27 12:19:16,441 INFO L290 TraceCheckUtils]: 16: Hoare triple {2560#(and (= main_~p~0 0) (= main_~n~0 main_~r~0))} assume !!(#t~post5 < 20);havoc #t~post5; {2560#(and (= main_~p~0 0) (= main_~n~0 main_~r~0))} is VALID [2022-04-27 12:19:16,442 INFO L290 TraceCheckUtils]: 17: Hoare triple {2560#(and (= main_~p~0 0) (= main_~n~0 main_~r~0))} assume !(~q~0 % 4294967296 <= ~n~0 % 4294967296); {2561#(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-27 12:19:16,442 INFO L290 TraceCheckUtils]: 18: Hoare triple {2561#(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; {2561#(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-27 12:19:16,443 INFO L290 TraceCheckUtils]: 19: Hoare triple {2561#(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; {2561#(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-27 12:19:16,444 INFO L272 TraceCheckUtils]: 20: Hoare triple {2561#(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)); {2562#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 12:19:16,444 INFO L290 TraceCheckUtils]: 21: Hoare triple {2562#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {2563#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-27 12:19:16,444 INFO L290 TraceCheckUtils]: 22: Hoare triple {2563#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {2551#false} is VALID [2022-04-27 12:19:16,444 INFO L290 TraceCheckUtils]: 23: Hoare triple {2551#false} assume !false; {2551#false} is VALID [2022-04-27 12:19:16,445 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 12:19:16,445 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 12:19:16,445 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1276184050] [2022-04-27 12:19:16,445 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1276184050] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 12:19:16,445 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1818767381] [2022-04-27 12:19:16,445 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 12:19:16,445 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 12:19:16,445 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 12:19:16,457 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 12:19:16,458 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-04-27 12:19:16,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:19:16,501 INFO L263 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 12 conjunts are in the unsatisfiable core [2022-04-27 12:19:16,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:19:16,525 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 12:19:16,780 INFO L272 TraceCheckUtils]: 0: Hoare triple {2550#true} call ULTIMATE.init(); {2550#true} is VALID [2022-04-27 12:19:16,780 INFO L290 TraceCheckUtils]: 1: Hoare triple {2550#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; {2550#true} is VALID [2022-04-27 12:19:16,780 INFO L290 TraceCheckUtils]: 2: Hoare triple {2550#true} assume true; {2550#true} is VALID [2022-04-27 12:19:16,780 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2550#true} {2550#true} #102#return; {2550#true} is VALID [2022-04-27 12:19:16,780 INFO L272 TraceCheckUtils]: 4: Hoare triple {2550#true} call #t~ret7 := main(); {2550#true} is VALID [2022-04-27 12:19:16,781 INFO L290 TraceCheckUtils]: 5: Hoare triple {2550#true} havoc ~n~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~h~0;~n~0 := #t~nondet4;havoc #t~nondet4; {2550#true} is VALID [2022-04-27 12:19:16,781 INFO L272 TraceCheckUtils]: 6: Hoare triple {2550#true} call assume_abort_if_not((if ~n~0 % 4294967296 < 1073741823 then 1 else 0)); {2550#true} is VALID [2022-04-27 12:19:16,781 INFO L290 TraceCheckUtils]: 7: Hoare triple {2550#true} ~cond := #in~cond; {2550#true} is VALID [2022-04-27 12:19:16,781 INFO L290 TraceCheckUtils]: 8: Hoare triple {2550#true} assume !(0 == ~cond); {2550#true} is VALID [2022-04-27 12:19:16,781 INFO L290 TraceCheckUtils]: 9: Hoare triple {2550#true} assume true; {2550#true} is VALID [2022-04-27 12:19:16,781 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2550#true} {2550#true} #82#return; {2550#true} is VALID [2022-04-27 12:19:16,781 INFO L290 TraceCheckUtils]: 11: Hoare triple {2550#true} ~p~0 := 0;~q~0 := 1;~r~0 := ~n~0;~h~0 := 0; {2559#(and (= main_~p~0 0) (= (+ (- 1) main_~q~0) 0) (= (+ main_~n~0 (* (- 1) main_~r~0)) 0))} is VALID [2022-04-27 12:19:16,782 INFO L290 TraceCheckUtils]: 12: Hoare triple {2559#(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; {2559#(and (= main_~p~0 0) (= (+ (- 1) main_~q~0) 0) (= (+ main_~n~0 (* (- 1) main_~r~0)) 0))} is VALID [2022-04-27 12:19:16,782 INFO L290 TraceCheckUtils]: 13: Hoare triple {2559#(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; {2559#(and (= main_~p~0 0) (= (+ (- 1) main_~q~0) 0) (= (+ main_~n~0 (* (- 1) main_~r~0)) 0))} is VALID [2022-04-27 12:19:16,783 INFO L290 TraceCheckUtils]: 14: Hoare triple {2559#(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; {2610#(and (= main_~p~0 0) (= main_~q~0 4) (= (+ main_~n~0 (* (- 1) main_~r~0)) 0))} is VALID [2022-04-27 12:19:16,783 INFO L290 TraceCheckUtils]: 15: Hoare triple {2610#(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; {2610#(and (= main_~p~0 0) (= main_~q~0 4) (= (+ main_~n~0 (* (- 1) main_~r~0)) 0))} is VALID [2022-04-27 12:19:16,783 INFO L290 TraceCheckUtils]: 16: Hoare triple {2610#(and (= main_~p~0 0) (= main_~q~0 4) (= (+ main_~n~0 (* (- 1) main_~r~0)) 0))} assume !!(#t~post5 < 20);havoc #t~post5; {2610#(and (= main_~p~0 0) (= main_~q~0 4) (= (+ main_~n~0 (* (- 1) main_~r~0)) 0))} is VALID [2022-04-27 12:19:16,784 INFO L290 TraceCheckUtils]: 17: Hoare triple {2610#(and (= main_~p~0 0) (= main_~q~0 4) (= (+ main_~n~0 (* (- 1) main_~r~0)) 0))} assume !(~q~0 % 4294967296 <= ~n~0 % 4294967296); {2620#(and (not (<= (mod main_~q~0 4294967296) (mod main_~r~0 4294967296))) (= main_~p~0 0) (= main_~q~0 4))} is VALID [2022-04-27 12:19:16,785 INFO L290 TraceCheckUtils]: 18: Hoare triple {2620#(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; {2620#(and (not (<= (mod main_~q~0 4294967296) (mod main_~r~0 4294967296))) (= main_~p~0 0) (= main_~q~0 4))} is VALID [2022-04-27 12:19:16,785 INFO L290 TraceCheckUtils]: 19: Hoare triple {2620#(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; {2620#(and (not (<= (mod main_~q~0 4294967296) (mod main_~r~0 4294967296))) (= main_~p~0 0) (= main_~q~0 4))} is VALID [2022-04-27 12:19:16,786 INFO L272 TraceCheckUtils]: 20: Hoare triple {2620#(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)); {2630#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 12:19:16,786 INFO L290 TraceCheckUtils]: 21: Hoare triple {2630#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {2634#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 12:19:16,787 INFO L290 TraceCheckUtils]: 22: Hoare triple {2634#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2551#false} is VALID [2022-04-27 12:19:16,787 INFO L290 TraceCheckUtils]: 23: Hoare triple {2551#false} assume !false; {2551#false} is VALID [2022-04-27 12:19:16,787 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 12:19:16,787 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 12:19:17,000 INFO L290 TraceCheckUtils]: 23: Hoare triple {2551#false} assume !false; {2551#false} is VALID [2022-04-27 12:19:17,001 INFO L290 TraceCheckUtils]: 22: Hoare triple {2634#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2551#false} is VALID [2022-04-27 12:19:17,001 INFO L290 TraceCheckUtils]: 21: Hoare triple {2630#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {2634#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 12:19:17,002 INFO L272 TraceCheckUtils]: 20: Hoare triple {2650#(< (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)); {2630#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 12:19:17,002 INFO L290 TraceCheckUtils]: 19: Hoare triple {2650#(< (mod main_~r~0 4294967296) (mod (+ (* main_~p~0 2) main_~q~0) 4294967296))} assume !!(#t~post6 < 20);havoc #t~post6; {2650#(< (mod main_~r~0 4294967296) (mod (+ (* main_~p~0 2) main_~q~0) 4294967296))} is VALID [2022-04-27 12:19:17,002 INFO L290 TraceCheckUtils]: 18: Hoare triple {2650#(< (mod main_~r~0 4294967296) (mod (+ (* main_~p~0 2) main_~q~0) 4294967296))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {2650#(< (mod main_~r~0 4294967296) (mod (+ (* main_~p~0 2) main_~q~0) 4294967296))} is VALID [2022-04-27 12:19:17,003 INFO L290 TraceCheckUtils]: 17: Hoare triple {2660#(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); {2650#(< (mod main_~r~0 4294967296) (mod (+ (* main_~p~0 2) main_~q~0) 4294967296))} is VALID [2022-04-27 12:19:17,003 INFO L290 TraceCheckUtils]: 16: Hoare triple {2660#(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; {2660#(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-27 12:19:17,004 INFO L290 TraceCheckUtils]: 15: Hoare triple {2660#(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; {2660#(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-27 12:19:17,013 INFO L290 TraceCheckUtils]: 14: Hoare triple {2670#(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; {2660#(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-27 12:19:17,013 INFO L290 TraceCheckUtils]: 13: Hoare triple {2670#(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; {2670#(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-27 12:19:17,014 INFO L290 TraceCheckUtils]: 12: Hoare triple {2670#(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; {2670#(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-27 12:19:17,014 INFO L290 TraceCheckUtils]: 11: Hoare triple {2550#true} ~p~0 := 0;~q~0 := 1;~r~0 := ~n~0;~h~0 := 0; {2670#(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-27 12:19:17,014 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2550#true} {2550#true} #82#return; {2550#true} is VALID [2022-04-27 12:19:17,015 INFO L290 TraceCheckUtils]: 9: Hoare triple {2550#true} assume true; {2550#true} is VALID [2022-04-27 12:19:17,015 INFO L290 TraceCheckUtils]: 8: Hoare triple {2550#true} assume !(0 == ~cond); {2550#true} is VALID [2022-04-27 12:19:17,015 INFO L290 TraceCheckUtils]: 7: Hoare triple {2550#true} ~cond := #in~cond; {2550#true} is VALID [2022-04-27 12:19:17,015 INFO L272 TraceCheckUtils]: 6: Hoare triple {2550#true} call assume_abort_if_not((if ~n~0 % 4294967296 < 1073741823 then 1 else 0)); {2550#true} is VALID [2022-04-27 12:19:17,015 INFO L290 TraceCheckUtils]: 5: Hoare triple {2550#true} havoc ~n~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~h~0;~n~0 := #t~nondet4;havoc #t~nondet4; {2550#true} is VALID [2022-04-27 12:19:17,015 INFO L272 TraceCheckUtils]: 4: Hoare triple {2550#true} call #t~ret7 := main(); {2550#true} is VALID [2022-04-27 12:19:17,015 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2550#true} {2550#true} #102#return; {2550#true} is VALID [2022-04-27 12:19:17,015 INFO L290 TraceCheckUtils]: 2: Hoare triple {2550#true} assume true; {2550#true} is VALID [2022-04-27 12:19:17,015 INFO L290 TraceCheckUtils]: 1: Hoare triple {2550#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; {2550#true} is VALID [2022-04-27 12:19:17,015 INFO L272 TraceCheckUtils]: 0: Hoare triple {2550#true} call ULTIMATE.init(); {2550#true} is VALID [2022-04-27 12:19:17,016 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 12:19:17,016 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1818767381] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 12:19:17,016 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-27 12:19:17,016 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 15 [2022-04-27 12:19:17,016 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1741171941] [2022-04-27 12:19:17,016 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-27 12:19:17,016 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-27 12:19:17,017 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 12:19:17,017 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-27 12:19:17,058 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-27 12:19:17,058 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-04-27 12:19:17,058 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 12:19:17,059 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-04-27 12:19:17,059 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=166, Unknown=0, NotChecked=0, Total=210 [2022-04-27 12:19:17,059 INFO L87 Difference]: Start difference. First operand 122 states and 175 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-27 12:19:22,261 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-27 12:19:24,373 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-27 12:19:28,374 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-27 12:19:30,384 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-27 12:19:39,221 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-27 12:19:41,752 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-27 12:19:43,765 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-27 12:19:45,772 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-27 12:19:49,100 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-27 12:19:51,731 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-27 12:20:05,461 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-27 12:20:10,346 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-27 12:20:20,256 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.44s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-27 12:20:25,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:20:25,019 INFO L93 Difference]: Finished difference Result 196 states and 286 transitions. [2022-04-27 12:20:25,019 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-04-27 12:20:25,019 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-27 12:20:25,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 12:20:25,019 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-27 12:20:25,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 144 transitions. [2022-04-27 12:20:25,022 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-27 12:20:25,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 144 transitions. [2022-04-27 12:20:25,025 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 13 states and 144 transitions. [2022-04-27 12:20:25,683 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 144 edges. 144 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 12:20:25,689 INFO L225 Difference]: With dead ends: 196 [2022-04-27 12:20:25,689 INFO L226 Difference]: Without dead ends: 179 [2022-04-27 12:20:25,690 INFO L412 NwaCegarLoop]: 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-27 12:20:25,691 INFO L413 NwaCegarLoop]: 60 mSDtfsCounter, 49 mSDsluCounter, 113 mSDsCounter, 0 mSdLazyCounter, 534 mSolverCounterSat, 137 mSolverCounterUnsat, 13 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 40.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 173 SdHoareTripleChecker+Invalid, 684 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 137 IncrementalHoareTripleChecker+Valid, 534 IncrementalHoareTripleChecker+Invalid, 13 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 40.4s IncrementalHoareTripleChecker+Time [2022-04-27 12:20:25,691 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 173 Invalid, 684 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [137 Valid, 534 Invalid, 13 Unknown, 0 Unchecked, 40.4s Time] [2022-04-27 12:20:25,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2022-04-27 12:20:25,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 172. [2022-04-27 12:20:25,779 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 12:20:25,780 INFO L82 GeneralOperation]: Start isEquivalent. First operand 179 states. Second operand has 172 states, 94 states have (on average 1.2765957446808511) internal successors, (120), 101 states have internal predecessors, (120), 65 states have call successors, (65), 14 states have call predecessors, (65), 12 states have return successors, (57), 56 states have call predecessors, (57), 57 states have call successors, (57) [2022-04-27 12:20:25,780 INFO L74 IsIncluded]: Start isIncluded. First operand 179 states. Second operand has 172 states, 94 states have (on average 1.2765957446808511) internal successors, (120), 101 states have internal predecessors, (120), 65 states have call successors, (65), 14 states have call predecessors, (65), 12 states have return successors, (57), 56 states have call predecessors, (57), 57 states have call successors, (57) [2022-04-27 12:20:25,781 INFO L87 Difference]: Start difference. First operand 179 states. Second operand has 172 states, 94 states have (on average 1.2765957446808511) internal successors, (120), 101 states have internal predecessors, (120), 65 states have call successors, (65), 14 states have call predecessors, (65), 12 states have return successors, (57), 56 states have call predecessors, (57), 57 states have call successors, (57) [2022-04-27 12:20:25,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:20:25,786 INFO L93 Difference]: Finished difference Result 179 states and 255 transitions. [2022-04-27 12:20:25,786 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 255 transitions. [2022-04-27 12:20:25,787 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 12:20:25,787 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 12:20:25,787 INFO L74 IsIncluded]: Start isIncluded. First operand has 172 states, 94 states have (on average 1.2765957446808511) internal successors, (120), 101 states have internal predecessors, (120), 65 states have call successors, (65), 14 states have call predecessors, (65), 12 states have return successors, (57), 56 states have call predecessors, (57), 57 states have call successors, (57) Second operand 179 states. [2022-04-27 12:20:25,788 INFO L87 Difference]: Start difference. First operand has 172 states, 94 states have (on average 1.2765957446808511) internal successors, (120), 101 states have internal predecessors, (120), 65 states have call successors, (65), 14 states have call predecessors, (65), 12 states have return successors, (57), 56 states have call predecessors, (57), 57 states have call successors, (57) Second operand 179 states. [2022-04-27 12:20:25,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:20:25,793 INFO L93 Difference]: Finished difference Result 179 states and 255 transitions. [2022-04-27 12:20:25,793 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 255 transitions. [2022-04-27 12:20:25,794 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 12:20:25,794 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 12:20:25,794 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 12:20:25,794 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 12:20:25,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 172 states, 94 states have (on average 1.2765957446808511) internal successors, (120), 101 states have internal predecessors, (120), 65 states have call successors, (65), 14 states have call predecessors, (65), 12 states have return successors, (57), 56 states have call predecessors, (57), 57 states have call successors, (57) [2022-04-27 12:20:25,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 242 transitions. [2022-04-27 12:20:25,800 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 242 transitions. Word has length 24 [2022-04-27 12:20:25,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 12:20:25,800 INFO L495 AbstractCegarLoop]: Abstraction has 172 states and 242 transitions. [2022-04-27 12:20:25,800 INFO L496 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-27 12:20:25,800 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 242 transitions. [2022-04-27 12:20:25,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-04-27 12:20:25,800 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 12:20:25,801 INFO L195 NwaCegarLoop]: 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-27 12:20:25,821 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-04-27 12:20:26,007 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 12:20:26,007 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 12:20:26,007 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 12:20:26,008 INFO L85 PathProgramCache]: Analyzing trace with hash -45171523, now seen corresponding path program 1 times [2022-04-27 12:20:26,008 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 12:20:26,008 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [637147570] [2022-04-27 12:20:26,008 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 12:20:26,008 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 12:20:26,016 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 12:20:26,016 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [394072014] [2022-04-27 12:20:26,016 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 12:20:26,017 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 12:20:26,017 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 12:20:26,017 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 12:20:26,018 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-04-27 12:20:26,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:20:26,115 INFO L263 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-27 12:20:26,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:20:26,123 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 12:20:26,305 INFO L272 TraceCheckUtils]: 0: Hoare triple {3643#true} call ULTIMATE.init(); {3643#true} is VALID [2022-04-27 12:20:26,305 INFO L290 TraceCheckUtils]: 1: Hoare triple {3643#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; {3643#true} is VALID [2022-04-27 12:20:26,305 INFO L290 TraceCheckUtils]: 2: Hoare triple {3643#true} assume true; {3643#true} is VALID [2022-04-27 12:20:26,305 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3643#true} {3643#true} #102#return; {3643#true} is VALID [2022-04-27 12:20:26,305 INFO L272 TraceCheckUtils]: 4: Hoare triple {3643#true} call #t~ret7 := main(); {3643#true} is VALID [2022-04-27 12:20:26,305 INFO L290 TraceCheckUtils]: 5: Hoare triple {3643#true} havoc ~n~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~h~0;~n~0 := #t~nondet4;havoc #t~nondet4; {3643#true} is VALID [2022-04-27 12:20:26,305 INFO L272 TraceCheckUtils]: 6: Hoare triple {3643#true} call assume_abort_if_not((if ~n~0 % 4294967296 < 1073741823 then 1 else 0)); {3643#true} is VALID [2022-04-27 12:20:26,305 INFO L290 TraceCheckUtils]: 7: Hoare triple {3643#true} ~cond := #in~cond; {3643#true} is VALID [2022-04-27 12:20:26,305 INFO L290 TraceCheckUtils]: 8: Hoare triple {3643#true} assume !(0 == ~cond); {3643#true} is VALID [2022-04-27 12:20:26,305 INFO L290 TraceCheckUtils]: 9: Hoare triple {3643#true} assume true; {3643#true} is VALID [2022-04-27 12:20:26,306 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {3643#true} {3643#true} #82#return; {3643#true} is VALID [2022-04-27 12:20:26,306 INFO L290 TraceCheckUtils]: 11: Hoare triple {3643#true} ~p~0 := 0;~q~0 := 1;~r~0 := ~n~0;~h~0 := 0; {3681#(and (= main_~p~0 0) (= main_~h~0 0) (= main_~q~0 1))} is VALID [2022-04-27 12:20:26,306 INFO L290 TraceCheckUtils]: 12: Hoare triple {3681#(and (= main_~p~0 0) (= main_~h~0 0) (= main_~q~0 1))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {3681#(and (= main_~p~0 0) (= main_~h~0 0) (= main_~q~0 1))} is VALID [2022-04-27 12:20:26,307 INFO L290 TraceCheckUtils]: 13: Hoare triple {3681#(and (= main_~p~0 0) (= main_~h~0 0) (= main_~q~0 1))} assume !!(#t~post5 < 20);havoc #t~post5; {3681#(and (= main_~p~0 0) (= main_~h~0 0) (= main_~q~0 1))} is VALID [2022-04-27 12:20:26,315 INFO L290 TraceCheckUtils]: 14: Hoare triple {3681#(and (= main_~p~0 0) (= main_~h~0 0) (= main_~q~0 1))} assume !(~q~0 % 4294967296 <= ~n~0 % 4294967296); {3681#(and (= main_~p~0 0) (= main_~h~0 0) (= main_~q~0 1))} is VALID [2022-04-27 12:20:26,316 INFO L290 TraceCheckUtils]: 15: Hoare triple {3681#(and (= main_~p~0 0) (= main_~h~0 0) (= main_~q~0 1))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {3681#(and (= main_~p~0 0) (= main_~h~0 0) (= main_~q~0 1))} is VALID [2022-04-27 12:20:26,316 INFO L290 TraceCheckUtils]: 16: Hoare triple {3681#(and (= main_~p~0 0) (= main_~h~0 0) (= main_~q~0 1))} assume !!(#t~post6 < 20);havoc #t~post6; {3681#(and (= main_~p~0 0) (= main_~h~0 0) (= main_~q~0 1))} is VALID [2022-04-27 12:20:26,317 INFO L272 TraceCheckUtils]: 17: Hoare triple {3681#(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)); {3643#true} is VALID [2022-04-27 12:20:26,317 INFO L290 TraceCheckUtils]: 18: Hoare triple {3643#true} ~cond := #in~cond; {3643#true} is VALID [2022-04-27 12:20:26,317 INFO L290 TraceCheckUtils]: 19: Hoare triple {3643#true} assume !(0 == ~cond); {3643#true} is VALID [2022-04-27 12:20:26,317 INFO L290 TraceCheckUtils]: 20: Hoare triple {3643#true} assume true; {3643#true} is VALID [2022-04-27 12:20:26,317 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {3643#true} {3681#(and (= main_~p~0 0) (= main_~h~0 0) (= main_~q~0 1))} #84#return; {3681#(and (= main_~p~0 0) (= main_~h~0 0) (= main_~q~0 1))} is VALID [2022-04-27 12:20:26,317 INFO L272 TraceCheckUtils]: 22: Hoare triple {3681#(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)); {3643#true} is VALID [2022-04-27 12:20:26,317 INFO L290 TraceCheckUtils]: 23: Hoare triple {3643#true} ~cond := #in~cond; {3643#true} is VALID [2022-04-27 12:20:26,317 INFO L290 TraceCheckUtils]: 24: Hoare triple {3643#true} assume !(0 == ~cond); {3643#true} is VALID [2022-04-27 12:20:26,318 INFO L290 TraceCheckUtils]: 25: Hoare triple {3643#true} assume true; {3643#true} is VALID [2022-04-27 12:20:26,318 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {3643#true} {3681#(and (= main_~p~0 0) (= main_~h~0 0) (= main_~q~0 1))} #86#return; {3681#(and (= main_~p~0 0) (= main_~h~0 0) (= main_~q~0 1))} is VALID [2022-04-27 12:20:26,319 INFO L272 TraceCheckUtils]: 27: Hoare triple {3681#(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)); {3730#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 12:20:26,319 INFO L290 TraceCheckUtils]: 28: Hoare triple {3730#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {3734#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 12:20:26,319 INFO L290 TraceCheckUtils]: 29: Hoare triple {3734#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {3644#false} is VALID [2022-04-27 12:20:26,319 INFO L290 TraceCheckUtils]: 30: Hoare triple {3644#false} assume !false; {3644#false} is VALID [2022-04-27 12:20:26,321 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-27 12:20:26,321 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-27 12:20:26,322 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 12:20:26,322 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [637147570] [2022-04-27 12:20:26,322 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 12:20:26,322 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [394072014] [2022-04-27 12:20:26,322 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [394072014] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 12:20:26,322 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 12:20:26,322 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-27 12:20:26,322 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1713130721] [2022-04-27 12:20:26,322 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 12:20:26,324 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-27 12:20:26,324 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 12:20:26,324 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-27 12:20:26,345 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-27 12:20:26,346 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-27 12:20:26,346 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 12:20:26,347 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-27 12:20:26,347 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-27 12:20:26,347 INFO L87 Difference]: Start difference. First operand 172 states and 242 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-27 12:20:29,009 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.87s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-27 12:20:34,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:20:34,755 INFO L93 Difference]: Finished difference Result 178 states and 246 transitions. [2022-04-27 12:20:34,755 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-27 12:20:34,756 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-27 12:20:34,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 12:20:34,756 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-27 12:20:34,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 71 transitions. [2022-04-27 12:20:34,757 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-27 12:20:34,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 71 transitions. [2022-04-27 12:20:34,758 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 71 transitions. [2022-04-27 12:20:34,835 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-27 12:20:34,837 INFO L225 Difference]: With dead ends: 178 [2022-04-27 12:20:34,838 INFO L226 Difference]: Without dead ends: 152 [2022-04-27 12:20:34,838 INFO L412 NwaCegarLoop]: 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-27 12:20:34,838 INFO L413 NwaCegarLoop]: 49 mSDtfsCounter, 6 mSDsluCounter, 105 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.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, 2.4s IncrementalHoareTripleChecker+Time [2022-04-27 12:20:34,839 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 154 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2022-04-27 12:20:34,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2022-04-27 12:20:34,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 152. [2022-04-27 12:20:34,897 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 12:20:34,898 INFO L82 GeneralOperation]: Start isEquivalent. First operand 152 states. Second operand has 152 states, 83 states have (on average 1.2891566265060241) internal successors, (107), 90 states have internal predecessors, (107), 58 states have call successors, (58), 11 states have call predecessors, (58), 10 states have return successors, (51), 50 states have call predecessors, (51), 51 states have call successors, (51) [2022-04-27 12:20:34,898 INFO L74 IsIncluded]: Start isIncluded. First operand 152 states. Second operand has 152 states, 83 states have (on average 1.2891566265060241) internal successors, (107), 90 states have internal predecessors, (107), 58 states have call successors, (58), 11 states have call predecessors, (58), 10 states have return successors, (51), 50 states have call predecessors, (51), 51 states have call successors, (51) [2022-04-27 12:20:34,898 INFO L87 Difference]: Start difference. First operand 152 states. Second operand has 152 states, 83 states have (on average 1.2891566265060241) internal successors, (107), 90 states have internal predecessors, (107), 58 states have call successors, (58), 11 states have call predecessors, (58), 10 states have return successors, (51), 50 states have call predecessors, (51), 51 states have call successors, (51) [2022-04-27 12:20:34,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:20:34,903 INFO L93 Difference]: Finished difference Result 152 states and 216 transitions. [2022-04-27 12:20:34,903 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 216 transitions. [2022-04-27 12:20:34,903 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 12:20:34,903 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 12:20:34,905 INFO L74 IsIncluded]: Start isIncluded. First operand has 152 states, 83 states have (on average 1.2891566265060241) internal successors, (107), 90 states have internal predecessors, (107), 58 states have call successors, (58), 11 states have call predecessors, (58), 10 states have return successors, (51), 50 states have call predecessors, (51), 51 states have call successors, (51) Second operand 152 states. [2022-04-27 12:20:34,905 INFO L87 Difference]: Start difference. First operand has 152 states, 83 states have (on average 1.2891566265060241) internal successors, (107), 90 states have internal predecessors, (107), 58 states have call successors, (58), 11 states have call predecessors, (58), 10 states have return successors, (51), 50 states have call predecessors, (51), 51 states have call successors, (51) Second operand 152 states. [2022-04-27 12:20:34,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:20:34,909 INFO L93 Difference]: Finished difference Result 152 states and 216 transitions. [2022-04-27 12:20:34,909 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 216 transitions. [2022-04-27 12:20:34,910 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 12:20:34,910 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 12:20:34,910 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 12:20:34,910 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 12:20:34,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 152 states, 83 states have (on average 1.2891566265060241) internal successors, (107), 90 states have internal predecessors, (107), 58 states have call successors, (58), 11 states have call predecessors, (58), 10 states have return successors, (51), 50 states have call predecessors, (51), 51 states have call successors, (51) [2022-04-27 12:20:34,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 216 transitions. [2022-04-27 12:20:34,915 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 216 transitions. Word has length 31 [2022-04-27 12:20:34,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 12:20:34,915 INFO L495 AbstractCegarLoop]: Abstraction has 152 states and 216 transitions. [2022-04-27 12:20:34,915 INFO L496 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-27 12:20:34,915 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 216 transitions. [2022-04-27 12:20:34,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-04-27 12:20:34,916 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 12:20:34,916 INFO L195 NwaCegarLoop]: 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-27 12:20:34,923 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-04-27 12:20:35,121 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 12:20:35,122 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 12:20:35,122 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 12:20:35,122 INFO L85 PathProgramCache]: Analyzing trace with hash -1547125783, now seen corresponding path program 1 times [2022-04-27 12:20:35,122 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 12:20:35,122 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1441444789] [2022-04-27 12:20:35,122 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 12:20:35,123 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 12:20:35,147 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 12:20:35,147 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1768309353] [2022-04-27 12:20:35,147 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 12:20:35,147 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 12:20:35,147 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 12:20:35,156 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 12:20:35,157 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-04-27 12:20:35,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:20:35,228 INFO L263 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-27 12:20:35,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:20:35,234 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 12:20:35,384 INFO L272 TraceCheckUtils]: 0: Hoare triple {4537#true} call ULTIMATE.init(); {4537#true} is VALID [2022-04-27 12:20:35,384 INFO L290 TraceCheckUtils]: 1: Hoare triple {4537#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; {4537#true} is VALID [2022-04-27 12:20:35,385 INFO L290 TraceCheckUtils]: 2: Hoare triple {4537#true} assume true; {4537#true} is VALID [2022-04-27 12:20:35,385 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4537#true} {4537#true} #102#return; {4537#true} is VALID [2022-04-27 12:20:35,385 INFO L272 TraceCheckUtils]: 4: Hoare triple {4537#true} call #t~ret7 := main(); {4537#true} is VALID [2022-04-27 12:20:35,385 INFO L290 TraceCheckUtils]: 5: Hoare triple {4537#true} havoc ~n~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~h~0;~n~0 := #t~nondet4;havoc #t~nondet4; {4537#true} is VALID [2022-04-27 12:20:35,385 INFO L272 TraceCheckUtils]: 6: Hoare triple {4537#true} call assume_abort_if_not((if ~n~0 % 4294967296 < 1073741823 then 1 else 0)); {4537#true} is VALID [2022-04-27 12:20:35,385 INFO L290 TraceCheckUtils]: 7: Hoare triple {4537#true} ~cond := #in~cond; {4537#true} is VALID [2022-04-27 12:20:35,386 INFO L290 TraceCheckUtils]: 8: Hoare triple {4537#true} assume !(0 == ~cond); {4537#true} is VALID [2022-04-27 12:20:35,387 INFO L290 TraceCheckUtils]: 9: Hoare triple {4537#true} assume true; {4537#true} is VALID [2022-04-27 12:20:35,387 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {4537#true} {4537#true} #82#return; {4537#true} is VALID [2022-04-27 12:20:35,387 INFO L290 TraceCheckUtils]: 11: Hoare triple {4537#true} ~p~0 := 0;~q~0 := 1;~r~0 := ~n~0;~h~0 := 0; {4575#(and (= main_~p~0 0) (= main_~h~0 0))} is VALID [2022-04-27 12:20:35,387 INFO L290 TraceCheckUtils]: 12: Hoare triple {4575#(and (= main_~p~0 0) (= main_~h~0 0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {4575#(and (= main_~p~0 0) (= main_~h~0 0))} is VALID [2022-04-27 12:20:35,388 INFO L290 TraceCheckUtils]: 13: Hoare triple {4575#(and (= main_~p~0 0) (= main_~h~0 0))} assume !!(#t~post5 < 20);havoc #t~post5; {4575#(and (= main_~p~0 0) (= main_~h~0 0))} is VALID [2022-04-27 12:20:35,388 INFO L290 TraceCheckUtils]: 14: Hoare triple {4575#(and (= main_~p~0 0) (= main_~h~0 0))} assume !!(~q~0 % 4294967296 <= ~n~0 % 4294967296);~q~0 := 4 * ~q~0; {4575#(and (= main_~p~0 0) (= main_~h~0 0))} is VALID [2022-04-27 12:20:35,388 INFO L290 TraceCheckUtils]: 15: Hoare triple {4575#(and (= main_~p~0 0) (= main_~h~0 0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {4575#(and (= main_~p~0 0) (= main_~h~0 0))} is VALID [2022-04-27 12:20:35,389 INFO L290 TraceCheckUtils]: 16: Hoare triple {4575#(and (= main_~p~0 0) (= main_~h~0 0))} assume !!(#t~post5 < 20);havoc #t~post5; {4575#(and (= main_~p~0 0) (= main_~h~0 0))} is VALID [2022-04-27 12:20:35,389 INFO L290 TraceCheckUtils]: 17: Hoare triple {4575#(and (= main_~p~0 0) (= main_~h~0 0))} assume !(~q~0 % 4294967296 <= ~n~0 % 4294967296); {4575#(and (= main_~p~0 0) (= main_~h~0 0))} is VALID [2022-04-27 12:20:35,389 INFO L290 TraceCheckUtils]: 18: Hoare triple {4575#(and (= main_~p~0 0) (= main_~h~0 0))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {4575#(and (= main_~p~0 0) (= main_~h~0 0))} is VALID [2022-04-27 12:20:35,390 INFO L290 TraceCheckUtils]: 19: Hoare triple {4575#(and (= main_~p~0 0) (= main_~h~0 0))} assume !!(#t~post6 < 20);havoc #t~post6; {4575#(and (= main_~p~0 0) (= main_~h~0 0))} is VALID [2022-04-27 12:20:35,390 INFO L272 TraceCheckUtils]: 20: Hoare triple {4575#(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)); {4537#true} is VALID [2022-04-27 12:20:35,390 INFO L290 TraceCheckUtils]: 21: Hoare triple {4537#true} ~cond := #in~cond; {4537#true} is VALID [2022-04-27 12:20:35,390 INFO L290 TraceCheckUtils]: 22: Hoare triple {4537#true} assume !(0 == ~cond); {4537#true} is VALID [2022-04-27 12:20:35,390 INFO L290 TraceCheckUtils]: 23: Hoare triple {4537#true} assume true; {4537#true} is VALID [2022-04-27 12:20:35,390 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {4537#true} {4575#(and (= main_~p~0 0) (= main_~h~0 0))} #84#return; {4575#(and (= main_~p~0 0) (= main_~h~0 0))} is VALID [2022-04-27 12:20:35,391 INFO L272 TraceCheckUtils]: 25: Hoare triple {4575#(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)); {4537#true} is VALID [2022-04-27 12:20:35,391 INFO L290 TraceCheckUtils]: 26: Hoare triple {4537#true} ~cond := #in~cond; {4537#true} is VALID [2022-04-27 12:20:35,391 INFO L290 TraceCheckUtils]: 27: Hoare triple {4537#true} assume !(0 == ~cond); {4537#true} is VALID [2022-04-27 12:20:35,391 INFO L290 TraceCheckUtils]: 28: Hoare triple {4537#true} assume true; {4537#true} is VALID [2022-04-27 12:20:35,391 INFO L284 TraceCheckUtils]: 29: Hoare quadruple {4537#true} {4575#(and (= main_~p~0 0) (= main_~h~0 0))} #86#return; {4575#(and (= main_~p~0 0) (= main_~h~0 0))} is VALID [2022-04-27 12:20:35,392 INFO L272 TraceCheckUtils]: 30: Hoare triple {4575#(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)); {4633#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 12:20:35,392 INFO L290 TraceCheckUtils]: 31: Hoare triple {4633#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {4637#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 12:20:35,393 INFO L290 TraceCheckUtils]: 32: Hoare triple {4637#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {4538#false} is VALID [2022-04-27 12:20:35,393 INFO L290 TraceCheckUtils]: 33: Hoare triple {4538#false} assume !false; {4538#false} is VALID [2022-04-27 12:20:35,393 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-27 12:20:35,393 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-27 12:20:35,393 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 12:20:35,393 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1441444789] [2022-04-27 12:20:35,393 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 12:20:35,393 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1768309353] [2022-04-27 12:20:35,393 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1768309353] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 12:20:35,393 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 12:20:35,393 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-27 12:20:35,394 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [389662239] [2022-04-27 12:20:35,394 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 12:20:35,395 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-27 12:20:35,395 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 12:20:35,395 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-27 12:20:35,415 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-27 12:20:35,415 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-27 12:20:35,415 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 12:20:35,415 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-27 12:20:35,415 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-27 12:20:35,416 INFO L87 Difference]: Start difference. First operand 152 states and 216 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-27 12:20:40,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:20:40,083 INFO L93 Difference]: Finished difference Result 182 states and 241 transitions. [2022-04-27 12:20:40,083 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-27 12:20:40,083 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-27 12:20:40,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 12:20:40,083 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-27 12:20:40,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 69 transitions. [2022-04-27 12:20:40,084 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-27 12:20:40,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 69 transitions. [2022-04-27 12:20:40,085 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 69 transitions. [2022-04-27 12:20:40,159 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-27 12:20:40,162 INFO L225 Difference]: With dead ends: 182 [2022-04-27 12:20:40,162 INFO L226 Difference]: Without dead ends: 177 [2022-04-27 12:20:40,162 INFO L412 NwaCegarLoop]: 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-27 12:20:40,162 INFO L413 NwaCegarLoop]: 50 mSDtfsCounter, 8 mSDsluCounter, 106 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 156 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2022-04-27 12:20:40,163 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 156 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2022-04-27 12:20:40,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2022-04-27 12:20:40,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 170. [2022-04-27 12:20:40,217 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 12:20:40,217 INFO L82 GeneralOperation]: Start isEquivalent. First operand 177 states. Second operand has 170 states, 97 states have (on average 1.1649484536082475) internal successors, (113), 101 states have internal predecessors, (113), 55 states have call successors, (55), 18 states have call predecessors, (55), 17 states have return successors, (51), 50 states have call predecessors, (51), 51 states have call successors, (51) [2022-04-27 12:20:40,218 INFO L74 IsIncluded]: Start isIncluded. First operand 177 states. Second operand has 170 states, 97 states have (on average 1.1649484536082475) internal successors, (113), 101 states have internal predecessors, (113), 55 states have call successors, (55), 18 states have call predecessors, (55), 17 states have return successors, (51), 50 states have call predecessors, (51), 51 states have call successors, (51) [2022-04-27 12:20:40,218 INFO L87 Difference]: Start difference. First operand 177 states. Second operand has 170 states, 97 states have (on average 1.1649484536082475) internal successors, (113), 101 states have internal predecessors, (113), 55 states have call successors, (55), 18 states have call predecessors, (55), 17 states have return successors, (51), 50 states have call predecessors, (51), 51 states have call successors, (51) [2022-04-27 12:20:40,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:20:40,222 INFO L93 Difference]: Finished difference Result 177 states and 228 transitions. [2022-04-27 12:20:40,222 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 228 transitions. [2022-04-27 12:20:40,223 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 12:20:40,223 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 12:20:40,223 INFO L74 IsIncluded]: Start isIncluded. First operand has 170 states, 97 states have (on average 1.1649484536082475) internal successors, (113), 101 states have internal predecessors, (113), 55 states have call successors, (55), 18 states have call predecessors, (55), 17 states have return successors, (51), 50 states have call predecessors, (51), 51 states have call successors, (51) Second operand 177 states. [2022-04-27 12:20:40,224 INFO L87 Difference]: Start difference. First operand has 170 states, 97 states have (on average 1.1649484536082475) internal successors, (113), 101 states have internal predecessors, (113), 55 states have call successors, (55), 18 states have call predecessors, (55), 17 states have return successors, (51), 50 states have call predecessors, (51), 51 states have call successors, (51) Second operand 177 states. [2022-04-27 12:20:40,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:20:40,230 INFO L93 Difference]: Finished difference Result 177 states and 228 transitions. [2022-04-27 12:20:40,230 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 228 transitions. [2022-04-27 12:20:40,230 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 12:20:40,230 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 12:20:40,231 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 12:20:40,231 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 12:20:40,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 170 states, 97 states have (on average 1.1649484536082475) internal successors, (113), 101 states have internal predecessors, (113), 55 states have call successors, (55), 18 states have call predecessors, (55), 17 states have return successors, (51), 50 states have call predecessors, (51), 51 states have call successors, (51) [2022-04-27 12:20:40,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 219 transitions. [2022-04-27 12:20:40,235 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 219 transitions. Word has length 34 [2022-04-27 12:20:40,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 12:20:40,235 INFO L495 AbstractCegarLoop]: Abstraction has 170 states and 219 transitions. [2022-04-27 12:20:40,235 INFO L496 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-27 12:20:40,235 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 219 transitions. [2022-04-27 12:20:40,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-04-27 12:20:40,235 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 12:20:40,236 INFO L195 NwaCegarLoop]: 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-27 12:20:40,253 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-04-27 12:20:40,440 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 12:20:40,442 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 12:20:40,442 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 12:20:40,442 INFO L85 PathProgramCache]: Analyzing trace with hash 821435566, now seen corresponding path program 1 times [2022-04-27 12:20:40,443 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 12:20:40,443 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [377520873] [2022-04-27 12:20:40,443 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 12:20:40,443 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 12:20:40,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:20:40,575 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 12:20:40,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:20:40,587 INFO L290 TraceCheckUtils]: 0: Hoare triple {5526#(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; {5516#(<= ~counter~0 0)} is VALID [2022-04-27 12:20:40,588 INFO L290 TraceCheckUtils]: 1: Hoare triple {5516#(<= ~counter~0 0)} assume true; {5516#(<= ~counter~0 0)} is VALID [2022-04-27 12:20:40,588 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {5516#(<= ~counter~0 0)} {5511#true} #102#return; {5516#(<= ~counter~0 0)} is VALID [2022-04-27 12:20:40,588 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-27 12:20:40,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:20:40,598 INFO L290 TraceCheckUtils]: 0: Hoare triple {5511#true} ~cond := #in~cond; {5511#true} is VALID [2022-04-27 12:20:40,599 INFO L290 TraceCheckUtils]: 1: Hoare triple {5511#true} assume !(0 == ~cond); {5511#true} is VALID [2022-04-27 12:20:40,599 INFO L290 TraceCheckUtils]: 2: Hoare triple {5511#true} assume true; {5511#true} is VALID [2022-04-27 12:20:40,599 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5511#true} {5516#(<= ~counter~0 0)} #82#return; {5516#(<= ~counter~0 0)} is VALID [2022-04-27 12:20:40,600 INFO L272 TraceCheckUtils]: 0: Hoare triple {5511#true} call ULTIMATE.init(); {5526#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 12:20:40,600 INFO L290 TraceCheckUtils]: 1: Hoare triple {5526#(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; {5516#(<= ~counter~0 0)} is VALID [2022-04-27 12:20:40,601 INFO L290 TraceCheckUtils]: 2: Hoare triple {5516#(<= ~counter~0 0)} assume true; {5516#(<= ~counter~0 0)} is VALID [2022-04-27 12:20:40,601 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5516#(<= ~counter~0 0)} {5511#true} #102#return; {5516#(<= ~counter~0 0)} is VALID [2022-04-27 12:20:40,601 INFO L272 TraceCheckUtils]: 4: Hoare triple {5516#(<= ~counter~0 0)} call #t~ret7 := main(); {5516#(<= ~counter~0 0)} is VALID [2022-04-27 12:20:40,602 INFO L290 TraceCheckUtils]: 5: Hoare triple {5516#(<= ~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; {5516#(<= ~counter~0 0)} is VALID [2022-04-27 12:20:40,602 INFO L272 TraceCheckUtils]: 6: Hoare triple {5516#(<= ~counter~0 0)} call assume_abort_if_not((if ~n~0 % 4294967296 < 1073741823 then 1 else 0)); {5511#true} is VALID [2022-04-27 12:20:40,602 INFO L290 TraceCheckUtils]: 7: Hoare triple {5511#true} ~cond := #in~cond; {5511#true} is VALID [2022-04-27 12:20:40,602 INFO L290 TraceCheckUtils]: 8: Hoare triple {5511#true} assume !(0 == ~cond); {5511#true} is VALID [2022-04-27 12:20:40,602 INFO L290 TraceCheckUtils]: 9: Hoare triple {5511#true} assume true; {5511#true} is VALID [2022-04-27 12:20:40,602 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {5511#true} {5516#(<= ~counter~0 0)} #82#return; {5516#(<= ~counter~0 0)} is VALID [2022-04-27 12:20:40,603 INFO L290 TraceCheckUtils]: 11: Hoare triple {5516#(<= ~counter~0 0)} ~p~0 := 0;~q~0 := 1;~r~0 := ~n~0;~h~0 := 0; {5516#(<= ~counter~0 0)} is VALID [2022-04-27 12:20:40,603 INFO L290 TraceCheckUtils]: 12: Hoare triple {5516#(<= ~counter~0 0)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {5521#(<= ~counter~0 1)} is VALID [2022-04-27 12:20:40,604 INFO L290 TraceCheckUtils]: 13: Hoare triple {5521#(<= ~counter~0 1)} assume !!(#t~post5 < 20);havoc #t~post5; {5521#(<= ~counter~0 1)} is VALID [2022-04-27 12:20:40,604 INFO L290 TraceCheckUtils]: 14: Hoare triple {5521#(<= ~counter~0 1)} assume !!(~q~0 % 4294967296 <= ~n~0 % 4294967296);~q~0 := 4 * ~q~0; {5521#(<= ~counter~0 1)} is VALID [2022-04-27 12:20:40,605 INFO L290 TraceCheckUtils]: 15: Hoare triple {5521#(<= ~counter~0 1)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {5522#(<= ~counter~0 2)} is VALID [2022-04-27 12:20:40,605 INFO L290 TraceCheckUtils]: 16: Hoare triple {5522#(<= ~counter~0 2)} assume !!(#t~post5 < 20);havoc #t~post5; {5522#(<= ~counter~0 2)} is VALID [2022-04-27 12:20:40,606 INFO L290 TraceCheckUtils]: 17: Hoare triple {5522#(<= ~counter~0 2)} assume !!(~q~0 % 4294967296 <= ~n~0 % 4294967296);~q~0 := 4 * ~q~0; {5522#(<= ~counter~0 2)} is VALID [2022-04-27 12:20:40,606 INFO L290 TraceCheckUtils]: 18: Hoare triple {5522#(<= ~counter~0 2)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {5523#(<= ~counter~0 3)} is VALID [2022-04-27 12:20:40,606 INFO L290 TraceCheckUtils]: 19: Hoare triple {5523#(<= ~counter~0 3)} assume !!(#t~post5 < 20);havoc #t~post5; {5523#(<= ~counter~0 3)} is VALID [2022-04-27 12:20:40,607 INFO L290 TraceCheckUtils]: 20: Hoare triple {5523#(<= ~counter~0 3)} assume !!(~q~0 % 4294967296 <= ~n~0 % 4294967296);~q~0 := 4 * ~q~0; {5523#(<= ~counter~0 3)} is VALID [2022-04-27 12:20:40,607 INFO L290 TraceCheckUtils]: 21: Hoare triple {5523#(<= ~counter~0 3)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {5524#(<= ~counter~0 4)} is VALID [2022-04-27 12:20:40,608 INFO L290 TraceCheckUtils]: 22: Hoare triple {5524#(<= ~counter~0 4)} assume !!(#t~post5 < 20);havoc #t~post5; {5524#(<= ~counter~0 4)} is VALID [2022-04-27 12:20:40,608 INFO L290 TraceCheckUtils]: 23: Hoare triple {5524#(<= ~counter~0 4)} assume !!(~q~0 % 4294967296 <= ~n~0 % 4294967296);~q~0 := 4 * ~q~0; {5524#(<= ~counter~0 4)} is VALID [2022-04-27 12:20:40,608 INFO L290 TraceCheckUtils]: 24: Hoare triple {5524#(<= ~counter~0 4)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {5525#(<= |main_#t~post5| 4)} is VALID [2022-04-27 12:20:40,609 INFO L290 TraceCheckUtils]: 25: Hoare triple {5525#(<= |main_#t~post5| 4)} assume !(#t~post5 < 20);havoc #t~post5; {5512#false} is VALID [2022-04-27 12:20:40,609 INFO L290 TraceCheckUtils]: 26: Hoare triple {5512#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {5512#false} is VALID [2022-04-27 12:20:40,609 INFO L290 TraceCheckUtils]: 27: Hoare triple {5512#false} assume !!(#t~post6 < 20);havoc #t~post6; {5512#false} is VALID [2022-04-27 12:20:40,609 INFO L272 TraceCheckUtils]: 28: Hoare triple {5512#false} call __VERIFIER_assert((if ~r~0 % 4294967296 < (2 * ~p~0 + ~q~0) % 4294967296 then 1 else 0)); {5512#false} is VALID [2022-04-27 12:20:40,609 INFO L290 TraceCheckUtils]: 29: Hoare triple {5512#false} ~cond := #in~cond; {5512#false} is VALID [2022-04-27 12:20:40,609 INFO L290 TraceCheckUtils]: 30: Hoare triple {5512#false} assume 0 == ~cond; {5512#false} is VALID [2022-04-27 12:20:40,610 INFO L290 TraceCheckUtils]: 31: Hoare triple {5512#false} assume !false; {5512#false} is VALID [2022-04-27 12:20:40,610 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-27 12:20:40,610 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 12:20:40,610 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [377520873] [2022-04-27 12:20:40,610 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [377520873] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 12:20:40,611 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1806271841] [2022-04-27 12:20:40,611 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 12:20:40,611 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 12:20:40,611 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 12:20:40,620 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 12:20:40,621 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-04-27 12:20:40,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:20:40,655 INFO L263 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 13 conjunts are in the unsatisfiable core [2022-04-27 12:20:40,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:20:40,672 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 12:20:40,897 INFO L272 TraceCheckUtils]: 0: Hoare triple {5511#true} call ULTIMATE.init(); {5511#true} is VALID [2022-04-27 12:20:40,898 INFO L290 TraceCheckUtils]: 1: Hoare triple {5511#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; {5516#(<= ~counter~0 0)} is VALID [2022-04-27 12:20:40,899 INFO L290 TraceCheckUtils]: 2: Hoare triple {5516#(<= ~counter~0 0)} assume true; {5516#(<= ~counter~0 0)} is VALID [2022-04-27 12:20:40,901 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5516#(<= ~counter~0 0)} {5511#true} #102#return; {5516#(<= ~counter~0 0)} is VALID [2022-04-27 12:20:40,903 INFO L272 TraceCheckUtils]: 4: Hoare triple {5516#(<= ~counter~0 0)} call #t~ret7 := main(); {5516#(<= ~counter~0 0)} is VALID [2022-04-27 12:20:40,904 INFO L290 TraceCheckUtils]: 5: Hoare triple {5516#(<= ~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; {5516#(<= ~counter~0 0)} is VALID [2022-04-27 12:20:40,905 INFO L272 TraceCheckUtils]: 6: Hoare triple {5516#(<= ~counter~0 0)} call assume_abort_if_not((if ~n~0 % 4294967296 < 1073741823 then 1 else 0)); {5516#(<= ~counter~0 0)} is VALID [2022-04-27 12:20:40,905 INFO L290 TraceCheckUtils]: 7: Hoare triple {5516#(<= ~counter~0 0)} ~cond := #in~cond; {5516#(<= ~counter~0 0)} is VALID [2022-04-27 12:20:40,905 INFO L290 TraceCheckUtils]: 8: Hoare triple {5516#(<= ~counter~0 0)} assume !(0 == ~cond); {5516#(<= ~counter~0 0)} is VALID [2022-04-27 12:20:40,906 INFO L290 TraceCheckUtils]: 9: Hoare triple {5516#(<= ~counter~0 0)} assume true; {5516#(<= ~counter~0 0)} is VALID [2022-04-27 12:20:40,906 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {5516#(<= ~counter~0 0)} {5516#(<= ~counter~0 0)} #82#return; {5516#(<= ~counter~0 0)} is VALID [2022-04-27 12:20:40,907 INFO L290 TraceCheckUtils]: 11: Hoare triple {5516#(<= ~counter~0 0)} ~p~0 := 0;~q~0 := 1;~r~0 := ~n~0;~h~0 := 0; {5516#(<= ~counter~0 0)} is VALID [2022-04-27 12:20:40,908 INFO L290 TraceCheckUtils]: 12: Hoare triple {5516#(<= ~counter~0 0)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {5521#(<= ~counter~0 1)} is VALID [2022-04-27 12:20:40,909 INFO L290 TraceCheckUtils]: 13: Hoare triple {5521#(<= ~counter~0 1)} assume !!(#t~post5 < 20);havoc #t~post5; {5521#(<= ~counter~0 1)} is VALID [2022-04-27 12:20:40,910 INFO L290 TraceCheckUtils]: 14: Hoare triple {5521#(<= ~counter~0 1)} assume !!(~q~0 % 4294967296 <= ~n~0 % 4294967296);~q~0 := 4 * ~q~0; {5521#(<= ~counter~0 1)} is VALID [2022-04-27 12:20:40,911 INFO L290 TraceCheckUtils]: 15: Hoare triple {5521#(<= ~counter~0 1)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {5522#(<= ~counter~0 2)} is VALID [2022-04-27 12:20:40,912 INFO L290 TraceCheckUtils]: 16: Hoare triple {5522#(<= ~counter~0 2)} assume !!(#t~post5 < 20);havoc #t~post5; {5522#(<= ~counter~0 2)} is VALID [2022-04-27 12:20:40,912 INFO L290 TraceCheckUtils]: 17: Hoare triple {5522#(<= ~counter~0 2)} assume !!(~q~0 % 4294967296 <= ~n~0 % 4294967296);~q~0 := 4 * ~q~0; {5522#(<= ~counter~0 2)} is VALID [2022-04-27 12:20:40,913 INFO L290 TraceCheckUtils]: 18: Hoare triple {5522#(<= ~counter~0 2)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {5523#(<= ~counter~0 3)} is VALID [2022-04-27 12:20:40,913 INFO L290 TraceCheckUtils]: 19: Hoare triple {5523#(<= ~counter~0 3)} assume !!(#t~post5 < 20);havoc #t~post5; {5523#(<= ~counter~0 3)} is VALID [2022-04-27 12:20:40,914 INFO L290 TraceCheckUtils]: 20: Hoare triple {5523#(<= ~counter~0 3)} assume !!(~q~0 % 4294967296 <= ~n~0 % 4294967296);~q~0 := 4 * ~q~0; {5523#(<= ~counter~0 3)} is VALID [2022-04-27 12:20:40,914 INFO L290 TraceCheckUtils]: 21: Hoare triple {5523#(<= ~counter~0 3)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {5524#(<= ~counter~0 4)} is VALID [2022-04-27 12:20:40,915 INFO L290 TraceCheckUtils]: 22: Hoare triple {5524#(<= ~counter~0 4)} assume !!(#t~post5 < 20);havoc #t~post5; {5524#(<= ~counter~0 4)} is VALID [2022-04-27 12:20:40,915 INFO L290 TraceCheckUtils]: 23: Hoare triple {5524#(<= ~counter~0 4)} assume !!(~q~0 % 4294967296 <= ~n~0 % 4294967296);~q~0 := 4 * ~q~0; {5524#(<= ~counter~0 4)} is VALID [2022-04-27 12:20:40,915 INFO L290 TraceCheckUtils]: 24: Hoare triple {5524#(<= ~counter~0 4)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {5525#(<= |main_#t~post5| 4)} is VALID [2022-04-27 12:20:40,916 INFO L290 TraceCheckUtils]: 25: Hoare triple {5525#(<= |main_#t~post5| 4)} assume !(#t~post5 < 20);havoc #t~post5; {5512#false} is VALID [2022-04-27 12:20:40,916 INFO L290 TraceCheckUtils]: 26: Hoare triple {5512#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {5512#false} is VALID [2022-04-27 12:20:40,916 INFO L290 TraceCheckUtils]: 27: Hoare triple {5512#false} assume !!(#t~post6 < 20);havoc #t~post6; {5512#false} is VALID [2022-04-27 12:20:40,916 INFO L272 TraceCheckUtils]: 28: Hoare triple {5512#false} call __VERIFIER_assert((if ~r~0 % 4294967296 < (2 * ~p~0 + ~q~0) % 4294967296 then 1 else 0)); {5512#false} is VALID [2022-04-27 12:20:40,916 INFO L290 TraceCheckUtils]: 29: Hoare triple {5512#false} ~cond := #in~cond; {5512#false} is VALID [2022-04-27 12:20:40,916 INFO L290 TraceCheckUtils]: 30: Hoare triple {5512#false} assume 0 == ~cond; {5512#false} is VALID [2022-04-27 12:20:40,916 INFO L290 TraceCheckUtils]: 31: Hoare triple {5512#false} assume !false; {5512#false} is VALID [2022-04-27 12:20:40,916 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-27 12:20:40,916 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 12:20:41,205 INFO L290 TraceCheckUtils]: 31: Hoare triple {5512#false} assume !false; {5512#false} is VALID [2022-04-27 12:20:41,205 INFO L290 TraceCheckUtils]: 30: Hoare triple {5512#false} assume 0 == ~cond; {5512#false} is VALID [2022-04-27 12:20:41,205 INFO L290 TraceCheckUtils]: 29: Hoare triple {5512#false} ~cond := #in~cond; {5512#false} is VALID [2022-04-27 12:20:41,205 INFO L272 TraceCheckUtils]: 28: Hoare triple {5512#false} call __VERIFIER_assert((if ~r~0 % 4294967296 < (2 * ~p~0 + ~q~0) % 4294967296 then 1 else 0)); {5512#false} is VALID [2022-04-27 12:20:41,205 INFO L290 TraceCheckUtils]: 27: Hoare triple {5512#false} assume !!(#t~post6 < 20);havoc #t~post6; {5512#false} is VALID [2022-04-27 12:20:41,205 INFO L290 TraceCheckUtils]: 26: Hoare triple {5512#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {5512#false} is VALID [2022-04-27 12:20:41,209 INFO L290 TraceCheckUtils]: 25: Hoare triple {5641#(< |main_#t~post5| 20)} assume !(#t~post5 < 20);havoc #t~post5; {5512#false} is VALID [2022-04-27 12:20:41,209 INFO L290 TraceCheckUtils]: 24: Hoare triple {5645#(< ~counter~0 20)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {5641#(< |main_#t~post5| 20)} is VALID [2022-04-27 12:20:41,210 INFO L290 TraceCheckUtils]: 23: Hoare triple {5645#(< ~counter~0 20)} assume !!(~q~0 % 4294967296 <= ~n~0 % 4294967296);~q~0 := 4 * ~q~0; {5645#(< ~counter~0 20)} is VALID [2022-04-27 12:20:41,210 INFO L290 TraceCheckUtils]: 22: Hoare triple {5645#(< ~counter~0 20)} assume !!(#t~post5 < 20);havoc #t~post5; {5645#(< ~counter~0 20)} is VALID [2022-04-27 12:20:41,211 INFO L290 TraceCheckUtils]: 21: Hoare triple {5655#(< ~counter~0 19)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {5645#(< ~counter~0 20)} is VALID [2022-04-27 12:20:41,211 INFO L290 TraceCheckUtils]: 20: Hoare triple {5655#(< ~counter~0 19)} assume !!(~q~0 % 4294967296 <= ~n~0 % 4294967296);~q~0 := 4 * ~q~0; {5655#(< ~counter~0 19)} is VALID [2022-04-27 12:20:41,211 INFO L290 TraceCheckUtils]: 19: Hoare triple {5655#(< ~counter~0 19)} assume !!(#t~post5 < 20);havoc #t~post5; {5655#(< ~counter~0 19)} is VALID [2022-04-27 12:20:41,212 INFO L290 TraceCheckUtils]: 18: Hoare triple {5665#(< ~counter~0 18)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {5655#(< ~counter~0 19)} is VALID [2022-04-27 12:20:41,212 INFO L290 TraceCheckUtils]: 17: Hoare triple {5665#(< ~counter~0 18)} assume !!(~q~0 % 4294967296 <= ~n~0 % 4294967296);~q~0 := 4 * ~q~0; {5665#(< ~counter~0 18)} is VALID [2022-04-27 12:20:41,212 INFO L290 TraceCheckUtils]: 16: Hoare triple {5665#(< ~counter~0 18)} assume !!(#t~post5 < 20);havoc #t~post5; {5665#(< ~counter~0 18)} is VALID [2022-04-27 12:20:41,213 INFO L290 TraceCheckUtils]: 15: Hoare triple {5675#(< ~counter~0 17)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {5665#(< ~counter~0 18)} is VALID [2022-04-27 12:20:41,213 INFO L290 TraceCheckUtils]: 14: Hoare triple {5675#(< ~counter~0 17)} assume !!(~q~0 % 4294967296 <= ~n~0 % 4294967296);~q~0 := 4 * ~q~0; {5675#(< ~counter~0 17)} is VALID [2022-04-27 12:20:41,213 INFO L290 TraceCheckUtils]: 13: Hoare triple {5675#(< ~counter~0 17)} assume !!(#t~post5 < 20);havoc #t~post5; {5675#(< ~counter~0 17)} is VALID [2022-04-27 12:20:41,214 INFO L290 TraceCheckUtils]: 12: Hoare triple {5685#(< ~counter~0 16)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {5675#(< ~counter~0 17)} is VALID [2022-04-27 12:20:41,214 INFO L290 TraceCheckUtils]: 11: Hoare triple {5685#(< ~counter~0 16)} ~p~0 := 0;~q~0 := 1;~r~0 := ~n~0;~h~0 := 0; {5685#(< ~counter~0 16)} is VALID [2022-04-27 12:20:41,214 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {5511#true} {5685#(< ~counter~0 16)} #82#return; {5685#(< ~counter~0 16)} is VALID [2022-04-27 12:20:41,214 INFO L290 TraceCheckUtils]: 9: Hoare triple {5511#true} assume true; {5511#true} is VALID [2022-04-27 12:20:41,214 INFO L290 TraceCheckUtils]: 8: Hoare triple {5511#true} assume !(0 == ~cond); {5511#true} is VALID [2022-04-27 12:20:41,214 INFO L290 TraceCheckUtils]: 7: Hoare triple {5511#true} ~cond := #in~cond; {5511#true} is VALID [2022-04-27 12:20:41,215 INFO L272 TraceCheckUtils]: 6: Hoare triple {5685#(< ~counter~0 16)} call assume_abort_if_not((if ~n~0 % 4294967296 < 1073741823 then 1 else 0)); {5511#true} is VALID [2022-04-27 12:20:41,215 INFO L290 TraceCheckUtils]: 5: Hoare triple {5685#(< ~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; {5685#(< ~counter~0 16)} is VALID [2022-04-27 12:20:41,215 INFO L272 TraceCheckUtils]: 4: Hoare triple {5685#(< ~counter~0 16)} call #t~ret7 := main(); {5685#(< ~counter~0 16)} is VALID [2022-04-27 12:20:41,215 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5685#(< ~counter~0 16)} {5511#true} #102#return; {5685#(< ~counter~0 16)} is VALID [2022-04-27 12:20:41,216 INFO L290 TraceCheckUtils]: 2: Hoare triple {5685#(< ~counter~0 16)} assume true; {5685#(< ~counter~0 16)} is VALID [2022-04-27 12:20:41,216 INFO L290 TraceCheckUtils]: 1: Hoare triple {5511#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; {5685#(< ~counter~0 16)} is VALID [2022-04-27 12:20:41,216 INFO L272 TraceCheckUtils]: 0: Hoare triple {5511#true} call ULTIMATE.init(); {5511#true} is VALID [2022-04-27 12:20:41,216 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-27 12:20:41,217 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1806271841] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 12:20:41,217 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-27 12:20:41,217 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 15 [2022-04-27 12:20:41,217 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1294426943] [2022-04-27 12:20:41,217 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-27 12:20:41,217 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-27 12:20:41,218 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 12:20:41,218 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-27 12:20:41,263 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-27 12:20:41,263 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-04-27 12:20:41,263 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 12:20:41,264 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-04-27 12:20:41,264 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=137, Unknown=0, NotChecked=0, Total=210 [2022-04-27 12:20:41,264 INFO L87 Difference]: Start difference. First operand 170 states and 219 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-27 12:20:45,542 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-27 12:20:47,615 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-27 12:20:49,981 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.22s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-27 12:20:53,573 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-27 12:20:55,772 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-27 12:21:00,362 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-27 12:21:02,676 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-27 12:21:04,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-27 12:21:13,884 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-27 12:21:25,971 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-27 12:21:27,975 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-27 12:21:30,571 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-27 12:21:37,481 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-27 12:21:44,016 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.25s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-27 12:21:46,694 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.19s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-27 12:21:58,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:21:58,025 INFO L93 Difference]: Finished difference Result 346 states and 445 transitions. [2022-04-27 12:21:58,025 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-04-27 12:21:58,025 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-27 12:21:58,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 12:21:58,026 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-27 12:21:58,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 281 transitions. [2022-04-27 12:21:58,030 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-27 12:21:58,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 281 transitions. [2022-04-27 12:21:58,033 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 31 states and 281 transitions. [2022-04-27 12:21:58,308 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 281 edges. 281 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 12:21:58,313 INFO L225 Difference]: With dead ends: 346 [2022-04-27 12:21:58,314 INFO L226 Difference]: Without dead ends: 306 [2022-04-27 12:21:58,314 INFO L412 NwaCegarLoop]: 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-27 12:21:58,315 INFO L413 NwaCegarLoop]: 47 mSDtfsCounter, 244 mSDsluCounter, 102 mSDsCounter, 0 mSdLazyCounter, 468 mSolverCounterSat, 196 mSolverCounterUnsat, 12 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 51.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 288 SdHoareTripleChecker+Valid, 149 SdHoareTripleChecker+Invalid, 676 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 196 IncrementalHoareTripleChecker+Valid, 468 IncrementalHoareTripleChecker+Invalid, 12 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 51.6s IncrementalHoareTripleChecker+Time [2022-04-27 12:21:58,315 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [288 Valid, 149 Invalid, 676 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [196 Valid, 468 Invalid, 12 Unknown, 0 Unchecked, 51.6s Time] [2022-04-27 12:21:58,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 306 states. [2022-04-27 12:21:58,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 306 to 243. [2022-04-27 12:21:58,422 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 12:21:58,422 INFO L82 GeneralOperation]: Start isEquivalent. First operand 306 states. Second operand has 243 states, 141 states have (on average 1.1843971631205674) internal successors, (167), 149 states have internal predecessors, (167), 78 states have call successors, (78), 24 states have call predecessors, (78), 23 states have return successors, (72), 69 states have call predecessors, (72), 72 states have call successors, (72) [2022-04-27 12:21:58,423 INFO L74 IsIncluded]: Start isIncluded. First operand 306 states. Second operand has 243 states, 141 states have (on average 1.1843971631205674) internal successors, (167), 149 states have internal predecessors, (167), 78 states have call successors, (78), 24 states have call predecessors, (78), 23 states have return successors, (72), 69 states have call predecessors, (72), 72 states have call successors, (72) [2022-04-27 12:21:58,423 INFO L87 Difference]: Start difference. First operand 306 states. Second operand has 243 states, 141 states have (on average 1.1843971631205674) internal successors, (167), 149 states have internal predecessors, (167), 78 states have call successors, (78), 24 states have call predecessors, (78), 23 states have return successors, (72), 69 states have call predecessors, (72), 72 states have call successors, (72) [2022-04-27 12:21:58,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:21:58,429 INFO L93 Difference]: Finished difference Result 306 states and 386 transitions. [2022-04-27 12:21:58,429 INFO L276 IsEmpty]: Start isEmpty. Operand 306 states and 386 transitions. [2022-04-27 12:21:58,430 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 12:21:58,430 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 12:21:58,431 INFO L74 IsIncluded]: Start isIncluded. First operand has 243 states, 141 states have (on average 1.1843971631205674) internal successors, (167), 149 states have internal predecessors, (167), 78 states have call successors, (78), 24 states have call predecessors, (78), 23 states have return successors, (72), 69 states have call predecessors, (72), 72 states have call successors, (72) Second operand 306 states. [2022-04-27 12:21:58,431 INFO L87 Difference]: Start difference. First operand has 243 states, 141 states have (on average 1.1843971631205674) internal successors, (167), 149 states have internal predecessors, (167), 78 states have call successors, (78), 24 states have call predecessors, (78), 23 states have return successors, (72), 69 states have call predecessors, (72), 72 states have call successors, (72) Second operand 306 states. [2022-04-27 12:21:58,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:21:58,439 INFO L93 Difference]: Finished difference Result 306 states and 386 transitions. [2022-04-27 12:21:58,439 INFO L276 IsEmpty]: Start isEmpty. Operand 306 states and 386 transitions. [2022-04-27 12:21:58,440 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 12:21:58,440 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 12:21:58,440 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 12:21:58,440 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 12:21:58,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 243 states, 141 states have (on average 1.1843971631205674) internal successors, (167), 149 states have internal predecessors, (167), 78 states have call successors, (78), 24 states have call predecessors, (78), 23 states have return successors, (72), 69 states have call predecessors, (72), 72 states have call successors, (72) [2022-04-27 12:21:58,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 243 states to 243 states and 317 transitions. [2022-04-27 12:21:58,447 INFO L78 Accepts]: Start accepts. Automaton has 243 states and 317 transitions. Word has length 32 [2022-04-27 12:21:58,447 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 12:21:58,447 INFO L495 AbstractCegarLoop]: Abstraction has 243 states and 317 transitions. [2022-04-27 12:21:58,447 INFO L496 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-27 12:21:58,447 INFO L276 IsEmpty]: Start isEmpty. Operand 243 states and 317 transitions. [2022-04-27 12:21:58,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2022-04-27 12:21:58,448 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 12:21:58,448 INFO L195 NwaCegarLoop]: 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-27 12:21:58,466 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-04-27 12:21:58,659 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-04-27 12:21:58,660 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 12:21:58,660 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 12:21:58,660 INFO L85 PathProgramCache]: Analyzing trace with hash -271152338, now seen corresponding path program 2 times [2022-04-27 12:21:58,660 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 12:21:58,660 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1528200255] [2022-04-27 12:21:58,660 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 12:21:58,660 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 12:21:58,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:21:58,841 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 12:21:58,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:21:58,851 INFO L290 TraceCheckUtils]: 0: Hoare triple {7249#(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; {7233#(<= ~counter~0 0)} is VALID [2022-04-27 12:21:58,852 INFO L290 TraceCheckUtils]: 1: Hoare triple {7233#(<= ~counter~0 0)} assume true; {7233#(<= ~counter~0 0)} is VALID [2022-04-27 12:21:58,852 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {7233#(<= ~counter~0 0)} {7228#true} #102#return; {7233#(<= ~counter~0 0)} is VALID [2022-04-27 12:21:58,852 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-27 12:21:58,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:21:58,857 INFO L290 TraceCheckUtils]: 0: Hoare triple {7228#true} ~cond := #in~cond; {7228#true} is VALID [2022-04-27 12:21:58,857 INFO L290 TraceCheckUtils]: 1: Hoare triple {7228#true} assume !(0 == ~cond); {7228#true} is VALID [2022-04-27 12:21:58,857 INFO L290 TraceCheckUtils]: 2: Hoare triple {7228#true} assume true; {7228#true} is VALID [2022-04-27 12:21:58,858 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7228#true} {7233#(<= ~counter~0 0)} #82#return; {7233#(<= ~counter~0 0)} is VALID [2022-04-27 12:21:58,858 INFO L272 TraceCheckUtils]: 0: Hoare triple {7228#true} call ULTIMATE.init(); {7249#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 12:21:58,859 INFO L290 TraceCheckUtils]: 1: Hoare triple {7249#(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; {7233#(<= ~counter~0 0)} is VALID [2022-04-27 12:21:58,859 INFO L290 TraceCheckUtils]: 2: Hoare triple {7233#(<= ~counter~0 0)} assume true; {7233#(<= ~counter~0 0)} is VALID [2022-04-27 12:21:58,860 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7233#(<= ~counter~0 0)} {7228#true} #102#return; {7233#(<= ~counter~0 0)} is VALID [2022-04-27 12:21:58,860 INFO L272 TraceCheckUtils]: 4: Hoare triple {7233#(<= ~counter~0 0)} call #t~ret7 := main(); {7233#(<= ~counter~0 0)} is VALID [2022-04-27 12:21:58,860 INFO L290 TraceCheckUtils]: 5: Hoare triple {7233#(<= ~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; {7233#(<= ~counter~0 0)} is VALID [2022-04-27 12:21:58,860 INFO L272 TraceCheckUtils]: 6: Hoare triple {7233#(<= ~counter~0 0)} call assume_abort_if_not((if ~n~0 % 4294967296 < 1073741823 then 1 else 0)); {7228#true} is VALID [2022-04-27 12:21:58,860 INFO L290 TraceCheckUtils]: 7: Hoare triple {7228#true} ~cond := #in~cond; {7228#true} is VALID [2022-04-27 12:21:58,860 INFO L290 TraceCheckUtils]: 8: Hoare triple {7228#true} assume !(0 == ~cond); {7228#true} is VALID [2022-04-27 12:21:58,861 INFO L290 TraceCheckUtils]: 9: Hoare triple {7228#true} assume true; {7228#true} is VALID [2022-04-27 12:21:58,861 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {7228#true} {7233#(<= ~counter~0 0)} #82#return; {7233#(<= ~counter~0 0)} is VALID [2022-04-27 12:21:58,861 INFO L290 TraceCheckUtils]: 11: Hoare triple {7233#(<= ~counter~0 0)} ~p~0 := 0;~q~0 := 1;~r~0 := ~n~0;~h~0 := 0; {7233#(<= ~counter~0 0)} is VALID [2022-04-27 12:21:58,862 INFO L290 TraceCheckUtils]: 12: Hoare triple {7233#(<= ~counter~0 0)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {7238#(<= ~counter~0 1)} is VALID [2022-04-27 12:21:58,862 INFO L290 TraceCheckUtils]: 13: Hoare triple {7238#(<= ~counter~0 1)} assume !!(#t~post5 < 20);havoc #t~post5; {7238#(<= ~counter~0 1)} is VALID [2022-04-27 12:21:58,863 INFO L290 TraceCheckUtils]: 14: Hoare triple {7238#(<= ~counter~0 1)} assume !!(~q~0 % 4294967296 <= ~n~0 % 4294967296);~q~0 := 4 * ~q~0; {7238#(<= ~counter~0 1)} is VALID [2022-04-27 12:21:58,863 INFO L290 TraceCheckUtils]: 15: Hoare triple {7238#(<= ~counter~0 1)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {7239#(<= ~counter~0 2)} is VALID [2022-04-27 12:21:58,863 INFO L290 TraceCheckUtils]: 16: Hoare triple {7239#(<= ~counter~0 2)} assume !!(#t~post5 < 20);havoc #t~post5; {7239#(<= ~counter~0 2)} is VALID [2022-04-27 12:21:58,864 INFO L290 TraceCheckUtils]: 17: Hoare triple {7239#(<= ~counter~0 2)} assume !!(~q~0 % 4294967296 <= ~n~0 % 4294967296);~q~0 := 4 * ~q~0; {7239#(<= ~counter~0 2)} is VALID [2022-04-27 12:21:58,864 INFO L290 TraceCheckUtils]: 18: Hoare triple {7239#(<= ~counter~0 2)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {7240#(<= ~counter~0 3)} is VALID [2022-04-27 12:21:58,864 INFO L290 TraceCheckUtils]: 19: Hoare triple {7240#(<= ~counter~0 3)} assume !!(#t~post5 < 20);havoc #t~post5; {7240#(<= ~counter~0 3)} is VALID [2022-04-27 12:21:58,865 INFO L290 TraceCheckUtils]: 20: Hoare triple {7240#(<= ~counter~0 3)} assume !!(~q~0 % 4294967296 <= ~n~0 % 4294967296);~q~0 := 4 * ~q~0; {7240#(<= ~counter~0 3)} is VALID [2022-04-27 12:21:58,865 INFO L290 TraceCheckUtils]: 21: Hoare triple {7240#(<= ~counter~0 3)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {7241#(<= ~counter~0 4)} is VALID [2022-04-27 12:21:58,866 INFO L290 TraceCheckUtils]: 22: Hoare triple {7241#(<= ~counter~0 4)} assume !!(#t~post5 < 20);havoc #t~post5; {7241#(<= ~counter~0 4)} is VALID [2022-04-27 12:21:58,866 INFO L290 TraceCheckUtils]: 23: Hoare triple {7241#(<= ~counter~0 4)} assume !!(~q~0 % 4294967296 <= ~n~0 % 4294967296);~q~0 := 4 * ~q~0; {7241#(<= ~counter~0 4)} is VALID [2022-04-27 12:21:58,866 INFO L290 TraceCheckUtils]: 24: Hoare triple {7241#(<= ~counter~0 4)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {7242#(<= ~counter~0 5)} is VALID [2022-04-27 12:21:58,867 INFO L290 TraceCheckUtils]: 25: Hoare triple {7242#(<= ~counter~0 5)} assume !!(#t~post5 < 20);havoc #t~post5; {7242#(<= ~counter~0 5)} is VALID [2022-04-27 12:21:58,867 INFO L290 TraceCheckUtils]: 26: Hoare triple {7242#(<= ~counter~0 5)} assume !!(~q~0 % 4294967296 <= ~n~0 % 4294967296);~q~0 := 4 * ~q~0; {7242#(<= ~counter~0 5)} is VALID [2022-04-27 12:21:58,867 INFO L290 TraceCheckUtils]: 27: Hoare triple {7242#(<= ~counter~0 5)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {7243#(<= ~counter~0 6)} is VALID [2022-04-27 12:21:58,868 INFO L290 TraceCheckUtils]: 28: Hoare triple {7243#(<= ~counter~0 6)} assume !!(#t~post5 < 20);havoc #t~post5; {7243#(<= ~counter~0 6)} is VALID [2022-04-27 12:21:58,868 INFO L290 TraceCheckUtils]: 29: Hoare triple {7243#(<= ~counter~0 6)} assume !!(~q~0 % 4294967296 <= ~n~0 % 4294967296);~q~0 := 4 * ~q~0; {7243#(<= ~counter~0 6)} is VALID [2022-04-27 12:21:58,869 INFO L290 TraceCheckUtils]: 30: Hoare triple {7243#(<= ~counter~0 6)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {7244#(<= ~counter~0 7)} is VALID [2022-04-27 12:21:58,869 INFO L290 TraceCheckUtils]: 31: Hoare triple {7244#(<= ~counter~0 7)} assume !!(#t~post5 < 20);havoc #t~post5; {7244#(<= ~counter~0 7)} is VALID [2022-04-27 12:21:58,869 INFO L290 TraceCheckUtils]: 32: Hoare triple {7244#(<= ~counter~0 7)} assume !!(~q~0 % 4294967296 <= ~n~0 % 4294967296);~q~0 := 4 * ~q~0; {7244#(<= ~counter~0 7)} is VALID [2022-04-27 12:21:58,869 INFO L290 TraceCheckUtils]: 33: Hoare triple {7244#(<= ~counter~0 7)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {7245#(<= ~counter~0 8)} is VALID [2022-04-27 12:21:58,870 INFO L290 TraceCheckUtils]: 34: Hoare triple {7245#(<= ~counter~0 8)} assume !!(#t~post5 < 20);havoc #t~post5; {7245#(<= ~counter~0 8)} is VALID [2022-04-27 12:21:58,870 INFO L290 TraceCheckUtils]: 35: Hoare triple {7245#(<= ~counter~0 8)} assume !!(~q~0 % 4294967296 <= ~n~0 % 4294967296);~q~0 := 4 * ~q~0; {7245#(<= ~counter~0 8)} is VALID [2022-04-27 12:21:58,870 INFO L290 TraceCheckUtils]: 36: Hoare triple {7245#(<= ~counter~0 8)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {7246#(<= ~counter~0 9)} is VALID [2022-04-27 12:21:58,871 INFO L290 TraceCheckUtils]: 37: Hoare triple {7246#(<= ~counter~0 9)} assume !!(#t~post5 < 20);havoc #t~post5; {7246#(<= ~counter~0 9)} is VALID [2022-04-27 12:21:58,871 INFO L290 TraceCheckUtils]: 38: Hoare triple {7246#(<= ~counter~0 9)} assume !!(~q~0 % 4294967296 <= ~n~0 % 4294967296);~q~0 := 4 * ~q~0; {7246#(<= ~counter~0 9)} is VALID [2022-04-27 12:21:58,871 INFO L290 TraceCheckUtils]: 39: Hoare triple {7246#(<= ~counter~0 9)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {7247#(<= ~counter~0 10)} is VALID [2022-04-27 12:21:58,872 INFO L290 TraceCheckUtils]: 40: Hoare triple {7247#(<= ~counter~0 10)} assume !!(#t~post5 < 20);havoc #t~post5; {7247#(<= ~counter~0 10)} is VALID [2022-04-27 12:21:58,872 INFO L290 TraceCheckUtils]: 41: Hoare triple {7247#(<= ~counter~0 10)} assume !!(~q~0 % 4294967296 <= ~n~0 % 4294967296);~q~0 := 4 * ~q~0; {7247#(<= ~counter~0 10)} is VALID [2022-04-27 12:21:58,872 INFO L290 TraceCheckUtils]: 42: Hoare triple {7247#(<= ~counter~0 10)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {7248#(<= |main_#t~post5| 10)} is VALID [2022-04-27 12:21:58,873 INFO L290 TraceCheckUtils]: 43: Hoare triple {7248#(<= |main_#t~post5| 10)} assume !(#t~post5 < 20);havoc #t~post5; {7229#false} is VALID [2022-04-27 12:21:58,873 INFO L290 TraceCheckUtils]: 44: Hoare triple {7229#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {7229#false} is VALID [2022-04-27 12:21:58,873 INFO L290 TraceCheckUtils]: 45: Hoare triple {7229#false} assume !!(#t~post6 < 20);havoc #t~post6; {7229#false} is VALID [2022-04-27 12:21:58,873 INFO L272 TraceCheckUtils]: 46: Hoare triple {7229#false} call __VERIFIER_assert((if ~r~0 % 4294967296 < (2 * ~p~0 + ~q~0) % 4294967296 then 1 else 0)); {7229#false} is VALID [2022-04-27 12:21:58,873 INFO L290 TraceCheckUtils]: 47: Hoare triple {7229#false} ~cond := #in~cond; {7229#false} is VALID [2022-04-27 12:21:58,873 INFO L290 TraceCheckUtils]: 48: Hoare triple {7229#false} assume 0 == ~cond; {7229#false} is VALID [2022-04-27 12:21:58,873 INFO L290 TraceCheckUtils]: 49: Hoare triple {7229#false} assume !false; {7229#false} is VALID [2022-04-27 12:21:58,873 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-27 12:21:58,873 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 12:21:58,874 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1528200255] [2022-04-27 12:21:58,874 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1528200255] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 12:21:58,874 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2092451060] [2022-04-27 12:21:58,874 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-27 12:21:58,874 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 12:21:58,874 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 12:21:58,875 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 12:21:58,875 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-27 12:21:58,910 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-04-27 12:21:58,910 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 12:21:58,911 INFO L263 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 4 conjunts are in the unsatisfiable core [2022-04-27 12:21:58,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:21:58,923 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 12:21:59,062 INFO L272 TraceCheckUtils]: 0: Hoare triple {7228#true} call ULTIMATE.init(); {7228#true} is VALID [2022-04-27 12:21:59,062 INFO L290 TraceCheckUtils]: 1: Hoare triple {7228#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; {7228#true} is VALID [2022-04-27 12:21:59,062 INFO L290 TraceCheckUtils]: 2: Hoare triple {7228#true} assume true; {7228#true} is VALID [2022-04-27 12:21:59,062 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7228#true} {7228#true} #102#return; {7228#true} is VALID [2022-04-27 12:21:59,062 INFO L272 TraceCheckUtils]: 4: Hoare triple {7228#true} call #t~ret7 := main(); {7228#true} is VALID [2022-04-27 12:21:59,063 INFO L290 TraceCheckUtils]: 5: Hoare triple {7228#true} havoc ~n~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~h~0;~n~0 := #t~nondet4;havoc #t~nondet4; {7228#true} is VALID [2022-04-27 12:21:59,063 INFO L272 TraceCheckUtils]: 6: Hoare triple {7228#true} call assume_abort_if_not((if ~n~0 % 4294967296 < 1073741823 then 1 else 0)); {7228#true} is VALID [2022-04-27 12:21:59,063 INFO L290 TraceCheckUtils]: 7: Hoare triple {7228#true} ~cond := #in~cond; {7228#true} is VALID [2022-04-27 12:21:59,063 INFO L290 TraceCheckUtils]: 8: Hoare triple {7228#true} assume !(0 == ~cond); {7228#true} is VALID [2022-04-27 12:21:59,063 INFO L290 TraceCheckUtils]: 9: Hoare triple {7228#true} assume true; {7228#true} is VALID [2022-04-27 12:21:59,063 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {7228#true} {7228#true} #82#return; {7228#true} is VALID [2022-04-27 12:21:59,063 INFO L290 TraceCheckUtils]: 11: Hoare triple {7228#true} ~p~0 := 0;~q~0 := 1;~r~0 := ~n~0;~h~0 := 0; {7228#true} is VALID [2022-04-27 12:21:59,063 INFO L290 TraceCheckUtils]: 12: Hoare triple {7228#true} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {7228#true} is VALID [2022-04-27 12:21:59,063 INFO L290 TraceCheckUtils]: 13: Hoare triple {7228#true} assume !!(#t~post5 < 20);havoc #t~post5; {7228#true} is VALID [2022-04-27 12:21:59,063 INFO L290 TraceCheckUtils]: 14: Hoare triple {7228#true} assume !!(~q~0 % 4294967296 <= ~n~0 % 4294967296);~q~0 := 4 * ~q~0; {7228#true} is VALID [2022-04-27 12:21:59,063 INFO L290 TraceCheckUtils]: 15: Hoare triple {7228#true} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {7228#true} is VALID [2022-04-27 12:21:59,063 INFO L290 TraceCheckUtils]: 16: Hoare triple {7228#true} assume !!(#t~post5 < 20);havoc #t~post5; {7228#true} is VALID [2022-04-27 12:21:59,063 INFO L290 TraceCheckUtils]: 17: Hoare triple {7228#true} assume !!(~q~0 % 4294967296 <= ~n~0 % 4294967296);~q~0 := 4 * ~q~0; {7228#true} is VALID [2022-04-27 12:21:59,063 INFO L290 TraceCheckUtils]: 18: Hoare triple {7228#true} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {7228#true} is VALID [2022-04-27 12:21:59,063 INFO L290 TraceCheckUtils]: 19: Hoare triple {7228#true} assume !!(#t~post5 < 20);havoc #t~post5; {7228#true} is VALID [2022-04-27 12:21:59,064 INFO L290 TraceCheckUtils]: 20: Hoare triple {7228#true} assume !!(~q~0 % 4294967296 <= ~n~0 % 4294967296);~q~0 := 4 * ~q~0; {7228#true} is VALID [2022-04-27 12:21:59,064 INFO L290 TraceCheckUtils]: 21: Hoare triple {7228#true} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {7228#true} is VALID [2022-04-27 12:21:59,064 INFO L290 TraceCheckUtils]: 22: Hoare triple {7228#true} assume !!(#t~post5 < 20);havoc #t~post5; {7228#true} is VALID [2022-04-27 12:21:59,064 INFO L290 TraceCheckUtils]: 23: Hoare triple {7228#true} assume !!(~q~0 % 4294967296 <= ~n~0 % 4294967296);~q~0 := 4 * ~q~0; {7228#true} is VALID [2022-04-27 12:21:59,064 INFO L290 TraceCheckUtils]: 24: Hoare triple {7228#true} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {7228#true} is VALID [2022-04-27 12:21:59,064 INFO L290 TraceCheckUtils]: 25: Hoare triple {7228#true} assume !!(#t~post5 < 20);havoc #t~post5; {7228#true} is VALID [2022-04-27 12:21:59,064 INFO L290 TraceCheckUtils]: 26: Hoare triple {7228#true} assume !!(~q~0 % 4294967296 <= ~n~0 % 4294967296);~q~0 := 4 * ~q~0; {7228#true} is VALID [2022-04-27 12:21:59,064 INFO L290 TraceCheckUtils]: 27: Hoare triple {7228#true} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {7228#true} is VALID [2022-04-27 12:21:59,064 INFO L290 TraceCheckUtils]: 28: Hoare triple {7228#true} assume !!(#t~post5 < 20);havoc #t~post5; {7228#true} is VALID [2022-04-27 12:21:59,064 INFO L290 TraceCheckUtils]: 29: Hoare triple {7228#true} assume !!(~q~0 % 4294967296 <= ~n~0 % 4294967296);~q~0 := 4 * ~q~0; {7228#true} is VALID [2022-04-27 12:21:59,064 INFO L290 TraceCheckUtils]: 30: Hoare triple {7228#true} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {7228#true} is VALID [2022-04-27 12:21:59,064 INFO L290 TraceCheckUtils]: 31: Hoare triple {7228#true} assume !!(#t~post5 < 20);havoc #t~post5; {7228#true} is VALID [2022-04-27 12:21:59,064 INFO L290 TraceCheckUtils]: 32: Hoare triple {7228#true} assume !!(~q~0 % 4294967296 <= ~n~0 % 4294967296);~q~0 := 4 * ~q~0; {7228#true} is VALID [2022-04-27 12:21:59,064 INFO L290 TraceCheckUtils]: 33: Hoare triple {7228#true} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {7228#true} is VALID [2022-04-27 12:21:59,064 INFO L290 TraceCheckUtils]: 34: Hoare triple {7228#true} assume !!(#t~post5 < 20);havoc #t~post5; {7228#true} is VALID [2022-04-27 12:21:59,064 INFO L290 TraceCheckUtils]: 35: Hoare triple {7228#true} assume !!(~q~0 % 4294967296 <= ~n~0 % 4294967296);~q~0 := 4 * ~q~0; {7228#true} is VALID [2022-04-27 12:21:59,065 INFO L290 TraceCheckUtils]: 36: Hoare triple {7228#true} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {7228#true} is VALID [2022-04-27 12:21:59,065 INFO L290 TraceCheckUtils]: 37: Hoare triple {7228#true} assume !!(#t~post5 < 20);havoc #t~post5; {7228#true} is VALID [2022-04-27 12:21:59,065 INFO L290 TraceCheckUtils]: 38: Hoare triple {7228#true} assume !!(~q~0 % 4294967296 <= ~n~0 % 4294967296);~q~0 := 4 * ~q~0; {7228#true} is VALID [2022-04-27 12:21:59,065 INFO L290 TraceCheckUtils]: 39: Hoare triple {7228#true} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {7228#true} is VALID [2022-04-27 12:21:59,065 INFO L290 TraceCheckUtils]: 40: Hoare triple {7228#true} assume !!(#t~post5 < 20);havoc #t~post5; {7228#true} is VALID [2022-04-27 12:21:59,065 INFO L290 TraceCheckUtils]: 41: Hoare triple {7228#true} assume !!(~q~0 % 4294967296 <= ~n~0 % 4294967296);~q~0 := 4 * ~q~0; {7228#true} is VALID [2022-04-27 12:21:59,065 INFO L290 TraceCheckUtils]: 42: Hoare triple {7228#true} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {7379#(<= (+ |main_#t~post5| 1) ~counter~0)} is VALID [2022-04-27 12:21:59,066 INFO L290 TraceCheckUtils]: 43: Hoare triple {7379#(<= (+ |main_#t~post5| 1) ~counter~0)} assume !(#t~post5 < 20);havoc #t~post5; {7383#(<= 21 ~counter~0)} is VALID [2022-04-27 12:21:59,067 INFO L290 TraceCheckUtils]: 44: Hoare triple {7383#(<= 21 ~counter~0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {7387#(<= 21 |main_#t~post6|)} is VALID [2022-04-27 12:21:59,067 INFO L290 TraceCheckUtils]: 45: Hoare triple {7387#(<= 21 |main_#t~post6|)} assume !!(#t~post6 < 20);havoc #t~post6; {7229#false} is VALID [2022-04-27 12:21:59,067 INFO L272 TraceCheckUtils]: 46: Hoare triple {7229#false} call __VERIFIER_assert((if ~r~0 % 4294967296 < (2 * ~p~0 + ~q~0) % 4294967296 then 1 else 0)); {7229#false} is VALID [2022-04-27 12:21:59,067 INFO L290 TraceCheckUtils]: 47: Hoare triple {7229#false} ~cond := #in~cond; {7229#false} is VALID [2022-04-27 12:21:59,067 INFO L290 TraceCheckUtils]: 48: Hoare triple {7229#false} assume 0 == ~cond; {7229#false} is VALID [2022-04-27 12:21:59,067 INFO L290 TraceCheckUtils]: 49: Hoare triple {7229#false} assume !false; {7229#false} is VALID [2022-04-27 12:21:59,067 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-27 12:21:59,068 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-27 12:21:59,068 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2092451060] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 12:21:59,068 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-04-27 12:21:59,068 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [15] total 18 [2022-04-27 12:21:59,068 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1364236447] [2022-04-27 12:21:59,068 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 12:21:59,068 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-27 12:21:59,069 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 12:21:59,069 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-27 12:21:59,084 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-27 12:21:59,084 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-27 12:21:59,084 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 12:21:59,085 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-27 12:21:59,085 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=218, Unknown=0, NotChecked=0, Total=306 [2022-04-27 12:21:59,085 INFO L87 Difference]: Start difference. First operand 243 states and 317 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-27 12:22:02,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:22:02,357 INFO L93 Difference]: Finished difference Result 280 states and 366 transitions. [2022-04-27 12:22:02,357 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-27 12:22:02,357 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-27 12:22:02,357 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 12:22:02,357 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-27 12:22:02,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 77 transitions. [2022-04-27 12:22:02,358 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-27 12:22:02,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 77 transitions. [2022-04-27 12:22:02,359 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 77 transitions. [2022-04-27 12:22:02,438 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-27 12:22:02,467 INFO L225 Difference]: With dead ends: 280 [2022-04-27 12:22:02,467 INFO L226 Difference]: Without dead ends: 240 [2022-04-27 12:22:02,467 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=92, Invalid=250, Unknown=0, NotChecked=0, Total=342 [2022-04-27 12:22:02,471 INFO L413 NwaCegarLoop]: 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-27 12:22:02,472 INFO L414 NwaCegarLoop]: 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-27 12:22:02,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 240 states. [2022-04-27 12:22:02,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 240 to 235. [2022-04-27 12:22:02,596 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 12:22:02,597 INFO L82 GeneralOperation]: Start isEquivalent. First operand 240 states. Second operand has 235 states, 134 states have (on average 1.1791044776119404) internal successors, (158), 141 states have internal predecessors, (158), 77 states have call successors, (77), 24 states have call predecessors, (77), 23 states have return successors, (71), 69 states have call predecessors, (71), 71 states have call successors, (71) [2022-04-27 12:22:02,597 INFO L74 IsIncluded]: Start isIncluded. First operand 240 states. Second operand has 235 states, 134 states have (on average 1.1791044776119404) internal successors, (158), 141 states have internal predecessors, (158), 77 states have call successors, (77), 24 states have call predecessors, (77), 23 states have return successors, (71), 69 states have call predecessors, (71), 71 states have call successors, (71) [2022-04-27 12:22:02,597 INFO L87 Difference]: Start difference. First operand 240 states. Second operand has 235 states, 134 states have (on average 1.1791044776119404) internal successors, (158), 141 states have internal predecessors, (158), 77 states have call successors, (77), 24 states have call predecessors, (77), 23 states have return successors, (71), 69 states have call predecessors, (71), 71 states have call successors, (71) [2022-04-27 12:22:02,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:22:02,602 INFO L93 Difference]: Finished difference Result 240 states and 312 transitions. [2022-04-27 12:22:02,602 INFO L276 IsEmpty]: Start isEmpty. Operand 240 states and 312 transitions. [2022-04-27 12:22:02,603 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 12:22:02,603 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 12:22:02,603 INFO L74 IsIncluded]: Start isIncluded. First operand has 235 states, 134 states have (on average 1.1791044776119404) internal successors, (158), 141 states have internal predecessors, (158), 77 states have call successors, (77), 24 states have call predecessors, (77), 23 states have return successors, (71), 69 states have call predecessors, (71), 71 states have call successors, (71) Second operand 240 states. [2022-04-27 12:22:02,604 INFO L87 Difference]: Start difference. First operand has 235 states, 134 states have (on average 1.1791044776119404) internal successors, (158), 141 states have internal predecessors, (158), 77 states have call successors, (77), 24 states have call predecessors, (77), 23 states have return successors, (71), 69 states have call predecessors, (71), 71 states have call successors, (71) Second operand 240 states. [2022-04-27 12:22:02,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:22:02,609 INFO L93 Difference]: Finished difference Result 240 states and 312 transitions. [2022-04-27 12:22:02,609 INFO L276 IsEmpty]: Start isEmpty. Operand 240 states and 312 transitions. [2022-04-27 12:22:02,609 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 12:22:02,609 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 12:22:02,609 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 12:22:02,609 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 12:22:02,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 235 states, 134 states have (on average 1.1791044776119404) internal successors, (158), 141 states have internal predecessors, (158), 77 states have call successors, (77), 24 states have call predecessors, (77), 23 states have return successors, (71), 69 states have call predecessors, (71), 71 states have call successors, (71) [2022-04-27 12:22:02,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 235 states to 235 states and 306 transitions. [2022-04-27 12:22:02,615 INFO L78 Accepts]: Start accepts. Automaton has 235 states and 306 transitions. Word has length 50 [2022-04-27 12:22:02,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 12:22:02,615 INFO L495 AbstractCegarLoop]: Abstraction has 235 states and 306 transitions. [2022-04-27 12:22:02,615 INFO L496 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-27 12:22:02,615 INFO L276 IsEmpty]: Start isEmpty. Operand 235 states and 306 transitions. [2022-04-27 12:22:02,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-04-27 12:22:02,616 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 12:22:02,617 INFO L195 NwaCegarLoop]: 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-27 12:22:02,637 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-27 12:22:02,823 WARN L477 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-27 12:22:02,823 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 12:22:02,824 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 12:22:02,824 INFO L85 PathProgramCache]: Analyzing trace with hash 109392637, now seen corresponding path program 1 times [2022-04-27 12:22:02,824 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 12:22:02,824 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2130802474] [2022-04-27 12:22:02,824 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 12:22:02,824 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 12:22:02,836 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 12:22:02,836 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [217926172] [2022-04-27 12:22:02,837 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 12:22:02,837 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 12:22:02,837 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 12:22:02,838 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-27 12:22:02,840 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process