/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_valuebound100.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-fb4f59a-m [2022-04-27 12:47:28,309 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-27 12:47:28,310 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-27 12:47:28,355 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-27 12:47:28,356 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-27 12:47:28,357 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-27 12:47:28,357 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-27 12:47:28,359 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-27 12:47:28,380 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-27 12:47:28,381 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-27 12:47:28,389 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-27 12:47:28,391 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-27 12:47:28,392 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-27 12:47:28,395 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-27 12:47:28,396 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-27 12:47:28,398 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-27 12:47:28,398 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-27 12:47:28,400 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-27 12:47:28,405 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-27 12:47:28,410 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-27 12:47:28,412 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-27 12:47:28,413 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-27 12:47:28,413 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-27 12:47:28,416 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-27 12:47:28,417 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-27 12:47:28,419 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-27 12:47:28,419 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-27 12:47:28,419 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-27 12:47:28,420 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-27 12:47:28,420 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-27 12:47:28,420 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-27 12:47:28,421 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-27 12:47:28,421 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-27 12:47:28,421 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-27 12:47:28,422 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-27 12:47:28,422 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-27 12:47:28,422 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-27 12:47:28,423 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-27 12:47:28,423 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-27 12:47:28,423 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-27 12:47:28,424 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-27 12:47:28,428 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-27 12:47:28,428 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:28,454 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-27 12:47:28,454 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-27 12:47:28,454 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-04-27 12:47:28,454 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-04-27 12:47:28,455 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-04-27 12:47:28,455 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-04-27 12:47:28,455 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-04-27 12:47:28,456 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-04-27 12:47:28,456 INFO L138 SettingsManager]: * Use SBE=true [2022-04-27 12:47:28,456 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-27 12:47:28,456 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-27 12:47:28,456 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-27 12:47:28,456 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-27 12:47:28,457 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-27 12:47:28,457 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-27 12:47:28,457 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-27 12:47:28,457 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-27 12:47:28,458 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-27 12:47:28,458 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-27 12:47:28,458 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-27 12:47:28,458 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-27 12:47:28,458 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-27 12:47:28,458 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-27 12:47:28,458 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-27 12:47:28,458 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 12:47:28,458 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-27 12:47:28,458 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-04-27 12:47:28,459 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-04-27 12:47:28,459 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-04-27 12:47:28,459 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-04-27 12:47:28,459 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-04-27 12:47:28,459 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-04-27 12:47:28,459 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-27 12:47:28,459 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:28,637 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-27 12:47:28,655 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-27 12:47:28,657 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-27 12:47:28,658 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-27 12:47:28,658 INFO L275 PluginConnector]: CDTParser initialized [2022-04-27 12:47:28,659 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/nla-digbench-scaling/divbin_valuebound100.i [2022-04-27 12:47:28,700 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fb41853ed/afb34b06d83c414a8295a6bd7a54958f/FLAG07fb927c1 [2022-04-27 12:47:29,081 INFO L306 CDTParser]: Found 1 translation units. [2022-04-27 12:47:29,081 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/divbin_valuebound100.i [2022-04-27 12:47:29,087 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fb41853ed/afb34b06d83c414a8295a6bd7a54958f/FLAG07fb927c1 [2022-04-27 12:47:29,099 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fb41853ed/afb34b06d83c414a8295a6bd7a54958f [2022-04-27 12:47:29,102 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-27 12:47:29,103 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-27 12:47:29,105 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-27 12:47:29,105 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-27 12:47:29,107 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-27 12:47:29,111 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 12:47:29" (1/1) ... [2022-04-27 12:47:29,112 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1fd63e1d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 12:47:29, skipping insertion in model container [2022-04-27 12:47:29,112 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 12:47:29" (1/1) ... [2022-04-27 12:47:29,117 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-27 12:47:29,130 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-27 12:47:29,285 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_valuebound100.i[950,963] [2022-04-27 12:47:29,313 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 12:47:29,322 INFO L203 MainTranslator]: Completed pre-run [2022-04-27 12:47:29,335 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_valuebound100.i[950,963] [2022-04-27 12:47:29,352 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 12:47:29,361 INFO L208 MainTranslator]: Completed translation [2022-04-27 12:47:29,362 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 12:47:29 WrapperNode [2022-04-27 12:47:29,362 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-27 12:47:29,363 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-27 12:47:29,363 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-27 12:47:29,363 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-27 12:47:29,371 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:29" (1/1) ... [2022-04-27 12:47:29,371 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:29" (1/1) ... [2022-04-27 12:47:29,376 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:29" (1/1) ... [2022-04-27 12:47:29,377 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:29" (1/1) ... [2022-04-27 12:47:29,388 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:29" (1/1) ... [2022-04-27 12:47:29,394 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:29" (1/1) ... [2022-04-27 12:47:29,400 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:29" (1/1) ... [2022-04-27 12:47:29,402 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-27 12:47:29,403 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-27 12:47:29,403 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-27 12:47:29,403 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-27 12:47:29,403 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 12:47:29" (1/1) ... [2022-04-27 12:47:29,408 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 12:47:29,416 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 12:47:29,426 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:29,440 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:29,464 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-27 12:47:29,467 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-27 12:47:29,467 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-27 12:47:29,468 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-27 12:47:29,468 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-27 12:47:29,468 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-27 12:47:29,468 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-27 12:47:29,468 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-27 12:47:29,468 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_perror_fail [2022-04-27 12:47:29,468 INFO L130 BoogieDeclarations]: Found specification of procedure __assert [2022-04-27 12:47:29,468 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-27 12:47:29,468 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-27 12:47:29,468 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uint [2022-04-27 12:47:29,468 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-27 12:47:29,468 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-27 12:47:29,468 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-27 12:47:29,468 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-27 12:47:29,469 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-27 12:47:29,469 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-27 12:47:29,469 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-27 12:47:29,469 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-27 12:47:29,469 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-27 12:47:29,517 INFO L234 CfgBuilder]: Building ICFG [2022-04-27 12:47:29,518 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-27 12:47:29,688 INFO L275 CfgBuilder]: Performing block encoding [2022-04-27 12:47:29,693 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-27 12:47:29,693 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-04-27 12:47:29,694 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 12:47:29 BoogieIcfgContainer [2022-04-27 12:47:29,694 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-27 12:47:29,695 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-27 12:47:29,695 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-27 12:47:29,713 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-27 12:47:29,714 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.04 12:47:29" (1/3) ... [2022-04-27 12:47:29,714 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@23536cb0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 12:47:29, skipping insertion in model container [2022-04-27 12:47:29,714 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 12:47:29" (2/3) ... [2022-04-27 12:47:29,715 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@23536cb0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 12:47:29, skipping insertion in model container [2022-04-27 12:47:29,715 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 12:47:29" (3/3) ... [2022-04-27 12:47:29,715 INFO L111 eAbstractionObserver]: Analyzing ICFG divbin_valuebound100.i [2022-04-27 12:47:29,725 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-04-27 12:47:29,725 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-27 12:47:29,768 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-27 12:47:29,776 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@18e6106b, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@6445c749 [2022-04-27 12:47:29,776 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-27 12:47:29,782 INFO L276 IsEmpty]: Start isEmpty. Operand has 34 states, 20 states have (on average 1.5) internal successors, (30), 21 states have internal predecessors, (30), 8 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-27 12:47:29,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-04-27 12:47:29,788 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 12:47:29,789 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 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:29,789 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 12:47:29,794 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 12:47:29,794 INFO L85 PathProgramCache]: Analyzing trace with hash 291922115, now seen corresponding path program 1 times [2022-04-27 12:47:29,801 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 12:47:29,801 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1668736228] [2022-04-27 12:47:29,802 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 12:47:29,802 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 12:47:29,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:47:29,968 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 12:47:29,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:47:29,981 INFO L290 TraceCheckUtils]: 0: Hoare triple {58#(and (= |#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); {37#true} is VALID [2022-04-27 12:47:29,981 INFO L290 TraceCheckUtils]: 1: Hoare triple {37#true} assume true; {37#true} is VALID [2022-04-27 12:47:29,981 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {37#true} {37#true} #94#return; {37#true} is VALID [2022-04-27 12:47:29,982 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-27 12:47:29,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:47:29,987 INFO L290 TraceCheckUtils]: 0: Hoare triple {37#true} ~cond := #in~cond; {37#true} is VALID [2022-04-27 12:47:29,988 INFO L290 TraceCheckUtils]: 1: Hoare triple {37#true} assume 0 == ~cond;assume false; {38#false} is VALID [2022-04-27 12:47:29,988 INFO L290 TraceCheckUtils]: 2: Hoare triple {38#false} assume true; {38#false} is VALID [2022-04-27 12:47:29,988 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {38#false} {37#true} #82#return; {38#false} is VALID [2022-04-27 12:47:29,989 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-04-27 12:47:29,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:47:29,994 INFO L290 TraceCheckUtils]: 0: Hoare triple {37#true} ~cond := #in~cond; {37#true} is VALID [2022-04-27 12:47:29,994 INFO L290 TraceCheckUtils]: 1: Hoare triple {37#true} assume 0 == ~cond;assume false; {38#false} is VALID [2022-04-27 12:47:29,994 INFO L290 TraceCheckUtils]: 2: Hoare triple {38#false} assume true; {38#false} is VALID [2022-04-27 12:47:29,995 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {38#false} {38#false} #84#return; {38#false} is VALID [2022-04-27 12:47:29,995 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-04-27 12:47:29,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:47:30,000 INFO L290 TraceCheckUtils]: 0: Hoare triple {37#true} ~cond := #in~cond; {37#true} is VALID [2022-04-27 12:47:30,001 INFO L290 TraceCheckUtils]: 1: Hoare triple {37#true} assume 0 == ~cond;assume false; {38#false} is VALID [2022-04-27 12:47:30,001 INFO L290 TraceCheckUtils]: 2: Hoare triple {38#false} assume true; {38#false} is VALID [2022-04-27 12:47:30,001 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {38#false} {38#false} #86#return; {38#false} is VALID [2022-04-27 12:47:30,001 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-04-27 12:47:30,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:47:30,006 INFO L290 TraceCheckUtils]: 0: Hoare triple {37#true} ~cond := #in~cond; {37#true} is VALID [2022-04-27 12:47:30,007 INFO L290 TraceCheckUtils]: 1: Hoare triple {37#true} assume 0 == ~cond;assume false; {38#false} is VALID [2022-04-27 12:47:30,007 INFO L290 TraceCheckUtils]: 2: Hoare triple {38#false} assume true; {38#false} is VALID [2022-04-27 12:47:30,007 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {38#false} {38#false} #88#return; {38#false} is VALID [2022-04-27 12:47:30,008 INFO L272 TraceCheckUtils]: 0: Hoare triple {37#true} call ULTIMATE.init(); {58#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 12:47:30,008 INFO L290 TraceCheckUtils]: 1: Hoare triple {58#(and (= |#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); {37#true} is VALID [2022-04-27 12:47:30,008 INFO L290 TraceCheckUtils]: 2: Hoare triple {37#true} assume true; {37#true} is VALID [2022-04-27 12:47:30,008 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {37#true} {37#true} #94#return; {37#true} is VALID [2022-04-27 12:47:30,009 INFO L272 TraceCheckUtils]: 4: Hoare triple {37#true} call #t~ret3 := main(); {37#true} is VALID [2022-04-27 12:47:30,009 INFO L290 TraceCheckUtils]: 5: Hoare triple {37#true} havoc ~A~0;havoc ~B~0;havoc ~q~0;havoc ~r~0;havoc ~b~0;~A~0 := #t~nondet1;havoc #t~nondet1; {37#true} is VALID [2022-04-27 12:47:30,009 INFO L272 TraceCheckUtils]: 6: Hoare triple {37#true} call assume_abort_if_not((if ~A~0 % 4294967296 >= 0 && ~A~0 % 4294967296 <= 100 then 1 else 0)); {37#true} is VALID [2022-04-27 12:47:30,009 INFO L290 TraceCheckUtils]: 7: Hoare triple {37#true} ~cond := #in~cond; {37#true} is VALID [2022-04-27 12:47:30,010 INFO L290 TraceCheckUtils]: 8: Hoare triple {37#true} assume 0 == ~cond;assume false; {38#false} is VALID [2022-04-27 12:47:30,010 INFO L290 TraceCheckUtils]: 9: Hoare triple {38#false} assume true; {38#false} is VALID [2022-04-27 12:47:30,010 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {38#false} {37#true} #82#return; {38#false} is VALID [2022-04-27 12:47:30,010 INFO L290 TraceCheckUtils]: 11: Hoare triple {38#false} ~B~0 := #t~nondet2;havoc #t~nondet2; {38#false} is VALID [2022-04-27 12:47:30,010 INFO L272 TraceCheckUtils]: 12: Hoare triple {38#false} call assume_abort_if_not((if ~B~0 % 4294967296 >= 0 && ~B~0 % 4294967296 <= 100 then 1 else 0)); {37#true} is VALID [2022-04-27 12:47:30,010 INFO L290 TraceCheckUtils]: 13: Hoare triple {37#true} ~cond := #in~cond; {37#true} is VALID [2022-04-27 12:47:30,011 INFO L290 TraceCheckUtils]: 14: Hoare triple {37#true} assume 0 == ~cond;assume false; {38#false} is VALID [2022-04-27 12:47:30,011 INFO L290 TraceCheckUtils]: 15: Hoare triple {38#false} assume true; {38#false} is VALID [2022-04-27 12:47:30,011 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {38#false} {38#false} #84#return; {38#false} is VALID [2022-04-27 12:47:30,011 INFO L272 TraceCheckUtils]: 17: Hoare triple {38#false} call assume_abort_if_not((if ~B~0 % 4294967296 < 2147483647 then 1 else 0)); {37#true} is VALID [2022-04-27 12:47:30,011 INFO L290 TraceCheckUtils]: 18: Hoare triple {37#true} ~cond := #in~cond; {37#true} is VALID [2022-04-27 12:47:30,012 INFO L290 TraceCheckUtils]: 19: Hoare triple {37#true} assume 0 == ~cond;assume false; {38#false} is VALID [2022-04-27 12:47:30,012 INFO L290 TraceCheckUtils]: 20: Hoare triple {38#false} assume true; {38#false} is VALID [2022-04-27 12:47:30,012 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {38#false} {38#false} #86#return; {38#false} is VALID [2022-04-27 12:47:30,012 INFO L272 TraceCheckUtils]: 22: Hoare triple {38#false} call assume_abort_if_not((if ~B~0 % 4294967296 >= 1 then 1 else 0)); {37#true} is VALID [2022-04-27 12:47:30,012 INFO L290 TraceCheckUtils]: 23: Hoare triple {37#true} ~cond := #in~cond; {37#true} is VALID [2022-04-27 12:47:30,012 INFO L290 TraceCheckUtils]: 24: Hoare triple {37#true} assume 0 == ~cond;assume false; {38#false} is VALID [2022-04-27 12:47:30,013 INFO L290 TraceCheckUtils]: 25: Hoare triple {38#false} assume true; {38#false} is VALID [2022-04-27 12:47:30,013 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {38#false} {38#false} #88#return; {38#false} is VALID [2022-04-27 12:47:30,013 INFO L290 TraceCheckUtils]: 27: Hoare triple {38#false} ~q~0 := 0;~r~0 := ~A~0;~b~0 := ~B~0; {38#false} is VALID [2022-04-27 12:47:30,013 INFO L290 TraceCheckUtils]: 28: Hoare triple {38#false} assume !true; {38#false} is VALID [2022-04-27 12:47:30,013 INFO L290 TraceCheckUtils]: 29: Hoare triple {38#false} assume !true; {38#false} is VALID [2022-04-27 12:47:30,013 INFO L272 TraceCheckUtils]: 30: Hoare triple {38#false} call __VERIFIER_assert((if ~A~0 % 4294967296 == (~q~0 * ~b~0 + ~r~0) % 4294967296 then 1 else 0)); {38#false} is VALID [2022-04-27 12:47:30,013 INFO L290 TraceCheckUtils]: 31: Hoare triple {38#false} ~cond := #in~cond; {38#false} is VALID [2022-04-27 12:47:30,014 INFO L290 TraceCheckUtils]: 32: Hoare triple {38#false} assume 0 == ~cond; {38#false} is VALID [2022-04-27 12:47:30,014 INFO L290 TraceCheckUtils]: 33: Hoare triple {38#false} assume !false; {38#false} is VALID [2022-04-27 12:47:30,014 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-04-27 12:47:30,014 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 12:47:30,015 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1668736228] [2022-04-27 12:47:30,015 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1668736228] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 12:47:30,015 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 12:47:30,015 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-27 12:47:30,016 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1333058611] [2022-04-27 12:47:30,017 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 12:47:30,025 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 2 states have internal predecessors, (13), 2 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 34 [2022-04-27 12:47:30,026 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 12:47:30,028 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 2 states have internal predecessors, (13), 2 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-27 12:47:30,052 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 12:47:30,053 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-27 12:47:30,053 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 12:47:30,067 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-27 12:47:30,067 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-27 12:47:30,069 INFO L87 Difference]: Start difference. First operand has 34 states, 20 states have (on average 1.5) internal successors, (30), 21 states have internal predecessors, (30), 8 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 2 states have internal predecessors, (13), 2 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-27 12:47:30,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:47:30,210 INFO L93 Difference]: Finished difference Result 61 states and 90 transitions. [2022-04-27 12:47:30,210 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-27 12:47:30,211 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 2 states have internal predecessors, (13), 2 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 34 [2022-04-27 12:47:30,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 12:47:30,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 2 states have internal predecessors, (13), 2 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-27 12:47:30,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 90 transitions. [2022-04-27 12:47:30,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 2 states have internal predecessors, (13), 2 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-27 12:47:30,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 90 transitions. [2022-04-27 12:47:30,221 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 90 transitions. [2022-04-27 12:47:30,305 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 90 edges. 90 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 12:47:30,311 INFO L225 Difference]: With dead ends: 61 [2022-04-27 12:47:30,311 INFO L226 Difference]: Without dead ends: 29 [2022-04-27 12:47:30,313 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 15 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:30,315 INFO L413 NwaCegarLoop]: 34 mSDtfsCounter, 21 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 37 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 12:47:30,316 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 37 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 12:47:30,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2022-04-27 12:47:30,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2022-04-27 12:47:30,335 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 12:47:30,335 INFO L82 GeneralOperation]: Start isEquivalent. First operand 29 states. Second operand has 29 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 18 states have internal predecessors, (21), 8 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-27 12:47:30,336 INFO L74 IsIncluded]: Start isIncluded. First operand 29 states. Second operand has 29 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 18 states have internal predecessors, (21), 8 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-27 12:47:30,336 INFO L87 Difference]: Start difference. First operand 29 states. Second operand has 29 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 18 states have internal predecessors, (21), 8 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-27 12:47:30,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:47:30,339 INFO L93 Difference]: Finished difference Result 29 states and 35 transitions. [2022-04-27 12:47:30,339 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 35 transitions. [2022-04-27 12:47:30,340 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 12:47:30,340 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 12:47:30,340 INFO L74 IsIncluded]: Start isIncluded. First operand has 29 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 18 states have internal predecessors, (21), 8 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand 29 states. [2022-04-27 12:47:30,340 INFO L87 Difference]: Start difference. First operand has 29 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 18 states have internal predecessors, (21), 8 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand 29 states. [2022-04-27 12:47:30,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:47:30,343 INFO L93 Difference]: Finished difference Result 29 states and 35 transitions. [2022-04-27 12:47:30,343 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 35 transitions. [2022-04-27 12:47:30,343 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 12:47:30,343 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 12:47:30,343 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 12:47:30,344 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 12:47:30,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 18 states have internal predecessors, (21), 8 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-27 12:47:30,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 35 transitions. [2022-04-27 12:47:30,346 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 35 transitions. Word has length 34 [2022-04-27 12:47:30,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 12:47:30,347 INFO L495 AbstractCegarLoop]: Abstraction has 29 states and 35 transitions. [2022-04-27 12:47:30,347 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 2 states have internal predecessors, (13), 2 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-27 12:47:30,347 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 35 transitions. [2022-04-27 12:47:30,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-04-27 12:47:30,348 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 12:47:30,348 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 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:30,348 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-27 12:47:30,348 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 12:47:30,349 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 12:47:30,349 INFO L85 PathProgramCache]: Analyzing trace with hash -245963777, now seen corresponding path program 1 times [2022-04-27 12:47:30,349 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 12:47:30,349 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [118731047] [2022-04-27 12:47:30,349 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 12:47:30,350 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 12:47:30,369 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 12:47:30,369 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [283014267] [2022-04-27 12:47:30,370 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 12:47:30,370 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 12:47:30,370 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 12:47:30,371 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:30,372 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:30,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:47:30,419 INFO L263 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 15 conjunts are in the unsatisfiable core [2022-04-27 12:47:30,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:47:30,433 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 12:47:31,382 INFO L272 TraceCheckUtils]: 0: Hoare triple {243#true} call ULTIMATE.init(); {243#true} is VALID [2022-04-27 12:47:31,383 INFO L290 TraceCheckUtils]: 1: Hoare triple {243#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); {243#true} is VALID [2022-04-27 12:47:31,383 INFO L290 TraceCheckUtils]: 2: Hoare triple {243#true} assume true; {243#true} is VALID [2022-04-27 12:47:31,383 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {243#true} {243#true} #94#return; {243#true} is VALID [2022-04-27 12:47:31,383 INFO L272 TraceCheckUtils]: 4: Hoare triple {243#true} call #t~ret3 := main(); {243#true} is VALID [2022-04-27 12:47:31,383 INFO L290 TraceCheckUtils]: 5: Hoare triple {243#true} havoc ~A~0;havoc ~B~0;havoc ~q~0;havoc ~r~0;havoc ~b~0;~A~0 := #t~nondet1;havoc #t~nondet1; {243#true} is VALID [2022-04-27 12:47:31,384 INFO L272 TraceCheckUtils]: 6: Hoare triple {243#true} call assume_abort_if_not((if ~A~0 % 4294967296 >= 0 && ~A~0 % 4294967296 <= 100 then 1 else 0)); {243#true} is VALID [2022-04-27 12:47:31,384 INFO L290 TraceCheckUtils]: 7: Hoare triple {243#true} ~cond := #in~cond; {243#true} is VALID [2022-04-27 12:47:31,384 INFO L290 TraceCheckUtils]: 8: Hoare triple {243#true} assume !(0 == ~cond); {243#true} is VALID [2022-04-27 12:47:31,384 INFO L290 TraceCheckUtils]: 9: Hoare triple {243#true} assume true; {243#true} is VALID [2022-04-27 12:47:31,384 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {243#true} {243#true} #82#return; {243#true} is VALID [2022-04-27 12:47:31,384 INFO L290 TraceCheckUtils]: 11: Hoare triple {243#true} ~B~0 := #t~nondet2;havoc #t~nondet2; {243#true} is VALID [2022-04-27 12:47:31,385 INFO L272 TraceCheckUtils]: 12: Hoare triple {243#true} call assume_abort_if_not((if ~B~0 % 4294967296 >= 0 && ~B~0 % 4294967296 <= 100 then 1 else 0)); {243#true} is VALID [2022-04-27 12:47:31,385 INFO L290 TraceCheckUtils]: 13: Hoare triple {243#true} ~cond := #in~cond; {287#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-27 12:47:31,385 INFO L290 TraceCheckUtils]: 14: Hoare triple {287#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {291#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-27 12:47:31,386 INFO L290 TraceCheckUtils]: 15: Hoare triple {291#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {291#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-27 12:47:31,387 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {291#(not (= |assume_abort_if_not_#in~cond| 0))} {243#true} #84#return; {298#(<= (mod main_~B~0 4294967296) 100)} is VALID [2022-04-27 12:47:31,387 INFO L272 TraceCheckUtils]: 17: Hoare triple {298#(<= (mod main_~B~0 4294967296) 100)} call assume_abort_if_not((if ~B~0 % 4294967296 < 2147483647 then 1 else 0)); {243#true} is VALID [2022-04-27 12:47:31,387 INFO L290 TraceCheckUtils]: 18: Hoare triple {243#true} ~cond := #in~cond; {243#true} is VALID [2022-04-27 12:47:31,387 INFO L290 TraceCheckUtils]: 19: Hoare triple {243#true} assume !(0 == ~cond); {243#true} is VALID [2022-04-27 12:47:31,388 INFO L290 TraceCheckUtils]: 20: Hoare triple {243#true} assume true; {243#true} is VALID [2022-04-27 12:47:31,391 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {243#true} {298#(<= (mod main_~B~0 4294967296) 100)} #86#return; {298#(<= (mod main_~B~0 4294967296) 100)} is VALID [2022-04-27 12:47:31,391 INFO L272 TraceCheckUtils]: 22: Hoare triple {298#(<= (mod main_~B~0 4294967296) 100)} call assume_abort_if_not((if ~B~0 % 4294967296 >= 1 then 1 else 0)); {243#true} is VALID [2022-04-27 12:47:31,391 INFO L290 TraceCheckUtils]: 23: Hoare triple {243#true} ~cond := #in~cond; {243#true} is VALID [2022-04-27 12:47:31,391 INFO L290 TraceCheckUtils]: 24: Hoare triple {243#true} assume !(0 == ~cond); {243#true} is VALID [2022-04-27 12:47:31,391 INFO L290 TraceCheckUtils]: 25: Hoare triple {243#true} assume true; {243#true} is VALID [2022-04-27 12:47:31,392 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {243#true} {298#(<= (mod main_~B~0 4294967296) 100)} #88#return; {298#(<= (mod main_~B~0 4294967296) 100)} is VALID [2022-04-27 12:47:31,393 INFO L290 TraceCheckUtils]: 27: Hoare triple {298#(<= (mod main_~B~0 4294967296) 100)} ~q~0 := 0;~r~0 := ~A~0;~b~0 := ~B~0; {332#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (<= (mod main_~b~0 4294967296) 100))} is VALID [2022-04-27 12:47:31,393 INFO L290 TraceCheckUtils]: 28: Hoare triple {332#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (<= (mod main_~b~0 4294967296) 100))} assume !false; {332#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (<= (mod main_~b~0 4294967296) 100))} is VALID [2022-04-27 12:47:31,394 INFO L290 TraceCheckUtils]: 29: Hoare triple {332#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (<= (mod main_~b~0 4294967296) 100))} assume !(~r~0 % 4294967296 >= ~b~0 % 4294967296); {339#(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) 100))} is VALID [2022-04-27 12:47:31,394 INFO L290 TraceCheckUtils]: 30: Hoare triple {339#(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) 100))} assume !false; {339#(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) 100))} is VALID [2022-04-27 12:47:31,395 INFO L272 TraceCheckUtils]: 31: Hoare triple {339#(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) 100))} call __VERIFIER_assert((if ~A~0 % 4294967296 == (~q~0 * ~b~0 + ~r~0) % 4294967296 then 1 else 0)); {346#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 12:47:31,395 INFO L290 TraceCheckUtils]: 32: Hoare triple {346#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {350#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 12:47:31,396 INFO L290 TraceCheckUtils]: 33: Hoare triple {350#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {244#false} is VALID [2022-04-27 12:47:31,396 INFO L290 TraceCheckUtils]: 34: Hoare triple {244#false} assume !false; {244#false} is VALID [2022-04-27 12:47:31,396 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-04-27 12:47:31,396 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 12:47:31,759 INFO L290 TraceCheckUtils]: 34: Hoare triple {244#false} assume !false; {244#false} is VALID [2022-04-27 12:47:31,760 INFO L290 TraceCheckUtils]: 33: Hoare triple {350#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {244#false} is VALID [2022-04-27 12:47:31,760 INFO L290 TraceCheckUtils]: 32: Hoare triple {346#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {350#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 12:47:31,761 INFO L272 TraceCheckUtils]: 31: Hoare triple {366#(= (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)); {346#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 12:47:31,761 INFO L290 TraceCheckUtils]: 30: Hoare triple {366#(= (mod main_~A~0 4294967296) (mod (+ main_~r~0 (* main_~b~0 main_~q~0)) 4294967296))} assume !false; {366#(= (mod main_~A~0 4294967296) (mod (+ main_~r~0 (* main_~b~0 main_~q~0)) 4294967296))} is VALID [2022-04-27 12:47:31,762 INFO L290 TraceCheckUtils]: 29: Hoare triple {373#(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); {366#(= (mod main_~A~0 4294967296) (mod (+ main_~r~0 (* main_~b~0 main_~q~0)) 4294967296))} is VALID [2022-04-27 12:47:31,762 INFO L290 TraceCheckUtils]: 28: Hoare triple {373#(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 !false; {373#(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:31,763 INFO L290 TraceCheckUtils]: 27: Hoare triple {243#true} ~q~0 := 0;~r~0 := ~A~0;~b~0 := ~B~0; {373#(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:31,763 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {243#true} {243#true} #88#return; {243#true} is VALID [2022-04-27 12:47:31,763 INFO L290 TraceCheckUtils]: 25: Hoare triple {243#true} assume true; {243#true} is VALID [2022-04-27 12:47:31,763 INFO L290 TraceCheckUtils]: 24: Hoare triple {243#true} assume !(0 == ~cond); {243#true} is VALID [2022-04-27 12:47:31,763 INFO L290 TraceCheckUtils]: 23: Hoare triple {243#true} ~cond := #in~cond; {243#true} is VALID [2022-04-27 12:47:31,764 INFO L272 TraceCheckUtils]: 22: Hoare triple {243#true} call assume_abort_if_not((if ~B~0 % 4294967296 >= 1 then 1 else 0)); {243#true} is VALID [2022-04-27 12:47:31,764 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {243#true} {243#true} #86#return; {243#true} is VALID [2022-04-27 12:47:31,764 INFO L290 TraceCheckUtils]: 20: Hoare triple {243#true} assume true; {243#true} is VALID [2022-04-27 12:47:31,764 INFO L290 TraceCheckUtils]: 19: Hoare triple {243#true} assume !(0 == ~cond); {243#true} is VALID [2022-04-27 12:47:31,764 INFO L290 TraceCheckUtils]: 18: Hoare triple {243#true} ~cond := #in~cond; {243#true} is VALID [2022-04-27 12:47:31,764 INFO L272 TraceCheckUtils]: 17: Hoare triple {243#true} call assume_abort_if_not((if ~B~0 % 4294967296 < 2147483647 then 1 else 0)); {243#true} is VALID [2022-04-27 12:47:31,764 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {243#true} {243#true} #84#return; {243#true} is VALID [2022-04-27 12:47:31,765 INFO L290 TraceCheckUtils]: 15: Hoare triple {243#true} assume true; {243#true} is VALID [2022-04-27 12:47:31,765 INFO L290 TraceCheckUtils]: 14: Hoare triple {243#true} assume !(0 == ~cond); {243#true} is VALID [2022-04-27 12:47:31,765 INFO L290 TraceCheckUtils]: 13: Hoare triple {243#true} ~cond := #in~cond; {243#true} is VALID [2022-04-27 12:47:31,765 INFO L272 TraceCheckUtils]: 12: Hoare triple {243#true} call assume_abort_if_not((if ~B~0 % 4294967296 >= 0 && ~B~0 % 4294967296 <= 100 then 1 else 0)); {243#true} is VALID [2022-04-27 12:47:31,765 INFO L290 TraceCheckUtils]: 11: Hoare triple {243#true} ~B~0 := #t~nondet2;havoc #t~nondet2; {243#true} is VALID [2022-04-27 12:47:31,765 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {243#true} {243#true} #82#return; {243#true} is VALID [2022-04-27 12:47:31,765 INFO L290 TraceCheckUtils]: 9: Hoare triple {243#true} assume true; {243#true} is VALID [2022-04-27 12:47:31,766 INFO L290 TraceCheckUtils]: 8: Hoare triple {243#true} assume !(0 == ~cond); {243#true} is VALID [2022-04-27 12:47:31,766 INFO L290 TraceCheckUtils]: 7: Hoare triple {243#true} ~cond := #in~cond; {243#true} is VALID [2022-04-27 12:47:31,766 INFO L272 TraceCheckUtils]: 6: Hoare triple {243#true} call assume_abort_if_not((if ~A~0 % 4294967296 >= 0 && ~A~0 % 4294967296 <= 100 then 1 else 0)); {243#true} is VALID [2022-04-27 12:47:31,766 INFO L290 TraceCheckUtils]: 5: Hoare triple {243#true} havoc ~A~0;havoc ~B~0;havoc ~q~0;havoc ~r~0;havoc ~b~0;~A~0 := #t~nondet1;havoc #t~nondet1; {243#true} is VALID [2022-04-27 12:47:31,766 INFO L272 TraceCheckUtils]: 4: Hoare triple {243#true} call #t~ret3 := main(); {243#true} is VALID [2022-04-27 12:47:31,766 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {243#true} {243#true} #94#return; {243#true} is VALID [2022-04-27 12:47:31,766 INFO L290 TraceCheckUtils]: 2: Hoare triple {243#true} assume true; {243#true} is VALID [2022-04-27 12:47:31,767 INFO L290 TraceCheckUtils]: 1: Hoare triple {243#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); {243#true} is VALID [2022-04-27 12:47:31,767 INFO L272 TraceCheckUtils]: 0: Hoare triple {243#true} call ULTIMATE.init(); {243#true} is VALID [2022-04-27 12:47:31,767 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-04-27 12:47:31,767 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 12:47:31,767 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [118731047] [2022-04-27 12:47:31,768 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 12:47:31,768 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [283014267] [2022-04-27 12:47:31,768 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [283014267] provided 1 perfect and 1 imperfect interpolant sequences [2022-04-27 12:47:31,768 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-04-27 12:47:31,768 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [9] total 11 [2022-04-27 12:47:31,769 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1102005488] [2022-04-27 12:47:31,769 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 12:47:31,769 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 35 [2022-04-27 12:47:31,770 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 12:47:31,770 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2022-04-27 12:47:31,788 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 12:47:31,789 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-27 12:47:31,789 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 12:47:31,789 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-27 12:47:31,789 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2022-04-27 12:47:31,790 INFO L87 Difference]: Start difference. First operand 29 states and 35 transitions. Second operand has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2022-04-27 12:47:33,318 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.44s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-27 12:47:35,408 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:35,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:47:35,830 INFO L93 Difference]: Finished difference Result 41 states and 49 transitions. [2022-04-27 12:47:35,830 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-27 12:47:35,830 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 35 [2022-04-27 12:47:35,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 12:47:35,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2022-04-27 12:47:35,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 49 transitions. [2022-04-27 12:47:35,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2022-04-27 12:47:35,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 49 transitions. [2022-04-27 12:47:35,834 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 49 transitions. [2022-04-27 12:47:35,889 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:35,891 INFO L225 Difference]: With dead ends: 41 [2022-04-27 12:47:35,891 INFO L226 Difference]: Without dead ends: 38 [2022-04-27 12:47:35,891 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 59 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:35,892 INFO L413 NwaCegarLoop]: 29 mSDtfsCounter, 10 mSDsluCounter, 76 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 3 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 105 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.6s IncrementalHoareTripleChecker+Time [2022-04-27 12:47:35,892 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 105 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 36 Invalid, 1 Unknown, 0 Unchecked, 3.6s Time] [2022-04-27 12:47:35,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2022-04-27 12:47:35,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2022-04-27 12:47:35,897 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 12:47:35,898 INFO L82 GeneralOperation]: Start isEquivalent. First operand 38 states. Second operand has 38 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 25 states have internal predecessors, (29), 9 states have call successors, (9), 5 states have call predecessors, (9), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-27 12:47:35,898 INFO L74 IsIncluded]: Start isIncluded. First operand 38 states. Second operand has 38 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 25 states have internal predecessors, (29), 9 states have call successors, (9), 5 states have call predecessors, (9), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-27 12:47:35,898 INFO L87 Difference]: Start difference. First operand 38 states. Second operand has 38 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 25 states have internal predecessors, (29), 9 states have call successors, (9), 5 states have call predecessors, (9), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-27 12:47:35,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:47:35,900 INFO L93 Difference]: Finished difference Result 38 states and 45 transitions. [2022-04-27 12:47:35,901 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 45 transitions. [2022-04-27 12:47:35,901 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 12:47:35,901 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 12:47:35,901 INFO L74 IsIncluded]: Start isIncluded. First operand has 38 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 25 states have internal predecessors, (29), 9 states have call successors, (9), 5 states have call predecessors, (9), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand 38 states. [2022-04-27 12:47:35,902 INFO L87 Difference]: Start difference. First operand has 38 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 25 states have internal predecessors, (29), 9 states have call successors, (9), 5 states have call predecessors, (9), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand 38 states. [2022-04-27 12:47:35,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:47:35,904 INFO L93 Difference]: Finished difference Result 38 states and 45 transitions. [2022-04-27 12:47:35,904 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 45 transitions. [2022-04-27 12:47:35,907 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 12:47:35,907 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 12:47:35,908 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 12:47:35,908 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 12:47:35,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 25 states have internal predecessors, (29), 9 states have call successors, (9), 5 states have call predecessors, (9), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-27 12:47:35,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 45 transitions. [2022-04-27 12:47:35,910 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 45 transitions. Word has length 35 [2022-04-27 12:47:35,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 12:47:35,910 INFO L495 AbstractCegarLoop]: Abstraction has 38 states and 45 transitions. [2022-04-27 12:47:35,910 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2022-04-27 12:47:35,910 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 45 transitions. [2022-04-27 12:47:35,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-04-27 12:47:35,911 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 12:47:35,911 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 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:35,935 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:36,132 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:36,133 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 12:47:36,133 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 12:47:36,133 INFO L85 PathProgramCache]: Analyzing trace with hash 397552474, now seen corresponding path program 1 times [2022-04-27 12:47:36,133 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 12:47:36,134 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [368965058] [2022-04-27 12:47:36,134 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 12:47:36,134 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 12:47:36,151 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 12:47:36,152 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1915999045] [2022-04-27 12:47:36,152 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 12:47:36,152 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 12:47:36,152 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 12:47:36,153 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:36,165 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:36,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:47:36,196 INFO L263 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 20 conjunts are in the unsatisfiable core [2022-04-27 12:47:36,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:47:36,222 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 12:47:37,333 INFO L272 TraceCheckUtils]: 0: Hoare triple {653#true} call ULTIMATE.init(); {653#true} is VALID [2022-04-27 12:47:37,333 INFO L290 TraceCheckUtils]: 1: Hoare triple {653#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); {653#true} is VALID [2022-04-27 12:47:37,333 INFO L290 TraceCheckUtils]: 2: Hoare triple {653#true} assume true; {653#true} is VALID [2022-04-27 12:47:37,334 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {653#true} {653#true} #94#return; {653#true} is VALID [2022-04-27 12:47:37,334 INFO L272 TraceCheckUtils]: 4: Hoare triple {653#true} call #t~ret3 := main(); {653#true} is VALID [2022-04-27 12:47:37,334 INFO L290 TraceCheckUtils]: 5: Hoare triple {653#true} havoc ~A~0;havoc ~B~0;havoc ~q~0;havoc ~r~0;havoc ~b~0;~A~0 := #t~nondet1;havoc #t~nondet1; {653#true} is VALID [2022-04-27 12:47:37,334 INFO L272 TraceCheckUtils]: 6: Hoare triple {653#true} call assume_abort_if_not((if ~A~0 % 4294967296 >= 0 && ~A~0 % 4294967296 <= 100 then 1 else 0)); {653#true} is VALID [2022-04-27 12:47:37,348 INFO L290 TraceCheckUtils]: 7: Hoare triple {653#true} ~cond := #in~cond; {679#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-27 12:47:37,348 INFO L290 TraceCheckUtils]: 8: Hoare triple {679#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {683#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-27 12:47:37,349 INFO L290 TraceCheckUtils]: 9: Hoare triple {683#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {683#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-27 12:47:37,349 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {683#(not (= |assume_abort_if_not_#in~cond| 0))} {653#true} #82#return; {690#(<= (mod main_~A~0 4294967296) 100)} is VALID [2022-04-27 12:47:37,349 INFO L290 TraceCheckUtils]: 11: Hoare triple {690#(<= (mod main_~A~0 4294967296) 100)} ~B~0 := #t~nondet2;havoc #t~nondet2; {690#(<= (mod main_~A~0 4294967296) 100)} is VALID [2022-04-27 12:47:37,350 INFO L272 TraceCheckUtils]: 12: Hoare triple {690#(<= (mod main_~A~0 4294967296) 100)} call assume_abort_if_not((if ~B~0 % 4294967296 >= 0 && ~B~0 % 4294967296 <= 100 then 1 else 0)); {653#true} is VALID [2022-04-27 12:47:37,350 INFO L290 TraceCheckUtils]: 13: Hoare triple {653#true} ~cond := #in~cond; {653#true} is VALID [2022-04-27 12:47:37,350 INFO L290 TraceCheckUtils]: 14: Hoare triple {653#true} assume !(0 == ~cond); {653#true} is VALID [2022-04-27 12:47:37,350 INFO L290 TraceCheckUtils]: 15: Hoare triple {653#true} assume true; {653#true} is VALID [2022-04-27 12:47:37,350 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {653#true} {690#(<= (mod main_~A~0 4294967296) 100)} #84#return; {690#(<= (mod main_~A~0 4294967296) 100)} is VALID [2022-04-27 12:47:37,350 INFO L272 TraceCheckUtils]: 17: Hoare triple {690#(<= (mod main_~A~0 4294967296) 100)} call assume_abort_if_not((if ~B~0 % 4294967296 < 2147483647 then 1 else 0)); {653#true} is VALID [2022-04-27 12:47:37,351 INFO L290 TraceCheckUtils]: 18: Hoare triple {653#true} ~cond := #in~cond; {653#true} is VALID [2022-04-27 12:47:37,351 INFO L290 TraceCheckUtils]: 19: Hoare triple {653#true} assume !(0 == ~cond); {653#true} is VALID [2022-04-27 12:47:37,351 INFO L290 TraceCheckUtils]: 20: Hoare triple {653#true} assume true; {653#true} is VALID [2022-04-27 12:47:37,351 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {653#true} {690#(<= (mod main_~A~0 4294967296) 100)} #86#return; {690#(<= (mod main_~A~0 4294967296) 100)} is VALID [2022-04-27 12:47:37,351 INFO L272 TraceCheckUtils]: 22: Hoare triple {690#(<= (mod main_~A~0 4294967296) 100)} call assume_abort_if_not((if ~B~0 % 4294967296 >= 1 then 1 else 0)); {653#true} is VALID [2022-04-27 12:47:37,352 INFO L290 TraceCheckUtils]: 23: Hoare triple {653#true} ~cond := #in~cond; {679#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-27 12:47:37,352 INFO L290 TraceCheckUtils]: 24: Hoare triple {679#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {683#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-27 12:47:37,352 INFO L290 TraceCheckUtils]: 25: Hoare triple {683#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {683#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-27 12:47:37,353 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {683#(not (= |assume_abort_if_not_#in~cond| 0))} {690#(<= (mod main_~A~0 4294967296) 100)} #88#return; {739#(and (<= (mod main_~A~0 4294967296) 100) (<= 1 (mod main_~B~0 4294967296)))} is VALID [2022-04-27 12:47:37,353 INFO L290 TraceCheckUtils]: 27: Hoare triple {739#(and (<= (mod main_~A~0 4294967296) 100) (<= 1 (mod main_~B~0 4294967296)))} ~q~0 := 0;~r~0 := ~A~0;~b~0 := ~B~0; {743#(and (<= (mod main_~A~0 4294967296) 100) (= main_~A~0 main_~r~0) (<= 1 (mod main_~b~0 4294967296)) (= main_~q~0 0))} is VALID [2022-04-27 12:47:37,354 INFO L290 TraceCheckUtils]: 28: Hoare triple {743#(and (<= (mod main_~A~0 4294967296) 100) (= main_~A~0 main_~r~0) (<= 1 (mod main_~b~0 4294967296)) (= main_~q~0 0))} assume !false; {743#(and (<= (mod main_~A~0 4294967296) 100) (= main_~A~0 main_~r~0) (<= 1 (mod main_~b~0 4294967296)) (= main_~q~0 0))} is VALID [2022-04-27 12:47:37,355 INFO L290 TraceCheckUtils]: 29: Hoare triple {743#(and (<= (mod main_~A~0 4294967296) 100) (= 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; {750#(and (<= (mod main_~A~0 4294967296) 100) (< 0 (+ (div (+ (- 1) (mod main_~r~0 4294967296)) 4294967296) 1)) (= main_~A~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-27 12:47:37,356 INFO L290 TraceCheckUtils]: 30: Hoare triple {750#(and (<= (mod main_~A~0 4294967296) 100) (< 0 (+ (div (+ (- 1) (mod main_~r~0 4294967296)) 4294967296) 1)) (= main_~A~0 main_~r~0) (= main_~q~0 0))} assume !false; {750#(and (<= (mod main_~A~0 4294967296) 100) (< 0 (+ (div (+ (- 1) (mod main_~r~0 4294967296)) 4294967296) 1)) (= main_~A~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-27 12:47:37,356 INFO L290 TraceCheckUtils]: 31: Hoare triple {750#(and (<= (mod main_~A~0 4294967296) 100) (< 0 (+ (div (+ (- 1) (mod main_~r~0 4294967296)) 4294967296) 1)) (= main_~A~0 main_~r~0) (= main_~q~0 0))} assume !(~r~0 % 4294967296 >= ~b~0 % 4294967296); {750#(and (<= (mod main_~A~0 4294967296) 100) (< 0 (+ (div (+ (- 1) (mod main_~r~0 4294967296)) 4294967296) 1)) (= main_~A~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-27 12:47:37,357 INFO L290 TraceCheckUtils]: 32: Hoare triple {750#(and (<= (mod main_~A~0 4294967296) 100) (< 0 (+ (div (+ (- 1) (mod main_~r~0 4294967296)) 4294967296) 1)) (= main_~A~0 main_~r~0) (= main_~q~0 0))} assume !false; {750#(and (<= (mod main_~A~0 4294967296) 100) (< 0 (+ (div (+ (- 1) (mod main_~r~0 4294967296)) 4294967296) 1)) (= main_~A~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-27 12:47:37,357 INFO L272 TraceCheckUtils]: 33: Hoare triple {750#(and (<= (mod main_~A~0 4294967296) 100) (< 0 (+ (div (+ (- 1) (mod main_~r~0 4294967296)) 4294967296) 1)) (= main_~A~0 main_~r~0) (= main_~q~0 0))} call __VERIFIER_assert((if ~A~0 % 4294967296 == (~q~0 * ~b~0 + ~r~0) % 4294967296 then 1 else 0)); {763#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 12:47:37,358 INFO L290 TraceCheckUtils]: 34: Hoare triple {763#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {767#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 12:47:37,358 INFO L290 TraceCheckUtils]: 35: Hoare triple {767#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {654#false} is VALID [2022-04-27 12:47:37,358 INFO L290 TraceCheckUtils]: 36: Hoare triple {654#false} assume !false; {654#false} is VALID [2022-04-27 12:47:37,359 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 6 proven. 8 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-04-27 12:47:37,359 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 12:47:38,051 INFO L290 TraceCheckUtils]: 36: Hoare triple {654#false} assume !false; {654#false} is VALID [2022-04-27 12:47:38,051 INFO L290 TraceCheckUtils]: 35: Hoare triple {767#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {654#false} is VALID [2022-04-27 12:47:38,052 INFO L290 TraceCheckUtils]: 34: Hoare triple {763#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {767#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 12:47:38,053 INFO L272 TraceCheckUtils]: 33: Hoare triple {783#(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)); {763#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 12:47:38,054 INFO L290 TraceCheckUtils]: 32: Hoare triple {783#(forall ((main_~b~0 Int)) (= (mod main_~A~0 4294967296) (mod (+ main_~r~0 (* main_~b~0 main_~q~0)) 4294967296)))} assume !false; {783#(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:38,054 INFO L290 TraceCheckUtils]: 31: Hoare triple {783#(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); {783#(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:38,055 INFO L290 TraceCheckUtils]: 30: Hoare triple {783#(forall ((main_~b~0 Int)) (= (mod main_~A~0 4294967296) (mod (+ main_~r~0 (* main_~b~0 main_~q~0)) 4294967296)))} assume !false; {783#(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:38,055 INFO L290 TraceCheckUtils]: 29: Hoare triple {796#(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; {783#(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:38,056 INFO L290 TraceCheckUtils]: 28: Hoare triple {796#(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 !false; {796#(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:38,057 INFO L290 TraceCheckUtils]: 27: Hoare triple {653#true} ~q~0 := 0;~r~0 := ~A~0;~b~0 := ~B~0; {796#(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:38,057 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {653#true} {653#true} #88#return; {653#true} is VALID [2022-04-27 12:47:38,057 INFO L290 TraceCheckUtils]: 25: Hoare triple {653#true} assume true; {653#true} is VALID [2022-04-27 12:47:38,057 INFO L290 TraceCheckUtils]: 24: Hoare triple {653#true} assume !(0 == ~cond); {653#true} is VALID [2022-04-27 12:47:38,057 INFO L290 TraceCheckUtils]: 23: Hoare triple {653#true} ~cond := #in~cond; {653#true} is VALID [2022-04-27 12:47:38,058 INFO L272 TraceCheckUtils]: 22: Hoare triple {653#true} call assume_abort_if_not((if ~B~0 % 4294967296 >= 1 then 1 else 0)); {653#true} is VALID [2022-04-27 12:47:38,058 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {653#true} {653#true} #86#return; {653#true} is VALID [2022-04-27 12:47:38,058 INFO L290 TraceCheckUtils]: 20: Hoare triple {653#true} assume true; {653#true} is VALID [2022-04-27 12:47:38,058 INFO L290 TraceCheckUtils]: 19: Hoare triple {653#true} assume !(0 == ~cond); {653#true} is VALID [2022-04-27 12:47:38,059 INFO L290 TraceCheckUtils]: 18: Hoare triple {653#true} ~cond := #in~cond; {653#true} is VALID [2022-04-27 12:47:38,060 INFO L272 TraceCheckUtils]: 17: Hoare triple {653#true} call assume_abort_if_not((if ~B~0 % 4294967296 < 2147483647 then 1 else 0)); {653#true} is VALID [2022-04-27 12:47:38,060 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {653#true} {653#true} #84#return; {653#true} is VALID [2022-04-27 12:47:38,061 INFO L290 TraceCheckUtils]: 15: Hoare triple {653#true} assume true; {653#true} is VALID [2022-04-27 12:47:38,061 INFO L290 TraceCheckUtils]: 14: Hoare triple {653#true} assume !(0 == ~cond); {653#true} is VALID [2022-04-27 12:47:38,061 INFO L290 TraceCheckUtils]: 13: Hoare triple {653#true} ~cond := #in~cond; {653#true} is VALID [2022-04-27 12:47:38,061 INFO L272 TraceCheckUtils]: 12: Hoare triple {653#true} call assume_abort_if_not((if ~B~0 % 4294967296 >= 0 && ~B~0 % 4294967296 <= 100 then 1 else 0)); {653#true} is VALID [2022-04-27 12:47:38,063 INFO L290 TraceCheckUtils]: 11: Hoare triple {653#true} ~B~0 := #t~nondet2;havoc #t~nondet2; {653#true} is VALID [2022-04-27 12:47:38,063 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {653#true} {653#true} #82#return; {653#true} is VALID [2022-04-27 12:47:38,063 INFO L290 TraceCheckUtils]: 9: Hoare triple {653#true} assume true; {653#true} is VALID [2022-04-27 12:47:38,063 INFO L290 TraceCheckUtils]: 8: Hoare triple {653#true} assume !(0 == ~cond); {653#true} is VALID [2022-04-27 12:47:38,063 INFO L290 TraceCheckUtils]: 7: Hoare triple {653#true} ~cond := #in~cond; {653#true} is VALID [2022-04-27 12:47:38,063 INFO L272 TraceCheckUtils]: 6: Hoare triple {653#true} call assume_abort_if_not((if ~A~0 % 4294967296 >= 0 && ~A~0 % 4294967296 <= 100 then 1 else 0)); {653#true} is VALID [2022-04-27 12:47:38,063 INFO L290 TraceCheckUtils]: 5: Hoare triple {653#true} havoc ~A~0;havoc ~B~0;havoc ~q~0;havoc ~r~0;havoc ~b~0;~A~0 := #t~nondet1;havoc #t~nondet1; {653#true} is VALID [2022-04-27 12:47:38,063 INFO L272 TraceCheckUtils]: 4: Hoare triple {653#true} call #t~ret3 := main(); {653#true} is VALID [2022-04-27 12:47:38,063 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {653#true} {653#true} #94#return; {653#true} is VALID [2022-04-27 12:47:38,064 INFO L290 TraceCheckUtils]: 2: Hoare triple {653#true} assume true; {653#true} is VALID [2022-04-27 12:47:38,064 INFO L290 TraceCheckUtils]: 1: Hoare triple {653#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); {653#true} is VALID [2022-04-27 12:47:38,064 INFO L272 TraceCheckUtils]: 0: Hoare triple {653#true} call ULTIMATE.init(); {653#true} is VALID [2022-04-27 12:47:38,065 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-04-27 12:47:38,065 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 12:47:38,065 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [368965058] [2022-04-27 12:47:38,065 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 12:47:38,065 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1915999045] [2022-04-27 12:47:38,065 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1915999045] provided 1 perfect and 1 imperfect interpolant sequences [2022-04-27 12:47:38,065 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-04-27 12:47:38,065 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [10] total 12 [2022-04-27 12:47:38,066 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1824935002] [2022-04-27 12:47:38,066 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 12:47:38,067 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 37 [2022-04-27 12:47:38,067 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 12:47:38,067 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2022-04-27 12:47:40,116 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 28 edges. 27 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-27 12:47:40,116 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-27 12:47:40,116 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 12:47:40,117 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-27 12:47:40,117 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2022-04-27 12:47:40,117 INFO L87 Difference]: Start difference. First operand 38 states and 45 transitions. Second operand has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2022-04-27 12:47:40,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:47:40,748 INFO L93 Difference]: Finished difference Result 46 states and 53 transitions. [2022-04-27 12:47:40,748 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-27 12:47:40,748 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 37 [2022-04-27 12:47:40,748 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 12:47:40,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2022-04-27 12:47:40,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 46 transitions. [2022-04-27 12:47:40,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2022-04-27 12:47:40,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 46 transitions. [2022-04-27 12:47:40,751 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 46 transitions. [2022-04-27 12:47:42,818 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 46 edges. 45 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-27 12:47:42,819 INFO L225 Difference]: With dead ends: 46 [2022-04-27 12:47:42,819 INFO L226 Difference]: Without dead ends: 44 [2022-04-27 12:47:42,820 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 62 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2022-04-27 12:47:42,821 INFO L413 NwaCegarLoop]: 37 mSDtfsCounter, 6 mSDsluCounter, 114 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 151 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 16 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 12:47:42,821 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 151 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 16 Unchecked, 0.0s Time] [2022-04-27 12:47:42,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2022-04-27 12:47:42,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2022-04-27 12:47:42,831 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 12:47:42,832 INFO L82 GeneralOperation]: Start isEquivalent. First operand 44 states. Second operand has 44 states, 28 states have (on average 1.1785714285714286) internal successors, (33), 30 states have internal predecessors, (33), 10 states have call successors, (10), 6 states have call predecessors, (10), 5 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-27 12:47:42,832 INFO L74 IsIncluded]: Start isIncluded. First operand 44 states. Second operand has 44 states, 28 states have (on average 1.1785714285714286) internal successors, (33), 30 states have internal predecessors, (33), 10 states have call successors, (10), 6 states have call predecessors, (10), 5 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-27 12:47:42,832 INFO L87 Difference]: Start difference. First operand 44 states. Second operand has 44 states, 28 states have (on average 1.1785714285714286) internal successors, (33), 30 states have internal predecessors, (33), 10 states have call successors, (10), 6 states have call predecessors, (10), 5 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-27 12:47:42,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:47:42,834 INFO L93 Difference]: Finished difference Result 44 states and 51 transitions. [2022-04-27 12:47:42,834 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 51 transitions. [2022-04-27 12:47:42,834 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 12:47:42,834 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 12:47:42,835 INFO L74 IsIncluded]: Start isIncluded. First operand has 44 states, 28 states have (on average 1.1785714285714286) internal successors, (33), 30 states have internal predecessors, (33), 10 states have call successors, (10), 6 states have call predecessors, (10), 5 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) Second operand 44 states. [2022-04-27 12:47:42,835 INFO L87 Difference]: Start difference. First operand has 44 states, 28 states have (on average 1.1785714285714286) internal successors, (33), 30 states have internal predecessors, (33), 10 states have call successors, (10), 6 states have call predecessors, (10), 5 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) Second operand 44 states. [2022-04-27 12:47:42,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:47:42,837 INFO L93 Difference]: Finished difference Result 44 states and 51 transitions. [2022-04-27 12:47:42,837 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 51 transitions. [2022-04-27 12:47:42,837 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 12:47:42,837 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 12:47:42,838 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 12:47:42,838 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 12:47:42,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 28 states have (on average 1.1785714285714286) internal successors, (33), 30 states have internal predecessors, (33), 10 states have call successors, (10), 6 states have call predecessors, (10), 5 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-27 12:47:42,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 51 transitions. [2022-04-27 12:47:42,840 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 51 transitions. Word has length 37 [2022-04-27 12:47:42,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 12:47:42,840 INFO L495 AbstractCegarLoop]: Abstraction has 44 states and 51 transitions. [2022-04-27 12:47:42,840 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2022-04-27 12:47:42,840 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 51 transitions. [2022-04-27 12:47:42,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-04-27 12:47:42,841 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 12:47:42,841 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 12:47:42,860 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-04-27 12:47:43,052 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:43,053 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 12:47:43,053 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 12:47:43,053 INFO L85 PathProgramCache]: Analyzing trace with hash -382866049, now seen corresponding path program 1 times [2022-04-27 12:47:43,053 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 12:47:43,053 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1398166640] [2022-04-27 12:47:43,053 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 12:47:43,054 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 12:47:43,069 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 12:47:43,069 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [664464545] [2022-04-27 12:47:43,069 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 12:47:43,069 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 12:47:43,069 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 12:47:43,070 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:43,071 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:43,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:47:43,112 INFO L263 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 3 conjunts are in the unsatisfiable core [2022-04-27 12:47:43,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:47:43,119 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 12:47:43,194 INFO L272 TraceCheckUtils]: 0: Hoare triple {1102#true} call ULTIMATE.init(); {1102#true} is VALID [2022-04-27 12:47:43,194 INFO L290 TraceCheckUtils]: 1: Hoare triple {1102#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); {1102#true} is VALID [2022-04-27 12:47:43,195 INFO L290 TraceCheckUtils]: 2: Hoare triple {1102#true} assume true; {1102#true} is VALID [2022-04-27 12:47:43,195 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1102#true} {1102#true} #94#return; {1102#true} is VALID [2022-04-27 12:47:43,195 INFO L272 TraceCheckUtils]: 4: Hoare triple {1102#true} call #t~ret3 := main(); {1102#true} is VALID [2022-04-27 12:47:43,195 INFO L290 TraceCheckUtils]: 5: Hoare triple {1102#true} havoc ~A~0;havoc ~B~0;havoc ~q~0;havoc ~r~0;havoc ~b~0;~A~0 := #t~nondet1;havoc #t~nondet1; {1102#true} is VALID [2022-04-27 12:47:43,195 INFO L272 TraceCheckUtils]: 6: Hoare triple {1102#true} call assume_abort_if_not((if ~A~0 % 4294967296 >= 0 && ~A~0 % 4294967296 <= 100 then 1 else 0)); {1102#true} is VALID [2022-04-27 12:47:43,195 INFO L290 TraceCheckUtils]: 7: Hoare triple {1102#true} ~cond := #in~cond; {1102#true} is VALID [2022-04-27 12:47:43,195 INFO L290 TraceCheckUtils]: 8: Hoare triple {1102#true} assume !(0 == ~cond); {1102#true} is VALID [2022-04-27 12:47:43,195 INFO L290 TraceCheckUtils]: 9: Hoare triple {1102#true} assume true; {1102#true} is VALID [2022-04-27 12:47:43,195 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1102#true} {1102#true} #82#return; {1102#true} is VALID [2022-04-27 12:47:43,195 INFO L290 TraceCheckUtils]: 11: Hoare triple {1102#true} ~B~0 := #t~nondet2;havoc #t~nondet2; {1102#true} is VALID [2022-04-27 12:47:43,196 INFO L272 TraceCheckUtils]: 12: Hoare triple {1102#true} call assume_abort_if_not((if ~B~0 % 4294967296 >= 0 && ~B~0 % 4294967296 <= 100 then 1 else 0)); {1102#true} is VALID [2022-04-27 12:47:43,196 INFO L290 TraceCheckUtils]: 13: Hoare triple {1102#true} ~cond := #in~cond; {1102#true} is VALID [2022-04-27 12:47:43,196 INFO L290 TraceCheckUtils]: 14: Hoare triple {1102#true} assume !(0 == ~cond); {1102#true} is VALID [2022-04-27 12:47:43,196 INFO L290 TraceCheckUtils]: 15: Hoare triple {1102#true} assume true; {1102#true} is VALID [2022-04-27 12:47:43,196 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {1102#true} {1102#true} #84#return; {1102#true} is VALID [2022-04-27 12:47:43,196 INFO L272 TraceCheckUtils]: 17: Hoare triple {1102#true} call assume_abort_if_not((if ~B~0 % 4294967296 < 2147483647 then 1 else 0)); {1102#true} is VALID [2022-04-27 12:47:43,196 INFO L290 TraceCheckUtils]: 18: Hoare triple {1102#true} ~cond := #in~cond; {1102#true} is VALID [2022-04-27 12:47:43,196 INFO L290 TraceCheckUtils]: 19: Hoare triple {1102#true} assume !(0 == ~cond); {1102#true} is VALID [2022-04-27 12:47:43,196 INFO L290 TraceCheckUtils]: 20: Hoare triple {1102#true} assume true; {1102#true} is VALID [2022-04-27 12:47:43,196 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {1102#true} {1102#true} #86#return; {1102#true} is VALID [2022-04-27 12:47:43,196 INFO L272 TraceCheckUtils]: 22: Hoare triple {1102#true} call assume_abort_if_not((if ~B~0 % 4294967296 >= 1 then 1 else 0)); {1102#true} is VALID [2022-04-27 12:47:43,197 INFO L290 TraceCheckUtils]: 23: Hoare triple {1102#true} ~cond := #in~cond; {1102#true} is VALID [2022-04-27 12:47:43,197 INFO L290 TraceCheckUtils]: 24: Hoare triple {1102#true} assume !(0 == ~cond); {1102#true} is VALID [2022-04-27 12:47:43,197 INFO L290 TraceCheckUtils]: 25: Hoare triple {1102#true} assume true; {1102#true} is VALID [2022-04-27 12:47:43,197 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {1102#true} {1102#true} #88#return; {1102#true} is VALID [2022-04-27 12:47:43,197 INFO L290 TraceCheckUtils]: 27: Hoare triple {1102#true} ~q~0 := 0;~r~0 := ~A~0;~b~0 := ~B~0; {1188#(= main_~B~0 main_~b~0)} is VALID [2022-04-27 12:47:43,198 INFO L290 TraceCheckUtils]: 28: Hoare triple {1188#(= main_~B~0 main_~b~0)} assume !false; {1188#(= main_~B~0 main_~b~0)} is VALID [2022-04-27 12:47:43,198 INFO L290 TraceCheckUtils]: 29: Hoare triple {1188#(= main_~B~0 main_~b~0)} assume !(~r~0 % 4294967296 >= ~b~0 % 4294967296); {1188#(= main_~B~0 main_~b~0)} is VALID [2022-04-27 12:47:43,198 INFO L290 TraceCheckUtils]: 30: Hoare triple {1188#(= main_~B~0 main_~b~0)} assume !false; {1188#(= main_~B~0 main_~b~0)} is VALID [2022-04-27 12:47:43,198 INFO L272 TraceCheckUtils]: 31: Hoare triple {1188#(= main_~B~0 main_~b~0)} call __VERIFIER_assert((if ~A~0 % 4294967296 == (~q~0 * ~b~0 + ~r~0) % 4294967296 then 1 else 0)); {1102#true} is VALID [2022-04-27 12:47:43,198 INFO L290 TraceCheckUtils]: 32: Hoare triple {1102#true} ~cond := #in~cond; {1102#true} is VALID [2022-04-27 12:47:43,199 INFO L290 TraceCheckUtils]: 33: Hoare triple {1102#true} assume !(0 == ~cond); {1102#true} is VALID [2022-04-27 12:47:43,199 INFO L290 TraceCheckUtils]: 34: Hoare triple {1102#true} assume true; {1102#true} is VALID [2022-04-27 12:47:43,199 INFO L284 TraceCheckUtils]: 35: Hoare quadruple {1102#true} {1188#(= main_~B~0 main_~b~0)} #90#return; {1188#(= main_~B~0 main_~b~0)} is VALID [2022-04-27 12:47:43,200 INFO L290 TraceCheckUtils]: 36: Hoare triple {1188#(= 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); {1103#false} is VALID [2022-04-27 12:47:43,200 INFO L290 TraceCheckUtils]: 37: Hoare triple {1103#false} assume ~r~0 % 4294967296 >= ~b~0 % 4294967296;~q~0 := 1 + ~q~0;~r~0 := ~r~0 - ~b~0; {1103#false} is VALID [2022-04-27 12:47:43,200 INFO L290 TraceCheckUtils]: 38: Hoare triple {1103#false} assume !false; {1103#false} is VALID [2022-04-27 12:47:43,200 INFO L272 TraceCheckUtils]: 39: Hoare triple {1103#false} call __VERIFIER_assert((if ~A~0 % 4294967296 == (~q~0 * ~b~0 + ~r~0) % 4294967296 then 1 else 0)); {1103#false} is VALID [2022-04-27 12:47:43,200 INFO L290 TraceCheckUtils]: 40: Hoare triple {1103#false} ~cond := #in~cond; {1103#false} is VALID [2022-04-27 12:47:43,200 INFO L290 TraceCheckUtils]: 41: Hoare triple {1103#false} assume 0 == ~cond; {1103#false} is VALID [2022-04-27 12:47:43,200 INFO L290 TraceCheckUtils]: 42: Hoare triple {1103#false} assume !false; {1103#false} is VALID [2022-04-27 12:47:43,201 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-04-27 12:47:43,201 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-27 12:47:43,201 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 12:47:43,201 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1398166640] [2022-04-27 12:47:43,201 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 12:47:43,201 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [664464545] [2022-04-27 12:47:43,201 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [664464545] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 12:47:43,201 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 12:47:43,201 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-27 12:47:43,201 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1131095189] [2022-04-27 12:47:43,202 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 12:47:43,202 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 3 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 43 [2022-04-27 12:47:43,202 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 12:47:43,202 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 3 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-04-27 12:47:43,225 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 34 edges. 34 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 12:47:43,225 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-27 12:47:43,226 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 12:47:43,226 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-27 12:47:43,226 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-27 12:47:43,226 INFO L87 Difference]: Start difference. First operand 44 states and 51 transitions. Second operand has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 3 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-04-27 12:47:45,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:47:45,386 INFO L93 Difference]: Finished difference Result 55 states and 64 transitions. [2022-04-27 12:47:45,386 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-27 12:47:45,386 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 3 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 43 [2022-04-27 12:47:45,386 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 12:47:45,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 3 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-04-27 12:47:45,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 55 transitions. [2022-04-27 12:47:45,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 3 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-04-27 12:47:45,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 55 transitions. [2022-04-27 12:47:45,391 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 55 transitions. [2022-04-27 12:47:45,429 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 55 edges. 55 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 12:47:45,430 INFO L225 Difference]: With dead ends: 55 [2022-04-27 12:47:45,431 INFO L226 Difference]: Without dead ends: 37 [2022-04-27 12:47:45,431 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 41 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:45,432 INFO L413 NwaCegarLoop]: 34 mSDtfsCounter, 0 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 55 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 12:47:45,432 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 55 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 12:47:45,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2022-04-27 12:47:45,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2022-04-27 12:47:45,436 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 12:47:45,437 INFO L82 GeneralOperation]: Start isEquivalent. First operand 37 states. Second operand has 37 states, 23 states have (on average 1.173913043478261) internal successors, (27), 25 states have internal predecessors, (27), 9 states have call successors, (9), 5 states have call predecessors, (9), 4 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-27 12:47:45,437 INFO L74 IsIncluded]: Start isIncluded. First operand 37 states. Second operand has 37 states, 23 states have (on average 1.173913043478261) internal successors, (27), 25 states have internal predecessors, (27), 9 states have call successors, (9), 5 states have call predecessors, (9), 4 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-27 12:47:45,437 INFO L87 Difference]: Start difference. First operand 37 states. Second operand has 37 states, 23 states have (on average 1.173913043478261) internal successors, (27), 25 states have internal predecessors, (27), 9 states have call successors, (9), 5 states have call predecessors, (9), 4 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-27 12:47:45,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:47:45,439 INFO L93 Difference]: Finished difference Result 37 states and 43 transitions. [2022-04-27 12:47:45,439 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 43 transitions. [2022-04-27 12:47:45,439 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 12:47:45,439 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 12:47:45,439 INFO L74 IsIncluded]: Start isIncluded. First operand has 37 states, 23 states have (on average 1.173913043478261) internal successors, (27), 25 states have internal predecessors, (27), 9 states have call successors, (9), 5 states have call predecessors, (9), 4 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) Second operand 37 states. [2022-04-27 12:47:45,439 INFO L87 Difference]: Start difference. First operand has 37 states, 23 states have (on average 1.173913043478261) internal successors, (27), 25 states have internal predecessors, (27), 9 states have call successors, (9), 5 states have call predecessors, (9), 4 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) Second operand 37 states. [2022-04-27 12:47:45,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:47:45,441 INFO L93 Difference]: Finished difference Result 37 states and 43 transitions. [2022-04-27 12:47:45,441 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 43 transitions. [2022-04-27 12:47:45,441 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 12:47:45,441 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 12:47:45,441 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 12:47:45,441 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 12:47:45,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 23 states have (on average 1.173913043478261) internal successors, (27), 25 states have internal predecessors, (27), 9 states have call successors, (9), 5 states have call predecessors, (9), 4 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-27 12:47:45,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 43 transitions. [2022-04-27 12:47:45,443 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 43 transitions. Word has length 43 [2022-04-27 12:47:45,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 12:47:45,443 INFO L495 AbstractCegarLoop]: Abstraction has 37 states and 43 transitions. [2022-04-27 12:47:45,443 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 3 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-04-27 12:47:45,443 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 43 transitions. [2022-04-27 12:47:45,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-04-27 12:47:45,444 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 12:47:45,444 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 12:47:45,463 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:45,651 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:45,652 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 12:47:45,652 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 12:47:45,652 INFO L85 PathProgramCache]: Analyzing trace with hash -75827905, now seen corresponding path program 1 times [2022-04-27 12:47:45,652 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 12:47:45,652 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [787552063] [2022-04-27 12:47:45,652 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 12:47:45,652 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 12:47:45,665 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 12:47:45,665 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [751584488] [2022-04-27 12:47:45,665 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 12:47:45,665 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 12:47:45,665 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 12:47:45,666 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:45,667 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:45,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:47:45,699 INFO L263 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 11 conjunts are in the unsatisfiable core [2022-04-27 12:47:45,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:47:45,706 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 12:47:46,113 INFO L272 TraceCheckUtils]: 0: Hoare triple {1436#true} call ULTIMATE.init(); {1436#true} is VALID [2022-04-27 12:47:46,113 INFO L290 TraceCheckUtils]: 1: Hoare triple {1436#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); {1436#true} is VALID [2022-04-27 12:47:46,114 INFO L290 TraceCheckUtils]: 2: Hoare triple {1436#true} assume true; {1436#true} is VALID [2022-04-27 12:47:46,114 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1436#true} {1436#true} #94#return; {1436#true} is VALID [2022-04-27 12:47:46,114 INFO L272 TraceCheckUtils]: 4: Hoare triple {1436#true} call #t~ret3 := main(); {1436#true} is VALID [2022-04-27 12:47:46,114 INFO L290 TraceCheckUtils]: 5: Hoare triple {1436#true} havoc ~A~0;havoc ~B~0;havoc ~q~0;havoc ~r~0;havoc ~b~0;~A~0 := #t~nondet1;havoc #t~nondet1; {1436#true} is VALID [2022-04-27 12:47:46,114 INFO L272 TraceCheckUtils]: 6: Hoare triple {1436#true} call assume_abort_if_not((if ~A~0 % 4294967296 >= 0 && ~A~0 % 4294967296 <= 100 then 1 else 0)); {1436#true} is VALID [2022-04-27 12:47:46,114 INFO L290 TraceCheckUtils]: 7: Hoare triple {1436#true} ~cond := #in~cond; {1436#true} is VALID [2022-04-27 12:47:46,114 INFO L290 TraceCheckUtils]: 8: Hoare triple {1436#true} assume !(0 == ~cond); {1436#true} is VALID [2022-04-27 12:47:46,114 INFO L290 TraceCheckUtils]: 9: Hoare triple {1436#true} assume true; {1436#true} is VALID [2022-04-27 12:47:46,114 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1436#true} {1436#true} #82#return; {1436#true} is VALID [2022-04-27 12:47:46,114 INFO L290 TraceCheckUtils]: 11: Hoare triple {1436#true} ~B~0 := #t~nondet2;havoc #t~nondet2; {1436#true} is VALID [2022-04-27 12:47:46,114 INFO L272 TraceCheckUtils]: 12: Hoare triple {1436#true} call assume_abort_if_not((if ~B~0 % 4294967296 >= 0 && ~B~0 % 4294967296 <= 100 then 1 else 0)); {1436#true} is VALID [2022-04-27 12:47:46,115 INFO L290 TraceCheckUtils]: 13: Hoare triple {1436#true} ~cond := #in~cond; {1436#true} is VALID [2022-04-27 12:47:46,115 INFO L290 TraceCheckUtils]: 14: Hoare triple {1436#true} assume !(0 == ~cond); {1436#true} is VALID [2022-04-27 12:47:46,115 INFO L290 TraceCheckUtils]: 15: Hoare triple {1436#true} assume true; {1436#true} is VALID [2022-04-27 12:47:46,115 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {1436#true} {1436#true} #84#return; {1436#true} is VALID [2022-04-27 12:47:46,115 INFO L272 TraceCheckUtils]: 17: Hoare triple {1436#true} call assume_abort_if_not((if ~B~0 % 4294967296 < 2147483647 then 1 else 0)); {1436#true} is VALID [2022-04-27 12:47:46,115 INFO L290 TraceCheckUtils]: 18: Hoare triple {1436#true} ~cond := #in~cond; {1436#true} is VALID [2022-04-27 12:47:46,115 INFO L290 TraceCheckUtils]: 19: Hoare triple {1436#true} assume !(0 == ~cond); {1436#true} is VALID [2022-04-27 12:47:46,115 INFO L290 TraceCheckUtils]: 20: Hoare triple {1436#true} assume true; {1436#true} is VALID [2022-04-27 12:47:46,115 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {1436#true} {1436#true} #86#return; {1436#true} is VALID [2022-04-27 12:47:46,115 INFO L272 TraceCheckUtils]: 22: Hoare triple {1436#true} call assume_abort_if_not((if ~B~0 % 4294967296 >= 1 then 1 else 0)); {1436#true} is VALID [2022-04-27 12:47:46,115 INFO L290 TraceCheckUtils]: 23: Hoare triple {1436#true} ~cond := #in~cond; {1436#true} is VALID [2022-04-27 12:47:46,115 INFO L290 TraceCheckUtils]: 24: Hoare triple {1436#true} assume !(0 == ~cond); {1436#true} is VALID [2022-04-27 12:47:46,115 INFO L290 TraceCheckUtils]: 25: Hoare triple {1436#true} assume true; {1436#true} is VALID [2022-04-27 12:47:46,116 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {1436#true} {1436#true} #88#return; {1436#true} is VALID [2022-04-27 12:47:46,116 INFO L290 TraceCheckUtils]: 27: Hoare triple {1436#true} ~q~0 := 0;~r~0 := ~A~0;~b~0 := ~B~0; {1436#true} is VALID [2022-04-27 12:47:46,116 INFO L290 TraceCheckUtils]: 28: Hoare triple {1436#true} assume !false; {1436#true} is VALID [2022-04-27 12:47:46,116 INFO L290 TraceCheckUtils]: 29: Hoare triple {1436#true} assume !!(~r~0 % 4294967296 >= ~b~0 % 4294967296);~b~0 := 2 * ~b~0; {1436#true} is VALID [2022-04-27 12:47:46,116 INFO L290 TraceCheckUtils]: 30: Hoare triple {1436#true} assume !false; {1436#true} is VALID [2022-04-27 12:47:46,116 INFO L290 TraceCheckUtils]: 31: Hoare triple {1436#true} assume !(~r~0 % 4294967296 >= ~b~0 % 4294967296); {1436#true} is VALID [2022-04-27 12:47:46,116 INFO L290 TraceCheckUtils]: 32: Hoare triple {1436#true} assume !false; {1436#true} is VALID [2022-04-27 12:47:46,116 INFO L272 TraceCheckUtils]: 33: Hoare triple {1436#true} call __VERIFIER_assert((if ~A~0 % 4294967296 == (~q~0 * ~b~0 + ~r~0) % 4294967296 then 1 else 0)); {1436#true} is VALID [2022-04-27 12:47:46,119 INFO L290 TraceCheckUtils]: 34: Hoare triple {1436#true} ~cond := #in~cond; {1543#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-27 12:47:46,119 INFO L290 TraceCheckUtils]: 35: Hoare triple {1543#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {1547#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 12:47:46,120 INFO L290 TraceCheckUtils]: 36: Hoare triple {1547#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {1547#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 12:47:46,120 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {1547#(not (= |__VERIFIER_assert_#in~cond| 0))} {1436#true} #90#return; {1554#(= (mod main_~A~0 4294967296) (mod (+ main_~r~0 (* main_~b~0 main_~q~0)) 4294967296))} is VALID [2022-04-27 12:47:46,121 INFO L290 TraceCheckUtils]: 38: Hoare triple {1554#(= (mod main_~A~0 4294967296) (mod (+ main_~r~0 (* main_~b~0 main_~q~0)) 4294967296))} assume !(~b~0 % 4294967296 != ~B~0 % 4294967296); {1554#(= (mod main_~A~0 4294967296) (mod (+ main_~r~0 (* main_~b~0 main_~q~0)) 4294967296))} is VALID [2022-04-27 12:47:46,121 INFO L272 TraceCheckUtils]: 39: Hoare triple {1554#(= (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)); {1561#(= |__VERIFIER_assert_#in~cond| 1)} is VALID [2022-04-27 12:47:46,122 INFO L290 TraceCheckUtils]: 40: Hoare triple {1561#(= |__VERIFIER_assert_#in~cond| 1)} ~cond := #in~cond; {1565#(= __VERIFIER_assert_~cond 1)} is VALID [2022-04-27 12:47:46,122 INFO L290 TraceCheckUtils]: 41: Hoare triple {1565#(= __VERIFIER_assert_~cond 1)} assume 0 == ~cond; {1437#false} is VALID [2022-04-27 12:47:46,122 INFO L290 TraceCheckUtils]: 42: Hoare triple {1437#false} assume !false; {1437#false} is VALID [2022-04-27 12:47:46,122 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2022-04-27 12:47:46,122 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 12:47:47,328 INFO L290 TraceCheckUtils]: 42: Hoare triple {1437#false} assume !false; {1437#false} is VALID [2022-04-27 12:47:47,329 INFO L290 TraceCheckUtils]: 41: Hoare triple {1575#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {1437#false} is VALID [2022-04-27 12:47:47,329 INFO L290 TraceCheckUtils]: 40: Hoare triple {1547#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {1575#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-27 12:47:47,330 INFO L272 TraceCheckUtils]: 39: Hoare triple {1554#(= (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)); {1547#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 12:47:47,330 INFO L290 TraceCheckUtils]: 38: Hoare triple {1554#(= (mod main_~A~0 4294967296) (mod (+ main_~r~0 (* main_~b~0 main_~q~0)) 4294967296))} assume !(~b~0 % 4294967296 != ~B~0 % 4294967296); {1554#(= (mod main_~A~0 4294967296) (mod (+ main_~r~0 (* main_~b~0 main_~q~0)) 4294967296))} is VALID [2022-04-27 12:47:47,331 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {1547#(not (= |__VERIFIER_assert_#in~cond| 0))} {1436#true} #90#return; {1554#(= (mod main_~A~0 4294967296) (mod (+ main_~r~0 (* main_~b~0 main_~q~0)) 4294967296))} is VALID [2022-04-27 12:47:47,331 INFO L290 TraceCheckUtils]: 36: Hoare triple {1547#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {1547#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 12:47:47,332 INFO L290 TraceCheckUtils]: 35: Hoare triple {1597#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {1547#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 12:47:47,332 INFO L290 TraceCheckUtils]: 34: Hoare triple {1436#true} ~cond := #in~cond; {1597#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-27 12:47:47,332 INFO L272 TraceCheckUtils]: 33: Hoare triple {1436#true} call __VERIFIER_assert((if ~A~0 % 4294967296 == (~q~0 * ~b~0 + ~r~0) % 4294967296 then 1 else 0)); {1436#true} is VALID [2022-04-27 12:47:47,332 INFO L290 TraceCheckUtils]: 32: Hoare triple {1436#true} assume !false; {1436#true} is VALID [2022-04-27 12:47:47,332 INFO L290 TraceCheckUtils]: 31: Hoare triple {1436#true} assume !(~r~0 % 4294967296 >= ~b~0 % 4294967296); {1436#true} is VALID [2022-04-27 12:47:47,332 INFO L290 TraceCheckUtils]: 30: Hoare triple {1436#true} assume !false; {1436#true} is VALID [2022-04-27 12:47:47,332 INFO L290 TraceCheckUtils]: 29: Hoare triple {1436#true} assume !!(~r~0 % 4294967296 >= ~b~0 % 4294967296);~b~0 := 2 * ~b~0; {1436#true} is VALID [2022-04-27 12:47:47,333 INFO L290 TraceCheckUtils]: 28: Hoare triple {1436#true} assume !false; {1436#true} is VALID [2022-04-27 12:47:47,333 INFO L290 TraceCheckUtils]: 27: Hoare triple {1436#true} ~q~0 := 0;~r~0 := ~A~0;~b~0 := ~B~0; {1436#true} is VALID [2022-04-27 12:47:47,333 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {1436#true} {1436#true} #88#return; {1436#true} is VALID [2022-04-27 12:47:47,333 INFO L290 TraceCheckUtils]: 25: Hoare triple {1436#true} assume true; {1436#true} is VALID [2022-04-27 12:47:47,333 INFO L290 TraceCheckUtils]: 24: Hoare triple {1436#true} assume !(0 == ~cond); {1436#true} is VALID [2022-04-27 12:47:47,333 INFO L290 TraceCheckUtils]: 23: Hoare triple {1436#true} ~cond := #in~cond; {1436#true} is VALID [2022-04-27 12:47:47,333 INFO L272 TraceCheckUtils]: 22: Hoare triple {1436#true} call assume_abort_if_not((if ~B~0 % 4294967296 >= 1 then 1 else 0)); {1436#true} is VALID [2022-04-27 12:47:47,333 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {1436#true} {1436#true} #86#return; {1436#true} is VALID [2022-04-27 12:47:47,333 INFO L290 TraceCheckUtils]: 20: Hoare triple {1436#true} assume true; {1436#true} is VALID [2022-04-27 12:47:47,333 INFO L290 TraceCheckUtils]: 19: Hoare triple {1436#true} assume !(0 == ~cond); {1436#true} is VALID [2022-04-27 12:47:47,333 INFO L290 TraceCheckUtils]: 18: Hoare triple {1436#true} ~cond := #in~cond; {1436#true} is VALID [2022-04-27 12:47:47,333 INFO L272 TraceCheckUtils]: 17: Hoare triple {1436#true} call assume_abort_if_not((if ~B~0 % 4294967296 < 2147483647 then 1 else 0)); {1436#true} is VALID [2022-04-27 12:47:47,334 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {1436#true} {1436#true} #84#return; {1436#true} is VALID [2022-04-27 12:47:47,334 INFO L290 TraceCheckUtils]: 15: Hoare triple {1436#true} assume true; {1436#true} is VALID [2022-04-27 12:47:47,334 INFO L290 TraceCheckUtils]: 14: Hoare triple {1436#true} assume !(0 == ~cond); {1436#true} is VALID [2022-04-27 12:47:47,334 INFO L290 TraceCheckUtils]: 13: Hoare triple {1436#true} ~cond := #in~cond; {1436#true} is VALID [2022-04-27 12:47:47,334 INFO L272 TraceCheckUtils]: 12: Hoare triple {1436#true} call assume_abort_if_not((if ~B~0 % 4294967296 >= 0 && ~B~0 % 4294967296 <= 100 then 1 else 0)); {1436#true} is VALID [2022-04-27 12:47:47,334 INFO L290 TraceCheckUtils]: 11: Hoare triple {1436#true} ~B~0 := #t~nondet2;havoc #t~nondet2; {1436#true} is VALID [2022-04-27 12:47:47,334 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1436#true} {1436#true} #82#return; {1436#true} is VALID [2022-04-27 12:47:47,334 INFO L290 TraceCheckUtils]: 9: Hoare triple {1436#true} assume true; {1436#true} is VALID [2022-04-27 12:47:47,334 INFO L290 TraceCheckUtils]: 8: Hoare triple {1436#true} assume !(0 == ~cond); {1436#true} is VALID [2022-04-27 12:47:47,334 INFO L290 TraceCheckUtils]: 7: Hoare triple {1436#true} ~cond := #in~cond; {1436#true} is VALID [2022-04-27 12:47:47,334 INFO L272 TraceCheckUtils]: 6: Hoare triple {1436#true} call assume_abort_if_not((if ~A~0 % 4294967296 >= 0 && ~A~0 % 4294967296 <= 100 then 1 else 0)); {1436#true} is VALID [2022-04-27 12:47:47,334 INFO L290 TraceCheckUtils]: 5: Hoare triple {1436#true} havoc ~A~0;havoc ~B~0;havoc ~q~0;havoc ~r~0;havoc ~b~0;~A~0 := #t~nondet1;havoc #t~nondet1; {1436#true} is VALID [2022-04-27 12:47:47,334 INFO L272 TraceCheckUtils]: 4: Hoare triple {1436#true} call #t~ret3 := main(); {1436#true} is VALID [2022-04-27 12:47:47,335 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1436#true} {1436#true} #94#return; {1436#true} is VALID [2022-04-27 12:47:47,335 INFO L290 TraceCheckUtils]: 2: Hoare triple {1436#true} assume true; {1436#true} is VALID [2022-04-27 12:47:47,335 INFO L290 TraceCheckUtils]: 1: Hoare triple {1436#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); {1436#true} is VALID [2022-04-27 12:47:47,335 INFO L272 TraceCheckUtils]: 0: Hoare triple {1436#true} call ULTIMATE.init(); {1436#true} is VALID [2022-04-27 12:47:47,335 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2022-04-27 12:47:47,335 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 12:47:47,335 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [787552063] [2022-04-27 12:47:47,335 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 12:47:47,336 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [751584488] [2022-04-27 12:47:47,336 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [751584488] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 12:47:47,336 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-27 12:47:47,336 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6] total 9 [2022-04-27 12:47:47,336 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1527662219] [2022-04-27 12:47:47,336 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-27 12:47:47,337 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 8 states have internal predecessors, (23), 2 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (6), 2 states have call predecessors, (6), 1 states have call successors, (6) Word has length 43 [2022-04-27 12:47:47,337 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 12:47:47,337 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 9 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 8 states have internal predecessors, (23), 2 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (6), 2 states have call predecessors, (6), 1 states have call successors, (6) [2022-04-27 12:47:47,363 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 38 edges. 38 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 12:47:47,363 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-27 12:47:47,363 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 12:47:47,363 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-27 12:47:47,364 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2022-04-27 12:47:47,364 INFO L87 Difference]: Start difference. First operand 37 states and 43 transitions. Second operand has 9 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 8 states have internal predecessors, (23), 2 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (6), 2 states have call predecessors, (6), 1 states have call successors, (6) [2022-04-27 12:47:49,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:47:49,050 INFO L93 Difference]: Finished difference Result 43 states and 48 transitions. [2022-04-27 12:47:49,050 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-27 12:47:49,050 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 8 states have internal predecessors, (23), 2 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (6), 2 states have call predecessors, (6), 1 states have call successors, (6) Word has length 43 [2022-04-27 12:47:49,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 12:47:49,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 8 states have internal predecessors, (23), 2 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (6), 2 states have call predecessors, (6), 1 states have call successors, (6) [2022-04-27 12:47:49,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 42 transitions. [2022-04-27 12:47:49,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 8 states have internal predecessors, (23), 2 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (6), 2 states have call predecessors, (6), 1 states have call successors, (6) [2022-04-27 12:47:49,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 42 transitions. [2022-04-27 12:47:49,052 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 42 transitions. [2022-04-27 12:47:49,085 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 42 edges. 42 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 12:47:49,086 INFO L225 Difference]: With dead ends: 43 [2022-04-27 12:47:49,086 INFO L226 Difference]: Without dead ends: 36 [2022-04-27 12:47:49,086 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 78 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2022-04-27 12:47:49,087 INFO L413 NwaCegarLoop]: 30 mSDtfsCounter, 12 mSDsluCounter, 123 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 153 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-04-27 12:47:49,087 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 153 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-04-27 12:47:49,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2022-04-27 12:47:49,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2022-04-27 12:47:49,092 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 12:47:49,092 INFO L82 GeneralOperation]: Start isEquivalent. First operand 36 states. Second operand has 36 states, 23 states have (on average 1.1304347826086956) internal successors, (26), 24 states have internal predecessors, (26), 8 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-27 12:47:49,093 INFO L74 IsIncluded]: Start isIncluded. First operand 36 states. Second operand has 36 states, 23 states have (on average 1.1304347826086956) internal successors, (26), 24 states have internal predecessors, (26), 8 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-27 12:47:49,093 INFO L87 Difference]: Start difference. First operand 36 states. Second operand has 36 states, 23 states have (on average 1.1304347826086956) internal successors, (26), 24 states have internal predecessors, (26), 8 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-27 12:47:49,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:47:49,094 INFO L93 Difference]: Finished difference Result 36 states and 41 transitions. [2022-04-27 12:47:49,094 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 41 transitions. [2022-04-27 12:47:49,094 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 12:47:49,095 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 12:47:49,095 INFO L74 IsIncluded]: Start isIncluded. First operand has 36 states, 23 states have (on average 1.1304347826086956) internal successors, (26), 24 states have internal predecessors, (26), 8 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) Second operand 36 states. [2022-04-27 12:47:49,095 INFO L87 Difference]: Start difference. First operand has 36 states, 23 states have (on average 1.1304347826086956) internal successors, (26), 24 states have internal predecessors, (26), 8 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) Second operand 36 states. [2022-04-27 12:47:49,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:47:49,096 INFO L93 Difference]: Finished difference Result 36 states and 41 transitions. [2022-04-27 12:47:49,096 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 41 transitions. [2022-04-27 12:47:49,096 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 12:47:49,096 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 12:47:49,097 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 12:47:49,097 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 12:47:49,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 23 states have (on average 1.1304347826086956) internal successors, (26), 24 states have internal predecessors, (26), 8 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-27 12:47:49,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 41 transitions. [2022-04-27 12:47:49,098 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 41 transitions. Word has length 43 [2022-04-27 12:47:49,098 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 12:47:49,098 INFO L495 AbstractCegarLoop]: Abstraction has 36 states and 41 transitions. [2022-04-27 12:47:49,098 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 8 states have internal predecessors, (23), 2 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (6), 2 states have call predecessors, (6), 1 states have call successors, (6) [2022-04-27 12:47:49,098 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 41 transitions. [2022-04-27 12:47:49,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-04-27 12:47:49,099 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 12:47:49,099 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 12:47:49,118 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-04-27 12:47:49,307 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:49,308 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 12:47:49,308 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 12:47:49,308 INFO L85 PathProgramCache]: Analyzing trace with hash 866494938, now seen corresponding path program 1 times [2022-04-27 12:47:49,308 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 12:47:49,308 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [632750607] [2022-04-27 12:47:49,308 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 12:47:49,308 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 12:47:49,324 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 12:47:49,324 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [362285938] [2022-04-27 12:47:49,324 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 12:47:49,324 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 12:47:49,324 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 12:47:49,325 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:49,326 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process