/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/divbin_unwindbound50.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-fb4f59a-m [2022-04-27 12:47:00,486 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-27 12:47:00,487 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-27 12:47:00,536 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-27 12:47:00,536 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-27 12:47:00,537 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-27 12:47:00,538 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-27 12:47:00,539 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-27 12:47:00,540 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-27 12:47:00,541 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-27 12:47:00,541 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-27 12:47:00,542 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-27 12:47:00,542 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-27 12:47:00,547 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-27 12:47:00,549 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-27 12:47:00,550 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-27 12:47:00,551 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-27 12:47:00,554 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-27 12:47:00,559 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-27 12:47:00,563 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-27 12:47:00,566 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-27 12:47:00,566 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-27 12:47:00,567 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-27 12:47:00,569 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-27 12:47:00,570 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-27 12:47:00,573 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-27 12:47:00,573 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-27 12:47:00,574 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-27 12:47:00,574 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-27 12:47:00,574 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-27 12:47:00,575 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-27 12:47:00,575 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-27 12:47:00,575 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-27 12:47:00,576 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-27 12:47:00,576 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-27 12:47:00,576 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-27 12:47:00,577 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-27 12:47:00,577 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-27 12:47:00,577 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-27 12:47:00,577 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-27 12:47:00,578 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-27 12:47:00,581 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-27 12:47:00,582 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2022-04-27 12:47:00,605 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-27 12:47:00,606 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-27 12:47:00,606 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-04-27 12:47:00,606 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-04-27 12:47:00,607 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-04-27 12:47:00,607 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-04-27 12:47:00,607 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-04-27 12:47:00,607 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-04-27 12:47:00,607 INFO L138 SettingsManager]: * Use SBE=true [2022-04-27 12:47:00,608 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-27 12:47:00,608 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-27 12:47:00,608 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-27 12:47:00,608 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-27 12:47:00,608 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-27 12:47:00,608 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-27 12:47:00,608 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-27 12:47:00,608 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-27 12:47:00,609 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-27 12:47:00,609 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-27 12:47:00,609 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-27 12:47:00,609 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-27 12:47:00,610 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-27 12:47:00,610 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-27 12:47:00,610 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-27 12:47:00,610 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 12:47:00,610 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-27 12:47:00,610 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-04-27 12:47:00,610 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-04-27 12:47:00,610 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-04-27 12:47:00,610 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-04-27 12:47:00,610 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-04-27 12:47:00,611 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-04-27 12:47:00,611 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-27 12:47:00,611 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-04-27 12:47:00,790 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-27 12:47:00,810 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-27 12:47:00,812 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-27 12:47:00,812 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-27 12:47:00,813 INFO L275 PluginConnector]: CDTParser initialized [2022-04-27 12:47:00,814 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/nla-digbench-scaling/divbin_unwindbound50.i [2022-04-27 12:47:00,868 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/64505d3e3/9549b07f415c40a4ac6c71dac66a67ea/FLAGac23a5415 [2022-04-27 12:47:01,225 INFO L306 CDTParser]: Found 1 translation units. [2022-04-27 12:47:01,226 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/divbin_unwindbound50.i [2022-04-27 12:47:01,229 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/64505d3e3/9549b07f415c40a4ac6c71dac66a67ea/FLAGac23a5415 [2022-04-27 12:47:01,237 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/64505d3e3/9549b07f415c40a4ac6c71dac66a67ea [2022-04-27 12:47:01,239 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-27 12:47:01,240 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-27 12:47:01,241 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-27 12:47:01,241 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-27 12:47:01,246 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-27 12:47:01,247 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 12:47:01" (1/1) ... [2022-04-27 12:47:01,248 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3dcf00da and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 12:47:01, skipping insertion in model container [2022-04-27 12:47:01,248 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 12:47:01" (1/1) ... [2022-04-27 12:47:01,254 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-27 12:47:01,267 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-27 12:47:01,437 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/divbin_unwindbound50.i[950,963] [2022-04-27 12:47:01,461 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 12:47:01,467 INFO L203 MainTranslator]: Completed pre-run [2022-04-27 12:47:01,480 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/divbin_unwindbound50.i[950,963] [2022-04-27 12:47:01,491 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 12:47:01,499 INFO L208 MainTranslator]: Completed translation [2022-04-27 12:47:01,500 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 12:47:01 WrapperNode [2022-04-27 12:47:01,500 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-27 12:47:01,501 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-27 12:47:01,501 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-27 12:47:01,501 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-27 12:47:01,508 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 12:47:01" (1/1) ... [2022-04-27 12:47:01,508 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 12:47:01" (1/1) ... [2022-04-27 12:47:01,513 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 12:47:01" (1/1) ... [2022-04-27 12:47:01,513 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 12:47:01" (1/1) ... [2022-04-27 12:47:01,525 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 12:47:01" (1/1) ... [2022-04-27 12:47:01,530 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 12:47:01" (1/1) ... [2022-04-27 12:47:01,534 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 12:47:01" (1/1) ... [2022-04-27 12:47:01,537 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-27 12:47:01,538 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-27 12:47:01,538 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-27 12:47:01,538 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-27 12:47:01,539 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 12:47:01" (1/1) ... [2022-04-27 12:47:01,543 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 12:47:01,550 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 12:47:01,573 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-04-27 12:47:01,590 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-04-27 12:47:01,607 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-27 12:47:01,608 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-27 12:47:01,608 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-27 12:47:01,608 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-27 12:47:01,610 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-27 12:47:01,610 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-27 12:47:01,610 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-27 12:47:01,610 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-27 12:47:01,610 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_perror_fail [2022-04-27 12:47:01,610 INFO L130 BoogieDeclarations]: Found specification of procedure __assert [2022-04-27 12:47:01,610 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-27 12:47:01,610 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-27 12:47:01,610 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uint [2022-04-27 12:47:01,610 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-27 12:47:01,610 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-27 12:47:01,610 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-27 12:47:01,610 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-27 12:47:01,611 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-27 12:47:01,611 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-27 12:47:01,611 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-27 12:47:01,611 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-27 12:47:01,611 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-27 12:47:01,674 INFO L234 CfgBuilder]: Building ICFG [2022-04-27 12:47:01,675 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-27 12:47:01,814 INFO L275 CfgBuilder]: Performing block encoding [2022-04-27 12:47:01,819 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-27 12:47:01,819 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-04-27 12:47:01,820 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 12:47:01 BoogieIcfgContainer [2022-04-27 12:47:01,820 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-27 12:47:01,821 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-27 12:47:01,822 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-27 12:47:01,835 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-27 12:47:01,836 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.04 12:47:01" (1/3) ... [2022-04-27 12:47:01,836 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7f18301 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 12:47:01, skipping insertion in model container [2022-04-27 12:47:01,836 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 12:47:01" (2/3) ... [2022-04-27 12:47:01,837 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7f18301 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 12:47:01, skipping insertion in model container [2022-04-27 12:47:01,837 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 12:47:01" (3/3) ... [2022-04-27 12:47:01,838 INFO L111 eAbstractionObserver]: Analyzing ICFG divbin_unwindbound50.i [2022-04-27 12:47:01,860 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-04-27 12:47:01,860 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-27 12:47:01,909 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-27 12:47:01,920 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@239e945e, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@47845cb1 [2022-04-27 12:47:01,920 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-27 12:47:01,926 INFO L276 IsEmpty]: Start isEmpty. Operand has 33 states, 21 states have (on average 1.4761904761904763) internal successors, (31), 22 states have internal predecessors, (31), 6 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-27 12:47:01,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-04-27 12:47:01,932 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 12:47:01,932 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 12:47:01,933 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 12:47:01,937 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 12:47:01,938 INFO L85 PathProgramCache]: Analyzing trace with hash 878397729, now seen corresponding path program 1 times [2022-04-27 12:47:01,945 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 12:47:01,945 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1485517597] [2022-04-27 12:47:01,946 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 12:47:01,946 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 12:47:02,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:47:02,114 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 12:47:02,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:47:02,139 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);~counter~0 := 0; {36#true} is VALID [2022-04-27 12:47:02,140 INFO L290 TraceCheckUtils]: 1: Hoare triple {36#true} assume true; {36#true} is VALID [2022-04-27 12:47:02,140 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {36#true} {36#true} #89#return; {36#true} is VALID [2022-04-27 12:47:02,141 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-27 12:47:02,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:47:02,160 INFO L290 TraceCheckUtils]: 0: Hoare triple {36#true} ~cond := #in~cond; {36#true} is VALID [2022-04-27 12:47:02,161 INFO L290 TraceCheckUtils]: 1: Hoare triple {36#true} assume 0 == ~cond;assume false; {37#false} is VALID [2022-04-27 12:47:02,161 INFO L290 TraceCheckUtils]: 2: Hoare triple {37#false} assume true; {37#false} is VALID [2022-04-27 12:47:02,161 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {37#false} {36#true} #81#return; {37#false} is VALID [2022-04-27 12:47:02,161 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-04-27 12:47:02,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:47:02,172 INFO L290 TraceCheckUtils]: 0: Hoare triple {36#true} ~cond := #in~cond; {36#true} is VALID [2022-04-27 12:47:02,172 INFO L290 TraceCheckUtils]: 1: Hoare triple {36#true} assume 0 == ~cond;assume false; {37#false} is VALID [2022-04-27 12:47:02,172 INFO L290 TraceCheckUtils]: 2: Hoare triple {37#false} assume true; {37#false} is VALID [2022-04-27 12:47:02,172 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {37#false} {37#false} #83#return; {37#false} is VALID [2022-04-27 12:47:02,174 INFO L272 TraceCheckUtils]: 0: Hoare triple {36#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 12:47:02,174 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);~counter~0 := 0; {36#true} is VALID [2022-04-27 12:47:02,174 INFO L290 TraceCheckUtils]: 2: Hoare triple {36#true} assume true; {36#true} is VALID [2022-04-27 12:47:02,174 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {36#true} {36#true} #89#return; {36#true} is VALID [2022-04-27 12:47:02,174 INFO L272 TraceCheckUtils]: 4: Hoare triple {36#true} call #t~ret5 := main(); {36#true} is VALID [2022-04-27 12:47:02,174 INFO L290 TraceCheckUtils]: 5: Hoare triple {36#true} havoc ~A~0;havoc ~B~0;havoc ~q~0;havoc ~r~0;havoc ~b~0;~A~0 := #t~nondet1;havoc #t~nondet1;~B~0 := #t~nondet2;havoc #t~nondet2; {36#true} is VALID [2022-04-27 12:47:02,175 INFO L272 TraceCheckUtils]: 6: Hoare triple {36#true} call assume_abort_if_not((if ~B~0 % 4294967296 < 2147483647 then 1 else 0)); {36#true} is VALID [2022-04-27 12:47:02,175 INFO L290 TraceCheckUtils]: 7: Hoare triple {36#true} ~cond := #in~cond; {36#true} is VALID [2022-04-27 12:47:02,175 INFO L290 TraceCheckUtils]: 8: Hoare triple {36#true} assume 0 == ~cond;assume false; {37#false} is VALID [2022-04-27 12:47:02,176 INFO L290 TraceCheckUtils]: 9: Hoare triple {37#false} assume true; {37#false} is VALID [2022-04-27 12:47:02,176 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {37#false} {36#true} #81#return; {37#false} is VALID [2022-04-27 12:47:02,176 INFO L272 TraceCheckUtils]: 11: Hoare triple {37#false} call assume_abort_if_not((if ~B~0 % 4294967296 >= 1 then 1 else 0)); {36#true} is VALID [2022-04-27 12:47:02,177 INFO L290 TraceCheckUtils]: 12: Hoare triple {36#true} ~cond := #in~cond; {36#true} is VALID [2022-04-27 12:47:02,177 INFO L290 TraceCheckUtils]: 13: Hoare triple {36#true} assume 0 == ~cond;assume false; {37#false} is VALID [2022-04-27 12:47:02,178 INFO L290 TraceCheckUtils]: 14: Hoare triple {37#false} assume true; {37#false} is VALID [2022-04-27 12:47:02,178 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {37#false} {37#false} #83#return; {37#false} is VALID [2022-04-27 12:47:02,179 INFO L290 TraceCheckUtils]: 16: Hoare triple {37#false} ~q~0 := 0;~r~0 := ~A~0;~b~0 := ~B~0; {37#false} is VALID [2022-04-27 12:47:02,179 INFO L290 TraceCheckUtils]: 17: Hoare triple {37#false} assume !true; {37#false} is VALID [2022-04-27 12:47:02,179 INFO L290 TraceCheckUtils]: 18: Hoare triple {37#false} assume !true; {37#false} is VALID [2022-04-27 12:47:02,180 INFO L272 TraceCheckUtils]: 19: Hoare triple {37#false} call __VERIFIER_assert((if ~A~0 % 4294967296 == (~q~0 * ~b~0 + ~r~0) % 4294967296 then 1 else 0)); {37#false} is VALID [2022-04-27 12:47:02,180 INFO L290 TraceCheckUtils]: 20: Hoare triple {37#false} ~cond := #in~cond; {37#false} is VALID [2022-04-27 12:47:02,180 INFO L290 TraceCheckUtils]: 21: Hoare triple {37#false} assume 0 == ~cond; {37#false} is VALID [2022-04-27 12:47:02,180 INFO L290 TraceCheckUtils]: 22: Hoare triple {37#false} assume !false; {37#false} is VALID [2022-04-27 12:47:02,181 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-27 12:47:02,181 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 12:47:02,181 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1485517597] [2022-04-27 12:47:02,182 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1485517597] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 12:47:02,182 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 12:47:02,183 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-27 12:47:02,184 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [491430678] [2022-04-27 12:47:02,184 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 12:47:02,188 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, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 23 [2022-04-27 12:47:02,189 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 12:47:02,192 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, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-27 12:47:02,214 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 12:47:02,215 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-27 12:47:02,215 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 12:47:02,230 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-27 12:47:02,231 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-27 12:47:02,233 INFO L87 Difference]: Start difference. First operand has 33 states, 21 states have (on average 1.4761904761904763) internal successors, (31), 22 states have internal predecessors, (31), 6 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) 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, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-27 12:47:02,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:47:02,352 INFO L93 Difference]: Finished difference Result 60 states and 84 transitions. [2022-04-27 12:47:02,352 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-27 12:47:02,352 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, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 23 [2022-04-27 12:47:02,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 12:47:02,354 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, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-27 12:47:02,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 84 transitions. [2022-04-27 12:47:02,361 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, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-27 12:47:02,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 84 transitions. [2022-04-27 12:47:02,368 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 84 transitions. [2022-04-27 12:47:02,482 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 84 edges. 84 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 12:47:02,488 INFO L225 Difference]: With dead ends: 60 [2022-04-27 12:47:02,489 INFO L226 Difference]: Without dead ends: 29 [2022-04-27 12:47:02,491 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-27 12:47:02,493 INFO L413 NwaCegarLoop]: 36 mSDtfsCounter, 10 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 40 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 12:47:02,494 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 40 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 12:47:02,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2022-04-27 12:47:02,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 28. [2022-04-27 12:47:02,526 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 12:47:02,527 INFO L82 GeneralOperation]: Start isEquivalent. First operand 29 states. Second operand has 28 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 19 states have internal predecessors, (24), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-27 12:47:02,527 INFO L74 IsIncluded]: Start isIncluded. First operand 29 states. Second operand has 28 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 19 states have internal predecessors, (24), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-27 12:47:02,528 INFO L87 Difference]: Start difference. First operand 29 states. Second operand has 28 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 19 states have internal predecessors, (24), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-27 12:47:02,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:47:02,531 INFO L93 Difference]: Finished difference Result 29 states and 35 transitions. [2022-04-27 12:47:02,531 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 35 transitions. [2022-04-27 12:47:02,532 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 12:47:02,532 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 12:47:02,532 INFO L74 IsIncluded]: Start isIncluded. First operand has 28 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 19 states have internal predecessors, (24), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 29 states. [2022-04-27 12:47:02,532 INFO L87 Difference]: Start difference. First operand has 28 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 19 states have internal predecessors, (24), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 29 states. [2022-04-27 12:47:02,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:47:02,541 INFO L93 Difference]: Finished difference Result 29 states and 35 transitions. [2022-04-27 12:47:02,542 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 35 transitions. [2022-04-27 12:47:02,542 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 12:47:02,542 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 12:47:02,542 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 12:47:02,542 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 12:47:02,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 19 states have internal predecessors, (24), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-27 12:47:02,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 34 transitions. [2022-04-27 12:47:02,555 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 34 transitions. Word has length 23 [2022-04-27 12:47:02,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 12:47:02,555 INFO L495 AbstractCegarLoop]: Abstraction has 28 states and 34 transitions. [2022-04-27 12:47:02,556 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, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-27 12:47:02,556 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 34 transitions. [2022-04-27 12:47:02,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-04-27 12:47:02,557 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 12:47:02,557 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 12:47:02,557 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-27 12:47:02,557 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 12:47:02,557 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 12:47:02,558 INFO L85 PathProgramCache]: Analyzing trace with hash 994169231, now seen corresponding path program 1 times [2022-04-27 12:47:02,558 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 12:47:02,558 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [8070470] [2022-04-27 12:47:02,558 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 12:47:02,558 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 12:47:02,585 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 12:47:02,585 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [718574110] [2022-04-27 12:47:02,585 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 12:47:02,585 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 12:47:02,586 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 12:47:02,587 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 12:47:02,588 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-04-27 12:47:02,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:47:02,629 INFO L263 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 5 conjunts are in the unsatisfiable core [2022-04-27 12:47:02,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:47:02,641 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 12:47:02,801 INFO L272 TraceCheckUtils]: 0: Hoare triple {227#true} call ULTIMATE.init(); {227#true} is VALID [2022-04-27 12:47:02,802 INFO L290 TraceCheckUtils]: 1: Hoare triple {227#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);~counter~0 := 0; {235#(<= ~counter~0 0)} is VALID [2022-04-27 12:47:02,803 INFO L290 TraceCheckUtils]: 2: Hoare triple {235#(<= ~counter~0 0)} assume true; {235#(<= ~counter~0 0)} is VALID [2022-04-27 12:47:02,804 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {235#(<= ~counter~0 0)} {227#true} #89#return; {235#(<= ~counter~0 0)} is VALID [2022-04-27 12:47:02,804 INFO L272 TraceCheckUtils]: 4: Hoare triple {235#(<= ~counter~0 0)} call #t~ret5 := main(); {235#(<= ~counter~0 0)} is VALID [2022-04-27 12:47:02,804 INFO L290 TraceCheckUtils]: 5: Hoare triple {235#(<= ~counter~0 0)} havoc ~A~0;havoc ~B~0;havoc ~q~0;havoc ~r~0;havoc ~b~0;~A~0 := #t~nondet1;havoc #t~nondet1;~B~0 := #t~nondet2;havoc #t~nondet2; {235#(<= ~counter~0 0)} is VALID [2022-04-27 12:47:02,805 INFO L272 TraceCheckUtils]: 6: Hoare triple {235#(<= ~counter~0 0)} call assume_abort_if_not((if ~B~0 % 4294967296 < 2147483647 then 1 else 0)); {235#(<= ~counter~0 0)} is VALID [2022-04-27 12:47:02,805 INFO L290 TraceCheckUtils]: 7: Hoare triple {235#(<= ~counter~0 0)} ~cond := #in~cond; {235#(<= ~counter~0 0)} is VALID [2022-04-27 12:47:02,806 INFO L290 TraceCheckUtils]: 8: Hoare triple {235#(<= ~counter~0 0)} assume !(0 == ~cond); {235#(<= ~counter~0 0)} is VALID [2022-04-27 12:47:02,806 INFO L290 TraceCheckUtils]: 9: Hoare triple {235#(<= ~counter~0 0)} assume true; {235#(<= ~counter~0 0)} is VALID [2022-04-27 12:47:02,807 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {235#(<= ~counter~0 0)} {235#(<= ~counter~0 0)} #81#return; {235#(<= ~counter~0 0)} is VALID [2022-04-27 12:47:02,808 INFO L272 TraceCheckUtils]: 11: Hoare triple {235#(<= ~counter~0 0)} call assume_abort_if_not((if ~B~0 % 4294967296 >= 1 then 1 else 0)); {235#(<= ~counter~0 0)} is VALID [2022-04-27 12:47:02,808 INFO L290 TraceCheckUtils]: 12: Hoare triple {235#(<= ~counter~0 0)} ~cond := #in~cond; {235#(<= ~counter~0 0)} is VALID [2022-04-27 12:47:02,809 INFO L290 TraceCheckUtils]: 13: Hoare triple {235#(<= ~counter~0 0)} assume !(0 == ~cond); {235#(<= ~counter~0 0)} is VALID [2022-04-27 12:47:02,811 INFO L290 TraceCheckUtils]: 14: Hoare triple {235#(<= ~counter~0 0)} assume true; {235#(<= ~counter~0 0)} is VALID [2022-04-27 12:47:02,812 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {235#(<= ~counter~0 0)} {235#(<= ~counter~0 0)} #83#return; {235#(<= ~counter~0 0)} is VALID [2022-04-27 12:47:02,813 INFO L290 TraceCheckUtils]: 16: Hoare triple {235#(<= ~counter~0 0)} ~q~0 := 0;~r~0 := ~A~0;~b~0 := ~B~0; {235#(<= ~counter~0 0)} is VALID [2022-04-27 12:47:02,813 INFO L290 TraceCheckUtils]: 17: Hoare triple {235#(<= ~counter~0 0)} #t~post3 := ~counter~0;~counter~0 := 1 + #t~post3; {284#(<= |main_#t~post3| 0)} is VALID [2022-04-27 12:47:02,814 INFO L290 TraceCheckUtils]: 18: Hoare triple {284#(<= |main_#t~post3| 0)} assume !(#t~post3 < 50);havoc #t~post3; {228#false} is VALID [2022-04-27 12:47:02,814 INFO L290 TraceCheckUtils]: 19: Hoare triple {228#false} #t~post4 := ~counter~0;~counter~0 := 1 + #t~post4; {228#false} is VALID [2022-04-27 12:47:02,814 INFO L290 TraceCheckUtils]: 20: Hoare triple {228#false} assume !(#t~post4 < 50);havoc #t~post4; {228#false} is VALID [2022-04-27 12:47:02,816 INFO L272 TraceCheckUtils]: 21: Hoare triple {228#false} call __VERIFIER_assert((if ~A~0 % 4294967296 == (~q~0 * ~b~0 + ~r~0) % 4294967296 then 1 else 0)); {228#false} is VALID [2022-04-27 12:47:02,816 INFO L290 TraceCheckUtils]: 22: Hoare triple {228#false} ~cond := #in~cond; {228#false} is VALID [2022-04-27 12:47:02,817 INFO L290 TraceCheckUtils]: 23: Hoare triple {228#false} assume 0 == ~cond; {228#false} is VALID [2022-04-27 12:47:02,817 INFO L290 TraceCheckUtils]: 24: Hoare triple {228#false} assume !false; {228#false} is VALID [2022-04-27 12:47:02,817 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-27 12:47:02,817 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-27 12:47:02,817 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 12:47:02,818 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [8070470] [2022-04-27 12:47:02,818 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 12:47:02,819 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [718574110] [2022-04-27 12:47:02,821 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [718574110] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 12:47:02,821 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 12:47:02,821 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-27 12:47:02,822 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [267494599] [2022-04-27 12:47:02,822 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 12:47:02,824 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, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) Word has length 25 [2022-04-27 12:47:02,824 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 12:47:02,824 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, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-27 12:47:02,842 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 12:47:02,843 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-27 12:47:02,843 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 12:47:02,845 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-27 12:47:02,845 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-27 12:47:02,845 INFO L87 Difference]: Start difference. First operand 28 states and 34 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, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-27 12:47:02,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:47:02,914 INFO L93 Difference]: Finished difference Result 42 states and 52 transitions. [2022-04-27 12:47:02,914 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-27 12:47:02,915 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, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) Word has length 25 [2022-04-27 12:47:02,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 12:47:02,916 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, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-27 12:47:02,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 52 transitions. [2022-04-27 12:47:02,923 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, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-27 12:47:02,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 52 transitions. [2022-04-27 12:47:02,926 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 52 transitions. [2022-04-27 12:47:02,968 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 52 edges. 52 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 12:47:02,970 INFO L225 Difference]: With dead ends: 42 [2022-04-27 12:47:02,970 INFO L226 Difference]: Without dead ends: 30 [2022-04-27 12:47:02,971 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-27 12:47:02,973 INFO L413 NwaCegarLoop]: 32 mSDtfsCounter, 0 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 81 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 12:47:02,974 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 81 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 12:47:02,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2022-04-27 12:47:02,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2022-04-27 12:47:02,989 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 12:47:02,990 INFO L82 GeneralOperation]: Start isEquivalent. First operand 30 states. Second operand has 30 states, 20 states have (on average 1.3) internal successors, (26), 21 states have internal predecessors, (26), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-27 12:47:02,991 INFO L74 IsIncluded]: Start isIncluded. First operand 30 states. Second operand has 30 states, 20 states have (on average 1.3) internal successors, (26), 21 states have internal predecessors, (26), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-27 12:47:02,991 INFO L87 Difference]: Start difference. First operand 30 states. Second operand has 30 states, 20 states have (on average 1.3) internal successors, (26), 21 states have internal predecessors, (26), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-27 12:47:02,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:47:02,995 INFO L93 Difference]: Finished difference Result 30 states and 36 transitions. [2022-04-27 12:47:02,995 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 36 transitions. [2022-04-27 12:47:02,996 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 12:47:02,996 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 12:47:02,997 INFO L74 IsIncluded]: Start isIncluded. First operand has 30 states, 20 states have (on average 1.3) internal successors, (26), 21 states have internal predecessors, (26), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 30 states. [2022-04-27 12:47:02,998 INFO L87 Difference]: Start difference. First operand has 30 states, 20 states have (on average 1.3) internal successors, (26), 21 states have internal predecessors, (26), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 30 states. [2022-04-27 12:47:03,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:47:03,004 INFO L93 Difference]: Finished difference Result 30 states and 36 transitions. [2022-04-27 12:47:03,005 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 36 transitions. [2022-04-27 12:47:03,006 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 12:47:03,006 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 12:47:03,007 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 12:47:03,009 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 12:47:03,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 20 states have (on average 1.3) internal successors, (26), 21 states have internal predecessors, (26), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-27 12:47:03,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 36 transitions. [2022-04-27 12:47:03,014 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 36 transitions. Word has length 25 [2022-04-27 12:47:03,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 12:47:03,015 INFO L495 AbstractCegarLoop]: Abstraction has 30 states and 36 transitions. [2022-04-27 12:47:03,015 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, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-27 12:47:03,015 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 36 transitions. [2022-04-27 12:47:03,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-04-27 12:47:03,016 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 12:47:03,016 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 12:47:03,036 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-04-27 12:47:03,223 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 12:47:03,224 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 12:47:03,224 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 12:47:03,225 INFO L85 PathProgramCache]: Analyzing trace with hash 422434646, now seen corresponding path program 1 times [2022-04-27 12:47:03,225 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 12:47:03,226 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1325478192] [2022-04-27 12:47:03,226 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 12:47:03,226 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 12:47:03,252 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 12:47:03,252 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [86571813] [2022-04-27 12:47:03,252 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 12:47:03,252 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 12:47:03,252 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 12:47:03,254 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 12:47:03,255 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-04-27 12:47:03,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:47:03,295 INFO L263 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-27 12:47:03,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:47:03,311 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 12:47:03,498 INFO L272 TraceCheckUtils]: 0: Hoare triple {464#true} call ULTIMATE.init(); {464#true} is VALID [2022-04-27 12:47:03,499 INFO L290 TraceCheckUtils]: 1: Hoare triple {464#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);~counter~0 := 0; {472#(<= ~counter~0 0)} is VALID [2022-04-27 12:47:03,499 INFO L290 TraceCheckUtils]: 2: Hoare triple {472#(<= ~counter~0 0)} assume true; {472#(<= ~counter~0 0)} is VALID [2022-04-27 12:47:03,499 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {472#(<= ~counter~0 0)} {464#true} #89#return; {472#(<= ~counter~0 0)} is VALID [2022-04-27 12:47:03,500 INFO L272 TraceCheckUtils]: 4: Hoare triple {472#(<= ~counter~0 0)} call #t~ret5 := main(); {472#(<= ~counter~0 0)} is VALID [2022-04-27 12:47:03,500 INFO L290 TraceCheckUtils]: 5: Hoare triple {472#(<= ~counter~0 0)} havoc ~A~0;havoc ~B~0;havoc ~q~0;havoc ~r~0;havoc ~b~0;~A~0 := #t~nondet1;havoc #t~nondet1;~B~0 := #t~nondet2;havoc #t~nondet2; {472#(<= ~counter~0 0)} is VALID [2022-04-27 12:47:03,501 INFO L272 TraceCheckUtils]: 6: Hoare triple {472#(<= ~counter~0 0)} call assume_abort_if_not((if ~B~0 % 4294967296 < 2147483647 then 1 else 0)); {472#(<= ~counter~0 0)} is VALID [2022-04-27 12:47:03,501 INFO L290 TraceCheckUtils]: 7: Hoare triple {472#(<= ~counter~0 0)} ~cond := #in~cond; {472#(<= ~counter~0 0)} is VALID [2022-04-27 12:47:03,501 INFO L290 TraceCheckUtils]: 8: Hoare triple {472#(<= ~counter~0 0)} assume !(0 == ~cond); {472#(<= ~counter~0 0)} is VALID [2022-04-27 12:47:03,501 INFO L290 TraceCheckUtils]: 9: Hoare triple {472#(<= ~counter~0 0)} assume true; {472#(<= ~counter~0 0)} is VALID [2022-04-27 12:47:03,502 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {472#(<= ~counter~0 0)} {472#(<= ~counter~0 0)} #81#return; {472#(<= ~counter~0 0)} is VALID [2022-04-27 12:47:03,502 INFO L272 TraceCheckUtils]: 11: Hoare triple {472#(<= ~counter~0 0)} call assume_abort_if_not((if ~B~0 % 4294967296 >= 1 then 1 else 0)); {472#(<= ~counter~0 0)} is VALID [2022-04-27 12:47:03,503 INFO L290 TraceCheckUtils]: 12: Hoare triple {472#(<= ~counter~0 0)} ~cond := #in~cond; {472#(<= ~counter~0 0)} is VALID [2022-04-27 12:47:03,503 INFO L290 TraceCheckUtils]: 13: Hoare triple {472#(<= ~counter~0 0)} assume !(0 == ~cond); {472#(<= ~counter~0 0)} is VALID [2022-04-27 12:47:03,503 INFO L290 TraceCheckUtils]: 14: Hoare triple {472#(<= ~counter~0 0)} assume true; {472#(<= ~counter~0 0)} is VALID [2022-04-27 12:47:03,504 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {472#(<= ~counter~0 0)} {472#(<= ~counter~0 0)} #83#return; {472#(<= ~counter~0 0)} is VALID [2022-04-27 12:47:03,505 INFO L290 TraceCheckUtils]: 16: Hoare triple {472#(<= ~counter~0 0)} ~q~0 := 0;~r~0 := ~A~0;~b~0 := ~B~0; {472#(<= ~counter~0 0)} is VALID [2022-04-27 12:47:03,506 INFO L290 TraceCheckUtils]: 17: Hoare triple {472#(<= ~counter~0 0)} #t~post3 := ~counter~0;~counter~0 := 1 + #t~post3; {521#(<= ~counter~0 1)} is VALID [2022-04-27 12:47:03,506 INFO L290 TraceCheckUtils]: 18: Hoare triple {521#(<= ~counter~0 1)} assume !!(#t~post3 < 50);havoc #t~post3; {521#(<= ~counter~0 1)} is VALID [2022-04-27 12:47:03,506 INFO L290 TraceCheckUtils]: 19: Hoare triple {521#(<= ~counter~0 1)} assume !(~r~0 % 4294967296 >= ~b~0 % 4294967296); {521#(<= ~counter~0 1)} is VALID [2022-04-27 12:47:03,507 INFO L290 TraceCheckUtils]: 20: Hoare triple {521#(<= ~counter~0 1)} #t~post4 := ~counter~0;~counter~0 := 1 + #t~post4; {531#(<= |main_#t~post4| 1)} is VALID [2022-04-27 12:47:03,507 INFO L290 TraceCheckUtils]: 21: Hoare triple {531#(<= |main_#t~post4| 1)} assume !(#t~post4 < 50);havoc #t~post4; {465#false} is VALID [2022-04-27 12:47:03,507 INFO L272 TraceCheckUtils]: 22: Hoare triple {465#false} call __VERIFIER_assert((if ~A~0 % 4294967296 == (~q~0 * ~b~0 + ~r~0) % 4294967296 then 1 else 0)); {465#false} is VALID [2022-04-27 12:47:03,507 INFO L290 TraceCheckUtils]: 23: Hoare triple {465#false} ~cond := #in~cond; {465#false} is VALID [2022-04-27 12:47:03,507 INFO L290 TraceCheckUtils]: 24: Hoare triple {465#false} assume 0 == ~cond; {465#false} is VALID [2022-04-27 12:47:03,508 INFO L290 TraceCheckUtils]: 25: Hoare triple {465#false} assume !false; {465#false} is VALID [2022-04-27 12:47:03,508 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-27 12:47:03,508 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-27 12:47:03,508 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 12:47:03,508 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1325478192] [2022-04-27 12:47:03,508 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 12:47:03,508 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [86571813] [2022-04-27 12:47:03,508 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [86571813] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 12:47:03,509 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 12:47:03,509 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-27 12:47:03,509 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [134919150] [2022-04-27 12:47:03,509 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 12:47:03,509 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) Word has length 26 [2022-04-27 12:47:03,509 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 12:47:03,510 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-27 12:47:03,529 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 12:47:03,529 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-27 12:47:03,530 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 12:47:03,530 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-27 12:47:03,530 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-04-27 12:47:03,530 INFO L87 Difference]: Start difference. First operand 30 states and 36 transitions. Second operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-27 12:47:03,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:47:03,626 INFO L93 Difference]: Finished difference Result 41 states and 48 transitions. [2022-04-27 12:47:03,627 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-27 12:47:03,627 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) Word has length 26 [2022-04-27 12:47:03,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 12:47:03,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-27 12:47:03,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 48 transitions. [2022-04-27 12:47:03,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-27 12:47:03,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 48 transitions. [2022-04-27 12:47:03,630 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 48 transitions. [2022-04-27 12:47:03,672 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 48 edges. 48 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 12:47:03,673 INFO L225 Difference]: With dead ends: 41 [2022-04-27 12:47:03,673 INFO L226 Difference]: Without dead ends: 34 [2022-04-27 12:47:03,673 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-04-27 12:47:03,674 INFO L413 NwaCegarLoop]: 31 mSDtfsCounter, 7 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 97 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 12:47:03,674 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 97 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 12:47:03,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2022-04-27 12:47:03,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 33. [2022-04-27 12:47:03,683 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 12:47:03,684 INFO L82 GeneralOperation]: Start isEquivalent. First operand 34 states. Second operand has 33 states, 23 states have (on average 1.3043478260869565) internal successors, (30), 24 states have internal predecessors, (30), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-27 12:47:03,684 INFO L74 IsIncluded]: Start isIncluded. First operand 34 states. Second operand has 33 states, 23 states have (on average 1.3043478260869565) internal successors, (30), 24 states have internal predecessors, (30), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-27 12:47:03,684 INFO L87 Difference]: Start difference. First operand 34 states. Second operand has 33 states, 23 states have (on average 1.3043478260869565) internal successors, (30), 24 states have internal predecessors, (30), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-27 12:47:03,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:47:03,685 INFO L93 Difference]: Finished difference Result 34 states and 41 transitions. [2022-04-27 12:47:03,686 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 41 transitions. [2022-04-27 12:47:03,686 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 12:47:03,686 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 12:47:03,686 INFO L74 IsIncluded]: Start isIncluded. First operand has 33 states, 23 states have (on average 1.3043478260869565) internal successors, (30), 24 states have internal predecessors, (30), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 34 states. [2022-04-27 12:47:03,686 INFO L87 Difference]: Start difference. First operand has 33 states, 23 states have (on average 1.3043478260869565) internal successors, (30), 24 states have internal predecessors, (30), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 34 states. [2022-04-27 12:47:03,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:47:03,688 INFO L93 Difference]: Finished difference Result 34 states and 41 transitions. [2022-04-27 12:47:03,688 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 41 transitions. [2022-04-27 12:47:03,688 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 12:47:03,688 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 12:47:03,688 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 12:47:03,688 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 12:47:03,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 23 states have (on average 1.3043478260869565) internal successors, (30), 24 states have internal predecessors, (30), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-27 12:47:03,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 40 transitions. [2022-04-27 12:47:03,690 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 40 transitions. Word has length 26 [2022-04-27 12:47:03,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 12:47:03,690 INFO L495 AbstractCegarLoop]: Abstraction has 33 states and 40 transitions. [2022-04-27 12:47:03,690 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-27 12:47:03,690 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 40 transitions. [2022-04-27 12:47:03,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-04-27 12:47:03,691 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 12:47:03,691 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 12:47:03,708 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-04-27 12:47:03,903 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2022-04-27 12:47:03,904 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 12:47:03,904 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 12:47:03,904 INFO L85 PathProgramCache]: Analyzing trace with hash 424222106, now seen corresponding path program 1 times [2022-04-27 12:47:03,904 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 12:47:03,905 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1564287063] [2022-04-27 12:47:03,905 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 12:47:03,907 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 12:47:03,919 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 12:47:03,920 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1623352808] [2022-04-27 12:47:03,920 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 12:47:03,920 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 12:47:03,920 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 12:47:03,921 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 12:47:03,922 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-04-27 12:47:03,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:47:03,961 INFO L263 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 15 conjunts are in the unsatisfiable core [2022-04-27 12:47:03,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:47:03,980 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 12:47:04,779 INFO L272 TraceCheckUtils]: 0: Hoare triple {715#true} call ULTIMATE.init(); {715#true} is VALID [2022-04-27 12:47:04,779 INFO L290 TraceCheckUtils]: 1: Hoare triple {715#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);~counter~0 := 0; {715#true} is VALID [2022-04-27 12:47:04,780 INFO L290 TraceCheckUtils]: 2: Hoare triple {715#true} assume true; {715#true} is VALID [2022-04-27 12:47:04,780 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {715#true} {715#true} #89#return; {715#true} is VALID [2022-04-27 12:47:04,780 INFO L272 TraceCheckUtils]: 4: Hoare triple {715#true} call #t~ret5 := main(); {715#true} is VALID [2022-04-27 12:47:04,780 INFO L290 TraceCheckUtils]: 5: Hoare triple {715#true} havoc ~A~0;havoc ~B~0;havoc ~q~0;havoc ~r~0;havoc ~b~0;~A~0 := #t~nondet1;havoc #t~nondet1;~B~0 := #t~nondet2;havoc #t~nondet2; {715#true} is VALID [2022-04-27 12:47:04,780 INFO L272 TraceCheckUtils]: 6: Hoare triple {715#true} call assume_abort_if_not((if ~B~0 % 4294967296 < 2147483647 then 1 else 0)); {715#true} is VALID [2022-04-27 12:47:04,780 INFO L290 TraceCheckUtils]: 7: Hoare triple {715#true} ~cond := #in~cond; {741#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-27 12:47:04,782 INFO L290 TraceCheckUtils]: 8: Hoare triple {741#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {745#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-27 12:47:04,782 INFO L290 TraceCheckUtils]: 9: Hoare triple {745#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {745#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-27 12:47:04,783 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {745#(not (= |assume_abort_if_not_#in~cond| 0))} {715#true} #81#return; {752#(< (mod main_~B~0 4294967296) 2147483647)} is VALID [2022-04-27 12:47:04,783 INFO L272 TraceCheckUtils]: 11: Hoare triple {752#(< (mod main_~B~0 4294967296) 2147483647)} call assume_abort_if_not((if ~B~0 % 4294967296 >= 1 then 1 else 0)); {715#true} is VALID [2022-04-27 12:47:04,783 INFO L290 TraceCheckUtils]: 12: Hoare triple {715#true} ~cond := #in~cond; {715#true} is VALID [2022-04-27 12:47:04,783 INFO L290 TraceCheckUtils]: 13: Hoare triple {715#true} assume !(0 == ~cond); {715#true} is VALID [2022-04-27 12:47:04,783 INFO L290 TraceCheckUtils]: 14: Hoare triple {715#true} assume true; {715#true} is VALID [2022-04-27 12:47:04,784 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {715#true} {752#(< (mod main_~B~0 4294967296) 2147483647)} #83#return; {752#(< (mod main_~B~0 4294967296) 2147483647)} is VALID [2022-04-27 12:47:04,784 INFO L290 TraceCheckUtils]: 16: Hoare triple {752#(< (mod main_~B~0 4294967296) 2147483647)} ~q~0 := 0;~r~0 := ~A~0;~b~0 := ~B~0; {771#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (< (mod main_~b~0 4294967296) 2147483647))} is VALID [2022-04-27 12:47:04,785 INFO L290 TraceCheckUtils]: 17: Hoare triple {771#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (< (mod main_~b~0 4294967296) 2147483647))} #t~post3 := ~counter~0;~counter~0 := 1 + #t~post3; {771#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (< (mod main_~b~0 4294967296) 2147483647))} is VALID [2022-04-27 12:47:04,787 INFO L290 TraceCheckUtils]: 18: Hoare triple {771#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (< (mod main_~b~0 4294967296) 2147483647))} assume !!(#t~post3 < 50);havoc #t~post3; {771#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (< (mod main_~b~0 4294967296) 2147483647))} is VALID [2022-04-27 12:47:04,788 INFO L290 TraceCheckUtils]: 19: Hoare triple {771#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (< (mod main_~b~0 4294967296) 2147483647))} assume !(~r~0 % 4294967296 >= ~b~0 % 4294967296); {781#(and (not (<= (mod main_~b~0 4294967296) (mod main_~r~0 4294967296))) (= main_~A~0 main_~r~0) (= main_~q~0 0) (< (mod main_~b~0 4294967296) 2147483647))} is VALID [2022-04-27 12:47:04,788 INFO L290 TraceCheckUtils]: 20: Hoare triple {781#(and (not (<= (mod main_~b~0 4294967296) (mod main_~r~0 4294967296))) (= main_~A~0 main_~r~0) (= main_~q~0 0) (< (mod main_~b~0 4294967296) 2147483647))} #t~post4 := ~counter~0;~counter~0 := 1 + #t~post4; {781#(and (not (<= (mod main_~b~0 4294967296) (mod main_~r~0 4294967296))) (= main_~A~0 main_~r~0) (= main_~q~0 0) (< (mod main_~b~0 4294967296) 2147483647))} is VALID [2022-04-27 12:47:04,789 INFO L290 TraceCheckUtils]: 21: Hoare triple {781#(and (not (<= (mod main_~b~0 4294967296) (mod main_~r~0 4294967296))) (= main_~A~0 main_~r~0) (= main_~q~0 0) (< (mod main_~b~0 4294967296) 2147483647))} assume !!(#t~post4 < 50);havoc #t~post4; {781#(and (not (<= (mod main_~b~0 4294967296) (mod main_~r~0 4294967296))) (= main_~A~0 main_~r~0) (= main_~q~0 0) (< (mod main_~b~0 4294967296) 2147483647))} is VALID [2022-04-27 12:47:04,790 INFO L272 TraceCheckUtils]: 22: Hoare triple {781#(and (not (<= (mod main_~b~0 4294967296) (mod main_~r~0 4294967296))) (= main_~A~0 main_~r~0) (= main_~q~0 0) (< (mod main_~b~0 4294967296) 2147483647))} call __VERIFIER_assert((if ~A~0 % 4294967296 == (~q~0 * ~b~0 + ~r~0) % 4294967296 then 1 else 0)); {791#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 12:47:04,790 INFO L290 TraceCheckUtils]: 23: Hoare triple {791#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {795#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 12:47:04,791 INFO L290 TraceCheckUtils]: 24: Hoare triple {795#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {716#false} is VALID [2022-04-27 12:47:04,791 INFO L290 TraceCheckUtils]: 25: Hoare triple {716#false} assume !false; {716#false} is VALID [2022-04-27 12:47:04,791 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-27 12:47:04,791 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 12:47:05,146 INFO L290 TraceCheckUtils]: 25: Hoare triple {716#false} assume !false; {716#false} is VALID [2022-04-27 12:47:05,146 INFO L290 TraceCheckUtils]: 24: Hoare triple {795#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {716#false} is VALID [2022-04-27 12:47:05,147 INFO L290 TraceCheckUtils]: 23: Hoare triple {791#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {795#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 12:47:05,147 INFO L272 TraceCheckUtils]: 22: Hoare triple {811#(= (mod main_~A~0 4294967296) (mod (+ main_~r~0 (* main_~b~0 main_~q~0)) 4294967296))} call __VERIFIER_assert((if ~A~0 % 4294967296 == (~q~0 * ~b~0 + ~r~0) % 4294967296 then 1 else 0)); {791#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 12:47:05,149 INFO L290 TraceCheckUtils]: 21: Hoare triple {811#(= (mod main_~A~0 4294967296) (mod (+ main_~r~0 (* main_~b~0 main_~q~0)) 4294967296))} assume !!(#t~post4 < 50);havoc #t~post4; {811#(= (mod main_~A~0 4294967296) (mod (+ main_~r~0 (* main_~b~0 main_~q~0)) 4294967296))} is VALID [2022-04-27 12:47:05,149 INFO L290 TraceCheckUtils]: 20: Hoare triple {811#(= (mod main_~A~0 4294967296) (mod (+ main_~r~0 (* main_~b~0 main_~q~0)) 4294967296))} #t~post4 := ~counter~0;~counter~0 := 1 + #t~post4; {811#(= (mod main_~A~0 4294967296) (mod (+ main_~r~0 (* main_~b~0 main_~q~0)) 4294967296))} is VALID [2022-04-27 12:47:05,153 INFO L290 TraceCheckUtils]: 19: Hoare triple {821#(or (= (mod main_~A~0 4294967296) (mod (+ main_~r~0 (* main_~b~0 main_~q~0)) 4294967296)) (<= (mod main_~b~0 4294967296) (mod main_~r~0 4294967296)))} assume !(~r~0 % 4294967296 >= ~b~0 % 4294967296); {811#(= (mod main_~A~0 4294967296) (mod (+ main_~r~0 (* main_~b~0 main_~q~0)) 4294967296))} is VALID [2022-04-27 12:47:05,155 INFO L290 TraceCheckUtils]: 18: Hoare triple {821#(or (= (mod main_~A~0 4294967296) (mod (+ main_~r~0 (* main_~b~0 main_~q~0)) 4294967296)) (<= (mod main_~b~0 4294967296) (mod main_~r~0 4294967296)))} assume !!(#t~post3 < 50);havoc #t~post3; {821#(or (= (mod main_~A~0 4294967296) (mod (+ main_~r~0 (* main_~b~0 main_~q~0)) 4294967296)) (<= (mod main_~b~0 4294967296) (mod main_~r~0 4294967296)))} is VALID [2022-04-27 12:47:05,156 INFO L290 TraceCheckUtils]: 17: Hoare triple {821#(or (= (mod main_~A~0 4294967296) (mod (+ main_~r~0 (* main_~b~0 main_~q~0)) 4294967296)) (<= (mod main_~b~0 4294967296) (mod main_~r~0 4294967296)))} #t~post3 := ~counter~0;~counter~0 := 1 + #t~post3; {821#(or (= (mod main_~A~0 4294967296) (mod (+ main_~r~0 (* main_~b~0 main_~q~0)) 4294967296)) (<= (mod main_~b~0 4294967296) (mod main_~r~0 4294967296)))} is VALID [2022-04-27 12:47:05,166 INFO L290 TraceCheckUtils]: 16: Hoare triple {715#true} ~q~0 := 0;~r~0 := ~A~0;~b~0 := ~B~0; {821#(or (= (mod main_~A~0 4294967296) (mod (+ main_~r~0 (* main_~b~0 main_~q~0)) 4294967296)) (<= (mod main_~b~0 4294967296) (mod main_~r~0 4294967296)))} is VALID [2022-04-27 12:47:05,166 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {715#true} {715#true} #83#return; {715#true} is VALID [2022-04-27 12:47:05,166 INFO L290 TraceCheckUtils]: 14: Hoare triple {715#true} assume true; {715#true} is VALID [2022-04-27 12:47:05,166 INFO L290 TraceCheckUtils]: 13: Hoare triple {715#true} assume !(0 == ~cond); {715#true} is VALID [2022-04-27 12:47:05,167 INFO L290 TraceCheckUtils]: 12: Hoare triple {715#true} ~cond := #in~cond; {715#true} is VALID [2022-04-27 12:47:05,167 INFO L272 TraceCheckUtils]: 11: Hoare triple {715#true} call assume_abort_if_not((if ~B~0 % 4294967296 >= 1 then 1 else 0)); {715#true} is VALID [2022-04-27 12:47:05,167 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {715#true} {715#true} #81#return; {715#true} is VALID [2022-04-27 12:47:05,167 INFO L290 TraceCheckUtils]: 9: Hoare triple {715#true} assume true; {715#true} is VALID [2022-04-27 12:47:05,167 INFO L290 TraceCheckUtils]: 8: Hoare triple {715#true} assume !(0 == ~cond); {715#true} is VALID [2022-04-27 12:47:05,167 INFO L290 TraceCheckUtils]: 7: Hoare triple {715#true} ~cond := #in~cond; {715#true} is VALID [2022-04-27 12:47:05,167 INFO L272 TraceCheckUtils]: 6: Hoare triple {715#true} call assume_abort_if_not((if ~B~0 % 4294967296 < 2147483647 then 1 else 0)); {715#true} is VALID [2022-04-27 12:47:05,167 INFO L290 TraceCheckUtils]: 5: Hoare triple {715#true} havoc ~A~0;havoc ~B~0;havoc ~q~0;havoc ~r~0;havoc ~b~0;~A~0 := #t~nondet1;havoc #t~nondet1;~B~0 := #t~nondet2;havoc #t~nondet2; {715#true} is VALID [2022-04-27 12:47:05,167 INFO L272 TraceCheckUtils]: 4: Hoare triple {715#true} call #t~ret5 := main(); {715#true} is VALID [2022-04-27 12:47:05,167 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {715#true} {715#true} #89#return; {715#true} is VALID [2022-04-27 12:47:05,168 INFO L290 TraceCheckUtils]: 2: Hoare triple {715#true} assume true; {715#true} is VALID [2022-04-27 12:47:05,168 INFO L290 TraceCheckUtils]: 1: Hoare triple {715#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);~counter~0 := 0; {715#true} is VALID [2022-04-27 12:47:05,168 INFO L272 TraceCheckUtils]: 0: Hoare triple {715#true} call ULTIMATE.init(); {715#true} is VALID [2022-04-27 12:47:05,168 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-27 12:47:05,168 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 12:47:05,168 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1564287063] [2022-04-27 12:47:05,168 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 12:47:05,168 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1623352808] [2022-04-27 12:47:05,168 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1623352808] provided 1 perfect and 1 imperfect interpolant sequences [2022-04-27 12:47:05,169 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-04-27 12:47:05,169 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [9] total 11 [2022-04-27 12:47:05,169 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1506851043] [2022-04-27 12:47:05,169 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 12:47:05,169 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 states have internal predecessors, (15), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 26 [2022-04-27 12:47:05,169 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 12:47:05,170 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), 5 states have internal predecessors, (15), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-27 12:47:05,186 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 12:47:05,186 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-27 12:47:05,187 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 12:47:05,187 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-27 12:47:05,187 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2022-04-27 12:47:05,187 INFO L87 Difference]: Start difference. First operand 33 states and 40 transitions. Second operand has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 states have internal predecessors, (15), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-27 12:47:07,466 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-27 12:47:09,548 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.08s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-27 12:47:11,639 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-27 12:47:13,765 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-27 12:47:13,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:47:13,766 INFO L93 Difference]: Finished difference Result 42 states and 50 transitions. [2022-04-27 12:47:13,847 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-27 12:47:13,847 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 states have internal predecessors, (15), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 26 [2022-04-27 12:47:13,847 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 12:47:13,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 states have internal predecessors, (15), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-27 12:47:13,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 50 transitions. [2022-04-27 12:47:13,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 states have internal predecessors, (15), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-27 12:47:13,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 50 transitions. [2022-04-27 12:47:13,849 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 50 transitions. [2022-04-27 12:47:13,896 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 50 edges. 50 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 12:47:13,897 INFO L225 Difference]: With dead ends: 42 [2022-04-27 12:47:13,897 INFO L226 Difference]: Without dead ends: 39 [2022-04-27 12:47:13,897 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 41 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2022-04-27 12:47:13,898 INFO L413 NwaCegarLoop]: 29 mSDtfsCounter, 11 mSDsluCounter, 98 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 2 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 127 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.3s IncrementalHoareTripleChecker+Time [2022-04-27 12:47:13,898 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 127 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 47 Invalid, 4 Unknown, 0 Unchecked, 8.3s Time] [2022-04-27 12:47:13,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2022-04-27 12:47:13,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2022-04-27 12:47:13,905 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 12:47:13,905 INFO L82 GeneralOperation]: Start isEquivalent. First operand 39 states. Second operand has 39 states, 27 states have (on average 1.2592592592592593) internal successors, (34), 28 states have internal predecessors, (34), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-27 12:47:13,905 INFO L74 IsIncluded]: Start isIncluded. First operand 39 states. Second operand has 39 states, 27 states have (on average 1.2592592592592593) internal successors, (34), 28 states have internal predecessors, (34), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-27 12:47:13,905 INFO L87 Difference]: Start difference. First operand 39 states. Second operand has 39 states, 27 states have (on average 1.2592592592592593) internal successors, (34), 28 states have internal predecessors, (34), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-27 12:47:13,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:47:13,907 INFO L93 Difference]: Finished difference Result 39 states and 46 transitions. [2022-04-27 12:47:13,907 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 46 transitions. [2022-04-27 12:47:13,907 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 12:47:13,907 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 12:47:13,907 INFO L74 IsIncluded]: Start isIncluded. First operand has 39 states, 27 states have (on average 1.2592592592592593) internal successors, (34), 28 states have internal predecessors, (34), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand 39 states. [2022-04-27 12:47:13,907 INFO L87 Difference]: Start difference. First operand has 39 states, 27 states have (on average 1.2592592592592593) internal successors, (34), 28 states have internal predecessors, (34), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand 39 states. [2022-04-27 12:47:13,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:47:13,909 INFO L93 Difference]: Finished difference Result 39 states and 46 transitions. [2022-04-27 12:47:13,909 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 46 transitions. [2022-04-27 12:47:13,909 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 12:47:13,909 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 12:47:13,909 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 12:47:13,909 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 12:47:13,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 27 states have (on average 1.2592592592592593) internal successors, (34), 28 states have internal predecessors, (34), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-27 12:47:13,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 46 transitions. [2022-04-27 12:47:13,910 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 46 transitions. Word has length 26 [2022-04-27 12:47:13,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 12:47:13,911 INFO L495 AbstractCegarLoop]: Abstraction has 39 states and 46 transitions. [2022-04-27 12:47:13,911 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 states have internal predecessors, (15), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-27 12:47:13,911 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 46 transitions. [2022-04-27 12:47:13,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-04-27 12:47:13,911 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 12:47:13,912 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 12:47:13,931 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-04-27 12:47:14,129 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 12:47:14,129 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 12:47:14,130 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 12:47:14,130 INFO L85 PathProgramCache]: Analyzing trace with hash -193375877, now seen corresponding path program 1 times [2022-04-27 12:47:14,130 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 12:47:14,130 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1544733902] [2022-04-27 12:47:14,130 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 12:47:14,130 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 12:47:14,143 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 12:47:14,143 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [449664120] [2022-04-27 12:47:14,143 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 12:47:14,144 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 12:47:14,144 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 12:47:14,145 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 12:47:14,146 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-04-27 12:47:14,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:47:14,178 INFO L263 TraceCheckSpWp]: Trace formula consists of 98 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-27 12:47:14,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:47:14,189 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 12:47:14,366 INFO L272 TraceCheckUtils]: 0: Hoare triple {1071#true} call ULTIMATE.init(); {1071#true} is VALID [2022-04-27 12:47:14,367 INFO L290 TraceCheckUtils]: 1: Hoare triple {1071#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);~counter~0 := 0; {1079#(<= ~counter~0 0)} is VALID [2022-04-27 12:47:14,368 INFO L290 TraceCheckUtils]: 2: Hoare triple {1079#(<= ~counter~0 0)} assume true; {1079#(<= ~counter~0 0)} is VALID [2022-04-27 12:47:14,368 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1079#(<= ~counter~0 0)} {1071#true} #89#return; {1079#(<= ~counter~0 0)} is VALID [2022-04-27 12:47:14,368 INFO L272 TraceCheckUtils]: 4: Hoare triple {1079#(<= ~counter~0 0)} call #t~ret5 := main(); {1079#(<= ~counter~0 0)} is VALID [2022-04-27 12:47:14,369 INFO L290 TraceCheckUtils]: 5: Hoare triple {1079#(<= ~counter~0 0)} havoc ~A~0;havoc ~B~0;havoc ~q~0;havoc ~r~0;havoc ~b~0;~A~0 := #t~nondet1;havoc #t~nondet1;~B~0 := #t~nondet2;havoc #t~nondet2; {1079#(<= ~counter~0 0)} is VALID [2022-04-27 12:47:14,369 INFO L272 TraceCheckUtils]: 6: Hoare triple {1079#(<= ~counter~0 0)} call assume_abort_if_not((if ~B~0 % 4294967296 < 2147483647 then 1 else 0)); {1079#(<= ~counter~0 0)} is VALID [2022-04-27 12:47:14,370 INFO L290 TraceCheckUtils]: 7: Hoare triple {1079#(<= ~counter~0 0)} ~cond := #in~cond; {1079#(<= ~counter~0 0)} is VALID [2022-04-27 12:47:14,370 INFO L290 TraceCheckUtils]: 8: Hoare triple {1079#(<= ~counter~0 0)} assume !(0 == ~cond); {1079#(<= ~counter~0 0)} is VALID [2022-04-27 12:47:14,370 INFO L290 TraceCheckUtils]: 9: Hoare triple {1079#(<= ~counter~0 0)} assume true; {1079#(<= ~counter~0 0)} is VALID [2022-04-27 12:47:14,371 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1079#(<= ~counter~0 0)} {1079#(<= ~counter~0 0)} #81#return; {1079#(<= ~counter~0 0)} is VALID [2022-04-27 12:47:14,371 INFO L272 TraceCheckUtils]: 11: Hoare triple {1079#(<= ~counter~0 0)} call assume_abort_if_not((if ~B~0 % 4294967296 >= 1 then 1 else 0)); {1079#(<= ~counter~0 0)} is VALID [2022-04-27 12:47:14,371 INFO L290 TraceCheckUtils]: 12: Hoare triple {1079#(<= ~counter~0 0)} ~cond := #in~cond; {1079#(<= ~counter~0 0)} is VALID [2022-04-27 12:47:14,372 INFO L290 TraceCheckUtils]: 13: Hoare triple {1079#(<= ~counter~0 0)} assume !(0 == ~cond); {1079#(<= ~counter~0 0)} is VALID [2022-04-27 12:47:14,372 INFO L290 TraceCheckUtils]: 14: Hoare triple {1079#(<= ~counter~0 0)} assume true; {1079#(<= ~counter~0 0)} is VALID [2022-04-27 12:47:14,372 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {1079#(<= ~counter~0 0)} {1079#(<= ~counter~0 0)} #83#return; {1079#(<= ~counter~0 0)} is VALID [2022-04-27 12:47:14,373 INFO L290 TraceCheckUtils]: 16: Hoare triple {1079#(<= ~counter~0 0)} ~q~0 := 0;~r~0 := ~A~0;~b~0 := ~B~0; {1079#(<= ~counter~0 0)} is VALID [2022-04-27 12:47:14,373 INFO L290 TraceCheckUtils]: 17: Hoare triple {1079#(<= ~counter~0 0)} #t~post3 := ~counter~0;~counter~0 := 1 + #t~post3; {1128#(<= ~counter~0 1)} is VALID [2022-04-27 12:47:14,374 INFO L290 TraceCheckUtils]: 18: Hoare triple {1128#(<= ~counter~0 1)} assume !!(#t~post3 < 50);havoc #t~post3; {1128#(<= ~counter~0 1)} is VALID [2022-04-27 12:47:14,374 INFO L290 TraceCheckUtils]: 19: Hoare triple {1128#(<= ~counter~0 1)} assume !!(~r~0 % 4294967296 >= ~b~0 % 4294967296);~b~0 := 2 * ~b~0; {1128#(<= ~counter~0 1)} is VALID [2022-04-27 12:47:14,375 INFO L290 TraceCheckUtils]: 20: Hoare triple {1128#(<= ~counter~0 1)} #t~post3 := ~counter~0;~counter~0 := 1 + #t~post3; {1138#(<= |main_#t~post3| 1)} is VALID [2022-04-27 12:47:14,375 INFO L290 TraceCheckUtils]: 21: Hoare triple {1138#(<= |main_#t~post3| 1)} assume !(#t~post3 < 50);havoc #t~post3; {1072#false} is VALID [2022-04-27 12:47:14,375 INFO L290 TraceCheckUtils]: 22: Hoare triple {1072#false} #t~post4 := ~counter~0;~counter~0 := 1 + #t~post4; {1072#false} is VALID [2022-04-27 12:47:14,375 INFO L290 TraceCheckUtils]: 23: Hoare triple {1072#false} assume !(#t~post4 < 50);havoc #t~post4; {1072#false} is VALID [2022-04-27 12:47:14,375 INFO L272 TraceCheckUtils]: 24: Hoare triple {1072#false} call __VERIFIER_assert((if ~A~0 % 4294967296 == (~q~0 * ~b~0 + ~r~0) % 4294967296 then 1 else 0)); {1072#false} is VALID [2022-04-27 12:47:14,375 INFO L290 TraceCheckUtils]: 25: Hoare triple {1072#false} ~cond := #in~cond; {1072#false} is VALID [2022-04-27 12:47:14,375 INFO L290 TraceCheckUtils]: 26: Hoare triple {1072#false} assume 0 == ~cond; {1072#false} is VALID [2022-04-27 12:47:14,376 INFO L290 TraceCheckUtils]: 27: Hoare triple {1072#false} assume !false; {1072#false} is VALID [2022-04-27 12:47:14,376 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-27 12:47:14,376 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 12:47:14,562 INFO L290 TraceCheckUtils]: 27: Hoare triple {1072#false} assume !false; {1072#false} is VALID [2022-04-27 12:47:14,562 INFO L290 TraceCheckUtils]: 26: Hoare triple {1072#false} assume 0 == ~cond; {1072#false} is VALID [2022-04-27 12:47:14,562 INFO L290 TraceCheckUtils]: 25: Hoare triple {1072#false} ~cond := #in~cond; {1072#false} is VALID [2022-04-27 12:47:14,562 INFO L272 TraceCheckUtils]: 24: Hoare triple {1072#false} call __VERIFIER_assert((if ~A~0 % 4294967296 == (~q~0 * ~b~0 + ~r~0) % 4294967296 then 1 else 0)); {1072#false} is VALID [2022-04-27 12:47:14,562 INFO L290 TraceCheckUtils]: 23: Hoare triple {1072#false} assume !(#t~post4 < 50);havoc #t~post4; {1072#false} is VALID [2022-04-27 12:47:14,562 INFO L290 TraceCheckUtils]: 22: Hoare triple {1072#false} #t~post4 := ~counter~0;~counter~0 := 1 + #t~post4; {1072#false} is VALID [2022-04-27 12:47:14,563 INFO L290 TraceCheckUtils]: 21: Hoare triple {1178#(< |main_#t~post3| 50)} assume !(#t~post3 < 50);havoc #t~post3; {1072#false} is VALID [2022-04-27 12:47:14,563 INFO L290 TraceCheckUtils]: 20: Hoare triple {1182#(< ~counter~0 50)} #t~post3 := ~counter~0;~counter~0 := 1 + #t~post3; {1178#(< |main_#t~post3| 50)} is VALID [2022-04-27 12:47:14,563 INFO L290 TraceCheckUtils]: 19: Hoare triple {1182#(< ~counter~0 50)} assume !!(~r~0 % 4294967296 >= ~b~0 % 4294967296);~b~0 := 2 * ~b~0; {1182#(< ~counter~0 50)} is VALID [2022-04-27 12:47:14,564 INFO L290 TraceCheckUtils]: 18: Hoare triple {1182#(< ~counter~0 50)} assume !!(#t~post3 < 50);havoc #t~post3; {1182#(< ~counter~0 50)} is VALID [2022-04-27 12:47:14,564 INFO L290 TraceCheckUtils]: 17: Hoare triple {1192#(< ~counter~0 49)} #t~post3 := ~counter~0;~counter~0 := 1 + #t~post3; {1182#(< ~counter~0 50)} is VALID [2022-04-27 12:47:14,565 INFO L290 TraceCheckUtils]: 16: Hoare triple {1192#(< ~counter~0 49)} ~q~0 := 0;~r~0 := ~A~0;~b~0 := ~B~0; {1192#(< ~counter~0 49)} is VALID [2022-04-27 12:47:14,565 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {1071#true} {1192#(< ~counter~0 49)} #83#return; {1192#(< ~counter~0 49)} is VALID [2022-04-27 12:47:14,565 INFO L290 TraceCheckUtils]: 14: Hoare triple {1071#true} assume true; {1071#true} is VALID [2022-04-27 12:47:14,565 INFO L290 TraceCheckUtils]: 13: Hoare triple {1071#true} assume !(0 == ~cond); {1071#true} is VALID [2022-04-27 12:47:14,565 INFO L290 TraceCheckUtils]: 12: Hoare triple {1071#true} ~cond := #in~cond; {1071#true} is VALID [2022-04-27 12:47:14,566 INFO L272 TraceCheckUtils]: 11: Hoare triple {1192#(< ~counter~0 49)} call assume_abort_if_not((if ~B~0 % 4294967296 >= 1 then 1 else 0)); {1071#true} is VALID [2022-04-27 12:47:14,566 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1071#true} {1192#(< ~counter~0 49)} #81#return; {1192#(< ~counter~0 49)} is VALID [2022-04-27 12:47:14,566 INFO L290 TraceCheckUtils]: 9: Hoare triple {1071#true} assume true; {1071#true} is VALID [2022-04-27 12:47:14,566 INFO L290 TraceCheckUtils]: 8: Hoare triple {1071#true} assume !(0 == ~cond); {1071#true} is VALID [2022-04-27 12:47:14,566 INFO L290 TraceCheckUtils]: 7: Hoare triple {1071#true} ~cond := #in~cond; {1071#true} is VALID [2022-04-27 12:47:14,566 INFO L272 TraceCheckUtils]: 6: Hoare triple {1192#(< ~counter~0 49)} call assume_abort_if_not((if ~B~0 % 4294967296 < 2147483647 then 1 else 0)); {1071#true} is VALID [2022-04-27 12:47:14,567 INFO L290 TraceCheckUtils]: 5: Hoare triple {1192#(< ~counter~0 49)} havoc ~A~0;havoc ~B~0;havoc ~q~0;havoc ~r~0;havoc ~b~0;~A~0 := #t~nondet1;havoc #t~nondet1;~B~0 := #t~nondet2;havoc #t~nondet2; {1192#(< ~counter~0 49)} is VALID [2022-04-27 12:47:14,568 INFO L272 TraceCheckUtils]: 4: Hoare triple {1192#(< ~counter~0 49)} call #t~ret5 := main(); {1192#(< ~counter~0 49)} is VALID [2022-04-27 12:47:14,568 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1192#(< ~counter~0 49)} {1071#true} #89#return; {1192#(< ~counter~0 49)} is VALID [2022-04-27 12:47:14,568 INFO L290 TraceCheckUtils]: 2: Hoare triple {1192#(< ~counter~0 49)} assume true; {1192#(< ~counter~0 49)} is VALID [2022-04-27 12:47:14,569 INFO L290 TraceCheckUtils]: 1: Hoare triple {1071#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);~counter~0 := 0; {1192#(< ~counter~0 49)} is VALID [2022-04-27 12:47:14,569 INFO L272 TraceCheckUtils]: 0: Hoare triple {1071#true} call ULTIMATE.init(); {1071#true} is VALID [2022-04-27 12:47:14,569 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-27 12:47:14,569 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 12:47:14,570 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1544733902] [2022-04-27 12:47:14,570 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 12:47:14,570 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [449664120] [2022-04-27 12:47:14,570 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [449664120] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 12:47:14,570 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-27 12:47:14,570 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2022-04-27 12:47:14,570 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [249045393] [2022-04-27 12:47:14,570 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-27 12:47:14,571 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.625) internal successors, (29), 8 states have internal predecessors, (29), 4 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (6), 2 states have call predecessors, (6), 3 states have call successors, (6) Word has length 28 [2022-04-27 12:47:14,571 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 12:47:14,572 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 3.625) internal successors, (29), 8 states have internal predecessors, (29), 4 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (6), 2 states have call predecessors, (6), 3 states have call successors, (6) [2022-04-27 12:47:14,604 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 43 edges. 43 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 12:47:14,605 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-27 12:47:14,605 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 12:47:14,605 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-27 12:47:14,605 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2022-04-27 12:47:14,606 INFO L87 Difference]: Start difference. First operand 39 states and 46 transitions. Second operand has 8 states, 8 states have (on average 3.625) internal successors, (29), 8 states have internal predecessors, (29), 4 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (6), 2 states have call predecessors, (6), 3 states have call successors, (6) [2022-04-27 12:47:14,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:47:14,821 INFO L93 Difference]: Finished difference Result 73 states and 92 transitions. [2022-04-27 12:47:14,821 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-04-27 12:47:14,821 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.625) internal successors, (29), 8 states have internal predecessors, (29), 4 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (6), 2 states have call predecessors, (6), 3 states have call successors, (6) Word has length 28 [2022-04-27 12:47:14,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 12:47:14,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 3.625) internal successors, (29), 8 states have internal predecessors, (29), 4 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (6), 2 states have call predecessors, (6), 3 states have call successors, (6) [2022-04-27 12:47:14,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 92 transitions. [2022-04-27 12:47:14,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 3.625) internal successors, (29), 8 states have internal predecessors, (29), 4 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (6), 2 states have call predecessors, (6), 3 states have call successors, (6) [2022-04-27 12:47:14,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 92 transitions. [2022-04-27 12:47:14,825 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 10 states and 92 transitions. [2022-04-27 12:47:14,891 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 92 edges. 92 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 12:47:14,892 INFO L225 Difference]: With dead ends: 73 [2022-04-27 12:47:14,892 INFO L226 Difference]: Without dead ends: 61 [2022-04-27 12:47:14,893 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2022-04-27 12:47:14,893 INFO L413 NwaCegarLoop]: 33 mSDtfsCounter, 34 mSDsluCounter, 116 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 149 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 12:47:14,893 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 149 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 12:47:14,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2022-04-27 12:47:14,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 47. [2022-04-27 12:47:14,903 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 12:47:14,903 INFO L82 GeneralOperation]: Start isEquivalent. First operand 61 states. Second operand has 47 states, 35 states have (on average 1.2571428571428571) internal successors, (44), 36 states have internal predecessors, (44), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-27 12:47:14,904 INFO L74 IsIncluded]: Start isIncluded. First operand 61 states. Second operand has 47 states, 35 states have (on average 1.2571428571428571) internal successors, (44), 36 states have internal predecessors, (44), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-27 12:47:14,904 INFO L87 Difference]: Start difference. First operand 61 states. Second operand has 47 states, 35 states have (on average 1.2571428571428571) internal successors, (44), 36 states have internal predecessors, (44), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-27 12:47:14,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:47:14,905 INFO L93 Difference]: Finished difference Result 61 states and 74 transitions. [2022-04-27 12:47:14,905 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 74 transitions. [2022-04-27 12:47:14,906 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 12:47:14,906 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 12:47:14,906 INFO L74 IsIncluded]: Start isIncluded. First operand has 47 states, 35 states have (on average 1.2571428571428571) internal successors, (44), 36 states have internal predecessors, (44), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand 61 states. [2022-04-27 12:47:14,906 INFO L87 Difference]: Start difference. First operand has 47 states, 35 states have (on average 1.2571428571428571) internal successors, (44), 36 states have internal predecessors, (44), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand 61 states. [2022-04-27 12:47:14,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:47:14,908 INFO L93 Difference]: Finished difference Result 61 states and 74 transitions. [2022-04-27 12:47:14,908 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 74 transitions. [2022-04-27 12:47:14,908 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 12:47:14,908 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 12:47:14,908 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 12:47:14,908 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 12:47:14,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 35 states have (on average 1.2571428571428571) internal successors, (44), 36 states have internal predecessors, (44), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-27 12:47:14,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 56 transitions. [2022-04-27 12:47:14,910 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 56 transitions. Word has length 28 [2022-04-27 12:47:14,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 12:47:14,910 INFO L495 AbstractCegarLoop]: Abstraction has 47 states and 56 transitions. [2022-04-27 12:47:14,910 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.625) internal successors, (29), 8 states have internal predecessors, (29), 4 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (6), 2 states have call predecessors, (6), 3 states have call successors, (6) [2022-04-27 12:47:14,910 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 56 transitions. [2022-04-27 12:47:14,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-04-27 12:47:14,911 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 12:47:14,911 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 12:47:14,927 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2022-04-27 12:47:15,123 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 12:47:15,123 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 12:47:15,124 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 12:47:15,124 INFO L85 PathProgramCache]: Analyzing trace with hash -2031725334, now seen corresponding path program 1 times [2022-04-27 12:47:15,124 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 12:47:15,124 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1814017843] [2022-04-27 12:47:15,124 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 12:47:15,124 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 12:47:15,141 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 12:47:15,142 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [738244390] [2022-04-27 12:47:15,142 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 12:47:15,142 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 12:47:15,142 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 12:47:15,143 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 12:47:15,156 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-04-27 12:47:15,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:47:15,197 INFO L263 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-27 12:47:15,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:47:15,207 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 12:47:15,381 INFO L272 TraceCheckUtils]: 0: Hoare triple {1534#true} call ULTIMATE.init(); {1534#true} is VALID [2022-04-27 12:47:15,382 INFO L290 TraceCheckUtils]: 1: Hoare triple {1534#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);~counter~0 := 0; {1542#(<= ~counter~0 0)} is VALID [2022-04-27 12:47:15,382 INFO L290 TraceCheckUtils]: 2: Hoare triple {1542#(<= ~counter~0 0)} assume true; {1542#(<= ~counter~0 0)} is VALID [2022-04-27 12:47:15,383 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1542#(<= ~counter~0 0)} {1534#true} #89#return; {1542#(<= ~counter~0 0)} is VALID [2022-04-27 12:47:15,383 INFO L272 TraceCheckUtils]: 4: Hoare triple {1542#(<= ~counter~0 0)} call #t~ret5 := main(); {1542#(<= ~counter~0 0)} is VALID [2022-04-27 12:47:15,383 INFO L290 TraceCheckUtils]: 5: Hoare triple {1542#(<= ~counter~0 0)} havoc ~A~0;havoc ~B~0;havoc ~q~0;havoc ~r~0;havoc ~b~0;~A~0 := #t~nondet1;havoc #t~nondet1;~B~0 := #t~nondet2;havoc #t~nondet2; {1542#(<= ~counter~0 0)} is VALID [2022-04-27 12:47:15,384 INFO L272 TraceCheckUtils]: 6: Hoare triple {1542#(<= ~counter~0 0)} call assume_abort_if_not((if ~B~0 % 4294967296 < 2147483647 then 1 else 0)); {1542#(<= ~counter~0 0)} is VALID [2022-04-27 12:47:15,391 INFO L290 TraceCheckUtils]: 7: Hoare triple {1542#(<= ~counter~0 0)} ~cond := #in~cond; {1542#(<= ~counter~0 0)} is VALID [2022-04-27 12:47:15,392 INFO L290 TraceCheckUtils]: 8: Hoare triple {1542#(<= ~counter~0 0)} assume !(0 == ~cond); {1542#(<= ~counter~0 0)} is VALID [2022-04-27 12:47:15,393 INFO L290 TraceCheckUtils]: 9: Hoare triple {1542#(<= ~counter~0 0)} assume true; {1542#(<= ~counter~0 0)} is VALID [2022-04-27 12:47:15,393 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1542#(<= ~counter~0 0)} {1542#(<= ~counter~0 0)} #81#return; {1542#(<= ~counter~0 0)} is VALID [2022-04-27 12:47:15,393 INFO L272 TraceCheckUtils]: 11: Hoare triple {1542#(<= ~counter~0 0)} call assume_abort_if_not((if ~B~0 % 4294967296 >= 1 then 1 else 0)); {1542#(<= ~counter~0 0)} is VALID [2022-04-27 12:47:15,394 INFO L290 TraceCheckUtils]: 12: Hoare triple {1542#(<= ~counter~0 0)} ~cond := #in~cond; {1542#(<= ~counter~0 0)} is VALID [2022-04-27 12:47:15,394 INFO L290 TraceCheckUtils]: 13: Hoare triple {1542#(<= ~counter~0 0)} assume !(0 == ~cond); {1542#(<= ~counter~0 0)} is VALID [2022-04-27 12:47:15,394 INFO L290 TraceCheckUtils]: 14: Hoare triple {1542#(<= ~counter~0 0)} assume true; {1542#(<= ~counter~0 0)} is VALID [2022-04-27 12:47:15,394 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {1542#(<= ~counter~0 0)} {1542#(<= ~counter~0 0)} #83#return; {1542#(<= ~counter~0 0)} is VALID [2022-04-27 12:47:15,395 INFO L290 TraceCheckUtils]: 16: Hoare triple {1542#(<= ~counter~0 0)} ~q~0 := 0;~r~0 := ~A~0;~b~0 := ~B~0; {1542#(<= ~counter~0 0)} is VALID [2022-04-27 12:47:15,395 INFO L290 TraceCheckUtils]: 17: Hoare triple {1542#(<= ~counter~0 0)} #t~post3 := ~counter~0;~counter~0 := 1 + #t~post3; {1591#(<= ~counter~0 1)} is VALID [2022-04-27 12:47:15,396 INFO L290 TraceCheckUtils]: 18: Hoare triple {1591#(<= ~counter~0 1)} assume !!(#t~post3 < 50);havoc #t~post3; {1591#(<= ~counter~0 1)} is VALID [2022-04-27 12:47:15,396 INFO L290 TraceCheckUtils]: 19: Hoare triple {1591#(<= ~counter~0 1)} assume !!(~r~0 % 4294967296 >= ~b~0 % 4294967296);~b~0 := 2 * ~b~0; {1591#(<= ~counter~0 1)} is VALID [2022-04-27 12:47:15,396 INFO L290 TraceCheckUtils]: 20: Hoare triple {1591#(<= ~counter~0 1)} #t~post3 := ~counter~0;~counter~0 := 1 + #t~post3; {1601#(<= ~counter~0 2)} is VALID [2022-04-27 12:47:15,396 INFO L290 TraceCheckUtils]: 21: Hoare triple {1601#(<= ~counter~0 2)} assume !!(#t~post3 < 50);havoc #t~post3; {1601#(<= ~counter~0 2)} is VALID [2022-04-27 12:47:15,397 INFO L290 TraceCheckUtils]: 22: Hoare triple {1601#(<= ~counter~0 2)} assume !(~r~0 % 4294967296 >= ~b~0 % 4294967296); {1601#(<= ~counter~0 2)} is VALID [2022-04-27 12:47:15,397 INFO L290 TraceCheckUtils]: 23: Hoare triple {1601#(<= ~counter~0 2)} #t~post4 := ~counter~0;~counter~0 := 1 + #t~post4; {1611#(<= |main_#t~post4| 2)} is VALID [2022-04-27 12:47:15,397 INFO L290 TraceCheckUtils]: 24: Hoare triple {1611#(<= |main_#t~post4| 2)} assume !(#t~post4 < 50);havoc #t~post4; {1535#false} is VALID [2022-04-27 12:47:15,397 INFO L272 TraceCheckUtils]: 25: Hoare triple {1535#false} call __VERIFIER_assert((if ~A~0 % 4294967296 == (~q~0 * ~b~0 + ~r~0) % 4294967296 then 1 else 0)); {1535#false} is VALID [2022-04-27 12:47:15,398 INFO L290 TraceCheckUtils]: 26: Hoare triple {1535#false} ~cond := #in~cond; {1535#false} is VALID [2022-04-27 12:47:15,398 INFO L290 TraceCheckUtils]: 27: Hoare triple {1535#false} assume 0 == ~cond; {1535#false} is VALID [2022-04-27 12:47:15,398 INFO L290 TraceCheckUtils]: 28: Hoare triple {1535#false} assume !false; {1535#false} is VALID [2022-04-27 12:47:15,398 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-27 12:47:15,398 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 12:47:15,569 INFO L290 TraceCheckUtils]: 28: Hoare triple {1535#false} assume !false; {1535#false} is VALID [2022-04-27 12:47:15,569 INFO L290 TraceCheckUtils]: 27: Hoare triple {1535#false} assume 0 == ~cond; {1535#false} is VALID [2022-04-27 12:47:15,569 INFO L290 TraceCheckUtils]: 26: Hoare triple {1535#false} ~cond := #in~cond; {1535#false} is VALID [2022-04-27 12:47:15,569 INFO L272 TraceCheckUtils]: 25: Hoare triple {1535#false} call __VERIFIER_assert((if ~A~0 % 4294967296 == (~q~0 * ~b~0 + ~r~0) % 4294967296 then 1 else 0)); {1535#false} is VALID [2022-04-27 12:47:15,570 INFO L290 TraceCheckUtils]: 24: Hoare triple {1639#(< |main_#t~post4| 50)} assume !(#t~post4 < 50);havoc #t~post4; {1535#false} is VALID [2022-04-27 12:47:15,570 INFO L290 TraceCheckUtils]: 23: Hoare triple {1643#(< ~counter~0 50)} #t~post4 := ~counter~0;~counter~0 := 1 + #t~post4; {1639#(< |main_#t~post4| 50)} is VALID [2022-04-27 12:47:15,570 INFO L290 TraceCheckUtils]: 22: Hoare triple {1643#(< ~counter~0 50)} assume !(~r~0 % 4294967296 >= ~b~0 % 4294967296); {1643#(< ~counter~0 50)} is VALID [2022-04-27 12:47:15,571 INFO L290 TraceCheckUtils]: 21: Hoare triple {1643#(< ~counter~0 50)} assume !!(#t~post3 < 50);havoc #t~post3; {1643#(< ~counter~0 50)} is VALID [2022-04-27 12:47:15,571 INFO L290 TraceCheckUtils]: 20: Hoare triple {1653#(< ~counter~0 49)} #t~post3 := ~counter~0;~counter~0 := 1 + #t~post3; {1643#(< ~counter~0 50)} is VALID [2022-04-27 12:47:15,571 INFO L290 TraceCheckUtils]: 19: Hoare triple {1653#(< ~counter~0 49)} assume !!(~r~0 % 4294967296 >= ~b~0 % 4294967296);~b~0 := 2 * ~b~0; {1653#(< ~counter~0 49)} is VALID [2022-04-27 12:47:15,572 INFO L290 TraceCheckUtils]: 18: Hoare triple {1653#(< ~counter~0 49)} assume !!(#t~post3 < 50);havoc #t~post3; {1653#(< ~counter~0 49)} is VALID [2022-04-27 12:47:15,572 INFO L290 TraceCheckUtils]: 17: Hoare triple {1663#(< ~counter~0 48)} #t~post3 := ~counter~0;~counter~0 := 1 + #t~post3; {1653#(< ~counter~0 49)} is VALID [2022-04-27 12:47:15,573 INFO L290 TraceCheckUtils]: 16: Hoare triple {1663#(< ~counter~0 48)} ~q~0 := 0;~r~0 := ~A~0;~b~0 := ~B~0; {1663#(< ~counter~0 48)} is VALID [2022-04-27 12:47:15,573 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {1534#true} {1663#(< ~counter~0 48)} #83#return; {1663#(< ~counter~0 48)} is VALID [2022-04-27 12:47:15,573 INFO L290 TraceCheckUtils]: 14: Hoare triple {1534#true} assume true; {1534#true} is VALID [2022-04-27 12:47:15,573 INFO L290 TraceCheckUtils]: 13: Hoare triple {1534#true} assume !(0 == ~cond); {1534#true} is VALID [2022-04-27 12:47:15,573 INFO L290 TraceCheckUtils]: 12: Hoare triple {1534#true} ~cond := #in~cond; {1534#true} is VALID [2022-04-27 12:47:15,574 INFO L272 TraceCheckUtils]: 11: Hoare triple {1663#(< ~counter~0 48)} call assume_abort_if_not((if ~B~0 % 4294967296 >= 1 then 1 else 0)); {1534#true} is VALID [2022-04-27 12:47:15,574 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1534#true} {1663#(< ~counter~0 48)} #81#return; {1663#(< ~counter~0 48)} is VALID [2022-04-27 12:47:15,574 INFO L290 TraceCheckUtils]: 9: Hoare triple {1534#true} assume true; {1534#true} is VALID [2022-04-27 12:47:15,574 INFO L290 TraceCheckUtils]: 8: Hoare triple {1534#true} assume !(0 == ~cond); {1534#true} is VALID [2022-04-27 12:47:15,574 INFO L290 TraceCheckUtils]: 7: Hoare triple {1534#true} ~cond := #in~cond; {1534#true} is VALID [2022-04-27 12:47:15,574 INFO L272 TraceCheckUtils]: 6: Hoare triple {1663#(< ~counter~0 48)} call assume_abort_if_not((if ~B~0 % 4294967296 < 2147483647 then 1 else 0)); {1534#true} is VALID [2022-04-27 12:47:15,579 INFO L290 TraceCheckUtils]: 5: Hoare triple {1663#(< ~counter~0 48)} havoc ~A~0;havoc ~B~0;havoc ~q~0;havoc ~r~0;havoc ~b~0;~A~0 := #t~nondet1;havoc #t~nondet1;~B~0 := #t~nondet2;havoc #t~nondet2; {1663#(< ~counter~0 48)} is VALID [2022-04-27 12:47:15,580 INFO L272 TraceCheckUtils]: 4: Hoare triple {1663#(< ~counter~0 48)} call #t~ret5 := main(); {1663#(< ~counter~0 48)} is VALID [2022-04-27 12:47:15,580 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1663#(< ~counter~0 48)} {1534#true} #89#return; {1663#(< ~counter~0 48)} is VALID [2022-04-27 12:47:15,580 INFO L290 TraceCheckUtils]: 2: Hoare triple {1663#(< ~counter~0 48)} assume true; {1663#(< ~counter~0 48)} is VALID [2022-04-27 12:47:15,581 INFO L290 TraceCheckUtils]: 1: Hoare triple {1534#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);~counter~0 := 0; {1663#(< ~counter~0 48)} is VALID [2022-04-27 12:47:15,581 INFO L272 TraceCheckUtils]: 0: Hoare triple {1534#true} call ULTIMATE.init(); {1534#true} is VALID [2022-04-27 12:47:15,581 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-27 12:47:15,581 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 12:47:15,581 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1814017843] [2022-04-27 12:47:15,581 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 12:47:15,581 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [738244390] [2022-04-27 12:47:15,582 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [738244390] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 12:47:15,582 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-27 12:47:15,582 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2022-04-27 12:47:15,582 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [637183539] [2022-04-27 12:47:15,582 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-27 12:47:15,582 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.3) internal successors, (33), 10 states have internal predecessors, (33), 4 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (6), 2 states have call predecessors, (6), 3 states have call successors, (6) Word has length 29 [2022-04-27 12:47:15,583 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 12:47:15,583 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 10 states, 10 states have (on average 3.3) internal successors, (33), 10 states have internal predecessors, (33), 4 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (6), 2 states have call predecessors, (6), 3 states have call successors, (6) [2022-04-27 12:47:15,613 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 47 edges. 47 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 12:47:15,613 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-27 12:47:15,614 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 12:47:15,614 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-27 12:47:15,614 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-04-27 12:47:15,614 INFO L87 Difference]: Start difference. First operand 47 states and 56 transitions. Second operand has 10 states, 10 states have (on average 3.3) internal successors, (33), 10 states have internal predecessors, (33), 4 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (6), 2 states have call predecessors, (6), 3 states have call successors, (6) [2022-04-27 12:47:15,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:47:15,952 INFO L93 Difference]: Finished difference Result 98 states and 120 transitions. [2022-04-27 12:47:15,952 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-04-27 12:47:15,953 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.3) internal successors, (33), 10 states have internal predecessors, (33), 4 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (6), 2 states have call predecessors, (6), 3 states have call successors, (6) Word has length 29 [2022-04-27 12:47:15,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 12:47:15,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 3.3) internal successors, (33), 10 states have internal predecessors, (33), 4 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (6), 2 states have call predecessors, (6), 3 states have call successors, (6) [2022-04-27 12:47:15,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 120 transitions. [2022-04-27 12:47:15,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 3.3) internal successors, (33), 10 states have internal predecessors, (33), 4 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (6), 2 states have call predecessors, (6), 3 states have call successors, (6) [2022-04-27 12:47:15,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 120 transitions. [2022-04-27 12:47:15,957 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 13 states and 120 transitions. [2022-04-27 12:47:16,043 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 120 edges. 120 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 12:47:16,044 INFO L225 Difference]: With dead ends: 98 [2022-04-27 12:47:16,045 INFO L226 Difference]: Without dead ends: 91 [2022-04-27 12:47:16,045 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=119, Unknown=0, NotChecked=0, Total=182 [2022-04-27 12:47:16,045 INFO L413 NwaCegarLoop]: 35 mSDtfsCounter, 89 mSDsluCounter, 146 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 89 SdHoareTripleChecker+Valid, 181 SdHoareTripleChecker+Invalid, 80 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-27 12:47:16,046 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [89 Valid, 181 Invalid, 80 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-27 12:47:16,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2022-04-27 12:47:16,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 84. [2022-04-27 12:47:16,065 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 12:47:16,066 INFO L82 GeneralOperation]: Start isEquivalent. First operand 91 states. Second operand has 84 states, 63 states have (on average 1.3492063492063493) internal successors, (85), 67 states have internal predecessors, (85), 13 states have call successors, (13), 8 states have call predecessors, (13), 7 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-27 12:47:16,066 INFO L74 IsIncluded]: Start isIncluded. First operand 91 states. Second operand has 84 states, 63 states have (on average 1.3492063492063493) internal successors, (85), 67 states have internal predecessors, (85), 13 states have call successors, (13), 8 states have call predecessors, (13), 7 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-27 12:47:16,066 INFO L87 Difference]: Start difference. First operand 91 states. Second operand has 84 states, 63 states have (on average 1.3492063492063493) internal successors, (85), 67 states have internal predecessors, (85), 13 states have call successors, (13), 8 states have call predecessors, (13), 7 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-27 12:47:16,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:47:16,068 INFO L93 Difference]: Finished difference Result 91 states and 110 transitions. [2022-04-27 12:47:16,068 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 110 transitions. [2022-04-27 12:47:16,069 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 12:47:16,069 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 12:47:16,069 INFO L74 IsIncluded]: Start isIncluded. First operand has 84 states, 63 states have (on average 1.3492063492063493) internal successors, (85), 67 states have internal predecessors, (85), 13 states have call successors, (13), 8 states have call predecessors, (13), 7 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand 91 states. [2022-04-27 12:47:16,069 INFO L87 Difference]: Start difference. First operand has 84 states, 63 states have (on average 1.3492063492063493) internal successors, (85), 67 states have internal predecessors, (85), 13 states have call successors, (13), 8 states have call predecessors, (13), 7 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand 91 states. [2022-04-27 12:47:16,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:47:16,072 INFO L93 Difference]: Finished difference Result 91 states and 110 transitions. [2022-04-27 12:47:16,072 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 110 transitions. [2022-04-27 12:47:16,072 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 12:47:16,072 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 12:47:16,072 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 12:47:16,072 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 12:47:16,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 63 states have (on average 1.3492063492063493) internal successors, (85), 67 states have internal predecessors, (85), 13 states have call successors, (13), 8 states have call predecessors, (13), 7 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-27 12:47:16,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 106 transitions. [2022-04-27 12:47:16,075 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 106 transitions. Word has length 29 [2022-04-27 12:47:16,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 12:47:16,075 INFO L495 AbstractCegarLoop]: Abstraction has 84 states and 106 transitions. [2022-04-27 12:47:16,075 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.3) internal successors, (33), 10 states have internal predecessors, (33), 4 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (6), 2 states have call predecessors, (6), 3 states have call successors, (6) [2022-04-27 12:47:16,075 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 106 transitions. [2022-04-27 12:47:16,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-04-27 12:47:16,076 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 12:47:16,076 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 12:47:16,093 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-04-27 12:47:16,291 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 12:47:16,292 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 12:47:16,292 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 12:47:16,292 INFO L85 PathProgramCache]: Analyzing trace with hash -2029937874, now seen corresponding path program 1 times [2022-04-27 12:47:16,292 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 12:47:16,292 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [285608997] [2022-04-27 12:47:16,292 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 12:47:16,292 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 12:47:16,304 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 12:47:16,304 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1629620101] [2022-04-27 12:47:16,304 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 12:47:16,304 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 12:47:16,305 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 12:47:16,305 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 12:47:16,306 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-04-27 12:47:16,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:47:16,352 INFO L263 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 15 conjunts are in the unsatisfiable core [2022-04-27 12:47:16,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:47:16,367 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 12:47:17,409 INFO L272 TraceCheckUtils]: 0: Hoare triple {2146#true} call ULTIMATE.init(); {2146#true} is VALID [2022-04-27 12:47:17,410 INFO L290 TraceCheckUtils]: 1: Hoare triple {2146#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);~counter~0 := 0; {2146#true} is VALID [2022-04-27 12:47:17,410 INFO L290 TraceCheckUtils]: 2: Hoare triple {2146#true} assume true; {2146#true} is VALID [2022-04-27 12:47:17,410 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2146#true} {2146#true} #89#return; {2146#true} is VALID [2022-04-27 12:47:17,410 INFO L272 TraceCheckUtils]: 4: Hoare triple {2146#true} call #t~ret5 := main(); {2146#true} is VALID [2022-04-27 12:47:17,410 INFO L290 TraceCheckUtils]: 5: Hoare triple {2146#true} havoc ~A~0;havoc ~B~0;havoc ~q~0;havoc ~r~0;havoc ~b~0;~A~0 := #t~nondet1;havoc #t~nondet1;~B~0 := #t~nondet2;havoc #t~nondet2; {2146#true} is VALID [2022-04-27 12:47:17,410 INFO L272 TraceCheckUtils]: 6: Hoare triple {2146#true} call assume_abort_if_not((if ~B~0 % 4294967296 < 2147483647 then 1 else 0)); {2146#true} is VALID [2022-04-27 12:47:17,410 INFO L290 TraceCheckUtils]: 7: Hoare triple {2146#true} ~cond := #in~cond; {2146#true} is VALID [2022-04-27 12:47:17,410 INFO L290 TraceCheckUtils]: 8: Hoare triple {2146#true} assume !(0 == ~cond); {2146#true} is VALID [2022-04-27 12:47:17,410 INFO L290 TraceCheckUtils]: 9: Hoare triple {2146#true} assume true; {2146#true} is VALID [2022-04-27 12:47:17,410 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2146#true} {2146#true} #81#return; {2146#true} is VALID [2022-04-27 12:47:17,410 INFO L272 TraceCheckUtils]: 11: Hoare triple {2146#true} call assume_abort_if_not((if ~B~0 % 4294967296 >= 1 then 1 else 0)); {2146#true} is VALID [2022-04-27 12:47:17,415 INFO L290 TraceCheckUtils]: 12: Hoare triple {2146#true} ~cond := #in~cond; {2187#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-27 12:47:17,416 INFO L290 TraceCheckUtils]: 13: Hoare triple {2187#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {2191#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-27 12:47:17,416 INFO L290 TraceCheckUtils]: 14: Hoare triple {2191#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {2191#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-27 12:47:17,417 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {2191#(not (= |assume_abort_if_not_#in~cond| 0))} {2146#true} #83#return; {2198#(<= 1 (mod main_~B~0 4294967296))} is VALID [2022-04-27 12:47:17,417 INFO L290 TraceCheckUtils]: 16: Hoare triple {2198#(<= 1 (mod main_~B~0 4294967296))} ~q~0 := 0;~r~0 := ~A~0;~b~0 := ~B~0; {2202#(and (= main_~A~0 main_~r~0) (<= 1 (mod main_~b~0 4294967296)) (= main_~q~0 0))} is VALID [2022-04-27 12:47:17,418 INFO L290 TraceCheckUtils]: 17: Hoare triple {2202#(and (= main_~A~0 main_~r~0) (<= 1 (mod main_~b~0 4294967296)) (= main_~q~0 0))} #t~post3 := ~counter~0;~counter~0 := 1 + #t~post3; {2202#(and (= main_~A~0 main_~r~0) (<= 1 (mod main_~b~0 4294967296)) (= main_~q~0 0))} is VALID [2022-04-27 12:47:17,418 INFO L290 TraceCheckUtils]: 18: Hoare triple {2202#(and (= main_~A~0 main_~r~0) (<= 1 (mod main_~b~0 4294967296)) (= main_~q~0 0))} assume !!(#t~post3 < 50);havoc #t~post3; {2202#(and (= main_~A~0 main_~r~0) (<= 1 (mod main_~b~0 4294967296)) (= main_~q~0 0))} is VALID [2022-04-27 12:47:17,419 INFO L290 TraceCheckUtils]: 19: Hoare triple {2202#(and (= main_~A~0 main_~r~0) (<= 1 (mod main_~b~0 4294967296)) (= main_~q~0 0))} assume !!(~r~0 % 4294967296 >= ~b~0 % 4294967296);~b~0 := 2 * ~b~0; {2212#(and (= main_~A~0 main_~r~0) (< (div (+ (- 1) (mod main_~r~0 4294967296)) (- 4294967296)) 1) (= main_~q~0 0))} is VALID [2022-04-27 12:47:17,419 INFO L290 TraceCheckUtils]: 20: Hoare triple {2212#(and (= main_~A~0 main_~r~0) (< (div (+ (- 1) (mod main_~r~0 4294967296)) (- 4294967296)) 1) (= main_~q~0 0))} #t~post3 := ~counter~0;~counter~0 := 1 + #t~post3; {2212#(and (= main_~A~0 main_~r~0) (< (div (+ (- 1) (mod main_~r~0 4294967296)) (- 4294967296)) 1) (= main_~q~0 0))} is VALID [2022-04-27 12:47:17,420 INFO L290 TraceCheckUtils]: 21: Hoare triple {2212#(and (= main_~A~0 main_~r~0) (< (div (+ (- 1) (mod main_~r~0 4294967296)) (- 4294967296)) 1) (= main_~q~0 0))} assume !!(#t~post3 < 50);havoc #t~post3; {2212#(and (= main_~A~0 main_~r~0) (< (div (+ (- 1) (mod main_~r~0 4294967296)) (- 4294967296)) 1) (= main_~q~0 0))} is VALID [2022-04-27 12:47:17,420 INFO L290 TraceCheckUtils]: 22: Hoare triple {2212#(and (= main_~A~0 main_~r~0) (< (div (+ (- 1) (mod main_~r~0 4294967296)) (- 4294967296)) 1) (= main_~q~0 0))} assume !(~r~0 % 4294967296 >= ~b~0 % 4294967296); {2212#(and (= main_~A~0 main_~r~0) (< (div (+ (- 1) (mod main_~r~0 4294967296)) (- 4294967296)) 1) (= main_~q~0 0))} is VALID [2022-04-27 12:47:17,420 INFO L290 TraceCheckUtils]: 23: Hoare triple {2212#(and (= main_~A~0 main_~r~0) (< (div (+ (- 1) (mod main_~r~0 4294967296)) (- 4294967296)) 1) (= main_~q~0 0))} #t~post4 := ~counter~0;~counter~0 := 1 + #t~post4; {2212#(and (= main_~A~0 main_~r~0) (< (div (+ (- 1) (mod main_~r~0 4294967296)) (- 4294967296)) 1) (= main_~q~0 0))} is VALID [2022-04-27 12:47:17,421 INFO L290 TraceCheckUtils]: 24: Hoare triple {2212#(and (= main_~A~0 main_~r~0) (< (div (+ (- 1) (mod main_~r~0 4294967296)) (- 4294967296)) 1) (= main_~q~0 0))} assume !!(#t~post4 < 50);havoc #t~post4; {2212#(and (= main_~A~0 main_~r~0) (< (div (+ (- 1) (mod main_~r~0 4294967296)) (- 4294967296)) 1) (= main_~q~0 0))} is VALID [2022-04-27 12:47:17,422 INFO L272 TraceCheckUtils]: 25: Hoare triple {2212#(and (= main_~A~0 main_~r~0) (< (div (+ (- 1) (mod main_~r~0 4294967296)) (- 4294967296)) 1) (= main_~q~0 0))} call __VERIFIER_assert((if ~A~0 % 4294967296 == (~q~0 * ~b~0 + ~r~0) % 4294967296 then 1 else 0)); {2231#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 12:47:17,422 INFO L290 TraceCheckUtils]: 26: Hoare triple {2231#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {2235#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 12:47:17,422 INFO L290 TraceCheckUtils]: 27: Hoare triple {2235#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2147#false} is VALID [2022-04-27 12:47:17,422 INFO L290 TraceCheckUtils]: 28: Hoare triple {2147#false} assume !false; {2147#false} is VALID [2022-04-27 12:47:17,424 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-27 12:47:17,424 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 12:47:17,936 INFO L290 TraceCheckUtils]: 28: Hoare triple {2147#false} assume !false; {2147#false} is VALID [2022-04-27 12:47:17,938 INFO L290 TraceCheckUtils]: 27: Hoare triple {2235#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2147#false} is VALID [2022-04-27 12:47:17,938 INFO L290 TraceCheckUtils]: 26: Hoare triple {2231#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {2235#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 12:47:17,939 INFO L272 TraceCheckUtils]: 25: Hoare triple {2251#(forall ((main_~b~0 Int)) (= (mod main_~A~0 4294967296) (mod (+ main_~r~0 (* main_~b~0 main_~q~0)) 4294967296)))} call __VERIFIER_assert((if ~A~0 % 4294967296 == (~q~0 * ~b~0 + ~r~0) % 4294967296 then 1 else 0)); {2231#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 12:47:17,940 INFO L290 TraceCheckUtils]: 24: Hoare triple {2251#(forall ((main_~b~0 Int)) (= (mod main_~A~0 4294967296) (mod (+ main_~r~0 (* main_~b~0 main_~q~0)) 4294967296)))} assume !!(#t~post4 < 50);havoc #t~post4; {2251#(forall ((main_~b~0 Int)) (= (mod main_~A~0 4294967296) (mod (+ main_~r~0 (* main_~b~0 main_~q~0)) 4294967296)))} is VALID [2022-04-27 12:47:17,940 INFO L290 TraceCheckUtils]: 23: Hoare triple {2251#(forall ((main_~b~0 Int)) (= (mod main_~A~0 4294967296) (mod (+ main_~r~0 (* main_~b~0 main_~q~0)) 4294967296)))} #t~post4 := ~counter~0;~counter~0 := 1 + #t~post4; {2251#(forall ((main_~b~0 Int)) (= (mod main_~A~0 4294967296) (mod (+ main_~r~0 (* main_~b~0 main_~q~0)) 4294967296)))} is VALID [2022-04-27 12:47:17,941 INFO L290 TraceCheckUtils]: 22: Hoare triple {2251#(forall ((main_~b~0 Int)) (= (mod main_~A~0 4294967296) (mod (+ main_~r~0 (* main_~b~0 main_~q~0)) 4294967296)))} assume !(~r~0 % 4294967296 >= ~b~0 % 4294967296); {2251#(forall ((main_~b~0 Int)) (= (mod main_~A~0 4294967296) (mod (+ main_~r~0 (* main_~b~0 main_~q~0)) 4294967296)))} is VALID [2022-04-27 12:47:17,941 INFO L290 TraceCheckUtils]: 21: Hoare triple {2251#(forall ((main_~b~0 Int)) (= (mod main_~A~0 4294967296) (mod (+ main_~r~0 (* main_~b~0 main_~q~0)) 4294967296)))} assume !!(#t~post3 < 50);havoc #t~post3; {2251#(forall ((main_~b~0 Int)) (= (mod main_~A~0 4294967296) (mod (+ main_~r~0 (* main_~b~0 main_~q~0)) 4294967296)))} is VALID [2022-04-27 12:47:17,942 INFO L290 TraceCheckUtils]: 20: Hoare triple {2251#(forall ((main_~b~0 Int)) (= (mod main_~A~0 4294967296) (mod (+ main_~r~0 (* main_~b~0 main_~q~0)) 4294967296)))} #t~post3 := ~counter~0;~counter~0 := 1 + #t~post3; {2251#(forall ((main_~b~0 Int)) (= (mod main_~A~0 4294967296) (mod (+ main_~r~0 (* main_~b~0 main_~q~0)) 4294967296)))} is VALID [2022-04-27 12:47:17,942 INFO L290 TraceCheckUtils]: 19: Hoare triple {2270#(or (not (<= (mod main_~b~0 4294967296) (mod main_~r~0 4294967296))) (forall ((main_~b~0 Int)) (= (mod main_~A~0 4294967296) (mod (+ main_~r~0 (* main_~b~0 main_~q~0)) 4294967296))))} assume !!(~r~0 % 4294967296 >= ~b~0 % 4294967296);~b~0 := 2 * ~b~0; {2251#(forall ((main_~b~0 Int)) (= (mod main_~A~0 4294967296) (mod (+ main_~r~0 (* main_~b~0 main_~q~0)) 4294967296)))} is VALID [2022-04-27 12:47:17,943 INFO L290 TraceCheckUtils]: 18: Hoare triple {2270#(or (not (<= (mod main_~b~0 4294967296) (mod main_~r~0 4294967296))) (forall ((main_~b~0 Int)) (= (mod main_~A~0 4294967296) (mod (+ main_~r~0 (* main_~b~0 main_~q~0)) 4294967296))))} assume !!(#t~post3 < 50);havoc #t~post3; {2270#(or (not (<= (mod main_~b~0 4294967296) (mod main_~r~0 4294967296))) (forall ((main_~b~0 Int)) (= (mod main_~A~0 4294967296) (mod (+ main_~r~0 (* main_~b~0 main_~q~0)) 4294967296))))} is VALID [2022-04-27 12:47:17,944 INFO L290 TraceCheckUtils]: 17: Hoare triple {2270#(or (not (<= (mod main_~b~0 4294967296) (mod main_~r~0 4294967296))) (forall ((main_~b~0 Int)) (= (mod main_~A~0 4294967296) (mod (+ main_~r~0 (* main_~b~0 main_~q~0)) 4294967296))))} #t~post3 := ~counter~0;~counter~0 := 1 + #t~post3; {2270#(or (not (<= (mod main_~b~0 4294967296) (mod main_~r~0 4294967296))) (forall ((main_~b~0 Int)) (= (mod main_~A~0 4294967296) (mod (+ main_~r~0 (* main_~b~0 main_~q~0)) 4294967296))))} is VALID [2022-04-27 12:47:17,944 INFO L290 TraceCheckUtils]: 16: Hoare triple {2146#true} ~q~0 := 0;~r~0 := ~A~0;~b~0 := ~B~0; {2270#(or (not (<= (mod main_~b~0 4294967296) (mod main_~r~0 4294967296))) (forall ((main_~b~0 Int)) (= (mod main_~A~0 4294967296) (mod (+ main_~r~0 (* main_~b~0 main_~q~0)) 4294967296))))} is VALID [2022-04-27 12:47:17,945 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {2146#true} {2146#true} #83#return; {2146#true} is VALID [2022-04-27 12:47:17,945 INFO L290 TraceCheckUtils]: 14: Hoare triple {2146#true} assume true; {2146#true} is VALID [2022-04-27 12:47:17,945 INFO L290 TraceCheckUtils]: 13: Hoare triple {2146#true} assume !(0 == ~cond); {2146#true} is VALID [2022-04-27 12:47:17,945 INFO L290 TraceCheckUtils]: 12: Hoare triple {2146#true} ~cond := #in~cond; {2146#true} is VALID [2022-04-27 12:47:17,945 INFO L272 TraceCheckUtils]: 11: Hoare triple {2146#true} call assume_abort_if_not((if ~B~0 % 4294967296 >= 1 then 1 else 0)); {2146#true} is VALID [2022-04-27 12:47:17,945 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2146#true} {2146#true} #81#return; {2146#true} is VALID [2022-04-27 12:47:17,945 INFO L290 TraceCheckUtils]: 9: Hoare triple {2146#true} assume true; {2146#true} is VALID [2022-04-27 12:47:17,945 INFO L290 TraceCheckUtils]: 8: Hoare triple {2146#true} assume !(0 == ~cond); {2146#true} is VALID [2022-04-27 12:47:17,945 INFO L290 TraceCheckUtils]: 7: Hoare triple {2146#true} ~cond := #in~cond; {2146#true} is VALID [2022-04-27 12:47:17,945 INFO L272 TraceCheckUtils]: 6: Hoare triple {2146#true} call assume_abort_if_not((if ~B~0 % 4294967296 < 2147483647 then 1 else 0)); {2146#true} is VALID [2022-04-27 12:47:17,945 INFO L290 TraceCheckUtils]: 5: Hoare triple {2146#true} havoc ~A~0;havoc ~B~0;havoc ~q~0;havoc ~r~0;havoc ~b~0;~A~0 := #t~nondet1;havoc #t~nondet1;~B~0 := #t~nondet2;havoc #t~nondet2; {2146#true} is VALID [2022-04-27 12:47:17,945 INFO L272 TraceCheckUtils]: 4: Hoare triple {2146#true} call #t~ret5 := main(); {2146#true} is VALID [2022-04-27 12:47:17,945 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2146#true} {2146#true} #89#return; {2146#true} is VALID [2022-04-27 12:47:17,946 INFO L290 TraceCheckUtils]: 2: Hoare triple {2146#true} assume true; {2146#true} is VALID [2022-04-27 12:47:17,946 INFO L290 TraceCheckUtils]: 1: Hoare triple {2146#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);~counter~0 := 0; {2146#true} is VALID [2022-04-27 12:47:17,946 INFO L272 TraceCheckUtils]: 0: Hoare triple {2146#true} call ULTIMATE.init(); {2146#true} is VALID [2022-04-27 12:47:17,946 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-27 12:47:17,946 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 12:47:17,946 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [285608997] [2022-04-27 12:47:17,946 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 12:47:17,946 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1629620101] [2022-04-27 12:47:17,946 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1629620101] provided 1 perfect and 1 imperfect interpolant sequences [2022-04-27 12:47:17,946 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-04-27 12:47:17,946 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [9] total 11 [2022-04-27 12:47:17,947 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1861149695] [2022-04-27 12:47:17,947 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 12:47:17,947 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), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 29 [2022-04-27 12:47:17,947 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 12:47:17,947 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), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-27 12:47:19,997 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 25 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-27 12:47:19,998 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-27 12:47:19,998 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 12:47:19,998 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-27 12:47:19,998 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2022-04-27 12:47:19,998 INFO L87 Difference]: Start difference. First operand 84 states and 106 transitions. Second operand has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-27 12:47:20,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:47:20,195 INFO L93 Difference]: Finished difference Result 117 states and 143 transitions. [2022-04-27 12:47:20,195 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-27 12:47:20,196 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), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 29 [2022-04-27 12:47:20,196 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 12:47:20,196 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), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-27 12:47:20,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 49 transitions. [2022-04-27 12:47:20,197 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), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-27 12:47:20,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 49 transitions. [2022-04-27 12:47:20,198 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 49 transitions. [2022-04-27 12:47:20,250 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 49 edges. 49 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 12:47:20,252 INFO L225 Difference]: With dead ends: 117 [2022-04-27 12:47:20,252 INFO L226 Difference]: Without dead ends: 115 [2022-04-27 12:47:20,252 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 47 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2022-04-27 12:47:20,253 INFO L413 NwaCegarLoop]: 39 mSDtfsCounter, 9 mSDsluCounter, 113 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 152 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 26 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 12:47:20,253 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 152 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 26 Unchecked, 0.0s Time] [2022-04-27 12:47:20,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2022-04-27 12:47:20,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 114. [2022-04-27 12:47:20,289 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 12:47:20,291 INFO L82 GeneralOperation]: Start isEquivalent. First operand 115 states. Second operand has 114 states, 85 states have (on average 1.2705882352941176) internal successors, (108), 93 states have internal predecessors, (108), 17 states have call successors, (17), 12 states have call predecessors, (17), 11 states have return successors, (12), 8 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-27 12:47:20,291 INFO L74 IsIncluded]: Start isIncluded. First operand 115 states. Second operand has 114 states, 85 states have (on average 1.2705882352941176) internal successors, (108), 93 states have internal predecessors, (108), 17 states have call successors, (17), 12 states have call predecessors, (17), 11 states have return successors, (12), 8 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-27 12:47:20,292 INFO L87 Difference]: Start difference. First operand 115 states. Second operand has 114 states, 85 states have (on average 1.2705882352941176) internal successors, (108), 93 states have internal predecessors, (108), 17 states have call successors, (17), 12 states have call predecessors, (17), 11 states have return successors, (12), 8 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-27 12:47:20,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:47:20,295 INFO L93 Difference]: Finished difference Result 115 states and 138 transitions. [2022-04-27 12:47:20,295 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 138 transitions. [2022-04-27 12:47:20,295 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 12:47:20,295 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 12:47:20,295 INFO L74 IsIncluded]: Start isIncluded. First operand has 114 states, 85 states have (on average 1.2705882352941176) internal successors, (108), 93 states have internal predecessors, (108), 17 states have call successors, (17), 12 states have call predecessors, (17), 11 states have return successors, (12), 8 states have call predecessors, (12), 12 states have call successors, (12) Second operand 115 states. [2022-04-27 12:47:20,297 INFO L87 Difference]: Start difference. First operand has 114 states, 85 states have (on average 1.2705882352941176) internal successors, (108), 93 states have internal predecessors, (108), 17 states have call successors, (17), 12 states have call predecessors, (17), 11 states have return successors, (12), 8 states have call predecessors, (12), 12 states have call successors, (12) Second operand 115 states. [2022-04-27 12:47:20,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:47:20,302 INFO L93 Difference]: Finished difference Result 115 states and 138 transitions. [2022-04-27 12:47:20,303 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 138 transitions. [2022-04-27 12:47:20,303 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 12:47:20,303 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 12:47:20,303 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 12:47:20,303 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 12:47:20,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114 states, 85 states have (on average 1.2705882352941176) internal successors, (108), 93 states have internal predecessors, (108), 17 states have call successors, (17), 12 states have call predecessors, (17), 11 states have return successors, (12), 8 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-27 12:47:20,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 137 transitions. [2022-04-27 12:47:20,307 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 137 transitions. Word has length 29 [2022-04-27 12:47:20,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 12:47:20,307 INFO L495 AbstractCegarLoop]: Abstraction has 114 states and 137 transitions. [2022-04-27 12:47:20,307 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), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-27 12:47:20,307 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 137 transitions. [2022-04-27 12:47:20,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-04-27 12:47:20,308 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 12:47:20,308 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 12:47:20,327 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-04-27 12:47:20,523 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 12:47:20,524 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 12:47:20,524 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 12:47:20,524 INFO L85 PathProgramCache]: Analyzing trace with hash 223058363, now seen corresponding path program 1 times [2022-04-27 12:47:20,524 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 12:47:20,524 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1617185824] [2022-04-27 12:47:20,524 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 12:47:20,524 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 12:47:20,561 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 12:47:20,561 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1218278281] [2022-04-27 12:47:20,561 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 12:47:20,561 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 12:47:20,561 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 12:47:20,568 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 12:47:20,569 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-04-27 12:47:20,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:47:20,603 INFO L263 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 11 conjunts are in the unsatisfiable core [2022-04-27 12:47:20,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:47:20,616 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 12:47:20,812 INFO L272 TraceCheckUtils]: 0: Hoare triple {2864#true} call ULTIMATE.init(); {2864#true} is VALID [2022-04-27 12:47:20,812 INFO L290 TraceCheckUtils]: 1: Hoare triple {2864#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);~counter~0 := 0; {2864#true} is VALID [2022-04-27 12:47:20,812 INFO L290 TraceCheckUtils]: 2: Hoare triple {2864#true} assume true; {2864#true} is VALID [2022-04-27 12:47:20,812 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2864#true} {2864#true} #89#return; {2864#true} is VALID [2022-04-27 12:47:20,812 INFO L272 TraceCheckUtils]: 4: Hoare triple {2864#true} call #t~ret5 := main(); {2864#true} is VALID [2022-04-27 12:47:20,812 INFO L290 TraceCheckUtils]: 5: Hoare triple {2864#true} havoc ~A~0;havoc ~B~0;havoc ~q~0;havoc ~r~0;havoc ~b~0;~A~0 := #t~nondet1;havoc #t~nondet1;~B~0 := #t~nondet2;havoc #t~nondet2; {2864#true} is VALID [2022-04-27 12:47:20,813 INFO L272 TraceCheckUtils]: 6: Hoare triple {2864#true} call assume_abort_if_not((if ~B~0 % 4294967296 < 2147483647 then 1 else 0)); {2864#true} is VALID [2022-04-27 12:47:20,813 INFO L290 TraceCheckUtils]: 7: Hoare triple {2864#true} ~cond := #in~cond; {2864#true} is VALID [2022-04-27 12:47:20,813 INFO L290 TraceCheckUtils]: 8: Hoare triple {2864#true} assume !(0 == ~cond); {2864#true} is VALID [2022-04-27 12:47:20,813 INFO L290 TraceCheckUtils]: 9: Hoare triple {2864#true} assume true; {2864#true} is VALID [2022-04-27 12:47:20,813 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2864#true} {2864#true} #81#return; {2864#true} is VALID [2022-04-27 12:47:20,813 INFO L272 TraceCheckUtils]: 11: Hoare triple {2864#true} call assume_abort_if_not((if ~B~0 % 4294967296 >= 1 then 1 else 0)); {2864#true} is VALID [2022-04-27 12:47:20,813 INFO L290 TraceCheckUtils]: 12: Hoare triple {2864#true} ~cond := #in~cond; {2864#true} is VALID [2022-04-27 12:47:20,813 INFO L290 TraceCheckUtils]: 13: Hoare triple {2864#true} assume !(0 == ~cond); {2864#true} is VALID [2022-04-27 12:47:20,813 INFO L290 TraceCheckUtils]: 14: Hoare triple {2864#true} assume true; {2864#true} is VALID [2022-04-27 12:47:20,813 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {2864#true} {2864#true} #83#return; {2864#true} is VALID [2022-04-27 12:47:20,813 INFO L290 TraceCheckUtils]: 16: Hoare triple {2864#true} ~q~0 := 0;~r~0 := ~A~0;~b~0 := ~B~0; {2864#true} is VALID [2022-04-27 12:47:20,813 INFO L290 TraceCheckUtils]: 17: Hoare triple {2864#true} #t~post3 := ~counter~0;~counter~0 := 1 + #t~post3; {2864#true} is VALID [2022-04-27 12:47:20,813 INFO L290 TraceCheckUtils]: 18: Hoare triple {2864#true} assume !!(#t~post3 < 50);havoc #t~post3; {2864#true} is VALID [2022-04-27 12:47:20,813 INFO L290 TraceCheckUtils]: 19: Hoare triple {2864#true} assume !!(~r~0 % 4294967296 >= ~b~0 % 4294967296);~b~0 := 2 * ~b~0; {2864#true} is VALID [2022-04-27 12:47:20,814 INFO L290 TraceCheckUtils]: 20: Hoare triple {2864#true} #t~post3 := ~counter~0;~counter~0 := 1 + #t~post3; {2864#true} is VALID [2022-04-27 12:47:20,814 INFO L290 TraceCheckUtils]: 21: Hoare triple {2864#true} assume !!(#t~post3 < 50);havoc #t~post3; {2864#true} is VALID [2022-04-27 12:47:20,814 INFO L290 TraceCheckUtils]: 22: Hoare triple {2864#true} assume !(~r~0 % 4294967296 >= ~b~0 % 4294967296); {2864#true} is VALID [2022-04-27 12:47:20,814 INFO L290 TraceCheckUtils]: 23: Hoare triple {2864#true} #t~post4 := ~counter~0;~counter~0 := 1 + #t~post4; {2864#true} is VALID [2022-04-27 12:47:20,814 INFO L290 TraceCheckUtils]: 24: Hoare triple {2864#true} assume !!(#t~post4 < 50);havoc #t~post4; {2864#true} is VALID [2022-04-27 12:47:20,814 INFO L272 TraceCheckUtils]: 25: Hoare triple {2864#true} call __VERIFIER_assert((if ~A~0 % 4294967296 == (~q~0 * ~b~0 + ~r~0) % 4294967296 then 1 else 0)); {2864#true} is VALID [2022-04-27 12:47:20,814 INFO L290 TraceCheckUtils]: 26: Hoare triple {2864#true} ~cond := #in~cond; {2947#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-27 12:47:20,815 INFO L290 TraceCheckUtils]: 27: Hoare triple {2947#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {2951#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 12:47:20,815 INFO L290 TraceCheckUtils]: 28: Hoare triple {2951#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {2951#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 12:47:20,816 INFO L284 TraceCheckUtils]: 29: Hoare quadruple {2951#(not (= |__VERIFIER_assert_#in~cond| 0))} {2864#true} #85#return; {2958#(= (mod main_~A~0 4294967296) (mod (+ main_~r~0 (* main_~b~0 main_~q~0)) 4294967296))} is VALID [2022-04-27 12:47:20,816 INFO L290 TraceCheckUtils]: 30: Hoare triple {2958#(= (mod main_~A~0 4294967296) (mod (+ main_~r~0 (* main_~b~0 main_~q~0)) 4294967296))} assume !(~b~0 % 4294967296 != ~B~0 % 4294967296); {2958#(= (mod main_~A~0 4294967296) (mod (+ main_~r~0 (* main_~b~0 main_~q~0)) 4294967296))} is VALID [2022-04-27 12:47:20,817 INFO L272 TraceCheckUtils]: 31: Hoare triple {2958#(= (mod main_~A~0 4294967296) (mod (+ main_~r~0 (* main_~b~0 main_~q~0)) 4294967296))} call __VERIFIER_assert((if ~A~0 % 4294967296 == (~q~0 * ~b~0 + ~r~0) % 4294967296 then 1 else 0)); {2965#(= |__VERIFIER_assert_#in~cond| 1)} is VALID [2022-04-27 12:47:20,817 INFO L290 TraceCheckUtils]: 32: Hoare triple {2965#(= |__VERIFIER_assert_#in~cond| 1)} ~cond := #in~cond; {2969#(= __VERIFIER_assert_~cond 1)} is VALID [2022-04-27 12:47:20,817 INFO L290 TraceCheckUtils]: 33: Hoare triple {2969#(= __VERIFIER_assert_~cond 1)} assume 0 == ~cond; {2865#false} is VALID [2022-04-27 12:47:20,817 INFO L290 TraceCheckUtils]: 34: Hoare triple {2865#false} assume !false; {2865#false} is VALID [2022-04-27 12:47:20,818 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-04-27 12:47:20,818 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 12:47:21,733 INFO L290 TraceCheckUtils]: 34: Hoare triple {2865#false} assume !false; {2865#false} is VALID [2022-04-27 12:47:21,733 INFO L290 TraceCheckUtils]: 33: Hoare triple {2979#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {2865#false} is VALID [2022-04-27 12:47:21,734 INFO L290 TraceCheckUtils]: 32: Hoare triple {2951#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {2979#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-27 12:47:21,734 INFO L272 TraceCheckUtils]: 31: Hoare triple {2958#(= (mod main_~A~0 4294967296) (mod (+ main_~r~0 (* main_~b~0 main_~q~0)) 4294967296))} call __VERIFIER_assert((if ~A~0 % 4294967296 == (~q~0 * ~b~0 + ~r~0) % 4294967296 then 1 else 0)); {2951#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 12:47:21,735 INFO L290 TraceCheckUtils]: 30: Hoare triple {2958#(= (mod main_~A~0 4294967296) (mod (+ main_~r~0 (* main_~b~0 main_~q~0)) 4294967296))} assume !(~b~0 % 4294967296 != ~B~0 % 4294967296); {2958#(= (mod main_~A~0 4294967296) (mod (+ main_~r~0 (* main_~b~0 main_~q~0)) 4294967296))} is VALID [2022-04-27 12:47:21,735 INFO L284 TraceCheckUtils]: 29: Hoare quadruple {2951#(not (= |__VERIFIER_assert_#in~cond| 0))} {2864#true} #85#return; {2958#(= (mod main_~A~0 4294967296) (mod (+ main_~r~0 (* main_~b~0 main_~q~0)) 4294967296))} is VALID [2022-04-27 12:47:21,736 INFO L290 TraceCheckUtils]: 28: Hoare triple {2951#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {2951#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 12:47:21,736 INFO L290 TraceCheckUtils]: 27: Hoare triple {3001#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {2951#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 12:47:21,736 INFO L290 TraceCheckUtils]: 26: Hoare triple {2864#true} ~cond := #in~cond; {3001#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-27 12:47:21,736 INFO L272 TraceCheckUtils]: 25: Hoare triple {2864#true} call __VERIFIER_assert((if ~A~0 % 4294967296 == (~q~0 * ~b~0 + ~r~0) % 4294967296 then 1 else 0)); {2864#true} is VALID [2022-04-27 12:47:21,736 INFO L290 TraceCheckUtils]: 24: Hoare triple {2864#true} assume !!(#t~post4 < 50);havoc #t~post4; {2864#true} is VALID [2022-04-27 12:47:21,737 INFO L290 TraceCheckUtils]: 23: Hoare triple {2864#true} #t~post4 := ~counter~0;~counter~0 := 1 + #t~post4; {2864#true} is VALID [2022-04-27 12:47:21,737 INFO L290 TraceCheckUtils]: 22: Hoare triple {2864#true} assume !(~r~0 % 4294967296 >= ~b~0 % 4294967296); {2864#true} is VALID [2022-04-27 12:47:21,737 INFO L290 TraceCheckUtils]: 21: Hoare triple {2864#true} assume !!(#t~post3 < 50);havoc #t~post3; {2864#true} is VALID [2022-04-27 12:47:21,737 INFO L290 TraceCheckUtils]: 20: Hoare triple {2864#true} #t~post3 := ~counter~0;~counter~0 := 1 + #t~post3; {2864#true} is VALID [2022-04-27 12:47:21,737 INFO L290 TraceCheckUtils]: 19: Hoare triple {2864#true} assume !!(~r~0 % 4294967296 >= ~b~0 % 4294967296);~b~0 := 2 * ~b~0; {2864#true} is VALID [2022-04-27 12:47:21,737 INFO L290 TraceCheckUtils]: 18: Hoare triple {2864#true} assume !!(#t~post3 < 50);havoc #t~post3; {2864#true} is VALID [2022-04-27 12:47:21,737 INFO L290 TraceCheckUtils]: 17: Hoare triple {2864#true} #t~post3 := ~counter~0;~counter~0 := 1 + #t~post3; {2864#true} is VALID [2022-04-27 12:47:21,737 INFO L290 TraceCheckUtils]: 16: Hoare triple {2864#true} ~q~0 := 0;~r~0 := ~A~0;~b~0 := ~B~0; {2864#true} is VALID [2022-04-27 12:47:21,737 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {2864#true} {2864#true} #83#return; {2864#true} is VALID [2022-04-27 12:47:21,737 INFO L290 TraceCheckUtils]: 14: Hoare triple {2864#true} assume true; {2864#true} is VALID [2022-04-27 12:47:21,737 INFO L290 TraceCheckUtils]: 13: Hoare triple {2864#true} assume !(0 == ~cond); {2864#true} is VALID [2022-04-27 12:47:21,737 INFO L290 TraceCheckUtils]: 12: Hoare triple {2864#true} ~cond := #in~cond; {2864#true} is VALID [2022-04-27 12:47:21,737 INFO L272 TraceCheckUtils]: 11: Hoare triple {2864#true} call assume_abort_if_not((if ~B~0 % 4294967296 >= 1 then 1 else 0)); {2864#true} is VALID [2022-04-27 12:47:21,738 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2864#true} {2864#true} #81#return; {2864#true} is VALID [2022-04-27 12:47:21,738 INFO L290 TraceCheckUtils]: 9: Hoare triple {2864#true} assume true; {2864#true} is VALID [2022-04-27 12:47:21,738 INFO L290 TraceCheckUtils]: 8: Hoare triple {2864#true} assume !(0 == ~cond); {2864#true} is VALID [2022-04-27 12:47:21,738 INFO L290 TraceCheckUtils]: 7: Hoare triple {2864#true} ~cond := #in~cond; {2864#true} is VALID [2022-04-27 12:47:21,738 INFO L272 TraceCheckUtils]: 6: Hoare triple {2864#true} call assume_abort_if_not((if ~B~0 % 4294967296 < 2147483647 then 1 else 0)); {2864#true} is VALID [2022-04-27 12:47:21,738 INFO L290 TraceCheckUtils]: 5: Hoare triple {2864#true} havoc ~A~0;havoc ~B~0;havoc ~q~0;havoc ~r~0;havoc ~b~0;~A~0 := #t~nondet1;havoc #t~nondet1;~B~0 := #t~nondet2;havoc #t~nondet2; {2864#true} is VALID [2022-04-27 12:47:21,738 INFO L272 TraceCheckUtils]: 4: Hoare triple {2864#true} call #t~ret5 := main(); {2864#true} is VALID [2022-04-27 12:47:21,738 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2864#true} {2864#true} #89#return; {2864#true} is VALID [2022-04-27 12:47:21,738 INFO L290 TraceCheckUtils]: 2: Hoare triple {2864#true} assume true; {2864#true} is VALID [2022-04-27 12:47:21,738 INFO L290 TraceCheckUtils]: 1: Hoare triple {2864#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);~counter~0 := 0; {2864#true} is VALID [2022-04-27 12:47:21,743 INFO L272 TraceCheckUtils]: 0: Hoare triple {2864#true} call ULTIMATE.init(); {2864#true} is VALID [2022-04-27 12:47:21,744 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-04-27 12:47:21,744 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 12:47:21,744 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1617185824] [2022-04-27 12:47:21,744 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 12:47:21,744 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1218278281] [2022-04-27 12:47:21,744 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1218278281] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 12:47:21,744 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-27 12:47:21,744 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6] total 9 [2022-04-27 12:47:21,744 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [10923377] [2022-04-27 12:47:21,744 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-27 12:47:21,746 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 8 states have internal predecessors, (24), 2 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) Word has length 35 [2022-04-27 12:47:21,746 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 12:47:21,746 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 9 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 8 states have internal predecessors, (24), 2 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2022-04-27 12:47:21,770 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 35 edges. 35 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 12:47:21,771 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-27 12:47:21,771 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 12:47:21,771 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-27 12:47:21,771 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2022-04-27 12:47:21,771 INFO L87 Difference]: Start difference. First operand 114 states and 137 transitions. Second operand has 9 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 8 states have internal predecessors, (24), 2 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2022-04-27 12:47:23,996 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-27 12:47:24,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:47:24,236 INFO L93 Difference]: Finished difference Result 133 states and 155 transitions. [2022-04-27 12:47:24,236 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-27 12:47:24,237 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 8 states have internal predecessors, (24), 2 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) Word has length 35 [2022-04-27 12:47:24,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 12:47:24,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 8 states have internal predecessors, (24), 2 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2022-04-27 12:47:24,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 48 transitions. [2022-04-27 12:47:24,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 8 states have internal predecessors, (24), 2 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2022-04-27 12:47:24,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 48 transitions. [2022-04-27 12:47:24,239 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 48 transitions. [2022-04-27 12:47:24,282 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 48 edges. 48 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 12:47:24,283 INFO L225 Difference]: With dead ends: 133 [2022-04-27 12:47:24,284 INFO L226 Difference]: Without dead ends: 111 [2022-04-27 12:47:24,284 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2022-04-27 12:47:24,284 INFO L413 NwaCegarLoop]: 26 mSDtfsCounter, 17 mSDsluCounter, 136 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 4 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 162 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2022-04-27 12:47:24,285 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 162 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 69 Invalid, 1 Unknown, 0 Unchecked, 2.2s Time] [2022-04-27 12:47:24,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2022-04-27 12:47:24,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 111. [2022-04-27 12:47:24,306 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 12:47:24,306 INFO L82 GeneralOperation]: Start isEquivalent. First operand 111 states. Second operand has 111 states, 85 states have (on average 1.223529411764706) internal successors, (104), 90 states have internal predecessors, (104), 14 states have call successors, (14), 12 states have call predecessors, (14), 11 states have return successors, (12), 8 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-27 12:47:24,306 INFO L74 IsIncluded]: Start isIncluded. First operand 111 states. Second operand has 111 states, 85 states have (on average 1.223529411764706) internal successors, (104), 90 states have internal predecessors, (104), 14 states have call successors, (14), 12 states have call predecessors, (14), 11 states have return successors, (12), 8 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-27 12:47:24,307 INFO L87 Difference]: Start difference. First operand 111 states. Second operand has 111 states, 85 states have (on average 1.223529411764706) internal successors, (104), 90 states have internal predecessors, (104), 14 states have call successors, (14), 12 states have call predecessors, (14), 11 states have return successors, (12), 8 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-27 12:47:24,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:47:24,309 INFO L93 Difference]: Finished difference Result 111 states and 130 transitions. [2022-04-27 12:47:24,309 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 130 transitions. [2022-04-27 12:47:24,310 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 12:47:24,310 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 12:47:24,310 INFO L74 IsIncluded]: Start isIncluded. First operand has 111 states, 85 states have (on average 1.223529411764706) internal successors, (104), 90 states have internal predecessors, (104), 14 states have call successors, (14), 12 states have call predecessors, (14), 11 states have return successors, (12), 8 states have call predecessors, (12), 12 states have call successors, (12) Second operand 111 states. [2022-04-27 12:47:24,310 INFO L87 Difference]: Start difference. First operand has 111 states, 85 states have (on average 1.223529411764706) internal successors, (104), 90 states have internal predecessors, (104), 14 states have call successors, (14), 12 states have call predecessors, (14), 11 states have return successors, (12), 8 states have call predecessors, (12), 12 states have call successors, (12) Second operand 111 states. [2022-04-27 12:47:24,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:47:24,313 INFO L93 Difference]: Finished difference Result 111 states and 130 transitions. [2022-04-27 12:47:24,313 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 130 transitions. [2022-04-27 12:47:24,313 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 12:47:24,314 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 12:47:24,314 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 12:47:24,314 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 12:47:24,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 85 states have (on average 1.223529411764706) internal successors, (104), 90 states have internal predecessors, (104), 14 states have call successors, (14), 12 states have call predecessors, (14), 11 states have return successors, (12), 8 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-27 12:47:24,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 130 transitions. [2022-04-27 12:47:24,317 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 130 transitions. Word has length 35 [2022-04-27 12:47:24,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 12:47:24,317 INFO L495 AbstractCegarLoop]: Abstraction has 111 states and 130 transitions. [2022-04-27 12:47:24,317 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 8 states have internal predecessors, (24), 2 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2022-04-27 12:47:24,317 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 130 transitions. [2022-04-27 12:47:24,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-04-27 12:47:24,318 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 12:47:24,318 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 12:47:24,339 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-04-27 12:47:24,519 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 12:47:24,519 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 12:47:24,520 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 12:47:24,520 INFO L85 PathProgramCache]: Analyzing trace with hash -1731935178, now seen corresponding path program 1 times [2022-04-27 12:47:24,520 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 12:47:24,520 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1606880599] [2022-04-27 12:47:24,520 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 12:47:24,520 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 12:47:24,530 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 12:47:24,531 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1191548298] [2022-04-27 12:47:24,531 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 12:47:24,531 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 12:47:24,531 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 12:47:24,532 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 12:47:24,533 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-04-27 12:47:24,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:47:24,565 INFO L263 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 3 conjunts are in the unsatisfiable core [2022-04-27 12:47:24,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:47:24,572 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 12:47:24,639 INFO L272 TraceCheckUtils]: 0: Hoare triple {3624#true} call ULTIMATE.init(); {3624#true} is VALID [2022-04-27 12:47:24,639 INFO L290 TraceCheckUtils]: 1: Hoare triple {3624#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);~counter~0 := 0; {3624#true} is VALID [2022-04-27 12:47:24,639 INFO L290 TraceCheckUtils]: 2: Hoare triple {3624#true} assume true; {3624#true} is VALID [2022-04-27 12:47:24,639 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3624#true} {3624#true} #89#return; {3624#true} is VALID [2022-04-27 12:47:24,640 INFO L272 TraceCheckUtils]: 4: Hoare triple {3624#true} call #t~ret5 := main(); {3624#true} is VALID [2022-04-27 12:47:24,640 INFO L290 TraceCheckUtils]: 5: Hoare triple {3624#true} havoc ~A~0;havoc ~B~0;havoc ~q~0;havoc ~r~0;havoc ~b~0;~A~0 := #t~nondet1;havoc #t~nondet1;~B~0 := #t~nondet2;havoc #t~nondet2; {3624#true} is VALID [2022-04-27 12:47:24,640 INFO L272 TraceCheckUtils]: 6: Hoare triple {3624#true} call assume_abort_if_not((if ~B~0 % 4294967296 < 2147483647 then 1 else 0)); {3624#true} is VALID [2022-04-27 12:47:24,640 INFO L290 TraceCheckUtils]: 7: Hoare triple {3624#true} ~cond := #in~cond; {3624#true} is VALID [2022-04-27 12:47:24,640 INFO L290 TraceCheckUtils]: 8: Hoare triple {3624#true} assume !(0 == ~cond); {3624#true} is VALID [2022-04-27 12:47:24,640 INFO L290 TraceCheckUtils]: 9: Hoare triple {3624#true} assume true; {3624#true} is VALID [2022-04-27 12:47:24,640 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {3624#true} {3624#true} #81#return; {3624#true} is VALID [2022-04-27 12:47:24,640 INFO L272 TraceCheckUtils]: 11: Hoare triple {3624#true} call assume_abort_if_not((if ~B~0 % 4294967296 >= 1 then 1 else 0)); {3624#true} is VALID [2022-04-27 12:47:24,640 INFO L290 TraceCheckUtils]: 12: Hoare triple {3624#true} ~cond := #in~cond; {3624#true} is VALID [2022-04-27 12:47:24,640 INFO L290 TraceCheckUtils]: 13: Hoare triple {3624#true} assume !(0 == ~cond); {3624#true} is VALID [2022-04-27 12:47:24,640 INFO L290 TraceCheckUtils]: 14: Hoare triple {3624#true} assume true; {3624#true} is VALID [2022-04-27 12:47:24,640 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {3624#true} {3624#true} #83#return; {3624#true} is VALID [2022-04-27 12:47:24,643 INFO L290 TraceCheckUtils]: 16: Hoare triple {3624#true} ~q~0 := 0;~r~0 := ~A~0;~b~0 := ~B~0; {3677#(= main_~B~0 main_~b~0)} is VALID [2022-04-27 12:47:24,643 INFO L290 TraceCheckUtils]: 17: Hoare triple {3677#(= main_~B~0 main_~b~0)} #t~post3 := ~counter~0;~counter~0 := 1 + #t~post3; {3677#(= main_~B~0 main_~b~0)} is VALID [2022-04-27 12:47:24,644 INFO L290 TraceCheckUtils]: 18: Hoare triple {3677#(= main_~B~0 main_~b~0)} assume !!(#t~post3 < 50);havoc #t~post3; {3677#(= main_~B~0 main_~b~0)} is VALID [2022-04-27 12:47:24,644 INFO L290 TraceCheckUtils]: 19: Hoare triple {3677#(= main_~B~0 main_~b~0)} assume !(~r~0 % 4294967296 >= ~b~0 % 4294967296); {3677#(= main_~B~0 main_~b~0)} is VALID [2022-04-27 12:47:24,644 INFO L290 TraceCheckUtils]: 20: Hoare triple {3677#(= main_~B~0 main_~b~0)} #t~post4 := ~counter~0;~counter~0 := 1 + #t~post4; {3677#(= main_~B~0 main_~b~0)} is VALID [2022-04-27 12:47:24,647 INFO L290 TraceCheckUtils]: 21: Hoare triple {3677#(= main_~B~0 main_~b~0)} assume !!(#t~post4 < 50);havoc #t~post4; {3677#(= main_~B~0 main_~b~0)} is VALID [2022-04-27 12:47:24,648 INFO L272 TraceCheckUtils]: 22: Hoare triple {3677#(= main_~B~0 main_~b~0)} call __VERIFIER_assert((if ~A~0 % 4294967296 == (~q~0 * ~b~0 + ~r~0) % 4294967296 then 1 else 0)); {3624#true} is VALID [2022-04-27 12:47:24,648 INFO L290 TraceCheckUtils]: 23: Hoare triple {3624#true} ~cond := #in~cond; {3624#true} is VALID [2022-04-27 12:47:24,648 INFO L290 TraceCheckUtils]: 24: Hoare triple {3624#true} assume !(0 == ~cond); {3624#true} is VALID [2022-04-27 12:47:24,648 INFO L290 TraceCheckUtils]: 25: Hoare triple {3624#true} assume true; {3624#true} is VALID [2022-04-27 12:47:24,649 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {3624#true} {3677#(= main_~B~0 main_~b~0)} #85#return; {3677#(= main_~B~0 main_~b~0)} is VALID [2022-04-27 12:47:24,649 INFO L290 TraceCheckUtils]: 27: Hoare triple {3677#(= main_~B~0 main_~b~0)} assume !!(~b~0 % 4294967296 != ~B~0 % 4294967296);~q~0 := 2 * ~q~0;~b~0 := (if ~b~0 % 4294967296 < 0 && 0 != ~b~0 % 4294967296 % 2 then 1 + ~b~0 % 4294967296 / 2 else ~b~0 % 4294967296 / 2); {3625#false} is VALID [2022-04-27 12:47:24,649 INFO L290 TraceCheckUtils]: 28: Hoare triple {3625#false} assume ~r~0 % 4294967296 >= ~b~0 % 4294967296;~q~0 := 1 + ~q~0;~r~0 := ~r~0 - ~b~0; {3625#false} is VALID [2022-04-27 12:47:24,649 INFO L290 TraceCheckUtils]: 29: Hoare triple {3625#false} #t~post4 := ~counter~0;~counter~0 := 1 + #t~post4; {3625#false} is VALID [2022-04-27 12:47:24,649 INFO L290 TraceCheckUtils]: 30: Hoare triple {3625#false} assume !!(#t~post4 < 50);havoc #t~post4; {3625#false} is VALID [2022-04-27 12:47:24,649 INFO L272 TraceCheckUtils]: 31: Hoare triple {3625#false} call __VERIFIER_assert((if ~A~0 % 4294967296 == (~q~0 * ~b~0 + ~r~0) % 4294967296 then 1 else 0)); {3625#false} is VALID [2022-04-27 12:47:24,650 INFO L290 TraceCheckUtils]: 32: Hoare triple {3625#false} ~cond := #in~cond; {3625#false} is VALID [2022-04-27 12:47:24,650 INFO L290 TraceCheckUtils]: 33: Hoare triple {3625#false} assume 0 == ~cond; {3625#false} is VALID [2022-04-27 12:47:24,650 INFO L290 TraceCheckUtils]: 34: Hoare triple {3625#false} assume !false; {3625#false} is VALID [2022-04-27 12:47:24,650 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-27 12:47:24,650 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-27 12:47:24,650 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 12:47:24,650 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1606880599] [2022-04-27 12:47:24,650 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 12:47:24,650 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1191548298] [2022-04-27 12:47:24,650 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1191548298] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 12:47:24,650 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 12:47:24,650 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-27 12:47:24,650 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1846806597] [2022-04-27 12:47:24,651 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 12:47:24,651 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 3 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 35 [2022-04-27 12:47:24,651 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 12:47:24,651 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 3 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-27 12:47:24,675 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 32 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 12:47:24,675 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-27 12:47:24,676 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 12:47:24,676 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-27 12:47:24,676 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-27 12:47:24,676 INFO L87 Difference]: Start difference. First operand 111 states and 130 transitions. Second operand has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 3 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-27 12:47:24,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:47:24,765 INFO L93 Difference]: Finished difference Result 145 states and 171 transitions. [2022-04-27 12:47:24,765 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-27 12:47:24,765 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 3 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 35 [2022-04-27 12:47:24,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 12:47:24,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 3 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-27 12:47:24,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 56 transitions. [2022-04-27 12:47:24,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 3 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-27 12:47:24,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 56 transitions. [2022-04-27 12:47:24,767 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 56 transitions. [2022-04-27 12:47:24,811 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 56 edges. 56 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 12:47:24,813 INFO L225 Difference]: With dead ends: 145 [2022-04-27 12:47:24,813 INFO L226 Difference]: Without dead ends: 95 [2022-04-27 12:47:24,813 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-27 12:47:24,814 INFO L413 NwaCegarLoop]: 32 mSDtfsCounter, 0 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 54 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 12:47:24,814 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 54 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 12:47:24,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2022-04-27 12:47:24,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 95. [2022-04-27 12:47:24,833 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 12:47:24,833 INFO L82 GeneralOperation]: Start isEquivalent. First operand 95 states. Second operand has 95 states, 73 states have (on average 1.2191780821917808) internal successors, (89), 77 states have internal predecessors, (89), 12 states have call successors, (12), 10 states have call predecessors, (12), 9 states have return successors, (10), 7 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-27 12:47:24,833 INFO L74 IsIncluded]: Start isIncluded. First operand 95 states. Second operand has 95 states, 73 states have (on average 1.2191780821917808) internal successors, (89), 77 states have internal predecessors, (89), 12 states have call successors, (12), 10 states have call predecessors, (12), 9 states have return successors, (10), 7 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-27 12:47:24,833 INFO L87 Difference]: Start difference. First operand 95 states. Second operand has 95 states, 73 states have (on average 1.2191780821917808) internal successors, (89), 77 states have internal predecessors, (89), 12 states have call successors, (12), 10 states have call predecessors, (12), 9 states have return successors, (10), 7 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-27 12:47:24,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:47:24,835 INFO L93 Difference]: Finished difference Result 95 states and 111 transitions. [2022-04-27 12:47:24,835 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 111 transitions. [2022-04-27 12:47:24,836 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 12:47:24,836 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 12:47:24,836 INFO L74 IsIncluded]: Start isIncluded. First operand has 95 states, 73 states have (on average 1.2191780821917808) internal successors, (89), 77 states have internal predecessors, (89), 12 states have call successors, (12), 10 states have call predecessors, (12), 9 states have return successors, (10), 7 states have call predecessors, (10), 10 states have call successors, (10) Second operand 95 states. [2022-04-27 12:47:24,836 INFO L87 Difference]: Start difference. First operand has 95 states, 73 states have (on average 1.2191780821917808) internal successors, (89), 77 states have internal predecessors, (89), 12 states have call successors, (12), 10 states have call predecessors, (12), 9 states have return successors, (10), 7 states have call predecessors, (10), 10 states have call successors, (10) Second operand 95 states. [2022-04-27 12:47:24,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:47:24,838 INFO L93 Difference]: Finished difference Result 95 states and 111 transitions. [2022-04-27 12:47:24,838 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 111 transitions. [2022-04-27 12:47:24,838 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 12:47:24,838 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 12:47:24,838 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 12:47:24,838 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 12:47:24,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 73 states have (on average 1.2191780821917808) internal successors, (89), 77 states have internal predecessors, (89), 12 states have call successors, (12), 10 states have call predecessors, (12), 9 states have return successors, (10), 7 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-27 12:47:24,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 111 transitions. [2022-04-27 12:47:24,840 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 111 transitions. Word has length 35 [2022-04-27 12:47:24,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 12:47:24,841 INFO L495 AbstractCegarLoop]: Abstraction has 95 states and 111 transitions. [2022-04-27 12:47:24,841 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 3 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-27 12:47:24,841 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 111 transitions. [2022-04-27 12:47:24,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-04-27 12:47:24,841 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 12:47:24,841 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 12:47:24,859 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-04-27 12:47:25,058 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2022-04-27 12:47:25,059 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 12:47:25,059 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 12:47:25,059 INFO L85 PathProgramCache]: Analyzing trace with hash 817777954, now seen corresponding path program 1 times [2022-04-27 12:47:25,059 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 12:47:25,059 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [422306169] [2022-04-27 12:47:25,059 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 12:47:25,059 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 12:47:25,075 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 12:47:25,075 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1900501686] [2022-04-27 12:47:25,075 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 12:47:25,075 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 12:47:25,075 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 12:47:25,076 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 12:47:25,078 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process