/usr/bin/java -ea -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --core.log.level.for.class de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/nla-digbench-scaling/hard-u_unwindbound2.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-fb4f59a-m [2022-04-27 13:32:27,532 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-27 13:32:27,535 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-27 13:32:27,608 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-27 13:32:27,608 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-27 13:32:27,609 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-27 13:32:27,610 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-27 13:32:27,627 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-27 13:32:27,629 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-27 13:32:27,630 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-27 13:32:27,630 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-27 13:32:27,631 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-27 13:32:27,632 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-27 13:32:27,632 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-27 13:32:27,633 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-27 13:32:27,634 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-27 13:32:27,638 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-27 13:32:27,643 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-27 13:32:27,646 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-27 13:32:27,652 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-27 13:32:27,656 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-27 13:32:27,657 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-27 13:32:27,659 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-27 13:32:27,661 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-27 13:32:27,663 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-27 13:32:27,670 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-27 13:32:27,670 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-27 13:32:27,670 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-27 13:32:27,671 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-27 13:32:27,672 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-27 13:32:27,673 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-27 13:32:27,673 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-27 13:32:27,675 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-27 13:32:27,676 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-27 13:32:27,676 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-27 13:32:27,677 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-27 13:32:27,677 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-27 13:32:27,678 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-27 13:32:27,678 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-27 13:32:27,678 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-27 13:32:27,679 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-27 13:32:27,681 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-27 13:32:27,682 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2022-04-27 13:32:27,716 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-27 13:32:27,716 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-27 13:32:27,717 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-04-27 13:32:27,717 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-04-27 13:32:27,717 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-04-27 13:32:27,718 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-04-27 13:32:27,718 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-04-27 13:32:27,719 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-04-27 13:32:27,719 INFO L138 SettingsManager]: * Use SBE=true [2022-04-27 13:32:27,720 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-27 13:32:27,720 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-27 13:32:27,720 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-27 13:32:27,720 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-27 13:32:27,720 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-27 13:32:27,720 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-27 13:32:27,721 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-27 13:32:27,721 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-27 13:32:27,721 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-27 13:32:27,722 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-27 13:32:27,722 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-27 13:32:27,723 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-27 13:32:27,723 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-27 13:32:27,723 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-27 13:32:27,723 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-27 13:32:27,723 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 13:32:27,723 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-27 13:32:27,724 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-04-27 13:32:27,724 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-04-27 13:32:27,724 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-04-27 13:32:27,724 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-04-27 13:32:27,725 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-04-27 13:32:27,725 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-04-27 13:32:27,725 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-27 13:32:27,725 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-04-27 13:32:27,995 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-27 13:32:28,036 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-27 13:32:28,038 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-27 13:32:28,039 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-27 13:32:28,040 INFO L275 PluginConnector]: CDTParser initialized [2022-04-27 13:32:28,041 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/nla-digbench-scaling/hard-u_unwindbound2.c [2022-04-27 13:32:28,104 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ba9ca2d1a/54e80222be9e4b9a92cbfc08da214bf5/FLAGb099f9a6a [2022-04-27 13:32:28,527 INFO L306 CDTParser]: Found 1 translation units. [2022-04-27 13:32:28,527 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/hard-u_unwindbound2.c [2022-04-27 13:32:28,536 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ba9ca2d1a/54e80222be9e4b9a92cbfc08da214bf5/FLAGb099f9a6a [2022-04-27 13:32:28,930 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ba9ca2d1a/54e80222be9e4b9a92cbfc08da214bf5 [2022-04-27 13:32:28,932 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-27 13:32:28,934 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-27 13:32:28,938 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-27 13:32:28,938 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-27 13:32:28,941 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-27 13:32:28,943 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 01:32:28" (1/1) ... [2022-04-27 13:32:28,944 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4c0fef69 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 01:32:28, skipping insertion in model container [2022-04-27 13:32:28,944 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 01:32:28" (1/1) ... [2022-04-27 13:32:28,951 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-27 13:32:28,968 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-27 13:32:29,118 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/hard-u_unwindbound2.c[537,550] [2022-04-27 13:32:29,136 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 13:32:29,145 INFO L203 MainTranslator]: Completed pre-run [2022-04-27 13:32:29,156 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/hard-u_unwindbound2.c[537,550] [2022-04-27 13:32:29,164 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 13:32:29,175 INFO L208 MainTranslator]: Completed translation [2022-04-27 13:32:29,175 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 01:32:29 WrapperNode [2022-04-27 13:32:29,175 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-27 13:32:29,176 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-27 13:32:29,176 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-27 13:32:29,176 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-27 13:32:29,185 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 01:32:29" (1/1) ... [2022-04-27 13:32:29,186 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 01:32:29" (1/1) ... [2022-04-27 13:32:29,203 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 01:32:29" (1/1) ... [2022-04-27 13:32:29,203 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 01:32:29" (1/1) ... [2022-04-27 13:32:29,216 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 01:32:29" (1/1) ... [2022-04-27 13:32:29,220 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 01:32:29" (1/1) ... [2022-04-27 13:32:29,221 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 01:32:29" (1/1) ... [2022-04-27 13:32:29,223 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-27 13:32:29,224 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-27 13:32:29,224 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-27 13:32:29,224 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-27 13:32:29,225 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 01:32:29" (1/1) ... [2022-04-27 13:32:29,232 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 13:32:29,241 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 13:32:29,253 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-04-27 13:32:29,275 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-04-27 13:32:29,292 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-27 13:32:29,292 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-27 13:32:29,292 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-27 13:32:29,292 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-27 13:32:29,292 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-27 13:32:29,293 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-27 13:32:29,293 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-27 13:32:29,293 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-27 13:32:29,293 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-27 13:32:29,293 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-27 13:32:29,293 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uint [2022-04-27 13:32:29,293 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-27 13:32:29,293 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-27 13:32:29,294 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-27 13:32:29,294 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-27 13:32:29,294 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-27 13:32:29,294 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-27 13:32:29,294 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-27 13:32:29,294 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-27 13:32:29,294 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-27 13:32:29,345 INFO L234 CfgBuilder]: Building ICFG [2022-04-27 13:32:29,347 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-27 13:32:29,557 INFO L275 CfgBuilder]: Performing block encoding [2022-04-27 13:32:29,579 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-27 13:32:29,579 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-04-27 13:32:29,581 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 01:32:29 BoogieIcfgContainer [2022-04-27 13:32:29,581 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-27 13:32:29,582 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-27 13:32:29,583 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-27 13:32:29,586 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-27 13:32:29,587 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.04 01:32:28" (1/3) ... [2022-04-27 13:32:29,587 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4567a98 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 01:32:29, skipping insertion in model container [2022-04-27 13:32:29,588 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 01:32:29" (2/3) ... [2022-04-27 13:32:29,588 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4567a98 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 01:32:29, skipping insertion in model container [2022-04-27 13:32:29,588 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 01:32:29" (3/3) ... [2022-04-27 13:32:29,589 INFO L111 eAbstractionObserver]: Analyzing ICFG hard-u_unwindbound2.c [2022-04-27 13:32:29,620 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-04-27 13:32:29,620 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-27 13:32:29,712 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-27 13:32:29,730 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@79017eb3, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@524d0a2f [2022-04-27 13:32:29,731 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-27 13:32:29,742 INFO L276 IsEmpty]: Start isEmpty. Operand has 37 states, 21 states have (on average 1.4761904761904763) internal successors, (31), 22 states have internal predecessors, (31), 10 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-27 13:32:29,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-04-27 13:32:29,749 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 13:32:29,750 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 13:32:29,750 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 13:32:29,760 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 13:32:29,760 INFO L85 PathProgramCache]: Analyzing trace with hash 1191571617, now seen corresponding path program 1 times [2022-04-27 13:32:29,773 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 13:32:29,774 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1778488689] [2022-04-27 13:32:29,775 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:32:29,776 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 13:32:29,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:32:29,916 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 13:32:29,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:32:29,940 INFO L290 TraceCheckUtils]: 0: Hoare triple {49#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {40#true} is VALID [2022-04-27 13:32:29,941 INFO L290 TraceCheckUtils]: 1: Hoare triple {40#true} assume true; {40#true} is VALID [2022-04-27 13:32:29,941 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {40#true} {40#true} #96#return; {40#true} is VALID [2022-04-27 13:32:29,942 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-27 13:32:29,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:32:29,963 INFO L290 TraceCheckUtils]: 0: Hoare triple {40#true} ~cond := #in~cond; {40#true} is VALID [2022-04-27 13:32:29,972 INFO L290 TraceCheckUtils]: 1: Hoare triple {40#true} assume 0 == ~cond;assume false; {41#false} is VALID [2022-04-27 13:32:29,972 INFO L290 TraceCheckUtils]: 2: Hoare triple {41#false} assume true; {41#false} is VALID [2022-04-27 13:32:29,973 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {41#false} {40#true} #80#return; {41#false} is VALID [2022-04-27 13:32:29,974 INFO L272 TraceCheckUtils]: 0: Hoare triple {40#true} call ULTIMATE.init(); {49#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 13:32:29,974 INFO L290 TraceCheckUtils]: 1: Hoare triple {49#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {40#true} is VALID [2022-04-27 13:32:29,975 INFO L290 TraceCheckUtils]: 2: Hoare triple {40#true} assume true; {40#true} is VALID [2022-04-27 13:32:29,975 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {40#true} {40#true} #96#return; {40#true} is VALID [2022-04-27 13:32:29,975 INFO L272 TraceCheckUtils]: 4: Hoare triple {40#true} call #t~ret8 := main(); {40#true} is VALID [2022-04-27 13:32:29,975 INFO L290 TraceCheckUtils]: 5: Hoare triple {40#true} havoc ~A~0;havoc ~B~0;havoc ~r~0;havoc ~d~0;havoc ~p~0;havoc ~q~0;~A~0 := #t~nondet4;havoc #t~nondet4;~B~0 := #t~nondet5;havoc #t~nondet5; {40#true} is VALID [2022-04-27 13:32:29,975 INFO L272 TraceCheckUtils]: 6: Hoare triple {40#true} call assume_abort_if_not((if ~B~0 % 4294967296 >= 1 then 1 else 0)); {40#true} is VALID [2022-04-27 13:32:29,976 INFO L290 TraceCheckUtils]: 7: Hoare triple {40#true} ~cond := #in~cond; {40#true} is VALID [2022-04-27 13:32:29,976 INFO L290 TraceCheckUtils]: 8: Hoare triple {40#true} assume 0 == ~cond;assume false; {41#false} is VALID [2022-04-27 13:32:29,977 INFO L290 TraceCheckUtils]: 9: Hoare triple {41#false} assume true; {41#false} is VALID [2022-04-27 13:32:29,977 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {41#false} {40#true} #80#return; {41#false} is VALID [2022-04-27 13:32:29,977 INFO L290 TraceCheckUtils]: 11: Hoare triple {41#false} ~r~0 := ~A~0;~d~0 := ~B~0;~p~0 := 1;~q~0 := 0; {41#false} is VALID [2022-04-27 13:32:29,977 INFO L290 TraceCheckUtils]: 12: Hoare triple {41#false} assume !true; {41#false} is VALID [2022-04-27 13:32:29,977 INFO L290 TraceCheckUtils]: 13: Hoare triple {41#false} assume !true; {41#false} is VALID [2022-04-27 13:32:29,978 INFO L272 TraceCheckUtils]: 14: Hoare triple {41#false} call __VERIFIER_assert((if ~A~0 % 4294967296 == (~d~0 * ~q~0 + ~r~0) % 4294967296 then 1 else 0)); {41#false} is VALID [2022-04-27 13:32:29,978 INFO L290 TraceCheckUtils]: 15: Hoare triple {41#false} ~cond := #in~cond; {41#false} is VALID [2022-04-27 13:32:29,978 INFO L290 TraceCheckUtils]: 16: Hoare triple {41#false} assume 0 == ~cond; {41#false} is VALID [2022-04-27 13:32:29,978 INFO L290 TraceCheckUtils]: 17: Hoare triple {41#false} assume !false; {41#false} is VALID [2022-04-27 13:32:29,979 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 13:32:29,979 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 13:32:29,979 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1778488689] [2022-04-27 13:32:29,980 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1778488689] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 13:32:29,980 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 13:32:29,980 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-27 13:32:29,982 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1251346686] [2022-04-27 13:32:29,982 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 13:32:29,988 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 18 [2022-04-27 13:32:29,989 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 13:32:29,992 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-27 13:32:30,034 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 13:32:30,034 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-27 13:32:30,035 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 13:32:30,054 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-27 13:32:30,054 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-27 13:32:30,057 INFO L87 Difference]: Start difference. First operand has 37 states, 21 states have (on average 1.4761904761904763) internal successors, (31), 22 states have internal predecessors, (31), 10 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-27 13:32:30,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:32:30,308 INFO L93 Difference]: Finished difference Result 66 states and 101 transitions. [2022-04-27 13:32:30,308 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-27 13:32:30,309 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 18 [2022-04-27 13:32:30,309 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 13:32:30,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-27 13:32:30,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 101 transitions. [2022-04-27 13:32:30,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-27 13:32:30,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 101 transitions. [2022-04-27 13:32:30,346 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 101 transitions. [2022-04-27 13:32:30,483 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 101 edges. 101 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 13:32:30,495 INFO L225 Difference]: With dead ends: 66 [2022-04-27 13:32:30,495 INFO L226 Difference]: Without dead ends: 33 [2022-04-27 13:32:30,499 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-27 13:32:30,506 INFO L413 NwaCegarLoop]: 45 mSDtfsCounter, 10 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 49 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-27 13:32:30,509 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 49 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-27 13:32:30,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2022-04-27 13:32:30,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 32. [2022-04-27 13:32:30,553 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 13:32:30,554 INFO L82 GeneralOperation]: Start isEquivalent. First operand 33 states. Second operand has 32 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 19 states have internal predecessors, (24), 10 states have call successors, (10), 4 states have call predecessors, (10), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-27 13:32:30,555 INFO L74 IsIncluded]: Start isIncluded. First operand 33 states. Second operand has 32 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 19 states have internal predecessors, (24), 10 states have call successors, (10), 4 states have call predecessors, (10), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-27 13:32:30,556 INFO L87 Difference]: Start difference. First operand 33 states. Second operand has 32 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 19 states have internal predecessors, (24), 10 states have call successors, (10), 4 states have call predecessors, (10), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-27 13:32:30,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:32:30,560 INFO L93 Difference]: Finished difference Result 33 states and 43 transitions. [2022-04-27 13:32:30,561 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 43 transitions. [2022-04-27 13:32:30,561 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:32:30,561 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:32:30,562 INFO L74 IsIncluded]: Start isIncluded. First operand has 32 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 19 states have internal predecessors, (24), 10 states have call successors, (10), 4 states have call predecessors, (10), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand 33 states. [2022-04-27 13:32:30,562 INFO L87 Difference]: Start difference. First operand has 32 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 19 states have internal predecessors, (24), 10 states have call successors, (10), 4 states have call predecessors, (10), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand 33 states. [2022-04-27 13:32:30,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:32:30,566 INFO L93 Difference]: Finished difference Result 33 states and 43 transitions. [2022-04-27 13:32:30,567 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 43 transitions. [2022-04-27 13:32:30,567 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:32:30,567 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:32:30,568 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 13:32:30,568 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 13:32:30,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 19 states have internal predecessors, (24), 10 states have call successors, (10), 4 states have call predecessors, (10), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-27 13:32:30,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 42 transitions. [2022-04-27 13:32:30,572 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 42 transitions. Word has length 18 [2022-04-27 13:32:30,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 13:32:30,573 INFO L495 AbstractCegarLoop]: Abstraction has 32 states and 42 transitions. [2022-04-27 13:32:30,573 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-27 13:32:30,573 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 42 transitions. [2022-04-27 13:32:30,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-04-27 13:32:30,574 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 13:32:30,574 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 13:32:30,575 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-27 13:32:30,575 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 13:32:30,575 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 13:32:30,576 INFO L85 PathProgramCache]: Analyzing trace with hash 336486197, now seen corresponding path program 1 times [2022-04-27 13:32:30,576 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 13:32:30,576 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1580876977] [2022-04-27 13:32:30,576 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:32:30,576 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 13:32:30,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:32:30,666 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 13:32:30,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:32:30,676 INFO L290 TraceCheckUtils]: 0: Hoare triple {268#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {256#true} is VALID [2022-04-27 13:32:30,676 INFO L290 TraceCheckUtils]: 1: Hoare triple {256#true} assume true; {256#true} is VALID [2022-04-27 13:32:30,676 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {256#true} {256#true} #96#return; {256#true} is VALID [2022-04-27 13:32:30,676 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-27 13:32:30,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:32:30,683 INFO L290 TraceCheckUtils]: 0: Hoare triple {256#true} ~cond := #in~cond; {256#true} is VALID [2022-04-27 13:32:30,684 INFO L290 TraceCheckUtils]: 1: Hoare triple {256#true} assume !(0 == ~cond); {256#true} is VALID [2022-04-27 13:32:30,684 INFO L290 TraceCheckUtils]: 2: Hoare triple {256#true} assume true; {256#true} is VALID [2022-04-27 13:32:30,684 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {256#true} {256#true} #80#return; {256#true} is VALID [2022-04-27 13:32:30,685 INFO L272 TraceCheckUtils]: 0: Hoare triple {256#true} call ULTIMATE.init(); {268#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 13:32:30,685 INFO L290 TraceCheckUtils]: 1: Hoare triple {268#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {256#true} is VALID [2022-04-27 13:32:30,686 INFO L290 TraceCheckUtils]: 2: Hoare triple {256#true} assume true; {256#true} is VALID [2022-04-27 13:32:30,686 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {256#true} {256#true} #96#return; {256#true} is VALID [2022-04-27 13:32:30,686 INFO L272 TraceCheckUtils]: 4: Hoare triple {256#true} call #t~ret8 := main(); {256#true} is VALID [2022-04-27 13:32:30,686 INFO L290 TraceCheckUtils]: 5: Hoare triple {256#true} havoc ~A~0;havoc ~B~0;havoc ~r~0;havoc ~d~0;havoc ~p~0;havoc ~q~0;~A~0 := #t~nondet4;havoc #t~nondet4;~B~0 := #t~nondet5;havoc #t~nondet5; {256#true} is VALID [2022-04-27 13:32:30,686 INFO L272 TraceCheckUtils]: 6: Hoare triple {256#true} call assume_abort_if_not((if ~B~0 % 4294967296 >= 1 then 1 else 0)); {256#true} is VALID [2022-04-27 13:32:30,687 INFO L290 TraceCheckUtils]: 7: Hoare triple {256#true} ~cond := #in~cond; {256#true} is VALID [2022-04-27 13:32:30,687 INFO L290 TraceCheckUtils]: 8: Hoare triple {256#true} assume !(0 == ~cond); {256#true} is VALID [2022-04-27 13:32:30,687 INFO L290 TraceCheckUtils]: 9: Hoare triple {256#true} assume true; {256#true} is VALID [2022-04-27 13:32:30,687 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {256#true} {256#true} #80#return; {256#true} is VALID [2022-04-27 13:32:30,688 INFO L290 TraceCheckUtils]: 11: Hoare triple {256#true} ~r~0 := ~A~0;~d~0 := ~B~0;~p~0 := 1;~q~0 := 0; {265#(= main_~q~0 0)} is VALID [2022-04-27 13:32:30,688 INFO L290 TraceCheckUtils]: 12: Hoare triple {265#(= main_~q~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {265#(= main_~q~0 0)} is VALID [2022-04-27 13:32:30,688 INFO L290 TraceCheckUtils]: 13: Hoare triple {265#(= main_~q~0 0)} assume !!(#t~post6 < 2);havoc #t~post6; {265#(= main_~q~0 0)} is VALID [2022-04-27 13:32:30,689 INFO L272 TraceCheckUtils]: 14: Hoare triple {265#(= main_~q~0 0)} call __VERIFIER_assert((if 0 == ~q~0 % 4294967296 then 1 else 0)); {266#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 13:32:30,690 INFO L290 TraceCheckUtils]: 15: Hoare triple {266#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {267#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-27 13:32:30,690 INFO L290 TraceCheckUtils]: 16: Hoare triple {267#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {257#false} is VALID [2022-04-27 13:32:30,691 INFO L290 TraceCheckUtils]: 17: Hoare triple {257#false} assume !false; {257#false} is VALID [2022-04-27 13:32:30,691 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 13:32:30,691 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 13:32:30,691 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1580876977] [2022-04-27 13:32:30,691 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1580876977] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 13:32:30,692 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 13:32:30,692 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-27 13:32:30,692 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1655159241] [2022-04-27 13:32:30,692 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 13:32:30,693 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.0) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 18 [2022-04-27 13:32:30,694 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 13:32:30,694 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 2.0) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-27 13:32:30,719 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 13:32:30,719 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-27 13:32:30,720 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 13:32:30,720 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-27 13:32:30,720 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-27 13:32:30,721 INFO L87 Difference]: Start difference. First operand 32 states and 42 transitions. Second operand has 6 states, 6 states have (on average 2.0) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-27 13:32:31,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:32:31,235 INFO L93 Difference]: Finished difference Result 47 states and 62 transitions. [2022-04-27 13:32:31,235 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-27 13:32:31,236 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.0) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 18 [2022-04-27 13:32:31,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 13:32:31,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.0) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-27 13:32:31,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 62 transitions. [2022-04-27 13:32:31,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.0) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-27 13:32:31,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 62 transitions. [2022-04-27 13:32:31,247 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 62 transitions. [2022-04-27 13:32:31,322 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 62 edges. 62 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 13:32:31,326 INFO L225 Difference]: With dead ends: 47 [2022-04-27 13:32:31,326 INFO L226 Difference]: Without dead ends: 45 [2022-04-27 13:32:31,330 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2022-04-27 13:32:31,333 INFO L413 NwaCegarLoop]: 39 mSDtfsCounter, 28 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 99 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 90 SdHoareTripleChecker+Invalid, 113 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 99 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-27 13:32:31,333 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 90 Invalid, 113 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 99 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-27 13:32:31,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2022-04-27 13:32:31,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 36. [2022-04-27 13:32:31,348 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 13:32:31,349 INFO L82 GeneralOperation]: Start isEquivalent. First operand 45 states. Second operand has 36 states, 21 states have (on average 1.2857142857142858) internal successors, (27), 22 states have internal predecessors, (27), 10 states have call successors, (10), 5 states have call predecessors, (10), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-27 13:32:31,351 INFO L74 IsIncluded]: Start isIncluded. First operand 45 states. Second operand has 36 states, 21 states have (on average 1.2857142857142858) internal successors, (27), 22 states have internal predecessors, (27), 10 states have call successors, (10), 5 states have call predecessors, (10), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-27 13:32:31,353 INFO L87 Difference]: Start difference. First operand 45 states. Second operand has 36 states, 21 states have (on average 1.2857142857142858) internal successors, (27), 22 states have internal predecessors, (27), 10 states have call successors, (10), 5 states have call predecessors, (10), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-27 13:32:31,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:32:31,366 INFO L93 Difference]: Finished difference Result 45 states and 60 transitions. [2022-04-27 13:32:31,366 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 60 transitions. [2022-04-27 13:32:31,372 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:32:31,372 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:32:31,372 INFO L74 IsIncluded]: Start isIncluded. First operand has 36 states, 21 states have (on average 1.2857142857142858) internal successors, (27), 22 states have internal predecessors, (27), 10 states have call successors, (10), 5 states have call predecessors, (10), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand 45 states. [2022-04-27 13:32:31,373 INFO L87 Difference]: Start difference. First operand has 36 states, 21 states have (on average 1.2857142857142858) internal successors, (27), 22 states have internal predecessors, (27), 10 states have call successors, (10), 5 states have call predecessors, (10), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand 45 states. [2022-04-27 13:32:31,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:32:31,376 INFO L93 Difference]: Finished difference Result 45 states and 60 transitions. [2022-04-27 13:32:31,376 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 60 transitions. [2022-04-27 13:32:31,377 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:32:31,377 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:32:31,377 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 13:32:31,377 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 13:32:31,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 21 states have (on average 1.2857142857142858) internal successors, (27), 22 states have internal predecessors, (27), 10 states have call successors, (10), 5 states have call predecessors, (10), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-27 13:32:31,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 45 transitions. [2022-04-27 13:32:31,380 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 45 transitions. Word has length 18 [2022-04-27 13:32:31,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 13:32:31,380 INFO L495 AbstractCegarLoop]: Abstraction has 36 states and 45 transitions. [2022-04-27 13:32:31,380 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.0) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-27 13:32:31,381 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 45 transitions. [2022-04-27 13:32:31,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-04-27 13:32:31,381 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 13:32:31,381 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 13:32:31,381 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-27 13:32:31,382 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 13:32:31,382 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 13:32:31,382 INFO L85 PathProgramCache]: Analyzing trace with hash -1819267188, now seen corresponding path program 1 times [2022-04-27 13:32:31,383 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 13:32:31,383 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1478338862] [2022-04-27 13:32:31,384 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:32:31,385 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 13:32:31,404 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 13:32:31,404 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1690189229] [2022-04-27 13:32:31,404 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:32:31,404 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 13:32:31,405 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 13:32:31,406 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 13:32:31,413 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-04-27 13:32:31,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:32:31,459 INFO L263 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 5 conjunts are in the unsatisfiable core [2022-04-27 13:32:31,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:32:31,499 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 13:32:31,709 INFO L272 TraceCheckUtils]: 0: Hoare triple {489#true} call ULTIMATE.init(); {489#true} is VALID [2022-04-27 13:32:31,710 INFO L290 TraceCheckUtils]: 1: Hoare triple {489#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {497#(<= ~counter~0 0)} is VALID [2022-04-27 13:32:31,711 INFO L290 TraceCheckUtils]: 2: Hoare triple {497#(<= ~counter~0 0)} assume true; {497#(<= ~counter~0 0)} is VALID [2022-04-27 13:32:31,711 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {497#(<= ~counter~0 0)} {489#true} #96#return; {497#(<= ~counter~0 0)} is VALID [2022-04-27 13:32:31,712 INFO L272 TraceCheckUtils]: 4: Hoare triple {497#(<= ~counter~0 0)} call #t~ret8 := main(); {497#(<= ~counter~0 0)} is VALID [2022-04-27 13:32:31,712 INFO L290 TraceCheckUtils]: 5: Hoare triple {497#(<= ~counter~0 0)} havoc ~A~0;havoc ~B~0;havoc ~r~0;havoc ~d~0;havoc ~p~0;havoc ~q~0;~A~0 := #t~nondet4;havoc #t~nondet4;~B~0 := #t~nondet5;havoc #t~nondet5; {497#(<= ~counter~0 0)} is VALID [2022-04-27 13:32:31,713 INFO L272 TraceCheckUtils]: 6: Hoare triple {497#(<= ~counter~0 0)} call assume_abort_if_not((if ~B~0 % 4294967296 >= 1 then 1 else 0)); {497#(<= ~counter~0 0)} is VALID [2022-04-27 13:32:31,714 INFO L290 TraceCheckUtils]: 7: Hoare triple {497#(<= ~counter~0 0)} ~cond := #in~cond; {497#(<= ~counter~0 0)} is VALID [2022-04-27 13:32:31,714 INFO L290 TraceCheckUtils]: 8: Hoare triple {497#(<= ~counter~0 0)} assume !(0 == ~cond); {497#(<= ~counter~0 0)} is VALID [2022-04-27 13:32:31,720 INFO L290 TraceCheckUtils]: 9: Hoare triple {497#(<= ~counter~0 0)} assume true; {497#(<= ~counter~0 0)} is VALID [2022-04-27 13:32:31,721 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {497#(<= ~counter~0 0)} {497#(<= ~counter~0 0)} #80#return; {497#(<= ~counter~0 0)} is VALID [2022-04-27 13:32:31,722 INFO L290 TraceCheckUtils]: 11: Hoare triple {497#(<= ~counter~0 0)} ~r~0 := ~A~0;~d~0 := ~B~0;~p~0 := 1;~q~0 := 0; {497#(<= ~counter~0 0)} is VALID [2022-04-27 13:32:31,722 INFO L290 TraceCheckUtils]: 12: Hoare triple {497#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {531#(<= |main_#t~post6| 0)} is VALID [2022-04-27 13:32:31,723 INFO L290 TraceCheckUtils]: 13: Hoare triple {531#(<= |main_#t~post6| 0)} assume !(#t~post6 < 2);havoc #t~post6; {490#false} is VALID [2022-04-27 13:32:31,723 INFO L290 TraceCheckUtils]: 14: Hoare triple {490#false} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {490#false} is VALID [2022-04-27 13:32:31,723 INFO L290 TraceCheckUtils]: 15: Hoare triple {490#false} assume !(#t~post7 < 2);havoc #t~post7; {490#false} is VALID [2022-04-27 13:32:31,724 INFO L272 TraceCheckUtils]: 16: Hoare triple {490#false} call __VERIFIER_assert((if ~A~0 % 4294967296 == (~d~0 * ~q~0 + ~r~0) % 4294967296 then 1 else 0)); {490#false} is VALID [2022-04-27 13:32:31,724 INFO L290 TraceCheckUtils]: 17: Hoare triple {490#false} ~cond := #in~cond; {490#false} is VALID [2022-04-27 13:32:31,724 INFO L290 TraceCheckUtils]: 18: Hoare triple {490#false} assume 0 == ~cond; {490#false} is VALID [2022-04-27 13:32:31,724 INFO L290 TraceCheckUtils]: 19: Hoare triple {490#false} assume !false; {490#false} is VALID [2022-04-27 13:32:31,724 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 13:32:31,724 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-27 13:32:31,725 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 13:32:31,725 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1478338862] [2022-04-27 13:32:31,727 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 13:32:31,727 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1690189229] [2022-04-27 13:32:31,728 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1690189229] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 13:32:31,728 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 13:32:31,728 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-27 13:32:31,728 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1966586717] [2022-04-27 13:32:31,728 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 13:32:31,728 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 20 [2022-04-27 13:32:31,729 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 13:32:31,729 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-27 13:32:31,760 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 13:32:31,760 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-27 13:32:31,760 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 13:32:31,761 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-27 13:32:31,761 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-27 13:32:31,761 INFO L87 Difference]: Start difference. First operand 36 states and 45 transitions. Second operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-27 13:32:31,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:32:31,897 INFO L93 Difference]: Finished difference Result 52 states and 67 transitions. [2022-04-27 13:32:31,897 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-27 13:32:31,898 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 20 [2022-04-27 13:32:31,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 13:32:31,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-27 13:32:31,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 64 transitions. [2022-04-27 13:32:31,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-27 13:32:31,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 64 transitions. [2022-04-27 13:32:31,902 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 64 transitions. [2022-04-27 13:32:31,973 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 64 edges. 64 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 13:32:31,975 INFO L225 Difference]: With dead ends: 52 [2022-04-27 13:32:31,975 INFO L226 Difference]: Without dead ends: 38 [2022-04-27 13:32:31,975 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-27 13:32:31,976 INFO L413 NwaCegarLoop]: 40 mSDtfsCounter, 0 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 107 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 13:32:31,977 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 107 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 13:32:31,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2022-04-27 13:32:31,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2022-04-27 13:32:31,985 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 13:32:31,986 INFO L82 GeneralOperation]: Start isEquivalent. First operand 38 states. Second operand has 38 states, 23 states have (on average 1.2608695652173914) internal successors, (29), 24 states have internal predecessors, (29), 10 states have call successors, (10), 5 states have call predecessors, (10), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-27 13:32:31,986 INFO L74 IsIncluded]: Start isIncluded. First operand 38 states. Second operand has 38 states, 23 states have (on average 1.2608695652173914) internal successors, (29), 24 states have internal predecessors, (29), 10 states have call successors, (10), 5 states have call predecessors, (10), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-27 13:32:31,986 INFO L87 Difference]: Start difference. First operand 38 states. Second operand has 38 states, 23 states have (on average 1.2608695652173914) internal successors, (29), 24 states have internal predecessors, (29), 10 states have call successors, (10), 5 states have call predecessors, (10), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-27 13:32:31,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:32:31,989 INFO L93 Difference]: Finished difference Result 38 states and 47 transitions. [2022-04-27 13:32:31,989 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 47 transitions. [2022-04-27 13:32:31,990 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:32:31,990 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:32:31,990 INFO L74 IsIncluded]: Start isIncluded. First operand has 38 states, 23 states have (on average 1.2608695652173914) internal successors, (29), 24 states have internal predecessors, (29), 10 states have call successors, (10), 5 states have call predecessors, (10), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand 38 states. [2022-04-27 13:32:31,991 INFO L87 Difference]: Start difference. First operand has 38 states, 23 states have (on average 1.2608695652173914) internal successors, (29), 24 states have internal predecessors, (29), 10 states have call successors, (10), 5 states have call predecessors, (10), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand 38 states. [2022-04-27 13:32:31,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:32:31,993 INFO L93 Difference]: Finished difference Result 38 states and 47 transitions. [2022-04-27 13:32:31,993 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 47 transitions. [2022-04-27 13:32:31,994 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:32:31,994 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:32:31,994 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 13:32:31,994 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 13:32:31,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 23 states have (on average 1.2608695652173914) internal successors, (29), 24 states have internal predecessors, (29), 10 states have call successors, (10), 5 states have call predecessors, (10), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-27 13:32:31,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 47 transitions. [2022-04-27 13:32:31,996 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 47 transitions. Word has length 20 [2022-04-27 13:32:31,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 13:32:31,997 INFO L495 AbstractCegarLoop]: Abstraction has 38 states and 47 transitions. [2022-04-27 13:32:31,997 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-27 13:32:31,997 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 47 transitions. [2022-04-27 13:32:31,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-04-27 13:32:31,998 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 13:32:31,998 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 13:32:32,031 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-04-27 13:32:32,221 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 13:32:32,221 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 13:32:32,222 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 13:32:32,222 INFO L85 PathProgramCache]: Analyzing trace with hash -784889968, now seen corresponding path program 1 times [2022-04-27 13:32:32,222 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 13:32:32,222 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [454084445] [2022-04-27 13:32:32,222 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:32:32,223 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 13:32:32,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:32:32,333 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 13:32:32,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:32:32,350 INFO L290 TraceCheckUtils]: 0: Hoare triple {773#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {757#true} is VALID [2022-04-27 13:32:32,351 INFO L290 TraceCheckUtils]: 1: Hoare triple {757#true} assume true; {757#true} is VALID [2022-04-27 13:32:32,351 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {757#true} {757#true} #96#return; {757#true} is VALID [2022-04-27 13:32:32,351 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-27 13:32:32,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:32:32,357 INFO L290 TraceCheckUtils]: 0: Hoare triple {757#true} ~cond := #in~cond; {757#true} is VALID [2022-04-27 13:32:32,358 INFO L290 TraceCheckUtils]: 1: Hoare triple {757#true} assume !(0 == ~cond); {757#true} is VALID [2022-04-27 13:32:32,358 INFO L290 TraceCheckUtils]: 2: Hoare triple {757#true} assume true; {757#true} is VALID [2022-04-27 13:32:32,358 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {757#true} {757#true} #80#return; {757#true} is VALID [2022-04-27 13:32:32,358 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-04-27 13:32:32,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:32:32,373 INFO L290 TraceCheckUtils]: 0: Hoare triple {757#true} ~cond := #in~cond; {757#true} is VALID [2022-04-27 13:32:32,374 INFO L290 TraceCheckUtils]: 1: Hoare triple {757#true} assume !(0 == ~cond); {757#true} is VALID [2022-04-27 13:32:32,374 INFO L290 TraceCheckUtils]: 2: Hoare triple {757#true} assume true; {757#true} is VALID [2022-04-27 13:32:32,375 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {757#true} {766#(= (+ main_~A~0 (* (- 1) main_~r~0)) 0)} #82#return; {766#(= (+ main_~A~0 (* (- 1) main_~r~0)) 0)} is VALID [2022-04-27 13:32:32,376 INFO L272 TraceCheckUtils]: 0: Hoare triple {757#true} call ULTIMATE.init(); {773#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 13:32:32,376 INFO L290 TraceCheckUtils]: 1: Hoare triple {773#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {757#true} is VALID [2022-04-27 13:32:32,377 INFO L290 TraceCheckUtils]: 2: Hoare triple {757#true} assume true; {757#true} is VALID [2022-04-27 13:32:32,377 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {757#true} {757#true} #96#return; {757#true} is VALID [2022-04-27 13:32:32,377 INFO L272 TraceCheckUtils]: 4: Hoare triple {757#true} call #t~ret8 := main(); {757#true} is VALID [2022-04-27 13:32:32,377 INFO L290 TraceCheckUtils]: 5: Hoare triple {757#true} havoc ~A~0;havoc ~B~0;havoc ~r~0;havoc ~d~0;havoc ~p~0;havoc ~q~0;~A~0 := #t~nondet4;havoc #t~nondet4;~B~0 := #t~nondet5;havoc #t~nondet5; {757#true} is VALID [2022-04-27 13:32:32,377 INFO L272 TraceCheckUtils]: 6: Hoare triple {757#true} call assume_abort_if_not((if ~B~0 % 4294967296 >= 1 then 1 else 0)); {757#true} is VALID [2022-04-27 13:32:32,377 INFO L290 TraceCheckUtils]: 7: Hoare triple {757#true} ~cond := #in~cond; {757#true} is VALID [2022-04-27 13:32:32,378 INFO L290 TraceCheckUtils]: 8: Hoare triple {757#true} assume !(0 == ~cond); {757#true} is VALID [2022-04-27 13:32:32,378 INFO L290 TraceCheckUtils]: 9: Hoare triple {757#true} assume true; {757#true} is VALID [2022-04-27 13:32:32,378 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {757#true} {757#true} #80#return; {757#true} is VALID [2022-04-27 13:32:32,382 INFO L290 TraceCheckUtils]: 11: Hoare triple {757#true} ~r~0 := ~A~0;~d~0 := ~B~0;~p~0 := 1;~q~0 := 0; {766#(= (+ main_~A~0 (* (- 1) main_~r~0)) 0)} is VALID [2022-04-27 13:32:32,383 INFO L290 TraceCheckUtils]: 12: Hoare triple {766#(= (+ main_~A~0 (* (- 1) main_~r~0)) 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {766#(= (+ main_~A~0 (* (- 1) main_~r~0)) 0)} is VALID [2022-04-27 13:32:32,383 INFO L290 TraceCheckUtils]: 13: Hoare triple {766#(= (+ main_~A~0 (* (- 1) main_~r~0)) 0)} assume !!(#t~post6 < 2);havoc #t~post6; {766#(= (+ main_~A~0 (* (- 1) main_~r~0)) 0)} is VALID [2022-04-27 13:32:32,383 INFO L272 TraceCheckUtils]: 14: Hoare triple {766#(= (+ main_~A~0 (* (- 1) main_~r~0)) 0)} call __VERIFIER_assert((if 0 == ~q~0 % 4294967296 then 1 else 0)); {757#true} is VALID [2022-04-27 13:32:32,384 INFO L290 TraceCheckUtils]: 15: Hoare triple {757#true} ~cond := #in~cond; {757#true} is VALID [2022-04-27 13:32:32,384 INFO L290 TraceCheckUtils]: 16: Hoare triple {757#true} assume !(0 == ~cond); {757#true} is VALID [2022-04-27 13:32:32,384 INFO L290 TraceCheckUtils]: 17: Hoare triple {757#true} assume true; {757#true} is VALID [2022-04-27 13:32:32,389 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {757#true} {766#(= (+ main_~A~0 (* (- 1) main_~r~0)) 0)} #82#return; {766#(= (+ main_~A~0 (* (- 1) main_~r~0)) 0)} is VALID [2022-04-27 13:32:32,390 INFO L272 TraceCheckUtils]: 19: Hoare triple {766#(= (+ main_~A~0 (* (- 1) main_~r~0)) 0)} call __VERIFIER_assert((if ~r~0 % 4294967296 == ~A~0 % 4294967296 then 1 else 0)); {771#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 13:32:32,391 INFO L290 TraceCheckUtils]: 20: Hoare triple {771#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {772#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-27 13:32:32,392 INFO L290 TraceCheckUtils]: 21: Hoare triple {772#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {758#false} is VALID [2022-04-27 13:32:32,392 INFO L290 TraceCheckUtils]: 22: Hoare triple {758#false} assume !false; {758#false} is VALID [2022-04-27 13:32:32,392 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 13:32:32,392 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 13:32:32,393 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [454084445] [2022-04-27 13:32:32,393 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [454084445] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 13:32:32,393 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 13:32:32,393 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-27 13:32:32,393 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [63415088] [2022-04-27 13:32:32,393 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 13:32:32,394 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 23 [2022-04-27 13:32:32,394 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 13:32:32,394 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 2.5) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-27 13:32:32,422 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 13:32:32,422 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-27 13:32:32,422 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 13:32:32,423 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-27 13:32:32,423 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-27 13:32:32,423 INFO L87 Difference]: Start difference. First operand 38 states and 47 transitions. Second operand has 6 states, 6 states have (on average 2.5) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-27 13:32:32,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:32:32,899 INFO L93 Difference]: Finished difference Result 52 states and 66 transitions. [2022-04-27 13:32:32,899 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-27 13:32:32,899 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 23 [2022-04-27 13:32:32,899 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 13:32:32,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.5) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-27 13:32:32,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 62 transitions. [2022-04-27 13:32:32,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.5) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-27 13:32:32,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 62 transitions. [2022-04-27 13:32:32,903 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 62 transitions. [2022-04-27 13:32:32,986 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 62 edges. 62 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 13:32:32,989 INFO L225 Difference]: With dead ends: 52 [2022-04-27 13:32:32,990 INFO L226 Difference]: Without dead ends: 50 [2022-04-27 13:32:32,991 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2022-04-27 13:32:32,997 INFO L413 NwaCegarLoop]: 39 mSDtfsCounter, 23 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 112 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 83 SdHoareTripleChecker+Invalid, 126 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 112 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-27 13:32:32,998 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 83 Invalid, 126 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 112 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-27 13:32:33,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2022-04-27 13:32:33,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 42. [2022-04-27 13:32:33,020 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 13:32:33,020 INFO L82 GeneralOperation]: Start isEquivalent. First operand 50 states. Second operand has 42 states, 26 states have (on average 1.2307692307692308) internal successors, (32), 27 states have internal predecessors, (32), 10 states have call successors, (10), 6 states have call predecessors, (10), 5 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-27 13:32:33,021 INFO L74 IsIncluded]: Start isIncluded. First operand 50 states. Second operand has 42 states, 26 states have (on average 1.2307692307692308) internal successors, (32), 27 states have internal predecessors, (32), 10 states have call successors, (10), 6 states have call predecessors, (10), 5 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-27 13:32:33,021 INFO L87 Difference]: Start difference. First operand 50 states. Second operand has 42 states, 26 states have (on average 1.2307692307692308) internal successors, (32), 27 states have internal predecessors, (32), 10 states have call successors, (10), 6 states have call predecessors, (10), 5 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-27 13:32:33,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:32:33,023 INFO L93 Difference]: Finished difference Result 50 states and 64 transitions. [2022-04-27 13:32:33,024 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 64 transitions. [2022-04-27 13:32:33,024 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:32:33,024 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:32:33,024 INFO L74 IsIncluded]: Start isIncluded. First operand has 42 states, 26 states have (on average 1.2307692307692308) internal successors, (32), 27 states have internal predecessors, (32), 10 states have call successors, (10), 6 states have call predecessors, (10), 5 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand 50 states. [2022-04-27 13:32:33,025 INFO L87 Difference]: Start difference. First operand has 42 states, 26 states have (on average 1.2307692307692308) internal successors, (32), 27 states have internal predecessors, (32), 10 states have call successors, (10), 6 states have call predecessors, (10), 5 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand 50 states. [2022-04-27 13:32:33,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:32:33,027 INFO L93 Difference]: Finished difference Result 50 states and 64 transitions. [2022-04-27 13:32:33,027 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 64 transitions. [2022-04-27 13:32:33,028 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:32:33,028 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:32:33,028 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 13:32:33,028 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 13:32:33,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 26 states have (on average 1.2307692307692308) internal successors, (32), 27 states have internal predecessors, (32), 10 states have call successors, (10), 6 states have call predecessors, (10), 5 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-27 13:32:33,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 50 transitions. [2022-04-27 13:32:33,030 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 50 transitions. Word has length 23 [2022-04-27 13:32:33,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 13:32:33,031 INFO L495 AbstractCegarLoop]: Abstraction has 42 states and 50 transitions. [2022-04-27 13:32:33,031 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-27 13:32:33,031 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 50 transitions. [2022-04-27 13:32:33,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-04-27 13:32:33,031 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 13:32:33,031 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 13:32:33,032 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-04-27 13:32:33,032 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 13:32:33,032 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 13:32:33,032 INFO L85 PathProgramCache]: Analyzing trace with hash -1024624683, now seen corresponding path program 1 times [2022-04-27 13:32:33,032 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 13:32:33,032 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1785138502] [2022-04-27 13:32:33,033 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:32:33,033 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 13:32:33,046 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 13:32:33,047 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1861285315] [2022-04-27 13:32:33,047 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:32:33,047 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 13:32:33,047 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 13:32:33,048 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 13:32:33,073 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-04-27 13:32:33,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:32:33,103 INFO L263 TraceCheckSpWp]: Trace formula consists of 100 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-27 13:32:33,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:32:33,118 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 13:32:33,296 INFO L272 TraceCheckUtils]: 0: Hoare triple {1018#true} call ULTIMATE.init(); {1018#true} is VALID [2022-04-27 13:32:33,296 INFO L290 TraceCheckUtils]: 1: Hoare triple {1018#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {1018#true} is VALID [2022-04-27 13:32:33,296 INFO L290 TraceCheckUtils]: 2: Hoare triple {1018#true} assume true; {1018#true} is VALID [2022-04-27 13:32:33,296 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1018#true} {1018#true} #96#return; {1018#true} is VALID [2022-04-27 13:32:33,296 INFO L272 TraceCheckUtils]: 4: Hoare triple {1018#true} call #t~ret8 := main(); {1018#true} is VALID [2022-04-27 13:32:33,297 INFO L290 TraceCheckUtils]: 5: Hoare triple {1018#true} havoc ~A~0;havoc ~B~0;havoc ~r~0;havoc ~d~0;havoc ~p~0;havoc ~q~0;~A~0 := #t~nondet4;havoc #t~nondet4;~B~0 := #t~nondet5;havoc #t~nondet5; {1018#true} is VALID [2022-04-27 13:32:33,297 INFO L272 TraceCheckUtils]: 6: Hoare triple {1018#true} call assume_abort_if_not((if ~B~0 % 4294967296 >= 1 then 1 else 0)); {1018#true} is VALID [2022-04-27 13:32:33,298 INFO L290 TraceCheckUtils]: 7: Hoare triple {1018#true} ~cond := #in~cond; {1018#true} is VALID [2022-04-27 13:32:33,299 INFO L290 TraceCheckUtils]: 8: Hoare triple {1018#true} assume !(0 == ~cond); {1018#true} is VALID [2022-04-27 13:32:33,299 INFO L290 TraceCheckUtils]: 9: Hoare triple {1018#true} assume true; {1018#true} is VALID [2022-04-27 13:32:33,300 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1018#true} {1018#true} #80#return; {1018#true} is VALID [2022-04-27 13:32:33,301 INFO L290 TraceCheckUtils]: 11: Hoare triple {1018#true} ~r~0 := ~A~0;~d~0 := ~B~0;~p~0 := 1;~q~0 := 0; {1056#(and (= main_~B~0 main_~d~0) (= main_~p~0 1))} is VALID [2022-04-27 13:32:33,310 INFO L290 TraceCheckUtils]: 12: Hoare triple {1056#(and (= main_~B~0 main_~d~0) (= main_~p~0 1))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {1056#(and (= main_~B~0 main_~d~0) (= main_~p~0 1))} is VALID [2022-04-27 13:32:33,313 INFO L290 TraceCheckUtils]: 13: Hoare triple {1056#(and (= main_~B~0 main_~d~0) (= main_~p~0 1))} assume !!(#t~post6 < 2);havoc #t~post6; {1056#(and (= main_~B~0 main_~d~0) (= main_~p~0 1))} is VALID [2022-04-27 13:32:33,334 INFO L272 TraceCheckUtils]: 14: Hoare triple {1056#(and (= main_~B~0 main_~d~0) (= main_~p~0 1))} call __VERIFIER_assert((if 0 == ~q~0 % 4294967296 then 1 else 0)); {1018#true} is VALID [2022-04-27 13:32:33,334 INFO L290 TraceCheckUtils]: 15: Hoare triple {1018#true} ~cond := #in~cond; {1018#true} is VALID [2022-04-27 13:32:33,334 INFO L290 TraceCheckUtils]: 16: Hoare triple {1018#true} assume !(0 == ~cond); {1018#true} is VALID [2022-04-27 13:32:33,335 INFO L290 TraceCheckUtils]: 17: Hoare triple {1018#true} assume true; {1018#true} is VALID [2022-04-27 13:32:33,343 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {1018#true} {1056#(and (= main_~B~0 main_~d~0) (= main_~p~0 1))} #82#return; {1056#(and (= main_~B~0 main_~d~0) (= main_~p~0 1))} is VALID [2022-04-27 13:32:33,344 INFO L272 TraceCheckUtils]: 19: Hoare triple {1056#(and (= main_~B~0 main_~d~0) (= main_~p~0 1))} call __VERIFIER_assert((if ~r~0 % 4294967296 == ~A~0 % 4294967296 then 1 else 0)); {1018#true} is VALID [2022-04-27 13:32:33,344 INFO L290 TraceCheckUtils]: 20: Hoare triple {1018#true} ~cond := #in~cond; {1018#true} is VALID [2022-04-27 13:32:33,344 INFO L290 TraceCheckUtils]: 21: Hoare triple {1018#true} assume !(0 == ~cond); {1018#true} is VALID [2022-04-27 13:32:33,344 INFO L290 TraceCheckUtils]: 22: Hoare triple {1018#true} assume true; {1018#true} is VALID [2022-04-27 13:32:33,345 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {1018#true} {1056#(and (= main_~B~0 main_~d~0) (= main_~p~0 1))} #84#return; {1056#(and (= main_~B~0 main_~d~0) (= main_~p~0 1))} is VALID [2022-04-27 13:32:33,346 INFO L272 TraceCheckUtils]: 24: Hoare triple {1056#(and (= main_~B~0 main_~d~0) (= main_~p~0 1))} call __VERIFIER_assert((if ~d~0 % 4294967296 == ~B~0 * ~p~0 % 4294967296 then 1 else 0)); {1096#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 13:32:33,346 INFO L290 TraceCheckUtils]: 25: Hoare triple {1096#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1100#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 13:32:33,347 INFO L290 TraceCheckUtils]: 26: Hoare triple {1100#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1019#false} is VALID [2022-04-27 13:32:33,347 INFO L290 TraceCheckUtils]: 27: Hoare triple {1019#false} assume !false; {1019#false} is VALID [2022-04-27 13:32:33,347 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-27 13:32:33,347 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-27 13:32:33,348 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 13:32:33,348 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1785138502] [2022-04-27 13:32:33,348 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 13:32:33,348 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1861285315] [2022-04-27 13:32:33,348 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1861285315] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 13:32:33,348 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 13:32:33,348 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-27 13:32:33,348 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1686835938] [2022-04-27 13:32:33,348 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 13:32:33,349 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 28 [2022-04-27 13:32:33,349 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 13:32:33,349 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-27 13:32:33,377 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 13:32:33,378 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-27 13:32:33,378 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 13:32:33,378 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-27 13:32:33,379 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-27 13:32:33,379 INFO L87 Difference]: Start difference. First operand 42 states and 50 transitions. Second operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-27 13:32:35,602 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-27 13:32:35,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:32:35,817 INFO L93 Difference]: Finished difference Result 59 states and 75 transitions. [2022-04-27 13:32:35,817 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-27 13:32:35,818 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 28 [2022-04-27 13:32:35,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 13:32:35,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-27 13:32:35,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 69 transitions. [2022-04-27 13:32:35,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-27 13:32:35,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 69 transitions. [2022-04-27 13:32:35,822 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 69 transitions. [2022-04-27 13:32:35,910 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 69 edges. 69 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 13:32:35,912 INFO L225 Difference]: With dead ends: 59 [2022-04-27 13:32:35,912 INFO L226 Difference]: Without dead ends: 56 [2022-04-27 13:32:35,912 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-27 13:32:35,913 INFO L413 NwaCegarLoop]: 43 mSDtfsCounter, 10 mSDsluCounter, 97 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 2 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 140 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2022-04-27 13:32:35,913 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 140 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 47 Invalid, 1 Unknown, 0 Unchecked, 2.2s Time] [2022-04-27 13:32:35,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2022-04-27 13:32:35,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2022-04-27 13:32:35,934 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 13:32:35,935 INFO L82 GeneralOperation]: Start isEquivalent. First operand 56 states. Second operand has 56 states, 33 states have (on average 1.2727272727272727) internal successors, (42), 35 states have internal predecessors, (42), 16 states have call successors, (16), 7 states have call predecessors, (16), 6 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-27 13:32:35,935 INFO L74 IsIncluded]: Start isIncluded. First operand 56 states. Second operand has 56 states, 33 states have (on average 1.2727272727272727) internal successors, (42), 35 states have internal predecessors, (42), 16 states have call successors, (16), 7 states have call predecessors, (16), 6 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-27 13:32:35,935 INFO L87 Difference]: Start difference. First operand 56 states. Second operand has 56 states, 33 states have (on average 1.2727272727272727) internal successors, (42), 35 states have internal predecessors, (42), 16 states have call successors, (16), 7 states have call predecessors, (16), 6 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-27 13:32:35,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:32:35,943 INFO L93 Difference]: Finished difference Result 56 states and 71 transitions. [2022-04-27 13:32:35,943 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 71 transitions. [2022-04-27 13:32:35,943 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:32:35,944 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:32:35,944 INFO L74 IsIncluded]: Start isIncluded. First operand has 56 states, 33 states have (on average 1.2727272727272727) internal successors, (42), 35 states have internal predecessors, (42), 16 states have call successors, (16), 7 states have call predecessors, (16), 6 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) Second operand 56 states. [2022-04-27 13:32:35,944 INFO L87 Difference]: Start difference. First operand has 56 states, 33 states have (on average 1.2727272727272727) internal successors, (42), 35 states have internal predecessors, (42), 16 states have call successors, (16), 7 states have call predecessors, (16), 6 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) Second operand 56 states. [2022-04-27 13:32:35,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:32:35,947 INFO L93 Difference]: Finished difference Result 56 states and 71 transitions. [2022-04-27 13:32:35,947 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 71 transitions. [2022-04-27 13:32:35,948 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:32:35,948 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:32:35,948 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 13:32:35,948 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 13:32:35,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 33 states have (on average 1.2727272727272727) internal successors, (42), 35 states have internal predecessors, (42), 16 states have call successors, (16), 7 states have call predecessors, (16), 6 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-27 13:32:35,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 71 transitions. [2022-04-27 13:32:35,951 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 71 transitions. Word has length 28 [2022-04-27 13:32:35,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 13:32:35,951 INFO L495 AbstractCegarLoop]: Abstraction has 56 states and 71 transitions. [2022-04-27 13:32:35,955 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-27 13:32:35,956 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 71 transitions. [2022-04-27 13:32:35,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-04-27 13:32:35,956 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 13:32:35,957 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 13:32:35,976 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-04-27 13:32:36,161 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 13:32:36,161 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 13:32:36,162 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 13:32:36,162 INFO L85 PathProgramCache]: Analyzing trace with hash 1301357193, now seen corresponding path program 1 times [2022-04-27 13:32:36,162 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 13:32:36,162 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [513869659] [2022-04-27 13:32:36,162 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:32:36,162 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 13:32:36,180 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 13:32:36,181 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1342121358] [2022-04-27 13:32:36,181 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:32:36,181 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 13:32:36,181 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 13:32:36,182 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 13:32:36,203 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-04-27 13:32:36,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:32:36,252 INFO L263 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-27 13:32:36,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:32:36,263 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 13:32:36,565 INFO L272 TraceCheckUtils]: 0: Hoare triple {1386#true} call ULTIMATE.init(); {1386#true} is VALID [2022-04-27 13:32:36,566 INFO L290 TraceCheckUtils]: 1: Hoare triple {1386#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {1394#(<= ~counter~0 0)} is VALID [2022-04-27 13:32:36,566 INFO L290 TraceCheckUtils]: 2: Hoare triple {1394#(<= ~counter~0 0)} assume true; {1394#(<= ~counter~0 0)} is VALID [2022-04-27 13:32:36,567 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1394#(<= ~counter~0 0)} {1386#true} #96#return; {1394#(<= ~counter~0 0)} is VALID [2022-04-27 13:32:36,567 INFO L272 TraceCheckUtils]: 4: Hoare triple {1394#(<= ~counter~0 0)} call #t~ret8 := main(); {1394#(<= ~counter~0 0)} is VALID [2022-04-27 13:32:36,568 INFO L290 TraceCheckUtils]: 5: Hoare triple {1394#(<= ~counter~0 0)} havoc ~A~0;havoc ~B~0;havoc ~r~0;havoc ~d~0;havoc ~p~0;havoc ~q~0;~A~0 := #t~nondet4;havoc #t~nondet4;~B~0 := #t~nondet5;havoc #t~nondet5; {1394#(<= ~counter~0 0)} is VALID [2022-04-27 13:32:36,568 INFO L272 TraceCheckUtils]: 6: Hoare triple {1394#(<= ~counter~0 0)} call assume_abort_if_not((if ~B~0 % 4294967296 >= 1 then 1 else 0)); {1394#(<= ~counter~0 0)} is VALID [2022-04-27 13:32:36,568 INFO L290 TraceCheckUtils]: 7: Hoare triple {1394#(<= ~counter~0 0)} ~cond := #in~cond; {1394#(<= ~counter~0 0)} is VALID [2022-04-27 13:32:36,569 INFO L290 TraceCheckUtils]: 8: Hoare triple {1394#(<= ~counter~0 0)} assume !(0 == ~cond); {1394#(<= ~counter~0 0)} is VALID [2022-04-27 13:32:36,569 INFO L290 TraceCheckUtils]: 9: Hoare triple {1394#(<= ~counter~0 0)} assume true; {1394#(<= ~counter~0 0)} is VALID [2022-04-27 13:32:36,571 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1394#(<= ~counter~0 0)} {1394#(<= ~counter~0 0)} #80#return; {1394#(<= ~counter~0 0)} is VALID [2022-04-27 13:32:36,571 INFO L290 TraceCheckUtils]: 11: Hoare triple {1394#(<= ~counter~0 0)} ~r~0 := ~A~0;~d~0 := ~B~0;~p~0 := 1;~q~0 := 0; {1394#(<= ~counter~0 0)} is VALID [2022-04-27 13:32:36,572 INFO L290 TraceCheckUtils]: 12: Hoare triple {1394#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {1428#(<= ~counter~0 1)} is VALID [2022-04-27 13:32:36,572 INFO L290 TraceCheckUtils]: 13: Hoare triple {1428#(<= ~counter~0 1)} assume !!(#t~post6 < 2);havoc #t~post6; {1428#(<= ~counter~0 1)} is VALID [2022-04-27 13:32:36,573 INFO L272 TraceCheckUtils]: 14: Hoare triple {1428#(<= ~counter~0 1)} call __VERIFIER_assert((if 0 == ~q~0 % 4294967296 then 1 else 0)); {1428#(<= ~counter~0 1)} is VALID [2022-04-27 13:32:36,573 INFO L290 TraceCheckUtils]: 15: Hoare triple {1428#(<= ~counter~0 1)} ~cond := #in~cond; {1428#(<= ~counter~0 1)} is VALID [2022-04-27 13:32:36,573 INFO L290 TraceCheckUtils]: 16: Hoare triple {1428#(<= ~counter~0 1)} assume !(0 == ~cond); {1428#(<= ~counter~0 1)} is VALID [2022-04-27 13:32:36,574 INFO L290 TraceCheckUtils]: 17: Hoare triple {1428#(<= ~counter~0 1)} assume true; {1428#(<= ~counter~0 1)} is VALID [2022-04-27 13:32:36,575 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {1428#(<= ~counter~0 1)} {1428#(<= ~counter~0 1)} #82#return; {1428#(<= ~counter~0 1)} is VALID [2022-04-27 13:32:36,576 INFO L272 TraceCheckUtils]: 19: Hoare triple {1428#(<= ~counter~0 1)} call __VERIFIER_assert((if ~r~0 % 4294967296 == ~A~0 % 4294967296 then 1 else 0)); {1428#(<= ~counter~0 1)} is VALID [2022-04-27 13:32:36,576 INFO L290 TraceCheckUtils]: 20: Hoare triple {1428#(<= ~counter~0 1)} ~cond := #in~cond; {1428#(<= ~counter~0 1)} is VALID [2022-04-27 13:32:36,577 INFO L290 TraceCheckUtils]: 21: Hoare triple {1428#(<= ~counter~0 1)} assume !(0 == ~cond); {1428#(<= ~counter~0 1)} is VALID [2022-04-27 13:32:36,577 INFO L290 TraceCheckUtils]: 22: Hoare triple {1428#(<= ~counter~0 1)} assume true; {1428#(<= ~counter~0 1)} is VALID [2022-04-27 13:32:36,578 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {1428#(<= ~counter~0 1)} {1428#(<= ~counter~0 1)} #84#return; {1428#(<= ~counter~0 1)} is VALID [2022-04-27 13:32:36,578 INFO L272 TraceCheckUtils]: 24: Hoare triple {1428#(<= ~counter~0 1)} call __VERIFIER_assert((if ~d~0 % 4294967296 == ~B~0 * ~p~0 % 4294967296 then 1 else 0)); {1428#(<= ~counter~0 1)} is VALID [2022-04-27 13:32:36,579 INFO L290 TraceCheckUtils]: 25: Hoare triple {1428#(<= ~counter~0 1)} ~cond := #in~cond; {1428#(<= ~counter~0 1)} is VALID [2022-04-27 13:32:36,579 INFO L290 TraceCheckUtils]: 26: Hoare triple {1428#(<= ~counter~0 1)} assume !(0 == ~cond); {1428#(<= ~counter~0 1)} is VALID [2022-04-27 13:32:36,579 INFO L290 TraceCheckUtils]: 27: Hoare triple {1428#(<= ~counter~0 1)} assume true; {1428#(<= ~counter~0 1)} is VALID [2022-04-27 13:32:36,580 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {1428#(<= ~counter~0 1)} {1428#(<= ~counter~0 1)} #86#return; {1428#(<= ~counter~0 1)} is VALID [2022-04-27 13:32:36,580 INFO L290 TraceCheckUtils]: 29: Hoare triple {1428#(<= ~counter~0 1)} assume !(~r~0 % 4294967296 >= ~d~0 % 4294967296); {1428#(<= ~counter~0 1)} is VALID [2022-04-27 13:32:36,582 INFO L290 TraceCheckUtils]: 30: Hoare triple {1428#(<= ~counter~0 1)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {1483#(<= |main_#t~post7| 1)} is VALID [2022-04-27 13:32:36,582 INFO L290 TraceCheckUtils]: 31: Hoare triple {1483#(<= |main_#t~post7| 1)} assume !(#t~post7 < 2);havoc #t~post7; {1387#false} is VALID [2022-04-27 13:32:36,582 INFO L272 TraceCheckUtils]: 32: Hoare triple {1387#false} call __VERIFIER_assert((if ~A~0 % 4294967296 == (~d~0 * ~q~0 + ~r~0) % 4294967296 then 1 else 0)); {1387#false} is VALID [2022-04-27 13:32:36,583 INFO L290 TraceCheckUtils]: 33: Hoare triple {1387#false} ~cond := #in~cond; {1387#false} is VALID [2022-04-27 13:32:36,583 INFO L290 TraceCheckUtils]: 34: Hoare triple {1387#false} assume 0 == ~cond; {1387#false} is VALID [2022-04-27 13:32:36,583 INFO L290 TraceCheckUtils]: 35: Hoare triple {1387#false} assume !false; {1387#false} is VALID [2022-04-27 13:32:36,583 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-04-27 13:32:36,583 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-27 13:32:36,583 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 13:32:36,583 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [513869659] [2022-04-27 13:32:36,583 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 13:32:36,583 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1342121358] [2022-04-27 13:32:36,583 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1342121358] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 13:32:36,584 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 13:32:36,584 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-27 13:32:36,584 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [220059420] [2022-04-27 13:32:36,584 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 13:32:36,584 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 4 states have call successors, (7), 4 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 3 states have call successors, (5) Word has length 36 [2022-04-27 13:32:36,585 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 13:32:36,585 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 4 states have call successors, (7), 4 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 3 states have call successors, (5) [2022-04-27 13:32:36,618 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 13:32:36,618 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-27 13:32:36,618 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 13:32:36,619 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-27 13:32:36,619 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-04-27 13:32:36,619 INFO L87 Difference]: Start difference. First operand 56 states and 71 transitions. Second operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 4 states have call successors, (7), 4 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 3 states have call successors, (5) [2022-04-27 13:32:36,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:32:36,960 INFO L93 Difference]: Finished difference Result 76 states and 87 transitions. [2022-04-27 13:32:36,960 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-27 13:32:36,960 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 4 states have call successors, (7), 4 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 3 states have call successors, (5) Word has length 36 [2022-04-27 13:32:36,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 13:32:36,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 4 states have call successors, (7), 4 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 3 states have call successors, (5) [2022-04-27 13:32:36,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 65 transitions. [2022-04-27 13:32:36,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 4 states have call successors, (7), 4 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 3 states have call successors, (5) [2022-04-27 13:32:36,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 65 transitions. [2022-04-27 13:32:36,964 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 65 transitions. [2022-04-27 13:32:37,035 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 65 edges. 65 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 13:32:37,036 INFO L225 Difference]: With dead ends: 76 [2022-04-27 13:32:37,037 INFO L226 Difference]: Without dead ends: 69 [2022-04-27 13:32:37,037 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-04-27 13:32:37,038 INFO L413 NwaCegarLoop]: 42 mSDtfsCounter, 7 mSDsluCounter, 94 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 136 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 13:32:37,038 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 136 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 13:32:37,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2022-04-27 13:32:37,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 68. [2022-04-27 13:32:37,052 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 13:32:37,052 INFO L82 GeneralOperation]: Start isEquivalent. First operand 69 states. Second operand has 68 states, 42 states have (on average 1.1904761904761905) internal successors, (50), 44 states have internal predecessors, (50), 16 states have call successors, (16), 10 states have call predecessors, (16), 9 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-27 13:32:37,053 INFO L74 IsIncluded]: Start isIncluded. First operand 69 states. Second operand has 68 states, 42 states have (on average 1.1904761904761905) internal successors, (50), 44 states have internal predecessors, (50), 16 states have call successors, (16), 10 states have call predecessors, (16), 9 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-27 13:32:37,053 INFO L87 Difference]: Start difference. First operand 69 states. Second operand has 68 states, 42 states have (on average 1.1904761904761905) internal successors, (50), 44 states have internal predecessors, (50), 16 states have call successors, (16), 10 states have call predecessors, (16), 9 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-27 13:32:37,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:32:37,056 INFO L93 Difference]: Finished difference Result 69 states and 80 transitions. [2022-04-27 13:32:37,056 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 80 transitions. [2022-04-27 13:32:37,056 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:32:37,056 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:32:37,057 INFO L74 IsIncluded]: Start isIncluded. First operand has 68 states, 42 states have (on average 1.1904761904761905) internal successors, (50), 44 states have internal predecessors, (50), 16 states have call successors, (16), 10 states have call predecessors, (16), 9 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) Second operand 69 states. [2022-04-27 13:32:37,057 INFO L87 Difference]: Start difference. First operand has 68 states, 42 states have (on average 1.1904761904761905) internal successors, (50), 44 states have internal predecessors, (50), 16 states have call successors, (16), 10 states have call predecessors, (16), 9 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) Second operand 69 states. [2022-04-27 13:32:37,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:32:37,059 INFO L93 Difference]: Finished difference Result 69 states and 80 transitions. [2022-04-27 13:32:37,060 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 80 transitions. [2022-04-27 13:32:37,060 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:32:37,060 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:32:37,060 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 13:32:37,060 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 13:32:37,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 42 states have (on average 1.1904761904761905) internal successors, (50), 44 states have internal predecessors, (50), 16 states have call successors, (16), 10 states have call predecessors, (16), 9 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-27 13:32:37,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 79 transitions. [2022-04-27 13:32:37,063 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 79 transitions. Word has length 36 [2022-04-27 13:32:37,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 13:32:37,063 INFO L495 AbstractCegarLoop]: Abstraction has 68 states and 79 transitions. [2022-04-27 13:32:37,063 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 4 states have call successors, (7), 4 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 3 states have call successors, (5) [2022-04-27 13:32:37,063 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 79 transitions. [2022-04-27 13:32:37,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-04-27 13:32:37,064 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 13:32:37,064 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 13:32:37,093 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-04-27 13:32:37,283 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 13:32:37,284 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 13:32:37,284 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 13:32:37,284 INFO L85 PathProgramCache]: Analyzing trace with hash 1303085071, now seen corresponding path program 1 times [2022-04-27 13:32:37,284 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 13:32:37,284 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1158807254] [2022-04-27 13:32:37,284 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:32:37,285 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 13:32:37,302 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 13:32:37,302 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1165853547] [2022-04-27 13:32:37,302 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:32:37,303 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 13:32:37,303 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 13:32:37,307 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 13:32:37,336 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-04-27 13:32:37,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:32:37,373 INFO L263 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 10 conjunts are in the unsatisfiable core [2022-04-27 13:32:37,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:32:37,393 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 13:32:38,148 INFO L272 TraceCheckUtils]: 0: Hoare triple {1839#true} call ULTIMATE.init(); {1839#true} is VALID [2022-04-27 13:32:38,149 INFO L290 TraceCheckUtils]: 1: Hoare triple {1839#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {1839#true} is VALID [2022-04-27 13:32:38,149 INFO L290 TraceCheckUtils]: 2: Hoare triple {1839#true} assume true; {1839#true} is VALID [2022-04-27 13:32:38,149 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1839#true} {1839#true} #96#return; {1839#true} is VALID [2022-04-27 13:32:38,149 INFO L272 TraceCheckUtils]: 4: Hoare triple {1839#true} call #t~ret8 := main(); {1839#true} is VALID [2022-04-27 13:32:38,149 INFO L290 TraceCheckUtils]: 5: Hoare triple {1839#true} havoc ~A~0;havoc ~B~0;havoc ~r~0;havoc ~d~0;havoc ~p~0;havoc ~q~0;~A~0 := #t~nondet4;havoc #t~nondet4;~B~0 := #t~nondet5;havoc #t~nondet5; {1839#true} is VALID [2022-04-27 13:32:38,149 INFO L272 TraceCheckUtils]: 6: Hoare triple {1839#true} call assume_abort_if_not((if ~B~0 % 4294967296 >= 1 then 1 else 0)); {1839#true} is VALID [2022-04-27 13:32:38,150 INFO L290 TraceCheckUtils]: 7: Hoare triple {1839#true} ~cond := #in~cond; {1839#true} is VALID [2022-04-27 13:32:38,150 INFO L290 TraceCheckUtils]: 8: Hoare triple {1839#true} assume !(0 == ~cond); {1839#true} is VALID [2022-04-27 13:32:38,150 INFO L290 TraceCheckUtils]: 9: Hoare triple {1839#true} assume true; {1839#true} is VALID [2022-04-27 13:32:38,150 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1839#true} {1839#true} #80#return; {1839#true} is VALID [2022-04-27 13:32:38,151 INFO L290 TraceCheckUtils]: 11: Hoare triple {1839#true} ~r~0 := ~A~0;~d~0 := ~B~0;~p~0 := 1;~q~0 := 0; {1877#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 main_~d~0))} is VALID [2022-04-27 13:32:38,151 INFO L290 TraceCheckUtils]: 12: Hoare triple {1877#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 main_~d~0))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {1877#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 main_~d~0))} is VALID [2022-04-27 13:32:38,152 INFO L290 TraceCheckUtils]: 13: Hoare triple {1877#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 main_~d~0))} assume !!(#t~post6 < 2);havoc #t~post6; {1877#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 main_~d~0))} is VALID [2022-04-27 13:32:38,152 INFO L272 TraceCheckUtils]: 14: Hoare triple {1877#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 main_~d~0))} call __VERIFIER_assert((if 0 == ~q~0 % 4294967296 then 1 else 0)); {1839#true} is VALID [2022-04-27 13:32:38,152 INFO L290 TraceCheckUtils]: 15: Hoare triple {1839#true} ~cond := #in~cond; {1839#true} is VALID [2022-04-27 13:32:38,152 INFO L290 TraceCheckUtils]: 16: Hoare triple {1839#true} assume !(0 == ~cond); {1839#true} is VALID [2022-04-27 13:32:38,152 INFO L290 TraceCheckUtils]: 17: Hoare triple {1839#true} assume true; {1839#true} is VALID [2022-04-27 13:32:38,154 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {1839#true} {1877#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 main_~d~0))} #82#return; {1877#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 main_~d~0))} is VALID [2022-04-27 13:32:38,154 INFO L272 TraceCheckUtils]: 19: Hoare triple {1877#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 main_~d~0))} call __VERIFIER_assert((if ~r~0 % 4294967296 == ~A~0 % 4294967296 then 1 else 0)); {1839#true} is VALID [2022-04-27 13:32:38,154 INFO L290 TraceCheckUtils]: 20: Hoare triple {1839#true} ~cond := #in~cond; {1839#true} is VALID [2022-04-27 13:32:38,154 INFO L290 TraceCheckUtils]: 21: Hoare triple {1839#true} assume !(0 == ~cond); {1839#true} is VALID [2022-04-27 13:32:38,154 INFO L290 TraceCheckUtils]: 22: Hoare triple {1839#true} assume true; {1839#true} is VALID [2022-04-27 13:32:38,155 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {1839#true} {1877#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 main_~d~0))} #84#return; {1877#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 main_~d~0))} is VALID [2022-04-27 13:32:38,156 INFO L272 TraceCheckUtils]: 24: Hoare triple {1877#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 main_~d~0))} call __VERIFIER_assert((if ~d~0 % 4294967296 == ~B~0 * ~p~0 % 4294967296 then 1 else 0)); {1839#true} is VALID [2022-04-27 13:32:38,156 INFO L290 TraceCheckUtils]: 25: Hoare triple {1839#true} ~cond := #in~cond; {1839#true} is VALID [2022-04-27 13:32:38,156 INFO L290 TraceCheckUtils]: 26: Hoare triple {1839#true} assume !(0 == ~cond); {1839#true} is VALID [2022-04-27 13:32:38,156 INFO L290 TraceCheckUtils]: 27: Hoare triple {1839#true} assume true; {1839#true} is VALID [2022-04-27 13:32:38,157 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {1839#true} {1877#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 main_~d~0))} #86#return; {1877#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 main_~d~0))} is VALID [2022-04-27 13:32:38,157 INFO L290 TraceCheckUtils]: 29: Hoare triple {1877#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 main_~d~0))} assume !(~r~0 % 4294967296 >= ~d~0 % 4294967296); {1932#(and (= main_~A~0 main_~r~0) (not (<= (mod main_~B~0 4294967296) (mod main_~r~0 4294967296))) (= main_~q~0 0))} is VALID [2022-04-27 13:32:38,164 INFO L290 TraceCheckUtils]: 30: Hoare triple {1932#(and (= main_~A~0 main_~r~0) (not (<= (mod main_~B~0 4294967296) (mod main_~r~0 4294967296))) (= main_~q~0 0))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {1932#(and (= main_~A~0 main_~r~0) (not (<= (mod main_~B~0 4294967296) (mod main_~r~0 4294967296))) (= main_~q~0 0))} is VALID [2022-04-27 13:32:38,164 INFO L290 TraceCheckUtils]: 31: Hoare triple {1932#(and (= main_~A~0 main_~r~0) (not (<= (mod main_~B~0 4294967296) (mod main_~r~0 4294967296))) (= main_~q~0 0))} assume !!(#t~post7 < 2);havoc #t~post7; {1932#(and (= main_~A~0 main_~r~0) (not (<= (mod main_~B~0 4294967296) (mod main_~r~0 4294967296))) (= main_~q~0 0))} is VALID [2022-04-27 13:32:38,166 INFO L272 TraceCheckUtils]: 32: Hoare triple {1932#(and (= main_~A~0 main_~r~0) (not (<= (mod main_~B~0 4294967296) (mod main_~r~0 4294967296))) (= main_~q~0 0))} call __VERIFIER_assert((if ~A~0 % 4294967296 == (~q~0 * ~B~0 + ~r~0) % 4294967296 then 1 else 0)); {1942#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 13:32:38,166 INFO L290 TraceCheckUtils]: 33: Hoare triple {1942#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1946#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 13:32:38,167 INFO L290 TraceCheckUtils]: 34: Hoare triple {1946#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1840#false} is VALID [2022-04-27 13:32:38,167 INFO L290 TraceCheckUtils]: 35: Hoare triple {1840#false} assume !false; {1840#false} is VALID [2022-04-27 13:32:38,168 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-04-27 13:32:38,168 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-27 13:32:38,168 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 13:32:38,168 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1158807254] [2022-04-27 13:32:38,168 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 13:32:38,168 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1165853547] [2022-04-27 13:32:38,168 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1165853547] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 13:32:38,168 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 13:32:38,168 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-27 13:32:38,168 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [193343407] [2022-04-27 13:32:38,169 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 13:32:38,170 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 3 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 36 [2022-04-27 13:32:38,170 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 13:32:38,171 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 3 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-27 13:32:38,207 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 13:32:38,207 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-27 13:32:38,207 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 13:32:38,208 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-27 13:32:38,208 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-27 13:32:38,209 INFO L87 Difference]: Start difference. First operand 68 states and 79 transitions. Second operand has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 3 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-27 13:32:40,769 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.06s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-27 13:32:43,676 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.91s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-27 13:32:46,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:32:46,342 INFO L93 Difference]: Finished difference Result 82 states and 98 transitions. [2022-04-27 13:32:46,342 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-27 13:32:46,342 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 3 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 36 [2022-04-27 13:32:46,342 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 13:32:46,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 3 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-27 13:32:46,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 80 transitions. [2022-04-27 13:32:46,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 3 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-27 13:32:46,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 80 transitions. [2022-04-27 13:32:46,346 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 80 transitions. [2022-04-27 13:32:46,461 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 80 edges. 80 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 13:32:46,463 INFO L225 Difference]: With dead ends: 82 [2022-04-27 13:32:46,463 INFO L226 Difference]: Without dead ends: 79 [2022-04-27 13:32:46,463 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-04-27 13:32:46,464 INFO L413 NwaCegarLoop]: 41 mSDtfsCounter, 14 mSDsluCounter, 121 mSDsCounter, 0 mSdLazyCounter, 91 mSolverCounterSat, 9 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 162 SdHoareTripleChecker+Invalid, 102 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 91 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.2s IncrementalHoareTripleChecker+Time [2022-04-27 13:32:46,464 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 162 Invalid, 102 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 91 Invalid, 2 Unknown, 0 Unchecked, 5.2s Time] [2022-04-27 13:32:46,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2022-04-27 13:32:46,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 78. [2022-04-27 13:32:46,488 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 13:32:46,488 INFO L82 GeneralOperation]: Start isEquivalent. First operand 79 states. Second operand has 78 states, 49 states have (on average 1.2040816326530612) internal successors, (59), 51 states have internal predecessors, (59), 18 states have call successors, (18), 11 states have call predecessors, (18), 10 states have return successors, (16), 15 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-27 13:32:46,489 INFO L74 IsIncluded]: Start isIncluded. First operand 79 states. Second operand has 78 states, 49 states have (on average 1.2040816326530612) internal successors, (59), 51 states have internal predecessors, (59), 18 states have call successors, (18), 11 states have call predecessors, (18), 10 states have return successors, (16), 15 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-27 13:32:46,489 INFO L87 Difference]: Start difference. First operand 79 states. Second operand has 78 states, 49 states have (on average 1.2040816326530612) internal successors, (59), 51 states have internal predecessors, (59), 18 states have call successors, (18), 11 states have call predecessors, (18), 10 states have return successors, (16), 15 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-27 13:32:46,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:32:46,492 INFO L93 Difference]: Finished difference Result 79 states and 94 transitions. [2022-04-27 13:32:46,492 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 94 transitions. [2022-04-27 13:32:46,492 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:32:46,492 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:32:46,493 INFO L74 IsIncluded]: Start isIncluded. First operand has 78 states, 49 states have (on average 1.2040816326530612) internal successors, (59), 51 states have internal predecessors, (59), 18 states have call successors, (18), 11 states have call predecessors, (18), 10 states have return successors, (16), 15 states have call predecessors, (16), 16 states have call successors, (16) Second operand 79 states. [2022-04-27 13:32:46,493 INFO L87 Difference]: Start difference. First operand has 78 states, 49 states have (on average 1.2040816326530612) internal successors, (59), 51 states have internal predecessors, (59), 18 states have call successors, (18), 11 states have call predecessors, (18), 10 states have return successors, (16), 15 states have call predecessors, (16), 16 states have call successors, (16) Second operand 79 states. [2022-04-27 13:32:46,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:32:46,496 INFO L93 Difference]: Finished difference Result 79 states and 94 transitions. [2022-04-27 13:32:46,496 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 94 transitions. [2022-04-27 13:32:46,496 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:32:46,497 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:32:46,497 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 13:32:46,497 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 13:32:46,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 49 states have (on average 1.2040816326530612) internal successors, (59), 51 states have internal predecessors, (59), 18 states have call successors, (18), 11 states have call predecessors, (18), 10 states have return successors, (16), 15 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-27 13:32:46,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 93 transitions. [2022-04-27 13:32:46,500 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 93 transitions. Word has length 36 [2022-04-27 13:32:46,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 13:32:46,500 INFO L495 AbstractCegarLoop]: Abstraction has 78 states and 93 transitions. [2022-04-27 13:32:46,500 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 3 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-27 13:32:46,500 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 93 transitions. [2022-04-27 13:32:46,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-04-27 13:32:46,501 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 13:32:46,501 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 13:32:46,530 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-04-27 13:32:46,727 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 13:32:46,727 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 13:32:46,728 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 13:32:46,728 INFO L85 PathProgramCache]: Analyzing trace with hash -1189074514, now seen corresponding path program 1 times [2022-04-27 13:32:46,728 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 13:32:46,728 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [67655807] [2022-04-27 13:32:46,728 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:32:46,728 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 13:32:46,746 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 13:32:46,746 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [564546670] [2022-04-27 13:32:46,746 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:32:46,746 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 13:32:46,746 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 13:32:46,757 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 13:32:46,795 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-04-27 13:32:46,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:32:46,814 INFO L263 TraceCheckSpWp]: Trace formula consists of 124 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-27 13:32:46,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:32:46,826 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 13:32:47,128 INFO L272 TraceCheckUtils]: 0: Hoare triple {2338#true} call ULTIMATE.init(); {2338#true} is VALID [2022-04-27 13:32:47,128 INFO L290 TraceCheckUtils]: 1: Hoare triple {2338#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {2346#(<= ~counter~0 0)} is VALID [2022-04-27 13:32:47,129 INFO L290 TraceCheckUtils]: 2: Hoare triple {2346#(<= ~counter~0 0)} assume true; {2346#(<= ~counter~0 0)} is VALID [2022-04-27 13:32:47,129 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2346#(<= ~counter~0 0)} {2338#true} #96#return; {2346#(<= ~counter~0 0)} is VALID [2022-04-27 13:32:47,130 INFO L272 TraceCheckUtils]: 4: Hoare triple {2346#(<= ~counter~0 0)} call #t~ret8 := main(); {2346#(<= ~counter~0 0)} is VALID [2022-04-27 13:32:47,130 INFO L290 TraceCheckUtils]: 5: Hoare triple {2346#(<= ~counter~0 0)} havoc ~A~0;havoc ~B~0;havoc ~r~0;havoc ~d~0;havoc ~p~0;havoc ~q~0;~A~0 := #t~nondet4;havoc #t~nondet4;~B~0 := #t~nondet5;havoc #t~nondet5; {2346#(<= ~counter~0 0)} is VALID [2022-04-27 13:32:47,131 INFO L272 TraceCheckUtils]: 6: Hoare triple {2346#(<= ~counter~0 0)} call assume_abort_if_not((if ~B~0 % 4294967296 >= 1 then 1 else 0)); {2346#(<= ~counter~0 0)} is VALID [2022-04-27 13:32:47,131 INFO L290 TraceCheckUtils]: 7: Hoare triple {2346#(<= ~counter~0 0)} ~cond := #in~cond; {2346#(<= ~counter~0 0)} is VALID [2022-04-27 13:32:47,132 INFO L290 TraceCheckUtils]: 8: Hoare triple {2346#(<= ~counter~0 0)} assume !(0 == ~cond); {2346#(<= ~counter~0 0)} is VALID [2022-04-27 13:32:47,132 INFO L290 TraceCheckUtils]: 9: Hoare triple {2346#(<= ~counter~0 0)} assume true; {2346#(<= ~counter~0 0)} is VALID [2022-04-27 13:32:47,133 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2346#(<= ~counter~0 0)} {2346#(<= ~counter~0 0)} #80#return; {2346#(<= ~counter~0 0)} is VALID [2022-04-27 13:32:47,134 INFO L290 TraceCheckUtils]: 11: Hoare triple {2346#(<= ~counter~0 0)} ~r~0 := ~A~0;~d~0 := ~B~0;~p~0 := 1;~q~0 := 0; {2346#(<= ~counter~0 0)} is VALID [2022-04-27 13:32:47,135 INFO L290 TraceCheckUtils]: 12: Hoare triple {2346#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {2380#(<= ~counter~0 1)} is VALID [2022-04-27 13:32:47,135 INFO L290 TraceCheckUtils]: 13: Hoare triple {2380#(<= ~counter~0 1)} assume !!(#t~post6 < 2);havoc #t~post6; {2380#(<= ~counter~0 1)} is VALID [2022-04-27 13:32:47,136 INFO L272 TraceCheckUtils]: 14: Hoare triple {2380#(<= ~counter~0 1)} call __VERIFIER_assert((if 0 == ~q~0 % 4294967296 then 1 else 0)); {2380#(<= ~counter~0 1)} is VALID [2022-04-27 13:32:47,136 INFO L290 TraceCheckUtils]: 15: Hoare triple {2380#(<= ~counter~0 1)} ~cond := #in~cond; {2380#(<= ~counter~0 1)} is VALID [2022-04-27 13:32:47,136 INFO L290 TraceCheckUtils]: 16: Hoare triple {2380#(<= ~counter~0 1)} assume !(0 == ~cond); {2380#(<= ~counter~0 1)} is VALID [2022-04-27 13:32:47,137 INFO L290 TraceCheckUtils]: 17: Hoare triple {2380#(<= ~counter~0 1)} assume true; {2380#(<= ~counter~0 1)} is VALID [2022-04-27 13:32:47,137 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {2380#(<= ~counter~0 1)} {2380#(<= ~counter~0 1)} #82#return; {2380#(<= ~counter~0 1)} is VALID [2022-04-27 13:32:47,138 INFO L272 TraceCheckUtils]: 19: Hoare triple {2380#(<= ~counter~0 1)} call __VERIFIER_assert((if ~r~0 % 4294967296 == ~A~0 % 4294967296 then 1 else 0)); {2380#(<= ~counter~0 1)} is VALID [2022-04-27 13:32:47,138 INFO L290 TraceCheckUtils]: 20: Hoare triple {2380#(<= ~counter~0 1)} ~cond := #in~cond; {2380#(<= ~counter~0 1)} is VALID [2022-04-27 13:32:47,139 INFO L290 TraceCheckUtils]: 21: Hoare triple {2380#(<= ~counter~0 1)} assume !(0 == ~cond); {2380#(<= ~counter~0 1)} is VALID [2022-04-27 13:32:47,139 INFO L290 TraceCheckUtils]: 22: Hoare triple {2380#(<= ~counter~0 1)} assume true; {2380#(<= ~counter~0 1)} is VALID [2022-04-27 13:32:47,141 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {2380#(<= ~counter~0 1)} {2380#(<= ~counter~0 1)} #84#return; {2380#(<= ~counter~0 1)} is VALID [2022-04-27 13:32:47,142 INFO L272 TraceCheckUtils]: 24: Hoare triple {2380#(<= ~counter~0 1)} call __VERIFIER_assert((if ~d~0 % 4294967296 == ~B~0 * ~p~0 % 4294967296 then 1 else 0)); {2380#(<= ~counter~0 1)} is VALID [2022-04-27 13:32:47,142 INFO L290 TraceCheckUtils]: 25: Hoare triple {2380#(<= ~counter~0 1)} ~cond := #in~cond; {2380#(<= ~counter~0 1)} is VALID [2022-04-27 13:32:47,143 INFO L290 TraceCheckUtils]: 26: Hoare triple {2380#(<= ~counter~0 1)} assume !(0 == ~cond); {2380#(<= ~counter~0 1)} is VALID [2022-04-27 13:32:47,143 INFO L290 TraceCheckUtils]: 27: Hoare triple {2380#(<= ~counter~0 1)} assume true; {2380#(<= ~counter~0 1)} is VALID [2022-04-27 13:32:47,145 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {2380#(<= ~counter~0 1)} {2380#(<= ~counter~0 1)} #86#return; {2380#(<= ~counter~0 1)} is VALID [2022-04-27 13:32:47,146 INFO L290 TraceCheckUtils]: 29: Hoare triple {2380#(<= ~counter~0 1)} assume !!(~r~0 % 4294967296 >= ~d~0 % 4294967296);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {2380#(<= ~counter~0 1)} is VALID [2022-04-27 13:32:47,147 INFO L290 TraceCheckUtils]: 30: Hoare triple {2380#(<= ~counter~0 1)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {2435#(<= |main_#t~post6| 1)} is VALID [2022-04-27 13:32:47,147 INFO L290 TraceCheckUtils]: 31: Hoare triple {2435#(<= |main_#t~post6| 1)} assume !(#t~post6 < 2);havoc #t~post6; {2339#false} is VALID [2022-04-27 13:32:47,147 INFO L290 TraceCheckUtils]: 32: Hoare triple {2339#false} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {2339#false} is VALID [2022-04-27 13:32:47,147 INFO L290 TraceCheckUtils]: 33: Hoare triple {2339#false} assume !(#t~post7 < 2);havoc #t~post7; {2339#false} is VALID [2022-04-27 13:32:47,147 INFO L272 TraceCheckUtils]: 34: Hoare triple {2339#false} call __VERIFIER_assert((if ~A~0 % 4294967296 == (~d~0 * ~q~0 + ~r~0) % 4294967296 then 1 else 0)); {2339#false} is VALID [2022-04-27 13:32:47,153 INFO L290 TraceCheckUtils]: 35: Hoare triple {2339#false} ~cond := #in~cond; {2339#false} is VALID [2022-04-27 13:32:47,154 INFO L290 TraceCheckUtils]: 36: Hoare triple {2339#false} assume 0 == ~cond; {2339#false} is VALID [2022-04-27 13:32:47,154 INFO L290 TraceCheckUtils]: 37: Hoare triple {2339#false} assume !false; {2339#false} is VALID [2022-04-27 13:32:47,154 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-04-27 13:32:47,154 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 13:32:47,417 INFO L290 TraceCheckUtils]: 37: Hoare triple {2339#false} assume !false; {2339#false} is VALID [2022-04-27 13:32:47,418 INFO L290 TraceCheckUtils]: 36: Hoare triple {2339#false} assume 0 == ~cond; {2339#false} is VALID [2022-04-27 13:32:47,418 INFO L290 TraceCheckUtils]: 35: Hoare triple {2339#false} ~cond := #in~cond; {2339#false} is VALID [2022-04-27 13:32:47,418 INFO L272 TraceCheckUtils]: 34: Hoare triple {2339#false} call __VERIFIER_assert((if ~A~0 % 4294967296 == (~d~0 * ~q~0 + ~r~0) % 4294967296 then 1 else 0)); {2339#false} is VALID [2022-04-27 13:32:47,418 INFO L290 TraceCheckUtils]: 33: Hoare triple {2339#false} assume !(#t~post7 < 2);havoc #t~post7; {2339#false} is VALID [2022-04-27 13:32:47,418 INFO L290 TraceCheckUtils]: 32: Hoare triple {2339#false} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {2339#false} is VALID [2022-04-27 13:32:47,420 INFO L290 TraceCheckUtils]: 31: Hoare triple {2435#(<= |main_#t~post6| 1)} assume !(#t~post6 < 2);havoc #t~post6; {2339#false} is VALID [2022-04-27 13:32:47,420 INFO L290 TraceCheckUtils]: 30: Hoare triple {2380#(<= ~counter~0 1)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {2435#(<= |main_#t~post6| 1)} is VALID [2022-04-27 13:32:47,422 INFO L290 TraceCheckUtils]: 29: Hoare triple {2380#(<= ~counter~0 1)} assume !!(~r~0 % 4294967296 >= ~d~0 % 4294967296);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {2380#(<= ~counter~0 1)} is VALID [2022-04-27 13:32:47,423 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {2338#true} {2380#(<= ~counter~0 1)} #86#return; {2380#(<= ~counter~0 1)} is VALID [2022-04-27 13:32:47,423 INFO L290 TraceCheckUtils]: 27: Hoare triple {2338#true} assume true; {2338#true} is VALID [2022-04-27 13:32:47,423 INFO L290 TraceCheckUtils]: 26: Hoare triple {2338#true} assume !(0 == ~cond); {2338#true} is VALID [2022-04-27 13:32:47,423 INFO L290 TraceCheckUtils]: 25: Hoare triple {2338#true} ~cond := #in~cond; {2338#true} is VALID [2022-04-27 13:32:47,423 INFO L272 TraceCheckUtils]: 24: Hoare triple {2380#(<= ~counter~0 1)} call __VERIFIER_assert((if ~d~0 % 4294967296 == ~B~0 * ~p~0 % 4294967296 then 1 else 0)); {2338#true} is VALID [2022-04-27 13:32:47,427 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {2338#true} {2380#(<= ~counter~0 1)} #84#return; {2380#(<= ~counter~0 1)} is VALID [2022-04-27 13:32:47,428 INFO L290 TraceCheckUtils]: 22: Hoare triple {2338#true} assume true; {2338#true} is VALID [2022-04-27 13:32:47,428 INFO L290 TraceCheckUtils]: 21: Hoare triple {2338#true} assume !(0 == ~cond); {2338#true} is VALID [2022-04-27 13:32:47,428 INFO L290 TraceCheckUtils]: 20: Hoare triple {2338#true} ~cond := #in~cond; {2338#true} is VALID [2022-04-27 13:32:47,428 INFO L272 TraceCheckUtils]: 19: Hoare triple {2380#(<= ~counter~0 1)} call __VERIFIER_assert((if ~r~0 % 4294967296 == ~A~0 % 4294967296 then 1 else 0)); {2338#true} is VALID [2022-04-27 13:32:47,430 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {2338#true} {2380#(<= ~counter~0 1)} #82#return; {2380#(<= ~counter~0 1)} is VALID [2022-04-27 13:32:47,430 INFO L290 TraceCheckUtils]: 17: Hoare triple {2338#true} assume true; {2338#true} is VALID [2022-04-27 13:32:47,430 INFO L290 TraceCheckUtils]: 16: Hoare triple {2338#true} assume !(0 == ~cond); {2338#true} is VALID [2022-04-27 13:32:47,430 INFO L290 TraceCheckUtils]: 15: Hoare triple {2338#true} ~cond := #in~cond; {2338#true} is VALID [2022-04-27 13:32:47,430 INFO L272 TraceCheckUtils]: 14: Hoare triple {2380#(<= ~counter~0 1)} call __VERIFIER_assert((if 0 == ~q~0 % 4294967296 then 1 else 0)); {2338#true} is VALID [2022-04-27 13:32:47,431 INFO L290 TraceCheckUtils]: 13: Hoare triple {2380#(<= ~counter~0 1)} assume !!(#t~post6 < 2);havoc #t~post6; {2380#(<= ~counter~0 1)} is VALID [2022-04-27 13:32:47,431 INFO L290 TraceCheckUtils]: 12: Hoare triple {2346#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {2380#(<= ~counter~0 1)} is VALID [2022-04-27 13:32:47,432 INFO L290 TraceCheckUtils]: 11: Hoare triple {2346#(<= ~counter~0 0)} ~r~0 := ~A~0;~d~0 := ~B~0;~p~0 := 1;~q~0 := 0; {2346#(<= ~counter~0 0)} is VALID [2022-04-27 13:32:47,432 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2338#true} {2346#(<= ~counter~0 0)} #80#return; {2346#(<= ~counter~0 0)} is VALID [2022-04-27 13:32:47,432 INFO L290 TraceCheckUtils]: 9: Hoare triple {2338#true} assume true; {2338#true} is VALID [2022-04-27 13:32:47,432 INFO L290 TraceCheckUtils]: 8: Hoare triple {2338#true} assume !(0 == ~cond); {2338#true} is VALID [2022-04-27 13:32:47,432 INFO L290 TraceCheckUtils]: 7: Hoare triple {2338#true} ~cond := #in~cond; {2338#true} is VALID [2022-04-27 13:32:47,432 INFO L272 TraceCheckUtils]: 6: Hoare triple {2346#(<= ~counter~0 0)} call assume_abort_if_not((if ~B~0 % 4294967296 >= 1 then 1 else 0)); {2338#true} is VALID [2022-04-27 13:32:47,433 INFO L290 TraceCheckUtils]: 5: Hoare triple {2346#(<= ~counter~0 0)} havoc ~A~0;havoc ~B~0;havoc ~r~0;havoc ~d~0;havoc ~p~0;havoc ~q~0;~A~0 := #t~nondet4;havoc #t~nondet4;~B~0 := #t~nondet5;havoc #t~nondet5; {2346#(<= ~counter~0 0)} is VALID [2022-04-27 13:32:47,433 INFO L272 TraceCheckUtils]: 4: Hoare triple {2346#(<= ~counter~0 0)} call #t~ret8 := main(); {2346#(<= ~counter~0 0)} is VALID [2022-04-27 13:32:47,433 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2346#(<= ~counter~0 0)} {2338#true} #96#return; {2346#(<= ~counter~0 0)} is VALID [2022-04-27 13:32:47,434 INFO L290 TraceCheckUtils]: 2: Hoare triple {2346#(<= ~counter~0 0)} assume true; {2346#(<= ~counter~0 0)} is VALID [2022-04-27 13:32:47,434 INFO L290 TraceCheckUtils]: 1: Hoare triple {2338#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {2346#(<= ~counter~0 0)} is VALID [2022-04-27 13:32:47,434 INFO L272 TraceCheckUtils]: 0: Hoare triple {2338#true} call ULTIMATE.init(); {2338#true} is VALID [2022-04-27 13:32:47,434 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-04-27 13:32:47,435 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 13:32:47,435 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [67655807] [2022-04-27 13:32:47,435 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 13:32:47,435 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [564546670] [2022-04-27 13:32:47,435 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [564546670] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 13:32:47,435 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-27 13:32:47,435 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5 [2022-04-27 13:32:47,435 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [25313163] [2022-04-27 13:32:47,435 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-27 13:32:47,436 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 4 states have call successors, (11), 4 states have call predecessors, (11), 3 states have return successors, (9), 2 states have call predecessors, (9), 3 states have call successors, (9) Word has length 38 [2022-04-27 13:32:47,437 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 13:32:47,437 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 4 states have call successors, (11), 4 states have call predecessors, (11), 3 states have return successors, (9), 2 states have call predecessors, (9), 3 states have call successors, (9) [2022-04-27 13:32:47,473 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 13:32:47,473 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-27 13:32:47,473 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 13:32:47,474 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-27 13:32:47,474 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-04-27 13:32:47,474 INFO L87 Difference]: Start difference. First operand 78 states and 93 transitions. Second operand has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 4 states have call successors, (11), 4 states have call predecessors, (11), 3 states have return successors, (9), 2 states have call predecessors, (9), 3 states have call successors, (9) [2022-04-27 13:32:47,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:32:47,777 INFO L93 Difference]: Finished difference Result 94 states and 115 transitions. [2022-04-27 13:32:47,777 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-27 13:32:47,777 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 4 states have call successors, (11), 4 states have call predecessors, (11), 3 states have return successors, (9), 2 states have call predecessors, (9), 3 states have call successors, (9) Word has length 38 [2022-04-27 13:32:47,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 13:32:47,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 4 states have call successors, (11), 4 states have call predecessors, (11), 3 states have return successors, (9), 2 states have call predecessors, (9), 3 states have call successors, (9) [2022-04-27 13:32:47,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 78 transitions. [2022-04-27 13:32:47,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 4 states have call successors, (11), 4 states have call predecessors, (11), 3 states have return successors, (9), 2 states have call predecessors, (9), 3 states have call successors, (9) [2022-04-27 13:32:47,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 78 transitions. [2022-04-27 13:32:47,781 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 78 transitions. [2022-04-27 13:32:47,864 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 78 edges. 78 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 13:32:47,866 INFO L225 Difference]: With dead ends: 94 [2022-04-27 13:32:47,866 INFO L226 Difference]: Without dead ends: 80 [2022-04-27 13:32:47,867 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 71 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-04-27 13:32:47,867 INFO L413 NwaCegarLoop]: 42 mSDtfsCounter, 7 mSDsluCounter, 74 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 116 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 13:32:47,867 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 116 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 13:32:47,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2022-04-27 13:32:47,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2022-04-27 13:32:47,890 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 13:32:47,890 INFO L82 GeneralOperation]: Start isEquivalent. First operand 80 states. Second operand has 80 states, 51 states have (on average 1.196078431372549) internal successors, (61), 53 states have internal predecessors, (61), 18 states have call successors, (18), 11 states have call predecessors, (18), 10 states have return successors, (16), 15 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-27 13:32:47,891 INFO L74 IsIncluded]: Start isIncluded. First operand 80 states. Second operand has 80 states, 51 states have (on average 1.196078431372549) internal successors, (61), 53 states have internal predecessors, (61), 18 states have call successors, (18), 11 states have call predecessors, (18), 10 states have return successors, (16), 15 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-27 13:32:47,891 INFO L87 Difference]: Start difference. First operand 80 states. Second operand has 80 states, 51 states have (on average 1.196078431372549) internal successors, (61), 53 states have internal predecessors, (61), 18 states have call successors, (18), 11 states have call predecessors, (18), 10 states have return successors, (16), 15 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-27 13:32:47,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:32:47,894 INFO L93 Difference]: Finished difference Result 80 states and 95 transitions. [2022-04-27 13:32:47,894 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 95 transitions. [2022-04-27 13:32:47,895 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:32:47,895 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:32:47,896 INFO L74 IsIncluded]: Start isIncluded. First operand has 80 states, 51 states have (on average 1.196078431372549) internal successors, (61), 53 states have internal predecessors, (61), 18 states have call successors, (18), 11 states have call predecessors, (18), 10 states have return successors, (16), 15 states have call predecessors, (16), 16 states have call successors, (16) Second operand 80 states. [2022-04-27 13:32:47,896 INFO L87 Difference]: Start difference. First operand has 80 states, 51 states have (on average 1.196078431372549) internal successors, (61), 53 states have internal predecessors, (61), 18 states have call successors, (18), 11 states have call predecessors, (18), 10 states have return successors, (16), 15 states have call predecessors, (16), 16 states have call successors, (16) Second operand 80 states. [2022-04-27 13:32:47,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:32:47,899 INFO L93 Difference]: Finished difference Result 80 states and 95 transitions. [2022-04-27 13:32:47,899 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 95 transitions. [2022-04-27 13:32:47,899 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:32:47,899 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:32:47,900 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 13:32:47,900 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 13:32:47,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 51 states have (on average 1.196078431372549) internal successors, (61), 53 states have internal predecessors, (61), 18 states have call successors, (18), 11 states have call predecessors, (18), 10 states have return successors, (16), 15 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-27 13:32:47,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 95 transitions. [2022-04-27 13:32:47,904 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 95 transitions. Word has length 38 [2022-04-27 13:32:47,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 13:32:47,904 INFO L495 AbstractCegarLoop]: Abstraction has 80 states and 95 transitions. [2022-04-27 13:32:47,905 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 4 states have call successors, (11), 4 states have call predecessors, (11), 3 states have return successors, (9), 2 states have call predecessors, (9), 3 states have call successors, (9) [2022-04-27 13:32:47,905 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 95 transitions. [2022-04-27 13:32:47,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-04-27 13:32:47,905 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 13:32:47,905 INFO L195 NwaCegarLoop]: trace histogram [6, 5, 5, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 13:32:47,934 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-04-27 13:32:48,122 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 13:32:48,123 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 13:32:48,123 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 13:32:48,124 INFO L85 PathProgramCache]: Analyzing trace with hash 1861890039, now seen corresponding path program 1 times [2022-04-27 13:32:48,124 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 13:32:48,124 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1320695098] [2022-04-27 13:32:48,124 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:32:48,124 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 13:32:48,142 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 13:32:48,143 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1672109200] [2022-04-27 13:32:48,143 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:32:48,143 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 13:32:48,143 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 13:32:48,144 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 13:32:48,145 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-04-27 13:32:48,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:32:48,270 INFO L263 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 16 conjunts are in the unsatisfiable core [2022-04-27 13:32:48,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 13:32:48,297 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 13:32:49,699 INFO L272 TraceCheckUtils]: 0: Hoare triple {2975#true} call ULTIMATE.init(); {2975#true} is VALID [2022-04-27 13:32:49,699 INFO L290 TraceCheckUtils]: 1: Hoare triple {2975#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {2975#true} is VALID [2022-04-27 13:32:49,699 INFO L290 TraceCheckUtils]: 2: Hoare triple {2975#true} assume true; {2975#true} is VALID [2022-04-27 13:32:49,699 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2975#true} {2975#true} #96#return; {2975#true} is VALID [2022-04-27 13:32:49,700 INFO L272 TraceCheckUtils]: 4: Hoare triple {2975#true} call #t~ret8 := main(); {2975#true} is VALID [2022-04-27 13:32:49,700 INFO L290 TraceCheckUtils]: 5: Hoare triple {2975#true} havoc ~A~0;havoc ~B~0;havoc ~r~0;havoc ~d~0;havoc ~p~0;havoc ~q~0;~A~0 := #t~nondet4;havoc #t~nondet4;~B~0 := #t~nondet5;havoc #t~nondet5; {2975#true} is VALID [2022-04-27 13:32:49,700 INFO L272 TraceCheckUtils]: 6: Hoare triple {2975#true} call assume_abort_if_not((if ~B~0 % 4294967296 >= 1 then 1 else 0)); {2975#true} is VALID [2022-04-27 13:32:49,700 INFO L290 TraceCheckUtils]: 7: Hoare triple {2975#true} ~cond := #in~cond; {3001#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-27 13:32:49,701 INFO L290 TraceCheckUtils]: 8: Hoare triple {3001#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {3005#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-27 13:32:49,701 INFO L290 TraceCheckUtils]: 9: Hoare triple {3005#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {3005#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-27 13:32:49,702 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {3005#(not (= |assume_abort_if_not_#in~cond| 0))} {2975#true} #80#return; {3012#(<= 1 (mod main_~B~0 4294967296))} is VALID [2022-04-27 13:32:49,702 INFO L290 TraceCheckUtils]: 11: Hoare triple {3012#(<= 1 (mod main_~B~0 4294967296))} ~r~0 := ~A~0;~d~0 := ~B~0;~p~0 := 1;~q~0 := 0; {3016#(and (<= 1 (mod main_~B~0 4294967296)) (= main_~B~0 main_~d~0) (= main_~p~0 1))} is VALID [2022-04-27 13:32:49,703 INFO L290 TraceCheckUtils]: 12: Hoare triple {3016#(and (<= 1 (mod main_~B~0 4294967296)) (= main_~B~0 main_~d~0) (= main_~p~0 1))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {3016#(and (<= 1 (mod main_~B~0 4294967296)) (= main_~B~0 main_~d~0) (= main_~p~0 1))} is VALID [2022-04-27 13:32:49,703 INFO L290 TraceCheckUtils]: 13: Hoare triple {3016#(and (<= 1 (mod main_~B~0 4294967296)) (= main_~B~0 main_~d~0) (= main_~p~0 1))} assume !!(#t~post6 < 2);havoc #t~post6; {3016#(and (<= 1 (mod main_~B~0 4294967296)) (= main_~B~0 main_~d~0) (= main_~p~0 1))} is VALID [2022-04-27 13:32:49,703 INFO L272 TraceCheckUtils]: 14: Hoare triple {3016#(and (<= 1 (mod main_~B~0 4294967296)) (= main_~B~0 main_~d~0) (= main_~p~0 1))} call __VERIFIER_assert((if 0 == ~q~0 % 4294967296 then 1 else 0)); {2975#true} is VALID [2022-04-27 13:32:49,703 INFO L290 TraceCheckUtils]: 15: Hoare triple {2975#true} ~cond := #in~cond; {2975#true} is VALID [2022-04-27 13:32:49,703 INFO L290 TraceCheckUtils]: 16: Hoare triple {2975#true} assume !(0 == ~cond); {2975#true} is VALID [2022-04-27 13:32:49,703 INFO L290 TraceCheckUtils]: 17: Hoare triple {2975#true} assume true; {2975#true} is VALID [2022-04-27 13:32:49,704 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {2975#true} {3016#(and (<= 1 (mod main_~B~0 4294967296)) (= main_~B~0 main_~d~0) (= main_~p~0 1))} #82#return; {3016#(and (<= 1 (mod main_~B~0 4294967296)) (= main_~B~0 main_~d~0) (= main_~p~0 1))} is VALID [2022-04-27 13:32:49,704 INFO L272 TraceCheckUtils]: 19: Hoare triple {3016#(and (<= 1 (mod main_~B~0 4294967296)) (= main_~B~0 main_~d~0) (= main_~p~0 1))} call __VERIFIER_assert((if ~r~0 % 4294967296 == ~A~0 % 4294967296 then 1 else 0)); {2975#true} is VALID [2022-04-27 13:32:49,704 INFO L290 TraceCheckUtils]: 20: Hoare triple {2975#true} ~cond := #in~cond; {2975#true} is VALID [2022-04-27 13:32:49,704 INFO L290 TraceCheckUtils]: 21: Hoare triple {2975#true} assume !(0 == ~cond); {2975#true} is VALID [2022-04-27 13:32:49,704 INFO L290 TraceCheckUtils]: 22: Hoare triple {2975#true} assume true; {2975#true} is VALID [2022-04-27 13:32:49,705 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {2975#true} {3016#(and (<= 1 (mod main_~B~0 4294967296)) (= main_~B~0 main_~d~0) (= main_~p~0 1))} #84#return; {3016#(and (<= 1 (mod main_~B~0 4294967296)) (= main_~B~0 main_~d~0) (= main_~p~0 1))} is VALID [2022-04-27 13:32:49,705 INFO L272 TraceCheckUtils]: 24: Hoare triple {3016#(and (<= 1 (mod main_~B~0 4294967296)) (= main_~B~0 main_~d~0) (= main_~p~0 1))} call __VERIFIER_assert((if ~d~0 % 4294967296 == ~B~0 * ~p~0 % 4294967296 then 1 else 0)); {2975#true} is VALID [2022-04-27 13:32:49,705 INFO L290 TraceCheckUtils]: 25: Hoare triple {2975#true} ~cond := #in~cond; {2975#true} is VALID [2022-04-27 13:32:49,705 INFO L290 TraceCheckUtils]: 26: Hoare triple {2975#true} assume !(0 == ~cond); {2975#true} is VALID [2022-04-27 13:32:49,705 INFO L290 TraceCheckUtils]: 27: Hoare triple {2975#true} assume true; {2975#true} is VALID [2022-04-27 13:32:49,706 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {2975#true} {3016#(and (<= 1 (mod main_~B~0 4294967296)) (= main_~B~0 main_~d~0) (= main_~p~0 1))} #86#return; {3016#(and (<= 1 (mod main_~B~0 4294967296)) (= main_~B~0 main_~d~0) (= main_~p~0 1))} is VALID [2022-04-27 13:32:49,707 INFO L290 TraceCheckUtils]: 29: Hoare triple {3016#(and (<= 1 (mod main_~B~0 4294967296)) (= main_~B~0 main_~d~0) (= main_~p~0 1))} assume !!(~r~0 % 4294967296 >= ~d~0 % 4294967296);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {3071#(and (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (<= 1 (mod main_~B~0 4294967296)))} is VALID [2022-04-27 13:32:49,707 INFO L290 TraceCheckUtils]: 30: Hoare triple {3071#(and (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (<= 1 (mod main_~B~0 4294967296)))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {3071#(and (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (<= 1 (mod main_~B~0 4294967296)))} is VALID [2022-04-27 13:32:49,708 INFO L290 TraceCheckUtils]: 31: Hoare triple {3071#(and (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (<= 1 (mod main_~B~0 4294967296)))} assume !!(#t~post6 < 2);havoc #t~post6; {3071#(and (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (<= 1 (mod main_~B~0 4294967296)))} is VALID [2022-04-27 13:32:49,708 INFO L272 TraceCheckUtils]: 32: Hoare triple {3071#(and (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (<= 1 (mod main_~B~0 4294967296)))} call __VERIFIER_assert((if 0 == ~q~0 % 4294967296 then 1 else 0)); {2975#true} is VALID [2022-04-27 13:32:49,708 INFO L290 TraceCheckUtils]: 33: Hoare triple {2975#true} ~cond := #in~cond; {2975#true} is VALID [2022-04-27 13:32:49,708 INFO L290 TraceCheckUtils]: 34: Hoare triple {2975#true} assume !(0 == ~cond); {2975#true} is VALID [2022-04-27 13:32:49,708 INFO L290 TraceCheckUtils]: 35: Hoare triple {2975#true} assume true; {2975#true} is VALID [2022-04-27 13:32:49,709 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {2975#true} {3071#(and (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (<= 1 (mod main_~B~0 4294967296)))} #82#return; {3071#(and (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (<= 1 (mod main_~B~0 4294967296)))} is VALID [2022-04-27 13:32:49,709 INFO L272 TraceCheckUtils]: 37: Hoare triple {3071#(and (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (<= 1 (mod main_~B~0 4294967296)))} call __VERIFIER_assert((if ~r~0 % 4294967296 == ~A~0 % 4294967296 then 1 else 0)); {2975#true} is VALID [2022-04-27 13:32:49,709 INFO L290 TraceCheckUtils]: 38: Hoare triple {2975#true} ~cond := #in~cond; {2975#true} is VALID [2022-04-27 13:32:49,709 INFO L290 TraceCheckUtils]: 39: Hoare triple {2975#true} assume !(0 == ~cond); {2975#true} is VALID [2022-04-27 13:32:49,709 INFO L290 TraceCheckUtils]: 40: Hoare triple {2975#true} assume true; {2975#true} is VALID [2022-04-27 13:32:49,712 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {2975#true} {3071#(and (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (<= 1 (mod main_~B~0 4294967296)))} #84#return; {3071#(and (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (<= 1 (mod main_~B~0 4294967296)))} is VALID [2022-04-27 13:32:49,717 INFO L272 TraceCheckUtils]: 42: Hoare triple {3071#(and (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (<= 1 (mod main_~B~0 4294967296)))} call __VERIFIER_assert((if ~d~0 % 4294967296 == ~B~0 * ~p~0 % 4294967296 then 1 else 0)); {3111#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 13:32:49,718 INFO L290 TraceCheckUtils]: 43: Hoare triple {3111#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {3115#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 13:32:49,718 INFO L290 TraceCheckUtils]: 44: Hoare triple {3115#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2976#false} is VALID [2022-04-27 13:32:49,718 INFO L290 TraceCheckUtils]: 45: Hoare triple {2976#false} assume !false; {2976#false} is VALID [2022-04-27 13:32:49,719 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 10 proven. 5 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2022-04-27 13:32:49,719 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 13:32:51,675 INFO L290 TraceCheckUtils]: 45: Hoare triple {2976#false} assume !false; {2976#false} is VALID [2022-04-27 13:32:51,676 INFO L290 TraceCheckUtils]: 44: Hoare triple {3115#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2976#false} is VALID [2022-04-27 13:32:51,676 INFO L290 TraceCheckUtils]: 43: Hoare triple {3111#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {3115#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 13:32:51,677 INFO L272 TraceCheckUtils]: 42: Hoare triple {3131#(= (mod main_~d~0 4294967296) (mod (* main_~B~0 main_~p~0) 4294967296))} call __VERIFIER_assert((if ~d~0 % 4294967296 == ~B~0 * ~p~0 % 4294967296 then 1 else 0)); {3111#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 13:32:51,678 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {2975#true} {3131#(= (mod main_~d~0 4294967296) (mod (* main_~B~0 main_~p~0) 4294967296))} #84#return; {3131#(= (mod main_~d~0 4294967296) (mod (* main_~B~0 main_~p~0) 4294967296))} is VALID [2022-04-27 13:32:51,678 INFO L290 TraceCheckUtils]: 40: Hoare triple {2975#true} assume true; {2975#true} is VALID [2022-04-27 13:32:51,678 INFO L290 TraceCheckUtils]: 39: Hoare triple {2975#true} assume !(0 == ~cond); {2975#true} is VALID [2022-04-27 13:32:51,678 INFO L290 TraceCheckUtils]: 38: Hoare triple {2975#true} ~cond := #in~cond; {2975#true} is VALID [2022-04-27 13:32:51,678 INFO L272 TraceCheckUtils]: 37: Hoare triple {3131#(= (mod main_~d~0 4294967296) (mod (* main_~B~0 main_~p~0) 4294967296))} call __VERIFIER_assert((if ~r~0 % 4294967296 == ~A~0 % 4294967296 then 1 else 0)); {2975#true} is VALID [2022-04-27 13:32:51,679 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {2975#true} {3131#(= (mod main_~d~0 4294967296) (mod (* main_~B~0 main_~p~0) 4294967296))} #82#return; {3131#(= (mod main_~d~0 4294967296) (mod (* main_~B~0 main_~p~0) 4294967296))} is VALID [2022-04-27 13:32:51,679 INFO L290 TraceCheckUtils]: 35: Hoare triple {2975#true} assume true; {2975#true} is VALID [2022-04-27 13:32:51,679 INFO L290 TraceCheckUtils]: 34: Hoare triple {2975#true} assume !(0 == ~cond); {2975#true} is VALID [2022-04-27 13:32:51,679 INFO L290 TraceCheckUtils]: 33: Hoare triple {2975#true} ~cond := #in~cond; {2975#true} is VALID [2022-04-27 13:32:51,679 INFO L272 TraceCheckUtils]: 32: Hoare triple {3131#(= (mod main_~d~0 4294967296) (mod (* main_~B~0 main_~p~0) 4294967296))} call __VERIFIER_assert((if 0 == ~q~0 % 4294967296 then 1 else 0)); {2975#true} is VALID [2022-04-27 13:32:51,680 INFO L290 TraceCheckUtils]: 31: Hoare triple {3131#(= (mod main_~d~0 4294967296) (mod (* main_~B~0 main_~p~0) 4294967296))} assume !!(#t~post6 < 2);havoc #t~post6; {3131#(= (mod main_~d~0 4294967296) (mod (* main_~B~0 main_~p~0) 4294967296))} is VALID [2022-04-27 13:32:51,681 INFO L290 TraceCheckUtils]: 30: Hoare triple {3131#(= (mod main_~d~0 4294967296) (mod (* main_~B~0 main_~p~0) 4294967296))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {3131#(= (mod main_~d~0 4294967296) (mod (* main_~B~0 main_~p~0) 4294967296))} is VALID [2022-04-27 13:32:53,686 WARN L290 TraceCheckUtils]: 29: Hoare triple {3171#(= (mod (* main_~d~0 2) 4294967296) (mod (* (* main_~p~0 2) main_~B~0) 4294967296))} assume !!(~r~0 % 4294967296 >= ~d~0 % 4294967296);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {3131#(= (mod main_~d~0 4294967296) (mod (* main_~B~0 main_~p~0) 4294967296))} is UNKNOWN [2022-04-27 13:32:53,687 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {2975#true} {3171#(= (mod (* main_~d~0 2) 4294967296) (mod (* (* main_~p~0 2) main_~B~0) 4294967296))} #86#return; {3171#(= (mod (* main_~d~0 2) 4294967296) (mod (* (* main_~p~0 2) main_~B~0) 4294967296))} is VALID [2022-04-27 13:32:53,687 INFO L290 TraceCheckUtils]: 27: Hoare triple {2975#true} assume true; {2975#true} is VALID [2022-04-27 13:32:53,687 INFO L290 TraceCheckUtils]: 26: Hoare triple {2975#true} assume !(0 == ~cond); {2975#true} is VALID [2022-04-27 13:32:53,687 INFO L290 TraceCheckUtils]: 25: Hoare triple {2975#true} ~cond := #in~cond; {2975#true} is VALID [2022-04-27 13:32:53,687 INFO L272 TraceCheckUtils]: 24: Hoare triple {3171#(= (mod (* main_~d~0 2) 4294967296) (mod (* (* main_~p~0 2) main_~B~0) 4294967296))} call __VERIFIER_assert((if ~d~0 % 4294967296 == ~B~0 * ~p~0 % 4294967296 then 1 else 0)); {2975#true} is VALID [2022-04-27 13:32:53,688 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {2975#true} {3171#(= (mod (* main_~d~0 2) 4294967296) (mod (* (* main_~p~0 2) main_~B~0) 4294967296))} #84#return; {3171#(= (mod (* main_~d~0 2) 4294967296) (mod (* (* main_~p~0 2) main_~B~0) 4294967296))} is VALID [2022-04-27 13:32:53,688 INFO L290 TraceCheckUtils]: 22: Hoare triple {2975#true} assume true; {2975#true} is VALID [2022-04-27 13:32:53,688 INFO L290 TraceCheckUtils]: 21: Hoare triple {2975#true} assume !(0 == ~cond); {2975#true} is VALID [2022-04-27 13:32:53,688 INFO L290 TraceCheckUtils]: 20: Hoare triple {2975#true} ~cond := #in~cond; {2975#true} is VALID [2022-04-27 13:32:53,688 INFO L272 TraceCheckUtils]: 19: Hoare triple {3171#(= (mod (* main_~d~0 2) 4294967296) (mod (* (* main_~p~0 2) main_~B~0) 4294967296))} call __VERIFIER_assert((if ~r~0 % 4294967296 == ~A~0 % 4294967296 then 1 else 0)); {2975#true} is VALID [2022-04-27 13:32:53,689 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {2975#true} {3171#(= (mod (* main_~d~0 2) 4294967296) (mod (* (* main_~p~0 2) main_~B~0) 4294967296))} #82#return; {3171#(= (mod (* main_~d~0 2) 4294967296) (mod (* (* main_~p~0 2) main_~B~0) 4294967296))} is VALID [2022-04-27 13:32:53,689 INFO L290 TraceCheckUtils]: 17: Hoare triple {2975#true} assume true; {2975#true} is VALID [2022-04-27 13:32:53,689 INFO L290 TraceCheckUtils]: 16: Hoare triple {2975#true} assume !(0 == ~cond); {2975#true} is VALID [2022-04-27 13:32:53,689 INFO L290 TraceCheckUtils]: 15: Hoare triple {2975#true} ~cond := #in~cond; {2975#true} is VALID [2022-04-27 13:32:53,689 INFO L272 TraceCheckUtils]: 14: Hoare triple {3171#(= (mod (* main_~d~0 2) 4294967296) (mod (* (* main_~p~0 2) main_~B~0) 4294967296))} call __VERIFIER_assert((if 0 == ~q~0 % 4294967296 then 1 else 0)); {2975#true} is VALID [2022-04-27 13:32:53,690 INFO L290 TraceCheckUtils]: 13: Hoare triple {3171#(= (mod (* main_~d~0 2) 4294967296) (mod (* (* main_~p~0 2) main_~B~0) 4294967296))} assume !!(#t~post6 < 2);havoc #t~post6; {3171#(= (mod (* main_~d~0 2) 4294967296) (mod (* (* main_~p~0 2) main_~B~0) 4294967296))} is VALID [2022-04-27 13:32:53,691 INFO L290 TraceCheckUtils]: 12: Hoare triple {3171#(= (mod (* main_~d~0 2) 4294967296) (mod (* (* main_~p~0 2) main_~B~0) 4294967296))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {3171#(= (mod (* main_~d~0 2) 4294967296) (mod (* (* main_~p~0 2) main_~B~0) 4294967296))} is VALID [2022-04-27 13:32:53,691 INFO L290 TraceCheckUtils]: 11: Hoare triple {2975#true} ~r~0 := ~A~0;~d~0 := ~B~0;~p~0 := 1;~q~0 := 0; {3171#(= (mod (* main_~d~0 2) 4294967296) (mod (* (* main_~p~0 2) main_~B~0) 4294967296))} is VALID [2022-04-27 13:32:53,691 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2975#true} {2975#true} #80#return; {2975#true} is VALID [2022-04-27 13:32:53,691 INFO L290 TraceCheckUtils]: 9: Hoare triple {2975#true} assume true; {2975#true} is VALID [2022-04-27 13:32:53,691 INFO L290 TraceCheckUtils]: 8: Hoare triple {2975#true} assume !(0 == ~cond); {2975#true} is VALID [2022-04-27 13:32:53,692 INFO L290 TraceCheckUtils]: 7: Hoare triple {2975#true} ~cond := #in~cond; {2975#true} is VALID [2022-04-27 13:32:53,692 INFO L272 TraceCheckUtils]: 6: Hoare triple {2975#true} call assume_abort_if_not((if ~B~0 % 4294967296 >= 1 then 1 else 0)); {2975#true} is VALID [2022-04-27 13:32:53,692 INFO L290 TraceCheckUtils]: 5: Hoare triple {2975#true} havoc ~A~0;havoc ~B~0;havoc ~r~0;havoc ~d~0;havoc ~p~0;havoc ~q~0;~A~0 := #t~nondet4;havoc #t~nondet4;~B~0 := #t~nondet5;havoc #t~nondet5; {2975#true} is VALID [2022-04-27 13:32:53,692 INFO L272 TraceCheckUtils]: 4: Hoare triple {2975#true} call #t~ret8 := main(); {2975#true} is VALID [2022-04-27 13:32:53,692 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2975#true} {2975#true} #96#return; {2975#true} is VALID [2022-04-27 13:32:53,692 INFO L290 TraceCheckUtils]: 2: Hoare triple {2975#true} assume true; {2975#true} is VALID [2022-04-27 13:32:53,692 INFO L290 TraceCheckUtils]: 1: Hoare triple {2975#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {2975#true} is VALID [2022-04-27 13:32:53,692 INFO L272 TraceCheckUtils]: 0: Hoare triple {2975#true} call ULTIMATE.init(); {2975#true} is VALID [2022-04-27 13:32:53,693 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2022-04-27 13:32:53,693 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 13:32:53,693 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1320695098] [2022-04-27 13:32:53,693 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 13:32:53,693 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1672109200] [2022-04-27 13:32:53,693 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1672109200] provided 1 perfect and 1 imperfect interpolant sequences [2022-04-27 13:32:53,693 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-04-27 13:32:53,693 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [9] total 11 [2022-04-27 13:32:53,693 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1072837553] [2022-04-27 13:32:53,693 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 13:32:53,694 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 3 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 46 [2022-04-27 13:32:53,694 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 13:32:53,694 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 3 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-04-27 13:32:55,803 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 34 edges. 33 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-27 13:32:55,803 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-27 13:32:55,803 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 13:32:55,804 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-27 13:32:55,804 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2022-04-27 13:32:55,804 INFO L87 Difference]: Start difference. First operand 80 states and 95 transitions. Second operand has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 3 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-04-27 13:32:58,963 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-27 13:33:02,186 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.27s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-27 13:33:04,203 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-27 13:33:06,402 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.20s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-27 13:33:08,599 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.20s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-27 13:33:12,710 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-27 13:33:12,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:33:12,904 INFO L93 Difference]: Finished difference Result 93 states and 112 transitions. [2022-04-27 13:33:12,904 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-27 13:33:12,904 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 3 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 46 [2022-04-27 13:33:12,904 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 13:33:12,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 3 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-04-27 13:33:12,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 59 transitions. [2022-04-27 13:33:12,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 3 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-04-27 13:33:12,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 59 transitions. [2022-04-27 13:33:12,907 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 59 transitions. [2022-04-27 13:33:14,984 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 59 edges. 58 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-27 13:33:14,986 INFO L225 Difference]: With dead ends: 93 [2022-04-27 13:33:14,986 INFO L226 Difference]: Without dead ends: 91 [2022-04-27 13:33:14,987 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 81 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2022-04-27 13:33:14,987 INFO L413 NwaCegarLoop]: 44 mSDtfsCounter, 17 mSDsluCounter, 93 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 5 mSolverCounterUnsat, 5 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 11.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 137 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 5 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 12.3s IncrementalHoareTripleChecker+Time [2022-04-27 13:33:14,987 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 137 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 49 Invalid, 5 Unknown, 0 Unchecked, 12.3s Time] [2022-04-27 13:33:14,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2022-04-27 13:33:15,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 88. [2022-04-27 13:33:15,015 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 13:33:15,015 INFO L82 GeneralOperation]: Start isEquivalent. First operand 91 states. Second operand has 88 states, 56 states have (on average 1.1964285714285714) internal successors, (67), 59 states have internal predecessors, (67), 20 states have call successors, (20), 12 states have call predecessors, (20), 11 states have return successors, (18), 16 states have call predecessors, (18), 18 states have call successors, (18) [2022-04-27 13:33:15,015 INFO L74 IsIncluded]: Start isIncluded. First operand 91 states. Second operand has 88 states, 56 states have (on average 1.1964285714285714) internal successors, (67), 59 states have internal predecessors, (67), 20 states have call successors, (20), 12 states have call predecessors, (20), 11 states have return successors, (18), 16 states have call predecessors, (18), 18 states have call successors, (18) [2022-04-27 13:33:15,016 INFO L87 Difference]: Start difference. First operand 91 states. Second operand has 88 states, 56 states have (on average 1.1964285714285714) internal successors, (67), 59 states have internal predecessors, (67), 20 states have call successors, (20), 12 states have call predecessors, (20), 11 states have return successors, (18), 16 states have call predecessors, (18), 18 states have call successors, (18) [2022-04-27 13:33:15,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:33:15,018 INFO L93 Difference]: Finished difference Result 91 states and 110 transitions. [2022-04-27 13:33:15,019 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 110 transitions. [2022-04-27 13:33:15,019 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:33:15,019 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:33:15,020 INFO L74 IsIncluded]: Start isIncluded. First operand has 88 states, 56 states have (on average 1.1964285714285714) internal successors, (67), 59 states have internal predecessors, (67), 20 states have call successors, (20), 12 states have call predecessors, (20), 11 states have return successors, (18), 16 states have call predecessors, (18), 18 states have call successors, (18) Second operand 91 states. [2022-04-27 13:33:15,020 INFO L87 Difference]: Start difference. First operand has 88 states, 56 states have (on average 1.1964285714285714) internal successors, (67), 59 states have internal predecessors, (67), 20 states have call successors, (20), 12 states have call predecessors, (20), 11 states have return successors, (18), 16 states have call predecessors, (18), 18 states have call successors, (18) Second operand 91 states. [2022-04-27 13:33:15,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 13:33:15,023 INFO L93 Difference]: Finished difference Result 91 states and 110 transitions. [2022-04-27 13:33:15,023 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 110 transitions. [2022-04-27 13:33:15,023 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 13:33:15,024 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 13:33:15,024 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 13:33:15,024 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 13:33:15,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 56 states have (on average 1.1964285714285714) internal successors, (67), 59 states have internal predecessors, (67), 20 states have call successors, (20), 12 states have call predecessors, (20), 11 states have return successors, (18), 16 states have call predecessors, (18), 18 states have call successors, (18) [2022-04-27 13:33:15,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 105 transitions. [2022-04-27 13:33:15,027 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 105 transitions. Word has length 46 [2022-04-27 13:33:15,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 13:33:15,027 INFO L495 AbstractCegarLoop]: Abstraction has 88 states and 105 transitions. [2022-04-27 13:33:15,027 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 3 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-04-27 13:33:15,028 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 105 transitions. [2022-04-27 13:33:15,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2022-04-27 13:33:15,028 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 13:33:15,028 INFO L195 NwaCegarLoop]: trace histogram [6, 5, 5, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 13:33:15,035 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-04-27 13:33:15,233 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 13:33:15,234 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 13:33:15,234 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 13:33:15,234 INFO L85 PathProgramCache]: Analyzing trace with hash -399036107, now seen corresponding path program 1 times [2022-04-27 13:33:15,234 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 13:33:15,234 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1537828562] [2022-04-27 13:33:15,234 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:33:15,234 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 13:33:15,249 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 13:33:15,250 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [188146481] [2022-04-27 13:33:15,250 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 13:33:15,250 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 13:33:15,250 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 13:33:15,267 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 13:33:15,271 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process