/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/divbin2_unwindbound1.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-fb4f59a-m [2022-04-27 12:19:29,363 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-27 12:19:29,364 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-27 12:19:29,401 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-27 12:19:29,402 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-27 12:19:29,403 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-27 12:19:29,409 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-27 12:19:29,414 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-27 12:19:29,416 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-27 12:19:29,421 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-27 12:19:29,421 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-27 12:19:29,422 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-27 12:19:29,422 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-27 12:19:29,423 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-27 12:19:29,423 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-27 12:19:29,424 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-27 12:19:29,425 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-27 12:19:29,425 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-27 12:19:29,426 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-27 12:19:29,428 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-27 12:19:29,429 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-27 12:19:29,431 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-27 12:19:29,433 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-27 12:19:29,434 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-27 12:19:29,435 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-27 12:19:29,445 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-27 12:19:29,446 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-27 12:19:29,446 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-27 12:19:29,447 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-27 12:19:29,447 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-27 12:19:29,448 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-27 12:19:29,448 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-27 12:19:29,450 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-27 12:19:29,450 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-27 12:19:29,451 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-27 12:19:29,451 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-27 12:19:29,451 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-27 12:19:29,452 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-27 12:19:29,452 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-27 12:19:29,452 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-27 12:19:29,453 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-27 12:19:29,455 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-27 12:19:29,456 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:19:29,488 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-27 12:19:29,488 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-27 12:19:29,488 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-04-27 12:19:29,488 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-04-27 12:19:29,489 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-04-27 12:19:29,489 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-04-27 12:19:29,490 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-04-27 12:19:29,490 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-04-27 12:19:29,490 INFO L138 SettingsManager]: * Use SBE=true [2022-04-27 12:19:29,491 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-27 12:19:29,491 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-27 12:19:29,491 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-27 12:19:29,491 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-27 12:19:29,491 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-27 12:19:29,491 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-27 12:19:29,491 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-27 12:19:29,492 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-27 12:19:29,493 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-27 12:19:29,493 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-27 12:19:29,493 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-27 12:19:29,493 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-27 12:19:29,493 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-27 12:19:29,493 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-27 12:19:29,493 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-27 12:19:29,493 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 12:19:29,494 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-27 12:19:29,494 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-04-27 12:19:29,494 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-04-27 12:19:29,494 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-04-27 12:19:29,494 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-04-27 12:19:29,494 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-04-27 12:19:29,494 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-04-27 12:19:29,495 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-27 12:19:29,495 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:19:29,696 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-27 12:19:29,711 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-27 12:19:29,713 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-27 12:19:29,714 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-27 12:19:29,715 INFO L275 PluginConnector]: CDTParser initialized [2022-04-27 12:19:29,715 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/nla-digbench-scaling/divbin2_unwindbound1.i [2022-04-27 12:19:29,768 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cf09ae457/38af0a46eaf44fde9c08b0245a7eb55f/FLAG29331895d [2022-04-27 12:19:30,143 INFO L306 CDTParser]: Found 1 translation units. [2022-04-27 12:19:30,143 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/divbin2_unwindbound1.i [2022-04-27 12:19:30,163 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cf09ae457/38af0a46eaf44fde9c08b0245a7eb55f/FLAG29331895d [2022-04-27 12:19:30,554 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cf09ae457/38af0a46eaf44fde9c08b0245a7eb55f [2022-04-27 12:19:30,556 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-27 12:19:30,558 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-27 12:19:30,559 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-27 12:19:30,559 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-27 12:19:30,562 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-27 12:19:30,563 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 12:19:30" (1/1) ... [2022-04-27 12:19:30,564 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4ea1f4c0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 12:19:30, skipping insertion in model container [2022-04-27 12:19:30,564 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 12:19:30" (1/1) ... [2022-04-27 12:19:30,570 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-27 12:19:30,585 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-27 12:19:30,763 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/divbin2_unwindbound1.i[951,964] [2022-04-27 12:19:30,779 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 12:19:30,786 INFO L203 MainTranslator]: Completed pre-run [2022-04-27 12:19:30,796 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/divbin2_unwindbound1.i[951,964] [2022-04-27 12:19:30,802 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 12:19:30,811 INFO L208 MainTranslator]: Completed translation [2022-04-27 12:19:30,812 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 12:19:30 WrapperNode [2022-04-27 12:19:30,812 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-27 12:19:30,813 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-27 12:19:30,813 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-27 12:19:30,813 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-27 12:19:30,819 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 12:19:30" (1/1) ... [2022-04-27 12:19:30,820 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 12:19:30" (1/1) ... [2022-04-27 12:19:30,824 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 12:19:30" (1/1) ... [2022-04-27 12:19:30,825 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 12:19:30" (1/1) ... [2022-04-27 12:19:30,830 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 12:19:30" (1/1) ... [2022-04-27 12:19:30,834 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 12:19:30" (1/1) ... [2022-04-27 12:19:30,835 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 12:19:30" (1/1) ... [2022-04-27 12:19:30,836 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-27 12:19:30,837 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-27 12:19:30,837 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-27 12:19:30,837 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-27 12:19:30,838 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 12:19:30" (1/1) ... [2022-04-27 12:19:30,843 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 12:19:30,851 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 12:19:30,868 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:19:30,869 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:19:30,897 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-27 12:19:30,897 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-27 12:19:30,898 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-27 12:19:30,898 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-27 12:19:30,899 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-27 12:19:30,899 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-27 12:19:30,899 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-27 12:19:30,899 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-27 12:19:30,899 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_perror_fail [2022-04-27 12:19:30,900 INFO L130 BoogieDeclarations]: Found specification of procedure __assert [2022-04-27 12:19:30,900 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-27 12:19:30,900 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-27 12:19:30,900 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uint [2022-04-27 12:19:30,900 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-27 12:19:30,900 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-27 12:19:30,900 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-27 12:19:30,900 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-27 12:19:30,900 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-27 12:19:30,901 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-27 12:19:30,901 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-27 12:19:30,901 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-27 12:19:30,901 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-27 12:19:30,960 INFO L234 CfgBuilder]: Building ICFG [2022-04-27 12:19:30,962 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-27 12:19:31,157 INFO L275 CfgBuilder]: Performing block encoding [2022-04-27 12:19:31,162 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-27 12:19:31,162 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-04-27 12:19:31,164 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 12:19:31 BoogieIcfgContainer [2022-04-27 12:19:31,164 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-27 12:19:31,165 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-27 12:19:31,165 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-27 12:19:31,179 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-27 12:19:31,179 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.04 12:19:30" (1/3) ... [2022-04-27 12:19:31,179 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6a65fd39 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 12:19:31, skipping insertion in model container [2022-04-27 12:19:31,180 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 12:19:30" (2/3) ... [2022-04-27 12:19:31,180 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6a65fd39 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 12:19:31, skipping insertion in model container [2022-04-27 12:19:31,180 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 12:19:31" (3/3) ... [2022-04-27 12:19:31,181 INFO L111 eAbstractionObserver]: Analyzing ICFG divbin2_unwindbound1.i [2022-04-27 12:19:31,191 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-04-27 12:19:31,191 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-27 12:19:31,225 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-27 12:19:31,230 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@29cae650, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@6d7520c8 [2022-04-27 12:19:31,230 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-27 12:19:31,236 INFO L276 IsEmpty]: Start isEmpty. Operand has 26 states, 17 states have (on average 1.5294117647058822) internal successors, (26), 18 states have internal predecessors, (26), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-27 12:19:31,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-04-27 12:19:31,242 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 12:19:31,242 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 12:19:31,243 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 12:19:31,247 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 12:19:31,247 INFO L85 PathProgramCache]: Analyzing trace with hash -2126508982, now seen corresponding path program 1 times [2022-04-27 12:19:31,254 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 12:19:31,255 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1423942418] [2022-04-27 12:19:31,255 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 12:19:31,255 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 12:19:31,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:19:31,437 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 12:19:31,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:19:31,458 INFO L290 TraceCheckUtils]: 0: Hoare triple {34#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);~counter~0 := 0; {29#true} is VALID [2022-04-27 12:19:31,458 INFO L290 TraceCheckUtils]: 1: Hoare triple {29#true} assume true; {29#true} is VALID [2022-04-27 12:19:31,458 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {29#true} {29#true} #82#return; {29#true} is VALID [2022-04-27 12:19:31,461 INFO L272 TraceCheckUtils]: 0: Hoare triple {29#true} call ULTIMATE.init(); {34#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 12:19:31,461 INFO L290 TraceCheckUtils]: 1: Hoare triple {34#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);~counter~0 := 0; {29#true} is VALID [2022-04-27 12:19:31,462 INFO L290 TraceCheckUtils]: 2: Hoare triple {29#true} assume true; {29#true} is VALID [2022-04-27 12:19:31,462 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {29#true} {29#true} #82#return; {29#true} is VALID [2022-04-27 12:19:31,462 INFO L272 TraceCheckUtils]: 4: Hoare triple {29#true} call #t~ret4 := main(); {29#true} is VALID [2022-04-27 12:19:31,463 INFO L290 TraceCheckUtils]: 5: Hoare triple {29#true} havoc ~A~0;havoc ~B~0;havoc ~q~0;havoc ~r~0;havoc ~b~0;~A~0 := #t~nondet1;havoc #t~nondet1;~B~0 := 1;~q~0 := 0;~r~0 := ~A~0;~b~0 := ~B~0; {29#true} is VALID [2022-04-27 12:19:31,463 INFO L290 TraceCheckUtils]: 6: Hoare triple {29#true} assume !true; {30#false} is VALID [2022-04-27 12:19:31,464 INFO L290 TraceCheckUtils]: 7: Hoare triple {30#false} assume !true; {30#false} is VALID [2022-04-27 12:19:31,464 INFO L272 TraceCheckUtils]: 8: Hoare triple {30#false} call __VERIFIER_assert((if ~A~0 % 4294967296 == (~q~0 * ~b~0 + ~r~0) % 4294967296 then 1 else 0)); {30#false} is VALID [2022-04-27 12:19:31,464 INFO L290 TraceCheckUtils]: 9: Hoare triple {30#false} ~cond := #in~cond; {30#false} is VALID [2022-04-27 12:19:31,465 INFO L290 TraceCheckUtils]: 10: Hoare triple {30#false} assume 0 == ~cond; {30#false} is VALID [2022-04-27 12:19:31,465 INFO L290 TraceCheckUtils]: 11: Hoare triple {30#false} assume !false; {30#false} is VALID [2022-04-27 12:19:31,466 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 12:19:31,466 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 12:19:31,467 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1423942418] [2022-04-27 12:19:31,468 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1423942418] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 12:19:31,469 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 12:19:31,469 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-27 12:19:31,470 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1080004901] [2022-04-27 12:19:31,471 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 12:19:31,477 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2022-04-27 12:19:31,479 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 12:19:31,481 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 12:19:31,513 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 12 edges. 12 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 12:19:31,513 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-27 12:19:31,513 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 12:19:31,534 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-27 12:19:31,536 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-27 12:19:31,538 INFO L87 Difference]: Start difference. First operand has 26 states, 17 states have (on average 1.5294117647058822) internal successors, (26), 18 states have internal predecessors, (26), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 12:19:31,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:19:31,685 INFO L93 Difference]: Finished difference Result 44 states and 60 transitions. [2022-04-27 12:19:31,685 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-27 12:19:31,685 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2022-04-27 12:19:31,686 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 12:19:31,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 12:19:31,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 60 transitions. [2022-04-27 12:19:31,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 12:19:31,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 60 transitions. [2022-04-27 12:19:31,699 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 60 transitions. [2022-04-27 12:19:31,758 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 60 edges. 60 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 12:19:31,766 INFO L225 Difference]: With dead ends: 44 [2022-04-27 12:19:31,766 INFO L226 Difference]: Without dead ends: 22 [2022-04-27 12:19:31,768 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 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:19:31,772 INFO L413 NwaCegarLoop]: 30 mSDtfsCounter, 6 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 12:19:31,775 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 34 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 12:19:31,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2022-04-27 12:19:31,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 21. [2022-04-27 12:19:31,803 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 12:19:31,804 INFO L82 GeneralOperation]: Start isEquivalent. First operand 22 states. Second operand has 21 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 15 states have internal predecessors, (20), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-27 12:19:31,805 INFO L74 IsIncluded]: Start isIncluded. First operand 22 states. Second operand has 21 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 15 states have internal predecessors, (20), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-27 12:19:31,806 INFO L87 Difference]: Start difference. First operand 22 states. Second operand has 21 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 15 states have internal predecessors, (20), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-27 12:19:31,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:19:31,816 INFO L93 Difference]: Finished difference Result 22 states and 27 transitions. [2022-04-27 12:19:31,817 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 27 transitions. [2022-04-27 12:19:31,817 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 12:19:31,817 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 12:19:31,818 INFO L74 IsIncluded]: Start isIncluded. First operand has 21 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 15 states have internal predecessors, (20), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 22 states. [2022-04-27 12:19:31,819 INFO L87 Difference]: Start difference. First operand has 21 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 15 states have internal predecessors, (20), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 22 states. [2022-04-27 12:19:31,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:19:31,823 INFO L93 Difference]: Finished difference Result 22 states and 27 transitions. [2022-04-27 12:19:31,823 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 27 transitions. [2022-04-27 12:19:31,824 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 12:19:31,824 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 12:19:31,824 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 12:19:31,825 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 12:19:31,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 15 states have internal predecessors, (20), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-27 12:19:31,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 26 transitions. [2022-04-27 12:19:31,835 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 26 transitions. Word has length 12 [2022-04-27 12:19:31,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 12:19:31,837 INFO L495 AbstractCegarLoop]: Abstraction has 21 states and 26 transitions. [2022-04-27 12:19:31,838 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 12:19:31,838 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 26 transitions. [2022-04-27 12:19:31,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-04-27 12:19:31,839 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 12:19:31,839 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 12:19:31,839 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-27 12:19:31,840 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 12:19:31,840 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 12:19:31,840 INFO L85 PathProgramCache]: Analyzing trace with hash 941422680, now seen corresponding path program 1 times [2022-04-27 12:19:31,841 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 12:19:31,841 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1982770338] [2022-04-27 12:19:31,841 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 12:19:31,841 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 12:19:31,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:19:31,949 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 12:19:31,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:19:31,970 INFO L290 TraceCheckUtils]: 0: Hoare triple {173#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);~counter~0 := 0; {171#(<= ~counter~0 0)} is VALID [2022-04-27 12:19:31,971 INFO L290 TraceCheckUtils]: 1: Hoare triple {171#(<= ~counter~0 0)} assume true; {171#(<= ~counter~0 0)} is VALID [2022-04-27 12:19:31,971 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {171#(<= ~counter~0 0)} {166#true} #82#return; {171#(<= ~counter~0 0)} is VALID [2022-04-27 12:19:31,972 INFO L272 TraceCheckUtils]: 0: Hoare triple {166#true} call ULTIMATE.init(); {173#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 12:19:31,973 INFO L290 TraceCheckUtils]: 1: Hoare triple {173#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);~counter~0 := 0; {171#(<= ~counter~0 0)} is VALID [2022-04-27 12:19:31,974 INFO L290 TraceCheckUtils]: 2: Hoare triple {171#(<= ~counter~0 0)} assume true; {171#(<= ~counter~0 0)} is VALID [2022-04-27 12:19:31,974 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {171#(<= ~counter~0 0)} {166#true} #82#return; {171#(<= ~counter~0 0)} is VALID [2022-04-27 12:19:31,975 INFO L272 TraceCheckUtils]: 4: Hoare triple {171#(<= ~counter~0 0)} call #t~ret4 := main(); {171#(<= ~counter~0 0)} is VALID [2022-04-27 12:19:31,975 INFO L290 TraceCheckUtils]: 5: Hoare triple {171#(<= ~counter~0 0)} havoc ~A~0;havoc ~B~0;havoc ~q~0;havoc ~r~0;havoc ~b~0;~A~0 := #t~nondet1;havoc #t~nondet1;~B~0 := 1;~q~0 := 0;~r~0 := ~A~0;~b~0 := ~B~0; {171#(<= ~counter~0 0)} is VALID [2022-04-27 12:19:31,976 INFO L290 TraceCheckUtils]: 6: Hoare triple {171#(<= ~counter~0 0)} #t~post2 := ~counter~0;~counter~0 := 1 + #t~post2; {172#(<= |main_#t~post2| 0)} is VALID [2022-04-27 12:19:31,977 INFO L290 TraceCheckUtils]: 7: Hoare triple {172#(<= |main_#t~post2| 0)} assume !(#t~post2 < 1);havoc #t~post2; {167#false} is VALID [2022-04-27 12:19:31,977 INFO L290 TraceCheckUtils]: 8: Hoare triple {167#false} #t~post3 := ~counter~0;~counter~0 := 1 + #t~post3; {167#false} is VALID [2022-04-27 12:19:31,978 INFO L290 TraceCheckUtils]: 9: Hoare triple {167#false} assume !(#t~post3 < 1);havoc #t~post3; {167#false} is VALID [2022-04-27 12:19:31,979 INFO L272 TraceCheckUtils]: 10: Hoare triple {167#false} call __VERIFIER_assert((if ~A~0 % 4294967296 == (~q~0 * ~b~0 + ~r~0) % 4294967296 then 1 else 0)); {167#false} is VALID [2022-04-27 12:19:31,979 INFO L290 TraceCheckUtils]: 11: Hoare triple {167#false} ~cond := #in~cond; {167#false} is VALID [2022-04-27 12:19:31,979 INFO L290 TraceCheckUtils]: 12: Hoare triple {167#false} assume 0 == ~cond; {167#false} is VALID [2022-04-27 12:19:31,980 INFO L290 TraceCheckUtils]: 13: Hoare triple {167#false} assume !false; {167#false} is VALID [2022-04-27 12:19:31,980 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 12:19:31,980 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 12:19:31,980 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1982770338] [2022-04-27 12:19:31,981 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1982770338] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 12:19:31,981 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 12:19:31,981 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-27 12:19:31,981 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [20981337] [2022-04-27 12:19:31,981 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 12:19:31,983 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.5) internal successors, (10), 3 states have internal predecessors, (10), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14 [2022-04-27 12:19:31,984 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 12:19:31,984 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 4 states have (on average 2.5) internal successors, (10), 3 states have internal predecessors, (10), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 12:19:31,997 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 14 edges. 14 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 12:19:31,997 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-27 12:19:31,997 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 12:19:31,998 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-27 12:19:31,998 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-27 12:19:31,999 INFO L87 Difference]: Start difference. First operand 21 states and 26 transitions. Second operand has 5 states, 4 states have (on average 2.5) internal successors, (10), 3 states have internal predecessors, (10), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 12:19:32,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:19:32,142 INFO L93 Difference]: Finished difference Result 35 states and 44 transitions. [2022-04-27 12:19:32,142 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-27 12:19:32,142 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.5) internal successors, (10), 3 states have internal predecessors, (10), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14 [2022-04-27 12:19:32,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 12:19:32,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 4 states have (on average 2.5) internal successors, (10), 3 states have internal predecessors, (10), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 12:19:32,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 44 transitions. [2022-04-27 12:19:32,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 4 states have (on average 2.5) internal successors, (10), 3 states have internal predecessors, (10), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 12:19:32,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 44 transitions. [2022-04-27 12:19:32,154 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 44 transitions. [2022-04-27 12:19:32,192 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 44 edges. 44 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 12:19:32,195 INFO L225 Difference]: With dead ends: 35 [2022-04-27 12:19:32,195 INFO L226 Difference]: Without dead ends: 23 [2022-04-27 12:19:32,198 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-27 12:19:32,201 INFO L413 NwaCegarLoop]: 24 mSDtfsCounter, 6 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 53 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-27 12:19:32,201 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 53 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-27 12:19:32,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2022-04-27 12:19:32,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2022-04-27 12:19:32,211 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 12:19:32,212 INFO L82 GeneralOperation]: Start isEquivalent. First operand 23 states. Second operand has 23 states, 16 states have (on average 1.375) internal successors, (22), 17 states have internal predecessors, (22), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-27 12:19:32,212 INFO L74 IsIncluded]: Start isIncluded. First operand 23 states. Second operand has 23 states, 16 states have (on average 1.375) internal successors, (22), 17 states have internal predecessors, (22), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-27 12:19:32,213 INFO L87 Difference]: Start difference. First operand 23 states. Second operand has 23 states, 16 states have (on average 1.375) internal successors, (22), 17 states have internal predecessors, (22), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-27 12:19:32,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:19:32,215 INFO L93 Difference]: Finished difference Result 23 states and 28 transitions. [2022-04-27 12:19:32,215 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 28 transitions. [2022-04-27 12:19:32,216 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 12:19:32,216 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 12:19:32,216 INFO L74 IsIncluded]: Start isIncluded. First operand has 23 states, 16 states have (on average 1.375) internal successors, (22), 17 states have internal predecessors, (22), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 23 states. [2022-04-27 12:19:32,217 INFO L87 Difference]: Start difference. First operand has 23 states, 16 states have (on average 1.375) internal successors, (22), 17 states have internal predecessors, (22), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 23 states. [2022-04-27 12:19:32,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:19:32,220 INFO L93 Difference]: Finished difference Result 23 states and 28 transitions. [2022-04-27 12:19:32,220 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 28 transitions. [2022-04-27 12:19:32,220 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 12:19:32,220 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 12:19:32,221 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 12:19:32,221 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 12:19:32,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 16 states have (on average 1.375) internal successors, (22), 17 states have internal predecessors, (22), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-27 12:19:32,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 28 transitions. [2022-04-27 12:19:32,228 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 28 transitions. Word has length 14 [2022-04-27 12:19:32,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 12:19:32,229 INFO L495 AbstractCegarLoop]: Abstraction has 23 states and 28 transitions. [2022-04-27 12:19:32,230 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.5) internal successors, (10), 3 states have internal predecessors, (10), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 12:19:32,230 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 28 transitions. [2022-04-27 12:19:32,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-04-27 12:19:32,230 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 12:19:32,231 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 12:19:32,231 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-27 12:19:32,231 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 12:19:32,233 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 12:19:32,233 INFO L85 PathProgramCache]: Analyzing trace with hash -1209133518, now seen corresponding path program 1 times [2022-04-27 12:19:32,233 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 12:19:32,233 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1824908495] [2022-04-27 12:19:32,233 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 12:19:32,233 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 12:19:32,267 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 12:19:32,267 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [855069767] [2022-04-27 12:19:32,267 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 12:19:32,267 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 12:19:32,267 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 12:19:32,269 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:19:32,289 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:19:32,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:19:32,338 INFO L263 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 14 conjunts are in the unsatisfiable core [2022-04-27 12:19:32,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:19:32,352 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 12:19:32,719 INFO L272 TraceCheckUtils]: 0: Hoare triple {303#true} call ULTIMATE.init(); {303#true} is VALID [2022-04-27 12:19:32,720 INFO L290 TraceCheckUtils]: 1: Hoare triple {303#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(10, 2);~counter~0 := 0; {303#true} is VALID [2022-04-27 12:19:32,720 INFO L290 TraceCheckUtils]: 2: Hoare triple {303#true} assume true; {303#true} is VALID [2022-04-27 12:19:32,720 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {303#true} {303#true} #82#return; {303#true} is VALID [2022-04-27 12:19:32,720 INFO L272 TraceCheckUtils]: 4: Hoare triple {303#true} call #t~ret4 := main(); {303#true} is VALID [2022-04-27 12:19:32,721 INFO L290 TraceCheckUtils]: 5: Hoare triple {303#true} havoc ~A~0;havoc ~B~0;havoc ~q~0;havoc ~r~0;havoc ~b~0;~A~0 := #t~nondet1;havoc #t~nondet1;~B~0 := 1;~q~0 := 0;~r~0 := ~A~0;~b~0 := ~B~0; {323#(and (= main_~b~0 1) (= main_~A~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-27 12:19:32,721 INFO L290 TraceCheckUtils]: 6: Hoare triple {323#(and (= main_~b~0 1) (= main_~A~0 main_~r~0) (= main_~q~0 0))} #t~post2 := ~counter~0;~counter~0 := 1 + #t~post2; {323#(and (= main_~b~0 1) (= main_~A~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-27 12:19:32,722 INFO L290 TraceCheckUtils]: 7: Hoare triple {323#(and (= main_~b~0 1) (= main_~A~0 main_~r~0) (= main_~q~0 0))} assume !!(#t~post2 < 1);havoc #t~post2; {323#(and (= main_~b~0 1) (= main_~A~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-27 12:19:32,723 INFO L290 TraceCheckUtils]: 8: Hoare triple {323#(and (= main_~b~0 1) (= main_~A~0 main_~r~0) (= main_~q~0 0))} assume !(~r~0 % 4294967296 >= ~b~0 % 4294967296); {333#(and (= main_~b~0 1) (not (<= (mod main_~b~0 4294967296) (mod main_~r~0 4294967296))) (= main_~A~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-27 12:19:32,723 INFO L290 TraceCheckUtils]: 9: Hoare triple {333#(and (= main_~b~0 1) (not (<= (mod main_~b~0 4294967296) (mod main_~r~0 4294967296))) (= main_~A~0 main_~r~0) (= main_~q~0 0))} #t~post3 := ~counter~0;~counter~0 := 1 + #t~post3; {333#(and (= main_~b~0 1) (not (<= (mod main_~b~0 4294967296) (mod main_~r~0 4294967296))) (= main_~A~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-27 12:19:32,724 INFO L290 TraceCheckUtils]: 10: Hoare triple {333#(and (= main_~b~0 1) (not (<= (mod main_~b~0 4294967296) (mod main_~r~0 4294967296))) (= main_~A~0 main_~r~0) (= main_~q~0 0))} assume !(#t~post3 < 1);havoc #t~post3; {333#(and (= main_~b~0 1) (not (<= (mod main_~b~0 4294967296) (mod main_~r~0 4294967296))) (= main_~A~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-27 12:19:32,726 INFO L272 TraceCheckUtils]: 11: Hoare triple {333#(and (= main_~b~0 1) (not (<= (mod main_~b~0 4294967296) (mod main_~r~0 4294967296))) (= 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)); {343#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 12:19:32,727 INFO L290 TraceCheckUtils]: 12: Hoare triple {343#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {347#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 12:19:32,730 INFO L290 TraceCheckUtils]: 13: Hoare triple {347#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {304#false} is VALID [2022-04-27 12:19:32,730 INFO L290 TraceCheckUtils]: 14: Hoare triple {304#false} assume !false; {304#false} is VALID [2022-04-27 12:19:32,730 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 12:19:32,730 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-27 12:19:32,730 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 12:19:32,731 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1824908495] [2022-04-27 12:19:32,731 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 12:19:32,731 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [855069767] [2022-04-27 12:19:32,731 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [855069767] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 12:19:32,731 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 12:19:32,731 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-27 12:19:32,731 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1865429444] [2022-04-27 12:19:32,732 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 12:19:32,732 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 5 states have internal predecessors, (11), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2022-04-27 12:19:32,732 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 12:19:32,732 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 5 states have internal predecessors, (11), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 12:19:32,747 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 15 edges. 15 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 12:19:32,747 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-27 12:19:32,748 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 12:19:32,748 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-27 12:19:32,748 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-04-27 12:19:32,748 INFO L87 Difference]: Start difference. First operand 23 states and 28 transitions. Second operand has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 5 states have internal predecessors, (11), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 12:19:32,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:19:32,922 INFO L93 Difference]: Finished difference Result 35 states and 43 transitions. [2022-04-27 12:19:32,922 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-27 12:19:32,922 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 5 states have internal predecessors, (11), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2022-04-27 12:19:32,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 12:19:32,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 5 states have internal predecessors, (11), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 12:19:32,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 43 transitions. [2022-04-27 12:19:32,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 5 states have internal predecessors, (11), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 12:19:32,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 43 transitions. [2022-04-27 12:19:32,926 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 43 transitions. [2022-04-27 12:19:32,972 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 43 edges. 43 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 12:19:32,974 INFO L225 Difference]: With dead ends: 35 [2022-04-27 12:19:32,974 INFO L226 Difference]: Without dead ends: 32 [2022-04-27 12:19:32,974 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-04-27 12:19:32,975 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 12 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 73 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 12:19:32,975 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 73 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 12:19:32,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2022-04-27 12:19:32,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2022-04-27 12:19:32,985 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 12:19:32,985 INFO L82 GeneralOperation]: Start isEquivalent. First operand 32 states. Second operand has 32 states, 23 states have (on average 1.3043478260869565) internal successors, (30), 24 states have internal predecessors, (30), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-27 12:19:32,985 INFO L74 IsIncluded]: Start isIncluded. First operand 32 states. Second operand has 32 states, 23 states have (on average 1.3043478260869565) internal successors, (30), 24 states have internal predecessors, (30), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-27 12:19:32,985 INFO L87 Difference]: Start difference. First operand 32 states. Second operand has 32 states, 23 states have (on average 1.3043478260869565) internal successors, (30), 24 states have internal predecessors, (30), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-27 12:19:32,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:19:32,991 INFO L93 Difference]: Finished difference Result 32 states and 38 transitions. [2022-04-27 12:19:32,991 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 38 transitions. [2022-04-27 12:19:32,993 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 12:19:32,993 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 12:19:32,994 INFO L74 IsIncluded]: Start isIncluded. First operand has 32 states, 23 states have (on average 1.3043478260869565) internal successors, (30), 24 states have internal predecessors, (30), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 32 states. [2022-04-27 12:19:32,994 INFO L87 Difference]: Start difference. First operand has 32 states, 23 states have (on average 1.3043478260869565) internal successors, (30), 24 states have internal predecessors, (30), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 32 states. [2022-04-27 12:19:32,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:19:32,996 INFO L93 Difference]: Finished difference Result 32 states and 38 transitions. [2022-04-27 12:19:32,996 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 38 transitions. [2022-04-27 12:19:32,996 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 12:19:32,996 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 12:19:32,996 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 12:19:32,997 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 12:19:32,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 23 states have (on average 1.3043478260869565) internal successors, (30), 24 states have internal predecessors, (30), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-27 12:19:32,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 38 transitions. [2022-04-27 12:19:32,998 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 38 transitions. Word has length 15 [2022-04-27 12:19:32,998 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 12:19:32,998 INFO L495 AbstractCegarLoop]: Abstraction has 32 states and 38 transitions. [2022-04-27 12:19:32,999 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 5 states have internal predecessors, (11), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 12:19:32,999 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 38 transitions. [2022-04-27 12:19:32,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-04-27 12:19:32,999 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 12:19:32,999 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 12:19:33,023 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:19:33,200 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 12:19:33,200 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 12:19:33,201 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 12:19:33,201 INFO L85 PathProgramCache]: Analyzing trace with hash -352921097, now seen corresponding path program 1 times [2022-04-27 12:19:33,201 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 12:19:33,201 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [977731393] [2022-04-27 12:19:33,201 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 12:19:33,201 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 12:19:33,214 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 12:19:33,214 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1605922911] [2022-04-27 12:19:33,214 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 12:19:33,214 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 12:19:33,215 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 12:19:33,216 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:19:33,241 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:19:33,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:19:33,294 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 14 conjunts are in the unsatisfiable core [2022-04-27 12:19:33,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:19:33,302 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 12:19:33,609 INFO L272 TraceCheckUtils]: 0: Hoare triple {509#true} call ULTIMATE.init(); {509#true} is VALID [2022-04-27 12:19:33,610 INFO L290 TraceCheckUtils]: 1: Hoare triple {509#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(10, 2);~counter~0 := 0; {509#true} is VALID [2022-04-27 12:19:33,610 INFO L290 TraceCheckUtils]: 2: Hoare triple {509#true} assume true; {509#true} is VALID [2022-04-27 12:19:33,610 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {509#true} {509#true} #82#return; {509#true} is VALID [2022-04-27 12:19:33,610 INFO L272 TraceCheckUtils]: 4: Hoare triple {509#true} call #t~ret4 := main(); {509#true} is VALID [2022-04-27 12:19:33,613 INFO L290 TraceCheckUtils]: 5: Hoare triple {509#true} havoc ~A~0;havoc ~B~0;havoc ~q~0;havoc ~r~0;havoc ~b~0;~A~0 := #t~nondet1;havoc #t~nondet1;~B~0 := 1;~q~0 := 0;~r~0 := ~A~0;~b~0 := ~B~0; {529#(and (= main_~b~0 1) (= main_~A~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-27 12:19:33,613 INFO L290 TraceCheckUtils]: 6: Hoare triple {529#(and (= main_~b~0 1) (= main_~A~0 main_~r~0) (= main_~q~0 0))} #t~post2 := ~counter~0;~counter~0 := 1 + #t~post2; {529#(and (= main_~b~0 1) (= main_~A~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-27 12:19:33,614 INFO L290 TraceCheckUtils]: 7: Hoare triple {529#(and (= main_~b~0 1) (= main_~A~0 main_~r~0) (= main_~q~0 0))} assume !!(#t~post2 < 1);havoc #t~post2; {529#(and (= main_~b~0 1) (= main_~A~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-27 12:19:33,615 INFO L290 TraceCheckUtils]: 8: Hoare triple {529#(and (= main_~b~0 1) (= main_~A~0 main_~r~0) (= main_~q~0 0))} assume !!(~r~0 % 4294967296 >= ~b~0 % 4294967296);~b~0 := 2 * ~b~0; {539#(and (= main_~A~0 main_~r~0) (<= 1 (mod main_~r~0 4294967296)) (= main_~q~0 0))} is VALID [2022-04-27 12:19:33,615 INFO L290 TraceCheckUtils]: 9: Hoare triple {539#(and (= main_~A~0 main_~r~0) (<= 1 (mod main_~r~0 4294967296)) (= main_~q~0 0))} #t~post2 := ~counter~0;~counter~0 := 1 + #t~post2; {539#(and (= main_~A~0 main_~r~0) (<= 1 (mod main_~r~0 4294967296)) (= main_~q~0 0))} is VALID [2022-04-27 12:19:33,616 INFO L290 TraceCheckUtils]: 10: Hoare triple {539#(and (= main_~A~0 main_~r~0) (<= 1 (mod main_~r~0 4294967296)) (= main_~q~0 0))} assume !(#t~post2 < 1);havoc #t~post2; {539#(and (= main_~A~0 main_~r~0) (<= 1 (mod main_~r~0 4294967296)) (= main_~q~0 0))} is VALID [2022-04-27 12:19:33,616 INFO L290 TraceCheckUtils]: 11: Hoare triple {539#(and (= main_~A~0 main_~r~0) (<= 1 (mod main_~r~0 4294967296)) (= main_~q~0 0))} #t~post3 := ~counter~0;~counter~0 := 1 + #t~post3; {539#(and (= main_~A~0 main_~r~0) (<= 1 (mod main_~r~0 4294967296)) (= main_~q~0 0))} is VALID [2022-04-27 12:19:33,618 INFO L290 TraceCheckUtils]: 12: Hoare triple {539#(and (= main_~A~0 main_~r~0) (<= 1 (mod main_~r~0 4294967296)) (= main_~q~0 0))} assume !(#t~post3 < 1);havoc #t~post3; {539#(and (= main_~A~0 main_~r~0) (<= 1 (mod main_~r~0 4294967296)) (= main_~q~0 0))} is VALID [2022-04-27 12:19:33,619 INFO L272 TraceCheckUtils]: 13: Hoare triple {539#(and (= main_~A~0 main_~r~0) (<= 1 (mod main_~r~0 4294967296)) (= main_~q~0 0))} call __VERIFIER_assert((if ~A~0 % 4294967296 == (~q~0 * ~b~0 + ~r~0) % 4294967296 then 1 else 0)); {555#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 12:19:33,619 INFO L290 TraceCheckUtils]: 14: Hoare triple {555#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {559#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 12:19:33,620 INFO L290 TraceCheckUtils]: 15: Hoare triple {559#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {510#false} is VALID [2022-04-27 12:19:33,620 INFO L290 TraceCheckUtils]: 16: Hoare triple {510#false} assume !false; {510#false} is VALID [2022-04-27 12:19:33,620 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 12:19:33,620 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 12:19:34,005 INFO L290 TraceCheckUtils]: 16: Hoare triple {510#false} assume !false; {510#false} is VALID [2022-04-27 12:19:34,006 INFO L290 TraceCheckUtils]: 15: Hoare triple {559#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {510#false} is VALID [2022-04-27 12:19:34,006 INFO L290 TraceCheckUtils]: 14: Hoare triple {555#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {559#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 12:19:34,007 INFO L272 TraceCheckUtils]: 13: Hoare triple {575#(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)); {555#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 12:19:34,008 INFO L290 TraceCheckUtils]: 12: Hoare triple {575#(forall ((main_~b~0 Int)) (= (mod main_~A~0 4294967296) (mod (+ main_~r~0 (* main_~b~0 main_~q~0)) 4294967296)))} assume !(#t~post3 < 1);havoc #t~post3; {575#(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:19:34,008 INFO L290 TraceCheckUtils]: 11: Hoare triple {575#(forall ((main_~b~0 Int)) (= (mod main_~A~0 4294967296) (mod (+ main_~r~0 (* main_~b~0 main_~q~0)) 4294967296)))} #t~post3 := ~counter~0;~counter~0 := 1 + #t~post3; {575#(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:19:34,009 INFO L290 TraceCheckUtils]: 10: Hoare triple {575#(forall ((main_~b~0 Int)) (= (mod main_~A~0 4294967296) (mod (+ main_~r~0 (* main_~b~0 main_~q~0)) 4294967296)))} assume !(#t~post2 < 1);havoc #t~post2; {575#(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:19:34,010 INFO L290 TraceCheckUtils]: 9: Hoare triple {575#(forall ((main_~b~0 Int)) (= (mod main_~A~0 4294967296) (mod (+ main_~r~0 (* main_~b~0 main_~q~0)) 4294967296)))} #t~post2 := ~counter~0;~counter~0 := 1 + #t~post2; {575#(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:19:34,010 INFO L290 TraceCheckUtils]: 8: Hoare triple {591#(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; {575#(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:19:34,011 INFO L290 TraceCheckUtils]: 7: Hoare triple {591#(or (not (<= (mod main_~b~0 4294967296) (mod main_~r~0 4294967296))) (forall ((main_~b~0 Int)) (= (mod main_~A~0 4294967296) (mod (+ main_~r~0 (* main_~b~0 main_~q~0)) 4294967296))))} assume !!(#t~post2 < 1);havoc #t~post2; {591#(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:19:34,012 INFO L290 TraceCheckUtils]: 6: Hoare triple {591#(or (not (<= (mod main_~b~0 4294967296) (mod main_~r~0 4294967296))) (forall ((main_~b~0 Int)) (= (mod main_~A~0 4294967296) (mod (+ main_~r~0 (* main_~b~0 main_~q~0)) 4294967296))))} #t~post2 := ~counter~0;~counter~0 := 1 + #t~post2; {591#(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:19:34,012 INFO L290 TraceCheckUtils]: 5: Hoare triple {509#true} havoc ~A~0;havoc ~B~0;havoc ~q~0;havoc ~r~0;havoc ~b~0;~A~0 := #t~nondet1;havoc #t~nondet1;~B~0 := 1;~q~0 := 0;~r~0 := ~A~0;~b~0 := ~B~0; {591#(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:19:34,012 INFO L272 TraceCheckUtils]: 4: Hoare triple {509#true} call #t~ret4 := main(); {509#true} is VALID [2022-04-27 12:19:34,013 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {509#true} {509#true} #82#return; {509#true} is VALID [2022-04-27 12:19:34,013 INFO L290 TraceCheckUtils]: 2: Hoare triple {509#true} assume true; {509#true} is VALID [2022-04-27 12:19:34,013 INFO L290 TraceCheckUtils]: 1: Hoare triple {509#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(10, 2);~counter~0 := 0; {509#true} is VALID [2022-04-27 12:19:34,013 INFO L272 TraceCheckUtils]: 0: Hoare triple {509#true} call ULTIMATE.init(); {509#true} is VALID [2022-04-27 12:19:34,013 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 12:19:34,013 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 12:19:34,013 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [977731393] [2022-04-27 12:19:34,014 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 12:19:34,016 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1605922911] [2022-04-27 12:19:34,016 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1605922911] provided 1 perfect and 1 imperfect interpolant sequences [2022-04-27 12:19:34,016 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-04-27 12:19:34,016 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 8 [2022-04-27 12:19:34,016 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2085523273] [2022-04-27 12:19:34,017 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 12:19:34,017 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2022-04-27 12:19:34,017 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 12:19:34,017 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 12:19:36,059 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 16 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-27 12:19:36,059 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-27 12:19:36,059 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 12:19:36,060 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-27 12:19:36,060 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2022-04-27 12:19:36,060 INFO L87 Difference]: Start difference. First operand 32 states and 38 transitions. Second operand has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 12:19:36,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:19:36,228 INFO L93 Difference]: Finished difference Result 43 states and 51 transitions. [2022-04-27 12:19:36,228 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-27 12:19:36,228 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2022-04-27 12:19:36,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 12:19:36,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 12:19:36,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 43 transitions. [2022-04-27 12:19:36,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 12:19:36,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 43 transitions. [2022-04-27 12:19:36,231 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 43 transitions. [2022-04-27 12:19:36,605 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 43 edges. 43 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 12:19:36,609 INFO L225 Difference]: With dead ends: 43 [2022-04-27 12:19:36,609 INFO L226 Difference]: Without dead ends: 36 [2022-04-27 12:19:36,609 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 26 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2022-04-27 12:19:36,610 INFO L413 NwaCegarLoop]: 31 mSDtfsCounter, 11 mSDsluCounter, 85 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 116 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 28 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 12:19:36,611 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 116 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 28 Unchecked, 0.0s Time] [2022-04-27 12:19:36,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2022-04-27 12:19:36,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 35. [2022-04-27 12:19:36,626 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 12:19:36,626 INFO L82 GeneralOperation]: Start isEquivalent. First operand 36 states. Second operand has 35 states, 25 states have (on average 1.28) internal successors, (32), 27 states have internal predecessors, (32), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-27 12:19:36,627 INFO L74 IsIncluded]: Start isIncluded. First operand 36 states. Second operand has 35 states, 25 states have (on average 1.28) internal successors, (32), 27 states have internal predecessors, (32), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-27 12:19:36,627 INFO L87 Difference]: Start difference. First operand 36 states. Second operand has 35 states, 25 states have (on average 1.28) internal successors, (32), 27 states have internal predecessors, (32), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-27 12:19:36,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:19:36,631 INFO L93 Difference]: Finished difference Result 36 states and 43 transitions. [2022-04-27 12:19:36,631 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 43 transitions. [2022-04-27 12:19:36,632 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 12:19:36,632 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 12:19:36,632 INFO L74 IsIncluded]: Start isIncluded. First operand has 35 states, 25 states have (on average 1.28) internal successors, (32), 27 states have internal predecessors, (32), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) Second operand 36 states. [2022-04-27 12:19:36,632 INFO L87 Difference]: Start difference. First operand has 35 states, 25 states have (on average 1.28) internal successors, (32), 27 states have internal predecessors, (32), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) Second operand 36 states. [2022-04-27 12:19:36,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:19:36,634 INFO L93 Difference]: Finished difference Result 36 states and 43 transitions. [2022-04-27 12:19:36,635 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 43 transitions. [2022-04-27 12:19:36,637 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 12:19:36,637 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 12:19:36,637 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 12:19:36,638 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 12:19:36,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 25 states have (on average 1.28) internal successors, (32), 27 states have internal predecessors, (32), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-27 12:19:36,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 42 transitions. [2022-04-27 12:19:36,643 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 42 transitions. Word has length 17 [2022-04-27 12:19:36,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 12:19:36,643 INFO L495 AbstractCegarLoop]: Abstraction has 35 states and 42 transitions. [2022-04-27 12:19:36,644 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 12:19:36,644 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 42 transitions. [2022-04-27 12:19:36,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-04-27 12:19:36,646 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 12:19:36,646 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 12:19:36,671 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:19:36,854 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,SelfDestructingSolverStorable3 [2022-04-27 12:19:36,855 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 12:19:36,855 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 12:19:36,855 INFO L85 PathProgramCache]: Analyzing trace with hash -351133637, now seen corresponding path program 1 times [2022-04-27 12:19:36,855 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 12:19:36,855 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [935635319] [2022-04-27 12:19:36,855 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 12:19:36,856 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 12:19:36,870 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 12:19:36,870 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [587489744] [2022-04-27 12:19:36,870 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 12:19:36,870 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 12:19:36,870 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 12:19:36,871 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:19:36,875 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:19:36,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:19:36,908 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 4 conjunts are in the unsatisfiable core [2022-04-27 12:19:36,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:19:36,916 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 12:19:36,975 INFO L272 TraceCheckUtils]: 0: Hoare triple {796#true} call ULTIMATE.init(); {796#true} is VALID [2022-04-27 12:19:36,975 INFO L290 TraceCheckUtils]: 1: Hoare triple {796#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(10, 2);~counter~0 := 0; {796#true} is VALID [2022-04-27 12:19:36,975 INFO L290 TraceCheckUtils]: 2: Hoare triple {796#true} assume true; {796#true} is VALID [2022-04-27 12:19:36,975 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {796#true} {796#true} #82#return; {796#true} is VALID [2022-04-27 12:19:36,976 INFO L272 TraceCheckUtils]: 4: Hoare triple {796#true} call #t~ret4 := main(); {796#true} is VALID [2022-04-27 12:19:36,976 INFO L290 TraceCheckUtils]: 5: Hoare triple {796#true} havoc ~A~0;havoc ~B~0;havoc ~q~0;havoc ~r~0;havoc ~b~0;~A~0 := #t~nondet1;havoc #t~nondet1;~B~0 := 1;~q~0 := 0;~r~0 := ~A~0;~b~0 := ~B~0; {796#true} is VALID [2022-04-27 12:19:36,976 INFO L290 TraceCheckUtils]: 6: Hoare triple {796#true} #t~post2 := ~counter~0;~counter~0 := 1 + #t~post2; {796#true} is VALID [2022-04-27 12:19:36,976 INFO L290 TraceCheckUtils]: 7: Hoare triple {796#true} assume !!(#t~post2 < 1);havoc #t~post2; {796#true} is VALID [2022-04-27 12:19:36,976 INFO L290 TraceCheckUtils]: 8: Hoare triple {796#true} assume !!(~r~0 % 4294967296 >= ~b~0 % 4294967296);~b~0 := 2 * ~b~0; {796#true} is VALID [2022-04-27 12:19:36,978 INFO L290 TraceCheckUtils]: 9: Hoare triple {796#true} #t~post2 := ~counter~0;~counter~0 := 1 + #t~post2; {828#(<= (+ |main_#t~post2| 1) ~counter~0)} is VALID [2022-04-27 12:19:36,978 INFO L290 TraceCheckUtils]: 10: Hoare triple {828#(<= (+ |main_#t~post2| 1) ~counter~0)} assume !(#t~post2 < 1);havoc #t~post2; {832#(<= 2 ~counter~0)} is VALID [2022-04-27 12:19:36,979 INFO L290 TraceCheckUtils]: 11: Hoare triple {832#(<= 2 ~counter~0)} #t~post3 := ~counter~0;~counter~0 := 1 + #t~post3; {836#(<= 2 |main_#t~post3|)} is VALID [2022-04-27 12:19:36,979 INFO L290 TraceCheckUtils]: 12: Hoare triple {836#(<= 2 |main_#t~post3|)} assume !!(#t~post3 < 1);havoc #t~post3; {797#false} is VALID [2022-04-27 12:19:36,979 INFO L272 TraceCheckUtils]: 13: Hoare triple {797#false} call __VERIFIER_assert((if ~A~0 % 4294967296 == (~q~0 * ~b~0 + ~r~0) % 4294967296 then 1 else 0)); {797#false} is VALID [2022-04-27 12:19:36,980 INFO L290 TraceCheckUtils]: 14: Hoare triple {797#false} ~cond := #in~cond; {797#false} is VALID [2022-04-27 12:19:36,980 INFO L290 TraceCheckUtils]: 15: Hoare triple {797#false} assume 0 == ~cond; {797#false} is VALID [2022-04-27 12:19:36,980 INFO L290 TraceCheckUtils]: 16: Hoare triple {797#false} assume !false; {797#false} is VALID [2022-04-27 12:19:36,980 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-27 12:19:36,980 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-27 12:19:36,980 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 12:19:36,980 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [935635319] [2022-04-27 12:19:36,980 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 12:19:36,980 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [587489744] [2022-04-27 12:19:36,981 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [587489744] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 12:19:36,981 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 12:19:36,981 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-27 12:19:36,981 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1633569733] [2022-04-27 12:19:36,981 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 12:19:36,981 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2022-04-27 12:19:36,982 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 12:19:36,982 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 12:19:36,996 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 12:19:36,996 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-27 12:19:36,996 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 12:19:36,996 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-27 12:19:36,997 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-27 12:19:36,997 INFO L87 Difference]: Start difference. First operand 35 states and 42 transitions. Second operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 12:19:37,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:19:37,118 INFO L93 Difference]: Finished difference Result 48 states and 58 transitions. [2022-04-27 12:19:37,118 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-27 12:19:37,119 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2022-04-27 12:19:37,119 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 12:19:37,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 12:19:37,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-04-27 12:19:37,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 12:19:37,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-04-27 12:19:37,123 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 43 transitions. [2022-04-27 12:19:37,158 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 43 edges. 43 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 12:19:37,160 INFO L225 Difference]: With dead ends: 48 [2022-04-27 12:19:37,161 INFO L226 Difference]: Without dead ends: 32 [2022-04-27 12:19:37,161 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-27 12:19:37,163 INFO L413 NwaCegarLoop]: 24 mSDtfsCounter, 0 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 87 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 12:19:37,164 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 87 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 12:19:37,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2022-04-27 12:19:37,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2022-04-27 12:19:37,177 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 12:19:37,178 INFO L82 GeneralOperation]: Start isEquivalent. First operand 32 states. Second operand has 32 states, 23 states have (on average 1.2608695652173914) internal successors, (29), 24 states have internal predecessors, (29), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-27 12:19:37,178 INFO L74 IsIncluded]: Start isIncluded. First operand 32 states. Second operand has 32 states, 23 states have (on average 1.2608695652173914) internal successors, (29), 24 states have internal predecessors, (29), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-27 12:19:37,178 INFO L87 Difference]: Start difference. First operand 32 states. Second operand has 32 states, 23 states have (on average 1.2608695652173914) internal successors, (29), 24 states have internal predecessors, (29), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-27 12:19:37,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:19:37,180 INFO L93 Difference]: Finished difference Result 32 states and 37 transitions. [2022-04-27 12:19:37,180 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 37 transitions. [2022-04-27 12:19:37,181 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 12:19:37,181 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 12:19:37,181 INFO L74 IsIncluded]: Start isIncluded. First operand has 32 states, 23 states have (on average 1.2608695652173914) internal successors, (29), 24 states have internal predecessors, (29), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 32 states. [2022-04-27 12:19:37,181 INFO L87 Difference]: Start difference. First operand has 32 states, 23 states have (on average 1.2608695652173914) internal successors, (29), 24 states have internal predecessors, (29), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 32 states. [2022-04-27 12:19:37,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:19:37,184 INFO L93 Difference]: Finished difference Result 32 states and 37 transitions. [2022-04-27 12:19:37,184 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 37 transitions. [2022-04-27 12:19:37,184 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 12:19:37,184 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 12:19:37,184 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 12:19:37,184 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 12:19:37,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 23 states have (on average 1.2608695652173914) internal successors, (29), 24 states have internal predecessors, (29), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-27 12:19:37,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 37 transitions. [2022-04-27 12:19:37,186 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 37 transitions. Word has length 17 [2022-04-27 12:19:37,186 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 12:19:37,186 INFO L495 AbstractCegarLoop]: Abstraction has 32 states and 37 transitions. [2022-04-27 12:19:37,186 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 12:19:37,186 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 37 transitions. [2022-04-27 12:19:37,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-04-27 12:19:37,187 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 12:19:37,187 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 12:19:37,210 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:19:37,410 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 12:19:37,410 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 12:19:37,410 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 12:19:37,411 INFO L85 PathProgramCache]: Analyzing trace with hash 1615882355, now seen corresponding path program 1 times [2022-04-27 12:19:37,411 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 12:19:37,411 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1581011491] [2022-04-27 12:19:37,411 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 12:19:37,411 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 12:19:37,433 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 12:19:37,434 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1119331132] [2022-04-27 12:19:37,434 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 12:19:37,434 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 12:19:37,434 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 12:19:37,437 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:19:37,464 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:19:37,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:19:37,481 INFO L263 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-27 12:19:37,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:19:37,491 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 12:19:37,597 INFO L272 TraceCheckUtils]: 0: Hoare triple {1023#true} call ULTIMATE.init(); {1023#true} is VALID [2022-04-27 12:19:37,598 INFO L290 TraceCheckUtils]: 1: Hoare triple {1023#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(10, 2);~counter~0 := 0; {1031#(<= 0 ~counter~0)} is VALID [2022-04-27 12:19:37,598 INFO L290 TraceCheckUtils]: 2: Hoare triple {1031#(<= 0 ~counter~0)} assume true; {1031#(<= 0 ~counter~0)} is VALID [2022-04-27 12:19:37,598 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1031#(<= 0 ~counter~0)} {1023#true} #82#return; {1031#(<= 0 ~counter~0)} is VALID [2022-04-27 12:19:37,599 INFO L272 TraceCheckUtils]: 4: Hoare triple {1031#(<= 0 ~counter~0)} call #t~ret4 := main(); {1031#(<= 0 ~counter~0)} is VALID [2022-04-27 12:19:37,601 INFO L290 TraceCheckUtils]: 5: Hoare triple {1031#(<= 0 ~counter~0)} havoc ~A~0;havoc ~B~0;havoc ~q~0;havoc ~r~0;havoc ~b~0;~A~0 := #t~nondet1;havoc #t~nondet1;~B~0 := 1;~q~0 := 0;~r~0 := ~A~0;~b~0 := ~B~0; {1031#(<= 0 ~counter~0)} is VALID [2022-04-27 12:19:37,602 INFO L290 TraceCheckUtils]: 6: Hoare triple {1031#(<= 0 ~counter~0)} #t~post2 := ~counter~0;~counter~0 := 1 + #t~post2; {1047#(<= 1 ~counter~0)} is VALID [2022-04-27 12:19:37,602 INFO L290 TraceCheckUtils]: 7: Hoare triple {1047#(<= 1 ~counter~0)} assume !!(#t~post2 < 1);havoc #t~post2; {1047#(<= 1 ~counter~0)} is VALID [2022-04-27 12:19:37,603 INFO L290 TraceCheckUtils]: 8: Hoare triple {1047#(<= 1 ~counter~0)} assume !!(~r~0 % 4294967296 >= ~b~0 % 4294967296);~b~0 := 2 * ~b~0; {1047#(<= 1 ~counter~0)} is VALID [2022-04-27 12:19:37,603 INFO L290 TraceCheckUtils]: 9: Hoare triple {1047#(<= 1 ~counter~0)} #t~post2 := ~counter~0;~counter~0 := 1 + #t~post2; {1057#(<= 1 |main_#t~post2|)} is VALID [2022-04-27 12:19:37,604 INFO L290 TraceCheckUtils]: 10: Hoare triple {1057#(<= 1 |main_#t~post2|)} assume !!(#t~post2 < 1);havoc #t~post2; {1024#false} is VALID [2022-04-27 12:19:37,604 INFO L290 TraceCheckUtils]: 11: Hoare triple {1024#false} assume !(~r~0 % 4294967296 >= ~b~0 % 4294967296); {1024#false} is VALID [2022-04-27 12:19:37,604 INFO L290 TraceCheckUtils]: 12: Hoare triple {1024#false} #t~post3 := ~counter~0;~counter~0 := 1 + #t~post3; {1024#false} is VALID [2022-04-27 12:19:37,604 INFO L290 TraceCheckUtils]: 13: Hoare triple {1024#false} assume !(#t~post3 < 1);havoc #t~post3; {1024#false} is VALID [2022-04-27 12:19:37,605 INFO L272 TraceCheckUtils]: 14: Hoare triple {1024#false} call __VERIFIER_assert((if ~A~0 % 4294967296 == (~q~0 * ~b~0 + ~r~0) % 4294967296 then 1 else 0)); {1024#false} is VALID [2022-04-27 12:19:37,605 INFO L290 TraceCheckUtils]: 15: Hoare triple {1024#false} ~cond := #in~cond; {1024#false} is VALID [2022-04-27 12:19:37,605 INFO L290 TraceCheckUtils]: 16: Hoare triple {1024#false} assume 0 == ~cond; {1024#false} is VALID [2022-04-27 12:19:37,605 INFO L290 TraceCheckUtils]: 17: Hoare triple {1024#false} assume !false; {1024#false} is VALID [2022-04-27 12:19:37,605 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 12:19:37,605 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 12:19:37,717 INFO L290 TraceCheckUtils]: 17: Hoare triple {1024#false} assume !false; {1024#false} is VALID [2022-04-27 12:19:37,718 INFO L290 TraceCheckUtils]: 16: Hoare triple {1024#false} assume 0 == ~cond; {1024#false} is VALID [2022-04-27 12:19:37,718 INFO L290 TraceCheckUtils]: 15: Hoare triple {1024#false} ~cond := #in~cond; {1024#false} is VALID [2022-04-27 12:19:37,718 INFO L272 TraceCheckUtils]: 14: Hoare triple {1024#false} call __VERIFIER_assert((if ~A~0 % 4294967296 == (~q~0 * ~b~0 + ~r~0) % 4294967296 then 1 else 0)); {1024#false} is VALID [2022-04-27 12:19:37,719 INFO L290 TraceCheckUtils]: 13: Hoare triple {1024#false} assume !(#t~post3 < 1);havoc #t~post3; {1024#false} is VALID [2022-04-27 12:19:37,720 INFO L290 TraceCheckUtils]: 12: Hoare triple {1024#false} #t~post3 := ~counter~0;~counter~0 := 1 + #t~post3; {1024#false} is VALID [2022-04-27 12:19:37,728 INFO L290 TraceCheckUtils]: 11: Hoare triple {1024#false} assume !(~r~0 % 4294967296 >= ~b~0 % 4294967296); {1024#false} is VALID [2022-04-27 12:19:37,729 INFO L290 TraceCheckUtils]: 10: Hoare triple {1057#(<= 1 |main_#t~post2|)} assume !!(#t~post2 < 1);havoc #t~post2; {1024#false} is VALID [2022-04-27 12:19:37,729 INFO L290 TraceCheckUtils]: 9: Hoare triple {1047#(<= 1 ~counter~0)} #t~post2 := ~counter~0;~counter~0 := 1 + #t~post2; {1057#(<= 1 |main_#t~post2|)} is VALID [2022-04-27 12:19:37,732 INFO L290 TraceCheckUtils]: 8: Hoare triple {1047#(<= 1 ~counter~0)} assume !!(~r~0 % 4294967296 >= ~b~0 % 4294967296);~b~0 := 2 * ~b~0; {1047#(<= 1 ~counter~0)} is VALID [2022-04-27 12:19:37,732 INFO L290 TraceCheckUtils]: 7: Hoare triple {1047#(<= 1 ~counter~0)} assume !!(#t~post2 < 1);havoc #t~post2; {1047#(<= 1 ~counter~0)} is VALID [2022-04-27 12:19:37,733 INFO L290 TraceCheckUtils]: 6: Hoare triple {1031#(<= 0 ~counter~0)} #t~post2 := ~counter~0;~counter~0 := 1 + #t~post2; {1047#(<= 1 ~counter~0)} is VALID [2022-04-27 12:19:37,733 INFO L290 TraceCheckUtils]: 5: Hoare triple {1031#(<= 0 ~counter~0)} havoc ~A~0;havoc ~B~0;havoc ~q~0;havoc ~r~0;havoc ~b~0;~A~0 := #t~nondet1;havoc #t~nondet1;~B~0 := 1;~q~0 := 0;~r~0 := ~A~0;~b~0 := ~B~0; {1031#(<= 0 ~counter~0)} is VALID [2022-04-27 12:19:37,734 INFO L272 TraceCheckUtils]: 4: Hoare triple {1031#(<= 0 ~counter~0)} call #t~ret4 := main(); {1031#(<= 0 ~counter~0)} is VALID [2022-04-27 12:19:37,734 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1031#(<= 0 ~counter~0)} {1023#true} #82#return; {1031#(<= 0 ~counter~0)} is VALID [2022-04-27 12:19:37,735 INFO L290 TraceCheckUtils]: 2: Hoare triple {1031#(<= 0 ~counter~0)} assume true; {1031#(<= 0 ~counter~0)} is VALID [2022-04-27 12:19:37,735 INFO L290 TraceCheckUtils]: 1: Hoare triple {1023#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(10, 2);~counter~0 := 0; {1031#(<= 0 ~counter~0)} is VALID [2022-04-27 12:19:37,735 INFO L272 TraceCheckUtils]: 0: Hoare triple {1023#true} call ULTIMATE.init(); {1023#true} is VALID [2022-04-27 12:19:37,736 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 12:19:37,736 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 12:19:37,736 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1581011491] [2022-04-27 12:19:37,736 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 12:19:37,737 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1119331132] [2022-04-27 12:19:37,737 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1119331132] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 12:19:37,737 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-27 12:19:37,737 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5 [2022-04-27 12:19:37,737 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [564556700] [2022-04-27 12:19:37,737 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-27 12:19:37,737 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 18 [2022-04-27 12:19:37,738 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 12:19:37,738 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 12:19:37,751 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 12:19:37,752 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-27 12:19:37,752 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 12:19:37,752 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-27 12:19:37,752 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-04-27 12:19:37,753 INFO L87 Difference]: Start difference. First operand 32 states and 37 transitions. Second operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 12:19:37,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:19:37,831 INFO L93 Difference]: Finished difference Result 46 states and 54 transitions. [2022-04-27 12:19:37,831 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-27 12:19:37,831 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 18 [2022-04-27 12:19:37,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 12:19:37,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 12:19:37,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 46 transitions. [2022-04-27 12:19:37,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 12:19:37,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 46 transitions. [2022-04-27 12:19:37,837 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 46 transitions. [2022-04-27 12:19:37,874 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 46 edges. 46 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 12:19:37,875 INFO L225 Difference]: With dead ends: 46 [2022-04-27 12:19:37,875 INFO L226 Difference]: Without dead ends: 29 [2022-04-27 12:19:37,875 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 31 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2022-04-27 12:19:37,877 INFO L413 NwaCegarLoop]: 23 mSDtfsCounter, 29 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 48 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 12:19:37,878 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 48 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 12:19:37,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2022-04-27 12:19:37,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2022-04-27 12:19:37,891 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 12:19:37,891 INFO L82 GeneralOperation]: Start isEquivalent. First operand 29 states. Second operand has 29 states, 20 states have (on average 1.2) internal successors, (24), 21 states have internal predecessors, (24), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-27 12:19:37,892 INFO L74 IsIncluded]: Start isIncluded. First operand 29 states. Second operand has 29 states, 20 states have (on average 1.2) internal successors, (24), 21 states have internal predecessors, (24), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-27 12:19:37,892 INFO L87 Difference]: Start difference. First operand 29 states. Second operand has 29 states, 20 states have (on average 1.2) internal successors, (24), 21 states have internal predecessors, (24), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-27 12:19:37,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:19:37,893 INFO L93 Difference]: Finished difference Result 29 states and 32 transitions. [2022-04-27 12:19:37,893 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 32 transitions. [2022-04-27 12:19:37,893 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 12:19:37,893 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 12:19:37,894 INFO L74 IsIncluded]: Start isIncluded. First operand has 29 states, 20 states have (on average 1.2) internal successors, (24), 21 states have internal predecessors, (24), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 29 states. [2022-04-27 12:19:37,894 INFO L87 Difference]: Start difference. First operand has 29 states, 20 states have (on average 1.2) internal successors, (24), 21 states have internal predecessors, (24), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 29 states. [2022-04-27 12:19:37,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:19:37,895 INFO L93 Difference]: Finished difference Result 29 states and 32 transitions. [2022-04-27 12:19:37,895 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 32 transitions. [2022-04-27 12:19:37,895 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 12:19:37,895 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 12:19:37,895 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 12:19:37,895 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 12:19:37,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 20 states have (on average 1.2) internal successors, (24), 21 states have internal predecessors, (24), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-27 12:19:37,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 32 transitions. [2022-04-27 12:19:37,896 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 32 transitions. Word has length 18 [2022-04-27 12:19:37,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 12:19:37,896 INFO L495 AbstractCegarLoop]: Abstraction has 29 states and 32 transitions. [2022-04-27 12:19:37,897 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 12:19:37,897 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 32 transitions. [2022-04-27 12:19:37,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-04-27 12:19:37,897 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 12:19:37,897 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 12:19:37,923 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-04-27 12:19:38,111 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 12:19:38,112 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 12:19:38,112 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 12:19:38,112 INFO L85 PathProgramCache]: Analyzing trace with hash 1626008211, now seen corresponding path program 1 times [2022-04-27 12:19:38,112 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 12:19:38,112 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [309394398] [2022-04-27 12:19:38,112 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 12:19:38,112 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 12:19:38,124 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 12:19:38,124 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2074772223] [2022-04-27 12:19:38,125 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 12:19:38,125 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 12:19:38,125 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 12:19:38,126 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 12:19:38,138 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-04-27 12:19:38,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:19:38,172 INFO L263 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-27 12:19:38,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:19:38,184 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 12:19:38,286 INFO L272 TraceCheckUtils]: 0: Hoare triple {1295#true} call ULTIMATE.init(); {1295#true} is VALID [2022-04-27 12:19:38,287 INFO L290 TraceCheckUtils]: 1: Hoare triple {1295#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(10, 2);~counter~0 := 0; {1303#(<= 0 ~counter~0)} is VALID [2022-04-27 12:19:38,288 INFO L290 TraceCheckUtils]: 2: Hoare triple {1303#(<= 0 ~counter~0)} assume true; {1303#(<= 0 ~counter~0)} is VALID [2022-04-27 12:19:38,288 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1303#(<= 0 ~counter~0)} {1295#true} #82#return; {1303#(<= 0 ~counter~0)} is VALID [2022-04-27 12:19:38,289 INFO L272 TraceCheckUtils]: 4: Hoare triple {1303#(<= 0 ~counter~0)} call #t~ret4 := main(); {1303#(<= 0 ~counter~0)} is VALID [2022-04-27 12:19:38,289 INFO L290 TraceCheckUtils]: 5: Hoare triple {1303#(<= 0 ~counter~0)} havoc ~A~0;havoc ~B~0;havoc ~q~0;havoc ~r~0;havoc ~b~0;~A~0 := #t~nondet1;havoc #t~nondet1;~B~0 := 1;~q~0 := 0;~r~0 := ~A~0;~b~0 := ~B~0; {1303#(<= 0 ~counter~0)} is VALID [2022-04-27 12:19:38,290 INFO L290 TraceCheckUtils]: 6: Hoare triple {1303#(<= 0 ~counter~0)} #t~post2 := ~counter~0;~counter~0 := 1 + #t~post2; {1319#(<= 1 ~counter~0)} is VALID [2022-04-27 12:19:38,290 INFO L290 TraceCheckUtils]: 7: Hoare triple {1319#(<= 1 ~counter~0)} assume !!(#t~post2 < 1);havoc #t~post2; {1319#(<= 1 ~counter~0)} is VALID [2022-04-27 12:19:38,290 INFO L290 TraceCheckUtils]: 8: Hoare triple {1319#(<= 1 ~counter~0)} assume !(~r~0 % 4294967296 >= ~b~0 % 4294967296); {1319#(<= 1 ~counter~0)} is VALID [2022-04-27 12:19:38,291 INFO L290 TraceCheckUtils]: 9: Hoare triple {1319#(<= 1 ~counter~0)} #t~post3 := ~counter~0;~counter~0 := 1 + #t~post3; {1329#(<= 1 |main_#t~post3|)} is VALID [2022-04-27 12:19:38,291 INFO L290 TraceCheckUtils]: 10: Hoare triple {1329#(<= 1 |main_#t~post3|)} assume !!(#t~post3 < 1);havoc #t~post3; {1296#false} is VALID [2022-04-27 12:19:38,291 INFO L272 TraceCheckUtils]: 11: Hoare triple {1296#false} call __VERIFIER_assert((if ~A~0 % 4294967296 == (~q~0 * ~b~0 + ~r~0) % 4294967296 then 1 else 0)); {1296#false} is VALID [2022-04-27 12:19:38,291 INFO L290 TraceCheckUtils]: 12: Hoare triple {1296#false} ~cond := #in~cond; {1296#false} is VALID [2022-04-27 12:19:38,291 INFO L290 TraceCheckUtils]: 13: Hoare triple {1296#false} assume !(0 == ~cond); {1296#false} is VALID [2022-04-27 12:19:38,291 INFO L290 TraceCheckUtils]: 14: Hoare triple {1296#false} assume true; {1296#false} is VALID [2022-04-27 12:19:38,292 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {1296#false} {1296#false} #78#return; {1296#false} is VALID [2022-04-27 12:19:38,292 INFO L290 TraceCheckUtils]: 16: Hoare triple {1296#false} 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); {1296#false} is VALID [2022-04-27 12:19:38,292 INFO L290 TraceCheckUtils]: 17: Hoare triple {1296#false} assume ~r~0 % 4294967296 >= ~b~0 % 4294967296;~q~0 := 1 + ~q~0;~r~0 := ~r~0 - ~b~0; {1296#false} is VALID [2022-04-27 12:19:38,292 INFO L290 TraceCheckUtils]: 18: Hoare triple {1296#false} #t~post3 := ~counter~0;~counter~0 := 1 + #t~post3; {1296#false} is VALID [2022-04-27 12:19:38,292 INFO L290 TraceCheckUtils]: 19: Hoare triple {1296#false} assume !(#t~post3 < 1);havoc #t~post3; {1296#false} is VALID [2022-04-27 12:19:38,292 INFO L272 TraceCheckUtils]: 20: Hoare triple {1296#false} call __VERIFIER_assert((if ~A~0 % 4294967296 == (~q~0 * ~b~0 + ~r~0) % 4294967296 then 1 else 0)); {1296#false} is VALID [2022-04-27 12:19:38,292 INFO L290 TraceCheckUtils]: 21: Hoare triple {1296#false} ~cond := #in~cond; {1296#false} is VALID [2022-04-27 12:19:38,292 INFO L290 TraceCheckUtils]: 22: Hoare triple {1296#false} assume 0 == ~cond; {1296#false} is VALID [2022-04-27 12:19:38,292 INFO L290 TraceCheckUtils]: 23: Hoare triple {1296#false} assume !false; {1296#false} is VALID [2022-04-27 12:19:38,293 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-27 12:19:38,293 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-27 12:19:38,293 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 12:19:38,293 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [309394398] [2022-04-27 12:19:38,293 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 12:19:38,293 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2074772223] [2022-04-27 12:19:38,293 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2074772223] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 12:19:38,293 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 12:19:38,293 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-27 12:19:38,294 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [48921974] [2022-04-27 12:19:38,294 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 12:19:38,294 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 3 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 24 [2022-04-27 12:19:38,294 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 12:19:38,294 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 3 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-27 12:19:38,311 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 12:19:38,312 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-27 12:19:38,312 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 12:19:38,312 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-27 12:19:38,312 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-04-27 12:19:38,312 INFO L87 Difference]: Start difference. First operand 29 states and 32 transitions. Second operand has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 3 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-27 12:19:38,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:19:38,348 INFO L93 Difference]: Finished difference Result 29 states and 32 transitions. [2022-04-27 12:19:38,348 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-27 12:19:38,348 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 3 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 24 [2022-04-27 12:19:38,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 12:19:38,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 3 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-27 12:19:38,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 26 transitions. [2022-04-27 12:19:38,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 3 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-27 12:19:38,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 26 transitions. [2022-04-27 12:19:38,350 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 26 transitions. [2022-04-27 12:19:38,371 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:19:38,371 INFO L225 Difference]: With dead ends: 29 [2022-04-27 12:19:38,371 INFO L226 Difference]: Without dead ends: 0 [2022-04-27 12:19:38,372 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2022-04-27 12:19:38,372 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 2 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 20 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 12:19:38,372 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 20 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 12:19:38,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-04-27 12:19:38,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-04-27 12:19:38,373 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 12:19:38,373 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-27 12:19:38,373 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-27 12:19:38,373 INFO L87 Difference]: Start difference. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-27 12:19:38,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:19:38,373 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-27 12:19:38,374 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-27 12:19:38,374 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 12:19:38,374 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 12:19:38,374 INFO L74 IsIncluded]: Start isIncluded. First operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 0 states. [2022-04-27 12:19:38,374 INFO L87 Difference]: Start difference. First operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 0 states. [2022-04-27 12:19:38,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:19:38,374 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-27 12:19:38,374 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-27 12:19:38,374 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 12:19:38,374 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 12:19:38,374 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 12:19:38,374 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 12:19:38,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-27 12:19:38,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-04-27 12:19:38,375 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 24 [2022-04-27 12:19:38,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 12:19:38,375 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-04-27 12:19:38,375 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 3 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-27 12:19:38,375 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-27 12:19:38,375 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 12:19:38,377 INFO L805 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-27 12:19:38,406 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-04-27 12:19:38,603 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 12:19:38,605 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-04-27 12:19:38,730 INFO L899 garLoopResultBuilder]: For program point reach_errorEXIT(line 12) no Hoare annotation was computed. [2022-04-27 12:19:38,730 INFO L899 garLoopResultBuilder]: For program point reach_errorENTRY(line 12) no Hoare annotation was computed. [2022-04-27 12:19:38,730 INFO L899 garLoopResultBuilder]: For program point L12-1(line 12) no Hoare annotation was computed. [2022-04-27 12:19:38,730 INFO L899 garLoopResultBuilder]: For program point L16(line 16) no Hoare annotation was computed. [2022-04-27 12:19:38,730 INFO L899 garLoopResultBuilder]: For program point L16-2(lines 15 17) no Hoare annotation was computed. [2022-04-27 12:19:38,730 INFO L899 garLoopResultBuilder]: For program point assume_abort_if_notENTRY(lines 15 17) no Hoare annotation was computed. [2022-04-27 12:19:38,730 INFO L899 garLoopResultBuilder]: For program point assume_abort_if_notEXIT(lines 15 17) no Hoare annotation was computed. [2022-04-27 12:19:38,730 INFO L899 garLoopResultBuilder]: For program point mainEXIT(lines 26 50) no Hoare annotation was computed. [2022-04-27 12:19:38,730 INFO L899 garLoopResultBuilder]: For program point L48(line 48) no Hoare annotation was computed. [2022-04-27 12:19:38,730 INFO L899 garLoopResultBuilder]: For program point mainFINAL(lines 26 50) no Hoare annotation was computed. [2022-04-27 12:19:38,730 INFO L899 garLoopResultBuilder]: For program point L38(lines 38 47) no Hoare annotation was computed. [2022-04-27 12:19:38,731 INFO L895 garLoopResultBuilder]: At program point L38-2(lines 38 47) the Hoare annotation is: (or (forall ((main_~b~0 Int)) (= (mod main_~A~0 4294967296) (mod (+ main_~r~0 (* main_~b~0 main_~q~0)) 4294967296))) (not (<= |old(~counter~0)| 0)) (not (<= 0 |old(~counter~0)|))) [2022-04-27 12:19:38,731 INFO L899 garLoopResultBuilder]: For program point L34-1(lines 34 37) no Hoare annotation was computed. [2022-04-27 12:19:38,731 INFO L895 garLoopResultBuilder]: At program point L34-3(lines 34 37) the Hoare annotation is: (or (and (= main_~b~0 1) (= main_~A~0 main_~r~0) (<= 0 ~counter~0) (= main_~q~0 0)) (not (<= |old(~counter~0)| 0)) (and (forall ((main_~b~0 Int)) (= (mod main_~A~0 4294967296) (mod (+ main_~r~0 (* main_~b~0 main_~q~0)) 4294967296))) (<= 1 ~counter~0)) (not (<= 0 |old(~counter~0)|))) [2022-04-27 12:19:38,731 INFO L895 garLoopResultBuilder]: At program point mainENTRY(lines 26 50) the Hoare annotation is: (or (not (<= |old(~counter~0)| 0)) (and (<= 0 ~counter~0) (<= ~counter~0 0)) (not (<= 0 |old(~counter~0)|))) [2022-04-27 12:19:38,731 INFO L899 garLoopResultBuilder]: For program point L43(lines 43 46) no Hoare annotation was computed. [2022-04-27 12:19:38,731 INFO L899 garLoopResultBuilder]: For program point L43-2(lines 26 50) no Hoare annotation was computed. [2022-04-27 12:19:38,731 INFO L895 garLoopResultBuilder]: At program point L39(line 39) the Hoare annotation is: (or (not (<= |old(~counter~0)| 0)) (not (<= 0 |old(~counter~0)|))) [2022-04-27 12:19:38,731 INFO L899 garLoopResultBuilder]: For program point L39-1(lines 38 47) no Hoare annotation was computed. [2022-04-27 12:19:38,731 INFO L899 garLoopResultBuilder]: For program point L35(line 35) no Hoare annotation was computed. [2022-04-27 12:19:38,732 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2022-04-27 12:19:38,732 INFO L895 garLoopResultBuilder]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|)) [2022-04-27 12:19:38,732 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2022-04-27 12:19:38,732 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-04-27 12:19:38,732 INFO L895 garLoopResultBuilder]: At program point L-1(line -1) the Hoare annotation is: (and (<= 0 ~counter~0) (<= ~counter~0 0)) [2022-04-27 12:19:38,732 INFO L902 garLoopResultBuilder]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2022-04-27 12:19:38,732 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-04-27 12:19:38,732 INFO L899 garLoopResultBuilder]: For program point L19-2(lines 18 24) no Hoare annotation was computed. [2022-04-27 12:19:38,732 INFO L902 garLoopResultBuilder]: At program point __VERIFIER_assertENTRY(lines 18 24) the Hoare annotation is: true [2022-04-27 12:19:38,732 INFO L899 garLoopResultBuilder]: For program point __VERIFIER_assertEXIT(lines 18 24) no Hoare annotation was computed. [2022-04-27 12:19:38,732 INFO L899 garLoopResultBuilder]: For program point L20(lines 20 21) no Hoare annotation was computed. [2022-04-27 12:19:38,733 INFO L899 garLoopResultBuilder]: For program point L19(lines 19 22) no Hoare annotation was computed. [2022-04-27 12:19:38,733 INFO L899 garLoopResultBuilder]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 21) no Hoare annotation was computed. [2022-04-27 12:19:38,735 INFO L356 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2022-04-27 12:19:38,737 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-04-27 12:19:38,739 WARN L170 areAnnotationChecker]: reach_errorENTRY has no Hoare annotation [2022-04-27 12:19:38,740 WARN L170 areAnnotationChecker]: reach_errorENTRY has no Hoare annotation [2022-04-27 12:19:38,740 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2022-04-27 12:19:38,741 WARN L170 areAnnotationChecker]: assume_abort_if_notENTRY has no Hoare annotation [2022-04-27 12:19:38,743 WARN L170 areAnnotationChecker]: L19 has no Hoare annotation [2022-04-27 12:19:38,743 WARN L170 areAnnotationChecker]: L12-1 has no Hoare annotation [2022-04-27 12:19:38,743 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2022-04-27 12:19:38,743 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-04-27 12:19:38,744 WARN L170 areAnnotationChecker]: L16 has no Hoare annotation [2022-04-27 12:19:38,744 WARN L170 areAnnotationChecker]: L16 has no Hoare annotation [2022-04-27 12:19:38,744 WARN L170 areAnnotationChecker]: L43-2 has no Hoare annotation [2022-04-27 12:19:38,744 WARN L170 areAnnotationChecker]: L34-1 has no Hoare annotation [2022-04-27 12:19:38,744 WARN L170 areAnnotationChecker]: L19 has no Hoare annotation [2022-04-27 12:19:38,744 WARN L170 areAnnotationChecker]: L19 has no Hoare annotation [2022-04-27 12:19:38,744 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2022-04-27 12:19:38,744 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-04-27 12:19:38,744 WARN L170 areAnnotationChecker]: L16-2 has no Hoare annotation [2022-04-27 12:19:38,744 WARN L170 areAnnotationChecker]: L43-2 has no Hoare annotation [2022-04-27 12:19:38,744 WARN L170 areAnnotationChecker]: L43-2 has no Hoare annotation [2022-04-27 12:19:38,744 WARN L170 areAnnotationChecker]: L34-1 has no Hoare annotation [2022-04-27 12:19:38,744 WARN L170 areAnnotationChecker]: L34-1 has no Hoare annotation [2022-04-27 12:19:38,744 WARN L170 areAnnotationChecker]: L20 has no Hoare annotation [2022-04-27 12:19:38,744 WARN L170 areAnnotationChecker]: L20 has no Hoare annotation [2022-04-27 12:19:38,744 WARN L170 areAnnotationChecker]: L19-2 has no Hoare annotation [2022-04-27 12:19:38,744 WARN L170 areAnnotationChecker]: L48 has no Hoare annotation [2022-04-27 12:19:38,745 WARN L170 areAnnotationChecker]: L38 has no Hoare annotation [2022-04-27 12:19:38,745 WARN L170 areAnnotationChecker]: L38 has no Hoare annotation [2022-04-27 12:19:38,745 WARN L170 areAnnotationChecker]: L35 has no Hoare annotation [2022-04-27 12:19:38,745 WARN L170 areAnnotationChecker]: L35 has no Hoare annotation [2022-04-27 12:19:38,745 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-27 12:19:38,745 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-27 12:19:38,745 WARN L170 areAnnotationChecker]: L48 has no Hoare annotation [2022-04-27 12:19:38,763 WARN L170 areAnnotationChecker]: L39-1 has no Hoare annotation [2022-04-27 12:19:38,763 WARN L170 areAnnotationChecker]: L39-1 has no Hoare annotation [2022-04-27 12:19:38,763 WARN L170 areAnnotationChecker]: L39-1 has no Hoare annotation [2022-04-27 12:19:38,763 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2022-04-27 12:19:38,763 WARN L170 areAnnotationChecker]: L43 has no Hoare annotation [2022-04-27 12:19:38,763 WARN L170 areAnnotationChecker]: L43 has no Hoare annotation [2022-04-27 12:19:38,763 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2022-04-27 12:19:38,763 INFO L163 areAnnotationChecker]: CFG has 5 edges. 5 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2022-04-27 12:19:38,767 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~b~0,QUANTIFIED] [2022-04-27 12:19:38,771 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~b~0,QUANTIFIED] [2022-04-27 12:19:38,772 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.04 12:19:38 BoogieIcfgContainer [2022-04-27 12:19:38,772 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-27 12:19:38,773 INFO L158 Benchmark]: Toolchain (without parser) took 8214.59ms. Allocated memory was 177.2MB in the beginning and 212.9MB in the end (delta: 35.7MB). Free memory was 119.8MB in the beginning and 188.7MB in the end (delta: -68.9MB). Peak memory consumption was 87.9MB. Max. memory is 8.0GB. [2022-04-27 12:19:38,773 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 177.2MB. Free memory is still 136.2MB. There was no memory consumed. Max. memory is 8.0GB. [2022-04-27 12:19:38,773 INFO L158 Benchmark]: CACSL2BoogieTranslator took 253.03ms. Allocated memory is still 177.2MB. Free memory was 119.6MB in the beginning and 152.1MB in the end (delta: -32.6MB). Peak memory consumption was 10.2MB. Max. memory is 8.0GB. [2022-04-27 12:19:38,773 INFO L158 Benchmark]: Boogie Preprocessor took 23.63ms. Allocated memory is still 177.2MB. Free memory was 152.1MB in the beginning and 150.3MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-04-27 12:19:38,774 INFO L158 Benchmark]: RCFGBuilder took 326.99ms. Allocated memory is still 177.2MB. Free memory was 150.3MB in the beginning and 139.2MB in the end (delta: 11.2MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2022-04-27 12:19:38,774 INFO L158 Benchmark]: TraceAbstraction took 7606.78ms. Allocated memory was 177.2MB in the beginning and 212.9MB in the end (delta: 35.7MB). Free memory was 138.5MB in the beginning and 188.7MB in the end (delta: -50.2MB). Peak memory consumption was 107.0MB. Max. memory is 8.0GB. [2022-04-27 12:19:38,775 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.10ms. Allocated memory is still 177.2MB. Free memory is still 136.2MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 253.03ms. Allocated memory is still 177.2MB. Free memory was 119.6MB in the beginning and 152.1MB in the end (delta: -32.6MB). Peak memory consumption was 10.2MB. Max. memory is 8.0GB. * Boogie Preprocessor took 23.63ms. Allocated memory is still 177.2MB. Free memory was 152.1MB in the beginning and 150.3MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 326.99ms. Allocated memory is still 177.2MB. Free memory was 150.3MB in the beginning and 139.2MB in the end (delta: 11.2MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * TraceAbstraction took 7606.78ms. Allocated memory was 177.2MB in the beginning and 212.9MB in the end (delta: 35.7MB). Free memory was 138.5MB in the beginning and 188.7MB in the end (delta: -50.2MB). Peak memory consumption was 107.0MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~b~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~b~0,QUANTIFIED] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 21]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 6 procedures, 33 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 7.5s, OverallIterations: 7, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.1s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 68 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 66 mSDsluCounter, 431 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 28 IncrementalHoareTripleChecker+Unchecked, 271 mSDsCounter, 17 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 130 IncrementalHoareTripleChecker+Invalid, 175 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 17 mSolverCounterUnsat, 160 mSDtfsCounter, 130 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 137 GetRequests, 106 SyntacticMatches, 2 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=35occurred in iteration=4, InterpolantAutomatonStates: 36, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 7 MinimizatonAttempts, 2 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 8 LocationsWithAnnotation, 21 PreInvPairs, 25 NumberOfFragments, 103 HoareAnnotationTreeSize, 21 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 8 FomulaSimplificationsInter, 48 FormulaSimplificationTreeSizeReductionInter, 0.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.8s InterpolantComputationTime, 117 NumberOfCodeBlocks, 117 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 143 ConstructedInterpolants, 8 QuantifiedInterpolants, 522 SizeOfPredicates, 9 NumberOfNonLiveVariables, 411 ConjunctsInSsa, 46 ConjunctsInUnsatCore, 9 InterpolantComputations, 6 PerfectInterpolantSequences, 12/16 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 34]: Loop Invariant [2022-04-27 12:19:38,781 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~b~0,QUANTIFIED] [2022-04-27 12:19:38,781 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~b~0,QUANTIFIED] Derived loop invariant: (((((b == 1 && A == r) && 0 <= counter) && q == 0) || !(\old(counter) <= 0)) || ((forall main_~b~0 : int :: A % 4294967296 == (r + main_~b~0 * q) % 4294967296) && 1 <= counter)) || !(0 <= \old(counter)) RESULT: Ultimate proved your program to be correct! [2022-04-27 12:19:38,793 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...