/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_unwindbound10.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-fb4f59a-m [2022-04-27 12:17:21,995 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-27 12:17:21,997 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-27 12:17:22,019 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-27 12:17:22,019 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-27 12:17:22,020 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-27 12:17:22,021 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-27 12:17:22,023 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-27 12:17:22,024 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-27 12:17:22,025 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-27 12:17:22,025 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-27 12:17:22,026 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-27 12:17:22,027 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-27 12:17:22,027 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-27 12:17:22,028 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-27 12:17:22,029 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-27 12:17:22,029 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-27 12:17:22,030 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-27 12:17:22,031 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-27 12:17:22,033 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-27 12:17:22,034 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-27 12:17:22,034 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-27 12:17:22,035 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-27 12:17:22,036 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-27 12:17:22,036 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-27 12:17:22,039 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-27 12:17:22,039 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-27 12:17:22,039 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-27 12:17:22,040 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-27 12:17:22,040 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-27 12:17:22,041 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-27 12:17:22,041 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-27 12:17:22,041 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-27 12:17:22,042 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-27 12:17:22,043 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-27 12:17:22,043 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-27 12:17:22,043 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-27 12:17:22,044 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-27 12:17:22,044 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-27 12:17:22,044 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-27 12:17:22,045 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-27 12:17:22,046 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-27 12:17:22,046 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:22,073 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-27 12:17:22,073 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-27 12:17:22,074 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-04-27 12:17:22,074 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-04-27 12:17:22,074 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-04-27 12:17:22,075 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-04-27 12:17:22,075 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-04-27 12:17:22,075 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-04-27 12:17:22,075 INFO L138 SettingsManager]: * Use SBE=true [2022-04-27 12:17:22,076 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-27 12:17:22,076 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-27 12:17:22,076 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-27 12:17:22,076 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-27 12:17:22,076 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-27 12:17:22,076 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-27 12:17:22,077 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-27 12:17:22,077 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-27 12:17:22,077 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-27 12:17:22,077 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-27 12:17:22,077 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-27 12:17:22,077 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-27 12:17:22,077 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-27 12:17:22,078 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-27 12:17:22,078 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-27 12:17:22,078 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 12:17:22,078 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-27 12:17:22,078 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-04-27 12:17:22,078 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-04-27 12:17:22,079 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-04-27 12:17:22,079 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-04-27 12:17:22,079 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-04-27 12:17:22,079 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-04-27 12:17:22,079 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-27 12:17:22,079 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:22,268 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-27 12:17:22,298 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-27 12:17:22,300 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-27 12:17:22,300 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-27 12:17:22,304 INFO L275 PluginConnector]: CDTParser initialized [2022-04-27 12:17:22,305 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/nla-digbench-scaling/dijkstra-u_unwindbound10.c [2022-04-27 12:17:22,387 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ee9a82a85/faf72fe2da544f73aa2813f3f1df7a91/FLAGe7899d025 [2022-04-27 12:17:22,704 INFO L306 CDTParser]: Found 1 translation units. [2022-04-27 12:17:22,704 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/dijkstra-u_unwindbound10.c [2022-04-27 12:17:22,710 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ee9a82a85/faf72fe2da544f73aa2813f3f1df7a91/FLAGe7899d025 [2022-04-27 12:17:23,149 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ee9a82a85/faf72fe2da544f73aa2813f3f1df7a91 [2022-04-27 12:17:23,151 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-27 12:17:23,152 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-27 12:17:23,153 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-27 12:17:23,153 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-27 12:17:23,161 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-27 12:17:23,162 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 12:17:23" (1/1) ... [2022-04-27 12:17:23,162 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@15a7173b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 12:17:23, skipping insertion in model container [2022-04-27 12:17:23,163 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 12:17:23" (1/1) ... [2022-04-27 12:17:23,168 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-27 12:17:23,178 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-27 12:17:23,304 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_unwindbound10.c[525,538] [2022-04-27 12:17:23,332 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 12:17:23,339 INFO L203 MainTranslator]: Completed pre-run [2022-04-27 12:17:23,350 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_unwindbound10.c[525,538] [2022-04-27 12:17:23,362 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 12:17:23,380 INFO L208 MainTranslator]: Completed translation [2022-04-27 12:17:23,380 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 12:17:23 WrapperNode [2022-04-27 12:17:23,380 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-27 12:17:23,381 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-27 12:17:23,381 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-27 12:17:23,381 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-27 12:17:23,391 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:23" (1/1) ... [2022-04-27 12:17:23,391 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:23" (1/1) ... [2022-04-27 12:17:23,395 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:23" (1/1) ... [2022-04-27 12:17:23,396 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:23" (1/1) ... [2022-04-27 12:17:23,400 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:23" (1/1) ... [2022-04-27 12:17:23,403 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:23" (1/1) ... [2022-04-27 12:17:23,415 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:23" (1/1) ... [2022-04-27 12:17:23,416 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-27 12:17:23,417 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-27 12:17:23,417 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-27 12:17:23,417 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-27 12:17:23,418 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 12:17:23" (1/1) ... [2022-04-27 12:17:23,432 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 12:17:23,438 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 12:17:23,452 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:23,471 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:23,482 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-27 12:17:23,482 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-27 12:17:23,482 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-27 12:17:23,482 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-27 12:17:23,482 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-27 12:17:23,482 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-27 12:17:23,482 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-27 12:17:23,482 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-27 12:17:23,482 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-27 12:17:23,482 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-27 12:17:23,482 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uint [2022-04-27 12:17:23,483 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-27 12:17:23,483 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-27 12:17:23,483 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-27 12:17:23,483 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-27 12:17:23,483 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-27 12:17:23,483 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-27 12:17:23,483 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-27 12:17:23,483 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-27 12:17:23,483 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-27 12:17:23,524 INFO L234 CfgBuilder]: Building ICFG [2022-04-27 12:17:23,525 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-27 12:17:23,721 INFO L275 CfgBuilder]: Performing block encoding [2022-04-27 12:17:23,727 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-27 12:17:23,727 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-04-27 12:17:23,729 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 12:17:23 BoogieIcfgContainer [2022-04-27 12:17:23,729 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-27 12:17:23,736 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-27 12:17:23,736 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-27 12:17:23,739 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-27 12:17:23,739 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.04 12:17:23" (1/3) ... [2022-04-27 12:17:23,740 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1d2f365b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 12:17:23, skipping insertion in model container [2022-04-27 12:17:23,740 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 12:17:23" (2/3) ... [2022-04-27 12:17:23,740 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1d2f365b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 12:17:23, skipping insertion in model container [2022-04-27 12:17:23,740 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 12:17:23" (3/3) ... [2022-04-27 12:17:23,741 INFO L111 eAbstractionObserver]: Analyzing ICFG dijkstra-u_unwindbound10.c [2022-04-27 12:17:23,752 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-04-27 12:17:23,752 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-27 12:17:23,796 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-27 12:17:23,804 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@3284f6b8, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@4c8b51b1 [2022-04-27 12:17:23,805 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-27 12:17:23,811 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:23,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-04-27 12:17:23,816 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 12:17:23,817 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:23,817 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 12:17:23,821 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 12:17:23,821 INFO L85 PathProgramCache]: Analyzing trace with hash -2024343623, now seen corresponding path program 1 times [2022-04-27 12:17:23,828 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 12:17:23,829 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1086042649] [2022-04-27 12:17:23,829 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 12:17:23,830 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 12:17:23,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:17:23,975 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 12:17:23,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:17:23,992 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:23,992 INFO L290 TraceCheckUtils]: 1: Hoare triple {42#true} assume true; {42#true} is VALID [2022-04-27 12:17:23,992 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {42#true} {42#true} #102#return; {42#true} is VALID [2022-04-27 12:17:23,993 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-27 12:17:23,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:17:24,000 INFO L290 TraceCheckUtils]: 0: Hoare triple {42#true} ~cond := #in~cond; {42#true} is VALID [2022-04-27 12:17:24,001 INFO L290 TraceCheckUtils]: 1: Hoare triple {42#true} assume 0 == ~cond;assume false; {43#false} is VALID [2022-04-27 12:17:24,001 INFO L290 TraceCheckUtils]: 2: Hoare triple {43#false} assume true; {43#false} is VALID [2022-04-27 12:17:24,001 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {43#false} {42#true} #82#return; {43#false} is VALID [2022-04-27 12:17:24,002 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:24,002 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:24,003 INFO L290 TraceCheckUtils]: 2: Hoare triple {42#true} assume true; {42#true} is VALID [2022-04-27 12:17:24,003 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {42#true} {42#true} #102#return; {42#true} is VALID [2022-04-27 12:17:24,003 INFO L272 TraceCheckUtils]: 4: Hoare triple {42#true} call #t~ret7 := main(); {42#true} is VALID [2022-04-27 12:17:24,003 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:24,003 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:24,004 INFO L290 TraceCheckUtils]: 7: Hoare triple {42#true} ~cond := #in~cond; {42#true} is VALID [2022-04-27 12:17:24,004 INFO L290 TraceCheckUtils]: 8: Hoare triple {42#true} assume 0 == ~cond;assume false; {43#false} is VALID [2022-04-27 12:17:24,004 INFO L290 TraceCheckUtils]: 9: Hoare triple {43#false} assume true; {43#false} is VALID [2022-04-27 12:17:24,004 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {43#false} {42#true} #82#return; {43#false} is VALID [2022-04-27 12:17:24,005 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:24,005 INFO L290 TraceCheckUtils]: 12: Hoare triple {43#false} assume !true; {43#false} is VALID [2022-04-27 12:17:24,005 INFO L290 TraceCheckUtils]: 13: Hoare triple {43#false} assume !true; {43#false} is VALID [2022-04-27 12:17:24,005 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:24,005 INFO L290 TraceCheckUtils]: 15: Hoare triple {43#false} ~cond := #in~cond; {43#false} is VALID [2022-04-27 12:17:24,006 INFO L290 TraceCheckUtils]: 16: Hoare triple {43#false} assume 0 == ~cond; {43#false} is VALID [2022-04-27 12:17:24,006 INFO L290 TraceCheckUtils]: 17: Hoare triple {43#false} assume !false; {43#false} is VALID [2022-04-27 12:17:24,006 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:24,007 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 12:17:24,007 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1086042649] [2022-04-27 12:17:24,008 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1086042649] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 12:17:24,008 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 12:17:24,008 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-27 12:17:24,009 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [699197496] [2022-04-27 12:17:24,010 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 12:17:24,016 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:24,017 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 12:17:24,020 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:24,066 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:24,066 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-27 12:17:24,066 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 12:17:24,091 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-27 12:17:24,092 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-27 12:17:24,095 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:29,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:17:29,318 INFO L93 Difference]: Finished difference Result 70 states and 111 transitions. [2022-04-27 12:17:29,318 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-27 12:17:29,319 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:29,319 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 12:17:29,320 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:29,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 111 transitions. [2022-04-27 12:17:29,327 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:29,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 111 transitions. [2022-04-27 12:17:29,333 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 111 transitions. [2022-04-27 12:17:29,449 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:29,458 INFO L225 Difference]: With dead ends: 70 [2022-04-27 12:17:29,458 INFO L226 Difference]: Without dead ends: 35 [2022-04-27 12:17:29,461 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:29,464 INFO L413 NwaCegarLoop]: 49 mSDtfsCounter, 10 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s 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, 0.2s IncrementalHoareTripleChecker+Time [2022-04-27 12:17:29,464 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 53 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-27 12:17:29,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2022-04-27 12:17:29,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 34. [2022-04-27 12:17:29,485 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 12:17:29,485 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:29,486 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:29,486 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:29,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:17:29,490 INFO L93 Difference]: Finished difference Result 35 states and 47 transitions. [2022-04-27 12:17:29,490 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 47 transitions. [2022-04-27 12:17:29,491 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 12:17:29,491 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 12:17:29,491 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:29,492 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:29,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:17:29,495 INFO L93 Difference]: Finished difference Result 35 states and 47 transitions. [2022-04-27 12:17:29,495 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 47 transitions. [2022-04-27 12:17:29,495 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 12:17:29,495 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 12:17:29,495 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 12:17:29,496 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 12:17:29,496 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:29,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 46 transitions. [2022-04-27 12:17:29,499 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 46 transitions. Word has length 18 [2022-04-27 12:17:29,499 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 12:17:29,500 INFO L495 AbstractCegarLoop]: Abstraction has 34 states and 46 transitions. [2022-04-27 12:17:29,500 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:29,500 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 46 transitions. [2022-04-27 12:17:29,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-04-27 12:17:29,500 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 12:17:29,501 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:29,501 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-27 12:17:29,501 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 12:17:29,501 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 12:17:29,502 INFO L85 PathProgramCache]: Analyzing trace with hash -96361696, now seen corresponding path program 1 times [2022-04-27 12:17:29,502 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 12:17:29,502 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [967911540] [2022-04-27 12:17:29,502 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 12:17:29,502 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 12:17:29,522 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 12:17:29,522 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [282967541] [2022-04-27 12:17:29,523 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 12:17:29,523 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 12:17:29,523 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 12:17:29,525 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:29,526 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:29,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:17:29,580 INFO L263 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 5 conjunts are in the unsatisfiable core [2022-04-27 12:17:29,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:17:29,597 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 12:17:29,739 INFO L272 TraceCheckUtils]: 0: Hoare triple {274#true} call ULTIMATE.init(); {274#true} is VALID [2022-04-27 12:17:29,741 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:29,741 INFO L290 TraceCheckUtils]: 2: Hoare triple {282#(<= ~counter~0 0)} assume true; {282#(<= ~counter~0 0)} is VALID [2022-04-27 12:17:29,742 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:29,742 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:29,743 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:29,760 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:29,760 INFO L290 TraceCheckUtils]: 7: Hoare triple {282#(<= ~counter~0 0)} ~cond := #in~cond; {282#(<= ~counter~0 0)} is VALID [2022-04-27 12:17:29,761 INFO L290 TraceCheckUtils]: 8: Hoare triple {282#(<= ~counter~0 0)} assume !(0 == ~cond); {282#(<= ~counter~0 0)} is VALID [2022-04-27 12:17:29,761 INFO L290 TraceCheckUtils]: 9: Hoare triple {282#(<= ~counter~0 0)} assume true; {282#(<= ~counter~0 0)} is VALID [2022-04-27 12:17:29,762 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:29,762 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:29,763 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:29,764 INFO L290 TraceCheckUtils]: 13: Hoare triple {316#(<= |main_#t~post5| 0)} assume !(#t~post5 < 10);havoc #t~post5; {275#false} is VALID [2022-04-27 12:17:29,764 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:29,764 INFO L290 TraceCheckUtils]: 15: Hoare triple {275#false} assume !(#t~post6 < 10);havoc #t~post6; {275#false} is VALID [2022-04-27 12:17:29,765 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:29,765 INFO L290 TraceCheckUtils]: 17: Hoare triple {275#false} ~cond := #in~cond; {275#false} is VALID [2022-04-27 12:17:29,765 INFO L290 TraceCheckUtils]: 18: Hoare triple {275#false} assume 0 == ~cond; {275#false} is VALID [2022-04-27 12:17:29,765 INFO L290 TraceCheckUtils]: 19: Hoare triple {275#false} assume !false; {275#false} is VALID [2022-04-27 12:17:29,765 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 12:17:29,766 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-27 12:17:29,766 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 12:17:29,766 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [967911540] [2022-04-27 12:17:29,766 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 12:17:29,767 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [282967541] [2022-04-27 12:17:29,767 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [282967541] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 12:17:29,767 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 12:17:29,767 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-27 12:17:29,768 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1881622852] [2022-04-27 12:17:29,768 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 12:17:29,769 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:29,769 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 12:17:29,769 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:29,785 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:29,786 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-27 12:17:29,786 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 12:17:29,786 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-27 12:17:29,787 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-27 12:17:29,787 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:33,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:17:33,428 INFO L93 Difference]: Finished difference Result 55 states and 78 transitions. [2022-04-27 12:17:33,428 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-27 12:17:33,428 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:33,428 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 12:17:33,429 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:33,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 78 transitions. [2022-04-27 12:17:33,431 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:33,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 78 transitions. [2022-04-27 12:17:33,434 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 78 transitions. [2022-04-27 12:17:33,509 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:33,513 INFO L225 Difference]: With dead ends: 55 [2022-04-27 12:17:33,513 INFO L226 Difference]: Without dead ends: 36 [2022-04-27 12:17:33,514 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:33,515 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:33,516 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:33,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2022-04-27 12:17:33,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2022-04-27 12:17:33,529 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 12:17:33,530 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:33,530 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:33,531 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:33,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:17:33,537 INFO L93 Difference]: Finished difference Result 36 states and 48 transitions. [2022-04-27 12:17:33,537 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 48 transitions. [2022-04-27 12:17:33,538 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 12:17:33,538 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 12:17:33,538 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:33,539 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:33,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:17:33,541 INFO L93 Difference]: Finished difference Result 36 states and 48 transitions. [2022-04-27 12:17:33,541 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 48 transitions. [2022-04-27 12:17:33,542 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 12:17:33,542 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 12:17:33,542 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 12:17:33,542 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 12:17:33,543 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:33,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 48 transitions. [2022-04-27 12:17:33,545 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 48 transitions. Word has length 20 [2022-04-27 12:17:33,545 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 12:17:33,545 INFO L495 AbstractCegarLoop]: Abstraction has 36 states and 48 transitions. [2022-04-27 12:17:33,546 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:33,546 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 48 transitions. [2022-04-27 12:17:33,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-04-27 12:17:33,546 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 12:17:33,546 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:33,569 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-04-27 12:17:33,755 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:33,756 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 12:17:33,756 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 12:17:33,756 INFO L85 PathProgramCache]: Analyzing trace with hash 962099791, now seen corresponding path program 1 times [2022-04-27 12:17:33,757 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 12:17:33,757 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2014219548] [2022-04-27 12:17:33,757 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 12:17:33,757 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 12:17:33,770 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 12:17:33,771 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2090448660] [2022-04-27 12:17:33,771 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 12:17:33,771 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 12:17:33,771 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 12:17:33,773 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:33,774 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:33,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:17:33,815 INFO L263 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-27 12:17:33,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:17:33,825 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 12:17:33,967 INFO L272 TraceCheckUtils]: 0: Hoare triple {546#true} call ULTIMATE.init(); {546#true} is VALID [2022-04-27 12:17:33,968 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:33,968 INFO L290 TraceCheckUtils]: 2: Hoare triple {554#(<= ~counter~0 0)} assume true; {554#(<= ~counter~0 0)} is VALID [2022-04-27 12:17:33,969 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:33,972 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:33,973 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:33,973 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:33,973 INFO L290 TraceCheckUtils]: 7: Hoare triple {554#(<= ~counter~0 0)} ~cond := #in~cond; {554#(<= ~counter~0 0)} is VALID [2022-04-27 12:17:33,974 INFO L290 TraceCheckUtils]: 8: Hoare triple {554#(<= ~counter~0 0)} assume !(0 == ~cond); {554#(<= ~counter~0 0)} is VALID [2022-04-27 12:17:33,974 INFO L290 TraceCheckUtils]: 9: Hoare triple {554#(<= ~counter~0 0)} assume true; {554#(<= ~counter~0 0)} is VALID [2022-04-27 12:17:33,975 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:33,977 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:33,979 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:33,979 INFO L290 TraceCheckUtils]: 13: Hoare triple {588#(<= ~counter~0 1)} assume !!(#t~post5 < 10);havoc #t~post5; {588#(<= ~counter~0 1)} is VALID [2022-04-27 12:17:33,980 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:33,980 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:33,981 INFO L290 TraceCheckUtils]: 16: Hoare triple {598#(<= |main_#t~post6| 1)} assume !(#t~post6 < 10);havoc #t~post6; {547#false} is VALID [2022-04-27 12:17:33,981 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:33,981 INFO L290 TraceCheckUtils]: 18: Hoare triple {547#false} ~cond := #in~cond; {547#false} is VALID [2022-04-27 12:17:33,981 INFO L290 TraceCheckUtils]: 19: Hoare triple {547#false} assume 0 == ~cond; {547#false} is VALID [2022-04-27 12:17:33,981 INFO L290 TraceCheckUtils]: 20: Hoare triple {547#false} assume !false; {547#false} is VALID [2022-04-27 12:17:33,981 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:33,981 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-27 12:17:33,982 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 12:17:33,982 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2014219548] [2022-04-27 12:17:33,982 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 12:17:33,982 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2090448660] [2022-04-27 12:17:33,982 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2090448660] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 12:17:33,982 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 12:17:33,982 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-27 12:17:33,983 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [544030516] [2022-04-27 12:17:33,983 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 12:17:33,983 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:33,983 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 12:17:33,983 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:33,999 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:34,000 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-27 12:17:34,000 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 12:17:34,000 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-27 12:17:34,000 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-04-27 12:17:34,001 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:41,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:17:41,199 INFO L93 Difference]: Finished difference Result 49 states and 64 transitions. [2022-04-27 12:17:41,199 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-27 12:17:41,199 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:41,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 12:17:41,200 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:41,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 64 transitions. [2022-04-27 12:17:41,202 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:41,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 64 transitions. [2022-04-27 12:17:41,203 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 64 transitions. [2022-04-27 12:17:41,263 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:41,265 INFO L225 Difference]: With dead ends: 49 [2022-04-27 12:17:41,265 INFO L226 Difference]: Without dead ends: 40 [2022-04-27 12:17:41,265 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:41,266 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:41,267 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:41,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2022-04-27 12:17:41,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 39. [2022-04-27 12:17:41,273 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 12:17:41,273 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:41,274 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:41,274 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:41,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:17:41,276 INFO L93 Difference]: Finished difference Result 40 states and 53 transitions. [2022-04-27 12:17:41,276 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 53 transitions. [2022-04-27 12:17:41,277 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 12:17:41,277 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 12:17:41,277 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:41,278 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:41,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:17:41,280 INFO L93 Difference]: Finished difference Result 40 states and 53 transitions. [2022-04-27 12:17:41,280 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 53 transitions. [2022-04-27 12:17:41,280 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 12:17:41,280 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 12:17:41,280 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 12:17:41,281 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 12:17:41,281 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:41,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 52 transitions. [2022-04-27 12:17:41,282 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 52 transitions. Word has length 21 [2022-04-27 12:17:41,283 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 12:17:41,283 INFO L495 AbstractCegarLoop]: Abstraction has 39 states and 52 transitions. [2022-04-27 12:17:41,283 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:41,283 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 52 transitions. [2022-04-27 12:17:41,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-04-27 12:17:41,284 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 12:17:41,284 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:41,306 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-04-27 12:17:41,499 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:41,500 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 12:17:41,500 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 12:17:41,500 INFO L85 PathProgramCache]: Analyzing trace with hash 963589341, now seen corresponding path program 1 times [2022-04-27 12:17:41,500 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 12:17:41,501 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [143535982] [2022-04-27 12:17:41,501 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 12:17:41,501 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 12:17:41,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:17:41,700 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 12:17:41,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:17:41,729 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:41,730 INFO L290 TraceCheckUtils]: 1: Hoare triple {822#true} assume true; {822#true} is VALID [2022-04-27 12:17:41,730 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {822#true} {822#true} #102#return; {822#true} is VALID [2022-04-27 12:17:41,730 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-27 12:17:41,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:17:41,735 INFO L290 TraceCheckUtils]: 0: Hoare triple {822#true} ~cond := #in~cond; {822#true} is VALID [2022-04-27 12:17:41,736 INFO L290 TraceCheckUtils]: 1: Hoare triple {822#true} assume !(0 == ~cond); {822#true} is VALID [2022-04-27 12:17:41,736 INFO L290 TraceCheckUtils]: 2: Hoare triple {822#true} assume true; {822#true} is VALID [2022-04-27 12:17:41,736 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {822#true} {822#true} #82#return; {822#true} is VALID [2022-04-27 12:17:41,737 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:41,737 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:41,737 INFO L290 TraceCheckUtils]: 2: Hoare triple {822#true} assume true; {822#true} is VALID [2022-04-27 12:17:41,737 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {822#true} {822#true} #102#return; {822#true} is VALID [2022-04-27 12:17:41,737 INFO L272 TraceCheckUtils]: 4: Hoare triple {822#true} call #t~ret7 := main(); {822#true} is VALID [2022-04-27 12:17:41,737 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:41,737 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:41,738 INFO L290 TraceCheckUtils]: 7: Hoare triple {822#true} ~cond := #in~cond; {822#true} is VALID [2022-04-27 12:17:41,738 INFO L290 TraceCheckUtils]: 8: Hoare triple {822#true} assume !(0 == ~cond); {822#true} is VALID [2022-04-27 12:17:41,738 INFO L290 TraceCheckUtils]: 9: Hoare triple {822#true} assume true; {822#true} is VALID [2022-04-27 12:17:41,738 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {822#true} {822#true} #82#return; {822#true} is VALID [2022-04-27 12:17:41,739 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:41,739 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:41,740 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 < 10);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:41,741 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:41,741 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:41,742 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 < 10);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:41,743 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:41,744 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:41,744 INFO L290 TraceCheckUtils]: 19: Hoare triple {834#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {823#false} is VALID [2022-04-27 12:17:41,745 INFO L290 TraceCheckUtils]: 20: Hoare triple {823#false} assume !false; {823#false} is VALID [2022-04-27 12:17:41,745 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:41,745 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 12:17:41,745 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [143535982] [2022-04-27 12:17:41,745 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [143535982] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 12:17:41,745 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 12:17:41,746 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-27 12:17:41,746 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1823475237] [2022-04-27 12:17:41,746 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 12:17:41,746 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:41,746 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 12:17:41,747 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:41,767 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:41,767 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-27 12:17:41,767 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 12:17:41,768 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-27 12:17:41,768 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-04-27 12:17:41,768 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:53,933 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:17:55,938 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:17:57,995 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-27 12:18:01,392 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:03,553 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:06,508 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:07,566 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.05s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-27 12:18:12,903 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:14,905 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:16,906 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:18,908 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:20,990 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,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:18:21,068 INFO L93 Difference]: Finished difference Result 72 states and 104 transitions. [2022-04-27 12:18:21,068 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-27 12:18:21,068 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,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 12:18:21,068 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,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 104 transitions. [2022-04-27 12:18:21,071 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,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 104 transitions. [2022-04-27 12:18:21,073 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 104 transitions. [2022-04-27 12:18:21,186 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,188 INFO L225 Difference]: With dead ends: 72 [2022-04-27 12:18:21,188 INFO L226 Difference]: Without dead ends: 51 [2022-04-27 12:18:21,188 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,189 INFO L413 NwaCegarLoop]: 49 mSDtfsCounter, 24 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 198 mSolverCounterSat, 37 mSolverCounterUnsat, 11 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 30.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 107 SdHoareTripleChecker+Invalid, 246 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 198 IncrementalHoareTripleChecker+Invalid, 11 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 30.3s IncrementalHoareTripleChecker+Time [2022-04-27 12:18:21,189 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 107 Invalid, 246 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 198 Invalid, 11 Unknown, 0 Unchecked, 30.3s Time] [2022-04-27 12:18:21,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2022-04-27 12:18:21,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2022-04-27 12:18:21,215 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 12:18:21,216 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,216 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,216 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,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:18:21,219 INFO L93 Difference]: Finished difference Result 51 states and 69 transitions. [2022-04-27 12:18:21,219 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 69 transitions. [2022-04-27 12:18:21,220 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 12:18:21,220 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 12:18:21,220 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,220 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,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:18:21,223 INFO L93 Difference]: Finished difference Result 51 states and 69 transitions. [2022-04-27 12:18:21,223 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 69 transitions. [2022-04-27 12:18:21,224 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 12:18:21,224 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 12:18:21,224 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 12:18:21,224 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 12:18:21,224 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,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 69 transitions. [2022-04-27 12:18:21,227 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 69 transitions. Word has length 21 [2022-04-27 12:18:21,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 12:18:21,227 INFO L495 AbstractCegarLoop]: Abstraction has 51 states and 69 transitions. [2022-04-27 12:18:21,227 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,227 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 69 transitions. [2022-04-27 12:18:21,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-04-27 12:18:21,228 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 12:18:21,228 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,228 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-04-27 12:18:21,228 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 12:18:21,228 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 12:18:21,228 INFO L85 PathProgramCache]: Analyzing trace with hash -1701877900, now seen corresponding path program 1 times [2022-04-27 12:18:21,229 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 12:18:21,229 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [723719252] [2022-04-27 12:18:21,229 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 12:18:21,229 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 12:18:21,256 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 12:18:21,256 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [715382598] [2022-04-27 12:18:21,256 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 12:18:21,256 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 12:18:21,256 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 12:18:21,262 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,263 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,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:18:21,295 INFO L263 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-27 12:18:21,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:18:21,302 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 12:18:21,423 INFO L272 TraceCheckUtils]: 0: Hoare triple {1137#true} call ULTIMATE.init(); {1137#true} is VALID [2022-04-27 12:18:21,424 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,424 INFO L290 TraceCheckUtils]: 2: Hoare triple {1145#(<= ~counter~0 0)} assume true; {1145#(<= ~counter~0 0)} is VALID [2022-04-27 12:18:21,424 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,425 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,425 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,426 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,426 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,426 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,427 INFO L290 TraceCheckUtils]: 9: Hoare triple {1145#(<= ~counter~0 0)} assume true; {1145#(<= ~counter~0 0)} is VALID [2022-04-27 12:18:21,427 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,428 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,428 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,429 INFO L290 TraceCheckUtils]: 13: Hoare triple {1179#(<= ~counter~0 1)} assume !!(#t~post5 < 10);havoc #t~post5; {1179#(<= ~counter~0 1)} is VALID [2022-04-27 12:18:21,429 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,429 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,430 INFO L290 TraceCheckUtils]: 16: Hoare triple {1189#(<= |main_#t~post5| 1)} assume !(#t~post5 < 10);havoc #t~post5; {1138#false} is VALID [2022-04-27 12:18:21,430 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,430 INFO L290 TraceCheckUtils]: 18: Hoare triple {1138#false} assume !(#t~post6 < 10);havoc #t~post6; {1138#false} is VALID [2022-04-27 12:18:21,430 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,430 INFO L290 TraceCheckUtils]: 20: Hoare triple {1138#false} ~cond := #in~cond; {1138#false} is VALID [2022-04-27 12:18:21,430 INFO L290 TraceCheckUtils]: 21: Hoare triple {1138#false} assume 0 == ~cond; {1138#false} is VALID [2022-04-27 12:18:21,430 INFO L290 TraceCheckUtils]: 22: Hoare triple {1138#false} assume !false; {1138#false} is VALID [2022-04-27 12:18:21,431 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,431 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 12:18:21,565 INFO L290 TraceCheckUtils]: 22: Hoare triple {1138#false} assume !false; {1138#false} is VALID [2022-04-27 12:18:21,566 INFO L290 TraceCheckUtils]: 21: Hoare triple {1138#false} assume 0 == ~cond; {1138#false} is VALID [2022-04-27 12:18:21,566 INFO L290 TraceCheckUtils]: 20: Hoare triple {1138#false} ~cond := #in~cond; {1138#false} is VALID [2022-04-27 12:18:21,566 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,566 INFO L290 TraceCheckUtils]: 18: Hoare triple {1138#false} assume !(#t~post6 < 10);havoc #t~post6; {1138#false} is VALID [2022-04-27 12:18:21,566 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,567 INFO L290 TraceCheckUtils]: 16: Hoare triple {1229#(< |main_#t~post5| 10)} assume !(#t~post5 < 10);havoc #t~post5; {1138#false} is VALID [2022-04-27 12:18:21,567 INFO L290 TraceCheckUtils]: 15: Hoare triple {1233#(< ~counter~0 10)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {1229#(< |main_#t~post5| 10)} is VALID [2022-04-27 12:18:21,568 INFO L290 TraceCheckUtils]: 14: Hoare triple {1233#(< ~counter~0 10)} assume !!(~q~0 % 4294967296 <= ~n~0 % 4294967296);~q~0 := 4 * ~q~0; {1233#(< ~counter~0 10)} is VALID [2022-04-27 12:18:21,575 INFO L290 TraceCheckUtils]: 13: Hoare triple {1233#(< ~counter~0 10)} assume !!(#t~post5 < 10);havoc #t~post5; {1233#(< ~counter~0 10)} is VALID [2022-04-27 12:18:21,576 INFO L290 TraceCheckUtils]: 12: Hoare triple {1243#(< ~counter~0 9)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {1233#(< ~counter~0 10)} is VALID [2022-04-27 12:18:21,576 INFO L290 TraceCheckUtils]: 11: Hoare triple {1243#(< ~counter~0 9)} ~p~0 := 0;~q~0 := 1;~r~0 := ~n~0;~h~0 := 0; {1243#(< ~counter~0 9)} is VALID [2022-04-27 12:18:21,576 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1137#true} {1243#(< ~counter~0 9)} #82#return; {1243#(< ~counter~0 9)} is VALID [2022-04-27 12:18:21,577 INFO L290 TraceCheckUtils]: 9: Hoare triple {1137#true} assume true; {1137#true} is VALID [2022-04-27 12:18:21,577 INFO L290 TraceCheckUtils]: 8: Hoare triple {1137#true} assume !(0 == ~cond); {1137#true} is VALID [2022-04-27 12:18:21,577 INFO L290 TraceCheckUtils]: 7: Hoare triple {1137#true} ~cond := #in~cond; {1137#true} is VALID [2022-04-27 12:18:21,577 INFO L272 TraceCheckUtils]: 6: Hoare triple {1243#(< ~counter~0 9)} call assume_abort_if_not((if ~n~0 % 4294967296 < 1073741823 then 1 else 0)); {1137#true} is VALID [2022-04-27 12:18:21,578 INFO L290 TraceCheckUtils]: 5: Hoare triple {1243#(< ~counter~0 9)} 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 9)} is VALID [2022-04-27 12:18:21,578 INFO L272 TraceCheckUtils]: 4: Hoare triple {1243#(< ~counter~0 9)} call #t~ret7 := main(); {1243#(< ~counter~0 9)} is VALID [2022-04-27 12:18:21,578 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1243#(< ~counter~0 9)} {1137#true} #102#return; {1243#(< ~counter~0 9)} is VALID [2022-04-27 12:18:21,579 INFO L290 TraceCheckUtils]: 2: Hoare triple {1243#(< ~counter~0 9)} assume true; {1243#(< ~counter~0 9)} is VALID [2022-04-27 12:18:21,579 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 9)} is VALID [2022-04-27 12:18:21,579 INFO L272 TraceCheckUtils]: 0: Hoare triple {1137#true} call ULTIMATE.init(); {1137#true} is VALID [2022-04-27 12:18:21,579 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,579 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 12:18:21,580 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [723719252] [2022-04-27 12:18:21,580 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 12:18:21,580 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [715382598] [2022-04-27 12:18:21,580 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [715382598] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 12:18:21,580 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-27 12:18:21,580 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2022-04-27 12:18:21,580 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [323606398] [2022-04-27 12:18:21,580 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-27 12:18:21,581 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,581 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 12:18:21,581 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,605 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,605 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-27 12:18:21,606 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 12:18:21,606 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-27 12:18:21,606 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2022-04-27 12:18:21,606 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:25,256 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-27 12:18:28,138 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:37,086 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:39,093 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,105 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-27 12:18:43,607 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:44,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:18:44,208 INFO L93 Difference]: Finished difference Result 108 states and 149 transitions. [2022-04-27 12:18:44,208 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-04-27 12:18:44,208 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:44,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 12:18:44,208 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:44,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 137 transitions. [2022-04-27 12:18:44,211 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:44,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 137 transitions. [2022-04-27 12:18:44,217 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 10 states and 137 transitions. [2022-04-27 12:18:44,342 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 137 edges. 137 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 12:18:44,344 INFO L225 Difference]: With dead ends: 108 [2022-04-27 12:18:44,344 INFO L226 Difference]: Without dead ends: 89 [2022-04-27 12:18:44,344 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:44,345 INFO L413 NwaCegarLoop]: 58 mSDtfsCounter, 64 mSDsluCounter, 189 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 24 mSolverCounterUnsat, 6 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 14.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 247 SdHoareTripleChecker+Invalid, 99 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 6 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 14.5s IncrementalHoareTripleChecker+Time [2022-04-27 12:18:44,345 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 247 Invalid, 99 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 69 Invalid, 6 Unknown, 0 Unchecked, 14.5s Time] [2022-04-27 12:18:44,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2022-04-27 12:18:44,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 67. [2022-04-27 12:18:44,364 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 12:18:44,365 INFO L82 GeneralOperation]: Start isEquivalent. First operand 89 states. Second operand has 67 states, 41 states have (on average 1.2439024390243902) internal successors, (51), 43 states have internal predecessors, (51), 19 states have call successors, (19), 7 states have call predecessors, (19), 6 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-27 12:18:44,365 INFO L74 IsIncluded]: Start isIncluded. First operand 89 states. Second operand has 67 states, 41 states have (on average 1.2439024390243902) internal successors, (51), 43 states have internal predecessors, (51), 19 states have call successors, (19), 7 states have call predecessors, (19), 6 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-27 12:18:44,365 INFO L87 Difference]: Start difference. First operand 89 states. Second operand has 67 states, 41 states have (on average 1.2439024390243902) internal successors, (51), 43 states have internal predecessors, (51), 19 states have call successors, (19), 7 states have call predecessors, (19), 6 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-27 12:18:44,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:18:44,368 INFO L93 Difference]: Finished difference Result 89 states and 117 transitions. [2022-04-27 12:18:44,368 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 117 transitions. [2022-04-27 12:18:44,369 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 12:18:44,369 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 12:18:44,369 INFO L74 IsIncluded]: Start isIncluded. First operand has 67 states, 41 states have (on average 1.2439024390243902) internal successors, (51), 43 states have internal predecessors, (51), 19 states have call successors, (19), 7 states have call predecessors, (19), 6 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) Second operand 89 states. [2022-04-27 12:18:44,369 INFO L87 Difference]: Start difference. First operand has 67 states, 41 states have (on average 1.2439024390243902) internal successors, (51), 43 states have internal predecessors, (51), 19 states have call successors, (19), 7 states have call predecessors, (19), 6 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) Second operand 89 states. [2022-04-27 12:18:44,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:18:44,372 INFO L93 Difference]: Finished difference Result 89 states and 117 transitions. [2022-04-27 12:18:44,372 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 117 transitions. [2022-04-27 12:18:44,373 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 12:18:44,373 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 12:18:44,373 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 12:18:44,373 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 12:18:44,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 41 states have (on average 1.2439024390243902) internal successors, (51), 43 states have internal predecessors, (51), 19 states have call successors, (19), 7 states have call predecessors, (19), 6 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-27 12:18:44,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 86 transitions. [2022-04-27 12:18:44,376 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 86 transitions. Word has length 23 [2022-04-27 12:18:44,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 12:18:44,376 INFO L495 AbstractCegarLoop]: Abstraction has 67 states and 86 transitions. [2022-04-27 12:18:44,376 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:44,376 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 86 transitions. [2022-04-27 12:18:44,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-04-27 12:18:44,377 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 12:18:44,377 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:44,398 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:44,589 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:44,590 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 12:18:44,590 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 12:18:44,590 INFO L85 PathProgramCache]: Analyzing trace with hash -1564262277, now seen corresponding path program 1 times [2022-04-27 12:18:44,590 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 12:18:44,590 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1446457194] [2022-04-27 12:18:44,591 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 12:18:44,591 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 12:18:44,600 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 12:18:44,600 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [641336314] [2022-04-27 12:18:44,600 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 12:18:44,600 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 12:18:44,601 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 12:18:44,607 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:44,608 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:44,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:18:44,639 INFO L263 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-27 12:18:44,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:18:44,648 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 12:18:44,780 INFO L272 TraceCheckUtils]: 0: Hoare triple {1723#true} call ULTIMATE.init(); {1723#true} is VALID [2022-04-27 12:18:44,780 INFO L290 TraceCheckUtils]: 1: Hoare triple {1723#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {1731#(<= ~counter~0 0)} is VALID [2022-04-27 12:18:44,781 INFO L290 TraceCheckUtils]: 2: Hoare triple {1731#(<= ~counter~0 0)} assume true; {1731#(<= ~counter~0 0)} is VALID [2022-04-27 12:18:44,781 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1731#(<= ~counter~0 0)} {1723#true} #102#return; {1731#(<= ~counter~0 0)} is VALID [2022-04-27 12:18:44,782 INFO L272 TraceCheckUtils]: 4: Hoare triple {1731#(<= ~counter~0 0)} call #t~ret7 := main(); {1731#(<= ~counter~0 0)} is VALID [2022-04-27 12:18:44,782 INFO L290 TraceCheckUtils]: 5: Hoare triple {1731#(<= ~counter~0 0)} havoc ~n~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~h~0;~n~0 := #t~nondet4;havoc #t~nondet4; {1731#(<= ~counter~0 0)} is VALID [2022-04-27 12:18:44,782 INFO L272 TraceCheckUtils]: 6: Hoare triple {1731#(<= ~counter~0 0)} call assume_abort_if_not((if ~n~0 % 4294967296 < 1073741823 then 1 else 0)); {1731#(<= ~counter~0 0)} is VALID [2022-04-27 12:18:44,783 INFO L290 TraceCheckUtils]: 7: Hoare triple {1731#(<= ~counter~0 0)} ~cond := #in~cond; {1731#(<= ~counter~0 0)} is VALID [2022-04-27 12:18:44,783 INFO L290 TraceCheckUtils]: 8: Hoare triple {1731#(<= ~counter~0 0)} assume !(0 == ~cond); {1731#(<= ~counter~0 0)} is VALID [2022-04-27 12:18:44,783 INFO L290 TraceCheckUtils]: 9: Hoare triple {1731#(<= ~counter~0 0)} assume true; {1731#(<= ~counter~0 0)} is VALID [2022-04-27 12:18:44,784 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1731#(<= ~counter~0 0)} {1731#(<= ~counter~0 0)} #82#return; {1731#(<= ~counter~0 0)} is VALID [2022-04-27 12:18:44,784 INFO L290 TraceCheckUtils]: 11: Hoare triple {1731#(<= ~counter~0 0)} ~p~0 := 0;~q~0 := 1;~r~0 := ~n~0;~h~0 := 0; {1731#(<= ~counter~0 0)} is VALID [2022-04-27 12:18:44,787 INFO L290 TraceCheckUtils]: 12: Hoare triple {1731#(<= ~counter~0 0)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {1765#(<= ~counter~0 1)} is VALID [2022-04-27 12:18:44,787 INFO L290 TraceCheckUtils]: 13: Hoare triple {1765#(<= ~counter~0 1)} assume !!(#t~post5 < 10);havoc #t~post5; {1765#(<= ~counter~0 1)} is VALID [2022-04-27 12:18:44,788 INFO L290 TraceCheckUtils]: 14: Hoare triple {1765#(<= ~counter~0 1)} assume !!(~q~0 % 4294967296 <= ~n~0 % 4294967296);~q~0 := 4 * ~q~0; {1765#(<= ~counter~0 1)} is VALID [2022-04-27 12:18:44,788 INFO L290 TraceCheckUtils]: 15: Hoare triple {1765#(<= ~counter~0 1)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {1775#(<= ~counter~0 2)} is VALID [2022-04-27 12:18:44,788 INFO L290 TraceCheckUtils]: 16: Hoare triple {1775#(<= ~counter~0 2)} assume !!(#t~post5 < 10);havoc #t~post5; {1775#(<= ~counter~0 2)} is VALID [2022-04-27 12:18:44,789 INFO L290 TraceCheckUtils]: 17: Hoare triple {1775#(<= ~counter~0 2)} assume !(~q~0 % 4294967296 <= ~n~0 % 4294967296); {1775#(<= ~counter~0 2)} is VALID [2022-04-27 12:18:44,789 INFO L290 TraceCheckUtils]: 18: Hoare triple {1775#(<= ~counter~0 2)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {1785#(<= |main_#t~post6| 2)} is VALID [2022-04-27 12:18:44,789 INFO L290 TraceCheckUtils]: 19: Hoare triple {1785#(<= |main_#t~post6| 2)} assume !(#t~post6 < 10);havoc #t~post6; {1724#false} is VALID [2022-04-27 12:18:44,789 INFO L272 TraceCheckUtils]: 20: Hoare triple {1724#false} call __VERIFIER_assert((if 0 == (~h~0 * ~h~0 * ~h~0 - 12 * ~h~0 * ~n~0 + 16 * ~n~0 * ~p~0 + 12 * ~h~0 * ~r~0 - 16 * ~p~0 * ~r~0 - ~h~0 - 4 * ~p~0) % 4294967296 then 1 else 0)); {1724#false} is VALID [2022-04-27 12:18:44,789 INFO L290 TraceCheckUtils]: 21: Hoare triple {1724#false} ~cond := #in~cond; {1724#false} is VALID [2022-04-27 12:18:44,790 INFO L290 TraceCheckUtils]: 22: Hoare triple {1724#false} assume 0 == ~cond; {1724#false} is VALID [2022-04-27 12:18:44,790 INFO L290 TraceCheckUtils]: 23: Hoare triple {1724#false} assume !false; {1724#false} is VALID [2022-04-27 12:18:44,790 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:44,790 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 12:18:44,933 INFO L290 TraceCheckUtils]: 23: Hoare triple {1724#false} assume !false; {1724#false} is VALID [2022-04-27 12:18:44,934 INFO L290 TraceCheckUtils]: 22: Hoare triple {1724#false} assume 0 == ~cond; {1724#false} is VALID [2022-04-27 12:18:44,934 INFO L290 TraceCheckUtils]: 21: Hoare triple {1724#false} ~cond := #in~cond; {1724#false} is VALID [2022-04-27 12:18:44,934 INFO L272 TraceCheckUtils]: 20: Hoare triple {1724#false} call __VERIFIER_assert((if 0 == (~h~0 * ~h~0 * ~h~0 - 12 * ~h~0 * ~n~0 + 16 * ~n~0 * ~p~0 + 12 * ~h~0 * ~r~0 - 16 * ~p~0 * ~r~0 - ~h~0 - 4 * ~p~0) % 4294967296 then 1 else 0)); {1724#false} is VALID [2022-04-27 12:18:44,934 INFO L290 TraceCheckUtils]: 19: Hoare triple {1813#(< |main_#t~post6| 10)} assume !(#t~post6 < 10);havoc #t~post6; {1724#false} is VALID [2022-04-27 12:18:44,934 INFO L290 TraceCheckUtils]: 18: Hoare triple {1817#(< ~counter~0 10)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {1813#(< |main_#t~post6| 10)} is VALID [2022-04-27 12:18:44,935 INFO L290 TraceCheckUtils]: 17: Hoare triple {1817#(< ~counter~0 10)} assume !(~q~0 % 4294967296 <= ~n~0 % 4294967296); {1817#(< ~counter~0 10)} is VALID [2022-04-27 12:18:44,935 INFO L290 TraceCheckUtils]: 16: Hoare triple {1817#(< ~counter~0 10)} assume !!(#t~post5 < 10);havoc #t~post5; {1817#(< ~counter~0 10)} is VALID [2022-04-27 12:18:44,936 INFO L290 TraceCheckUtils]: 15: Hoare triple {1827#(< ~counter~0 9)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {1817#(< ~counter~0 10)} is VALID [2022-04-27 12:18:44,936 INFO L290 TraceCheckUtils]: 14: Hoare triple {1827#(< ~counter~0 9)} assume !!(~q~0 % 4294967296 <= ~n~0 % 4294967296);~q~0 := 4 * ~q~0; {1827#(< ~counter~0 9)} is VALID [2022-04-27 12:18:44,936 INFO L290 TraceCheckUtils]: 13: Hoare triple {1827#(< ~counter~0 9)} assume !!(#t~post5 < 10);havoc #t~post5; {1827#(< ~counter~0 9)} is VALID [2022-04-27 12:18:44,937 INFO L290 TraceCheckUtils]: 12: Hoare triple {1837#(< ~counter~0 8)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {1827#(< ~counter~0 9)} is VALID [2022-04-27 12:18:44,937 INFO L290 TraceCheckUtils]: 11: Hoare triple {1837#(< ~counter~0 8)} ~p~0 := 0;~q~0 := 1;~r~0 := ~n~0;~h~0 := 0; {1837#(< ~counter~0 8)} is VALID [2022-04-27 12:18:44,937 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1723#true} {1837#(< ~counter~0 8)} #82#return; {1837#(< ~counter~0 8)} is VALID [2022-04-27 12:18:44,938 INFO L290 TraceCheckUtils]: 9: Hoare triple {1723#true} assume true; {1723#true} is VALID [2022-04-27 12:18:44,938 INFO L290 TraceCheckUtils]: 8: Hoare triple {1723#true} assume !(0 == ~cond); {1723#true} is VALID [2022-04-27 12:18:44,938 INFO L290 TraceCheckUtils]: 7: Hoare triple {1723#true} ~cond := #in~cond; {1723#true} is VALID [2022-04-27 12:18:44,938 INFO L272 TraceCheckUtils]: 6: Hoare triple {1837#(< ~counter~0 8)} call assume_abort_if_not((if ~n~0 % 4294967296 < 1073741823 then 1 else 0)); {1723#true} is VALID [2022-04-27 12:18:44,939 INFO L290 TraceCheckUtils]: 5: Hoare triple {1837#(< ~counter~0 8)} havoc ~n~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~h~0;~n~0 := #t~nondet4;havoc #t~nondet4; {1837#(< ~counter~0 8)} is VALID [2022-04-27 12:18:44,939 INFO L272 TraceCheckUtils]: 4: Hoare triple {1837#(< ~counter~0 8)} call #t~ret7 := main(); {1837#(< ~counter~0 8)} is VALID [2022-04-27 12:18:44,942 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1837#(< ~counter~0 8)} {1723#true} #102#return; {1837#(< ~counter~0 8)} is VALID [2022-04-27 12:18:44,943 INFO L290 TraceCheckUtils]: 2: Hoare triple {1837#(< ~counter~0 8)} assume true; {1837#(< ~counter~0 8)} is VALID [2022-04-27 12:18:44,943 INFO L290 TraceCheckUtils]: 1: Hoare triple {1723#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {1837#(< ~counter~0 8)} is VALID [2022-04-27 12:18:44,943 INFO L272 TraceCheckUtils]: 0: Hoare triple {1723#true} call ULTIMATE.init(); {1723#true} is VALID [2022-04-27 12:18:44,943 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:44,944 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 12:18:44,944 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1446457194] [2022-04-27 12:18:44,944 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 12:18:44,944 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [641336314] [2022-04-27 12:18:44,944 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [641336314] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 12:18:44,944 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-27 12:18:44,944 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2022-04-27 12:18:44,944 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1583429021] [2022-04-27 12:18:44,944 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-27 12:18:44,945 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:44,945 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 12:18:44,945 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:44,970 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:44,970 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-27 12:18:44,970 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 12:18:44,971 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-27 12:18:44,971 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-04-27 12:18:44,971 INFO L87 Difference]: Start difference. First operand 67 states and 86 transitions. Second operand has 10 states, 10 states have (on average 3.3) internal successors, (33), 10 states have internal predecessors, (33), 4 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) [2022-04-27 12:18:48,513 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:58,008 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:06,372 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.95s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-27 12:19:09,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:19:09,874 INFO L93 Difference]: Finished difference Result 139 states and 185 transitions. [2022-04-27 12:19:09,874 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-04-27 12:19:09,874 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:09,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 12:19:09,875 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:09,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 168 transitions. [2022-04-27 12:19:09,877 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:09,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 168 transitions. [2022-04-27 12:19:09,879 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 13 states and 168 transitions. [2022-04-27 12:19:10,012 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 168 edges. 168 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 12:19:10,016 INFO L225 Difference]: With dead ends: 139 [2022-04-27 12:19:10,016 INFO L226 Difference]: Without dead ends: 130 [2022-04-27 12:19:10,018 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=119, Unknown=0, NotChecked=0, Total=182 [2022-04-27 12:19:10,020 INFO L413 NwaCegarLoop]: 72 mSDtfsCounter, 113 mSDsluCounter, 241 mSDsCounter, 0 mSdLazyCounter, 104 mSolverCounterSat, 38 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 14.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 113 SdHoareTripleChecker+Valid, 313 SdHoareTripleChecker+Invalid, 145 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 104 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 14.5s IncrementalHoareTripleChecker+Time [2022-04-27 12:19:10,021 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [113 Valid, 313 Invalid, 145 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 104 Invalid, 3 Unknown, 0 Unchecked, 14.5s Time] [2022-04-27 12:19:10,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2022-04-27 12:19:10,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 121. [2022-04-27 12:19:10,069 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 12:19:10,069 INFO L82 GeneralOperation]: Start isEquivalent. First operand 130 states. Second operand has 121 states, 69 states have (on average 1.289855072463768) internal successors, (89), 74 states have internal predecessors, (89), 41 states have call successors, (41), 11 states have call predecessors, (41), 10 states have return successors, (36), 35 states have call predecessors, (36), 36 states have call successors, (36) [2022-04-27 12:19:10,070 INFO L74 IsIncluded]: Start isIncluded. First operand 130 states. Second operand has 121 states, 69 states have (on average 1.289855072463768) internal successors, (89), 74 states have internal predecessors, (89), 41 states have call successors, (41), 11 states have call predecessors, (41), 10 states have return successors, (36), 35 states have call predecessors, (36), 36 states have call successors, (36) [2022-04-27 12:19:10,070 INFO L87 Difference]: Start difference. First operand 130 states. Second operand has 121 states, 69 states have (on average 1.289855072463768) internal successors, (89), 74 states have internal predecessors, (89), 41 states have call successors, (41), 11 states have call predecessors, (41), 10 states have return successors, (36), 35 states have call predecessors, (36), 36 states have call successors, (36) [2022-04-27 12:19:10,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:19:10,074 INFO L93 Difference]: Finished difference Result 130 states and 171 transitions. [2022-04-27 12:19:10,074 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 171 transitions. [2022-04-27 12:19:10,074 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 12:19:10,074 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 12:19:10,075 INFO L74 IsIncluded]: Start isIncluded. First operand has 121 states, 69 states have (on average 1.289855072463768) internal successors, (89), 74 states have internal predecessors, (89), 41 states have call successors, (41), 11 states have call predecessors, (41), 10 states have return successors, (36), 35 states have call predecessors, (36), 36 states have call successors, (36) Second operand 130 states. [2022-04-27 12:19:10,075 INFO L87 Difference]: Start difference. First operand has 121 states, 69 states have (on average 1.289855072463768) internal successors, (89), 74 states have internal predecessors, (89), 41 states have call successors, (41), 11 states have call predecessors, (41), 10 states have return successors, (36), 35 states have call predecessors, (36), 36 states have call successors, (36) Second operand 130 states. [2022-04-27 12:19:10,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:19:10,078 INFO L93 Difference]: Finished difference Result 130 states and 171 transitions. [2022-04-27 12:19:10,078 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 171 transitions. [2022-04-27 12:19:10,079 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 12:19:10,079 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 12:19:10,079 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 12:19:10,079 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 12:19:10,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121 states, 69 states have (on average 1.289855072463768) internal successors, (89), 74 states have internal predecessors, (89), 41 states have call successors, (41), 11 states have call predecessors, (41), 10 states have return successors, (36), 35 states have call predecessors, (36), 36 states have call successors, (36) [2022-04-27 12:19:10,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 166 transitions. [2022-04-27 12:19:10,082 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 166 transitions. Word has length 24 [2022-04-27 12:19:10,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 12:19:10,083 INFO L495 AbstractCegarLoop]: Abstraction has 121 states and 166 transitions. [2022-04-27 12:19:10,083 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:10,083 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 166 transitions. [2022-04-27 12:19:10,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-04-27 12:19:10,083 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 12:19:10,083 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:10,102 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:10,299 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:10,299 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 12:19:10,300 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 12:19:10,300 INFO L85 PathProgramCache]: Analyzing trace with hash -1562772727, now seen corresponding path program 1 times [2022-04-27 12:19:10,300 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 12:19:10,300 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1464819307] [2022-04-27 12:19:10,300 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 12:19:10,300 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 12:19:10,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:19:10,475 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 12:19:10,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:19:10,492 INFO L290 TraceCheckUtils]: 0: Hoare triple {2539#(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; {2525#true} is VALID [2022-04-27 12:19:10,493 INFO L290 TraceCheckUtils]: 1: Hoare triple {2525#true} assume true; {2525#true} is VALID [2022-04-27 12:19:10,493 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {2525#true} {2525#true} #102#return; {2525#true} is VALID [2022-04-27 12:19:10,493 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-27 12:19:10,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:19:10,509 INFO L290 TraceCheckUtils]: 0: Hoare triple {2525#true} ~cond := #in~cond; {2525#true} is VALID [2022-04-27 12:19:10,510 INFO L290 TraceCheckUtils]: 1: Hoare triple {2525#true} assume !(0 == ~cond); {2525#true} is VALID [2022-04-27 12:19:10,510 INFO L290 TraceCheckUtils]: 2: Hoare triple {2525#true} assume true; {2525#true} is VALID [2022-04-27 12:19:10,510 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2525#true} {2525#true} #82#return; {2525#true} is VALID [2022-04-27 12:19:10,510 INFO L272 TraceCheckUtils]: 0: Hoare triple {2525#true} call ULTIMATE.init(); {2539#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 12:19:10,510 INFO L290 TraceCheckUtils]: 1: Hoare triple {2539#(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; {2525#true} is VALID [2022-04-27 12:19:10,510 INFO L290 TraceCheckUtils]: 2: Hoare triple {2525#true} assume true; {2525#true} is VALID [2022-04-27 12:19:10,511 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2525#true} {2525#true} #102#return; {2525#true} is VALID [2022-04-27 12:19:10,511 INFO L272 TraceCheckUtils]: 4: Hoare triple {2525#true} call #t~ret7 := main(); {2525#true} is VALID [2022-04-27 12:19:10,511 INFO L290 TraceCheckUtils]: 5: Hoare triple {2525#true} havoc ~n~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~h~0;~n~0 := #t~nondet4;havoc #t~nondet4; {2525#true} is VALID [2022-04-27 12:19:10,511 INFO L272 TraceCheckUtils]: 6: Hoare triple {2525#true} call assume_abort_if_not((if ~n~0 % 4294967296 < 1073741823 then 1 else 0)); {2525#true} is VALID [2022-04-27 12:19:10,511 INFO L290 TraceCheckUtils]: 7: Hoare triple {2525#true} ~cond := #in~cond; {2525#true} is VALID [2022-04-27 12:19:10,511 INFO L290 TraceCheckUtils]: 8: Hoare triple {2525#true} assume !(0 == ~cond); {2525#true} is VALID [2022-04-27 12:19:10,511 INFO L290 TraceCheckUtils]: 9: Hoare triple {2525#true} assume true; {2525#true} is VALID [2022-04-27 12:19:10,511 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2525#true} {2525#true} #82#return; {2525#true} is VALID [2022-04-27 12:19:10,512 INFO L290 TraceCheckUtils]: 11: Hoare triple {2525#true} ~p~0 := 0;~q~0 := 1;~r~0 := ~n~0;~h~0 := 0; {2534#(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:10,512 INFO L290 TraceCheckUtils]: 12: Hoare triple {2534#(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; {2534#(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:10,513 INFO L290 TraceCheckUtils]: 13: Hoare triple {2534#(and (= main_~p~0 0) (= (+ (- 1) main_~q~0) 0) (= (+ main_~n~0 (* (- 1) main_~r~0)) 0))} assume !!(#t~post5 < 10);havoc #t~post5; {2534#(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:10,513 INFO L290 TraceCheckUtils]: 14: Hoare triple {2534#(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; {2535#(and (= main_~p~0 0) (= main_~n~0 main_~r~0))} is VALID [2022-04-27 12:19:10,514 INFO L290 TraceCheckUtils]: 15: Hoare triple {2535#(and (= main_~p~0 0) (= main_~n~0 main_~r~0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {2535#(and (= main_~p~0 0) (= main_~n~0 main_~r~0))} is VALID [2022-04-27 12:19:10,514 INFO L290 TraceCheckUtils]: 16: Hoare triple {2535#(and (= main_~p~0 0) (= main_~n~0 main_~r~0))} assume !!(#t~post5 < 10);havoc #t~post5; {2535#(and (= main_~p~0 0) (= main_~n~0 main_~r~0))} is VALID [2022-04-27 12:19:10,515 INFO L290 TraceCheckUtils]: 17: Hoare triple {2535#(and (= main_~p~0 0) (= main_~n~0 main_~r~0))} assume !(~q~0 % 4294967296 <= ~n~0 % 4294967296); {2536#(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:10,515 INFO L290 TraceCheckUtils]: 18: Hoare triple {2536#(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; {2536#(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:10,516 INFO L290 TraceCheckUtils]: 19: Hoare triple {2536#(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 < 10);havoc #t~post6; {2536#(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:10,517 INFO L272 TraceCheckUtils]: 20: Hoare triple {2536#(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)); {2537#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 12:19:10,517 INFO L290 TraceCheckUtils]: 21: Hoare triple {2537#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {2538#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-27 12:19:10,517 INFO L290 TraceCheckUtils]: 22: Hoare triple {2538#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {2526#false} is VALID [2022-04-27 12:19:10,517 INFO L290 TraceCheckUtils]: 23: Hoare triple {2526#false} assume !false; {2526#false} is VALID [2022-04-27 12:19:10,518 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:10,518 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 12:19:10,518 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1464819307] [2022-04-27 12:19:10,518 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1464819307] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 12:19:10,518 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [750297946] [2022-04-27 12:19:10,518 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 12:19:10,518 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 12:19:10,518 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 12:19:10,519 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:10,525 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:10,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:19:10,566 INFO L263 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 12 conjunts are in the unsatisfiable core [2022-04-27 12:19:10,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:19:10,576 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 12:19:10,833 INFO L272 TraceCheckUtils]: 0: Hoare triple {2525#true} call ULTIMATE.init(); {2525#true} is VALID [2022-04-27 12:19:10,833 INFO L290 TraceCheckUtils]: 1: Hoare triple {2525#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; {2525#true} is VALID [2022-04-27 12:19:10,833 INFO L290 TraceCheckUtils]: 2: Hoare triple {2525#true} assume true; {2525#true} is VALID [2022-04-27 12:19:10,833 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2525#true} {2525#true} #102#return; {2525#true} is VALID [2022-04-27 12:19:10,833 INFO L272 TraceCheckUtils]: 4: Hoare triple {2525#true} call #t~ret7 := main(); {2525#true} is VALID [2022-04-27 12:19:10,833 INFO L290 TraceCheckUtils]: 5: Hoare triple {2525#true} havoc ~n~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~h~0;~n~0 := #t~nondet4;havoc #t~nondet4; {2525#true} is VALID [2022-04-27 12:19:10,833 INFO L272 TraceCheckUtils]: 6: Hoare triple {2525#true} call assume_abort_if_not((if ~n~0 % 4294967296 < 1073741823 then 1 else 0)); {2525#true} is VALID [2022-04-27 12:19:10,834 INFO L290 TraceCheckUtils]: 7: Hoare triple {2525#true} ~cond := #in~cond; {2525#true} is VALID [2022-04-27 12:19:10,834 INFO L290 TraceCheckUtils]: 8: Hoare triple {2525#true} assume !(0 == ~cond); {2525#true} is VALID [2022-04-27 12:19:10,834 INFO L290 TraceCheckUtils]: 9: Hoare triple {2525#true} assume true; {2525#true} is VALID [2022-04-27 12:19:10,834 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2525#true} {2525#true} #82#return; {2525#true} is VALID [2022-04-27 12:19:10,834 INFO L290 TraceCheckUtils]: 11: Hoare triple {2525#true} ~p~0 := 0;~q~0 := 1;~r~0 := ~n~0;~h~0 := 0; {2534#(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:10,835 INFO L290 TraceCheckUtils]: 12: Hoare triple {2534#(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; {2534#(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:10,835 INFO L290 TraceCheckUtils]: 13: Hoare triple {2534#(and (= main_~p~0 0) (= (+ (- 1) main_~q~0) 0) (= (+ main_~n~0 (* (- 1) main_~r~0)) 0))} assume !!(#t~post5 < 10);havoc #t~post5; {2534#(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:10,836 INFO L290 TraceCheckUtils]: 14: Hoare triple {2534#(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; {2585#(and (= main_~p~0 0) (= main_~q~0 4) (= (+ main_~n~0 (* (- 1) main_~r~0)) 0))} is VALID [2022-04-27 12:19:10,836 INFO L290 TraceCheckUtils]: 15: Hoare triple {2585#(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; {2585#(and (= main_~p~0 0) (= main_~q~0 4) (= (+ main_~n~0 (* (- 1) main_~r~0)) 0))} is VALID [2022-04-27 12:19:10,837 INFO L290 TraceCheckUtils]: 16: Hoare triple {2585#(and (= main_~p~0 0) (= main_~q~0 4) (= (+ main_~n~0 (* (- 1) main_~r~0)) 0))} assume !!(#t~post5 < 10);havoc #t~post5; {2585#(and (= main_~p~0 0) (= main_~q~0 4) (= (+ main_~n~0 (* (- 1) main_~r~0)) 0))} is VALID [2022-04-27 12:19:10,837 INFO L290 TraceCheckUtils]: 17: Hoare triple {2585#(and (= main_~p~0 0) (= main_~q~0 4) (= (+ main_~n~0 (* (- 1) main_~r~0)) 0))} assume !(~q~0 % 4294967296 <= ~n~0 % 4294967296); {2595#(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:10,838 INFO L290 TraceCheckUtils]: 18: Hoare triple {2595#(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; {2595#(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:10,838 INFO L290 TraceCheckUtils]: 19: Hoare triple {2595#(and (not (<= (mod main_~q~0 4294967296) (mod main_~r~0 4294967296))) (= main_~p~0 0) (= main_~q~0 4))} assume !!(#t~post6 < 10);havoc #t~post6; {2595#(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:10,839 INFO L272 TraceCheckUtils]: 20: Hoare triple {2595#(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)); {2605#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 12:19:10,839 INFO L290 TraceCheckUtils]: 21: Hoare triple {2605#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {2609#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 12:19:10,840 INFO L290 TraceCheckUtils]: 22: Hoare triple {2609#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2526#false} is VALID [2022-04-27 12:19:10,840 INFO L290 TraceCheckUtils]: 23: Hoare triple {2526#false} assume !false; {2526#false} is VALID [2022-04-27 12:19:10,840 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:10,840 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 12:19:11,056 INFO L290 TraceCheckUtils]: 23: Hoare triple {2526#false} assume !false; {2526#false} is VALID [2022-04-27 12:19:11,057 INFO L290 TraceCheckUtils]: 22: Hoare triple {2609#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2526#false} is VALID [2022-04-27 12:19:11,057 INFO L290 TraceCheckUtils]: 21: Hoare triple {2605#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {2609#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 12:19:11,059 INFO L272 TraceCheckUtils]: 20: Hoare triple {2625#(< (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)); {2605#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 12:19:11,060 INFO L290 TraceCheckUtils]: 19: Hoare triple {2625#(< (mod main_~r~0 4294967296) (mod (+ (* main_~p~0 2) main_~q~0) 4294967296))} assume !!(#t~post6 < 10);havoc #t~post6; {2625#(< (mod main_~r~0 4294967296) (mod (+ (* main_~p~0 2) main_~q~0) 4294967296))} is VALID [2022-04-27 12:19:11,061 INFO L290 TraceCheckUtils]: 18: Hoare triple {2625#(< (mod main_~r~0 4294967296) (mod (+ (* main_~p~0 2) main_~q~0) 4294967296))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {2625#(< (mod main_~r~0 4294967296) (mod (+ (* main_~p~0 2) main_~q~0) 4294967296))} is VALID [2022-04-27 12:19:11,062 INFO L290 TraceCheckUtils]: 17: Hoare triple {2635#(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); {2625#(< (mod main_~r~0 4294967296) (mod (+ (* main_~p~0 2) main_~q~0) 4294967296))} is VALID [2022-04-27 12:19:11,063 INFO L290 TraceCheckUtils]: 16: Hoare triple {2635#(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 < 10);havoc #t~post5; {2635#(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:11,063 INFO L290 TraceCheckUtils]: 15: Hoare triple {2635#(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; {2635#(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:11,070 INFO L290 TraceCheckUtils]: 14: Hoare triple {2645#(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; {2635#(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:11,071 INFO L290 TraceCheckUtils]: 13: Hoare triple {2645#(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 < 10);havoc #t~post5; {2645#(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:11,075 INFO L290 TraceCheckUtils]: 12: Hoare triple {2645#(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; {2645#(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:11,077 INFO L290 TraceCheckUtils]: 11: Hoare triple {2525#true} ~p~0 := 0;~q~0 := 1;~r~0 := ~n~0;~h~0 := 0; {2645#(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:11,077 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2525#true} {2525#true} #82#return; {2525#true} is VALID [2022-04-27 12:19:11,077 INFO L290 TraceCheckUtils]: 9: Hoare triple {2525#true} assume true; {2525#true} is VALID [2022-04-27 12:19:11,077 INFO L290 TraceCheckUtils]: 8: Hoare triple {2525#true} assume !(0 == ~cond); {2525#true} is VALID [2022-04-27 12:19:11,077 INFO L290 TraceCheckUtils]: 7: Hoare triple {2525#true} ~cond := #in~cond; {2525#true} is VALID [2022-04-27 12:19:11,077 INFO L272 TraceCheckUtils]: 6: Hoare triple {2525#true} call assume_abort_if_not((if ~n~0 % 4294967296 < 1073741823 then 1 else 0)); {2525#true} is VALID [2022-04-27 12:19:11,077 INFO L290 TraceCheckUtils]: 5: Hoare triple {2525#true} havoc ~n~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~h~0;~n~0 := #t~nondet4;havoc #t~nondet4; {2525#true} is VALID [2022-04-27 12:19:11,078 INFO L272 TraceCheckUtils]: 4: Hoare triple {2525#true} call #t~ret7 := main(); {2525#true} is VALID [2022-04-27 12:19:11,078 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2525#true} {2525#true} #102#return; {2525#true} is VALID [2022-04-27 12:19:11,078 INFO L290 TraceCheckUtils]: 2: Hoare triple {2525#true} assume true; {2525#true} is VALID [2022-04-27 12:19:11,078 INFO L290 TraceCheckUtils]: 1: Hoare triple {2525#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; {2525#true} is VALID [2022-04-27 12:19:11,078 INFO L272 TraceCheckUtils]: 0: Hoare triple {2525#true} call ULTIMATE.init(); {2525#true} is VALID [2022-04-27 12:19:11,078 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:11,078 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [750297946] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 12:19:11,078 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-27 12:19:11,078 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 15 [2022-04-27 12:19:11,078 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1809315566] [2022-04-27 12:19:11,079 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-27 12:19:11,079 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:11,079 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 12:19:11,079 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:11,126 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:11,126 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-04-27 12:19:11,126 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 12:19:11,127 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-04-27 12:19:11,127 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=166, Unknown=0, NotChecked=0, Total=210 [2022-04-27 12:19:11,127 INFO L87 Difference]: Start difference. First operand 121 states and 166 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:15,865 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:21,118 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:23,120 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:25,122 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:27,226 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-27 12:19:29,248 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:32,970 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.36s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-27 12:19:34,972 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:37,704 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-27 12:19:39,844 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.14s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-27 12:19:41,989 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:44,113 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.12s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-27 12:19:49,353 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:52,811 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:01,244 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.51s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-27 12:20:06,898 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.29s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-27 12:20:15,310 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:23,378 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-27 12:20:30,208 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:45,123 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-27 12:20:48,857 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.72s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-27 12:20:57,739 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:59,873 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.13s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-27 12:21:01,999 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.13s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-27 12:21:04,138 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-27 12:21:06,292 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:06,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:21:06,431 INFO L93 Difference]: Finished difference Result 217 states and 316 transitions. [2022-04-27 12:21:06,447 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-04-27 12:21:06,447 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:21:06,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 12:21:06,448 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:21:06,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 168 transitions. [2022-04-27 12:21:06,450 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:21:06,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 168 transitions. [2022-04-27 12:21:06,453 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 14 states and 168 transitions. [2022-04-27 12:21:11,170 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 168 edges. 166 inductive. 0 not inductive. 2 times theorem prover too weak to decide inductivity. [2022-04-27 12:21:11,175 INFO L225 Difference]: With dead ends: 217 [2022-04-27 12:21:11,175 INFO L226 Difference]: Without dead ends: 200 [2022-04-27 12:21:11,175 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:21:11,176 INFO L413 NwaCegarLoop]: 65 mSDtfsCounter, 65 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 469 mSolverCounterSat, 173 mSolverCounterUnsat, 22 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 64.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 145 SdHoareTripleChecker+Invalid, 664 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 173 IncrementalHoareTripleChecker+Valid, 469 IncrementalHoareTripleChecker+Invalid, 22 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 65.9s IncrementalHoareTripleChecker+Time [2022-04-27 12:21:11,176 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [82 Valid, 145 Invalid, 664 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [173 Valid, 469 Invalid, 22 Unknown, 0 Unchecked, 65.9s Time] [2022-04-27 12:21:11,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200 states. [2022-04-27 12:21:11,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200 to 164. [2022-04-27 12:21:11,249 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 12:21:11,250 INFO L82 GeneralOperation]: Start isEquivalent. First operand 200 states. Second operand has 164 states, 94 states have (on average 1.2553191489361701) internal successors, (118), 100 states have internal predecessors, (118), 55 states have call successors, (55), 15 states have call predecessors, (55), 14 states have return successors, (49), 48 states have call predecessors, (49), 49 states have call successors, (49) [2022-04-27 12:21:11,250 INFO L74 IsIncluded]: Start isIncluded. First operand 200 states. Second operand has 164 states, 94 states have (on average 1.2553191489361701) internal successors, (118), 100 states have internal predecessors, (118), 55 states have call successors, (55), 15 states have call predecessors, (55), 14 states have return successors, (49), 48 states have call predecessors, (49), 49 states have call successors, (49) [2022-04-27 12:21:11,250 INFO L87 Difference]: Start difference. First operand 200 states. Second operand has 164 states, 94 states have (on average 1.2553191489361701) internal successors, (118), 100 states have internal predecessors, (118), 55 states have call successors, (55), 15 states have call predecessors, (55), 14 states have return successors, (49), 48 states have call predecessors, (49), 49 states have call successors, (49) [2022-04-27 12:21:11,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:21:11,257 INFO L93 Difference]: Finished difference Result 200 states and 285 transitions. [2022-04-27 12:21:11,257 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 285 transitions. [2022-04-27 12:21:11,258 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 12:21:11,258 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 12:21:11,259 INFO L74 IsIncluded]: Start isIncluded. First operand has 164 states, 94 states have (on average 1.2553191489361701) internal successors, (118), 100 states have internal predecessors, (118), 55 states have call successors, (55), 15 states have call predecessors, (55), 14 states have return successors, (49), 48 states have call predecessors, (49), 49 states have call successors, (49) Second operand 200 states. [2022-04-27 12:21:11,259 INFO L87 Difference]: Start difference. First operand has 164 states, 94 states have (on average 1.2553191489361701) internal successors, (118), 100 states have internal predecessors, (118), 55 states have call successors, (55), 15 states have call predecessors, (55), 14 states have return successors, (49), 48 states have call predecessors, (49), 49 states have call successors, (49) Second operand 200 states. [2022-04-27 12:21:11,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:21:11,266 INFO L93 Difference]: Finished difference Result 200 states and 285 transitions. [2022-04-27 12:21:11,266 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 285 transitions. [2022-04-27 12:21:11,267 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 12:21:11,267 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 12:21:11,267 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 12:21:11,267 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 12:21:11,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 164 states, 94 states have (on average 1.2553191489361701) internal successors, (118), 100 states have internal predecessors, (118), 55 states have call successors, (55), 15 states have call predecessors, (55), 14 states have return successors, (49), 48 states have call predecessors, (49), 49 states have call successors, (49) [2022-04-27 12:21:11,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 222 transitions. [2022-04-27 12:21:11,271 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 222 transitions. Word has length 24 [2022-04-27 12:21:11,272 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 12:21:11,272 INFO L495 AbstractCegarLoop]: Abstraction has 164 states and 222 transitions. [2022-04-27 12:21:11,272 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:21:11,272 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 222 transitions. [2022-04-27 12:21:11,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-04-27 12:21:11,273 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 12:21:11,273 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:21:11,289 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:21:11,483 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:21:11,483 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 12:21:11,484 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 12:21:11,484 INFO L85 PathProgramCache]: Analyzing trace with hash -45171523, now seen corresponding path program 1 times [2022-04-27 12:21:11,484 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 12:21:11,484 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1974764711] [2022-04-27 12:21:11,484 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 12:21:11,484 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 12:21:11,492 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 12:21:11,492 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1673772296] [2022-04-27 12:21:11,492 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 12:21:11,492 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 12:21:11,492 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 12:21:11,493 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:21:11,494 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:21:11,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:21:11,585 INFO L263 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-27 12:21:11,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:21:11,594 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 12:21:11,747 INFO L272 TraceCheckUtils]: 0: Hoare triple {3674#true} call ULTIMATE.init(); {3674#true} is VALID [2022-04-27 12:21:11,747 INFO L290 TraceCheckUtils]: 1: Hoare triple {3674#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; {3674#true} is VALID [2022-04-27 12:21:11,747 INFO L290 TraceCheckUtils]: 2: Hoare triple {3674#true} assume true; {3674#true} is VALID [2022-04-27 12:21:11,747 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3674#true} {3674#true} #102#return; {3674#true} is VALID [2022-04-27 12:21:11,747 INFO L272 TraceCheckUtils]: 4: Hoare triple {3674#true} call #t~ret7 := main(); {3674#true} is VALID [2022-04-27 12:21:11,747 INFO L290 TraceCheckUtils]: 5: Hoare triple {3674#true} havoc ~n~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~h~0;~n~0 := #t~nondet4;havoc #t~nondet4; {3674#true} is VALID [2022-04-27 12:21:11,747 INFO L272 TraceCheckUtils]: 6: Hoare triple {3674#true} call assume_abort_if_not((if ~n~0 % 4294967296 < 1073741823 then 1 else 0)); {3674#true} is VALID [2022-04-27 12:21:11,747 INFO L290 TraceCheckUtils]: 7: Hoare triple {3674#true} ~cond := #in~cond; {3674#true} is VALID [2022-04-27 12:21:11,748 INFO L290 TraceCheckUtils]: 8: Hoare triple {3674#true} assume !(0 == ~cond); {3674#true} is VALID [2022-04-27 12:21:11,748 INFO L290 TraceCheckUtils]: 9: Hoare triple {3674#true} assume true; {3674#true} is VALID [2022-04-27 12:21:11,748 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {3674#true} {3674#true} #82#return; {3674#true} is VALID [2022-04-27 12:21:11,751 INFO L290 TraceCheckUtils]: 11: Hoare triple {3674#true} ~p~0 := 0;~q~0 := 1;~r~0 := ~n~0;~h~0 := 0; {3712#(and (= main_~p~0 0) (= main_~h~0 0) (= main_~q~0 1))} is VALID [2022-04-27 12:21:11,751 INFO L290 TraceCheckUtils]: 12: Hoare triple {3712#(and (= main_~p~0 0) (= main_~h~0 0) (= main_~q~0 1))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {3712#(and (= main_~p~0 0) (= main_~h~0 0) (= main_~q~0 1))} is VALID [2022-04-27 12:21:11,752 INFO L290 TraceCheckUtils]: 13: Hoare triple {3712#(and (= main_~p~0 0) (= main_~h~0 0) (= main_~q~0 1))} assume !!(#t~post5 < 10);havoc #t~post5; {3712#(and (= main_~p~0 0) (= main_~h~0 0) (= main_~q~0 1))} is VALID [2022-04-27 12:21:11,752 INFO L290 TraceCheckUtils]: 14: Hoare triple {3712#(and (= main_~p~0 0) (= main_~h~0 0) (= main_~q~0 1))} assume !(~q~0 % 4294967296 <= ~n~0 % 4294967296); {3712#(and (= main_~p~0 0) (= main_~h~0 0) (= main_~q~0 1))} is VALID [2022-04-27 12:21:11,753 INFO L290 TraceCheckUtils]: 15: Hoare triple {3712#(and (= main_~p~0 0) (= main_~h~0 0) (= main_~q~0 1))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {3712#(and (= main_~p~0 0) (= main_~h~0 0) (= main_~q~0 1))} is VALID [2022-04-27 12:21:11,753 INFO L290 TraceCheckUtils]: 16: Hoare triple {3712#(and (= main_~p~0 0) (= main_~h~0 0) (= main_~q~0 1))} assume !!(#t~post6 < 10);havoc #t~post6; {3712#(and (= main_~p~0 0) (= main_~h~0 0) (= main_~q~0 1))} is VALID [2022-04-27 12:21:11,753 INFO L272 TraceCheckUtils]: 17: Hoare triple {3712#(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)); {3674#true} is VALID [2022-04-27 12:21:11,754 INFO L290 TraceCheckUtils]: 18: Hoare triple {3674#true} ~cond := #in~cond; {3674#true} is VALID [2022-04-27 12:21:11,754 INFO L290 TraceCheckUtils]: 19: Hoare triple {3674#true} assume !(0 == ~cond); {3674#true} is VALID [2022-04-27 12:21:11,754 INFO L290 TraceCheckUtils]: 20: Hoare triple {3674#true} assume true; {3674#true} is VALID [2022-04-27 12:21:11,754 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {3674#true} {3712#(and (= main_~p~0 0) (= main_~h~0 0) (= main_~q~0 1))} #84#return; {3712#(and (= main_~p~0 0) (= main_~h~0 0) (= main_~q~0 1))} is VALID [2022-04-27 12:21:11,754 INFO L272 TraceCheckUtils]: 22: Hoare triple {3712#(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)); {3674#true} is VALID [2022-04-27 12:21:11,754 INFO L290 TraceCheckUtils]: 23: Hoare triple {3674#true} ~cond := #in~cond; {3674#true} is VALID [2022-04-27 12:21:11,755 INFO L290 TraceCheckUtils]: 24: Hoare triple {3674#true} assume !(0 == ~cond); {3674#true} is VALID [2022-04-27 12:21:11,755 INFO L290 TraceCheckUtils]: 25: Hoare triple {3674#true} assume true; {3674#true} is VALID [2022-04-27 12:21:11,755 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {3674#true} {3712#(and (= main_~p~0 0) (= main_~h~0 0) (= main_~q~0 1))} #86#return; {3712#(and (= main_~p~0 0) (= main_~h~0 0) (= main_~q~0 1))} is VALID [2022-04-27 12:21:11,756 INFO L272 TraceCheckUtils]: 27: Hoare triple {3712#(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)); {3761#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 12:21:11,757 INFO L290 TraceCheckUtils]: 28: Hoare triple {3761#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {3765#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 12:21:11,757 INFO L290 TraceCheckUtils]: 29: Hoare triple {3765#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {3675#false} is VALID [2022-04-27 12:21:11,757 INFO L290 TraceCheckUtils]: 30: Hoare triple {3675#false} assume !false; {3675#false} is VALID [2022-04-27 12:21:11,757 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:21:11,757 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-27 12:21:11,757 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 12:21:11,758 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1974764711] [2022-04-27 12:21:11,758 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 12:21:11,758 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1673772296] [2022-04-27 12:21:11,758 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1673772296] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 12:21:11,758 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 12:21:11,758 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-27 12:21:11,758 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1697614825] [2022-04-27 12:21:11,758 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 12:21:11,758 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:21:11,758 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 12:21:11,759 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:21:11,781 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:21:11,781 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-27 12:21:11,781 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 12:21:11,782 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-27 12:21:11,782 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-27 12:21:11,782 INFO L87 Difference]: Start difference. First operand 164 states and 222 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:21:19,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:21:19,544 INFO L93 Difference]: Finished difference Result 175 states and 231 transitions. [2022-04-27 12:21:19,545 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-27 12:21:19,545 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:21:19,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 12:21:19,545 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:21:19,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 71 transitions. [2022-04-27 12:21:19,546 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:21:19,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 71 transitions. [2022-04-27 12:21:19,547 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 71 transitions. [2022-04-27 12:21:19,617 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:21:19,619 INFO L225 Difference]: With dead ends: 175 [2022-04-27 12:21:19,619 INFO L226 Difference]: Without dead ends: 139 [2022-04-27 12:21:19,620 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:21:19,620 INFO L413 NwaCegarLoop]: 49 mSDtfsCounter, 6 mSDsluCounter, 105 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 154 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2022-04-27 12:21:19,620 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 154 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2022-04-27 12:21:19,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2022-04-27 12:21:19,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 139. [2022-04-27 12:21:19,677 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 12:21:19,678 INFO L82 GeneralOperation]: Start isEquivalent. First operand 139 states. Second operand has 139 states, 79 states have (on average 1.2784810126582278) internal successors, (101), 85 states have internal predecessors, (101), 49 states have call successors, (49), 11 states have call predecessors, (49), 10 states have return successors, (43), 42 states have call predecessors, (43), 43 states have call successors, (43) [2022-04-27 12:21:19,681 INFO L74 IsIncluded]: Start isIncluded. First operand 139 states. Second operand has 139 states, 79 states have (on average 1.2784810126582278) internal successors, (101), 85 states have internal predecessors, (101), 49 states have call successors, (49), 11 states have call predecessors, (49), 10 states have return successors, (43), 42 states have call predecessors, (43), 43 states have call successors, (43) [2022-04-27 12:21:19,684 INFO L87 Difference]: Start difference. First operand 139 states. Second operand has 139 states, 79 states have (on average 1.2784810126582278) internal successors, (101), 85 states have internal predecessors, (101), 49 states have call successors, (49), 11 states have call predecessors, (49), 10 states have return successors, (43), 42 states have call predecessors, (43), 43 states have call successors, (43) [2022-04-27 12:21:19,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:21:19,689 INFO L93 Difference]: Finished difference Result 139 states and 193 transitions. [2022-04-27 12:21:19,689 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 193 transitions. [2022-04-27 12:21:19,689 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 12:21:19,690 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 12:21:19,690 INFO L74 IsIncluded]: Start isIncluded. First operand has 139 states, 79 states have (on average 1.2784810126582278) internal successors, (101), 85 states have internal predecessors, (101), 49 states have call successors, (49), 11 states have call predecessors, (49), 10 states have return successors, (43), 42 states have call predecessors, (43), 43 states have call successors, (43) Second operand 139 states. [2022-04-27 12:21:19,691 INFO L87 Difference]: Start difference. First operand has 139 states, 79 states have (on average 1.2784810126582278) internal successors, (101), 85 states have internal predecessors, (101), 49 states have call successors, (49), 11 states have call predecessors, (49), 10 states have return successors, (43), 42 states have call predecessors, (43), 43 states have call successors, (43) Second operand 139 states. [2022-04-27 12:21:19,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:21:19,694 INFO L93 Difference]: Finished difference Result 139 states and 193 transitions. [2022-04-27 12:21:19,694 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 193 transitions. [2022-04-27 12:21:19,695 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 12:21:19,695 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 12:21:19,695 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 12:21:19,695 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 12:21:19,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 139 states, 79 states have (on average 1.2784810126582278) internal successors, (101), 85 states have internal predecessors, (101), 49 states have call successors, (49), 11 states have call predecessors, (49), 10 states have return successors, (43), 42 states have call predecessors, (43), 43 states have call successors, (43) [2022-04-27 12:21:19,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 193 transitions. [2022-04-27 12:21:19,699 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 193 transitions. Word has length 31 [2022-04-27 12:21:19,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 12:21:19,699 INFO L495 AbstractCegarLoop]: Abstraction has 139 states and 193 transitions. [2022-04-27 12:21:19,699 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:21:19,699 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 193 transitions. [2022-04-27 12:21:19,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-04-27 12:21:19,700 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 12:21:19,700 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:21:19,709 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2022-04-27 12:21:19,906 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:21:19,907 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 12:21:19,907 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 12:21:19,907 INFO L85 PathProgramCache]: Analyzing trace with hash -1547125783, now seen corresponding path program 1 times [2022-04-27 12:21:19,907 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 12:21:19,907 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [286680179] [2022-04-27 12:21:19,907 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 12:21:19,907 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 12:21:19,930 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 12:21:19,930 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [703220673] [2022-04-27 12:21:19,930 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 12:21:19,930 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 12:21:19,930 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 12:21:19,931 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:21:19,932 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:21:19,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:21:19,998 INFO L263 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-27 12:21:20,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:21:20,006 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 12:21:20,178 INFO L272 TraceCheckUtils]: 0: Hoare triple {4510#true} call ULTIMATE.init(); {4510#true} is VALID [2022-04-27 12:21:20,178 INFO L290 TraceCheckUtils]: 1: Hoare triple {4510#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; {4510#true} is VALID [2022-04-27 12:21:20,179 INFO L290 TraceCheckUtils]: 2: Hoare triple {4510#true} assume true; {4510#true} is VALID [2022-04-27 12:21:20,179 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4510#true} {4510#true} #102#return; {4510#true} is VALID [2022-04-27 12:21:20,179 INFO L272 TraceCheckUtils]: 4: Hoare triple {4510#true} call #t~ret7 := main(); {4510#true} is VALID [2022-04-27 12:21:20,180 INFO L290 TraceCheckUtils]: 5: Hoare triple {4510#true} havoc ~n~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~h~0;~n~0 := #t~nondet4;havoc #t~nondet4; {4510#true} is VALID [2022-04-27 12:21:20,180 INFO L272 TraceCheckUtils]: 6: Hoare triple {4510#true} call assume_abort_if_not((if ~n~0 % 4294967296 < 1073741823 then 1 else 0)); {4510#true} is VALID [2022-04-27 12:21:20,180 INFO L290 TraceCheckUtils]: 7: Hoare triple {4510#true} ~cond := #in~cond; {4510#true} is VALID [2022-04-27 12:21:20,181 INFO L290 TraceCheckUtils]: 8: Hoare triple {4510#true} assume !(0 == ~cond); {4510#true} is VALID [2022-04-27 12:21:20,181 INFO L290 TraceCheckUtils]: 9: Hoare triple {4510#true} assume true; {4510#true} is VALID [2022-04-27 12:21:20,181 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {4510#true} {4510#true} #82#return; {4510#true} is VALID [2022-04-27 12:21:20,181 INFO L290 TraceCheckUtils]: 11: Hoare triple {4510#true} ~p~0 := 0;~q~0 := 1;~r~0 := ~n~0;~h~0 := 0; {4548#(and (= main_~p~0 0) (= main_~h~0 0))} is VALID [2022-04-27 12:21:20,182 INFO L290 TraceCheckUtils]: 12: Hoare triple {4548#(and (= main_~p~0 0) (= main_~h~0 0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {4548#(and (= main_~p~0 0) (= main_~h~0 0))} is VALID [2022-04-27 12:21:20,182 INFO L290 TraceCheckUtils]: 13: Hoare triple {4548#(and (= main_~p~0 0) (= main_~h~0 0))} assume !!(#t~post5 < 10);havoc #t~post5; {4548#(and (= main_~p~0 0) (= main_~h~0 0))} is VALID [2022-04-27 12:21:20,182 INFO L290 TraceCheckUtils]: 14: Hoare triple {4548#(and (= main_~p~0 0) (= main_~h~0 0))} assume !!(~q~0 % 4294967296 <= ~n~0 % 4294967296);~q~0 := 4 * ~q~0; {4548#(and (= main_~p~0 0) (= main_~h~0 0))} is VALID [2022-04-27 12:21:20,183 INFO L290 TraceCheckUtils]: 15: Hoare triple {4548#(and (= main_~p~0 0) (= main_~h~0 0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {4548#(and (= main_~p~0 0) (= main_~h~0 0))} is VALID [2022-04-27 12:21:20,183 INFO L290 TraceCheckUtils]: 16: Hoare triple {4548#(and (= main_~p~0 0) (= main_~h~0 0))} assume !!(#t~post5 < 10);havoc #t~post5; {4548#(and (= main_~p~0 0) (= main_~h~0 0))} is VALID [2022-04-27 12:21:20,184 INFO L290 TraceCheckUtils]: 17: Hoare triple {4548#(and (= main_~p~0 0) (= main_~h~0 0))} assume !(~q~0 % 4294967296 <= ~n~0 % 4294967296); {4548#(and (= main_~p~0 0) (= main_~h~0 0))} is VALID [2022-04-27 12:21:20,184 INFO L290 TraceCheckUtils]: 18: Hoare triple {4548#(and (= main_~p~0 0) (= main_~h~0 0))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {4548#(and (= main_~p~0 0) (= main_~h~0 0))} is VALID [2022-04-27 12:21:20,184 INFO L290 TraceCheckUtils]: 19: Hoare triple {4548#(and (= main_~p~0 0) (= main_~h~0 0))} assume !!(#t~post6 < 10);havoc #t~post6; {4548#(and (= main_~p~0 0) (= main_~h~0 0))} is VALID [2022-04-27 12:21:20,185 INFO L272 TraceCheckUtils]: 20: Hoare triple {4548#(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)); {4510#true} is VALID [2022-04-27 12:21:20,185 INFO L290 TraceCheckUtils]: 21: Hoare triple {4510#true} ~cond := #in~cond; {4510#true} is VALID [2022-04-27 12:21:20,185 INFO L290 TraceCheckUtils]: 22: Hoare triple {4510#true} assume !(0 == ~cond); {4510#true} is VALID [2022-04-27 12:21:20,185 INFO L290 TraceCheckUtils]: 23: Hoare triple {4510#true} assume true; {4510#true} is VALID [2022-04-27 12:21:20,185 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {4510#true} {4548#(and (= main_~p~0 0) (= main_~h~0 0))} #84#return; {4548#(and (= main_~p~0 0) (= main_~h~0 0))} is VALID [2022-04-27 12:21:20,185 INFO L272 TraceCheckUtils]: 25: Hoare triple {4548#(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)); {4510#true} is VALID [2022-04-27 12:21:20,185 INFO L290 TraceCheckUtils]: 26: Hoare triple {4510#true} ~cond := #in~cond; {4510#true} is VALID [2022-04-27 12:21:20,186 INFO L290 TraceCheckUtils]: 27: Hoare triple {4510#true} assume !(0 == ~cond); {4510#true} is VALID [2022-04-27 12:21:20,186 INFO L290 TraceCheckUtils]: 28: Hoare triple {4510#true} assume true; {4510#true} is VALID [2022-04-27 12:21:20,186 INFO L284 TraceCheckUtils]: 29: Hoare quadruple {4510#true} {4548#(and (= main_~p~0 0) (= main_~h~0 0))} #86#return; {4548#(and (= main_~p~0 0) (= main_~h~0 0))} is VALID [2022-04-27 12:21:20,187 INFO L272 TraceCheckUtils]: 30: Hoare triple {4548#(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)); {4606#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 12:21:20,187 INFO L290 TraceCheckUtils]: 31: Hoare triple {4606#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {4610#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 12:21:20,188 INFO L290 TraceCheckUtils]: 32: Hoare triple {4610#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {4511#false} is VALID [2022-04-27 12:21:20,188 INFO L290 TraceCheckUtils]: 33: Hoare triple {4511#false} assume !false; {4511#false} is VALID [2022-04-27 12:21:20,188 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:21:20,188 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-27 12:21:20,188 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 12:21:20,188 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [286680179] [2022-04-27 12:21:20,189 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 12:21:20,189 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [703220673] [2022-04-27 12:21:20,189 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [703220673] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 12:21:20,189 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 12:21:20,189 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-27 12:21:20,189 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [282156696] [2022-04-27 12:21:20,189 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 12:21:20,189 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:21:20,189 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 12:21:20,199 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:21:20,224 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:21:20,224 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-27 12:21:20,224 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 12:21:20,224 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-27 12:21:20,224 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-27 12:21:20,225 INFO L87 Difference]: Start difference. First operand 139 states and 193 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:21:25,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:21:25,682 INFO L93 Difference]: Finished difference Result 161 states and 211 transitions. [2022-04-27 12:21:25,682 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-27 12:21:25,682 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:21:25,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 12:21:25,682 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:21:25,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 69 transitions. [2022-04-27 12:21:25,683 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:21:25,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 69 transitions. [2022-04-27 12:21:25,684 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 69 transitions. [2022-04-27 12:21:25,762 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:21:25,764 INFO L225 Difference]: With dead ends: 161 [2022-04-27 12:21:25,764 INFO L226 Difference]: Without dead ends: 156 [2022-04-27 12:21:25,765 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:21:25,765 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:21:25,765 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:21:25,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2022-04-27 12:21:25,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 146. [2022-04-27 12:21:25,822 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 12:21:25,822 INFO L82 GeneralOperation]: Start isEquivalent. First operand 156 states. Second operand has 146 states, 86 states have (on average 1.1511627906976745) internal successors, (99), 90 states have internal predecessors, (99), 44 states have call successors, (44), 16 states have call predecessors, (44), 15 states have return successors, (41), 39 states have call predecessors, (41), 41 states have call successors, (41) [2022-04-27 12:21:25,822 INFO L74 IsIncluded]: Start isIncluded. First operand 156 states. Second operand has 146 states, 86 states have (on average 1.1511627906976745) internal successors, (99), 90 states have internal predecessors, (99), 44 states have call successors, (44), 16 states have call predecessors, (44), 15 states have return successors, (41), 39 states have call predecessors, (41), 41 states have call successors, (41) [2022-04-27 12:21:25,823 INFO L87 Difference]: Start difference. First operand 156 states. Second operand has 146 states, 86 states have (on average 1.1511627906976745) internal successors, (99), 90 states have internal predecessors, (99), 44 states have call successors, (44), 16 states have call predecessors, (44), 15 states have return successors, (41), 39 states have call predecessors, (41), 41 states have call successors, (41) [2022-04-27 12:21:25,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:21:25,826 INFO L93 Difference]: Finished difference Result 156 states and 198 transitions. [2022-04-27 12:21:25,826 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 198 transitions. [2022-04-27 12:21:25,827 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 12:21:25,827 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 12:21:25,827 INFO L74 IsIncluded]: Start isIncluded. First operand has 146 states, 86 states have (on average 1.1511627906976745) internal successors, (99), 90 states have internal predecessors, (99), 44 states have call successors, (44), 16 states have call predecessors, (44), 15 states have return successors, (41), 39 states have call predecessors, (41), 41 states have call successors, (41) Second operand 156 states. [2022-04-27 12:21:25,827 INFO L87 Difference]: Start difference. First operand has 146 states, 86 states have (on average 1.1511627906976745) internal successors, (99), 90 states have internal predecessors, (99), 44 states have call successors, (44), 16 states have call predecessors, (44), 15 states have return successors, (41), 39 states have call predecessors, (41), 41 states have call successors, (41) Second operand 156 states. [2022-04-27 12:21:25,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:21:25,830 INFO L93 Difference]: Finished difference Result 156 states and 198 transitions. [2022-04-27 12:21:25,830 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 198 transitions. [2022-04-27 12:21:25,830 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 12:21:25,830 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 12:21:25,830 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 12:21:25,831 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 12:21:25,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 146 states, 86 states have (on average 1.1511627906976745) internal successors, (99), 90 states have internal predecessors, (99), 44 states have call successors, (44), 16 states have call predecessors, (44), 15 states have return successors, (41), 39 states have call predecessors, (41), 41 states have call successors, (41) [2022-04-27 12:21:25,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 184 transitions. [2022-04-27 12:21:25,833 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 184 transitions. Word has length 34 [2022-04-27 12:21:25,833 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 12:21:25,834 INFO L495 AbstractCegarLoop]: Abstraction has 146 states and 184 transitions. [2022-04-27 12:21:25,834 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:21:25,834 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 184 transitions. [2022-04-27 12:21:25,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-04-27 12:21:25,834 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 12:21:25,834 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:21:25,838 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:21:26,035 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:21:26,036 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 12:21:26,036 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 12:21:26,036 INFO L85 PathProgramCache]: Analyzing trace with hash 821435566, now seen corresponding path program 1 times [2022-04-27 12:21:26,036 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 12:21:26,036 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1091707162] [2022-04-27 12:21:26,036 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 12:21:26,036 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 12:21:26,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:21:26,136 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 12:21:26,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:21:26,146 INFO L290 TraceCheckUtils]: 0: Hoare triple {5388#(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; {5378#(<= ~counter~0 0)} is VALID [2022-04-27 12:21:26,147 INFO L290 TraceCheckUtils]: 1: Hoare triple {5378#(<= ~counter~0 0)} assume true; {5378#(<= ~counter~0 0)} is VALID [2022-04-27 12:21:26,147 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {5378#(<= ~counter~0 0)} {5373#true} #102#return; {5378#(<= ~counter~0 0)} is VALID [2022-04-27 12:21:26,147 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-27 12:21:26,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:21:26,153 INFO L290 TraceCheckUtils]: 0: Hoare triple {5373#true} ~cond := #in~cond; {5373#true} is VALID [2022-04-27 12:21:26,153 INFO L290 TraceCheckUtils]: 1: Hoare triple {5373#true} assume !(0 == ~cond); {5373#true} is VALID [2022-04-27 12:21:26,153 INFO L290 TraceCheckUtils]: 2: Hoare triple {5373#true} assume true; {5373#true} is VALID [2022-04-27 12:21:26,154 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5373#true} {5378#(<= ~counter~0 0)} #82#return; {5378#(<= ~counter~0 0)} is VALID [2022-04-27 12:21:26,154 INFO L272 TraceCheckUtils]: 0: Hoare triple {5373#true} call ULTIMATE.init(); {5388#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 12:21:26,155 INFO L290 TraceCheckUtils]: 1: Hoare triple {5388#(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; {5378#(<= ~counter~0 0)} is VALID [2022-04-27 12:21:26,155 INFO L290 TraceCheckUtils]: 2: Hoare triple {5378#(<= ~counter~0 0)} assume true; {5378#(<= ~counter~0 0)} is VALID [2022-04-27 12:21:26,155 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5378#(<= ~counter~0 0)} {5373#true} #102#return; {5378#(<= ~counter~0 0)} is VALID [2022-04-27 12:21:26,156 INFO L272 TraceCheckUtils]: 4: Hoare triple {5378#(<= ~counter~0 0)} call #t~ret7 := main(); {5378#(<= ~counter~0 0)} is VALID [2022-04-27 12:21:26,156 INFO L290 TraceCheckUtils]: 5: Hoare triple {5378#(<= ~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; {5378#(<= ~counter~0 0)} is VALID [2022-04-27 12:21:26,156 INFO L272 TraceCheckUtils]: 6: Hoare triple {5378#(<= ~counter~0 0)} call assume_abort_if_not((if ~n~0 % 4294967296 < 1073741823 then 1 else 0)); {5373#true} is VALID [2022-04-27 12:21:26,156 INFO L290 TraceCheckUtils]: 7: Hoare triple {5373#true} ~cond := #in~cond; {5373#true} is VALID [2022-04-27 12:21:26,156 INFO L290 TraceCheckUtils]: 8: Hoare triple {5373#true} assume !(0 == ~cond); {5373#true} is VALID [2022-04-27 12:21:26,156 INFO L290 TraceCheckUtils]: 9: Hoare triple {5373#true} assume true; {5373#true} is VALID [2022-04-27 12:21:26,157 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {5373#true} {5378#(<= ~counter~0 0)} #82#return; {5378#(<= ~counter~0 0)} is VALID [2022-04-27 12:21:26,157 INFO L290 TraceCheckUtils]: 11: Hoare triple {5378#(<= ~counter~0 0)} ~p~0 := 0;~q~0 := 1;~r~0 := ~n~0;~h~0 := 0; {5378#(<= ~counter~0 0)} is VALID [2022-04-27 12:21:26,158 INFO L290 TraceCheckUtils]: 12: Hoare triple {5378#(<= ~counter~0 0)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {5383#(<= ~counter~0 1)} is VALID [2022-04-27 12:21:26,158 INFO L290 TraceCheckUtils]: 13: Hoare triple {5383#(<= ~counter~0 1)} assume !!(#t~post5 < 10);havoc #t~post5; {5383#(<= ~counter~0 1)} is VALID [2022-04-27 12:21:26,158 INFO L290 TraceCheckUtils]: 14: Hoare triple {5383#(<= ~counter~0 1)} assume !!(~q~0 % 4294967296 <= ~n~0 % 4294967296);~q~0 := 4 * ~q~0; {5383#(<= ~counter~0 1)} is VALID [2022-04-27 12:21:26,159 INFO L290 TraceCheckUtils]: 15: Hoare triple {5383#(<= ~counter~0 1)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {5384#(<= ~counter~0 2)} is VALID [2022-04-27 12:21:26,160 INFO L290 TraceCheckUtils]: 16: Hoare triple {5384#(<= ~counter~0 2)} assume !!(#t~post5 < 10);havoc #t~post5; {5384#(<= ~counter~0 2)} is VALID [2022-04-27 12:21:26,160 INFO L290 TraceCheckUtils]: 17: Hoare triple {5384#(<= ~counter~0 2)} assume !!(~q~0 % 4294967296 <= ~n~0 % 4294967296);~q~0 := 4 * ~q~0; {5384#(<= ~counter~0 2)} is VALID [2022-04-27 12:21:26,160 INFO L290 TraceCheckUtils]: 18: Hoare triple {5384#(<= ~counter~0 2)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {5385#(<= ~counter~0 3)} is VALID [2022-04-27 12:21:26,161 INFO L290 TraceCheckUtils]: 19: Hoare triple {5385#(<= ~counter~0 3)} assume !!(#t~post5 < 10);havoc #t~post5; {5385#(<= ~counter~0 3)} is VALID [2022-04-27 12:21:26,161 INFO L290 TraceCheckUtils]: 20: Hoare triple {5385#(<= ~counter~0 3)} assume !!(~q~0 % 4294967296 <= ~n~0 % 4294967296);~q~0 := 4 * ~q~0; {5385#(<= ~counter~0 3)} is VALID [2022-04-27 12:21:26,162 INFO L290 TraceCheckUtils]: 21: Hoare triple {5385#(<= ~counter~0 3)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {5386#(<= ~counter~0 4)} is VALID [2022-04-27 12:21:26,162 INFO L290 TraceCheckUtils]: 22: Hoare triple {5386#(<= ~counter~0 4)} assume !!(#t~post5 < 10);havoc #t~post5; {5386#(<= ~counter~0 4)} is VALID [2022-04-27 12:21:26,162 INFO L290 TraceCheckUtils]: 23: Hoare triple {5386#(<= ~counter~0 4)} assume !!(~q~0 % 4294967296 <= ~n~0 % 4294967296);~q~0 := 4 * ~q~0; {5386#(<= ~counter~0 4)} is VALID [2022-04-27 12:21:26,163 INFO L290 TraceCheckUtils]: 24: Hoare triple {5386#(<= ~counter~0 4)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {5387#(<= |main_#t~post5| 4)} is VALID [2022-04-27 12:21:26,163 INFO L290 TraceCheckUtils]: 25: Hoare triple {5387#(<= |main_#t~post5| 4)} assume !(#t~post5 < 10);havoc #t~post5; {5374#false} is VALID [2022-04-27 12:21:26,163 INFO L290 TraceCheckUtils]: 26: Hoare triple {5374#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {5374#false} is VALID [2022-04-27 12:21:26,163 INFO L290 TraceCheckUtils]: 27: Hoare triple {5374#false} assume !!(#t~post6 < 10);havoc #t~post6; {5374#false} is VALID [2022-04-27 12:21:26,163 INFO L272 TraceCheckUtils]: 28: Hoare triple {5374#false} call __VERIFIER_assert((if ~r~0 % 4294967296 < (2 * ~p~0 + ~q~0) % 4294967296 then 1 else 0)); {5374#false} is VALID [2022-04-27 12:21:26,163 INFO L290 TraceCheckUtils]: 29: Hoare triple {5374#false} ~cond := #in~cond; {5374#false} is VALID [2022-04-27 12:21:26,163 INFO L290 TraceCheckUtils]: 30: Hoare triple {5374#false} assume 0 == ~cond; {5374#false} is VALID [2022-04-27 12:21:26,163 INFO L290 TraceCheckUtils]: 31: Hoare triple {5374#false} assume !false; {5374#false} is VALID [2022-04-27 12:21:26,164 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:21:26,164 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 12:21:26,164 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1091707162] [2022-04-27 12:21:26,164 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1091707162] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 12:21:26,164 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [512202302] [2022-04-27 12:21:26,164 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 12:21:26,164 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 12:21:26,164 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 12:21:26,165 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:21:26,166 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:21:26,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:21:26,199 INFO L263 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 13 conjunts are in the unsatisfiable core [2022-04-27 12:21:26,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:21:26,213 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 12:21:26,403 INFO L272 TraceCheckUtils]: 0: Hoare triple {5373#true} call ULTIMATE.init(); {5373#true} is VALID [2022-04-27 12:21:26,403 INFO L290 TraceCheckUtils]: 1: Hoare triple {5373#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; {5378#(<= ~counter~0 0)} is VALID [2022-04-27 12:21:26,404 INFO L290 TraceCheckUtils]: 2: Hoare triple {5378#(<= ~counter~0 0)} assume true; {5378#(<= ~counter~0 0)} is VALID [2022-04-27 12:21:26,406 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5378#(<= ~counter~0 0)} {5373#true} #102#return; {5378#(<= ~counter~0 0)} is VALID [2022-04-27 12:21:26,407 INFO L272 TraceCheckUtils]: 4: Hoare triple {5378#(<= ~counter~0 0)} call #t~ret7 := main(); {5378#(<= ~counter~0 0)} is VALID [2022-04-27 12:21:26,408 INFO L290 TraceCheckUtils]: 5: Hoare triple {5378#(<= ~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; {5378#(<= ~counter~0 0)} is VALID [2022-04-27 12:21:26,409 INFO L272 TraceCheckUtils]: 6: Hoare triple {5378#(<= ~counter~0 0)} call assume_abort_if_not((if ~n~0 % 4294967296 < 1073741823 then 1 else 0)); {5378#(<= ~counter~0 0)} is VALID [2022-04-27 12:21:26,409 INFO L290 TraceCheckUtils]: 7: Hoare triple {5378#(<= ~counter~0 0)} ~cond := #in~cond; {5378#(<= ~counter~0 0)} is VALID [2022-04-27 12:21:26,409 INFO L290 TraceCheckUtils]: 8: Hoare triple {5378#(<= ~counter~0 0)} assume !(0 == ~cond); {5378#(<= ~counter~0 0)} is VALID [2022-04-27 12:21:26,410 INFO L290 TraceCheckUtils]: 9: Hoare triple {5378#(<= ~counter~0 0)} assume true; {5378#(<= ~counter~0 0)} is VALID [2022-04-27 12:21:26,411 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {5378#(<= ~counter~0 0)} {5378#(<= ~counter~0 0)} #82#return; {5378#(<= ~counter~0 0)} is VALID [2022-04-27 12:21:26,411 INFO L290 TraceCheckUtils]: 11: Hoare triple {5378#(<= ~counter~0 0)} ~p~0 := 0;~q~0 := 1;~r~0 := ~n~0;~h~0 := 0; {5378#(<= ~counter~0 0)} is VALID [2022-04-27 12:21:26,412 INFO L290 TraceCheckUtils]: 12: Hoare triple {5378#(<= ~counter~0 0)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {5383#(<= ~counter~0 1)} is VALID [2022-04-27 12:21:26,413 INFO L290 TraceCheckUtils]: 13: Hoare triple {5383#(<= ~counter~0 1)} assume !!(#t~post5 < 10);havoc #t~post5; {5383#(<= ~counter~0 1)} is VALID [2022-04-27 12:21:26,413 INFO L290 TraceCheckUtils]: 14: Hoare triple {5383#(<= ~counter~0 1)} assume !!(~q~0 % 4294967296 <= ~n~0 % 4294967296);~q~0 := 4 * ~q~0; {5383#(<= ~counter~0 1)} is VALID [2022-04-27 12:21:26,413 INFO L290 TraceCheckUtils]: 15: Hoare triple {5383#(<= ~counter~0 1)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {5384#(<= ~counter~0 2)} is VALID [2022-04-27 12:21:26,414 INFO L290 TraceCheckUtils]: 16: Hoare triple {5384#(<= ~counter~0 2)} assume !!(#t~post5 < 10);havoc #t~post5; {5384#(<= ~counter~0 2)} is VALID [2022-04-27 12:21:26,414 INFO L290 TraceCheckUtils]: 17: Hoare triple {5384#(<= ~counter~0 2)} assume !!(~q~0 % 4294967296 <= ~n~0 % 4294967296);~q~0 := 4 * ~q~0; {5384#(<= ~counter~0 2)} is VALID [2022-04-27 12:21:26,414 INFO L290 TraceCheckUtils]: 18: Hoare triple {5384#(<= ~counter~0 2)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {5385#(<= ~counter~0 3)} is VALID [2022-04-27 12:21:26,415 INFO L290 TraceCheckUtils]: 19: Hoare triple {5385#(<= ~counter~0 3)} assume !!(#t~post5 < 10);havoc #t~post5; {5385#(<= ~counter~0 3)} is VALID [2022-04-27 12:21:26,415 INFO L290 TraceCheckUtils]: 20: Hoare triple {5385#(<= ~counter~0 3)} assume !!(~q~0 % 4294967296 <= ~n~0 % 4294967296);~q~0 := 4 * ~q~0; {5385#(<= ~counter~0 3)} is VALID [2022-04-27 12:21:26,416 INFO L290 TraceCheckUtils]: 21: Hoare triple {5385#(<= ~counter~0 3)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {5386#(<= ~counter~0 4)} is VALID [2022-04-27 12:21:26,416 INFO L290 TraceCheckUtils]: 22: Hoare triple {5386#(<= ~counter~0 4)} assume !!(#t~post5 < 10);havoc #t~post5; {5386#(<= ~counter~0 4)} is VALID [2022-04-27 12:21:26,416 INFO L290 TraceCheckUtils]: 23: Hoare triple {5386#(<= ~counter~0 4)} assume !!(~q~0 % 4294967296 <= ~n~0 % 4294967296);~q~0 := 4 * ~q~0; {5386#(<= ~counter~0 4)} is VALID [2022-04-27 12:21:26,417 INFO L290 TraceCheckUtils]: 24: Hoare triple {5386#(<= ~counter~0 4)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {5387#(<= |main_#t~post5| 4)} is VALID [2022-04-27 12:21:26,417 INFO L290 TraceCheckUtils]: 25: Hoare triple {5387#(<= |main_#t~post5| 4)} assume !(#t~post5 < 10);havoc #t~post5; {5374#false} is VALID [2022-04-27 12:21:26,417 INFO L290 TraceCheckUtils]: 26: Hoare triple {5374#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {5374#false} is VALID [2022-04-27 12:21:26,417 INFO L290 TraceCheckUtils]: 27: Hoare triple {5374#false} assume !!(#t~post6 < 10);havoc #t~post6; {5374#false} is VALID [2022-04-27 12:21:26,417 INFO L272 TraceCheckUtils]: 28: Hoare triple {5374#false} call __VERIFIER_assert((if ~r~0 % 4294967296 < (2 * ~p~0 + ~q~0) % 4294967296 then 1 else 0)); {5374#false} is VALID [2022-04-27 12:21:26,417 INFO L290 TraceCheckUtils]: 29: Hoare triple {5374#false} ~cond := #in~cond; {5374#false} is VALID [2022-04-27 12:21:26,417 INFO L290 TraceCheckUtils]: 30: Hoare triple {5374#false} assume 0 == ~cond; {5374#false} is VALID [2022-04-27 12:21:26,417 INFO L290 TraceCheckUtils]: 31: Hoare triple {5374#false} assume !false; {5374#false} is VALID [2022-04-27 12:21:26,418 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:21:26,418 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 12:21:26,661 INFO L290 TraceCheckUtils]: 31: Hoare triple {5374#false} assume !false; {5374#false} is VALID [2022-04-27 12:21:26,661 INFO L290 TraceCheckUtils]: 30: Hoare triple {5374#false} assume 0 == ~cond; {5374#false} is VALID [2022-04-27 12:21:26,662 INFO L290 TraceCheckUtils]: 29: Hoare triple {5374#false} ~cond := #in~cond; {5374#false} is VALID [2022-04-27 12:21:26,662 INFO L272 TraceCheckUtils]: 28: Hoare triple {5374#false} call __VERIFIER_assert((if ~r~0 % 4294967296 < (2 * ~p~0 + ~q~0) % 4294967296 then 1 else 0)); {5374#false} is VALID [2022-04-27 12:21:26,662 INFO L290 TraceCheckUtils]: 27: Hoare triple {5374#false} assume !!(#t~post6 < 10);havoc #t~post6; {5374#false} is VALID [2022-04-27 12:21:26,662 INFO L290 TraceCheckUtils]: 26: Hoare triple {5374#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {5374#false} is VALID [2022-04-27 12:21:26,662 INFO L290 TraceCheckUtils]: 25: Hoare triple {5503#(< |main_#t~post5| 10)} assume !(#t~post5 < 10);havoc #t~post5; {5374#false} is VALID [2022-04-27 12:21:26,662 INFO L290 TraceCheckUtils]: 24: Hoare triple {5507#(< ~counter~0 10)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {5503#(< |main_#t~post5| 10)} is VALID [2022-04-27 12:21:26,663 INFO L290 TraceCheckUtils]: 23: Hoare triple {5507#(< ~counter~0 10)} assume !!(~q~0 % 4294967296 <= ~n~0 % 4294967296);~q~0 := 4 * ~q~0; {5507#(< ~counter~0 10)} is VALID [2022-04-27 12:21:26,663 INFO L290 TraceCheckUtils]: 22: Hoare triple {5507#(< ~counter~0 10)} assume !!(#t~post5 < 10);havoc #t~post5; {5507#(< ~counter~0 10)} is VALID [2022-04-27 12:21:26,664 INFO L290 TraceCheckUtils]: 21: Hoare triple {5517#(< ~counter~0 9)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {5507#(< ~counter~0 10)} is VALID [2022-04-27 12:21:26,664 INFO L290 TraceCheckUtils]: 20: Hoare triple {5517#(< ~counter~0 9)} assume !!(~q~0 % 4294967296 <= ~n~0 % 4294967296);~q~0 := 4 * ~q~0; {5517#(< ~counter~0 9)} is VALID [2022-04-27 12:21:26,664 INFO L290 TraceCheckUtils]: 19: Hoare triple {5517#(< ~counter~0 9)} assume !!(#t~post5 < 10);havoc #t~post5; {5517#(< ~counter~0 9)} is VALID [2022-04-27 12:21:26,665 INFO L290 TraceCheckUtils]: 18: Hoare triple {5527#(< ~counter~0 8)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {5517#(< ~counter~0 9)} is VALID [2022-04-27 12:21:26,665 INFO L290 TraceCheckUtils]: 17: Hoare triple {5527#(< ~counter~0 8)} assume !!(~q~0 % 4294967296 <= ~n~0 % 4294967296);~q~0 := 4 * ~q~0; {5527#(< ~counter~0 8)} is VALID [2022-04-27 12:21:26,665 INFO L290 TraceCheckUtils]: 16: Hoare triple {5527#(< ~counter~0 8)} assume !!(#t~post5 < 10);havoc #t~post5; {5527#(< ~counter~0 8)} is VALID [2022-04-27 12:21:26,666 INFO L290 TraceCheckUtils]: 15: Hoare triple {5537#(< ~counter~0 7)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {5527#(< ~counter~0 8)} is VALID [2022-04-27 12:21:26,666 INFO L290 TraceCheckUtils]: 14: Hoare triple {5537#(< ~counter~0 7)} assume !!(~q~0 % 4294967296 <= ~n~0 % 4294967296);~q~0 := 4 * ~q~0; {5537#(< ~counter~0 7)} is VALID [2022-04-27 12:21:26,666 INFO L290 TraceCheckUtils]: 13: Hoare triple {5537#(< ~counter~0 7)} assume !!(#t~post5 < 10);havoc #t~post5; {5537#(< ~counter~0 7)} is VALID [2022-04-27 12:21:26,667 INFO L290 TraceCheckUtils]: 12: Hoare triple {5547#(< ~counter~0 6)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {5537#(< ~counter~0 7)} is VALID [2022-04-27 12:21:26,667 INFO L290 TraceCheckUtils]: 11: Hoare triple {5547#(< ~counter~0 6)} ~p~0 := 0;~q~0 := 1;~r~0 := ~n~0;~h~0 := 0; {5547#(< ~counter~0 6)} is VALID [2022-04-27 12:21:26,667 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {5373#true} {5547#(< ~counter~0 6)} #82#return; {5547#(< ~counter~0 6)} is VALID [2022-04-27 12:21:26,667 INFO L290 TraceCheckUtils]: 9: Hoare triple {5373#true} assume true; {5373#true} is VALID [2022-04-27 12:21:26,667 INFO L290 TraceCheckUtils]: 8: Hoare triple {5373#true} assume !(0 == ~cond); {5373#true} is VALID [2022-04-27 12:21:26,668 INFO L290 TraceCheckUtils]: 7: Hoare triple {5373#true} ~cond := #in~cond; {5373#true} is VALID [2022-04-27 12:21:26,668 INFO L272 TraceCheckUtils]: 6: Hoare triple {5547#(< ~counter~0 6)} call assume_abort_if_not((if ~n~0 % 4294967296 < 1073741823 then 1 else 0)); {5373#true} is VALID [2022-04-27 12:21:26,668 INFO L290 TraceCheckUtils]: 5: Hoare triple {5547#(< ~counter~0 6)} havoc ~n~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~h~0;~n~0 := #t~nondet4;havoc #t~nondet4; {5547#(< ~counter~0 6)} is VALID [2022-04-27 12:21:26,668 INFO L272 TraceCheckUtils]: 4: Hoare triple {5547#(< ~counter~0 6)} call #t~ret7 := main(); {5547#(< ~counter~0 6)} is VALID [2022-04-27 12:21:26,668 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5547#(< ~counter~0 6)} {5373#true} #102#return; {5547#(< ~counter~0 6)} is VALID [2022-04-27 12:21:26,669 INFO L290 TraceCheckUtils]: 2: Hoare triple {5547#(< ~counter~0 6)} assume true; {5547#(< ~counter~0 6)} is VALID [2022-04-27 12:21:26,669 INFO L290 TraceCheckUtils]: 1: Hoare triple {5373#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; {5547#(< ~counter~0 6)} is VALID [2022-04-27 12:21:26,669 INFO L272 TraceCheckUtils]: 0: Hoare triple {5373#true} call ULTIMATE.init(); {5373#true} is VALID [2022-04-27 12:21:26,669 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:21:26,670 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [512202302] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 12:21:26,670 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-27 12:21:26,670 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 15 [2022-04-27 12:21:26,670 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [610472266] [2022-04-27 12:21:26,670 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-27 12:21:26,670 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:26,671 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 12:21:26,671 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:21:26,707 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:21:26,707 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-04-27 12:21:26,708 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 12:21:26,708 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-04-27 12:21:26,708 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=137, Unknown=0, NotChecked=0, Total=210 [2022-04-27 12:21:26,708 INFO L87 Difference]: Start difference. First operand 146 states and 184 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:21:34,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:21:36,979 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:41,151 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,163 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.42s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-27 12:21:46,519 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:49,663 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:52,081 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:54,797 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:56,802 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-27 12:21:58,805 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:22:00,815 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:22:03,396 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.15s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-27 12:22:05,831 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:22:07,998 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:22:10,001 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:22:13,067 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:22:16,209 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:22:18,407 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-27 12:22:20,546 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:22:22,592 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.29s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-27 12:22:24,689 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.09s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-27 12:22:30,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:22:30,212 INFO L93 Difference]: Finished difference Result 320 states and 398 transitions. [2022-04-27 12:22:30,212 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-04-27 12:22:30,212 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:22:30,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 12:22:30,212 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:22:30,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 233 transitions. [2022-04-27 12:22:30,216 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:22:30,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 233 transitions. [2022-04-27 12:22:30,219 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 31 states and 233 transitions. [2022-04-27 12:22:30,461 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 233 edges. 233 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 12:22:30,466 INFO L225 Difference]: With dead ends: 320 [2022-04-27 12:22:30,466 INFO L226 Difference]: Without dead ends: 280 [2022-04-27 12:22:30,466 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 165 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=276, Invalid=716, Unknown=0, NotChecked=0, Total=992 [2022-04-27 12:22:30,467 INFO L413 NwaCegarLoop]: 50 mSDtfsCounter, 223 mSDsluCounter, 125 mSDsCounter, 0 mSdLazyCounter, 392 mSolverCounterSat, 174 mSolverCounterUnsat, 18 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 55.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 251 SdHoareTripleChecker+Valid, 175 SdHoareTripleChecker+Invalid, 584 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 174 IncrementalHoareTripleChecker+Valid, 392 IncrementalHoareTripleChecker+Invalid, 18 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 55.0s IncrementalHoareTripleChecker+Time [2022-04-27 12:22:30,467 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [251 Valid, 175 Invalid, 584 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [174 Valid, 392 Invalid, 18 Unknown, 0 Unchecked, 55.0s Time] [2022-04-27 12:22:30,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 280 states. [2022-04-27 12:22:30,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 280 to 234. [2022-04-27 12:22:30,566 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 12:22:30,567 INFO L82 GeneralOperation]: Start isEquivalent. First operand 280 states. Second operand has 234 states, 145 states have (on average 1.1586206896551725) internal successors, (168), 152 states have internal predecessors, (168), 63 states have call successors, (63), 26 states have call predecessors, (63), 25 states have return successors, (59), 55 states have call predecessors, (59), 59 states have call successors, (59) [2022-04-27 12:22:30,567 INFO L74 IsIncluded]: Start isIncluded. First operand 280 states. Second operand has 234 states, 145 states have (on average 1.1586206896551725) internal successors, (168), 152 states have internal predecessors, (168), 63 states have call successors, (63), 26 states have call predecessors, (63), 25 states have return successors, (59), 55 states have call predecessors, (59), 59 states have call successors, (59) [2022-04-27 12:22:30,568 INFO L87 Difference]: Start difference. First operand 280 states. Second operand has 234 states, 145 states have (on average 1.1586206896551725) internal successors, (168), 152 states have internal predecessors, (168), 63 states have call successors, (63), 26 states have call predecessors, (63), 25 states have return successors, (59), 55 states have call predecessors, (59), 59 states have call successors, (59) [2022-04-27 12:22:30,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:22:30,573 INFO L93 Difference]: Finished difference Result 280 states and 339 transitions. [2022-04-27 12:22:30,573 INFO L276 IsEmpty]: Start isEmpty. Operand 280 states and 339 transitions. [2022-04-27 12:22:30,573 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 12:22:30,586 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 12:22:30,586 INFO L74 IsIncluded]: Start isIncluded. First operand has 234 states, 145 states have (on average 1.1586206896551725) internal successors, (168), 152 states have internal predecessors, (168), 63 states have call successors, (63), 26 states have call predecessors, (63), 25 states have return successors, (59), 55 states have call predecessors, (59), 59 states have call successors, (59) Second operand 280 states. [2022-04-27 12:22:30,587 INFO L87 Difference]: Start difference. First operand has 234 states, 145 states have (on average 1.1586206896551725) internal successors, (168), 152 states have internal predecessors, (168), 63 states have call successors, (63), 26 states have call predecessors, (63), 25 states have return successors, (59), 55 states have call predecessors, (59), 59 states have call successors, (59) Second operand 280 states. [2022-04-27 12:22:30,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:22:30,592 INFO L93 Difference]: Finished difference Result 280 states and 339 transitions. [2022-04-27 12:22:30,592 INFO L276 IsEmpty]: Start isEmpty. Operand 280 states and 339 transitions. [2022-04-27 12:22:30,593 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 12:22:30,593 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 12:22:30,593 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 12:22:30,593 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 12:22:30,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 234 states, 145 states have (on average 1.1586206896551725) internal successors, (168), 152 states have internal predecessors, (168), 63 states have call successors, (63), 26 states have call predecessors, (63), 25 states have return successors, (59), 55 states have call predecessors, (59), 59 states have call successors, (59) [2022-04-27 12:22:30,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 290 transitions. [2022-04-27 12:22:30,598 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 290 transitions. Word has length 32 [2022-04-27 12:22:30,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 12:22:30,598 INFO L495 AbstractCegarLoop]: Abstraction has 234 states and 290 transitions. [2022-04-27 12:22:30,598 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:22:30,598 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 290 transitions. [2022-04-27 12:22:30,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2022-04-27 12:22:30,600 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 12:22:30,600 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:22:30,625 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:22:30,816 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:22:30,817 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 12:22:30,817 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 12:22:30,818 INFO L85 PathProgramCache]: Analyzing trace with hash -271152338, now seen corresponding path program 2 times [2022-04-27 12:22:30,818 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 12:22:30,818 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [596425923] [2022-04-27 12:22:30,818 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 12:22:30,818 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 12:22:30,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:22:30,875 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 12:22:30,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:22:30,879 INFO L290 TraceCheckUtils]: 0: Hoare triple {6982#(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; {6970#true} is VALID [2022-04-27 12:22:30,879 INFO L290 TraceCheckUtils]: 1: Hoare triple {6970#true} assume true; {6970#true} is VALID [2022-04-27 12:22:30,879 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {6970#true} {6970#true} #102#return; {6970#true} is VALID [2022-04-27 12:22:30,879 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-27 12:22:30,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:22:30,881 INFO L290 TraceCheckUtils]: 0: Hoare triple {6970#true} ~cond := #in~cond; {6970#true} is VALID [2022-04-27 12:22:30,882 INFO L290 TraceCheckUtils]: 1: Hoare triple {6970#true} assume !(0 == ~cond); {6970#true} is VALID [2022-04-27 12:22:30,882 INFO L290 TraceCheckUtils]: 2: Hoare triple {6970#true} assume true; {6970#true} is VALID [2022-04-27 12:22:30,882 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6970#true} {6970#true} #82#return; {6970#true} is VALID [2022-04-27 12:22:30,882 INFO L272 TraceCheckUtils]: 0: Hoare triple {6970#true} call ULTIMATE.init(); {6982#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 12:22:30,882 INFO L290 TraceCheckUtils]: 1: Hoare triple {6982#(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; {6970#true} is VALID [2022-04-27 12:22:30,882 INFO L290 TraceCheckUtils]: 2: Hoare triple {6970#true} assume true; {6970#true} is VALID [2022-04-27 12:22:30,882 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6970#true} {6970#true} #102#return; {6970#true} is VALID [2022-04-27 12:22:30,882 INFO L272 TraceCheckUtils]: 4: Hoare triple {6970#true} call #t~ret7 := main(); {6970#true} is VALID [2022-04-27 12:22:30,883 INFO L290 TraceCheckUtils]: 5: Hoare triple {6970#true} havoc ~n~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~h~0;~n~0 := #t~nondet4;havoc #t~nondet4; {6970#true} is VALID [2022-04-27 12:22:30,883 INFO L272 TraceCheckUtils]: 6: Hoare triple {6970#true} call assume_abort_if_not((if ~n~0 % 4294967296 < 1073741823 then 1 else 0)); {6970#true} is VALID [2022-04-27 12:22:30,883 INFO L290 TraceCheckUtils]: 7: Hoare triple {6970#true} ~cond := #in~cond; {6970#true} is VALID [2022-04-27 12:22:30,883 INFO L290 TraceCheckUtils]: 8: Hoare triple {6970#true} assume !(0 == ~cond); {6970#true} is VALID [2022-04-27 12:22:30,883 INFO L290 TraceCheckUtils]: 9: Hoare triple {6970#true} assume true; {6970#true} is VALID [2022-04-27 12:22:30,883 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {6970#true} {6970#true} #82#return; {6970#true} is VALID [2022-04-27 12:22:30,883 INFO L290 TraceCheckUtils]: 11: Hoare triple {6970#true} ~p~0 := 0;~q~0 := 1;~r~0 := ~n~0;~h~0 := 0; {6970#true} is VALID [2022-04-27 12:22:30,883 INFO L290 TraceCheckUtils]: 12: Hoare triple {6970#true} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {6970#true} is VALID [2022-04-27 12:22:30,883 INFO L290 TraceCheckUtils]: 13: Hoare triple {6970#true} assume !!(#t~post5 < 10);havoc #t~post5; {6970#true} is VALID [2022-04-27 12:22:30,883 INFO L290 TraceCheckUtils]: 14: Hoare triple {6970#true} assume !!(~q~0 % 4294967296 <= ~n~0 % 4294967296);~q~0 := 4 * ~q~0; {6970#true} is VALID [2022-04-27 12:22:30,883 INFO L290 TraceCheckUtils]: 15: Hoare triple {6970#true} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {6970#true} is VALID [2022-04-27 12:22:30,883 INFO L290 TraceCheckUtils]: 16: Hoare triple {6970#true} assume !!(#t~post5 < 10);havoc #t~post5; {6970#true} is VALID [2022-04-27 12:22:30,883 INFO L290 TraceCheckUtils]: 17: Hoare triple {6970#true} assume !!(~q~0 % 4294967296 <= ~n~0 % 4294967296);~q~0 := 4 * ~q~0; {6970#true} is VALID [2022-04-27 12:22:30,883 INFO L290 TraceCheckUtils]: 18: Hoare triple {6970#true} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {6970#true} is VALID [2022-04-27 12:22:30,883 INFO L290 TraceCheckUtils]: 19: Hoare triple {6970#true} assume !!(#t~post5 < 10);havoc #t~post5; {6970#true} is VALID [2022-04-27 12:22:30,883 INFO L290 TraceCheckUtils]: 20: Hoare triple {6970#true} assume !!(~q~0 % 4294967296 <= ~n~0 % 4294967296);~q~0 := 4 * ~q~0; {6970#true} is VALID [2022-04-27 12:22:30,884 INFO L290 TraceCheckUtils]: 21: Hoare triple {6970#true} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {6970#true} is VALID [2022-04-27 12:22:30,884 INFO L290 TraceCheckUtils]: 22: Hoare triple {6970#true} assume !!(#t~post5 < 10);havoc #t~post5; {6970#true} is VALID [2022-04-27 12:22:30,884 INFO L290 TraceCheckUtils]: 23: Hoare triple {6970#true} assume !!(~q~0 % 4294967296 <= ~n~0 % 4294967296);~q~0 := 4 * ~q~0; {6970#true} is VALID [2022-04-27 12:22:30,884 INFO L290 TraceCheckUtils]: 24: Hoare triple {6970#true} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {6970#true} is VALID [2022-04-27 12:22:30,884 INFO L290 TraceCheckUtils]: 25: Hoare triple {6970#true} assume !!(#t~post5 < 10);havoc #t~post5; {6970#true} is VALID [2022-04-27 12:22:30,884 INFO L290 TraceCheckUtils]: 26: Hoare triple {6970#true} assume !!(~q~0 % 4294967296 <= ~n~0 % 4294967296);~q~0 := 4 * ~q~0; {6970#true} is VALID [2022-04-27 12:22:30,884 INFO L290 TraceCheckUtils]: 27: Hoare triple {6970#true} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {6970#true} is VALID [2022-04-27 12:22:30,884 INFO L290 TraceCheckUtils]: 28: Hoare triple {6970#true} assume !!(#t~post5 < 10);havoc #t~post5; {6970#true} is VALID [2022-04-27 12:22:30,884 INFO L290 TraceCheckUtils]: 29: Hoare triple {6970#true} assume !!(~q~0 % 4294967296 <= ~n~0 % 4294967296);~q~0 := 4 * ~q~0; {6970#true} is VALID [2022-04-27 12:22:30,884 INFO L290 TraceCheckUtils]: 30: Hoare triple {6970#true} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {6970#true} is VALID [2022-04-27 12:22:30,884 INFO L290 TraceCheckUtils]: 31: Hoare triple {6970#true} assume !!(#t~post5 < 10);havoc #t~post5; {6970#true} is VALID [2022-04-27 12:22:30,884 INFO L290 TraceCheckUtils]: 32: Hoare triple {6970#true} assume !!(~q~0 % 4294967296 <= ~n~0 % 4294967296);~q~0 := 4 * ~q~0; {6970#true} is VALID [2022-04-27 12:22:30,884 INFO L290 TraceCheckUtils]: 33: Hoare triple {6970#true} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {6970#true} is VALID [2022-04-27 12:22:30,884 INFO L290 TraceCheckUtils]: 34: Hoare triple {6970#true} assume !!(#t~post5 < 10);havoc #t~post5; {6970#true} is VALID [2022-04-27 12:22:30,884 INFO L290 TraceCheckUtils]: 35: Hoare triple {6970#true} assume !!(~q~0 % 4294967296 <= ~n~0 % 4294967296);~q~0 := 4 * ~q~0; {6970#true} is VALID [2022-04-27 12:22:30,884 INFO L290 TraceCheckUtils]: 36: Hoare triple {6970#true} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {6970#true} is VALID [2022-04-27 12:22:30,885 INFO L290 TraceCheckUtils]: 37: Hoare triple {6970#true} assume !!(#t~post5 < 10);havoc #t~post5; {6970#true} is VALID [2022-04-27 12:22:30,885 INFO L290 TraceCheckUtils]: 38: Hoare triple {6970#true} assume !!(~q~0 % 4294967296 <= ~n~0 % 4294967296);~q~0 := 4 * ~q~0; {6970#true} is VALID [2022-04-27 12:22:30,885 INFO L290 TraceCheckUtils]: 39: Hoare triple {6970#true} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {6970#true} is VALID [2022-04-27 12:22:30,885 INFO L290 TraceCheckUtils]: 40: Hoare triple {6970#true} assume !!(#t~post5 < 10);havoc #t~post5; {6970#true} is VALID [2022-04-27 12:22:30,885 INFO L290 TraceCheckUtils]: 41: Hoare triple {6970#true} assume !!(~q~0 % 4294967296 <= ~n~0 % 4294967296);~q~0 := 4 * ~q~0; {6970#true} is VALID [2022-04-27 12:22:30,885 INFO L290 TraceCheckUtils]: 42: Hoare triple {6970#true} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {6979#(<= (+ |main_#t~post5| 1) ~counter~0)} is VALID [2022-04-27 12:22:30,886 INFO L290 TraceCheckUtils]: 43: Hoare triple {6979#(<= (+ |main_#t~post5| 1) ~counter~0)} assume !(#t~post5 < 10);havoc #t~post5; {6980#(<= 11 ~counter~0)} is VALID [2022-04-27 12:22:30,886 INFO L290 TraceCheckUtils]: 44: Hoare triple {6980#(<= 11 ~counter~0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {6981#(<= 11 |main_#t~post6|)} is VALID [2022-04-27 12:22:30,886 INFO L290 TraceCheckUtils]: 45: Hoare triple {6981#(<= 11 |main_#t~post6|)} assume !!(#t~post6 < 10);havoc #t~post6; {6971#false} is VALID [2022-04-27 12:22:30,886 INFO L272 TraceCheckUtils]: 46: Hoare triple {6971#false} call __VERIFIER_assert((if ~r~0 % 4294967296 < (2 * ~p~0 + ~q~0) % 4294967296 then 1 else 0)); {6971#false} is VALID [2022-04-27 12:22:30,887 INFO L290 TraceCheckUtils]: 47: Hoare triple {6971#false} ~cond := #in~cond; {6971#false} is VALID [2022-04-27 12:22:30,887 INFO L290 TraceCheckUtils]: 48: Hoare triple {6971#false} assume 0 == ~cond; {6971#false} is VALID [2022-04-27 12:22:30,887 INFO L290 TraceCheckUtils]: 49: Hoare triple {6971#false} assume !false; {6971#false} is VALID [2022-04-27 12:22:30,887 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:22:30,887 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 12:22:30,887 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [596425923] [2022-04-27 12:22:30,887 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [596425923] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 12:22:30,887 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 12:22:30,887 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-27 12:22:30,887 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [606099203] [2022-04-27 12:22:30,887 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 12:22:30,888 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 5 states have internal predecessors, (17), 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 50 [2022-04-27 12:22:30,888 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 12:22:30,888 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 5 states have internal predecessors, (17), 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:22:30,901 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:22:30,901 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-27 12:22:30,901 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 12:22:30,901 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-27 12:22:30,901 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-27 12:22:30,901 INFO L87 Difference]: Start difference. First operand 234 states and 290 transitions. Second operand has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 5 states have internal predecessors, (17), 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:22:34,677 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:22:38,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:22:38,970 INFO L93 Difference]: Finished difference Result 271 states and 339 transitions. [2022-04-27 12:22:38,970 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-27 12:22:38,970 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 5 states have internal predecessors, (17), 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 50 [2022-04-27 12:22:38,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 12:22:38,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 5 states have internal predecessors, (17), 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:22:38,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 78 transitions. [2022-04-27 12:22:38,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 5 states have internal predecessors, (17), 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:22:38,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 78 transitions. [2022-04-27 12:22:38,972 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 78 transitions. [2022-04-27 12:22:39,040 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:22:39,044 INFO L225 Difference]: With dead ends: 271 [2022-04-27 12:22:39,044 INFO L226 Difference]: Without dead ends: 231 [2022-04-27 12:22:39,045 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-04-27 12:22:39,045 INFO L413 NwaCegarLoop]: 42 mSDtfsCounter, 10 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 101 mSolverCounterSat, 12 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 106 SdHoareTripleChecker+Invalid, 114 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 101 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.3s IncrementalHoareTripleChecker+Time [2022-04-27 12:22:39,045 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 106 Invalid, 114 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 101 Invalid, 1 Unknown, 0 Unchecked, 4.3s Time] [2022-04-27 12:22:39,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 231 states. [2022-04-27 12:22:39,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 231 to 223. [2022-04-27 12:22:39,142 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 12:22:39,143 INFO L82 GeneralOperation]: Start isEquivalent. First operand 231 states. Second operand has 223 states, 135 states have (on average 1.1481481481481481) internal successors, (155), 141 states have internal predecessors, (155), 62 states have call successors, (62), 26 states have call predecessors, (62), 25 states have return successors, (58), 55 states have call predecessors, (58), 58 states have call successors, (58) [2022-04-27 12:22:39,143 INFO L74 IsIncluded]: Start isIncluded. First operand 231 states. Second operand has 223 states, 135 states have (on average 1.1481481481481481) internal successors, (155), 141 states have internal predecessors, (155), 62 states have call successors, (62), 26 states have call predecessors, (62), 25 states have return successors, (58), 55 states have call predecessors, (58), 58 states have call successors, (58) [2022-04-27 12:22:39,143 INFO L87 Difference]: Start difference. First operand 231 states. Second operand has 223 states, 135 states have (on average 1.1481481481481481) internal successors, (155), 141 states have internal predecessors, (155), 62 states have call successors, (62), 26 states have call predecessors, (62), 25 states have return successors, (58), 55 states have call predecessors, (58), 58 states have call successors, (58) [2022-04-27 12:22:39,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:22:39,147 INFO L93 Difference]: Finished difference Result 231 states and 285 transitions. [2022-04-27 12:22:39,147 INFO L276 IsEmpty]: Start isEmpty. Operand 231 states and 285 transitions. [2022-04-27 12:22:39,148 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 12:22:39,148 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 12:22:39,148 INFO L74 IsIncluded]: Start isIncluded. First operand has 223 states, 135 states have (on average 1.1481481481481481) internal successors, (155), 141 states have internal predecessors, (155), 62 states have call successors, (62), 26 states have call predecessors, (62), 25 states have return successors, (58), 55 states have call predecessors, (58), 58 states have call successors, (58) Second operand 231 states. [2022-04-27 12:22:39,149 INFO L87 Difference]: Start difference. First operand has 223 states, 135 states have (on average 1.1481481481481481) internal successors, (155), 141 states have internal predecessors, (155), 62 states have call successors, (62), 26 states have call predecessors, (62), 25 states have return successors, (58), 55 states have call predecessors, (58), 58 states have call successors, (58) Second operand 231 states. [2022-04-27 12:22:39,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:22:39,153 INFO L93 Difference]: Finished difference Result 231 states and 285 transitions. [2022-04-27 12:22:39,153 INFO L276 IsEmpty]: Start isEmpty. Operand 231 states and 285 transitions. [2022-04-27 12:22:39,153 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 12:22:39,154 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 12:22:39,154 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 12:22:39,154 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 12:22:39,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 223 states, 135 states have (on average 1.1481481481481481) internal successors, (155), 141 states have internal predecessors, (155), 62 states have call successors, (62), 26 states have call predecessors, (62), 25 states have return successors, (58), 55 states have call predecessors, (58), 58 states have call successors, (58) [2022-04-27 12:22:39,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 223 states to 223 states and 275 transitions. [2022-04-27 12:22:39,158 INFO L78 Accepts]: Start accepts. Automaton has 223 states and 275 transitions. Word has length 50 [2022-04-27 12:22:39,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 12:22:39,158 INFO L495 AbstractCegarLoop]: Abstraction has 223 states and 275 transitions. [2022-04-27 12:22:39,158 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 5 states have internal predecessors, (17), 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:22:39,158 INFO L276 IsEmpty]: Start isEmpty. Operand 223 states and 275 transitions. [2022-04-27 12:22:39,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-04-27 12:22:39,159 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 12:22:39,159 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:39,160 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-04-27 12:22:39,160 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 12:22:39,160 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 12:22:39,160 INFO L85 PathProgramCache]: Analyzing trace with hash 109392637, now seen corresponding path program 1 times [2022-04-27 12:22:39,160 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 12:22:39,160 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [224493600] [2022-04-27 12:22:39,160 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 12:22:39,160 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 12:22:39,173 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 12:22:39,173 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1757723316] [2022-04-27 12:22:39,173 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 12:22:39,174 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 12:22:39,174 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 12:22:39,175 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:22:39,176 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process