/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/hard-u_unwindbound50.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-fb4f59a-m [2022-04-27 13:36:52,353 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-27 13:36:52,355 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-27 13:36:52,379 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-27 13:36:52,379 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-27 13:36:52,380 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-27 13:36:52,381 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-27 13:36:52,382 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-27 13:36:52,383 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-27 13:36:52,383 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-27 13:36:52,384 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-27 13:36:52,385 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-27 13:36:52,385 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-27 13:36:52,386 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-27 13:36:52,386 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-27 13:36:52,387 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-27 13:36:52,387 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-27 13:36:52,388 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-27 13:36:52,389 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-27 13:36:52,390 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-27 13:36:52,391 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-27 13:36:52,395 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-27 13:36:52,395 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-27 13:36:52,396 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-27 13:36:52,397 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-27 13:36:52,398 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-27 13:36:52,399 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-27 13:36:52,399 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-27 13:36:52,399 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-27 13:36:52,400 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-27 13:36:52,400 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-27 13:36:52,401 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-27 13:36:52,401 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-27 13:36:52,402 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-27 13:36:52,402 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-27 13:36:52,403 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-27 13:36:52,403 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-27 13:36:52,403 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-27 13:36:52,404 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-27 13:36:52,404 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-27 13:36:52,404 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-27 13:36:52,408 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-27 13:36:52,409 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 13:36:52,422 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-27 13:36:52,423 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-27 13:36:52,425 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-04-27 13:36:52,426 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-04-27 13:36:52,426 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-04-27 13:36:52,426 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-04-27 13:36:52,427 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-04-27 13:36:52,427 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-04-27 13:36:52,427 INFO L138 SettingsManager]: * Use SBE=true [2022-04-27 13:36:52,428 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-27 13:36:52,428 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-27 13:36:52,428 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-27 13:36:52,428 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-27 13:36:52,428 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-27 13:36:52,428 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-27 13:36:52,429 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-27 13:36:52,429 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-27 13:36:52,429 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-27 13:36:52,430 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-27 13:36:52,430 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-27 13:36:52,430 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-27 13:36:52,430 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-27 13:36:52,430 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-27 13:36:52,430 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-27 13:36:52,430 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 13:36:52,430 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-27 13:36:52,430 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-04-27 13:36:52,431 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-04-27 13:36:52,431 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-04-27 13:36:52,431 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-04-27 13:36:52,431 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-04-27 13:36:52,431 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-04-27 13:36:52,431 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-27 13:36:52,431 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 13:36:52,613 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-27 13:36:52,628 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-27 13:36:52,630 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-27 13:36:52,630 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-27 13:36:52,632 INFO L275 PluginConnector]: CDTParser initialized [2022-04-27 13:36:52,633 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/nla-digbench-scaling/hard-u_unwindbound50.c [2022-04-27 13:36:52,680 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4d155633f/edd6b8a9be6f403fb338da7c76351576/FLAGaf815d943 [2022-04-27 13:36:52,998 INFO L306 CDTParser]: Found 1 translation units. [2022-04-27 13:36:52,998 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/hard-u_unwindbound50.c [2022-04-27 13:36:53,003 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4d155633f/edd6b8a9be6f403fb338da7c76351576/FLAGaf815d943 [2022-04-27 13:36:53,430 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4d155633f/edd6b8a9be6f403fb338da7c76351576 [2022-04-27 13:36:53,432 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-27 13:36:53,433 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-27 13:36:53,436 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-27 13:36:53,437 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-27 13:36:53,439 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-27 13:36:53,439 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 01:36:53" (1/1) ... [2022-04-27 13:36:53,443 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3429d7cb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 01:36:53, skipping insertion in model container [2022-04-27 13:36:53,443 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 01:36:53" (1/1) ... [2022-04-27 13:36:53,447 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-27 13:36:53,459 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-27 13:36:53,629 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/hard-u_unwindbound50.c[537,550] [2022-04-27 13:36:53,656 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 13:36:53,664 INFO L203 MainTranslator]: Completed pre-run [2022-04-27 13:36:53,677 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/hard-u_unwindbound50.c[537,550] [2022-04-27 13:36:53,696 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 13:36:53,709 INFO L208 MainTranslator]: Completed translation [2022-04-27 13:36:53,710 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 01:36:53 WrapperNode [2022-04-27 13:36:53,710 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-27 13:36:53,711 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-27 13:36:53,711 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-27 13:36:53,711 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-27 13:36:53,719 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 01:36:53" (1/1) ... [2022-04-27 13:36:53,719 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 01:36:53" (1/1) ... [2022-04-27 13:36:53,729 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 01:36:53" (1/1) ... [2022-04-27 13:36:53,730 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 01:36:53" (1/1) ... [2022-04-27 13:36:53,743 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 01:36:53" (1/1) ... [2022-04-27 13:36:53,749 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 01:36:53" (1/1) ... [2022-04-27 13:36:53,756 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 01:36:53" (1/1) ... [2022-04-27 13:36:53,757 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-27 13:36:53,758 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-27 13:36:53,758 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-27 13:36:53,758 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-27 13:36:53,760 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 01:36:53" (1/1) ... [2022-04-27 13:36:53,765 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 13:36:53,773 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 13:36:53,791 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 13:36:53,809 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 13:36:53,828 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-27 13:36:53,828 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-27 13:36:53,829 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-27 13:36:53,829 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-27 13:36:53,830 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-27 13:36:53,830 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-27 13:36:53,830 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-27 13:36:53,830 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-27 13:36:53,830 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-27 13:36:53,830 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-27 13:36:53,830 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uint [2022-04-27 13:36:53,830 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-27 13:36:53,830 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-27 13:36:53,830 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-27 13:36:53,830 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-27 13:36:53,830 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-27 13:36:53,830 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-27 13:36:53,830 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-27 13:36:53,831 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-27 13:36:53,831 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-27 13:36:53,888 INFO L234 CfgBuilder]: Building ICFG [2022-04-27 13:36:53,890 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-27 13:36:54,027 INFO L275 CfgBuilder]: Performing block encoding [2022-04-27 13:36:54,033 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-27 13:36:54,033 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-04-27 13:36:54,035 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 01:36:54 BoogieIcfgContainer [2022-04-27 13:36:54,035 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-27 13:36:54,036 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-27 13:36:54,036 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-27 13:36:54,039 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-27 13:36:54,040 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.04 01:36:53" (1/3) ... [2022-04-27 13:36:54,040 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@68cd9dda and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 01:36:54, skipping insertion in model container [2022-04-27 13:36:54,040 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 01:36:53" (2/3) ... [2022-04-27 13:36:54,041 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@68cd9dda and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 01:36:54, skipping insertion in model container [2022-04-27 13:36:54,041 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 01:36:54" (3/3) ... [2022-04-27 13:36:54,042 INFO L111 eAbstractionObserver]: Analyzing ICFG hard-u_unwindbound50.c [2022-04-27 13:36:54,069 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-04-27 13:36:54,070 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-27 13:36:54,113 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-27 13:36:54,118 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@2f2b90c7, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@49f54e8a [2022-04-27 13:36:54,118 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-27 13:36:54,126 INFO L276 IsEmpty]: Start isEmpty. Operand has 37 states, 21 states have (on average 1.4761904761904763) internal successors, (31), 22 states have internal predecessors, (31), 10 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-27 13:36:54,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-04-27 13:36:54,132 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 13:36:54,133 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 13:36:54,137 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 13:36:54,143 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 13:36:54,144 INFO L85 PathProgramCache]: Analyzing trace with hash 1191571617, now seen corresponding path program 1 times [2022-04-27 13:36:54,152 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 13:36:54,154 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [149752108] [2022-04-27 13:36:54,154 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:36:54,155 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 13:36:54,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:36:54,275 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 13:36:54,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:36:54,292 INFO L290 TraceCheckUtils]: 0: Hoare triple {49#(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(9, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {40#true} is VALID [2022-04-27 13:36:54,292 INFO L290 TraceCheckUtils]: 1: Hoare triple {40#true} assume true; {40#true} is VALID [2022-04-27 13:36:54,292 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {40#true} {40#true} #96#return; {40#true} is VALID [2022-04-27 13:36:54,293 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-27 13:36:54,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:36:54,300 INFO L290 TraceCheckUtils]: 0: Hoare triple {40#true} ~cond := #in~cond; {40#true} is VALID [2022-04-27 13:36:54,300 INFO L290 TraceCheckUtils]: 1: Hoare triple {40#true} assume 0 == ~cond;assume false; {41#false} is VALID [2022-04-27 13:36:54,301 INFO L290 TraceCheckUtils]: 2: Hoare triple {41#false} assume true; {41#false} is VALID [2022-04-27 13:36:54,301 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {41#false} {40#true} #80#return; {41#false} is VALID [2022-04-27 13:36:54,302 INFO L272 TraceCheckUtils]: 0: Hoare triple {40#true} call ULTIMATE.init(); {49#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 13:36:54,302 INFO L290 TraceCheckUtils]: 1: Hoare triple {49#(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(9, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {40#true} is VALID [2022-04-27 13:36:54,302 INFO L290 TraceCheckUtils]: 2: Hoare triple {40#true} assume true; {40#true} is VALID [2022-04-27 13:36:54,302 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {40#true} {40#true} #96#return; {40#true} is VALID [2022-04-27 13:36:54,303 INFO L272 TraceCheckUtils]: 4: Hoare triple {40#true} call #t~ret8 := main(); {40#true} is VALID [2022-04-27 13:36:54,303 INFO L290 TraceCheckUtils]: 5: Hoare triple {40#true} havoc ~A~0;havoc ~B~0;havoc ~r~0;havoc ~d~0;havoc ~p~0;havoc ~q~0;~A~0 := #t~nondet4;havoc #t~nondet4;~B~0 := #t~nondet5;havoc #t~nondet5; {40#true} is VALID [2022-04-27 13:36:54,303 INFO L272 TraceCheckUtils]: 6: Hoare triple {40#true} call assume_abort_if_not((if ~B~0 % 4294967296 >= 1 then 1 else 0)); {40#true} is VALID [2022-04-27 13:36:54,303 INFO L290 TraceCheckUtils]: 7: Hoare triple {40#true} ~cond := #in~cond; {40#true} is VALID [2022-04-27 13:36:54,304 INFO L290 TraceCheckUtils]: 8: Hoare triple {40#true} assume 0 == ~cond;assume false; {41#false} is VALID [2022-04-27 13:36:54,304 INFO L290 TraceCheckUtils]: 9: Hoare triple {41#false} assume true; {41#false} is VALID [2022-04-27 13:36:54,304 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {41#false} {40#true} #80#return; {41#false} is VALID [2022-04-27 13:36:54,304 INFO L290 TraceCheckUtils]: 11: Hoare triple {41#false} ~r~0 := ~A~0;~d~0 := ~B~0;~p~0 := 1;~q~0 := 0; {41#false} is VALID [2022-04-27 13:36:54,304 INFO L290 TraceCheckUtils]: 12: Hoare triple {41#false} assume !true; {41#false} is VALID [2022-04-27 13:36:54,305 INFO L290 TraceCheckUtils]: 13: Hoare triple {41#false} assume !true; {41#false} is VALID [2022-04-27 13:36:54,305 INFO L272 TraceCheckUtils]: 14: Hoare triple {41#false} call __VERIFIER_assert((if ~A~0 % 4294967296 == (~d~0 * ~q~0 + ~r~0) % 4294967296 then 1 else 0)); {41#false} is VALID [2022-04-27 13:36:54,305 INFO L290 TraceCheckUtils]: 15: Hoare triple {41#false} ~cond := #in~cond; {41#false} is VALID [2022-04-27 13:36:54,305 INFO L290 TraceCheckUtils]: 16: Hoare triple {41#false} assume 0 == ~cond; {41#false} is VALID [2022-04-27 13:36:54,305 INFO L290 TraceCheckUtils]: 17: Hoare triple {41#false} assume !false; {41#false} is VALID [2022-04-27 13:36:54,306 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 13:36:54,306 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 13:36:54,306 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [149752108] [2022-04-27 13:36:54,307 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [149752108] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 13:36:54,307 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 13:36:54,307 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-27 13:36:54,308 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1570393402] [2022-04-27 13:36:54,309 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 13:36:54,313 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 13:36:54,314 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 13:36:54,317 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 13:36:54,336 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 13:36:54,337 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-27 13:36:54,337 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 13:36:54,357 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-27 13:36:54,358 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-27 13:36:54,361 INFO L87 Difference]: Start difference. First operand has 37 states, 21 states have (on average 1.4761904761904763) internal successors, (31), 22 states have internal predecessors, (31), 10 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) 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 13:36:54,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:36:54,570 INFO L93 Difference]: Finished difference Result 66 states and 101 transitions. [2022-04-27 13:36:54,570 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-27 13:36:54,570 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 13:36:54,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 13:36:54,572 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 13:36:54,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 101 transitions. [2022-04-27 13:36:54,585 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 13:36:54,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 101 transitions. [2022-04-27 13:36:54,596 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 101 transitions. [2022-04-27 13:36:54,721 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 101 edges. 101 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 13:36:54,740 INFO L225 Difference]: With dead ends: 66 [2022-04-27 13:36:54,740 INFO L226 Difference]: Without dead ends: 33 [2022-04-27 13:36:54,742 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 13:36:54,745 INFO L413 NwaCegarLoop]: 45 mSDtfsCounter, 10 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 49 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-27 13:36:54,746 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 49 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-27 13:36:54,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2022-04-27 13:36:54,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 32. [2022-04-27 13:36:54,772 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 13:36:54,772 INFO L82 GeneralOperation]: Start isEquivalent. First operand 33 states. Second operand has 32 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 19 states have internal predecessors, (24), 10 states have call successors, (10), 4 states have call predecessors, (10), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-27 13:36:54,773 INFO L74 IsIncluded]: Start isIncluded. First operand 33 states. Second operand has 32 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 19 states have internal predecessors, (24), 10 states have call successors, (10), 4 states have call predecessors, (10), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-27 13:36:54,774 INFO L87 Difference]: Start difference. First operand 33 states. Second operand has 32 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 19 states have internal predecessors, (24), 10 states have call successors, (10), 4 states have call predecessors, (10), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-27 13:36:54,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:36:54,777 INFO L93 Difference]: Finished difference Result 33 states and 43 transitions. [2022-04-27 13:36:54,777 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 43 transitions. [2022-04-27 13:36:54,778 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:36:54,778 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:36:54,779 INFO L74 IsIncluded]: Start isIncluded. First operand has 32 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 19 states have internal predecessors, (24), 10 states have call successors, (10), 4 states have call predecessors, (10), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand 33 states. [2022-04-27 13:36:54,779 INFO L87 Difference]: Start difference. First operand has 32 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 19 states have internal predecessors, (24), 10 states have call successors, (10), 4 states have call predecessors, (10), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand 33 states. [2022-04-27 13:36:54,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:36:54,782 INFO L93 Difference]: Finished difference Result 33 states and 43 transitions. [2022-04-27 13:36:54,782 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 43 transitions. [2022-04-27 13:36:54,783 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:36:54,783 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:36:54,783 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 13:36:54,783 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 13:36:54,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 19 states have internal predecessors, (24), 10 states have call successors, (10), 4 states have call predecessors, (10), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-27 13:36:54,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 42 transitions. [2022-04-27 13:36:54,787 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 42 transitions. Word has length 18 [2022-04-27 13:36:54,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 13:36:54,787 INFO L495 AbstractCegarLoop]: Abstraction has 32 states and 42 transitions. [2022-04-27 13:36:54,787 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 13:36:54,788 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 42 transitions. [2022-04-27 13:36:54,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-04-27 13:36:54,788 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 13:36:54,788 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 13:36:54,789 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-27 13:36:54,789 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 13:36:54,789 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 13:36:54,790 INFO L85 PathProgramCache]: Analyzing trace with hash 336486197, now seen corresponding path program 1 times [2022-04-27 13:36:54,790 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 13:36:54,790 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1777449457] [2022-04-27 13:36:54,790 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:36:54,790 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 13:36:54,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:36:54,862 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 13:36:54,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:36:54,870 INFO L290 TraceCheckUtils]: 0: Hoare triple {268#(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(9, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {256#true} is VALID [2022-04-27 13:36:54,870 INFO L290 TraceCheckUtils]: 1: Hoare triple {256#true} assume true; {256#true} is VALID [2022-04-27 13:36:54,871 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {256#true} {256#true} #96#return; {256#true} is VALID [2022-04-27 13:36:54,871 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-27 13:36:54,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:36:54,876 INFO L290 TraceCheckUtils]: 0: Hoare triple {256#true} ~cond := #in~cond; {256#true} is VALID [2022-04-27 13:36:54,877 INFO L290 TraceCheckUtils]: 1: Hoare triple {256#true} assume !(0 == ~cond); {256#true} is VALID [2022-04-27 13:36:54,877 INFO L290 TraceCheckUtils]: 2: Hoare triple {256#true} assume true; {256#true} is VALID [2022-04-27 13:36:54,877 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {256#true} {256#true} #80#return; {256#true} is VALID [2022-04-27 13:36:54,878 INFO L272 TraceCheckUtils]: 0: Hoare triple {256#true} call ULTIMATE.init(); {268#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 13:36:54,878 INFO L290 TraceCheckUtils]: 1: Hoare triple {268#(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(9, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {256#true} is VALID [2022-04-27 13:36:54,878 INFO L290 TraceCheckUtils]: 2: Hoare triple {256#true} assume true; {256#true} is VALID [2022-04-27 13:36:54,878 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {256#true} {256#true} #96#return; {256#true} is VALID [2022-04-27 13:36:54,878 INFO L272 TraceCheckUtils]: 4: Hoare triple {256#true} call #t~ret8 := main(); {256#true} is VALID [2022-04-27 13:36:54,879 INFO L290 TraceCheckUtils]: 5: Hoare triple {256#true} havoc ~A~0;havoc ~B~0;havoc ~r~0;havoc ~d~0;havoc ~p~0;havoc ~q~0;~A~0 := #t~nondet4;havoc #t~nondet4;~B~0 := #t~nondet5;havoc #t~nondet5; {256#true} is VALID [2022-04-27 13:36:54,879 INFO L272 TraceCheckUtils]: 6: Hoare triple {256#true} call assume_abort_if_not((if ~B~0 % 4294967296 >= 1 then 1 else 0)); {256#true} is VALID [2022-04-27 13:36:54,879 INFO L290 TraceCheckUtils]: 7: Hoare triple {256#true} ~cond := #in~cond; {256#true} is VALID [2022-04-27 13:36:54,879 INFO L290 TraceCheckUtils]: 8: Hoare triple {256#true} assume !(0 == ~cond); {256#true} is VALID [2022-04-27 13:36:54,879 INFO L290 TraceCheckUtils]: 9: Hoare triple {256#true} assume true; {256#true} is VALID [2022-04-27 13:36:54,880 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {256#true} {256#true} #80#return; {256#true} is VALID [2022-04-27 13:36:54,880 INFO L290 TraceCheckUtils]: 11: Hoare triple {256#true} ~r~0 := ~A~0;~d~0 := ~B~0;~p~0 := 1;~q~0 := 0; {265#(= main_~q~0 0)} is VALID [2022-04-27 13:36:54,881 INFO L290 TraceCheckUtils]: 12: Hoare triple {265#(= main_~q~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {265#(= main_~q~0 0)} is VALID [2022-04-27 13:36:54,881 INFO L290 TraceCheckUtils]: 13: Hoare triple {265#(= main_~q~0 0)} assume !!(#t~post6 < 50);havoc #t~post6; {265#(= main_~q~0 0)} is VALID [2022-04-27 13:36:54,882 INFO L272 TraceCheckUtils]: 14: Hoare triple {265#(= main_~q~0 0)} call __VERIFIER_assert((if 0 == ~q~0 % 4294967296 then 1 else 0)); {266#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 13:36:54,882 INFO L290 TraceCheckUtils]: 15: Hoare triple {266#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {267#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-27 13:36:54,883 INFO L290 TraceCheckUtils]: 16: Hoare triple {267#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {257#false} is VALID [2022-04-27 13:36:54,883 INFO L290 TraceCheckUtils]: 17: Hoare triple {257#false} assume !false; {257#false} is VALID [2022-04-27 13:36:54,883 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 13:36:54,884 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 13:36:54,884 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1777449457] [2022-04-27 13:36:54,884 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1777449457] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 13:36:54,884 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 13:36:54,884 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-27 13:36:54,884 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [888202216] [2022-04-27 13:36:54,885 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 13:36:54,886 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.0) internal successors, (12), 4 states have internal predecessors, (12), 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 18 [2022-04-27 13:36:54,886 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 13:36:54,886 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 2.0) internal successors, (12), 4 states have internal predecessors, (12), 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 13:36:54,905 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 13:36:54,906 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-27 13:36:54,906 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 13:36:54,908 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-27 13:36:54,908 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-27 13:36:54,908 INFO L87 Difference]: Start difference. First operand 32 states and 42 transitions. Second operand has 6 states, 6 states have (on average 2.0) internal successors, (12), 4 states have internal predecessors, (12), 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 13:36:55,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:36:55,286 INFO L93 Difference]: Finished difference Result 47 states and 62 transitions. [2022-04-27 13:36:55,286 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-27 13:36:55,286 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.0) internal successors, (12), 4 states have internal predecessors, (12), 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 18 [2022-04-27 13:36:55,286 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 13:36:55,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.0) internal successors, (12), 4 states have internal predecessors, (12), 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 13:36:55,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 62 transitions. [2022-04-27 13:36:55,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.0) internal successors, (12), 4 states have internal predecessors, (12), 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 13:36:55,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 62 transitions. [2022-04-27 13:36:55,291 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 62 transitions. [2022-04-27 13:36:55,350 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 62 edges. 62 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 13:36:55,354 INFO L225 Difference]: With dead ends: 47 [2022-04-27 13:36:55,354 INFO L226 Difference]: Without dead ends: 45 [2022-04-27 13:36:55,357 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2022-04-27 13:36:55,360 INFO L413 NwaCegarLoop]: 39 mSDtfsCounter, 28 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 99 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 90 SdHoareTripleChecker+Invalid, 113 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 99 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-27 13:36:55,363 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 90 Invalid, 113 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 99 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-27 13:36:55,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2022-04-27 13:36:55,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 36. [2022-04-27 13:36:55,371 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 13:36:55,374 INFO L82 GeneralOperation]: Start isEquivalent. First operand 45 states. Second operand has 36 states, 21 states have (on average 1.2857142857142858) internal successors, (27), 22 states have internal predecessors, (27), 10 states have call successors, (10), 5 states have call predecessors, (10), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-27 13:36:55,375 INFO L74 IsIncluded]: Start isIncluded. First operand 45 states. Second operand has 36 states, 21 states have (on average 1.2857142857142858) internal successors, (27), 22 states have internal predecessors, (27), 10 states have call successors, (10), 5 states have call predecessors, (10), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-27 13:36:55,375 INFO L87 Difference]: Start difference. First operand 45 states. Second operand has 36 states, 21 states have (on average 1.2857142857142858) internal successors, (27), 22 states have internal predecessors, (27), 10 states have call successors, (10), 5 states have call predecessors, (10), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-27 13:36:55,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:36:55,378 INFO L93 Difference]: Finished difference Result 45 states and 60 transitions. [2022-04-27 13:36:55,378 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 60 transitions. [2022-04-27 13:36:55,379 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:36:55,379 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:36:55,379 INFO L74 IsIncluded]: Start isIncluded. First operand has 36 states, 21 states have (on average 1.2857142857142858) internal successors, (27), 22 states have internal predecessors, (27), 10 states have call successors, (10), 5 states have call predecessors, (10), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand 45 states. [2022-04-27 13:36:55,379 INFO L87 Difference]: Start difference. First operand has 36 states, 21 states have (on average 1.2857142857142858) internal successors, (27), 22 states have internal predecessors, (27), 10 states have call successors, (10), 5 states have call predecessors, (10), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand 45 states. [2022-04-27 13:36:55,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:36:55,382 INFO L93 Difference]: Finished difference Result 45 states and 60 transitions. [2022-04-27 13:36:55,382 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 60 transitions. [2022-04-27 13:36:55,382 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:36:55,383 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:36:55,383 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 13:36:55,383 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 13:36:55,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 21 states have (on average 1.2857142857142858) internal successors, (27), 22 states have internal predecessors, (27), 10 states have call successors, (10), 5 states have call predecessors, (10), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-27 13:36:55,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 45 transitions. [2022-04-27 13:36:55,385 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 45 transitions. Word has length 18 [2022-04-27 13:36:55,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 13:36:55,385 INFO L495 AbstractCegarLoop]: Abstraction has 36 states and 45 transitions. [2022-04-27 13:36:55,385 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.0) internal successors, (12), 4 states have internal predecessors, (12), 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 13:36:55,385 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 45 transitions. [2022-04-27 13:36:55,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-04-27 13:36:55,386 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 13:36:55,386 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 13:36:55,386 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-27 13:36:55,386 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 13:36:55,391 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 13:36:55,391 INFO L85 PathProgramCache]: Analyzing trace with hash -1819267188, now seen corresponding path program 1 times [2022-04-27 13:36:55,391 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 13:36:55,392 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2098261601] [2022-04-27 13:36:55,392 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:36:55,392 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 13:36:55,422 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 13:36:55,423 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [658494535] [2022-04-27 13:36:55,423 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:36:55,423 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 13:36:55,426 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 13:36:55,431 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 13:36:55,468 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 13:36:55,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:36:55,490 INFO L263 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 5 conjunts are in the unsatisfiable core [2022-04-27 13:36:55,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:36:55,510 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 13:36:55,649 INFO L272 TraceCheckUtils]: 0: Hoare triple {489#true} call ULTIMATE.init(); {489#true} is VALID [2022-04-27 13:36:55,650 INFO L290 TraceCheckUtils]: 1: Hoare triple {489#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(9, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {497#(<= ~counter~0 0)} is VALID [2022-04-27 13:36:55,651 INFO L290 TraceCheckUtils]: 2: Hoare triple {497#(<= ~counter~0 0)} assume true; {497#(<= ~counter~0 0)} is VALID [2022-04-27 13:36:55,651 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {497#(<= ~counter~0 0)} {489#true} #96#return; {497#(<= ~counter~0 0)} is VALID [2022-04-27 13:36:55,651 INFO L272 TraceCheckUtils]: 4: Hoare triple {497#(<= ~counter~0 0)} call #t~ret8 := main(); {497#(<= ~counter~0 0)} is VALID [2022-04-27 13:36:55,652 INFO L290 TraceCheckUtils]: 5: Hoare triple {497#(<= ~counter~0 0)} havoc ~A~0;havoc ~B~0;havoc ~r~0;havoc ~d~0;havoc ~p~0;havoc ~q~0;~A~0 := #t~nondet4;havoc #t~nondet4;~B~0 := #t~nondet5;havoc #t~nondet5; {497#(<= ~counter~0 0)} is VALID [2022-04-27 13:36:55,661 INFO L272 TraceCheckUtils]: 6: Hoare triple {497#(<= ~counter~0 0)} call assume_abort_if_not((if ~B~0 % 4294967296 >= 1 then 1 else 0)); {497#(<= ~counter~0 0)} is VALID [2022-04-27 13:36:55,661 INFO L290 TraceCheckUtils]: 7: Hoare triple {497#(<= ~counter~0 0)} ~cond := #in~cond; {497#(<= ~counter~0 0)} is VALID [2022-04-27 13:36:55,662 INFO L290 TraceCheckUtils]: 8: Hoare triple {497#(<= ~counter~0 0)} assume !(0 == ~cond); {497#(<= ~counter~0 0)} is VALID [2022-04-27 13:36:55,662 INFO L290 TraceCheckUtils]: 9: Hoare triple {497#(<= ~counter~0 0)} assume true; {497#(<= ~counter~0 0)} is VALID [2022-04-27 13:36:55,662 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {497#(<= ~counter~0 0)} {497#(<= ~counter~0 0)} #80#return; {497#(<= ~counter~0 0)} is VALID [2022-04-27 13:36:55,663 INFO L290 TraceCheckUtils]: 11: Hoare triple {497#(<= ~counter~0 0)} ~r~0 := ~A~0;~d~0 := ~B~0;~p~0 := 1;~q~0 := 0; {497#(<= ~counter~0 0)} is VALID [2022-04-27 13:36:55,663 INFO L290 TraceCheckUtils]: 12: Hoare triple {497#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {531#(<= |main_#t~post6| 0)} is VALID [2022-04-27 13:36:55,664 INFO L290 TraceCheckUtils]: 13: Hoare triple {531#(<= |main_#t~post6| 0)} assume !(#t~post6 < 50);havoc #t~post6; {490#false} is VALID [2022-04-27 13:36:55,664 INFO L290 TraceCheckUtils]: 14: Hoare triple {490#false} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {490#false} is VALID [2022-04-27 13:36:55,664 INFO L290 TraceCheckUtils]: 15: Hoare triple {490#false} assume !(#t~post7 < 50);havoc #t~post7; {490#false} is VALID [2022-04-27 13:36:55,664 INFO L272 TraceCheckUtils]: 16: Hoare triple {490#false} call __VERIFIER_assert((if ~A~0 % 4294967296 == (~d~0 * ~q~0 + ~r~0) % 4294967296 then 1 else 0)); {490#false} is VALID [2022-04-27 13:36:55,664 INFO L290 TraceCheckUtils]: 17: Hoare triple {490#false} ~cond := #in~cond; {490#false} is VALID [2022-04-27 13:36:55,664 INFO L290 TraceCheckUtils]: 18: Hoare triple {490#false} assume 0 == ~cond; {490#false} is VALID [2022-04-27 13:36:55,665 INFO L290 TraceCheckUtils]: 19: Hoare triple {490#false} assume !false; {490#false} is VALID [2022-04-27 13:36:55,665 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 13:36:55,665 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-27 13:36:55,665 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 13:36:55,665 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2098261601] [2022-04-27 13:36:55,665 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 13:36:55,666 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [658494535] [2022-04-27 13:36:55,666 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [658494535] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 13:36:55,666 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 13:36:55,666 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-27 13:36:55,666 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1245141862] [2022-04-27 13:36:55,666 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 13:36:55,667 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 13:36:55,667 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 13:36:55,667 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 13:36:55,682 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 13:36:55,682 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-27 13:36:55,683 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 13:36:55,683 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-27 13:36:55,683 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-27 13:36:55,684 INFO L87 Difference]: Start difference. First operand 36 states and 45 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 13:36:55,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:36:55,776 INFO L93 Difference]: Finished difference Result 52 states and 67 transitions. [2022-04-27 13:36:55,776 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-27 13:36:55,777 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 13:36:55,778 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 13:36:55,778 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 13:36:55,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 64 transitions. [2022-04-27 13:36:55,781 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 13:36:55,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 64 transitions. [2022-04-27 13:36:55,787 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 64 transitions. [2022-04-27 13:36:55,841 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 13:36:55,843 INFO L225 Difference]: With dead ends: 52 [2022-04-27 13:36:55,843 INFO L226 Difference]: Without dead ends: 38 [2022-04-27 13:36:55,843 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 13:36:55,844 INFO L413 NwaCegarLoop]: 40 mSDtfsCounter, 0 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 107 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 13:36:55,845 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 107 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 13:36:55,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2022-04-27 13:36:55,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2022-04-27 13:36:55,854 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 13:36:55,854 INFO L82 GeneralOperation]: Start isEquivalent. First operand 38 states. Second operand has 38 states, 23 states have (on average 1.2608695652173914) internal successors, (29), 24 states have internal predecessors, (29), 10 states have call successors, (10), 5 states have call predecessors, (10), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-27 13:36:55,854 INFO L74 IsIncluded]: Start isIncluded. First operand 38 states. Second operand has 38 states, 23 states have (on average 1.2608695652173914) internal successors, (29), 24 states have internal predecessors, (29), 10 states have call successors, (10), 5 states have call predecessors, (10), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-27 13:36:55,855 INFO L87 Difference]: Start difference. First operand 38 states. Second operand has 38 states, 23 states have (on average 1.2608695652173914) internal successors, (29), 24 states have internal predecessors, (29), 10 states have call successors, (10), 5 states have call predecessors, (10), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-27 13:36:55,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:36:55,857 INFO L93 Difference]: Finished difference Result 38 states and 47 transitions. [2022-04-27 13:36:55,857 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 47 transitions. [2022-04-27 13:36:55,857 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:36:55,857 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:36:55,858 INFO L74 IsIncluded]: Start isIncluded. First operand has 38 states, 23 states have (on average 1.2608695652173914) internal successors, (29), 24 states have internal predecessors, (29), 10 states have call successors, (10), 5 states have call predecessors, (10), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand 38 states. [2022-04-27 13:36:55,858 INFO L87 Difference]: Start difference. First operand has 38 states, 23 states have (on average 1.2608695652173914) internal successors, (29), 24 states have internal predecessors, (29), 10 states have call successors, (10), 5 states have call predecessors, (10), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand 38 states. [2022-04-27 13:36:55,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:36:55,859 INFO L93 Difference]: Finished difference Result 38 states and 47 transitions. [2022-04-27 13:36:55,859 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 47 transitions. [2022-04-27 13:36:55,860 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:36:55,860 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:36:55,860 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 13:36:55,860 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 13:36:55,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 23 states have (on average 1.2608695652173914) internal successors, (29), 24 states have internal predecessors, (29), 10 states have call successors, (10), 5 states have call predecessors, (10), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-27 13:36:55,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 47 transitions. [2022-04-27 13:36:55,862 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 47 transitions. Word has length 20 [2022-04-27 13:36:55,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 13:36:55,862 INFO L495 AbstractCegarLoop]: Abstraction has 38 states and 47 transitions. [2022-04-27 13:36:55,862 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 13:36:55,862 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 47 transitions. [2022-04-27 13:36:55,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-04-27 13:36:55,863 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 13:36:55,863 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 13:36:55,890 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-04-27 13:36:56,078 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 13:36:56,079 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 13:36:56,079 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 13:36:56,079 INFO L85 PathProgramCache]: Analyzing trace with hash -784889968, now seen corresponding path program 1 times [2022-04-27 13:36:56,080 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 13:36:56,080 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [511541938] [2022-04-27 13:36:56,080 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:36:56,080 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 13:36:56,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:36:56,150 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 13:36:56,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:36:56,156 INFO L290 TraceCheckUtils]: 0: Hoare triple {773#(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(9, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {757#true} is VALID [2022-04-27 13:36:56,156 INFO L290 TraceCheckUtils]: 1: Hoare triple {757#true} assume true; {757#true} is VALID [2022-04-27 13:36:56,156 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {757#true} {757#true} #96#return; {757#true} is VALID [2022-04-27 13:36:56,157 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-27 13:36:56,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:36:56,161 INFO L290 TraceCheckUtils]: 0: Hoare triple {757#true} ~cond := #in~cond; {757#true} is VALID [2022-04-27 13:36:56,161 INFO L290 TraceCheckUtils]: 1: Hoare triple {757#true} assume !(0 == ~cond); {757#true} is VALID [2022-04-27 13:36:56,161 INFO L290 TraceCheckUtils]: 2: Hoare triple {757#true} assume true; {757#true} is VALID [2022-04-27 13:36:56,161 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {757#true} {757#true} #80#return; {757#true} is VALID [2022-04-27 13:36:56,161 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-04-27 13:36:56,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:36:56,167 INFO L290 TraceCheckUtils]: 0: Hoare triple {757#true} ~cond := #in~cond; {757#true} is VALID [2022-04-27 13:36:56,167 INFO L290 TraceCheckUtils]: 1: Hoare triple {757#true} assume !(0 == ~cond); {757#true} is VALID [2022-04-27 13:36:56,167 INFO L290 TraceCheckUtils]: 2: Hoare triple {757#true} assume true; {757#true} is VALID [2022-04-27 13:36:56,168 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {757#true} {766#(= (+ main_~A~0 (* (- 1) main_~r~0)) 0)} #82#return; {766#(= (+ main_~A~0 (* (- 1) main_~r~0)) 0)} is VALID [2022-04-27 13:36:56,168 INFO L272 TraceCheckUtils]: 0: Hoare triple {757#true} call ULTIMATE.init(); {773#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 13:36:56,169 INFO L290 TraceCheckUtils]: 1: Hoare triple {773#(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(9, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {757#true} is VALID [2022-04-27 13:36:56,169 INFO L290 TraceCheckUtils]: 2: Hoare triple {757#true} assume true; {757#true} is VALID [2022-04-27 13:36:56,169 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {757#true} {757#true} #96#return; {757#true} is VALID [2022-04-27 13:36:56,169 INFO L272 TraceCheckUtils]: 4: Hoare triple {757#true} call #t~ret8 := main(); {757#true} is VALID [2022-04-27 13:36:56,169 INFO L290 TraceCheckUtils]: 5: Hoare triple {757#true} havoc ~A~0;havoc ~B~0;havoc ~r~0;havoc ~d~0;havoc ~p~0;havoc ~q~0;~A~0 := #t~nondet4;havoc #t~nondet4;~B~0 := #t~nondet5;havoc #t~nondet5; {757#true} is VALID [2022-04-27 13:36:56,169 INFO L272 TraceCheckUtils]: 6: Hoare triple {757#true} call assume_abort_if_not((if ~B~0 % 4294967296 >= 1 then 1 else 0)); {757#true} is VALID [2022-04-27 13:36:56,170 INFO L290 TraceCheckUtils]: 7: Hoare triple {757#true} ~cond := #in~cond; {757#true} is VALID [2022-04-27 13:36:56,170 INFO L290 TraceCheckUtils]: 8: Hoare triple {757#true} assume !(0 == ~cond); {757#true} is VALID [2022-04-27 13:36:56,170 INFO L290 TraceCheckUtils]: 9: Hoare triple {757#true} assume true; {757#true} is VALID [2022-04-27 13:36:56,170 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {757#true} {757#true} #80#return; {757#true} is VALID [2022-04-27 13:36:56,170 INFO L290 TraceCheckUtils]: 11: Hoare triple {757#true} ~r~0 := ~A~0;~d~0 := ~B~0;~p~0 := 1;~q~0 := 0; {766#(= (+ main_~A~0 (* (- 1) main_~r~0)) 0)} is VALID [2022-04-27 13:36:56,171 INFO L290 TraceCheckUtils]: 12: Hoare triple {766#(= (+ main_~A~0 (* (- 1) main_~r~0)) 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {766#(= (+ main_~A~0 (* (- 1) main_~r~0)) 0)} is VALID [2022-04-27 13:36:56,171 INFO L290 TraceCheckUtils]: 13: Hoare triple {766#(= (+ main_~A~0 (* (- 1) main_~r~0)) 0)} assume !!(#t~post6 < 50);havoc #t~post6; {766#(= (+ main_~A~0 (* (- 1) main_~r~0)) 0)} is VALID [2022-04-27 13:36:56,171 INFO L272 TraceCheckUtils]: 14: Hoare triple {766#(= (+ main_~A~0 (* (- 1) main_~r~0)) 0)} call __VERIFIER_assert((if 0 == ~q~0 % 4294967296 then 1 else 0)); {757#true} is VALID [2022-04-27 13:36:56,171 INFO L290 TraceCheckUtils]: 15: Hoare triple {757#true} ~cond := #in~cond; {757#true} is VALID [2022-04-27 13:36:56,172 INFO L290 TraceCheckUtils]: 16: Hoare triple {757#true} assume !(0 == ~cond); {757#true} is VALID [2022-04-27 13:36:56,172 INFO L290 TraceCheckUtils]: 17: Hoare triple {757#true} assume true; {757#true} is VALID [2022-04-27 13:36:56,172 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {757#true} {766#(= (+ main_~A~0 (* (- 1) main_~r~0)) 0)} #82#return; {766#(= (+ main_~A~0 (* (- 1) main_~r~0)) 0)} is VALID [2022-04-27 13:36:56,173 INFO L272 TraceCheckUtils]: 19: Hoare triple {766#(= (+ main_~A~0 (* (- 1) main_~r~0)) 0)} call __VERIFIER_assert((if ~r~0 % 4294967296 == ~A~0 % 4294967296 then 1 else 0)); {771#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 13:36:56,174 INFO L290 TraceCheckUtils]: 20: Hoare triple {771#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {772#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-27 13:36:56,174 INFO L290 TraceCheckUtils]: 21: Hoare triple {772#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {758#false} is VALID [2022-04-27 13:36:56,174 INFO L290 TraceCheckUtils]: 22: Hoare triple {758#false} assume !false; {758#false} is VALID [2022-04-27 13:36:56,175 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 13:36:56,175 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 13:36:56,175 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [511541938] [2022-04-27 13:36:56,175 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [511541938] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 13:36:56,175 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 13:36:56,175 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-27 13:36:56,175 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [217905272] [2022-04-27 13:36:56,176 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 13:36:56,176 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 23 [2022-04-27 13:36:56,176 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 13:36:56,176 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 2.5) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-27 13:36:56,192 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 13:36:56,192 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-27 13:36:56,192 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 13:36:56,193 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-27 13:36:56,193 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-27 13:36:56,193 INFO L87 Difference]: Start difference. First operand 38 states and 47 transitions. Second operand has 6 states, 6 states have (on average 2.5) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-27 13:36:56,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:36:56,570 INFO L93 Difference]: Finished difference Result 52 states and 66 transitions. [2022-04-27 13:36:56,571 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-27 13:36:56,571 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 23 [2022-04-27 13:36:56,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 13:36:56,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.5) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-27 13:36:56,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 62 transitions. [2022-04-27 13:36:56,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.5) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-27 13:36:56,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 62 transitions. [2022-04-27 13:36:56,575 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 62 transitions. [2022-04-27 13:36:56,657 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 62 edges. 62 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 13:36:56,664 INFO L225 Difference]: With dead ends: 52 [2022-04-27 13:36:56,664 INFO L226 Difference]: Without dead ends: 50 [2022-04-27 13:36:56,665 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2022-04-27 13:36:56,671 INFO L413 NwaCegarLoop]: 39 mSDtfsCounter, 23 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 112 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 83 SdHoareTripleChecker+Invalid, 126 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 112 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-27 13:36:56,672 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 83 Invalid, 126 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 112 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-27 13:36:56,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2022-04-27 13:36:56,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 42. [2022-04-27 13:36:56,700 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 13:36:56,700 INFO L82 GeneralOperation]: Start isEquivalent. First operand 50 states. Second operand has 42 states, 26 states have (on average 1.2307692307692308) internal successors, (32), 27 states have internal predecessors, (32), 10 states have call successors, (10), 6 states have call predecessors, (10), 5 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-27 13:36:56,701 INFO L74 IsIncluded]: Start isIncluded. First operand 50 states. Second operand has 42 states, 26 states have (on average 1.2307692307692308) internal successors, (32), 27 states have internal predecessors, (32), 10 states have call successors, (10), 6 states have call predecessors, (10), 5 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-27 13:36:56,701 INFO L87 Difference]: Start difference. First operand 50 states. Second operand has 42 states, 26 states have (on average 1.2307692307692308) internal successors, (32), 27 states have internal predecessors, (32), 10 states have call successors, (10), 6 states have call predecessors, (10), 5 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-27 13:36:56,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:36:56,703 INFO L93 Difference]: Finished difference Result 50 states and 64 transitions. [2022-04-27 13:36:56,703 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 64 transitions. [2022-04-27 13:36:56,704 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:36:56,704 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:36:56,705 INFO L74 IsIncluded]: Start isIncluded. First operand has 42 states, 26 states have (on average 1.2307692307692308) internal successors, (32), 27 states have internal predecessors, (32), 10 states have call successors, (10), 6 states have call predecessors, (10), 5 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand 50 states. [2022-04-27 13:36:56,705 INFO L87 Difference]: Start difference. First operand has 42 states, 26 states have (on average 1.2307692307692308) internal successors, (32), 27 states have internal predecessors, (32), 10 states have call successors, (10), 6 states have call predecessors, (10), 5 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand 50 states. [2022-04-27 13:36:56,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:36:56,707 INFO L93 Difference]: Finished difference Result 50 states and 64 transitions. [2022-04-27 13:36:56,729 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 64 transitions. [2022-04-27 13:36:56,730 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:36:56,730 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:36:56,730 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 13:36:56,730 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 13:36:56,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 26 states have (on average 1.2307692307692308) internal successors, (32), 27 states have internal predecessors, (32), 10 states have call successors, (10), 6 states have call predecessors, (10), 5 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-27 13:36:56,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 50 transitions. [2022-04-27 13:36:56,732 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 50 transitions. Word has length 23 [2022-04-27 13:36:56,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 13:36:56,732 INFO L495 AbstractCegarLoop]: Abstraction has 42 states and 50 transitions. [2022-04-27 13:36:56,732 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-27 13:36:56,732 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 50 transitions. [2022-04-27 13:36:56,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-04-27 13:36:56,733 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 13:36:56,733 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] [2022-04-27 13:36:56,733 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-04-27 13:36:56,733 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 13:36:56,734 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 13:36:56,734 INFO L85 PathProgramCache]: Analyzing trace with hash -1024624683, now seen corresponding path program 1 times [2022-04-27 13:36:56,734 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 13:36:56,734 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [439589991] [2022-04-27 13:36:56,734 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:36:56,734 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 13:36:56,754 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 13:36:56,754 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1519042861] [2022-04-27 13:36:56,754 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:36:56,755 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 13:36:56,755 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 13:36:56,771 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 13:36:56,780 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 13:36:56,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:36:56,828 INFO L263 TraceCheckSpWp]: Trace formula consists of 100 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-27 13:36:56,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:36:56,841 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 13:36:56,977 INFO L272 TraceCheckUtils]: 0: Hoare triple {1018#true} call ULTIMATE.init(); {1018#true} is VALID [2022-04-27 13:36:56,978 INFO L290 TraceCheckUtils]: 1: Hoare triple {1018#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(9, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {1018#true} is VALID [2022-04-27 13:36:56,978 INFO L290 TraceCheckUtils]: 2: Hoare triple {1018#true} assume true; {1018#true} is VALID [2022-04-27 13:36:56,978 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1018#true} {1018#true} #96#return; {1018#true} is VALID [2022-04-27 13:36:56,978 INFO L272 TraceCheckUtils]: 4: Hoare triple {1018#true} call #t~ret8 := main(); {1018#true} is VALID [2022-04-27 13:36:56,978 INFO L290 TraceCheckUtils]: 5: Hoare triple {1018#true} havoc ~A~0;havoc ~B~0;havoc ~r~0;havoc ~d~0;havoc ~p~0;havoc ~q~0;~A~0 := #t~nondet4;havoc #t~nondet4;~B~0 := #t~nondet5;havoc #t~nondet5; {1018#true} is VALID [2022-04-27 13:36:56,979 INFO L272 TraceCheckUtils]: 6: Hoare triple {1018#true} call assume_abort_if_not((if ~B~0 % 4294967296 >= 1 then 1 else 0)); {1018#true} is VALID [2022-04-27 13:36:56,979 INFO L290 TraceCheckUtils]: 7: Hoare triple {1018#true} ~cond := #in~cond; {1018#true} is VALID [2022-04-27 13:36:56,979 INFO L290 TraceCheckUtils]: 8: Hoare triple {1018#true} assume !(0 == ~cond); {1018#true} is VALID [2022-04-27 13:36:56,979 INFO L290 TraceCheckUtils]: 9: Hoare triple {1018#true} assume true; {1018#true} is VALID [2022-04-27 13:36:56,979 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1018#true} {1018#true} #80#return; {1018#true} is VALID [2022-04-27 13:36:56,980 INFO L290 TraceCheckUtils]: 11: Hoare triple {1018#true} ~r~0 := ~A~0;~d~0 := ~B~0;~p~0 := 1;~q~0 := 0; {1056#(and (= main_~B~0 main_~d~0) (= main_~p~0 1))} is VALID [2022-04-27 13:36:56,980 INFO L290 TraceCheckUtils]: 12: Hoare triple {1056#(and (= main_~B~0 main_~d~0) (= main_~p~0 1))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {1056#(and (= main_~B~0 main_~d~0) (= main_~p~0 1))} is VALID [2022-04-27 13:36:56,981 INFO L290 TraceCheckUtils]: 13: Hoare triple {1056#(and (= main_~B~0 main_~d~0) (= main_~p~0 1))} assume !!(#t~post6 < 50);havoc #t~post6; {1056#(and (= main_~B~0 main_~d~0) (= main_~p~0 1))} is VALID [2022-04-27 13:36:56,981 INFO L272 TraceCheckUtils]: 14: Hoare triple {1056#(and (= main_~B~0 main_~d~0) (= main_~p~0 1))} call __VERIFIER_assert((if 0 == ~q~0 % 4294967296 then 1 else 0)); {1018#true} is VALID [2022-04-27 13:36:56,981 INFO L290 TraceCheckUtils]: 15: Hoare triple {1018#true} ~cond := #in~cond; {1018#true} is VALID [2022-04-27 13:36:56,981 INFO L290 TraceCheckUtils]: 16: Hoare triple {1018#true} assume !(0 == ~cond); {1018#true} is VALID [2022-04-27 13:36:56,981 INFO L290 TraceCheckUtils]: 17: Hoare triple {1018#true} assume true; {1018#true} is VALID [2022-04-27 13:36:56,983 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {1018#true} {1056#(and (= main_~B~0 main_~d~0) (= main_~p~0 1))} #82#return; {1056#(and (= main_~B~0 main_~d~0) (= main_~p~0 1))} is VALID [2022-04-27 13:36:56,983 INFO L272 TraceCheckUtils]: 19: Hoare triple {1056#(and (= main_~B~0 main_~d~0) (= main_~p~0 1))} call __VERIFIER_assert((if ~r~0 % 4294967296 == ~A~0 % 4294967296 then 1 else 0)); {1018#true} is VALID [2022-04-27 13:36:56,984 INFO L290 TraceCheckUtils]: 20: Hoare triple {1018#true} ~cond := #in~cond; {1018#true} is VALID [2022-04-27 13:36:56,984 INFO L290 TraceCheckUtils]: 21: Hoare triple {1018#true} assume !(0 == ~cond); {1018#true} is VALID [2022-04-27 13:36:56,984 INFO L290 TraceCheckUtils]: 22: Hoare triple {1018#true} assume true; {1018#true} is VALID [2022-04-27 13:36:56,992 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {1018#true} {1056#(and (= main_~B~0 main_~d~0) (= main_~p~0 1))} #84#return; {1056#(and (= main_~B~0 main_~d~0) (= main_~p~0 1))} is VALID [2022-04-27 13:36:56,993 INFO L272 TraceCheckUtils]: 24: Hoare triple {1056#(and (= main_~B~0 main_~d~0) (= main_~p~0 1))} call __VERIFIER_assert((if ~d~0 % 4294967296 == ~B~0 * ~p~0 % 4294967296 then 1 else 0)); {1096#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 13:36:56,993 INFO L290 TraceCheckUtils]: 25: Hoare triple {1096#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1100#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 13:36:56,994 INFO L290 TraceCheckUtils]: 26: Hoare triple {1100#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1019#false} is VALID [2022-04-27 13:36:56,994 INFO L290 TraceCheckUtils]: 27: Hoare triple {1019#false} assume !false; {1019#false} is VALID [2022-04-27 13:36:56,994 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 13:36:56,994 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-27 13:36:56,994 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 13:36:56,994 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [439589991] [2022-04-27 13:36:56,995 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 13:36:56,995 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1519042861] [2022-04-27 13:36:56,995 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1519042861] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 13:36:56,995 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 13:36:56,995 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-27 13:36:56,995 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1481494859] [2022-04-27 13:36:56,995 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 13:36:56,996 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), 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 28 [2022-04-27 13:36:56,996 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 13:36:56,996 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), 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 13:36:57,016 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 13:36:57,016 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-27 13:36:57,017 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 13:36:57,017 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-27 13:36:57,017 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-27 13:36:57,017 INFO L87 Difference]: Start difference. First operand 42 states and 50 transitions. Second operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 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 13:36:59,193 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 13:36:59,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:36:59,413 INFO L93 Difference]: Finished difference Result 59 states and 75 transitions. [2022-04-27 13:36:59,413 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-27 13:36:59,413 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), 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 28 [2022-04-27 13:36:59,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 13:36:59,413 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), 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 13:36:59,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 69 transitions. [2022-04-27 13:36:59,415 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), 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 13:36:59,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 69 transitions. [2022-04-27 13:36:59,416 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 69 transitions. [2022-04-27 13:36:59,492 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 13:36:59,494 INFO L225 Difference]: With dead ends: 59 [2022-04-27 13:36:59,494 INFO L226 Difference]: Without dead ends: 56 [2022-04-27 13:36:59,494 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 24 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 13:36:59,495 INFO L413 NwaCegarLoop]: 43 mSDtfsCounter, 10 mSDsluCounter, 97 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 2 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 140 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2022-04-27 13:36:59,495 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 140 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 47 Invalid, 1 Unknown, 0 Unchecked, 2.2s Time] [2022-04-27 13:36:59,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2022-04-27 13:36:59,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2022-04-27 13:36:59,508 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 13:36:59,509 INFO L82 GeneralOperation]: Start isEquivalent. First operand 56 states. Second operand has 56 states, 33 states have (on average 1.2727272727272727) internal successors, (42), 35 states have internal predecessors, (42), 16 states have call successors, (16), 7 states have call predecessors, (16), 6 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-27 13:36:59,509 INFO L74 IsIncluded]: Start isIncluded. First operand 56 states. Second operand has 56 states, 33 states have (on average 1.2727272727272727) internal successors, (42), 35 states have internal predecessors, (42), 16 states have call successors, (16), 7 states have call predecessors, (16), 6 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-27 13:36:59,509 INFO L87 Difference]: Start difference. First operand 56 states. Second operand has 56 states, 33 states have (on average 1.2727272727272727) internal successors, (42), 35 states have internal predecessors, (42), 16 states have call successors, (16), 7 states have call predecessors, (16), 6 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-27 13:36:59,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:36:59,512 INFO L93 Difference]: Finished difference Result 56 states and 71 transitions. [2022-04-27 13:36:59,512 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 71 transitions. [2022-04-27 13:36:59,523 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:36:59,524 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:36:59,524 INFO L74 IsIncluded]: Start isIncluded. First operand has 56 states, 33 states have (on average 1.2727272727272727) internal successors, (42), 35 states have internal predecessors, (42), 16 states have call successors, (16), 7 states have call predecessors, (16), 6 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) Second operand 56 states. [2022-04-27 13:36:59,524 INFO L87 Difference]: Start difference. First operand has 56 states, 33 states have (on average 1.2727272727272727) internal successors, (42), 35 states have internal predecessors, (42), 16 states have call successors, (16), 7 states have call predecessors, (16), 6 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) Second operand 56 states. [2022-04-27 13:36:59,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:36:59,527 INFO L93 Difference]: Finished difference Result 56 states and 71 transitions. [2022-04-27 13:36:59,527 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 71 transitions. [2022-04-27 13:36:59,528 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:36:59,528 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:36:59,528 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 13:36:59,528 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 13:36:59,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 33 states have (on average 1.2727272727272727) internal successors, (42), 35 states have internal predecessors, (42), 16 states have call successors, (16), 7 states have call predecessors, (16), 6 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-27 13:36:59,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 71 transitions. [2022-04-27 13:36:59,530 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 71 transitions. Word has length 28 [2022-04-27 13:36:59,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 13:36:59,530 INFO L495 AbstractCegarLoop]: Abstraction has 56 states and 71 transitions. [2022-04-27 13:36:59,531 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), 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 13:36:59,531 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 71 transitions. [2022-04-27 13:36:59,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-04-27 13:36:59,531 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 13:36:59,532 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 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 13:36:59,558 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-04-27 13:36:59,749 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 13:36:59,749 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 13:36:59,750 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 13:36:59,750 INFO L85 PathProgramCache]: Analyzing trace with hash 1301357193, now seen corresponding path program 1 times [2022-04-27 13:36:59,750 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 13:36:59,750 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1360490056] [2022-04-27 13:36:59,750 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:36:59,750 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 13:36:59,767 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 13:36:59,767 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [401583563] [2022-04-27 13:36:59,767 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:36:59,768 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 13:36:59,768 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 13:36:59,769 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 13:36:59,788 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 13:36:59,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:36:59,839 INFO L263 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-27 13:36:59,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:36:59,853 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 13:37:00,069 INFO L272 TraceCheckUtils]: 0: Hoare triple {1386#true} call ULTIMATE.init(); {1386#true} is VALID [2022-04-27 13:37:00,069 INFO L290 TraceCheckUtils]: 1: Hoare triple {1386#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(9, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {1394#(<= ~counter~0 0)} is VALID [2022-04-27 13:37:00,070 INFO L290 TraceCheckUtils]: 2: Hoare triple {1394#(<= ~counter~0 0)} assume true; {1394#(<= ~counter~0 0)} is VALID [2022-04-27 13:37:00,070 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1394#(<= ~counter~0 0)} {1386#true} #96#return; {1394#(<= ~counter~0 0)} is VALID [2022-04-27 13:37:00,071 INFO L272 TraceCheckUtils]: 4: Hoare triple {1394#(<= ~counter~0 0)} call #t~ret8 := main(); {1394#(<= ~counter~0 0)} is VALID [2022-04-27 13:37:00,072 INFO L290 TraceCheckUtils]: 5: Hoare triple {1394#(<= ~counter~0 0)} havoc ~A~0;havoc ~B~0;havoc ~r~0;havoc ~d~0;havoc ~p~0;havoc ~q~0;~A~0 := #t~nondet4;havoc #t~nondet4;~B~0 := #t~nondet5;havoc #t~nondet5; {1394#(<= ~counter~0 0)} is VALID [2022-04-27 13:37:00,072 INFO L272 TraceCheckUtils]: 6: Hoare triple {1394#(<= ~counter~0 0)} call assume_abort_if_not((if ~B~0 % 4294967296 >= 1 then 1 else 0)); {1394#(<= ~counter~0 0)} is VALID [2022-04-27 13:37:00,072 INFO L290 TraceCheckUtils]: 7: Hoare triple {1394#(<= ~counter~0 0)} ~cond := #in~cond; {1394#(<= ~counter~0 0)} is VALID [2022-04-27 13:37:00,073 INFO L290 TraceCheckUtils]: 8: Hoare triple {1394#(<= ~counter~0 0)} assume !(0 == ~cond); {1394#(<= ~counter~0 0)} is VALID [2022-04-27 13:37:00,073 INFO L290 TraceCheckUtils]: 9: Hoare triple {1394#(<= ~counter~0 0)} assume true; {1394#(<= ~counter~0 0)} is VALID [2022-04-27 13:37:00,073 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1394#(<= ~counter~0 0)} {1394#(<= ~counter~0 0)} #80#return; {1394#(<= ~counter~0 0)} is VALID [2022-04-27 13:37:00,074 INFO L290 TraceCheckUtils]: 11: Hoare triple {1394#(<= ~counter~0 0)} ~r~0 := ~A~0;~d~0 := ~B~0;~p~0 := 1;~q~0 := 0; {1394#(<= ~counter~0 0)} is VALID [2022-04-27 13:37:00,074 INFO L290 TraceCheckUtils]: 12: Hoare triple {1394#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {1428#(<= ~counter~0 1)} is VALID [2022-04-27 13:37:00,075 INFO L290 TraceCheckUtils]: 13: Hoare triple {1428#(<= ~counter~0 1)} assume !!(#t~post6 < 50);havoc #t~post6; {1428#(<= ~counter~0 1)} is VALID [2022-04-27 13:37:00,075 INFO L272 TraceCheckUtils]: 14: Hoare triple {1428#(<= ~counter~0 1)} call __VERIFIER_assert((if 0 == ~q~0 % 4294967296 then 1 else 0)); {1428#(<= ~counter~0 1)} is VALID [2022-04-27 13:37:00,075 INFO L290 TraceCheckUtils]: 15: Hoare triple {1428#(<= ~counter~0 1)} ~cond := #in~cond; {1428#(<= ~counter~0 1)} is VALID [2022-04-27 13:37:00,076 INFO L290 TraceCheckUtils]: 16: Hoare triple {1428#(<= ~counter~0 1)} assume !(0 == ~cond); {1428#(<= ~counter~0 1)} is VALID [2022-04-27 13:37:00,076 INFO L290 TraceCheckUtils]: 17: Hoare triple {1428#(<= ~counter~0 1)} assume true; {1428#(<= ~counter~0 1)} is VALID [2022-04-27 13:37:00,076 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {1428#(<= ~counter~0 1)} {1428#(<= ~counter~0 1)} #82#return; {1428#(<= ~counter~0 1)} is VALID [2022-04-27 13:37:00,077 INFO L272 TraceCheckUtils]: 19: Hoare triple {1428#(<= ~counter~0 1)} call __VERIFIER_assert((if ~r~0 % 4294967296 == ~A~0 % 4294967296 then 1 else 0)); {1428#(<= ~counter~0 1)} is VALID [2022-04-27 13:37:00,077 INFO L290 TraceCheckUtils]: 20: Hoare triple {1428#(<= ~counter~0 1)} ~cond := #in~cond; {1428#(<= ~counter~0 1)} is VALID [2022-04-27 13:37:00,078 INFO L290 TraceCheckUtils]: 21: Hoare triple {1428#(<= ~counter~0 1)} assume !(0 == ~cond); {1428#(<= ~counter~0 1)} is VALID [2022-04-27 13:37:00,078 INFO L290 TraceCheckUtils]: 22: Hoare triple {1428#(<= ~counter~0 1)} assume true; {1428#(<= ~counter~0 1)} is VALID [2022-04-27 13:37:00,078 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {1428#(<= ~counter~0 1)} {1428#(<= ~counter~0 1)} #84#return; {1428#(<= ~counter~0 1)} is VALID [2022-04-27 13:37:00,079 INFO L272 TraceCheckUtils]: 24: Hoare triple {1428#(<= ~counter~0 1)} call __VERIFIER_assert((if ~d~0 % 4294967296 == ~B~0 * ~p~0 % 4294967296 then 1 else 0)); {1428#(<= ~counter~0 1)} is VALID [2022-04-27 13:37:00,079 INFO L290 TraceCheckUtils]: 25: Hoare triple {1428#(<= ~counter~0 1)} ~cond := #in~cond; {1428#(<= ~counter~0 1)} is VALID [2022-04-27 13:37:00,080 INFO L290 TraceCheckUtils]: 26: Hoare triple {1428#(<= ~counter~0 1)} assume !(0 == ~cond); {1428#(<= ~counter~0 1)} is VALID [2022-04-27 13:37:00,080 INFO L290 TraceCheckUtils]: 27: Hoare triple {1428#(<= ~counter~0 1)} assume true; {1428#(<= ~counter~0 1)} is VALID [2022-04-27 13:37:00,080 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {1428#(<= ~counter~0 1)} {1428#(<= ~counter~0 1)} #86#return; {1428#(<= ~counter~0 1)} is VALID [2022-04-27 13:37:00,081 INFO L290 TraceCheckUtils]: 29: Hoare triple {1428#(<= ~counter~0 1)} assume !(~r~0 % 4294967296 >= ~d~0 % 4294967296); {1428#(<= ~counter~0 1)} is VALID [2022-04-27 13:37:00,081 INFO L290 TraceCheckUtils]: 30: Hoare triple {1428#(<= ~counter~0 1)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {1483#(<= |main_#t~post7| 1)} is VALID [2022-04-27 13:37:00,082 INFO L290 TraceCheckUtils]: 31: Hoare triple {1483#(<= |main_#t~post7| 1)} assume !(#t~post7 < 50);havoc #t~post7; {1387#false} is VALID [2022-04-27 13:37:00,082 INFO L272 TraceCheckUtils]: 32: Hoare triple {1387#false} call __VERIFIER_assert((if ~A~0 % 4294967296 == (~d~0 * ~q~0 + ~r~0) % 4294967296 then 1 else 0)); {1387#false} is VALID [2022-04-27 13:37:00,082 INFO L290 TraceCheckUtils]: 33: Hoare triple {1387#false} ~cond := #in~cond; {1387#false} is VALID [2022-04-27 13:37:00,082 INFO L290 TraceCheckUtils]: 34: Hoare triple {1387#false} assume 0 == ~cond; {1387#false} is VALID [2022-04-27 13:37:00,082 INFO L290 TraceCheckUtils]: 35: Hoare triple {1387#false} assume !false; {1387#false} is VALID [2022-04-27 13:37:00,082 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-04-27 13:37:00,082 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-27 13:37:00,082 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 13:37:00,083 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1360490056] [2022-04-27 13:37:00,083 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 13:37:00,083 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [401583563] [2022-04-27 13:37:00,083 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [401583563] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 13:37:00,083 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 13:37:00,083 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-27 13:37:00,083 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1428044075] [2022-04-27 13:37:00,083 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 13:37:00,084 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), 4 states have call successors, (7), 4 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 3 states have call successors, (5) Word has length 36 [2022-04-27 13:37:00,084 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 13:37:00,084 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), 4 states have call successors, (7), 4 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 3 states have call successors, (5) [2022-04-27 13:37:00,117 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 13:37:00,117 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-27 13:37:00,117 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 13:37:00,118 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-27 13:37:00,118 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-04-27 13:37:00,118 INFO L87 Difference]: Start difference. First operand 56 states and 71 transitions. Second operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 4 states have call successors, (7), 4 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 3 states have call successors, (5) [2022-04-27 13:37:00,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:37:00,272 INFO L93 Difference]: Finished difference Result 76 states and 87 transitions. [2022-04-27 13:37:00,272 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-27 13:37:00,272 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), 4 states have call successors, (7), 4 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 3 states have call successors, (5) Word has length 36 [2022-04-27 13:37:00,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 13:37:00,272 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), 4 states have call successors, (7), 4 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 3 states have call successors, (5) [2022-04-27 13:37:00,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 65 transitions. [2022-04-27 13:37:00,273 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), 4 states have call successors, (7), 4 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 3 states have call successors, (5) [2022-04-27 13:37:00,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 65 transitions. [2022-04-27 13:37:00,274 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 65 transitions. [2022-04-27 13:37:00,322 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 65 edges. 65 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 13:37:00,324 INFO L225 Difference]: With dead ends: 76 [2022-04-27 13:37:00,324 INFO L226 Difference]: Without dead ends: 69 [2022-04-27 13:37:00,324 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 32 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 13:37:00,325 INFO L413 NwaCegarLoop]: 42 mSDtfsCounter, 7 mSDsluCounter, 94 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 136 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 13:37:00,325 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 136 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 13:37:00,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2022-04-27 13:37:00,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 68. [2022-04-27 13:37:00,338 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 13:37:00,338 INFO L82 GeneralOperation]: Start isEquivalent. First operand 69 states. Second operand has 68 states, 42 states have (on average 1.1904761904761905) internal successors, (50), 44 states have internal predecessors, (50), 16 states have call successors, (16), 10 states have call predecessors, (16), 9 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-27 13:37:00,338 INFO L74 IsIncluded]: Start isIncluded. First operand 69 states. Second operand has 68 states, 42 states have (on average 1.1904761904761905) internal successors, (50), 44 states have internal predecessors, (50), 16 states have call successors, (16), 10 states have call predecessors, (16), 9 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-27 13:37:00,339 INFO L87 Difference]: Start difference. First operand 69 states. Second operand has 68 states, 42 states have (on average 1.1904761904761905) internal successors, (50), 44 states have internal predecessors, (50), 16 states have call successors, (16), 10 states have call predecessors, (16), 9 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-27 13:37:00,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:37:00,340 INFO L93 Difference]: Finished difference Result 69 states and 80 transitions. [2022-04-27 13:37:00,340 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 80 transitions. [2022-04-27 13:37:00,341 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:37:00,341 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:37:00,341 INFO L74 IsIncluded]: Start isIncluded. First operand has 68 states, 42 states have (on average 1.1904761904761905) internal successors, (50), 44 states have internal predecessors, (50), 16 states have call successors, (16), 10 states have call predecessors, (16), 9 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) Second operand 69 states. [2022-04-27 13:37:00,341 INFO L87 Difference]: Start difference. First operand has 68 states, 42 states have (on average 1.1904761904761905) internal successors, (50), 44 states have internal predecessors, (50), 16 states have call successors, (16), 10 states have call predecessors, (16), 9 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) Second operand 69 states. [2022-04-27 13:37:00,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:37:00,343 INFO L93 Difference]: Finished difference Result 69 states and 80 transitions. [2022-04-27 13:37:00,343 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 80 transitions. [2022-04-27 13:37:00,343 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:37:00,343 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:37:00,343 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 13:37:00,343 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 13:37:00,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 42 states have (on average 1.1904761904761905) internal successors, (50), 44 states have internal predecessors, (50), 16 states have call successors, (16), 10 states have call predecessors, (16), 9 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-27 13:37:00,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 79 transitions. [2022-04-27 13:37:00,345 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 79 transitions. Word has length 36 [2022-04-27 13:37:00,345 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 13:37:00,345 INFO L495 AbstractCegarLoop]: Abstraction has 68 states and 79 transitions. [2022-04-27 13:37:00,345 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), 4 states have call successors, (7), 4 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 3 states have call successors, (5) [2022-04-27 13:37:00,345 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 79 transitions. [2022-04-27 13:37:00,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-04-27 13:37:00,346 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 13:37:00,346 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 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 13:37:00,365 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 13:37:00,563 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 13:37:00,564 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 13:37:00,564 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 13:37:00,564 INFO L85 PathProgramCache]: Analyzing trace with hash 1303085071, now seen corresponding path program 1 times [2022-04-27 13:37:00,564 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 13:37:00,564 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1988397828] [2022-04-27 13:37:00,564 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:37:00,564 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 13:37:00,577 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 13:37:00,578 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [848488070] [2022-04-27 13:37:00,578 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:37:00,578 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 13:37:00,578 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 13:37:00,579 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 13:37:00,584 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 13:37:00,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:37:00,622 INFO L263 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 10 conjunts are in the unsatisfiable core [2022-04-27 13:37:00,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:37:00,635 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 13:37:01,064 INFO L272 TraceCheckUtils]: 0: Hoare triple {1839#true} call ULTIMATE.init(); {1839#true} is VALID [2022-04-27 13:37:01,064 INFO L290 TraceCheckUtils]: 1: Hoare triple {1839#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(9, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {1839#true} is VALID [2022-04-27 13:37:01,064 INFO L290 TraceCheckUtils]: 2: Hoare triple {1839#true} assume true; {1839#true} is VALID [2022-04-27 13:37:01,065 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1839#true} {1839#true} #96#return; {1839#true} is VALID [2022-04-27 13:37:01,065 INFO L272 TraceCheckUtils]: 4: Hoare triple {1839#true} call #t~ret8 := main(); {1839#true} is VALID [2022-04-27 13:37:01,065 INFO L290 TraceCheckUtils]: 5: Hoare triple {1839#true} havoc ~A~0;havoc ~B~0;havoc ~r~0;havoc ~d~0;havoc ~p~0;havoc ~q~0;~A~0 := #t~nondet4;havoc #t~nondet4;~B~0 := #t~nondet5;havoc #t~nondet5; {1839#true} is VALID [2022-04-27 13:37:01,065 INFO L272 TraceCheckUtils]: 6: Hoare triple {1839#true} call assume_abort_if_not((if ~B~0 % 4294967296 >= 1 then 1 else 0)); {1839#true} is VALID [2022-04-27 13:37:01,065 INFO L290 TraceCheckUtils]: 7: Hoare triple {1839#true} ~cond := #in~cond; {1839#true} is VALID [2022-04-27 13:37:01,065 INFO L290 TraceCheckUtils]: 8: Hoare triple {1839#true} assume !(0 == ~cond); {1839#true} is VALID [2022-04-27 13:37:01,065 INFO L290 TraceCheckUtils]: 9: Hoare triple {1839#true} assume true; {1839#true} is VALID [2022-04-27 13:37:01,065 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1839#true} {1839#true} #80#return; {1839#true} is VALID [2022-04-27 13:37:01,067 INFO L290 TraceCheckUtils]: 11: Hoare triple {1839#true} ~r~0 := ~A~0;~d~0 := ~B~0;~p~0 := 1;~q~0 := 0; {1877#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 main_~d~0))} is VALID [2022-04-27 13:37:01,067 INFO L290 TraceCheckUtils]: 12: Hoare triple {1877#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 main_~d~0))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {1877#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 main_~d~0))} is VALID [2022-04-27 13:37:01,067 INFO L290 TraceCheckUtils]: 13: Hoare triple {1877#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 main_~d~0))} assume !!(#t~post6 < 50);havoc #t~post6; {1877#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 main_~d~0))} is VALID [2022-04-27 13:37:01,067 INFO L272 TraceCheckUtils]: 14: Hoare triple {1877#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 main_~d~0))} call __VERIFIER_assert((if 0 == ~q~0 % 4294967296 then 1 else 0)); {1839#true} is VALID [2022-04-27 13:37:01,068 INFO L290 TraceCheckUtils]: 15: Hoare triple {1839#true} ~cond := #in~cond; {1839#true} is VALID [2022-04-27 13:37:01,068 INFO L290 TraceCheckUtils]: 16: Hoare triple {1839#true} assume !(0 == ~cond); {1839#true} is VALID [2022-04-27 13:37:01,068 INFO L290 TraceCheckUtils]: 17: Hoare triple {1839#true} assume true; {1839#true} is VALID [2022-04-27 13:37:01,068 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {1839#true} {1877#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 main_~d~0))} #82#return; {1877#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 main_~d~0))} is VALID [2022-04-27 13:37:01,068 INFO L272 TraceCheckUtils]: 19: Hoare triple {1877#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 main_~d~0))} call __VERIFIER_assert((if ~r~0 % 4294967296 == ~A~0 % 4294967296 then 1 else 0)); {1839#true} is VALID [2022-04-27 13:37:01,069 INFO L290 TraceCheckUtils]: 20: Hoare triple {1839#true} ~cond := #in~cond; {1839#true} is VALID [2022-04-27 13:37:01,069 INFO L290 TraceCheckUtils]: 21: Hoare triple {1839#true} assume !(0 == ~cond); {1839#true} is VALID [2022-04-27 13:37:01,069 INFO L290 TraceCheckUtils]: 22: Hoare triple {1839#true} assume true; {1839#true} is VALID [2022-04-27 13:37:01,071 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {1839#true} {1877#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 main_~d~0))} #84#return; {1877#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 main_~d~0))} is VALID [2022-04-27 13:37:01,071 INFO L272 TraceCheckUtils]: 24: Hoare triple {1877#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 main_~d~0))} call __VERIFIER_assert((if ~d~0 % 4294967296 == ~B~0 * ~p~0 % 4294967296 then 1 else 0)); {1839#true} is VALID [2022-04-27 13:37:01,071 INFO L290 TraceCheckUtils]: 25: Hoare triple {1839#true} ~cond := #in~cond; {1839#true} is VALID [2022-04-27 13:37:01,071 INFO L290 TraceCheckUtils]: 26: Hoare triple {1839#true} assume !(0 == ~cond); {1839#true} is VALID [2022-04-27 13:37:01,071 INFO L290 TraceCheckUtils]: 27: Hoare triple {1839#true} assume true; {1839#true} is VALID [2022-04-27 13:37:01,072 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {1839#true} {1877#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 main_~d~0))} #86#return; {1877#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 main_~d~0))} is VALID [2022-04-27 13:37:01,072 INFO L290 TraceCheckUtils]: 29: Hoare triple {1877#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 main_~d~0))} assume !(~r~0 % 4294967296 >= ~d~0 % 4294967296); {1932#(and (= main_~A~0 main_~r~0) (not (<= (mod main_~B~0 4294967296) (mod main_~r~0 4294967296))) (= main_~q~0 0))} is VALID [2022-04-27 13:37:01,073 INFO L290 TraceCheckUtils]: 30: Hoare triple {1932#(and (= main_~A~0 main_~r~0) (not (<= (mod main_~B~0 4294967296) (mod main_~r~0 4294967296))) (= main_~q~0 0))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {1932#(and (= main_~A~0 main_~r~0) (not (<= (mod main_~B~0 4294967296) (mod main_~r~0 4294967296))) (= main_~q~0 0))} is VALID [2022-04-27 13:37:01,075 INFO L290 TraceCheckUtils]: 31: Hoare triple {1932#(and (= main_~A~0 main_~r~0) (not (<= (mod main_~B~0 4294967296) (mod main_~r~0 4294967296))) (= main_~q~0 0))} assume !!(#t~post7 < 50);havoc #t~post7; {1932#(and (= main_~A~0 main_~r~0) (not (<= (mod main_~B~0 4294967296) (mod main_~r~0 4294967296))) (= main_~q~0 0))} is VALID [2022-04-27 13:37:01,076 INFO L272 TraceCheckUtils]: 32: Hoare triple {1932#(and (= main_~A~0 main_~r~0) (not (<= (mod main_~B~0 4294967296) (mod main_~r~0 4294967296))) (= main_~q~0 0))} call __VERIFIER_assert((if ~A~0 % 4294967296 == (~q~0 * ~B~0 + ~r~0) % 4294967296 then 1 else 0)); {1942#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 13:37:01,076 INFO L290 TraceCheckUtils]: 33: Hoare triple {1942#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1946#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 13:37:01,077 INFO L290 TraceCheckUtils]: 34: Hoare triple {1946#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1840#false} is VALID [2022-04-27 13:37:01,077 INFO L290 TraceCheckUtils]: 35: Hoare triple {1840#false} assume !false; {1840#false} is VALID [2022-04-27 13:37:01,086 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-04-27 13:37:01,087 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-27 13:37:01,087 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 13:37:01,087 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1988397828] [2022-04-27 13:37:01,087 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 13:37:01,087 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [848488070] [2022-04-27 13:37:01,087 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [848488070] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 13:37:01,087 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 13:37:01,087 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-27 13:37:01,087 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1563663286] [2022-04-27 13:37:01,087 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 13:37:01,088 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 3 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 36 [2022-04-27 13:37:01,088 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 13:37:01,088 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 3 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-27 13:37:01,109 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 13:37:01,109 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-27 13:37:01,110 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 13:37:01,110 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-27 13:37:01,110 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-27 13:37:01,110 INFO L87 Difference]: Start difference. First operand 68 states and 79 transitions. Second operand has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 3 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-27 13:37:07,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:37:07,078 INFO L93 Difference]: Finished difference Result 82 states and 98 transitions. [2022-04-27 13:37:07,079 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-27 13:37:07,079 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 3 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 36 [2022-04-27 13:37:07,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 13:37:07,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 3 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-27 13:37:07,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 80 transitions. [2022-04-27 13:37:07,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 3 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-27 13:37:07,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 80 transitions. [2022-04-27 13:37:07,085 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 80 transitions. [2022-04-27 13:37:07,307 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 80 edges. 80 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 13:37:07,310 INFO L225 Difference]: With dead ends: 82 [2022-04-27 13:37:07,310 INFO L226 Difference]: Without dead ends: 79 [2022-04-27 13:37:07,310 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-04-27 13:37:07,311 INFO L413 NwaCegarLoop]: 41 mSDtfsCounter, 14 mSDsluCounter, 121 mSDsCounter, 0 mSdLazyCounter, 93 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 162 SdHoareTripleChecker+Invalid, 102 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 93 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-04-27 13:37:07,311 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 162 Invalid, 102 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 93 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-04-27 13:37:07,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2022-04-27 13:37:07,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 78. [2022-04-27 13:37:07,340 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 13:37:07,340 INFO L82 GeneralOperation]: Start isEquivalent. First operand 79 states. Second operand has 78 states, 49 states have (on average 1.2040816326530612) internal successors, (59), 51 states have internal predecessors, (59), 18 states have call successors, (18), 11 states have call predecessors, (18), 10 states have return successors, (16), 15 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-27 13:37:07,341 INFO L74 IsIncluded]: Start isIncluded. First operand 79 states. Second operand has 78 states, 49 states have (on average 1.2040816326530612) internal successors, (59), 51 states have internal predecessors, (59), 18 states have call successors, (18), 11 states have call predecessors, (18), 10 states have return successors, (16), 15 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-27 13:37:07,341 INFO L87 Difference]: Start difference. First operand 79 states. Second operand has 78 states, 49 states have (on average 1.2040816326530612) internal successors, (59), 51 states have internal predecessors, (59), 18 states have call successors, (18), 11 states have call predecessors, (18), 10 states have return successors, (16), 15 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-27 13:37:07,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:37:07,350 INFO L93 Difference]: Finished difference Result 79 states and 94 transitions. [2022-04-27 13:37:07,350 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 94 transitions. [2022-04-27 13:37:07,350 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:37:07,351 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:37:07,351 INFO L74 IsIncluded]: Start isIncluded. First operand has 78 states, 49 states have (on average 1.2040816326530612) internal successors, (59), 51 states have internal predecessors, (59), 18 states have call successors, (18), 11 states have call predecessors, (18), 10 states have return successors, (16), 15 states have call predecessors, (16), 16 states have call successors, (16) Second operand 79 states. [2022-04-27 13:37:07,351 INFO L87 Difference]: Start difference. First operand has 78 states, 49 states have (on average 1.2040816326530612) internal successors, (59), 51 states have internal predecessors, (59), 18 states have call successors, (18), 11 states have call predecessors, (18), 10 states have return successors, (16), 15 states have call predecessors, (16), 16 states have call successors, (16) Second operand 79 states. [2022-04-27 13:37:07,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:37:07,353 INFO L93 Difference]: Finished difference Result 79 states and 94 transitions. [2022-04-27 13:37:07,353 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 94 transitions. [2022-04-27 13:37:07,354 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:37:07,354 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:37:07,354 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 13:37:07,354 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 13:37:07,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 49 states have (on average 1.2040816326530612) internal successors, (59), 51 states have internal predecessors, (59), 18 states have call successors, (18), 11 states have call predecessors, (18), 10 states have return successors, (16), 15 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-27 13:37:07,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 93 transitions. [2022-04-27 13:37:07,357 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 93 transitions. Word has length 36 [2022-04-27 13:37:07,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 13:37:07,357 INFO L495 AbstractCegarLoop]: Abstraction has 78 states and 93 transitions. [2022-04-27 13:37:07,357 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 3 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-27 13:37:07,357 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 93 transitions. [2022-04-27 13:37:07,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-04-27 13:37:07,358 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 13:37:07,358 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 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] [2022-04-27 13:37:07,378 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 13:37:07,574 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 13:37:07,574 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 13:37:07,575 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 13:37:07,575 INFO L85 PathProgramCache]: Analyzing trace with hash -1189074514, now seen corresponding path program 1 times [2022-04-27 13:37:07,575 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 13:37:07,575 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1688291932] [2022-04-27 13:37:07,575 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:37:07,575 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 13:37:07,587 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 13:37:07,587 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [115232671] [2022-04-27 13:37:07,587 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:37:07,587 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 13:37:07,587 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 13:37:07,588 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 13:37:07,601 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 13:37:07,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:37:07,644 INFO L263 TraceCheckSpWp]: Trace formula consists of 124 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-27 13:37:07,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:37:07,654 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 13:37:07,844 INFO L272 TraceCheckUtils]: 0: Hoare triple {2338#true} call ULTIMATE.init(); {2338#true} is VALID [2022-04-27 13:37:07,845 INFO L290 TraceCheckUtils]: 1: Hoare triple {2338#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(9, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {2346#(<= ~counter~0 0)} is VALID [2022-04-27 13:37:07,845 INFO L290 TraceCheckUtils]: 2: Hoare triple {2346#(<= ~counter~0 0)} assume true; {2346#(<= ~counter~0 0)} is VALID [2022-04-27 13:37:07,846 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2346#(<= ~counter~0 0)} {2338#true} #96#return; {2346#(<= ~counter~0 0)} is VALID [2022-04-27 13:37:07,846 INFO L272 TraceCheckUtils]: 4: Hoare triple {2346#(<= ~counter~0 0)} call #t~ret8 := main(); {2346#(<= ~counter~0 0)} is VALID [2022-04-27 13:37:07,847 INFO L290 TraceCheckUtils]: 5: Hoare triple {2346#(<= ~counter~0 0)} havoc ~A~0;havoc ~B~0;havoc ~r~0;havoc ~d~0;havoc ~p~0;havoc ~q~0;~A~0 := #t~nondet4;havoc #t~nondet4;~B~0 := #t~nondet5;havoc #t~nondet5; {2346#(<= ~counter~0 0)} is VALID [2022-04-27 13:37:07,847 INFO L272 TraceCheckUtils]: 6: Hoare triple {2346#(<= ~counter~0 0)} call assume_abort_if_not((if ~B~0 % 4294967296 >= 1 then 1 else 0)); {2346#(<= ~counter~0 0)} is VALID [2022-04-27 13:37:07,847 INFO L290 TraceCheckUtils]: 7: Hoare triple {2346#(<= ~counter~0 0)} ~cond := #in~cond; {2346#(<= ~counter~0 0)} is VALID [2022-04-27 13:37:07,848 INFO L290 TraceCheckUtils]: 8: Hoare triple {2346#(<= ~counter~0 0)} assume !(0 == ~cond); {2346#(<= ~counter~0 0)} is VALID [2022-04-27 13:37:07,848 INFO L290 TraceCheckUtils]: 9: Hoare triple {2346#(<= ~counter~0 0)} assume true; {2346#(<= ~counter~0 0)} is VALID [2022-04-27 13:37:07,848 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2346#(<= ~counter~0 0)} {2346#(<= ~counter~0 0)} #80#return; {2346#(<= ~counter~0 0)} is VALID [2022-04-27 13:37:07,849 INFO L290 TraceCheckUtils]: 11: Hoare triple {2346#(<= ~counter~0 0)} ~r~0 := ~A~0;~d~0 := ~B~0;~p~0 := 1;~q~0 := 0; {2346#(<= ~counter~0 0)} is VALID [2022-04-27 13:37:07,849 INFO L290 TraceCheckUtils]: 12: Hoare triple {2346#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {2380#(<= ~counter~0 1)} is VALID [2022-04-27 13:37:07,850 INFO L290 TraceCheckUtils]: 13: Hoare triple {2380#(<= ~counter~0 1)} assume !!(#t~post6 < 50);havoc #t~post6; {2380#(<= ~counter~0 1)} is VALID [2022-04-27 13:37:07,850 INFO L272 TraceCheckUtils]: 14: Hoare triple {2380#(<= ~counter~0 1)} call __VERIFIER_assert((if 0 == ~q~0 % 4294967296 then 1 else 0)); {2380#(<= ~counter~0 1)} is VALID [2022-04-27 13:37:07,850 INFO L290 TraceCheckUtils]: 15: Hoare triple {2380#(<= ~counter~0 1)} ~cond := #in~cond; {2380#(<= ~counter~0 1)} is VALID [2022-04-27 13:37:07,851 INFO L290 TraceCheckUtils]: 16: Hoare triple {2380#(<= ~counter~0 1)} assume !(0 == ~cond); {2380#(<= ~counter~0 1)} is VALID [2022-04-27 13:37:07,851 INFO L290 TraceCheckUtils]: 17: Hoare triple {2380#(<= ~counter~0 1)} assume true; {2380#(<= ~counter~0 1)} is VALID [2022-04-27 13:37:07,851 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {2380#(<= ~counter~0 1)} {2380#(<= ~counter~0 1)} #82#return; {2380#(<= ~counter~0 1)} is VALID [2022-04-27 13:37:07,852 INFO L272 TraceCheckUtils]: 19: Hoare triple {2380#(<= ~counter~0 1)} call __VERIFIER_assert((if ~r~0 % 4294967296 == ~A~0 % 4294967296 then 1 else 0)); {2380#(<= ~counter~0 1)} is VALID [2022-04-27 13:37:07,852 INFO L290 TraceCheckUtils]: 20: Hoare triple {2380#(<= ~counter~0 1)} ~cond := #in~cond; {2380#(<= ~counter~0 1)} is VALID [2022-04-27 13:37:07,852 INFO L290 TraceCheckUtils]: 21: Hoare triple {2380#(<= ~counter~0 1)} assume !(0 == ~cond); {2380#(<= ~counter~0 1)} is VALID [2022-04-27 13:37:07,853 INFO L290 TraceCheckUtils]: 22: Hoare triple {2380#(<= ~counter~0 1)} assume true; {2380#(<= ~counter~0 1)} is VALID [2022-04-27 13:37:07,853 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {2380#(<= ~counter~0 1)} {2380#(<= ~counter~0 1)} #84#return; {2380#(<= ~counter~0 1)} is VALID [2022-04-27 13:37:07,854 INFO L272 TraceCheckUtils]: 24: Hoare triple {2380#(<= ~counter~0 1)} call __VERIFIER_assert((if ~d~0 % 4294967296 == ~B~0 * ~p~0 % 4294967296 then 1 else 0)); {2380#(<= ~counter~0 1)} is VALID [2022-04-27 13:37:07,854 INFO L290 TraceCheckUtils]: 25: Hoare triple {2380#(<= ~counter~0 1)} ~cond := #in~cond; {2380#(<= ~counter~0 1)} is VALID [2022-04-27 13:37:07,854 INFO L290 TraceCheckUtils]: 26: Hoare triple {2380#(<= ~counter~0 1)} assume !(0 == ~cond); {2380#(<= ~counter~0 1)} is VALID [2022-04-27 13:37:07,855 INFO L290 TraceCheckUtils]: 27: Hoare triple {2380#(<= ~counter~0 1)} assume true; {2380#(<= ~counter~0 1)} is VALID [2022-04-27 13:37:07,855 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {2380#(<= ~counter~0 1)} {2380#(<= ~counter~0 1)} #86#return; {2380#(<= ~counter~0 1)} is VALID [2022-04-27 13:37:07,856 INFO L290 TraceCheckUtils]: 29: Hoare triple {2380#(<= ~counter~0 1)} assume !!(~r~0 % 4294967296 >= ~d~0 % 4294967296);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {2380#(<= ~counter~0 1)} is VALID [2022-04-27 13:37:07,856 INFO L290 TraceCheckUtils]: 30: Hoare triple {2380#(<= ~counter~0 1)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {2435#(<= |main_#t~post6| 1)} is VALID [2022-04-27 13:37:07,857 INFO L290 TraceCheckUtils]: 31: Hoare triple {2435#(<= |main_#t~post6| 1)} assume !(#t~post6 < 50);havoc #t~post6; {2339#false} is VALID [2022-04-27 13:37:07,857 INFO L290 TraceCheckUtils]: 32: Hoare triple {2339#false} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {2339#false} is VALID [2022-04-27 13:37:07,857 INFO L290 TraceCheckUtils]: 33: Hoare triple {2339#false} assume !(#t~post7 < 50);havoc #t~post7; {2339#false} is VALID [2022-04-27 13:37:07,857 INFO L272 TraceCheckUtils]: 34: Hoare triple {2339#false} call __VERIFIER_assert((if ~A~0 % 4294967296 == (~d~0 * ~q~0 + ~r~0) % 4294967296 then 1 else 0)); {2339#false} is VALID [2022-04-27 13:37:07,857 INFO L290 TraceCheckUtils]: 35: Hoare triple {2339#false} ~cond := #in~cond; {2339#false} is VALID [2022-04-27 13:37:07,857 INFO L290 TraceCheckUtils]: 36: Hoare triple {2339#false} assume 0 == ~cond; {2339#false} is VALID [2022-04-27 13:37:07,857 INFO L290 TraceCheckUtils]: 37: Hoare triple {2339#false} assume !false; {2339#false} is VALID [2022-04-27 13:37:07,857 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-04-27 13:37:07,857 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 13:37:08,055 INFO L290 TraceCheckUtils]: 37: Hoare triple {2339#false} assume !false; {2339#false} is VALID [2022-04-27 13:37:08,055 INFO L290 TraceCheckUtils]: 36: Hoare triple {2339#false} assume 0 == ~cond; {2339#false} is VALID [2022-04-27 13:37:08,055 INFO L290 TraceCheckUtils]: 35: Hoare triple {2339#false} ~cond := #in~cond; {2339#false} is VALID [2022-04-27 13:37:08,055 INFO L272 TraceCheckUtils]: 34: Hoare triple {2339#false} call __VERIFIER_assert((if ~A~0 % 4294967296 == (~d~0 * ~q~0 + ~r~0) % 4294967296 then 1 else 0)); {2339#false} is VALID [2022-04-27 13:37:08,055 INFO L290 TraceCheckUtils]: 33: Hoare triple {2339#false} assume !(#t~post7 < 50);havoc #t~post7; {2339#false} is VALID [2022-04-27 13:37:08,055 INFO L290 TraceCheckUtils]: 32: Hoare triple {2339#false} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {2339#false} is VALID [2022-04-27 13:37:08,056 INFO L290 TraceCheckUtils]: 31: Hoare triple {2475#(< |main_#t~post6| 50)} assume !(#t~post6 < 50);havoc #t~post6; {2339#false} is VALID [2022-04-27 13:37:08,056 INFO L290 TraceCheckUtils]: 30: Hoare triple {2479#(< ~counter~0 50)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {2475#(< |main_#t~post6| 50)} is VALID [2022-04-27 13:37:08,057 INFO L290 TraceCheckUtils]: 29: Hoare triple {2479#(< ~counter~0 50)} assume !!(~r~0 % 4294967296 >= ~d~0 % 4294967296);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {2479#(< ~counter~0 50)} is VALID [2022-04-27 13:37:08,057 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {2338#true} {2479#(< ~counter~0 50)} #86#return; {2479#(< ~counter~0 50)} is VALID [2022-04-27 13:37:08,057 INFO L290 TraceCheckUtils]: 27: Hoare triple {2338#true} assume true; {2338#true} is VALID [2022-04-27 13:37:08,057 INFO L290 TraceCheckUtils]: 26: Hoare triple {2338#true} assume !(0 == ~cond); {2338#true} is VALID [2022-04-27 13:37:08,058 INFO L290 TraceCheckUtils]: 25: Hoare triple {2338#true} ~cond := #in~cond; {2338#true} is VALID [2022-04-27 13:37:08,058 INFO L272 TraceCheckUtils]: 24: Hoare triple {2479#(< ~counter~0 50)} call __VERIFIER_assert((if ~d~0 % 4294967296 == ~B~0 * ~p~0 % 4294967296 then 1 else 0)); {2338#true} is VALID [2022-04-27 13:37:08,058 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {2338#true} {2479#(< ~counter~0 50)} #84#return; {2479#(< ~counter~0 50)} is VALID [2022-04-27 13:37:08,058 INFO L290 TraceCheckUtils]: 22: Hoare triple {2338#true} assume true; {2338#true} is VALID [2022-04-27 13:37:08,058 INFO L290 TraceCheckUtils]: 21: Hoare triple {2338#true} assume !(0 == ~cond); {2338#true} is VALID [2022-04-27 13:37:08,058 INFO L290 TraceCheckUtils]: 20: Hoare triple {2338#true} ~cond := #in~cond; {2338#true} is VALID [2022-04-27 13:37:08,059 INFO L272 TraceCheckUtils]: 19: Hoare triple {2479#(< ~counter~0 50)} call __VERIFIER_assert((if ~r~0 % 4294967296 == ~A~0 % 4294967296 then 1 else 0)); {2338#true} is VALID [2022-04-27 13:37:08,059 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {2338#true} {2479#(< ~counter~0 50)} #82#return; {2479#(< ~counter~0 50)} is VALID [2022-04-27 13:37:08,059 INFO L290 TraceCheckUtils]: 17: Hoare triple {2338#true} assume true; {2338#true} is VALID [2022-04-27 13:37:08,059 INFO L290 TraceCheckUtils]: 16: Hoare triple {2338#true} assume !(0 == ~cond); {2338#true} is VALID [2022-04-27 13:37:08,059 INFO L290 TraceCheckUtils]: 15: Hoare triple {2338#true} ~cond := #in~cond; {2338#true} is VALID [2022-04-27 13:37:08,059 INFO L272 TraceCheckUtils]: 14: Hoare triple {2479#(< ~counter~0 50)} call __VERIFIER_assert((if 0 == ~q~0 % 4294967296 then 1 else 0)); {2338#true} is VALID [2022-04-27 13:37:08,060 INFO L290 TraceCheckUtils]: 13: Hoare triple {2479#(< ~counter~0 50)} assume !!(#t~post6 < 50);havoc #t~post6; {2479#(< ~counter~0 50)} is VALID [2022-04-27 13:37:08,060 INFO L290 TraceCheckUtils]: 12: Hoare triple {2534#(< ~counter~0 49)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {2479#(< ~counter~0 50)} is VALID [2022-04-27 13:37:08,061 INFO L290 TraceCheckUtils]: 11: Hoare triple {2534#(< ~counter~0 49)} ~r~0 := ~A~0;~d~0 := ~B~0;~p~0 := 1;~q~0 := 0; {2534#(< ~counter~0 49)} is VALID [2022-04-27 13:37:08,061 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2338#true} {2534#(< ~counter~0 49)} #80#return; {2534#(< ~counter~0 49)} is VALID [2022-04-27 13:37:08,061 INFO L290 TraceCheckUtils]: 9: Hoare triple {2338#true} assume true; {2338#true} is VALID [2022-04-27 13:37:08,061 INFO L290 TraceCheckUtils]: 8: Hoare triple {2338#true} assume !(0 == ~cond); {2338#true} is VALID [2022-04-27 13:37:08,061 INFO L290 TraceCheckUtils]: 7: Hoare triple {2338#true} ~cond := #in~cond; {2338#true} is VALID [2022-04-27 13:37:08,062 INFO L272 TraceCheckUtils]: 6: Hoare triple {2534#(< ~counter~0 49)} call assume_abort_if_not((if ~B~0 % 4294967296 >= 1 then 1 else 0)); {2338#true} is VALID [2022-04-27 13:37:08,062 INFO L290 TraceCheckUtils]: 5: Hoare triple {2534#(< ~counter~0 49)} havoc ~A~0;havoc ~B~0;havoc ~r~0;havoc ~d~0;havoc ~p~0;havoc ~q~0;~A~0 := #t~nondet4;havoc #t~nondet4;~B~0 := #t~nondet5;havoc #t~nondet5; {2534#(< ~counter~0 49)} is VALID [2022-04-27 13:37:08,062 INFO L272 TraceCheckUtils]: 4: Hoare triple {2534#(< ~counter~0 49)} call #t~ret8 := main(); {2534#(< ~counter~0 49)} is VALID [2022-04-27 13:37:08,063 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2534#(< ~counter~0 49)} {2338#true} #96#return; {2534#(< ~counter~0 49)} is VALID [2022-04-27 13:37:08,063 INFO L290 TraceCheckUtils]: 2: Hoare triple {2534#(< ~counter~0 49)} assume true; {2534#(< ~counter~0 49)} is VALID [2022-04-27 13:37:08,063 INFO L290 TraceCheckUtils]: 1: Hoare triple {2338#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(9, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {2534#(< ~counter~0 49)} is VALID [2022-04-27 13:37:08,064 INFO L272 TraceCheckUtils]: 0: Hoare triple {2338#true} call ULTIMATE.init(); {2338#true} is VALID [2022-04-27 13:37:08,064 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-04-27 13:37:08,064 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 13:37:08,064 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1688291932] [2022-04-27 13:37:08,064 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 13:37:08,064 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [115232671] [2022-04-27 13:37:08,064 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [115232671] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 13:37:08,064 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-27 13:37:08,064 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2022-04-27 13:37:08,064 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1861740346] [2022-04-27 13:37:08,064 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-27 13:37:08,065 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.375) internal successors, (35), 8 states have internal predecessors, (35), 6 states have call successors, (12), 5 states have call predecessors, (12), 4 states have return successors, (10), 4 states have call predecessors, (10), 5 states have call successors, (10) Word has length 38 [2022-04-27 13:37:08,065 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 13:37:08,065 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 4.375) internal successors, (35), 8 states have internal predecessors, (35), 6 states have call successors, (12), 5 states have call predecessors, (12), 4 states have return successors, (10), 4 states have call predecessors, (10), 5 states have call successors, (10) [2022-04-27 13:37:08,126 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 57 edges. 57 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 13:37:08,127 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-27 13:37:08,127 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 13:37:08,127 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-27 13:37:08,127 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2022-04-27 13:37:08,127 INFO L87 Difference]: Start difference. First operand 78 states and 93 transitions. Second operand has 8 states, 8 states have (on average 4.375) internal successors, (35), 8 states have internal predecessors, (35), 6 states have call successors, (12), 5 states have call predecessors, (12), 4 states have return successors, (10), 4 states have call predecessors, (10), 5 states have call successors, (10) [2022-04-27 13:37:09,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:37:09,646 INFO L93 Difference]: Finished difference Result 160 states and 196 transitions. [2022-04-27 13:37:09,646 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-04-27 13:37:09,646 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.375) internal successors, (35), 8 states have internal predecessors, (35), 6 states have call successors, (12), 5 states have call predecessors, (12), 4 states have return successors, (10), 4 states have call predecessors, (10), 5 states have call successors, (10) Word has length 38 [2022-04-27 13:37:09,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 13:37:09,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 4.375) internal successors, (35), 8 states have internal predecessors, (35), 6 states have call successors, (12), 5 states have call predecessors, (12), 4 states have return successors, (10), 4 states have call predecessors, (10), 5 states have call successors, (10) [2022-04-27 13:37:09,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 133 transitions. [2022-04-27 13:37:09,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 4.375) internal successors, (35), 8 states have internal predecessors, (35), 6 states have call successors, (12), 5 states have call predecessors, (12), 4 states have return successors, (10), 4 states have call predecessors, (10), 5 states have call successors, (10) [2022-04-27 13:37:09,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 133 transitions. [2022-04-27 13:37:09,650 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 10 states and 133 transitions. [2022-04-27 13:37:09,761 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 133 edges. 133 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 13:37:09,766 INFO L225 Difference]: With dead ends: 160 [2022-04-27 13:37:09,766 INFO L226 Difference]: Without dead ends: 146 [2022-04-27 13:37:09,767 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 69 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 13:37:09,767 INFO L413 NwaCegarLoop]: 53 mSDtfsCounter, 54 mSDsluCounter, 127 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 180 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-04-27 13:37:09,768 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 180 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-04-27 13:37:09,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2022-04-27 13:37:09,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 138. [2022-04-27 13:37:09,806 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 13:37:09,806 INFO L82 GeneralOperation]: Start isEquivalent. First operand 146 states. Second operand has 138 states, 88 states have (on average 1.2159090909090908) internal successors, (107), 92 states have internal predecessors, (107), 31 states have call successors, (31), 19 states have call predecessors, (31), 18 states have return successors, (28), 26 states have call predecessors, (28), 28 states have call successors, (28) [2022-04-27 13:37:09,806 INFO L74 IsIncluded]: Start isIncluded. First operand 146 states. Second operand has 138 states, 88 states have (on average 1.2159090909090908) internal successors, (107), 92 states have internal predecessors, (107), 31 states have call successors, (31), 19 states have call predecessors, (31), 18 states have return successors, (28), 26 states have call predecessors, (28), 28 states have call successors, (28) [2022-04-27 13:37:09,807 INFO L87 Difference]: Start difference. First operand 146 states. Second operand has 138 states, 88 states have (on average 1.2159090909090908) internal successors, (107), 92 states have internal predecessors, (107), 31 states have call successors, (31), 19 states have call predecessors, (31), 18 states have return successors, (28), 26 states have call predecessors, (28), 28 states have call successors, (28) [2022-04-27 13:37:09,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:37:09,810 INFO L93 Difference]: Finished difference Result 146 states and 174 transitions. [2022-04-27 13:37:09,810 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 174 transitions. [2022-04-27 13:37:09,811 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:37:09,811 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:37:09,811 INFO L74 IsIncluded]: Start isIncluded. First operand has 138 states, 88 states have (on average 1.2159090909090908) internal successors, (107), 92 states have internal predecessors, (107), 31 states have call successors, (31), 19 states have call predecessors, (31), 18 states have return successors, (28), 26 states have call predecessors, (28), 28 states have call successors, (28) Second operand 146 states. [2022-04-27 13:37:09,811 INFO L87 Difference]: Start difference. First operand has 138 states, 88 states have (on average 1.2159090909090908) internal successors, (107), 92 states have internal predecessors, (107), 31 states have call successors, (31), 19 states have call predecessors, (31), 18 states have return successors, (28), 26 states have call predecessors, (28), 28 states have call successors, (28) Second operand 146 states. [2022-04-27 13:37:09,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:37:09,814 INFO L93 Difference]: Finished difference Result 146 states and 174 transitions. [2022-04-27 13:37:09,814 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 174 transitions. [2022-04-27 13:37:09,815 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:37:09,815 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:37:09,815 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 13:37:09,815 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 13:37:09,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 138 states, 88 states have (on average 1.2159090909090908) internal successors, (107), 92 states have internal predecessors, (107), 31 states have call successors, (31), 19 states have call predecessors, (31), 18 states have return successors, (28), 26 states have call predecessors, (28), 28 states have call successors, (28) [2022-04-27 13:37:09,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 166 transitions. [2022-04-27 13:37:09,818 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 166 transitions. Word has length 38 [2022-04-27 13:37:09,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 13:37:09,818 INFO L495 AbstractCegarLoop]: Abstraction has 138 states and 166 transitions. [2022-04-27 13:37:09,819 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.375) internal successors, (35), 8 states have internal predecessors, (35), 6 states have call successors, (12), 5 states have call predecessors, (12), 4 states have return successors, (10), 4 states have call predecessors, (10), 5 states have call successors, (10) [2022-04-27 13:37:09,819 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 166 transitions. [2022-04-27 13:37:09,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-04-27 13:37:09,819 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 13:37:09,819 INFO L195 NwaCegarLoop]: trace histogram [6, 5, 5, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 13:37:09,840 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 13:37:10,035 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 13:37:10,036 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 13:37:10,036 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 13:37:10,049 INFO L85 PathProgramCache]: Analyzing trace with hash 1861890039, now seen corresponding path program 1 times [2022-04-27 13:37:10,049 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 13:37:10,049 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1201506964] [2022-04-27 13:37:10,050 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:37:10,050 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 13:37:10,062 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 13:37:10,062 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1418738216] [2022-04-27 13:37:10,062 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:37:10,062 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 13:37:10,062 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 13:37:10,066 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 13:37:10,068 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 13:37:10,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:37:10,176 INFO L263 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 16 conjunts are in the unsatisfiable core [2022-04-27 13:37:10,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:37:10,192 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 13:37:11,011 INFO L272 TraceCheckUtils]: 0: Hoare triple {3284#true} call ULTIMATE.init(); {3284#true} is VALID [2022-04-27 13:37:11,011 INFO L290 TraceCheckUtils]: 1: Hoare triple {3284#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(9, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {3284#true} is VALID [2022-04-27 13:37:11,011 INFO L290 TraceCheckUtils]: 2: Hoare triple {3284#true} assume true; {3284#true} is VALID [2022-04-27 13:37:11,011 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3284#true} {3284#true} #96#return; {3284#true} is VALID [2022-04-27 13:37:11,011 INFO L272 TraceCheckUtils]: 4: Hoare triple {3284#true} call #t~ret8 := main(); {3284#true} is VALID [2022-04-27 13:37:11,011 INFO L290 TraceCheckUtils]: 5: Hoare triple {3284#true} havoc ~A~0;havoc ~B~0;havoc ~r~0;havoc ~d~0;havoc ~p~0;havoc ~q~0;~A~0 := #t~nondet4;havoc #t~nondet4;~B~0 := #t~nondet5;havoc #t~nondet5; {3284#true} is VALID [2022-04-27 13:37:11,012 INFO L272 TraceCheckUtils]: 6: Hoare triple {3284#true} call assume_abort_if_not((if ~B~0 % 4294967296 >= 1 then 1 else 0)); {3284#true} is VALID [2022-04-27 13:37:11,012 INFO L290 TraceCheckUtils]: 7: Hoare triple {3284#true} ~cond := #in~cond; {3310#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-27 13:37:11,025 INFO L290 TraceCheckUtils]: 8: Hoare triple {3310#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {3314#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-27 13:37:11,025 INFO L290 TraceCheckUtils]: 9: Hoare triple {3314#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {3314#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-27 13:37:11,026 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {3314#(not (= |assume_abort_if_not_#in~cond| 0))} {3284#true} #80#return; {3321#(<= 1 (mod main_~B~0 4294967296))} is VALID [2022-04-27 13:37:11,026 INFO L290 TraceCheckUtils]: 11: Hoare triple {3321#(<= 1 (mod main_~B~0 4294967296))} ~r~0 := ~A~0;~d~0 := ~B~0;~p~0 := 1;~q~0 := 0; {3325#(and (<= 1 (mod main_~B~0 4294967296)) (= main_~B~0 main_~d~0) (= main_~p~0 1))} is VALID [2022-04-27 13:37:11,027 INFO L290 TraceCheckUtils]: 12: Hoare triple {3325#(and (<= 1 (mod main_~B~0 4294967296)) (= main_~B~0 main_~d~0) (= main_~p~0 1))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {3325#(and (<= 1 (mod main_~B~0 4294967296)) (= main_~B~0 main_~d~0) (= main_~p~0 1))} is VALID [2022-04-27 13:37:11,027 INFO L290 TraceCheckUtils]: 13: Hoare triple {3325#(and (<= 1 (mod main_~B~0 4294967296)) (= main_~B~0 main_~d~0) (= main_~p~0 1))} assume !!(#t~post6 < 50);havoc #t~post6; {3325#(and (<= 1 (mod main_~B~0 4294967296)) (= main_~B~0 main_~d~0) (= main_~p~0 1))} is VALID [2022-04-27 13:37:11,027 INFO L272 TraceCheckUtils]: 14: Hoare triple {3325#(and (<= 1 (mod main_~B~0 4294967296)) (= main_~B~0 main_~d~0) (= main_~p~0 1))} call __VERIFIER_assert((if 0 == ~q~0 % 4294967296 then 1 else 0)); {3284#true} is VALID [2022-04-27 13:37:11,027 INFO L290 TraceCheckUtils]: 15: Hoare triple {3284#true} ~cond := #in~cond; {3284#true} is VALID [2022-04-27 13:37:11,027 INFO L290 TraceCheckUtils]: 16: Hoare triple {3284#true} assume !(0 == ~cond); {3284#true} is VALID [2022-04-27 13:37:11,028 INFO L290 TraceCheckUtils]: 17: Hoare triple {3284#true} assume true; {3284#true} is VALID [2022-04-27 13:37:11,028 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {3284#true} {3325#(and (<= 1 (mod main_~B~0 4294967296)) (= main_~B~0 main_~d~0) (= main_~p~0 1))} #82#return; {3325#(and (<= 1 (mod main_~B~0 4294967296)) (= main_~B~0 main_~d~0) (= main_~p~0 1))} is VALID [2022-04-27 13:37:11,028 INFO L272 TraceCheckUtils]: 19: Hoare triple {3325#(and (<= 1 (mod main_~B~0 4294967296)) (= main_~B~0 main_~d~0) (= main_~p~0 1))} call __VERIFIER_assert((if ~r~0 % 4294967296 == ~A~0 % 4294967296 then 1 else 0)); {3284#true} is VALID [2022-04-27 13:37:11,028 INFO L290 TraceCheckUtils]: 20: Hoare triple {3284#true} ~cond := #in~cond; {3284#true} is VALID [2022-04-27 13:37:11,029 INFO L290 TraceCheckUtils]: 21: Hoare triple {3284#true} assume !(0 == ~cond); {3284#true} is VALID [2022-04-27 13:37:11,029 INFO L290 TraceCheckUtils]: 22: Hoare triple {3284#true} assume true; {3284#true} is VALID [2022-04-27 13:37:11,029 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {3284#true} {3325#(and (<= 1 (mod main_~B~0 4294967296)) (= main_~B~0 main_~d~0) (= main_~p~0 1))} #84#return; {3325#(and (<= 1 (mod main_~B~0 4294967296)) (= main_~B~0 main_~d~0) (= main_~p~0 1))} is VALID [2022-04-27 13:37:11,029 INFO L272 TraceCheckUtils]: 24: Hoare triple {3325#(and (<= 1 (mod main_~B~0 4294967296)) (= main_~B~0 main_~d~0) (= main_~p~0 1))} call __VERIFIER_assert((if ~d~0 % 4294967296 == ~B~0 * ~p~0 % 4294967296 then 1 else 0)); {3284#true} is VALID [2022-04-27 13:37:11,030 INFO L290 TraceCheckUtils]: 25: Hoare triple {3284#true} ~cond := #in~cond; {3284#true} is VALID [2022-04-27 13:37:11,030 INFO L290 TraceCheckUtils]: 26: Hoare triple {3284#true} assume !(0 == ~cond); {3284#true} is VALID [2022-04-27 13:37:11,030 INFO L290 TraceCheckUtils]: 27: Hoare triple {3284#true} assume true; {3284#true} is VALID [2022-04-27 13:37:11,032 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {3284#true} {3325#(and (<= 1 (mod main_~B~0 4294967296)) (= main_~B~0 main_~d~0) (= main_~p~0 1))} #86#return; {3325#(and (<= 1 (mod main_~B~0 4294967296)) (= main_~B~0 main_~d~0) (= main_~p~0 1))} is VALID [2022-04-27 13:37:11,032 INFO L290 TraceCheckUtils]: 29: Hoare triple {3325#(and (<= 1 (mod main_~B~0 4294967296)) (= main_~B~0 main_~d~0) (= main_~p~0 1))} assume !!(~r~0 % 4294967296 >= ~d~0 % 4294967296);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {3380#(and (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (<= 1 (mod main_~B~0 4294967296)))} is VALID [2022-04-27 13:37:11,033 INFO L290 TraceCheckUtils]: 30: Hoare triple {3380#(and (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (<= 1 (mod main_~B~0 4294967296)))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {3380#(and (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (<= 1 (mod main_~B~0 4294967296)))} is VALID [2022-04-27 13:37:11,033 INFO L290 TraceCheckUtils]: 31: Hoare triple {3380#(and (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (<= 1 (mod main_~B~0 4294967296)))} assume !!(#t~post6 < 50);havoc #t~post6; {3380#(and (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (<= 1 (mod main_~B~0 4294967296)))} is VALID [2022-04-27 13:37:11,033 INFO L272 TraceCheckUtils]: 32: Hoare triple {3380#(and (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (<= 1 (mod main_~B~0 4294967296)))} call __VERIFIER_assert((if 0 == ~q~0 % 4294967296 then 1 else 0)); {3284#true} is VALID [2022-04-27 13:37:11,034 INFO L290 TraceCheckUtils]: 33: Hoare triple {3284#true} ~cond := #in~cond; {3284#true} is VALID [2022-04-27 13:37:11,034 INFO L290 TraceCheckUtils]: 34: Hoare triple {3284#true} assume !(0 == ~cond); {3284#true} is VALID [2022-04-27 13:37:11,034 INFO L290 TraceCheckUtils]: 35: Hoare triple {3284#true} assume true; {3284#true} is VALID [2022-04-27 13:37:11,034 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {3284#true} {3380#(and (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (<= 1 (mod main_~B~0 4294967296)))} #82#return; {3380#(and (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (<= 1 (mod main_~B~0 4294967296)))} is VALID [2022-04-27 13:37:11,034 INFO L272 TraceCheckUtils]: 37: Hoare triple {3380#(and (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (<= 1 (mod main_~B~0 4294967296)))} call __VERIFIER_assert((if ~r~0 % 4294967296 == ~A~0 % 4294967296 then 1 else 0)); {3284#true} is VALID [2022-04-27 13:37:11,034 INFO L290 TraceCheckUtils]: 38: Hoare triple {3284#true} ~cond := #in~cond; {3284#true} is VALID [2022-04-27 13:37:11,035 INFO L290 TraceCheckUtils]: 39: Hoare triple {3284#true} assume !(0 == ~cond); {3284#true} is VALID [2022-04-27 13:37:11,035 INFO L290 TraceCheckUtils]: 40: Hoare triple {3284#true} assume true; {3284#true} is VALID [2022-04-27 13:37:11,035 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {3284#true} {3380#(and (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (<= 1 (mod main_~B~0 4294967296)))} #84#return; {3380#(and (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (<= 1 (mod main_~B~0 4294967296)))} is VALID [2022-04-27 13:37:11,044 INFO L272 TraceCheckUtils]: 42: Hoare triple {3380#(and (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (<= 1 (mod main_~B~0 4294967296)))} call __VERIFIER_assert((if ~d~0 % 4294967296 == ~B~0 * ~p~0 % 4294967296 then 1 else 0)); {3420#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 13:37:11,044 INFO L290 TraceCheckUtils]: 43: Hoare triple {3420#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {3424#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 13:37:11,045 INFO L290 TraceCheckUtils]: 44: Hoare triple {3424#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {3285#false} is VALID [2022-04-27 13:37:11,045 INFO L290 TraceCheckUtils]: 45: Hoare triple {3285#false} assume !false; {3285#false} is VALID [2022-04-27 13:37:11,045 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 10 proven. 5 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2022-04-27 13:37:11,045 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 13:37:12,019 INFO L290 TraceCheckUtils]: 45: Hoare triple {3285#false} assume !false; {3285#false} is VALID [2022-04-27 13:37:12,019 INFO L290 TraceCheckUtils]: 44: Hoare triple {3424#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {3285#false} is VALID [2022-04-27 13:37:12,020 INFO L290 TraceCheckUtils]: 43: Hoare triple {3420#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {3424#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 13:37:12,020 INFO L272 TraceCheckUtils]: 42: Hoare triple {3440#(= (mod main_~d~0 4294967296) (mod (* main_~B~0 main_~p~0) 4294967296))} call __VERIFIER_assert((if ~d~0 % 4294967296 == ~B~0 * ~p~0 % 4294967296 then 1 else 0)); {3420#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 13:37:12,021 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {3284#true} {3440#(= (mod main_~d~0 4294967296) (mod (* main_~B~0 main_~p~0) 4294967296))} #84#return; {3440#(= (mod main_~d~0 4294967296) (mod (* main_~B~0 main_~p~0) 4294967296))} is VALID [2022-04-27 13:37:12,021 INFO L290 TraceCheckUtils]: 40: Hoare triple {3284#true} assume true; {3284#true} is VALID [2022-04-27 13:37:12,021 INFO L290 TraceCheckUtils]: 39: Hoare triple {3284#true} assume !(0 == ~cond); {3284#true} is VALID [2022-04-27 13:37:12,021 INFO L290 TraceCheckUtils]: 38: Hoare triple {3284#true} ~cond := #in~cond; {3284#true} is VALID [2022-04-27 13:37:12,021 INFO L272 TraceCheckUtils]: 37: Hoare triple {3440#(= (mod main_~d~0 4294967296) (mod (* main_~B~0 main_~p~0) 4294967296))} call __VERIFIER_assert((if ~r~0 % 4294967296 == ~A~0 % 4294967296 then 1 else 0)); {3284#true} is VALID [2022-04-27 13:37:12,022 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {3284#true} {3440#(= (mod main_~d~0 4294967296) (mod (* main_~B~0 main_~p~0) 4294967296))} #82#return; {3440#(= (mod main_~d~0 4294967296) (mod (* main_~B~0 main_~p~0) 4294967296))} is VALID [2022-04-27 13:37:12,022 INFO L290 TraceCheckUtils]: 35: Hoare triple {3284#true} assume true; {3284#true} is VALID [2022-04-27 13:37:12,022 INFO L290 TraceCheckUtils]: 34: Hoare triple {3284#true} assume !(0 == ~cond); {3284#true} is VALID [2022-04-27 13:37:12,022 INFO L290 TraceCheckUtils]: 33: Hoare triple {3284#true} ~cond := #in~cond; {3284#true} is VALID [2022-04-27 13:37:12,022 INFO L272 TraceCheckUtils]: 32: Hoare triple {3440#(= (mod main_~d~0 4294967296) (mod (* main_~B~0 main_~p~0) 4294967296))} call __VERIFIER_assert((if 0 == ~q~0 % 4294967296 then 1 else 0)); {3284#true} is VALID [2022-04-27 13:37:12,023 INFO L290 TraceCheckUtils]: 31: Hoare triple {3440#(= (mod main_~d~0 4294967296) (mod (* main_~B~0 main_~p~0) 4294967296))} assume !!(#t~post6 < 50);havoc #t~post6; {3440#(= (mod main_~d~0 4294967296) (mod (* main_~B~0 main_~p~0) 4294967296))} is VALID [2022-04-27 13:37:12,023 INFO L290 TraceCheckUtils]: 30: Hoare triple {3440#(= (mod main_~d~0 4294967296) (mod (* main_~B~0 main_~p~0) 4294967296))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {3440#(= (mod main_~d~0 4294967296) (mod (* main_~B~0 main_~p~0) 4294967296))} is VALID [2022-04-27 13:37:13,028 INFO L290 TraceCheckUtils]: 29: Hoare triple {3480#(= (mod (* main_~d~0 2) 4294967296) (mod (* (* main_~p~0 2) main_~B~0) 4294967296))} assume !!(~r~0 % 4294967296 >= ~d~0 % 4294967296);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {3440#(= (mod main_~d~0 4294967296) (mod (* main_~B~0 main_~p~0) 4294967296))} is VALID [2022-04-27 13:37:13,028 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {3284#true} {3480#(= (mod (* main_~d~0 2) 4294967296) (mod (* (* main_~p~0 2) main_~B~0) 4294967296))} #86#return; {3480#(= (mod (* main_~d~0 2) 4294967296) (mod (* (* main_~p~0 2) main_~B~0) 4294967296))} is VALID [2022-04-27 13:37:13,028 INFO L290 TraceCheckUtils]: 27: Hoare triple {3284#true} assume true; {3284#true} is VALID [2022-04-27 13:37:13,028 INFO L290 TraceCheckUtils]: 26: Hoare triple {3284#true} assume !(0 == ~cond); {3284#true} is VALID [2022-04-27 13:37:13,029 INFO L290 TraceCheckUtils]: 25: Hoare triple {3284#true} ~cond := #in~cond; {3284#true} is VALID [2022-04-27 13:37:13,029 INFO L272 TraceCheckUtils]: 24: Hoare triple {3480#(= (mod (* main_~d~0 2) 4294967296) (mod (* (* main_~p~0 2) main_~B~0) 4294967296))} call __VERIFIER_assert((if ~d~0 % 4294967296 == ~B~0 * ~p~0 % 4294967296 then 1 else 0)); {3284#true} is VALID [2022-04-27 13:37:13,029 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {3284#true} {3480#(= (mod (* main_~d~0 2) 4294967296) (mod (* (* main_~p~0 2) main_~B~0) 4294967296))} #84#return; {3480#(= (mod (* main_~d~0 2) 4294967296) (mod (* (* main_~p~0 2) main_~B~0) 4294967296))} is VALID [2022-04-27 13:37:13,029 INFO L290 TraceCheckUtils]: 22: Hoare triple {3284#true} assume true; {3284#true} is VALID [2022-04-27 13:37:13,029 INFO L290 TraceCheckUtils]: 21: Hoare triple {3284#true} assume !(0 == ~cond); {3284#true} is VALID [2022-04-27 13:37:13,029 INFO L290 TraceCheckUtils]: 20: Hoare triple {3284#true} ~cond := #in~cond; {3284#true} is VALID [2022-04-27 13:37:13,030 INFO L272 TraceCheckUtils]: 19: Hoare triple {3480#(= (mod (* main_~d~0 2) 4294967296) (mod (* (* main_~p~0 2) main_~B~0) 4294967296))} call __VERIFIER_assert((if ~r~0 % 4294967296 == ~A~0 % 4294967296 then 1 else 0)); {3284#true} is VALID [2022-04-27 13:37:13,030 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {3284#true} {3480#(= (mod (* main_~d~0 2) 4294967296) (mod (* (* main_~p~0 2) main_~B~0) 4294967296))} #82#return; {3480#(= (mod (* main_~d~0 2) 4294967296) (mod (* (* main_~p~0 2) main_~B~0) 4294967296))} is VALID [2022-04-27 13:37:13,030 INFO L290 TraceCheckUtils]: 17: Hoare triple {3284#true} assume true; {3284#true} is VALID [2022-04-27 13:37:13,030 INFO L290 TraceCheckUtils]: 16: Hoare triple {3284#true} assume !(0 == ~cond); {3284#true} is VALID [2022-04-27 13:37:13,030 INFO L290 TraceCheckUtils]: 15: Hoare triple {3284#true} ~cond := #in~cond; {3284#true} is VALID [2022-04-27 13:37:13,030 INFO L272 TraceCheckUtils]: 14: Hoare triple {3480#(= (mod (* main_~d~0 2) 4294967296) (mod (* (* main_~p~0 2) main_~B~0) 4294967296))} call __VERIFIER_assert((if 0 == ~q~0 % 4294967296 then 1 else 0)); {3284#true} is VALID [2022-04-27 13:37:13,031 INFO L290 TraceCheckUtils]: 13: Hoare triple {3480#(= (mod (* main_~d~0 2) 4294967296) (mod (* (* main_~p~0 2) main_~B~0) 4294967296))} assume !!(#t~post6 < 50);havoc #t~post6; {3480#(= (mod (* main_~d~0 2) 4294967296) (mod (* (* main_~p~0 2) main_~B~0) 4294967296))} is VALID [2022-04-27 13:37:13,031 INFO L290 TraceCheckUtils]: 12: Hoare triple {3480#(= (mod (* main_~d~0 2) 4294967296) (mod (* (* main_~p~0 2) main_~B~0) 4294967296))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {3480#(= (mod (* main_~d~0 2) 4294967296) (mod (* (* main_~p~0 2) main_~B~0) 4294967296))} is VALID [2022-04-27 13:37:13,032 INFO L290 TraceCheckUtils]: 11: Hoare triple {3284#true} ~r~0 := ~A~0;~d~0 := ~B~0;~p~0 := 1;~q~0 := 0; {3480#(= (mod (* main_~d~0 2) 4294967296) (mod (* (* main_~p~0 2) main_~B~0) 4294967296))} is VALID [2022-04-27 13:37:13,032 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {3284#true} {3284#true} #80#return; {3284#true} is VALID [2022-04-27 13:37:13,032 INFO L290 TraceCheckUtils]: 9: Hoare triple {3284#true} assume true; {3284#true} is VALID [2022-04-27 13:37:13,032 INFO L290 TraceCheckUtils]: 8: Hoare triple {3284#true} assume !(0 == ~cond); {3284#true} is VALID [2022-04-27 13:37:13,032 INFO L290 TraceCheckUtils]: 7: Hoare triple {3284#true} ~cond := #in~cond; {3284#true} is VALID [2022-04-27 13:37:13,032 INFO L272 TraceCheckUtils]: 6: Hoare triple {3284#true} call assume_abort_if_not((if ~B~0 % 4294967296 >= 1 then 1 else 0)); {3284#true} is VALID [2022-04-27 13:37:13,032 INFO L290 TraceCheckUtils]: 5: Hoare triple {3284#true} havoc ~A~0;havoc ~B~0;havoc ~r~0;havoc ~d~0;havoc ~p~0;havoc ~q~0;~A~0 := #t~nondet4;havoc #t~nondet4;~B~0 := #t~nondet5;havoc #t~nondet5; {3284#true} is VALID [2022-04-27 13:37:13,032 INFO L272 TraceCheckUtils]: 4: Hoare triple {3284#true} call #t~ret8 := main(); {3284#true} is VALID [2022-04-27 13:37:13,032 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3284#true} {3284#true} #96#return; {3284#true} is VALID [2022-04-27 13:37:13,032 INFO L290 TraceCheckUtils]: 2: Hoare triple {3284#true} assume true; {3284#true} is VALID [2022-04-27 13:37:13,032 INFO L290 TraceCheckUtils]: 1: Hoare triple {3284#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(9, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {3284#true} is VALID [2022-04-27 13:37:13,032 INFO L272 TraceCheckUtils]: 0: Hoare triple {3284#true} call ULTIMATE.init(); {3284#true} is VALID [2022-04-27 13:37:13,033 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2022-04-27 13:37:13,033 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 13:37:13,033 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1201506964] [2022-04-27 13:37:13,033 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 13:37:13,033 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1418738216] [2022-04-27 13:37:13,033 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1418738216] provided 1 perfect and 1 imperfect interpolant sequences [2022-04-27 13:37:13,033 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-04-27 13:37:13,033 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [9] total 11 [2022-04-27 13:37:13,033 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1504995208] [2022-04-27 13:37:13,033 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 13:37:13,034 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 3 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 46 [2022-04-27 13:37:13,034 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 13:37:13,034 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 3 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-04-27 13:37:15,069 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 34 edges. 33 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-27 13:37:15,069 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-27 13:37:15,069 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 13:37:15,069 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-27 13:37:15,069 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2022-04-27 13:37:15,070 INFO L87 Difference]: Start difference. First operand 138 states and 166 transitions. Second operand has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 3 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-04-27 13:37:17,587 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 13:37:19,925 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 13:37:22,050 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.12s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-27 13:37:23,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:37:23,828 INFO L93 Difference]: Finished difference Result 162 states and 199 transitions. [2022-04-27 13:37:23,828 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-27 13:37:23,828 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 3 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 46 [2022-04-27 13:37:23,828 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 13:37:23,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 3 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-04-27 13:37:23,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 59 transitions. [2022-04-27 13:37:23,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 3 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-04-27 13:37:23,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 59 transitions. [2022-04-27 13:37:23,831 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 59 transitions. [2022-04-27 13:37:25,895 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 59 edges. 58 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-27 13:37:25,898 INFO L225 Difference]: With dead ends: 162 [2022-04-27 13:37:25,898 INFO L226 Difference]: Without dead ends: 160 [2022-04-27 13:37:25,899 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 81 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2022-04-27 13:37:25,899 INFO L413 NwaCegarLoop]: 43 mSDtfsCounter, 17 mSDsluCounter, 89 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 5 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 132 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.9s IncrementalHoareTripleChecker+Time [2022-04-27 13:37:25,899 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 132 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 50 Invalid, 3 Unknown, 0 Unchecked, 6.9s Time] [2022-04-27 13:37:25,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2022-04-27 13:37:25,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 154. [2022-04-27 13:37:25,943 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 13:37:25,944 INFO L82 GeneralOperation]: Start isEquivalent. First operand 160 states. Second operand has 154 states, 98 states have (on average 1.2040816326530612) internal successors, (118), 104 states have internal predecessors, (118), 35 states have call successors, (35), 21 states have call predecessors, (35), 20 states have return successors, (32), 28 states have call predecessors, (32), 32 states have call successors, (32) [2022-04-27 13:37:25,944 INFO L74 IsIncluded]: Start isIncluded. First operand 160 states. Second operand has 154 states, 98 states have (on average 1.2040816326530612) internal successors, (118), 104 states have internal predecessors, (118), 35 states have call successors, (35), 21 states have call predecessors, (35), 20 states have return successors, (32), 28 states have call predecessors, (32), 32 states have call successors, (32) [2022-04-27 13:37:25,944 INFO L87 Difference]: Start difference. First operand 160 states. Second operand has 154 states, 98 states have (on average 1.2040816326530612) internal successors, (118), 104 states have internal predecessors, (118), 35 states have call successors, (35), 21 states have call predecessors, (35), 20 states have return successors, (32), 28 states have call predecessors, (32), 32 states have call successors, (32) [2022-04-27 13:37:25,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:37:25,948 INFO L93 Difference]: Finished difference Result 160 states and 195 transitions. [2022-04-27 13:37:25,948 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 195 transitions. [2022-04-27 13:37:25,949 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:37:25,949 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:37:25,949 INFO L74 IsIncluded]: Start isIncluded. First operand has 154 states, 98 states have (on average 1.2040816326530612) internal successors, (118), 104 states have internal predecessors, (118), 35 states have call successors, (35), 21 states have call predecessors, (35), 20 states have return successors, (32), 28 states have call predecessors, (32), 32 states have call successors, (32) Second operand 160 states. [2022-04-27 13:37:25,950 INFO L87 Difference]: Start difference. First operand has 154 states, 98 states have (on average 1.2040816326530612) internal successors, (118), 104 states have internal predecessors, (118), 35 states have call successors, (35), 21 states have call predecessors, (35), 20 states have return successors, (32), 28 states have call predecessors, (32), 32 states have call successors, (32) Second operand 160 states. [2022-04-27 13:37:25,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:37:25,953 INFO L93 Difference]: Finished difference Result 160 states and 195 transitions. [2022-04-27 13:37:25,953 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 195 transitions. [2022-04-27 13:37:25,954 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:37:25,954 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:37:25,954 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 13:37:25,954 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 13:37:25,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 154 states, 98 states have (on average 1.2040816326530612) internal successors, (118), 104 states have internal predecessors, (118), 35 states have call successors, (35), 21 states have call predecessors, (35), 20 states have return successors, (32), 28 states have call predecessors, (32), 32 states have call successors, (32) [2022-04-27 13:37:25,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 185 transitions. [2022-04-27 13:37:25,958 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 185 transitions. Word has length 46 [2022-04-27 13:37:25,958 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 13:37:25,958 INFO L495 AbstractCegarLoop]: Abstraction has 154 states and 185 transitions. [2022-04-27 13:37:25,958 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 3 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-04-27 13:37:25,958 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 185 transitions. [2022-04-27 13:37:25,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2022-04-27 13:37:25,959 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 13:37:25,959 INFO L195 NwaCegarLoop]: trace histogram [6, 5, 5, 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, 1, 1, 1] [2022-04-27 13:37:25,963 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 13:37:26,163 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 13:37:26,163 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 13:37:26,163 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 13:37:26,163 INFO L85 PathProgramCache]: Analyzing trace with hash -399036107, now seen corresponding path program 1 times [2022-04-27 13:37:26,164 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 13:37:26,164 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1025265542] [2022-04-27 13:37:26,164 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:37:26,164 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 13:37:26,176 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 13:37:26,176 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [695313813] [2022-04-27 13:37:26,177 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:37:26,177 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 13:37:26,177 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 13:37:26,178 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 13:37:26,202 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 13:37:26,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:37:26,234 INFO L263 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-27 13:37:26,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:37:26,245 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 13:37:26,472 INFO L272 TraceCheckUtils]: 0: Hoare triple {4334#true} call ULTIMATE.init(); {4334#true} is VALID [2022-04-27 13:37:26,473 INFO L290 TraceCheckUtils]: 1: Hoare triple {4334#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(9, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {4342#(<= ~counter~0 0)} is VALID [2022-04-27 13:37:26,473 INFO L290 TraceCheckUtils]: 2: Hoare triple {4342#(<= ~counter~0 0)} assume true; {4342#(<= ~counter~0 0)} is VALID [2022-04-27 13:37:26,474 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4342#(<= ~counter~0 0)} {4334#true} #96#return; {4342#(<= ~counter~0 0)} is VALID [2022-04-27 13:37:26,474 INFO L272 TraceCheckUtils]: 4: Hoare triple {4342#(<= ~counter~0 0)} call #t~ret8 := main(); {4342#(<= ~counter~0 0)} is VALID [2022-04-27 13:37:26,474 INFO L290 TraceCheckUtils]: 5: Hoare triple {4342#(<= ~counter~0 0)} havoc ~A~0;havoc ~B~0;havoc ~r~0;havoc ~d~0;havoc ~p~0;havoc ~q~0;~A~0 := #t~nondet4;havoc #t~nondet4;~B~0 := #t~nondet5;havoc #t~nondet5; {4342#(<= ~counter~0 0)} is VALID [2022-04-27 13:37:26,480 INFO L272 TraceCheckUtils]: 6: Hoare triple {4342#(<= ~counter~0 0)} call assume_abort_if_not((if ~B~0 % 4294967296 >= 1 then 1 else 0)); {4342#(<= ~counter~0 0)} is VALID [2022-04-27 13:37:26,480 INFO L290 TraceCheckUtils]: 7: Hoare triple {4342#(<= ~counter~0 0)} ~cond := #in~cond; {4342#(<= ~counter~0 0)} is VALID [2022-04-27 13:37:26,480 INFO L290 TraceCheckUtils]: 8: Hoare triple {4342#(<= ~counter~0 0)} assume !(0 == ~cond); {4342#(<= ~counter~0 0)} is VALID [2022-04-27 13:37:26,481 INFO L290 TraceCheckUtils]: 9: Hoare triple {4342#(<= ~counter~0 0)} assume true; {4342#(<= ~counter~0 0)} is VALID [2022-04-27 13:37:26,481 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {4342#(<= ~counter~0 0)} {4342#(<= ~counter~0 0)} #80#return; {4342#(<= ~counter~0 0)} is VALID [2022-04-27 13:37:26,481 INFO L290 TraceCheckUtils]: 11: Hoare triple {4342#(<= ~counter~0 0)} ~r~0 := ~A~0;~d~0 := ~B~0;~p~0 := 1;~q~0 := 0; {4342#(<= ~counter~0 0)} is VALID [2022-04-27 13:37:26,482 INFO L290 TraceCheckUtils]: 12: Hoare triple {4342#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {4376#(<= ~counter~0 1)} is VALID [2022-04-27 13:37:26,482 INFO L290 TraceCheckUtils]: 13: Hoare triple {4376#(<= ~counter~0 1)} assume !!(#t~post6 < 50);havoc #t~post6; {4376#(<= ~counter~0 1)} is VALID [2022-04-27 13:37:26,483 INFO L272 TraceCheckUtils]: 14: Hoare triple {4376#(<= ~counter~0 1)} call __VERIFIER_assert((if 0 == ~q~0 % 4294967296 then 1 else 0)); {4376#(<= ~counter~0 1)} is VALID [2022-04-27 13:37:26,483 INFO L290 TraceCheckUtils]: 15: Hoare triple {4376#(<= ~counter~0 1)} ~cond := #in~cond; {4376#(<= ~counter~0 1)} is VALID [2022-04-27 13:37:26,483 INFO L290 TraceCheckUtils]: 16: Hoare triple {4376#(<= ~counter~0 1)} assume !(0 == ~cond); {4376#(<= ~counter~0 1)} is VALID [2022-04-27 13:37:26,484 INFO L290 TraceCheckUtils]: 17: Hoare triple {4376#(<= ~counter~0 1)} assume true; {4376#(<= ~counter~0 1)} is VALID [2022-04-27 13:37:26,484 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {4376#(<= ~counter~0 1)} {4376#(<= ~counter~0 1)} #82#return; {4376#(<= ~counter~0 1)} is VALID [2022-04-27 13:37:26,485 INFO L272 TraceCheckUtils]: 19: Hoare triple {4376#(<= ~counter~0 1)} call __VERIFIER_assert((if ~r~0 % 4294967296 == ~A~0 % 4294967296 then 1 else 0)); {4376#(<= ~counter~0 1)} is VALID [2022-04-27 13:37:26,485 INFO L290 TraceCheckUtils]: 20: Hoare triple {4376#(<= ~counter~0 1)} ~cond := #in~cond; {4376#(<= ~counter~0 1)} is VALID [2022-04-27 13:37:26,485 INFO L290 TraceCheckUtils]: 21: Hoare triple {4376#(<= ~counter~0 1)} assume !(0 == ~cond); {4376#(<= ~counter~0 1)} is VALID [2022-04-27 13:37:26,485 INFO L290 TraceCheckUtils]: 22: Hoare triple {4376#(<= ~counter~0 1)} assume true; {4376#(<= ~counter~0 1)} is VALID [2022-04-27 13:37:26,486 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {4376#(<= ~counter~0 1)} {4376#(<= ~counter~0 1)} #84#return; {4376#(<= ~counter~0 1)} is VALID [2022-04-27 13:37:26,486 INFO L272 TraceCheckUtils]: 24: Hoare triple {4376#(<= ~counter~0 1)} call __VERIFIER_assert((if ~d~0 % 4294967296 == ~B~0 * ~p~0 % 4294967296 then 1 else 0)); {4376#(<= ~counter~0 1)} is VALID [2022-04-27 13:37:26,487 INFO L290 TraceCheckUtils]: 25: Hoare triple {4376#(<= ~counter~0 1)} ~cond := #in~cond; {4376#(<= ~counter~0 1)} is VALID [2022-04-27 13:37:26,487 INFO L290 TraceCheckUtils]: 26: Hoare triple {4376#(<= ~counter~0 1)} assume !(0 == ~cond); {4376#(<= ~counter~0 1)} is VALID [2022-04-27 13:37:26,487 INFO L290 TraceCheckUtils]: 27: Hoare triple {4376#(<= ~counter~0 1)} assume true; {4376#(<= ~counter~0 1)} is VALID [2022-04-27 13:37:26,488 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {4376#(<= ~counter~0 1)} {4376#(<= ~counter~0 1)} #86#return; {4376#(<= ~counter~0 1)} is VALID [2022-04-27 13:37:26,488 INFO L290 TraceCheckUtils]: 29: Hoare triple {4376#(<= ~counter~0 1)} assume !(~r~0 % 4294967296 >= ~d~0 % 4294967296); {4376#(<= ~counter~0 1)} is VALID [2022-04-27 13:37:26,488 INFO L290 TraceCheckUtils]: 30: Hoare triple {4376#(<= ~counter~0 1)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {4431#(<= ~counter~0 2)} is VALID [2022-04-27 13:37:26,489 INFO L290 TraceCheckUtils]: 31: Hoare triple {4431#(<= ~counter~0 2)} assume !!(#t~post7 < 50);havoc #t~post7; {4431#(<= ~counter~0 2)} is VALID [2022-04-27 13:37:26,489 INFO L272 TraceCheckUtils]: 32: Hoare triple {4431#(<= ~counter~0 2)} call __VERIFIER_assert((if ~A~0 % 4294967296 == (~q~0 * ~B~0 + ~r~0) % 4294967296 then 1 else 0)); {4431#(<= ~counter~0 2)} is VALID [2022-04-27 13:37:26,490 INFO L290 TraceCheckUtils]: 33: Hoare triple {4431#(<= ~counter~0 2)} ~cond := #in~cond; {4431#(<= ~counter~0 2)} is VALID [2022-04-27 13:37:26,490 INFO L290 TraceCheckUtils]: 34: Hoare triple {4431#(<= ~counter~0 2)} assume !(0 == ~cond); {4431#(<= ~counter~0 2)} is VALID [2022-04-27 13:37:26,490 INFO L290 TraceCheckUtils]: 35: Hoare triple {4431#(<= ~counter~0 2)} assume true; {4431#(<= ~counter~0 2)} is VALID [2022-04-27 13:37:26,491 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {4431#(<= ~counter~0 2)} {4431#(<= ~counter~0 2)} #88#return; {4431#(<= ~counter~0 2)} is VALID [2022-04-27 13:37:26,491 INFO L272 TraceCheckUtils]: 37: Hoare triple {4431#(<= ~counter~0 2)} call __VERIFIER_assert((if ~d~0 % 4294967296 == ~B~0 * ~p~0 % 4294967296 then 1 else 0)); {4431#(<= ~counter~0 2)} is VALID [2022-04-27 13:37:26,491 INFO L290 TraceCheckUtils]: 38: Hoare triple {4431#(<= ~counter~0 2)} ~cond := #in~cond; {4431#(<= ~counter~0 2)} is VALID [2022-04-27 13:37:26,492 INFO L290 TraceCheckUtils]: 39: Hoare triple {4431#(<= ~counter~0 2)} assume !(0 == ~cond); {4431#(<= ~counter~0 2)} is VALID [2022-04-27 13:37:26,492 INFO L290 TraceCheckUtils]: 40: Hoare triple {4431#(<= ~counter~0 2)} assume true; {4431#(<= ~counter~0 2)} is VALID [2022-04-27 13:37:26,492 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {4431#(<= ~counter~0 2)} {4431#(<= ~counter~0 2)} #90#return; {4431#(<= ~counter~0 2)} is VALID [2022-04-27 13:37:26,493 INFO L290 TraceCheckUtils]: 42: Hoare triple {4431#(<= ~counter~0 2)} assume !!(1 != ~p~0 % 4294967296);~d~0 := (if ~d~0 % 4294967296 < 0 && 0 != ~d~0 % 4294967296 % 2 then 1 + ~d~0 % 4294967296 / 2 else ~d~0 % 4294967296 / 2);~p~0 := (if ~p~0 % 4294967296 < 0 && 0 != ~p~0 % 4294967296 % 2 then 1 + ~p~0 % 4294967296 / 2 else ~p~0 % 4294967296 / 2); {4431#(<= ~counter~0 2)} is VALID [2022-04-27 13:37:26,493 INFO L290 TraceCheckUtils]: 43: Hoare triple {4431#(<= ~counter~0 2)} assume ~r~0 % 4294967296 >= ~d~0 % 4294967296;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {4431#(<= ~counter~0 2)} is VALID [2022-04-27 13:37:26,494 INFO L290 TraceCheckUtils]: 44: Hoare triple {4431#(<= ~counter~0 2)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {4474#(<= |main_#t~post7| 2)} is VALID [2022-04-27 13:37:26,494 INFO L290 TraceCheckUtils]: 45: Hoare triple {4474#(<= |main_#t~post7| 2)} assume !(#t~post7 < 50);havoc #t~post7; {4335#false} is VALID [2022-04-27 13:37:26,494 INFO L272 TraceCheckUtils]: 46: Hoare triple {4335#false} call __VERIFIER_assert((if ~A~0 % 4294967296 == (~d~0 * ~q~0 + ~r~0) % 4294967296 then 1 else 0)); {4335#false} is VALID [2022-04-27 13:37:26,494 INFO L290 TraceCheckUtils]: 47: Hoare triple {4335#false} ~cond := #in~cond; {4335#false} is VALID [2022-04-27 13:37:26,494 INFO L290 TraceCheckUtils]: 48: Hoare triple {4335#false} assume 0 == ~cond; {4335#false} is VALID [2022-04-27 13:37:26,494 INFO L290 TraceCheckUtils]: 49: Hoare triple {4335#false} assume !false; {4335#false} is VALID [2022-04-27 13:37:26,494 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 10 proven. 26 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-04-27 13:37:26,495 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 13:37:26,718 INFO L290 TraceCheckUtils]: 49: Hoare triple {4335#false} assume !false; {4335#false} is VALID [2022-04-27 13:37:26,719 INFO L290 TraceCheckUtils]: 48: Hoare triple {4335#false} assume 0 == ~cond; {4335#false} is VALID [2022-04-27 13:37:26,719 INFO L290 TraceCheckUtils]: 47: Hoare triple {4335#false} ~cond := #in~cond; {4335#false} is VALID [2022-04-27 13:37:26,719 INFO L272 TraceCheckUtils]: 46: Hoare triple {4335#false} call __VERIFIER_assert((if ~A~0 % 4294967296 == (~d~0 * ~q~0 + ~r~0) % 4294967296 then 1 else 0)); {4335#false} is VALID [2022-04-27 13:37:26,719 INFO L290 TraceCheckUtils]: 45: Hoare triple {4502#(< |main_#t~post7| 50)} assume !(#t~post7 < 50);havoc #t~post7; {4335#false} is VALID [2022-04-27 13:37:26,719 INFO L290 TraceCheckUtils]: 44: Hoare triple {4506#(< ~counter~0 50)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {4502#(< |main_#t~post7| 50)} is VALID [2022-04-27 13:37:26,720 INFO L290 TraceCheckUtils]: 43: Hoare triple {4506#(< ~counter~0 50)} assume ~r~0 % 4294967296 >= ~d~0 % 4294967296;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {4506#(< ~counter~0 50)} is VALID [2022-04-27 13:37:26,720 INFO L290 TraceCheckUtils]: 42: Hoare triple {4506#(< ~counter~0 50)} assume !!(1 != ~p~0 % 4294967296);~d~0 := (if ~d~0 % 4294967296 < 0 && 0 != ~d~0 % 4294967296 % 2 then 1 + ~d~0 % 4294967296 / 2 else ~d~0 % 4294967296 / 2);~p~0 := (if ~p~0 % 4294967296 < 0 && 0 != ~p~0 % 4294967296 % 2 then 1 + ~p~0 % 4294967296 / 2 else ~p~0 % 4294967296 / 2); {4506#(< ~counter~0 50)} is VALID [2022-04-27 13:37:26,720 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {4334#true} {4506#(< ~counter~0 50)} #90#return; {4506#(< ~counter~0 50)} is VALID [2022-04-27 13:37:26,721 INFO L290 TraceCheckUtils]: 40: Hoare triple {4334#true} assume true; {4334#true} is VALID [2022-04-27 13:37:26,721 INFO L290 TraceCheckUtils]: 39: Hoare triple {4334#true} assume !(0 == ~cond); {4334#true} is VALID [2022-04-27 13:37:26,721 INFO L290 TraceCheckUtils]: 38: Hoare triple {4334#true} ~cond := #in~cond; {4334#true} is VALID [2022-04-27 13:37:26,721 INFO L272 TraceCheckUtils]: 37: Hoare triple {4506#(< ~counter~0 50)} call __VERIFIER_assert((if ~d~0 % 4294967296 == ~B~0 * ~p~0 % 4294967296 then 1 else 0)); {4334#true} is VALID [2022-04-27 13:37:26,721 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {4334#true} {4506#(< ~counter~0 50)} #88#return; {4506#(< ~counter~0 50)} is VALID [2022-04-27 13:37:26,721 INFO L290 TraceCheckUtils]: 35: Hoare triple {4334#true} assume true; {4334#true} is VALID [2022-04-27 13:37:26,721 INFO L290 TraceCheckUtils]: 34: Hoare triple {4334#true} assume !(0 == ~cond); {4334#true} is VALID [2022-04-27 13:37:26,722 INFO L290 TraceCheckUtils]: 33: Hoare triple {4334#true} ~cond := #in~cond; {4334#true} is VALID [2022-04-27 13:37:26,722 INFO L272 TraceCheckUtils]: 32: Hoare triple {4506#(< ~counter~0 50)} call __VERIFIER_assert((if ~A~0 % 4294967296 == (~q~0 * ~B~0 + ~r~0) % 4294967296 then 1 else 0)); {4334#true} is VALID [2022-04-27 13:37:26,722 INFO L290 TraceCheckUtils]: 31: Hoare triple {4506#(< ~counter~0 50)} assume !!(#t~post7 < 50);havoc #t~post7; {4506#(< ~counter~0 50)} is VALID [2022-04-27 13:37:26,722 INFO L290 TraceCheckUtils]: 30: Hoare triple {4549#(< ~counter~0 49)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {4506#(< ~counter~0 50)} is VALID [2022-04-27 13:37:26,723 INFO L290 TraceCheckUtils]: 29: Hoare triple {4549#(< ~counter~0 49)} assume !(~r~0 % 4294967296 >= ~d~0 % 4294967296); {4549#(< ~counter~0 49)} is VALID [2022-04-27 13:37:26,723 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {4334#true} {4549#(< ~counter~0 49)} #86#return; {4549#(< ~counter~0 49)} is VALID [2022-04-27 13:37:26,723 INFO L290 TraceCheckUtils]: 27: Hoare triple {4334#true} assume true; {4334#true} is VALID [2022-04-27 13:37:26,723 INFO L290 TraceCheckUtils]: 26: Hoare triple {4334#true} assume !(0 == ~cond); {4334#true} is VALID [2022-04-27 13:37:26,724 INFO L290 TraceCheckUtils]: 25: Hoare triple {4334#true} ~cond := #in~cond; {4334#true} is VALID [2022-04-27 13:37:26,724 INFO L272 TraceCheckUtils]: 24: Hoare triple {4549#(< ~counter~0 49)} call __VERIFIER_assert((if ~d~0 % 4294967296 == ~B~0 * ~p~0 % 4294967296 then 1 else 0)); {4334#true} is VALID [2022-04-27 13:37:26,724 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {4334#true} {4549#(< ~counter~0 49)} #84#return; {4549#(< ~counter~0 49)} is VALID [2022-04-27 13:37:26,724 INFO L290 TraceCheckUtils]: 22: Hoare triple {4334#true} assume true; {4334#true} is VALID [2022-04-27 13:37:26,724 INFO L290 TraceCheckUtils]: 21: Hoare triple {4334#true} assume !(0 == ~cond); {4334#true} is VALID [2022-04-27 13:37:26,724 INFO L290 TraceCheckUtils]: 20: Hoare triple {4334#true} ~cond := #in~cond; {4334#true} is VALID [2022-04-27 13:37:26,724 INFO L272 TraceCheckUtils]: 19: Hoare triple {4549#(< ~counter~0 49)} call __VERIFIER_assert((if ~r~0 % 4294967296 == ~A~0 % 4294967296 then 1 else 0)); {4334#true} is VALID [2022-04-27 13:37:26,725 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {4334#true} {4549#(< ~counter~0 49)} #82#return; {4549#(< ~counter~0 49)} is VALID [2022-04-27 13:37:26,725 INFO L290 TraceCheckUtils]: 17: Hoare triple {4334#true} assume true; {4334#true} is VALID [2022-04-27 13:37:26,725 INFO L290 TraceCheckUtils]: 16: Hoare triple {4334#true} assume !(0 == ~cond); {4334#true} is VALID [2022-04-27 13:37:26,725 INFO L290 TraceCheckUtils]: 15: Hoare triple {4334#true} ~cond := #in~cond; {4334#true} is VALID [2022-04-27 13:37:26,725 INFO L272 TraceCheckUtils]: 14: Hoare triple {4549#(< ~counter~0 49)} call __VERIFIER_assert((if 0 == ~q~0 % 4294967296 then 1 else 0)); {4334#true} is VALID [2022-04-27 13:37:26,725 INFO L290 TraceCheckUtils]: 13: Hoare triple {4549#(< ~counter~0 49)} assume !!(#t~post6 < 50);havoc #t~post6; {4549#(< ~counter~0 49)} is VALID [2022-04-27 13:37:26,726 INFO L290 TraceCheckUtils]: 12: Hoare triple {4604#(< ~counter~0 48)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {4549#(< ~counter~0 49)} is VALID [2022-04-27 13:37:26,726 INFO L290 TraceCheckUtils]: 11: Hoare triple {4604#(< ~counter~0 48)} ~r~0 := ~A~0;~d~0 := ~B~0;~p~0 := 1;~q~0 := 0; {4604#(< ~counter~0 48)} is VALID [2022-04-27 13:37:26,727 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {4334#true} {4604#(< ~counter~0 48)} #80#return; {4604#(< ~counter~0 48)} is VALID [2022-04-27 13:37:26,727 INFO L290 TraceCheckUtils]: 9: Hoare triple {4334#true} assume true; {4334#true} is VALID [2022-04-27 13:37:26,727 INFO L290 TraceCheckUtils]: 8: Hoare triple {4334#true} assume !(0 == ~cond); {4334#true} is VALID [2022-04-27 13:37:26,727 INFO L290 TraceCheckUtils]: 7: Hoare triple {4334#true} ~cond := #in~cond; {4334#true} is VALID [2022-04-27 13:37:26,727 INFO L272 TraceCheckUtils]: 6: Hoare triple {4604#(< ~counter~0 48)} call assume_abort_if_not((if ~B~0 % 4294967296 >= 1 then 1 else 0)); {4334#true} is VALID [2022-04-27 13:37:26,727 INFO L290 TraceCheckUtils]: 5: Hoare triple {4604#(< ~counter~0 48)} havoc ~A~0;havoc ~B~0;havoc ~r~0;havoc ~d~0;havoc ~p~0;havoc ~q~0;~A~0 := #t~nondet4;havoc #t~nondet4;~B~0 := #t~nondet5;havoc #t~nondet5; {4604#(< ~counter~0 48)} is VALID [2022-04-27 13:37:26,727 INFO L272 TraceCheckUtils]: 4: Hoare triple {4604#(< ~counter~0 48)} call #t~ret8 := main(); {4604#(< ~counter~0 48)} is VALID [2022-04-27 13:37:26,728 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4604#(< ~counter~0 48)} {4334#true} #96#return; {4604#(< ~counter~0 48)} is VALID [2022-04-27 13:37:26,728 INFO L290 TraceCheckUtils]: 2: Hoare triple {4604#(< ~counter~0 48)} assume true; {4604#(< ~counter~0 48)} is VALID [2022-04-27 13:37:26,729 INFO L290 TraceCheckUtils]: 1: Hoare triple {4334#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(9, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {4604#(< ~counter~0 48)} is VALID [2022-04-27 13:37:26,729 INFO L272 TraceCheckUtils]: 0: Hoare triple {4334#true} call ULTIMATE.init(); {4334#true} is VALID [2022-04-27 13:37:26,729 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 10 proven. 2 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2022-04-27 13:37:26,729 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 13:37:26,729 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1025265542] [2022-04-27 13:37:26,729 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 13:37:26,729 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [695313813] [2022-04-27 13:37:26,729 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [695313813] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 13:37:26,729 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-27 13:37:26,729 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2022-04-27 13:37:26,730 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1564798323] [2022-04-27 13:37:26,730 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-27 13:37:26,730 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.4) internal successors, (44), 10 states have internal predecessors, (44), 8 states have call successors, (16), 6 states have call predecessors, (16), 5 states have return successors, (14), 6 states have call predecessors, (14), 7 states have call successors, (14) Word has length 50 [2022-04-27 13:37:26,730 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 13:37:26,730 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 10 states, 10 states have (on average 4.4) internal successors, (44), 10 states have internal predecessors, (44), 8 states have call successors, (16), 6 states have call predecessors, (16), 5 states have return successors, (14), 6 states have call predecessors, (14), 7 states have call successors, (14) [2022-04-27 13:37:26,784 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 74 edges. 74 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 13:37:26,785 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-27 13:37:26,785 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 13:37:26,785 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-27 13:37:26,785 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-04-27 13:37:26,785 INFO L87 Difference]: Start difference. First operand 154 states and 185 transitions. Second operand has 10 states, 10 states have (on average 4.4) internal successors, (44), 10 states have internal predecessors, (44), 8 states have call successors, (16), 6 states have call predecessors, (16), 5 states have return successors, (14), 6 states have call predecessors, (14), 7 states have call successors, (14) [2022-04-27 13:37:30,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:37:30,094 INFO L93 Difference]: Finished difference Result 281 states and 346 transitions. [2022-04-27 13:37:30,094 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-04-27 13:37:30,094 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.4) internal successors, (44), 10 states have internal predecessors, (44), 8 states have call successors, (16), 6 states have call predecessors, (16), 5 states have return successors, (14), 6 states have call predecessors, (14), 7 states have call successors, (14) Word has length 50 [2022-04-27 13:37:30,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 13:37:30,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 4.4) internal successors, (44), 10 states have internal predecessors, (44), 8 states have call successors, (16), 6 states have call predecessors, (16), 5 states have return successors, (14), 6 states have call predecessors, (14), 7 states have call successors, (14) [2022-04-27 13:37:30,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 177 transitions. [2022-04-27 13:37:30,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 4.4) internal successors, (44), 10 states have internal predecessors, (44), 8 states have call successors, (16), 6 states have call predecessors, (16), 5 states have return successors, (14), 6 states have call predecessors, (14), 7 states have call successors, (14) [2022-04-27 13:37:30,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 177 transitions. [2022-04-27 13:37:30,098 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 13 states and 177 transitions. [2022-04-27 13:37:30,247 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 177 edges. 177 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 13:37:30,252 INFO L225 Difference]: With dead ends: 281 [2022-04-27 13:37:30,252 INFO L226 Difference]: Without dead ends: 257 [2022-04-27 13:37:30,253 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 91 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 13:37:30,253 INFO L413 NwaCegarLoop]: 68 mSDtfsCounter, 153 mSDsluCounter, 160 mSDsCounter, 0 mSdLazyCounter, 132 mSolverCounterSat, 104 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 153 SdHoareTripleChecker+Valid, 228 SdHoareTripleChecker+Invalid, 236 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 104 IncrementalHoareTripleChecker+Valid, 132 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2022-04-27 13:37:30,253 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [153 Valid, 228 Invalid, 236 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [104 Valid, 132 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2022-04-27 13:37:30,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 257 states. [2022-04-27 13:37:30,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 257 to 250. [2022-04-27 13:37:30,337 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 13:37:30,338 INFO L82 GeneralOperation]: Start isEquivalent. First operand 257 states. Second operand has 250 states, 160 states have (on average 1.2) internal successors, (192), 172 states have internal predecessors, (192), 59 states have call successors, (59), 31 states have call predecessors, (59), 30 states have return successors, (54), 46 states have call predecessors, (54), 54 states have call successors, (54) [2022-04-27 13:37:30,338 INFO L74 IsIncluded]: Start isIncluded. First operand 257 states. Second operand has 250 states, 160 states have (on average 1.2) internal successors, (192), 172 states have internal predecessors, (192), 59 states have call successors, (59), 31 states have call predecessors, (59), 30 states have return successors, (54), 46 states have call predecessors, (54), 54 states have call successors, (54) [2022-04-27 13:37:30,339 INFO L87 Difference]: Start difference. First operand 257 states. Second operand has 250 states, 160 states have (on average 1.2) internal successors, (192), 172 states have internal predecessors, (192), 59 states have call successors, (59), 31 states have call predecessors, (59), 30 states have return successors, (54), 46 states have call predecessors, (54), 54 states have call successors, (54) [2022-04-27 13:37:30,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:37:30,344 INFO L93 Difference]: Finished difference Result 257 states and 309 transitions. [2022-04-27 13:37:30,344 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 309 transitions. [2022-04-27 13:37:30,345 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:37:30,345 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:37:30,345 INFO L74 IsIncluded]: Start isIncluded. First operand has 250 states, 160 states have (on average 1.2) internal successors, (192), 172 states have internal predecessors, (192), 59 states have call successors, (59), 31 states have call predecessors, (59), 30 states have return successors, (54), 46 states have call predecessors, (54), 54 states have call successors, (54) Second operand 257 states. [2022-04-27 13:37:30,346 INFO L87 Difference]: Start difference. First operand has 250 states, 160 states have (on average 1.2) internal successors, (192), 172 states have internal predecessors, (192), 59 states have call successors, (59), 31 states have call predecessors, (59), 30 states have return successors, (54), 46 states have call predecessors, (54), 54 states have call successors, (54) Second operand 257 states. [2022-04-27 13:37:30,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:37:30,350 INFO L93 Difference]: Finished difference Result 257 states and 309 transitions. [2022-04-27 13:37:30,351 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 309 transitions. [2022-04-27 13:37:30,351 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:37:30,351 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:37:30,351 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 13:37:30,351 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 13:37:30,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 250 states, 160 states have (on average 1.2) internal successors, (192), 172 states have internal predecessors, (192), 59 states have call successors, (59), 31 states have call predecessors, (59), 30 states have return successors, (54), 46 states have call predecessors, (54), 54 states have call successors, (54) [2022-04-27 13:37:30,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 305 transitions. [2022-04-27 13:37:30,357 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 305 transitions. Word has length 50 [2022-04-27 13:37:30,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 13:37:30,357 INFO L495 AbstractCegarLoop]: Abstraction has 250 states and 305 transitions. [2022-04-27 13:37:30,357 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.4) internal successors, (44), 10 states have internal predecessors, (44), 8 states have call successors, (16), 6 states have call predecessors, (16), 5 states have return successors, (14), 6 states have call predecessors, (14), 7 states have call successors, (14) [2022-04-27 13:37:30,358 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 305 transitions. [2022-04-27 13:37:30,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2022-04-27 13:37:30,358 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 13:37:30,358 INFO L195 NwaCegarLoop]: trace histogram [6, 5, 5, 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] [2022-04-27 13:37:30,381 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2022-04-27 13:37:30,571 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 13:37:30,571 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 13:37:30,572 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 13:37:30,572 INFO L85 PathProgramCache]: Analyzing trace with hash -397308229, now seen corresponding path program 1 times [2022-04-27 13:37:30,572 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 13:37:30,572 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1469789649] [2022-04-27 13:37:30,572 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:37:30,572 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 13:37:30,583 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 13:37:30,583 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2011623161] [2022-04-27 13:37:30,584 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:37:30,584 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 13:37:30,584 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 13:37:30,585 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 13:37:30,586 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process