/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/hard-u.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-fb4f59a-m [2022-04-27 11:52:14,260 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-27 11:52:14,261 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-27 11:52:14,302 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-27 11:52:14,302 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-27 11:52:14,303 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-27 11:52:14,304 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-27 11:52:14,305 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-27 11:52:14,305 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-27 11:52:14,306 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-27 11:52:14,306 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-27 11:52:14,307 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-27 11:52:14,307 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-27 11:52:14,321 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-27 11:52:14,321 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-27 11:52:14,322 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-27 11:52:14,322 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-27 11:52:14,323 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-27 11:52:14,324 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-27 11:52:14,325 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-27 11:52:14,325 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-27 11:52:14,326 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-27 11:52:14,326 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-27 11:52:14,327 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-27 11:52:14,327 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-27 11:52:14,329 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-27 11:52:14,329 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-27 11:52:14,329 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-27 11:52:14,330 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-27 11:52:14,332 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-27 11:52:14,332 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-27 11:52:14,332 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-27 11:52:14,333 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-27 11:52:14,333 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-27 11:52:14,334 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-27 11:52:14,334 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-27 11:52:14,334 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-27 11:52:14,335 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-27 11:52:14,335 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-27 11:52:14,335 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-27 11:52:14,335 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-27 11:52:14,338 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-27 11:52:14,338 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 11:52:14,359 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-27 11:52:14,359 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-27 11:52:14,359 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-04-27 11:52:14,359 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-04-27 11:52:14,360 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-04-27 11:52:14,360 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-04-27 11:52:14,360 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-04-27 11:52:14,360 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-04-27 11:52:14,360 INFO L138 SettingsManager]: * Use SBE=true [2022-04-27 11:52:14,361 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-27 11:52:14,361 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-27 11:52:14,361 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-27 11:52:14,361 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-27 11:52:14,361 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-27 11:52:14,361 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-27 11:52:14,361 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-27 11:52:14,361 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-27 11:52:14,361 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-27 11:52:14,362 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-27 11:52:14,362 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-27 11:52:14,362 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-27 11:52:14,362 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-27 11:52:14,363 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-27 11:52:14,363 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-27 11:52:14,363 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 11:52:14,363 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-27 11:52:14,363 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-04-27 11:52:14,363 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-04-27 11:52:14,364 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-04-27 11:52:14,364 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-04-27 11:52:14,364 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-04-27 11:52:14,364 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-04-27 11:52:14,364 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-27 11:52:14,364 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 11:52:14,549 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-27 11:52:14,565 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-27 11:52:14,566 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-27 11:52:14,567 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-27 11:52:14,568 INFO L275 PluginConnector]: CDTParser initialized [2022-04-27 11:52:14,568 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/nla-digbench/hard-u.c [2022-04-27 11:52:14,619 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/02ff73d5c/a31d60e6b46c48b499d1737f0df0de3e/FLAGce9a475aa [2022-04-27 11:52:14,967 INFO L306 CDTParser]: Found 1 translation units. [2022-04-27 11:52:14,968 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench/hard-u.c [2022-04-27 11:52:14,972 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/02ff73d5c/a31d60e6b46c48b499d1737f0df0de3e/FLAGce9a475aa [2022-04-27 11:52:15,396 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/02ff73d5c/a31d60e6b46c48b499d1737f0df0de3e [2022-04-27 11:52:15,398 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-27 11:52:15,399 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-27 11:52:15,400 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-27 11:52:15,400 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-27 11:52:15,402 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-27 11:52:15,411 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 11:52:15" (1/1) ... [2022-04-27 11:52:15,413 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@65518949 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 11:52:15, skipping insertion in model container [2022-04-27 11:52:15,414 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 11:52:15" (1/1) ... [2022-04-27 11:52:15,424 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-27 11:52:15,435 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-27 11:52:15,545 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/hard-u.c[537,550] [2022-04-27 11:52:15,564 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 11:52:15,572 INFO L203 MainTranslator]: Completed pre-run [2022-04-27 11:52:15,580 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/hard-u.c[537,550] [2022-04-27 11:52:15,588 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 11:52:15,595 INFO L208 MainTranslator]: Completed translation [2022-04-27 11:52:15,596 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 11:52:15 WrapperNode [2022-04-27 11:52:15,596 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-27 11:52:15,597 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-27 11:52:15,597 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-27 11:52:15,597 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-27 11:52:15,603 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 11:52:15" (1/1) ... [2022-04-27 11:52:15,603 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 11:52:15" (1/1) ... [2022-04-27 11:52:15,607 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 11:52:15" (1/1) ... [2022-04-27 11:52:15,607 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 11:52:15" (1/1) ... [2022-04-27 11:52:15,611 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 11:52:15" (1/1) ... [2022-04-27 11:52:15,613 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 11:52:15" (1/1) ... [2022-04-27 11:52:15,614 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 11:52:15" (1/1) ... [2022-04-27 11:52:15,615 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-27 11:52:15,615 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-27 11:52:15,615 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-27 11:52:15,615 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-27 11:52:15,616 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 11:52:15" (1/1) ... [2022-04-27 11:52:15,627 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 11:52:15,646 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 11:52:15,671 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 11:52:15,673 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 11:52:15,712 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-27 11:52:15,712 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-27 11:52:15,712 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-27 11:52:15,712 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-27 11:52:15,713 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-27 11:52:15,713 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-27 11:52:15,713 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-27 11:52:15,713 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-27 11:52:15,713 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-27 11:52:15,713 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-27 11:52:15,713 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uint [2022-04-27 11:52:15,713 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-27 11:52:15,713 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-27 11:52:15,713 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-27 11:52:15,713 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-27 11:52:15,713 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-27 11:52:15,713 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-27 11:52:15,713 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-27 11:52:15,713 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-27 11:52:15,714 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-27 11:52:15,752 INFO L234 CfgBuilder]: Building ICFG [2022-04-27 11:52:15,753 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-27 11:52:15,871 INFO L275 CfgBuilder]: Performing block encoding [2022-04-27 11:52:15,876 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-27 11:52:15,876 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-04-27 11:52:15,877 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 11:52:15 BoogieIcfgContainer [2022-04-27 11:52:15,877 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-27 11:52:15,879 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-27 11:52:15,879 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-27 11:52:15,881 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-27 11:52:15,881 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.04 11:52:15" (1/3) ... [2022-04-27 11:52:15,881 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6783a0a8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 11:52:15, skipping insertion in model container [2022-04-27 11:52:15,882 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 11:52:15" (2/3) ... [2022-04-27 11:52:15,882 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6783a0a8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 11:52:15, skipping insertion in model container [2022-04-27 11:52:15,882 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 11:52:15" (3/3) ... [2022-04-27 11:52:15,883 INFO L111 eAbstractionObserver]: Analyzing ICFG hard-u.c [2022-04-27 11:52:15,892 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-04-27 11:52:15,892 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-27 11:52:15,921 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-27 11:52:15,926 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@42e992f3, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@2603cdb5 [2022-04-27 11:52:15,926 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-27 11:52:15,932 INFO L276 IsEmpty]: Start isEmpty. Operand has 35 states, 19 states have (on average 1.5263157894736843) internal successors, (29), 20 states have internal predecessors, (29), 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 11:52:15,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-04-27 11:52:15,938 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 11:52:15,938 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 11:52:15,939 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 11:52:15,942 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 11:52:15,942 INFO L85 PathProgramCache]: Analyzing trace with hash -977830905, now seen corresponding path program 1 times [2022-04-27 11:52:15,948 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 11:52:15,949 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [589866032] [2022-04-27 11:52:15,949 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 11:52:15,949 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 11:52:16,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:52:16,050 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 11:52:16,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:52:16,063 INFO L290 TraceCheckUtils]: 0: Hoare triple {47#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3); {38#true} is VALID [2022-04-27 11:52:16,063 INFO L290 TraceCheckUtils]: 1: Hoare triple {38#true} assume true; {38#true} is VALID [2022-04-27 11:52:16,064 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {38#true} {38#true} #94#return; {38#true} is VALID [2022-04-27 11:52:16,064 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-27 11:52:16,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:52:16,071 INFO L290 TraceCheckUtils]: 0: Hoare triple {38#true} ~cond := #in~cond; {38#true} is VALID [2022-04-27 11:52:16,071 INFO L290 TraceCheckUtils]: 1: Hoare triple {38#true} assume 0 == ~cond;assume false; {39#false} is VALID [2022-04-27 11:52:16,071 INFO L290 TraceCheckUtils]: 2: Hoare triple {39#false} assume true; {39#false} is VALID [2022-04-27 11:52:16,072 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {39#false} {38#true} #78#return; {39#false} is VALID [2022-04-27 11:52:16,072 INFO L272 TraceCheckUtils]: 0: Hoare triple {38#true} call ULTIMATE.init(); {47#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 11:52:16,073 INFO L290 TraceCheckUtils]: 1: Hoare triple {47#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3); {38#true} is VALID [2022-04-27 11:52:16,073 INFO L290 TraceCheckUtils]: 2: Hoare triple {38#true} assume true; {38#true} is VALID [2022-04-27 11:52:16,073 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {38#true} {38#true} #94#return; {38#true} is VALID [2022-04-27 11:52:16,073 INFO L272 TraceCheckUtils]: 4: Hoare triple {38#true} call #t~ret6 := main(); {38#true} is VALID [2022-04-27 11:52:16,073 INFO L290 TraceCheckUtils]: 5: Hoare triple {38#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; {38#true} is VALID [2022-04-27 11:52:16,073 INFO L272 TraceCheckUtils]: 6: Hoare triple {38#true} call assume_abort_if_not((if ~B~0 % 4294967296 >= 1 then 1 else 0)); {38#true} is VALID [2022-04-27 11:52:16,073 INFO L290 TraceCheckUtils]: 7: Hoare triple {38#true} ~cond := #in~cond; {38#true} is VALID [2022-04-27 11:52:16,074 INFO L290 TraceCheckUtils]: 8: Hoare triple {38#true} assume 0 == ~cond;assume false; {39#false} is VALID [2022-04-27 11:52:16,074 INFO L290 TraceCheckUtils]: 9: Hoare triple {39#false} assume true; {39#false} is VALID [2022-04-27 11:52:16,074 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {39#false} {38#true} #78#return; {39#false} is VALID [2022-04-27 11:52:16,074 INFO L290 TraceCheckUtils]: 11: Hoare triple {39#false} ~r~0 := ~A~0;~d~0 := ~B~0;~p~0 := 1;~q~0 := 0; {39#false} is VALID [2022-04-27 11:52:16,074 INFO L290 TraceCheckUtils]: 12: Hoare triple {39#false} assume !false; {39#false} is VALID [2022-04-27 11:52:16,075 INFO L272 TraceCheckUtils]: 13: Hoare triple {39#false} call __VERIFIER_assert((if 0 == ~q~0 % 4294967296 then 1 else 0)); {39#false} is VALID [2022-04-27 11:52:16,075 INFO L290 TraceCheckUtils]: 14: Hoare triple {39#false} ~cond := #in~cond; {39#false} is VALID [2022-04-27 11:52:16,075 INFO L290 TraceCheckUtils]: 15: Hoare triple {39#false} assume 0 == ~cond; {39#false} is VALID [2022-04-27 11:52:16,075 INFO L290 TraceCheckUtils]: 16: Hoare triple {39#false} assume !false; {39#false} is VALID [2022-04-27 11:52:16,075 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 11:52:16,076 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 11:52:16,076 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [589866032] [2022-04-27 11:52:16,076 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [589866032] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 11:52:16,076 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 11:52:16,077 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-27 11:52:16,078 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1316136991] [2022-04-27 11:52:16,078 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 11:52:16,081 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 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 17 [2022-04-27 11:52:16,083 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 11:52:16,085 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 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 11:52:16,100 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 11:52:16,100 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-27 11:52:16,101 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 11:52:16,114 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-27 11:52:16,115 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-27 11:52:16,117 INFO L87 Difference]: Start difference. First operand has 35 states, 19 states have (on average 1.5263157894736843) internal successors, (29), 20 states have internal predecessors, (29), 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 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 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 11:52:16,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:52:16,283 INFO L93 Difference]: Finished difference Result 61 states and 95 transitions. [2022-04-27 11:52:16,283 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-27 11:52:16,283 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 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 17 [2022-04-27 11:52:16,283 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 11:52:16,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 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 11:52:16,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 95 transitions. [2022-04-27 11:52:16,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 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 11:52:16,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 95 transitions. [2022-04-27 11:52:16,295 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 95 transitions. [2022-04-27 11:52:16,380 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 95 edges. 95 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 11:52:16,386 INFO L225 Difference]: With dead ends: 61 [2022-04-27 11:52:16,386 INFO L226 Difference]: Without dead ends: 30 [2022-04-27 11:52:16,388 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 11:52:16,390 INFO L413 NwaCegarLoop]: 35 mSDtfsCounter, 20 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 38 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 11:52:16,391 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 38 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 11:52:16,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2022-04-27 11:52:16,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2022-04-27 11:52:16,410 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 11:52:16,410 INFO L82 GeneralOperation]: Start isEquivalent. First operand 30 states. Second operand has 30 states, 16 states have (on average 1.25) internal successors, (20), 17 states have internal predecessors, (20), 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 11:52:16,411 INFO L74 IsIncluded]: Start isIncluded. First operand 30 states. Second operand has 30 states, 16 states have (on average 1.25) internal successors, (20), 17 states have internal predecessors, (20), 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 11:52:16,411 INFO L87 Difference]: Start difference. First operand 30 states. Second operand has 30 states, 16 states have (on average 1.25) internal successors, (20), 17 states have internal predecessors, (20), 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 11:52:16,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:52:16,414 INFO L93 Difference]: Finished difference Result 30 states and 38 transitions. [2022-04-27 11:52:16,415 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 38 transitions. [2022-04-27 11:52:16,415 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:52:16,415 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:52:16,416 INFO L74 IsIncluded]: Start isIncluded. First operand has 30 states, 16 states have (on average 1.25) internal successors, (20), 17 states have internal predecessors, (20), 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 30 states. [2022-04-27 11:52:16,416 INFO L87 Difference]: Start difference. First operand has 30 states, 16 states have (on average 1.25) internal successors, (20), 17 states have internal predecessors, (20), 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 30 states. [2022-04-27 11:52:16,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:52:16,418 INFO L93 Difference]: Finished difference Result 30 states and 38 transitions. [2022-04-27 11:52:16,418 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 38 transitions. [2022-04-27 11:52:16,419 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:52:16,419 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:52:16,419 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 11:52:16,419 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 11:52:16,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 16 states have (on average 1.25) internal successors, (20), 17 states have internal predecessors, (20), 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 11:52:16,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 38 transitions. [2022-04-27 11:52:16,422 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 38 transitions. Word has length 17 [2022-04-27 11:52:16,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 11:52:16,423 INFO L495 AbstractCegarLoop]: Abstraction has 30 states and 38 transitions. [2022-04-27 11:52:16,423 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 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 11:52:16,423 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 38 transitions. [2022-04-27 11:52:16,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-04-27 11:52:16,424 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 11:52:16,424 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 11:52:16,424 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-27 11:52:16,424 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 11:52:16,425 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 11:52:16,425 INFO L85 PathProgramCache]: Analyzing trace with hash -297772535, now seen corresponding path program 1 times [2022-04-27 11:52:16,425 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 11:52:16,425 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1691197717] [2022-04-27 11:52:16,425 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 11:52:16,425 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 11:52:16,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:52:16,482 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 11:52:16,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:52:16,489 INFO L290 TraceCheckUtils]: 0: Hoare triple {252#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3); {240#true} is VALID [2022-04-27 11:52:16,489 INFO L290 TraceCheckUtils]: 1: Hoare triple {240#true} assume true; {240#true} is VALID [2022-04-27 11:52:16,489 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {240#true} {240#true} #94#return; {240#true} is VALID [2022-04-27 11:52:16,489 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-27 11:52:16,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:52:16,494 INFO L290 TraceCheckUtils]: 0: Hoare triple {240#true} ~cond := #in~cond; {240#true} is VALID [2022-04-27 11:52:16,495 INFO L290 TraceCheckUtils]: 1: Hoare triple {240#true} assume !(0 == ~cond); {240#true} is VALID [2022-04-27 11:52:16,495 INFO L290 TraceCheckUtils]: 2: Hoare triple {240#true} assume true; {240#true} is VALID [2022-04-27 11:52:16,495 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {240#true} {240#true} #78#return; {240#true} is VALID [2022-04-27 11:52:16,496 INFO L272 TraceCheckUtils]: 0: Hoare triple {240#true} call ULTIMATE.init(); {252#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 11:52:16,496 INFO L290 TraceCheckUtils]: 1: Hoare triple {252#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3); {240#true} is VALID [2022-04-27 11:52:16,496 INFO L290 TraceCheckUtils]: 2: Hoare triple {240#true} assume true; {240#true} is VALID [2022-04-27 11:52:16,496 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {240#true} {240#true} #94#return; {240#true} is VALID [2022-04-27 11:52:16,496 INFO L272 TraceCheckUtils]: 4: Hoare triple {240#true} call #t~ret6 := main(); {240#true} is VALID [2022-04-27 11:52:16,496 INFO L290 TraceCheckUtils]: 5: Hoare triple {240#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; {240#true} is VALID [2022-04-27 11:52:16,496 INFO L272 TraceCheckUtils]: 6: Hoare triple {240#true} call assume_abort_if_not((if ~B~0 % 4294967296 >= 1 then 1 else 0)); {240#true} is VALID [2022-04-27 11:52:16,497 INFO L290 TraceCheckUtils]: 7: Hoare triple {240#true} ~cond := #in~cond; {240#true} is VALID [2022-04-27 11:52:16,497 INFO L290 TraceCheckUtils]: 8: Hoare triple {240#true} assume !(0 == ~cond); {240#true} is VALID [2022-04-27 11:52:16,497 INFO L290 TraceCheckUtils]: 9: Hoare triple {240#true} assume true; {240#true} is VALID [2022-04-27 11:52:16,497 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {240#true} {240#true} #78#return; {240#true} is VALID [2022-04-27 11:52:16,498 INFO L290 TraceCheckUtils]: 11: Hoare triple {240#true} ~r~0 := ~A~0;~d~0 := ~B~0;~p~0 := 1;~q~0 := 0; {249#(= main_~q~0 0)} is VALID [2022-04-27 11:52:16,509 INFO L290 TraceCheckUtils]: 12: Hoare triple {249#(= main_~q~0 0)} assume !false; {249#(= main_~q~0 0)} is VALID [2022-04-27 11:52:16,510 INFO L272 TraceCheckUtils]: 13: Hoare triple {249#(= main_~q~0 0)} call __VERIFIER_assert((if 0 == ~q~0 % 4294967296 then 1 else 0)); {250#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 11:52:16,511 INFO L290 TraceCheckUtils]: 14: Hoare triple {250#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {251#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-27 11:52:16,511 INFO L290 TraceCheckUtils]: 15: Hoare triple {251#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {241#false} is VALID [2022-04-27 11:52:16,511 INFO L290 TraceCheckUtils]: 16: Hoare triple {241#false} assume !false; {241#false} is VALID [2022-04-27 11:52:16,511 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 11:52:16,512 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 11:52:16,512 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1691197717] [2022-04-27 11:52:16,512 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1691197717] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 11:52:16,512 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 11:52:16,512 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-27 11:52:16,512 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [271674227] [2022-04-27 11:52:16,512 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 11:52:16,513 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 4 states have internal predecessors, (11), 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 17 [2022-04-27 11:52:16,514 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 11:52:16,514 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 4 states have internal predecessors, (11), 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 11:52:16,526 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 11:52:16,526 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-27 11:52:16,526 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 11:52:16,527 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-27 11:52:16,527 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-27 11:52:16,527 INFO L87 Difference]: Start difference. First operand 30 states and 38 transitions. Second operand has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 4 states have internal predecessors, (11), 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 11:52:16,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:52:16,920 INFO L93 Difference]: Finished difference Result 43 states and 55 transitions. [2022-04-27 11:52:16,920 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-27 11:52:16,920 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 4 states have internal predecessors, (11), 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 17 [2022-04-27 11:52:16,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 11:52:16,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 4 states have internal predecessors, (11), 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 11:52:16,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 55 transitions. [2022-04-27 11:52:16,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 4 states have internal predecessors, (11), 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 11:52:16,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 55 transitions. [2022-04-27 11:52:16,936 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 55 transitions. [2022-04-27 11:52:16,991 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 55 edges. 55 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 11:52:16,993 INFO L225 Difference]: With dead ends: 43 [2022-04-27 11:52:16,993 INFO L226 Difference]: Without dead ends: 41 [2022-04-27 11:52:16,993 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2022-04-27 11:52:16,994 INFO L413 NwaCegarLoop]: 28 mSDtfsCounter, 37 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 109 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 45 SdHoareTripleChecker+Invalid, 136 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 109 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-27 11:52:16,995 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 45 Invalid, 136 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 109 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-27 11:52:16,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2022-04-27 11:52:16,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 34. [2022-04-27 11:52:16,999 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 11:52:17,000 INFO L82 GeneralOperation]: Start isEquivalent. First operand 41 states. Second operand has 34 states, 19 states have (on average 1.2105263157894737) internal successors, (23), 20 states have internal predecessors, (23), 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 11:52:17,000 INFO L74 IsIncluded]: Start isIncluded. First operand 41 states. Second operand has 34 states, 19 states have (on average 1.2105263157894737) internal successors, (23), 20 states have internal predecessors, (23), 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 11:52:17,000 INFO L87 Difference]: Start difference. First operand 41 states. Second operand has 34 states, 19 states have (on average 1.2105263157894737) internal successors, (23), 20 states have internal predecessors, (23), 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 11:52:17,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:52:17,003 INFO L93 Difference]: Finished difference Result 41 states and 53 transitions. [2022-04-27 11:52:17,003 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 53 transitions. [2022-04-27 11:52:17,003 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:52:17,004 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:52:17,004 INFO L74 IsIncluded]: Start isIncluded. First operand has 34 states, 19 states have (on average 1.2105263157894737) internal successors, (23), 20 states have internal predecessors, (23), 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 41 states. [2022-04-27 11:52:17,004 INFO L87 Difference]: Start difference. First operand has 34 states, 19 states have (on average 1.2105263157894737) internal successors, (23), 20 states have internal predecessors, (23), 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 41 states. [2022-04-27 11:52:17,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:52:17,006 INFO L93 Difference]: Finished difference Result 41 states and 53 transitions. [2022-04-27 11:52:17,006 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 53 transitions. [2022-04-27 11:52:17,007 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:52:17,007 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:52:17,007 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 11:52:17,007 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 11:52:17,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 19 states have (on average 1.2105263157894737) internal successors, (23), 20 states have internal predecessors, (23), 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 11:52:17,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 41 transitions. [2022-04-27 11:52:17,009 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 41 transitions. Word has length 17 [2022-04-27 11:52:17,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 11:52:17,009 INFO L495 AbstractCegarLoop]: Abstraction has 34 states and 41 transitions. [2022-04-27 11:52:17,009 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 4 states have internal predecessors, (11), 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 11:52:17,010 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 41 transitions. [2022-04-27 11:52:17,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-04-27 11:52:17,010 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 11:52:17,010 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] [2022-04-27 11:52:17,010 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-27 11:52:17,011 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 11:52:17,011 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 11:52:17,011 INFO L85 PathProgramCache]: Analyzing trace with hash -1294462534, now seen corresponding path program 1 times [2022-04-27 11:52:17,011 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 11:52:17,011 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1866263056] [2022-04-27 11:52:17,012 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 11:52:17,012 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 11:52:17,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:52:17,066 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 11:52:17,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:52:17,071 INFO L290 TraceCheckUtils]: 0: Hoare triple {474#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3); {458#true} is VALID [2022-04-27 11:52:17,071 INFO L290 TraceCheckUtils]: 1: Hoare triple {458#true} assume true; {458#true} is VALID [2022-04-27 11:52:17,071 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {458#true} {458#true} #94#return; {458#true} is VALID [2022-04-27 11:52:17,071 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-27 11:52:17,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:52:17,075 INFO L290 TraceCheckUtils]: 0: Hoare triple {458#true} ~cond := #in~cond; {458#true} is VALID [2022-04-27 11:52:17,075 INFO L290 TraceCheckUtils]: 1: Hoare triple {458#true} assume !(0 == ~cond); {458#true} is VALID [2022-04-27 11:52:17,075 INFO L290 TraceCheckUtils]: 2: Hoare triple {458#true} assume true; {458#true} is VALID [2022-04-27 11:52:17,076 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {458#true} {458#true} #78#return; {458#true} is VALID [2022-04-27 11:52:17,076 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-04-27 11:52:17,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:52:17,081 INFO L290 TraceCheckUtils]: 0: Hoare triple {458#true} ~cond := #in~cond; {458#true} is VALID [2022-04-27 11:52:17,081 INFO L290 TraceCheckUtils]: 1: Hoare triple {458#true} assume !(0 == ~cond); {458#true} is VALID [2022-04-27 11:52:17,081 INFO L290 TraceCheckUtils]: 2: Hoare triple {458#true} assume true; {458#true} is VALID [2022-04-27 11:52:17,082 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {458#true} {467#(= (+ main_~A~0 (* (- 1) main_~r~0)) 0)} #80#return; {467#(= (+ main_~A~0 (* (- 1) main_~r~0)) 0)} is VALID [2022-04-27 11:52:17,082 INFO L272 TraceCheckUtils]: 0: Hoare triple {458#true} call ULTIMATE.init(); {474#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 11:52:17,082 INFO L290 TraceCheckUtils]: 1: Hoare triple {474#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3); {458#true} is VALID [2022-04-27 11:52:17,083 INFO L290 TraceCheckUtils]: 2: Hoare triple {458#true} assume true; {458#true} is VALID [2022-04-27 11:52:17,083 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {458#true} {458#true} #94#return; {458#true} is VALID [2022-04-27 11:52:17,083 INFO L272 TraceCheckUtils]: 4: Hoare triple {458#true} call #t~ret6 := main(); {458#true} is VALID [2022-04-27 11:52:17,083 INFO L290 TraceCheckUtils]: 5: Hoare triple {458#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; {458#true} is VALID [2022-04-27 11:52:17,083 INFO L272 TraceCheckUtils]: 6: Hoare triple {458#true} call assume_abort_if_not((if ~B~0 % 4294967296 >= 1 then 1 else 0)); {458#true} is VALID [2022-04-27 11:52:17,083 INFO L290 TraceCheckUtils]: 7: Hoare triple {458#true} ~cond := #in~cond; {458#true} is VALID [2022-04-27 11:52:17,083 INFO L290 TraceCheckUtils]: 8: Hoare triple {458#true} assume !(0 == ~cond); {458#true} is VALID [2022-04-27 11:52:17,084 INFO L290 TraceCheckUtils]: 9: Hoare triple {458#true} assume true; {458#true} is VALID [2022-04-27 11:52:17,084 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {458#true} {458#true} #78#return; {458#true} is VALID [2022-04-27 11:52:17,084 INFO L290 TraceCheckUtils]: 11: Hoare triple {458#true} ~r~0 := ~A~0;~d~0 := ~B~0;~p~0 := 1;~q~0 := 0; {467#(= (+ main_~A~0 (* (- 1) main_~r~0)) 0)} is VALID [2022-04-27 11:52:17,084 INFO L290 TraceCheckUtils]: 12: Hoare triple {467#(= (+ main_~A~0 (* (- 1) main_~r~0)) 0)} assume !false; {467#(= (+ main_~A~0 (* (- 1) main_~r~0)) 0)} is VALID [2022-04-27 11:52:17,085 INFO L272 TraceCheckUtils]: 13: Hoare triple {467#(= (+ main_~A~0 (* (- 1) main_~r~0)) 0)} call __VERIFIER_assert((if 0 == ~q~0 % 4294967296 then 1 else 0)); {458#true} is VALID [2022-04-27 11:52:17,085 INFO L290 TraceCheckUtils]: 14: Hoare triple {458#true} ~cond := #in~cond; {458#true} is VALID [2022-04-27 11:52:17,085 INFO L290 TraceCheckUtils]: 15: Hoare triple {458#true} assume !(0 == ~cond); {458#true} is VALID [2022-04-27 11:52:17,085 INFO L290 TraceCheckUtils]: 16: Hoare triple {458#true} assume true; {458#true} is VALID [2022-04-27 11:52:17,085 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {458#true} {467#(= (+ main_~A~0 (* (- 1) main_~r~0)) 0)} #80#return; {467#(= (+ main_~A~0 (* (- 1) main_~r~0)) 0)} is VALID [2022-04-27 11:52:17,086 INFO L272 TraceCheckUtils]: 18: Hoare triple {467#(= (+ main_~A~0 (* (- 1) main_~r~0)) 0)} call __VERIFIER_assert((if ~r~0 % 4294967296 == ~A~0 % 4294967296 then 1 else 0)); {472#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 11:52:17,087 INFO L290 TraceCheckUtils]: 19: Hoare triple {472#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {473#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-27 11:52:17,087 INFO L290 TraceCheckUtils]: 20: Hoare triple {473#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {459#false} is VALID [2022-04-27 11:52:17,087 INFO L290 TraceCheckUtils]: 21: Hoare triple {459#false} assume !false; {459#false} is VALID [2022-04-27 11:52:17,088 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 11:52:17,088 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 11:52:17,088 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1866263056] [2022-04-27 11:52:17,088 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1866263056] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 11:52:17,088 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 11:52:17,088 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-27 11:52:17,088 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1836307383] [2022-04-27 11:52:17,088 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 11:52:17,089 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 4 states have internal predecessors, (14), 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 22 [2022-04-27 11:52:17,089 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 11:52:17,089 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 4 states have internal predecessors, (14), 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 11:52:17,103 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 11:52:17,103 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-27 11:52:17,103 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 11:52:17,103 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-27 11:52:17,104 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-27 11:52:17,104 INFO L87 Difference]: Start difference. First operand 34 states and 41 transitions. Second operand has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 4 states have internal predecessors, (14), 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 11:52:17,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:52:17,434 INFO L93 Difference]: Finished difference Result 47 states and 58 transitions. [2022-04-27 11:52:17,434 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-27 11:52:17,434 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 4 states have internal predecessors, (14), 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 22 [2022-04-27 11:52:17,435 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 11:52:17,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 4 states have internal predecessors, (14), 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 11:52:17,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 55 transitions. [2022-04-27 11:52:17,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 4 states have internal predecessors, (14), 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 11:52:17,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 55 transitions. [2022-04-27 11:52:17,438 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 55 transitions. [2022-04-27 11:52:17,486 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 55 edges. 55 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 11:52:17,488 INFO L225 Difference]: With dead ends: 47 [2022-04-27 11:52:17,488 INFO L226 Difference]: Without dead ends: 45 [2022-04-27 11:52:17,488 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2022-04-27 11:52:17,489 INFO L413 NwaCegarLoop]: 28 mSDtfsCounter, 32 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 115 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 45 SdHoareTripleChecker+Invalid, 141 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 115 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-27 11:52:17,489 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 45 Invalid, 141 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 115 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-27 11:52:17,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2022-04-27 11:52:17,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 38. [2022-04-27 11:52:17,494 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 11:52:17,494 INFO L82 GeneralOperation]: Start isEquivalent. First operand 45 states. Second operand has 38 states, 22 states have (on average 1.1818181818181819) internal successors, (26), 23 states have internal predecessors, (26), 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 11:52:17,494 INFO L74 IsIncluded]: Start isIncluded. First operand 45 states. Second operand has 38 states, 22 states have (on average 1.1818181818181819) internal successors, (26), 23 states have internal predecessors, (26), 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 11:52:17,495 INFO L87 Difference]: Start difference. First operand 45 states. Second operand has 38 states, 22 states have (on average 1.1818181818181819) internal successors, (26), 23 states have internal predecessors, (26), 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 11:52:17,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:52:17,497 INFO L93 Difference]: Finished difference Result 45 states and 56 transitions. [2022-04-27 11:52:17,497 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 56 transitions. [2022-04-27 11:52:17,498 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:52:17,498 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:52:17,498 INFO L74 IsIncluded]: Start isIncluded. First operand has 38 states, 22 states have (on average 1.1818181818181819) internal successors, (26), 23 states have internal predecessors, (26), 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 45 states. [2022-04-27 11:52:17,498 INFO L87 Difference]: Start difference. First operand has 38 states, 22 states have (on average 1.1818181818181819) internal successors, (26), 23 states have internal predecessors, (26), 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 45 states. [2022-04-27 11:52:17,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:52:17,500 INFO L93 Difference]: Finished difference Result 45 states and 56 transitions. [2022-04-27 11:52:17,500 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 56 transitions. [2022-04-27 11:52:17,501 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:52:17,501 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:52:17,501 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 11:52:17,501 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 11:52:17,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 22 states have (on average 1.1818181818181819) internal successors, (26), 23 states have internal predecessors, (26), 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 11:52:17,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 44 transitions. [2022-04-27 11:52:17,502 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 44 transitions. Word has length 22 [2022-04-27 11:52:17,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 11:52:17,502 INFO L495 AbstractCegarLoop]: Abstraction has 38 states and 44 transitions. [2022-04-27 11:52:17,503 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 4 states have internal predecessors, (14), 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 11:52:17,503 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 44 transitions. [2022-04-27 11:52:17,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-04-27 11:52:17,503 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 11:52:17,503 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] [2022-04-27 11:52:17,503 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-04-27 11:52:17,504 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 11:52:17,504 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 11:52:17,504 INFO L85 PathProgramCache]: Analyzing trace with hash -1449027479, now seen corresponding path program 1 times [2022-04-27 11:52:17,504 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 11:52:17,504 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1963556281] [2022-04-27 11:52:17,504 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 11:52:17,505 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 11:52:17,519 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 11:52:17,520 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [854488227] [2022-04-27 11:52:17,520 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 11:52:17,520 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 11:52:17,520 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 11:52:17,523 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 11:52:17,559 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 11:52:17,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:52:17,578 INFO L263 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 12 conjunts are in the unsatisfiable core [2022-04-27 11:52:17,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:52:17,601 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 11:52:18,161 INFO L272 TraceCheckUtils]: 0: Hoare triple {698#true} call ULTIMATE.init(); {698#true} is VALID [2022-04-27 11:52:18,161 INFO L290 TraceCheckUtils]: 1: Hoare triple {698#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); {698#true} is VALID [2022-04-27 11:52:18,161 INFO L290 TraceCheckUtils]: 2: Hoare triple {698#true} assume true; {698#true} is VALID [2022-04-27 11:52:18,162 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {698#true} {698#true} #94#return; {698#true} is VALID [2022-04-27 11:52:18,162 INFO L272 TraceCheckUtils]: 4: Hoare triple {698#true} call #t~ret6 := main(); {698#true} is VALID [2022-04-27 11:52:18,162 INFO L290 TraceCheckUtils]: 5: Hoare triple {698#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; {698#true} is VALID [2022-04-27 11:52:18,162 INFO L272 TraceCheckUtils]: 6: Hoare triple {698#true} call assume_abort_if_not((if ~B~0 % 4294967296 >= 1 then 1 else 0)); {698#true} is VALID [2022-04-27 11:52:18,164 INFO L290 TraceCheckUtils]: 7: Hoare triple {698#true} ~cond := #in~cond; {724#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-27 11:52:18,164 INFO L290 TraceCheckUtils]: 8: Hoare triple {724#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {728#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-27 11:52:18,165 INFO L290 TraceCheckUtils]: 9: Hoare triple {728#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {728#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-27 11:52:18,165 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {728#(not (= |assume_abort_if_not_#in~cond| 0))} {698#true} #78#return; {735#(<= 1 (mod main_~B~0 4294967296))} is VALID [2022-04-27 11:52:18,166 INFO L290 TraceCheckUtils]: 11: Hoare triple {735#(<= 1 (mod main_~B~0 4294967296))} ~r~0 := ~A~0;~d~0 := ~B~0;~p~0 := 1;~q~0 := 0; {739#(and (<= 1 (mod main_~B~0 4294967296)) (= main_~B~0 main_~d~0) (= main_~p~0 1))} is VALID [2022-04-27 11:52:18,169 INFO L290 TraceCheckUtils]: 12: Hoare triple {739#(and (<= 1 (mod main_~B~0 4294967296)) (= main_~B~0 main_~d~0) (= main_~p~0 1))} assume !false; {739#(and (<= 1 (mod main_~B~0 4294967296)) (= main_~B~0 main_~d~0) (= main_~p~0 1))} is VALID [2022-04-27 11:52:18,169 INFO L272 TraceCheckUtils]: 13: Hoare triple {739#(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)); {698#true} is VALID [2022-04-27 11:52:18,169 INFO L290 TraceCheckUtils]: 14: Hoare triple {698#true} ~cond := #in~cond; {698#true} is VALID [2022-04-27 11:52:18,169 INFO L290 TraceCheckUtils]: 15: Hoare triple {698#true} assume !(0 == ~cond); {698#true} is VALID [2022-04-27 11:52:18,169 INFO L290 TraceCheckUtils]: 16: Hoare triple {698#true} assume true; {698#true} is VALID [2022-04-27 11:52:18,172 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {698#true} {739#(and (<= 1 (mod main_~B~0 4294967296)) (= main_~B~0 main_~d~0) (= main_~p~0 1))} #80#return; {739#(and (<= 1 (mod main_~B~0 4294967296)) (= main_~B~0 main_~d~0) (= main_~p~0 1))} is VALID [2022-04-27 11:52:18,173 INFO L272 TraceCheckUtils]: 18: Hoare triple {739#(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)); {698#true} is VALID [2022-04-27 11:52:18,173 INFO L290 TraceCheckUtils]: 19: Hoare triple {698#true} ~cond := #in~cond; {698#true} is VALID [2022-04-27 11:52:18,173 INFO L290 TraceCheckUtils]: 20: Hoare triple {698#true} assume !(0 == ~cond); {698#true} is VALID [2022-04-27 11:52:18,173 INFO L290 TraceCheckUtils]: 21: Hoare triple {698#true} assume true; {698#true} is VALID [2022-04-27 11:52:18,174 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {698#true} {739#(and (<= 1 (mod main_~B~0 4294967296)) (= main_~B~0 main_~d~0) (= main_~p~0 1))} #82#return; {739#(and (<= 1 (mod main_~B~0 4294967296)) (= main_~B~0 main_~d~0) (= main_~p~0 1))} is VALID [2022-04-27 11:52:18,174 INFO L272 TraceCheckUtils]: 23: Hoare triple {739#(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)); {776#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 11:52:18,175 INFO L290 TraceCheckUtils]: 24: Hoare triple {776#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {780#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 11:52:18,175 INFO L290 TraceCheckUtils]: 25: Hoare triple {780#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {699#false} is VALID [2022-04-27 11:52:18,175 INFO L290 TraceCheckUtils]: 26: Hoare triple {699#false} assume !false; {699#false} is VALID [2022-04-27 11:52:18,175 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 11:52:18,175 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-27 11:52:18,176 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 11:52:18,176 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1963556281] [2022-04-27 11:52:18,176 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 11:52:18,176 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [854488227] [2022-04-27 11:52:18,176 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [854488227] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 11:52:18,176 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 11:52:18,176 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-27 11:52:18,176 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2055988017] [2022-04-27 11:52:18,176 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 11:52:18,177 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 1.75) internal successors, (14), 6 states have internal predecessors, (14), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) Word has length 27 [2022-04-27 11:52:18,177 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 11:52:18,177 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 1.75) internal successors, (14), 6 states have internal predecessors, (14), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-27 11:52:18,195 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 11:52:18,196 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-27 11:52:18,196 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 11:52:18,196 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-27 11:52:18,196 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-04-27 11:52:18,196 INFO L87 Difference]: Start difference. First operand 38 states and 44 transitions. Second operand has 8 states, 8 states have (on average 1.75) internal successors, (14), 6 states have internal predecessors, (14), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-27 11:52:20,436 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 11:52:20,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:52:20,730 INFO L93 Difference]: Finished difference Result 61 states and 78 transitions. [2022-04-27 11:52:20,730 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-27 11:52:20,730 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 1.75) internal successors, (14), 6 states have internal predecessors, (14), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) Word has length 27 [2022-04-27 11:52:20,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 11:52:20,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 1.75) internal successors, (14), 6 states have internal predecessors, (14), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-27 11:52:20,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 72 transitions. [2022-04-27 11:52:20,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 1.75) internal successors, (14), 6 states have internal predecessors, (14), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-27 11:52:20,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 72 transitions. [2022-04-27 11:52:20,734 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 72 transitions. [2022-04-27 11:52:20,803 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 72 edges. 72 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 11:52:20,804 INFO L225 Difference]: With dead ends: 61 [2022-04-27 11:52:20,804 INFO L226 Difference]: Without dead ends: 58 [2022-04-27 11:52:20,805 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2022-04-27 11:52:20,805 INFO L413 NwaCegarLoop]: 39 mSDtfsCounter, 17 mSDsluCounter, 165 mSDsCounter, 0 mSdLazyCounter, 108 mSolverCounterSat, 5 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 204 SdHoareTripleChecker+Invalid, 114 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 108 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2022-04-27 11:52:20,806 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 204 Invalid, 114 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 108 Invalid, 1 Unknown, 0 Unchecked, 2.1s Time] [2022-04-27 11:52:20,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2022-04-27 11:52:20,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 52. [2022-04-27 11:52:20,820 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 11:52:20,821 INFO L82 GeneralOperation]: Start isEquivalent. First operand 58 states. Second operand has 52 states, 29 states have (on average 1.206896551724138) internal successors, (35), 31 states have internal predecessors, (35), 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 11:52:20,821 INFO L74 IsIncluded]: Start isIncluded. First operand 58 states. Second operand has 52 states, 29 states have (on average 1.206896551724138) internal successors, (35), 31 states have internal predecessors, (35), 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 11:52:20,821 INFO L87 Difference]: Start difference. First operand 58 states. Second operand has 52 states, 29 states have (on average 1.206896551724138) internal successors, (35), 31 states have internal predecessors, (35), 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 11:52:20,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:52:20,823 INFO L93 Difference]: Finished difference Result 58 states and 74 transitions. [2022-04-27 11:52:20,823 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 74 transitions. [2022-04-27 11:52:20,824 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:52:20,824 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:52:20,824 INFO L74 IsIncluded]: Start isIncluded. First operand has 52 states, 29 states have (on average 1.206896551724138) internal successors, (35), 31 states have internal predecessors, (35), 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 58 states. [2022-04-27 11:52:20,824 INFO L87 Difference]: Start difference. First operand has 52 states, 29 states have (on average 1.206896551724138) internal successors, (35), 31 states have internal predecessors, (35), 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 58 states. [2022-04-27 11:52:20,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:52:20,826 INFO L93 Difference]: Finished difference Result 58 states and 74 transitions. [2022-04-27 11:52:20,826 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 74 transitions. [2022-04-27 11:52:20,827 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:52:20,827 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:52:20,827 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 11:52:20,827 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 11:52:20,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 29 states have (on average 1.206896551724138) internal successors, (35), 31 states have internal predecessors, (35), 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 11:52:20,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 64 transitions. [2022-04-27 11:52:20,829 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 64 transitions. Word has length 27 [2022-04-27 11:52:20,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 11:52:20,829 INFO L495 AbstractCegarLoop]: Abstraction has 52 states and 64 transitions. [2022-04-27 11:52:20,829 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 1.75) internal successors, (14), 6 states have internal predecessors, (14), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-27 11:52:20,829 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 64 transitions. [2022-04-27 11:52:20,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-04-27 11:52:20,829 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 11:52:20,830 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] [2022-04-27 11:52:20,846 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-04-27 11:52:21,046 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 11:52:21,047 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 11:52:21,047 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 11:52:21,047 INFO L85 PathProgramCache]: Analyzing trace with hash 905213191, now seen corresponding path program 1 times [2022-04-27 11:52:21,047 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 11:52:21,048 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1298055641] [2022-04-27 11:52:21,048 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 11:52:21,048 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 11:52:21,057 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 11:52:21,057 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1536666417] [2022-04-27 11:52:21,057 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 11:52:21,057 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 11:52:21,058 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 11:52:21,064 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 11:52:21,065 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 11:52:21,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:52:21,100 INFO L263 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 12 conjunts are in the unsatisfiable core [2022-04-27 11:52:21,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:52:21,115 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 11:52:21,599 INFO L272 TraceCheckUtils]: 0: Hoare triple {1074#true} call ULTIMATE.init(); {1074#true} is VALID [2022-04-27 11:52:21,599 INFO L290 TraceCheckUtils]: 1: Hoare triple {1074#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); {1074#true} is VALID [2022-04-27 11:52:21,599 INFO L290 TraceCheckUtils]: 2: Hoare triple {1074#true} assume true; {1074#true} is VALID [2022-04-27 11:52:21,599 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1074#true} {1074#true} #94#return; {1074#true} is VALID [2022-04-27 11:52:21,599 INFO L272 TraceCheckUtils]: 4: Hoare triple {1074#true} call #t~ret6 := main(); {1074#true} is VALID [2022-04-27 11:52:21,600 INFO L290 TraceCheckUtils]: 5: Hoare triple {1074#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; {1074#true} is VALID [2022-04-27 11:52:21,600 INFO L272 TraceCheckUtils]: 6: Hoare triple {1074#true} call assume_abort_if_not((if ~B~0 % 4294967296 >= 1 then 1 else 0)); {1074#true} is VALID [2022-04-27 11:52:21,600 INFO L290 TraceCheckUtils]: 7: Hoare triple {1074#true} ~cond := #in~cond; {1074#true} is VALID [2022-04-27 11:52:21,600 INFO L290 TraceCheckUtils]: 8: Hoare triple {1074#true} assume !(0 == ~cond); {1074#true} is VALID [2022-04-27 11:52:21,600 INFO L290 TraceCheckUtils]: 9: Hoare triple {1074#true} assume true; {1074#true} is VALID [2022-04-27 11:52:21,600 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1074#true} {1074#true} #78#return; {1074#true} is VALID [2022-04-27 11:52:21,601 INFO L290 TraceCheckUtils]: 11: Hoare triple {1074#true} ~r~0 := ~A~0;~d~0 := ~B~0;~p~0 := 1;~q~0 := 0; {1112#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 main_~d~0))} is VALID [2022-04-27 11:52:21,611 INFO L290 TraceCheckUtils]: 12: Hoare triple {1112#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 main_~d~0))} assume !false; {1112#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 main_~d~0))} is VALID [2022-04-27 11:52:21,611 INFO L272 TraceCheckUtils]: 13: Hoare triple {1112#(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)); {1074#true} is VALID [2022-04-27 11:52:21,611 INFO L290 TraceCheckUtils]: 14: Hoare triple {1074#true} ~cond := #in~cond; {1074#true} is VALID [2022-04-27 11:52:21,611 INFO L290 TraceCheckUtils]: 15: Hoare triple {1074#true} assume !(0 == ~cond); {1074#true} is VALID [2022-04-27 11:52:21,611 INFO L290 TraceCheckUtils]: 16: Hoare triple {1074#true} assume true; {1074#true} is VALID [2022-04-27 11:52:21,612 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {1074#true} {1112#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 main_~d~0))} #80#return; {1112#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 main_~d~0))} is VALID [2022-04-27 11:52:21,612 INFO L272 TraceCheckUtils]: 18: Hoare triple {1112#(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)); {1074#true} is VALID [2022-04-27 11:52:21,612 INFO L290 TraceCheckUtils]: 19: Hoare triple {1074#true} ~cond := #in~cond; {1074#true} is VALID [2022-04-27 11:52:21,612 INFO L290 TraceCheckUtils]: 20: Hoare triple {1074#true} assume !(0 == ~cond); {1074#true} is VALID [2022-04-27 11:52:21,612 INFO L290 TraceCheckUtils]: 21: Hoare triple {1074#true} assume true; {1074#true} is VALID [2022-04-27 11:52:21,613 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {1074#true} {1112#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 main_~d~0))} #82#return; {1112#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 main_~d~0))} is VALID [2022-04-27 11:52:21,613 INFO L272 TraceCheckUtils]: 23: Hoare triple {1112#(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)); {1074#true} is VALID [2022-04-27 11:52:21,613 INFO L290 TraceCheckUtils]: 24: Hoare triple {1074#true} ~cond := #in~cond; {1074#true} is VALID [2022-04-27 11:52:21,613 INFO L290 TraceCheckUtils]: 25: Hoare triple {1074#true} assume !(0 == ~cond); {1074#true} is VALID [2022-04-27 11:52:21,613 INFO L290 TraceCheckUtils]: 26: Hoare triple {1074#true} assume true; {1074#true} is VALID [2022-04-27 11:52:21,614 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {1074#true} {1112#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 main_~d~0))} #84#return; {1112#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 main_~d~0))} is VALID [2022-04-27 11:52:21,614 INFO L290 TraceCheckUtils]: 28: Hoare triple {1112#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 main_~d~0))} assume !(~r~0 % 4294967296 >= ~d~0 % 4294967296); {1164#(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 11:52:21,615 INFO L290 TraceCheckUtils]: 29: Hoare triple {1164#(and (= main_~A~0 main_~r~0) (not (<= (mod main_~B~0 4294967296) (mod main_~r~0 4294967296))) (= main_~q~0 0))} assume !false; {1164#(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 11:52:21,616 INFO L272 TraceCheckUtils]: 30: Hoare triple {1164#(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)); {1171#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 11:52:21,616 INFO L290 TraceCheckUtils]: 31: Hoare triple {1171#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1175#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 11:52:21,616 INFO L290 TraceCheckUtils]: 32: Hoare triple {1175#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1075#false} is VALID [2022-04-27 11:52:21,617 INFO L290 TraceCheckUtils]: 33: Hoare triple {1075#false} assume !false; {1075#false} is VALID [2022-04-27 11:52:21,617 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 11:52:21,617 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-27 11:52:21,617 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 11:52:21,617 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1298055641] [2022-04-27 11:52:21,617 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 11:52:21,617 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1536666417] [2022-04-27 11:52:21,617 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1536666417] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 11:52:21,617 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 11:52:21,617 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-27 11:52:21,618 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [313208723] [2022-04-27 11:52:21,618 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 11:52:21,618 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 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 34 [2022-04-27 11:52:21,618 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 11:52:21,618 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 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 11:52:21,641 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 28 edges. 28 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 11:52:21,642 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-27 11:52:21,642 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 11:52:21,642 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-27 11:52:21,642 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-27 11:52:21,642 INFO L87 Difference]: Start difference. First operand 52 states and 64 transitions. Second operand has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 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 11:52:23,752 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 11:52:25,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:52:25,295 INFO L93 Difference]: Finished difference Result 73 states and 87 transitions. [2022-04-27 11:52:25,295 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-27 11:52:25,295 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 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 34 [2022-04-27 11:52:25,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 11:52:25,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 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 11:52:25,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 72 transitions. [2022-04-27 11:52:25,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 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 11:52:25,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 72 transitions. [2022-04-27 11:52:25,298 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 72 transitions. [2022-04-27 11:52:25,374 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 72 edges. 72 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 11:52:25,375 INFO L225 Difference]: With dead ends: 73 [2022-04-27 11:52:25,375 INFO L226 Difference]: Without dead ends: 70 [2022-04-27 11:52:25,375 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-04-27 11:52:25,376 INFO L413 NwaCegarLoop]: 35 mSDtfsCounter, 12 mSDsluCounter, 100 mSDsCounter, 0 mSdLazyCounter, 91 mSolverCounterSat, 9 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 135 SdHoareTripleChecker+Invalid, 101 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 91 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2022-04-27 11:52:25,376 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 135 Invalid, 101 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 91 Invalid, 1 Unknown, 0 Unchecked, 2.2s Time] [2022-04-27 11:52:25,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2022-04-27 11:52:25,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 69. [2022-04-27 11:52:25,404 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 11:52:25,404 INFO L82 GeneralOperation]: Start isEquivalent. First operand 70 states. Second operand has 69 states, 41 states have (on average 1.170731707317073) internal successors, (48), 43 states have internal predecessors, (48), 18 states have call successors, (18), 10 states have call predecessors, (18), 9 states have return successors, (16), 15 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-27 11:52:25,404 INFO L74 IsIncluded]: Start isIncluded. First operand 70 states. Second operand has 69 states, 41 states have (on average 1.170731707317073) internal successors, (48), 43 states have internal predecessors, (48), 18 states have call successors, (18), 10 states have call predecessors, (18), 9 states have return successors, (16), 15 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-27 11:52:25,407 INFO L87 Difference]: Start difference. First operand 70 states. Second operand has 69 states, 41 states have (on average 1.170731707317073) internal successors, (48), 43 states have internal predecessors, (48), 18 states have call successors, (18), 10 states have call predecessors, (18), 9 states have return successors, (16), 15 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-27 11:52:25,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:52:25,410 INFO L93 Difference]: Finished difference Result 70 states and 83 transitions. [2022-04-27 11:52:25,410 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 83 transitions. [2022-04-27 11:52:25,410 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:52:25,410 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:52:25,410 INFO L74 IsIncluded]: Start isIncluded. First operand has 69 states, 41 states have (on average 1.170731707317073) internal successors, (48), 43 states have internal predecessors, (48), 18 states have call successors, (18), 10 states have call predecessors, (18), 9 states have return successors, (16), 15 states have call predecessors, (16), 16 states have call successors, (16) Second operand 70 states. [2022-04-27 11:52:25,412 INFO L87 Difference]: Start difference. First operand has 69 states, 41 states have (on average 1.170731707317073) internal successors, (48), 43 states have internal predecessors, (48), 18 states have call successors, (18), 10 states have call predecessors, (18), 9 states have return successors, (16), 15 states have call predecessors, (16), 16 states have call successors, (16) Second operand 70 states. [2022-04-27 11:52:25,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:52:25,415 INFO L93 Difference]: Finished difference Result 70 states and 83 transitions. [2022-04-27 11:52:25,415 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 83 transitions. [2022-04-27 11:52:25,416 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:52:25,416 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:52:25,416 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 11:52:25,416 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 11:52:25,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 41 states have (on average 1.170731707317073) internal successors, (48), 43 states have internal predecessors, (48), 18 states have call successors, (18), 10 states have call predecessors, (18), 9 states have return successors, (16), 15 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-27 11:52:25,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 82 transitions. [2022-04-27 11:52:25,418 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 82 transitions. Word has length 34 [2022-04-27 11:52:25,418 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 11:52:25,418 INFO L495 AbstractCegarLoop]: Abstraction has 69 states and 82 transitions. [2022-04-27 11:52:25,418 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 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 11:52:25,418 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 82 transitions. [2022-04-27 11:52:25,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-04-27 11:52:25,420 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 11:52:25,420 INFO L195 NwaCegarLoop]: trace histogram [6, 5, 5, 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 11:52:25,438 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-04-27 11:52:25,636 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 11:52:25,636 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 11:52:25,636 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 11:52:25,636 INFO L85 PathProgramCache]: Analyzing trace with hash -1576096488, now seen corresponding path program 1 times [2022-04-27 11:52:25,637 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 11:52:25,637 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1212346345] [2022-04-27 11:52:25,637 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 11:52:25,637 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 11:52:25,650 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 11:52:25,651 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [622468842] [2022-04-27 11:52:25,651 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 11:52:25,651 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 11:52:25,651 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 11:52:25,652 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 11:52:25,677 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 11:52:25,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:52:25,754 INFO L263 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 11 conjunts are in the unsatisfiable core [2022-04-27 11:52:25,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:52:25,767 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 11:52:25,946 INFO L272 TraceCheckUtils]: 0: Hoare triple {1529#true} call ULTIMATE.init(); {1529#true} is VALID [2022-04-27 11:52:25,946 INFO L290 TraceCheckUtils]: 1: Hoare triple {1529#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); {1529#true} is VALID [2022-04-27 11:52:25,946 INFO L290 TraceCheckUtils]: 2: Hoare triple {1529#true} assume true; {1529#true} is VALID [2022-04-27 11:52:25,946 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1529#true} {1529#true} #94#return; {1529#true} is VALID [2022-04-27 11:52:25,946 INFO L272 TraceCheckUtils]: 4: Hoare triple {1529#true} call #t~ret6 := main(); {1529#true} is VALID [2022-04-27 11:52:25,946 INFO L290 TraceCheckUtils]: 5: Hoare triple {1529#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; {1529#true} is VALID [2022-04-27 11:52:25,947 INFO L272 TraceCheckUtils]: 6: Hoare triple {1529#true} call assume_abort_if_not((if ~B~0 % 4294967296 >= 1 then 1 else 0)); {1529#true} is VALID [2022-04-27 11:52:25,947 INFO L290 TraceCheckUtils]: 7: Hoare triple {1529#true} ~cond := #in~cond; {1529#true} is VALID [2022-04-27 11:52:25,947 INFO L290 TraceCheckUtils]: 8: Hoare triple {1529#true} assume !(0 == ~cond); {1529#true} is VALID [2022-04-27 11:52:25,947 INFO L290 TraceCheckUtils]: 9: Hoare triple {1529#true} assume true; {1529#true} is VALID [2022-04-27 11:52:25,947 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1529#true} {1529#true} #78#return; {1529#true} is VALID [2022-04-27 11:52:25,947 INFO L290 TraceCheckUtils]: 11: Hoare triple {1529#true} ~r~0 := ~A~0;~d~0 := ~B~0;~p~0 := 1;~q~0 := 0; {1567#(and (= main_~B~0 main_~d~0) (= main_~p~0 1))} is VALID [2022-04-27 11:52:25,948 INFO L290 TraceCheckUtils]: 12: Hoare triple {1567#(and (= main_~B~0 main_~d~0) (= main_~p~0 1))} assume !false; {1567#(and (= main_~B~0 main_~d~0) (= main_~p~0 1))} is VALID [2022-04-27 11:52:25,948 INFO L272 TraceCheckUtils]: 13: Hoare triple {1567#(and (= main_~B~0 main_~d~0) (= main_~p~0 1))} call __VERIFIER_assert((if 0 == ~q~0 % 4294967296 then 1 else 0)); {1529#true} is VALID [2022-04-27 11:52:25,948 INFO L290 TraceCheckUtils]: 14: Hoare triple {1529#true} ~cond := #in~cond; {1529#true} is VALID [2022-04-27 11:52:25,948 INFO L290 TraceCheckUtils]: 15: Hoare triple {1529#true} assume !(0 == ~cond); {1529#true} is VALID [2022-04-27 11:52:25,948 INFO L290 TraceCheckUtils]: 16: Hoare triple {1529#true} assume true; {1529#true} is VALID [2022-04-27 11:52:25,948 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {1529#true} {1567#(and (= main_~B~0 main_~d~0) (= main_~p~0 1))} #80#return; {1567#(and (= main_~B~0 main_~d~0) (= main_~p~0 1))} is VALID [2022-04-27 11:52:25,949 INFO L272 TraceCheckUtils]: 18: Hoare triple {1567#(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)); {1529#true} is VALID [2022-04-27 11:52:25,949 INFO L290 TraceCheckUtils]: 19: Hoare triple {1529#true} ~cond := #in~cond; {1529#true} is VALID [2022-04-27 11:52:25,949 INFO L290 TraceCheckUtils]: 20: Hoare triple {1529#true} assume !(0 == ~cond); {1529#true} is VALID [2022-04-27 11:52:25,949 INFO L290 TraceCheckUtils]: 21: Hoare triple {1529#true} assume true; {1529#true} is VALID [2022-04-27 11:52:25,949 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {1529#true} {1567#(and (= main_~B~0 main_~d~0) (= main_~p~0 1))} #82#return; {1567#(and (= main_~B~0 main_~d~0) (= main_~p~0 1))} is VALID [2022-04-27 11:52:25,949 INFO L272 TraceCheckUtils]: 23: Hoare triple {1567#(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)); {1529#true} is VALID [2022-04-27 11:52:25,949 INFO L290 TraceCheckUtils]: 24: Hoare triple {1529#true} ~cond := #in~cond; {1529#true} is VALID [2022-04-27 11:52:25,950 INFO L290 TraceCheckUtils]: 25: Hoare triple {1529#true} assume !(0 == ~cond); {1529#true} is VALID [2022-04-27 11:52:25,950 INFO L290 TraceCheckUtils]: 26: Hoare triple {1529#true} assume true; {1529#true} is VALID [2022-04-27 11:52:25,950 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {1529#true} {1567#(and (= main_~B~0 main_~d~0) (= main_~p~0 1))} #84#return; {1567#(and (= main_~B~0 main_~d~0) (= main_~p~0 1))} is VALID [2022-04-27 11:52:25,951 INFO L290 TraceCheckUtils]: 28: Hoare triple {1567#(and (= 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; {1619#(and (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2))} is VALID [2022-04-27 11:52:25,951 INFO L290 TraceCheckUtils]: 29: Hoare triple {1619#(and (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2))} assume !false; {1619#(and (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2))} is VALID [2022-04-27 11:52:25,951 INFO L272 TraceCheckUtils]: 30: Hoare triple {1619#(and (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2))} call __VERIFIER_assert((if 0 == ~q~0 % 4294967296 then 1 else 0)); {1529#true} is VALID [2022-04-27 11:52:25,951 INFO L290 TraceCheckUtils]: 31: Hoare triple {1529#true} ~cond := #in~cond; {1529#true} is VALID [2022-04-27 11:52:25,951 INFO L290 TraceCheckUtils]: 32: Hoare triple {1529#true} assume !(0 == ~cond); {1529#true} is VALID [2022-04-27 11:52:25,951 INFO L290 TraceCheckUtils]: 33: Hoare triple {1529#true} assume true; {1529#true} is VALID [2022-04-27 11:52:25,952 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {1529#true} {1619#(and (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2))} #80#return; {1619#(and (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2))} is VALID [2022-04-27 11:52:25,952 INFO L272 TraceCheckUtils]: 35: Hoare triple {1619#(and (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2))} call __VERIFIER_assert((if ~r~0 % 4294967296 == ~A~0 % 4294967296 then 1 else 0)); {1529#true} is VALID [2022-04-27 11:52:25,953 INFO L290 TraceCheckUtils]: 36: Hoare triple {1529#true} ~cond := #in~cond; {1529#true} is VALID [2022-04-27 11:52:25,953 INFO L290 TraceCheckUtils]: 37: Hoare triple {1529#true} assume !(0 == ~cond); {1529#true} is VALID [2022-04-27 11:52:25,953 INFO L290 TraceCheckUtils]: 38: Hoare triple {1529#true} assume true; {1529#true} is VALID [2022-04-27 11:52:25,955 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {1529#true} {1619#(and (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2))} #82#return; {1619#(and (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2))} is VALID [2022-04-27 11:52:25,960 INFO L272 TraceCheckUtils]: 40: Hoare triple {1619#(and (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2))} call __VERIFIER_assert((if ~d~0 % 4294967296 == ~B~0 * ~p~0 % 4294967296 then 1 else 0)); {1656#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 11:52:25,960 INFO L290 TraceCheckUtils]: 41: Hoare triple {1656#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1660#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 11:52:25,960 INFO L290 TraceCheckUtils]: 42: Hoare triple {1660#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1530#false} is VALID [2022-04-27 11:52:25,961 INFO L290 TraceCheckUtils]: 43: Hoare triple {1530#false} assume !false; {1530#false} is VALID [2022-04-27 11:52:25,961 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 10 proven. 4 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2022-04-27 11:52:25,961 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 11:52:26,262 INFO L290 TraceCheckUtils]: 43: Hoare triple {1530#false} assume !false; {1530#false} is VALID [2022-04-27 11:52:26,263 INFO L290 TraceCheckUtils]: 42: Hoare triple {1660#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1530#false} is VALID [2022-04-27 11:52:26,263 INFO L290 TraceCheckUtils]: 41: Hoare triple {1656#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1660#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 11:52:26,264 INFO L272 TraceCheckUtils]: 40: Hoare triple {1676#(= (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)); {1656#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 11:52:26,265 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {1529#true} {1676#(= (mod main_~d~0 4294967296) (mod (* main_~B~0 main_~p~0) 4294967296))} #82#return; {1676#(= (mod main_~d~0 4294967296) (mod (* main_~B~0 main_~p~0) 4294967296))} is VALID [2022-04-27 11:52:26,265 INFO L290 TraceCheckUtils]: 38: Hoare triple {1529#true} assume true; {1529#true} is VALID [2022-04-27 11:52:26,265 INFO L290 TraceCheckUtils]: 37: Hoare triple {1529#true} assume !(0 == ~cond); {1529#true} is VALID [2022-04-27 11:52:26,265 INFO L290 TraceCheckUtils]: 36: Hoare triple {1529#true} ~cond := #in~cond; {1529#true} is VALID [2022-04-27 11:52:26,265 INFO L272 TraceCheckUtils]: 35: Hoare triple {1676#(= (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)); {1529#true} is VALID [2022-04-27 11:52:26,265 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {1529#true} {1676#(= (mod main_~d~0 4294967296) (mod (* main_~B~0 main_~p~0) 4294967296))} #80#return; {1676#(= (mod main_~d~0 4294967296) (mod (* main_~B~0 main_~p~0) 4294967296))} is VALID [2022-04-27 11:52:26,266 INFO L290 TraceCheckUtils]: 33: Hoare triple {1529#true} assume true; {1529#true} is VALID [2022-04-27 11:52:26,266 INFO L290 TraceCheckUtils]: 32: Hoare triple {1529#true} assume !(0 == ~cond); {1529#true} is VALID [2022-04-27 11:52:26,266 INFO L290 TraceCheckUtils]: 31: Hoare triple {1529#true} ~cond := #in~cond; {1529#true} is VALID [2022-04-27 11:52:26,266 INFO L272 TraceCheckUtils]: 30: Hoare triple {1676#(= (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)); {1529#true} is VALID [2022-04-27 11:52:26,267 INFO L290 TraceCheckUtils]: 29: Hoare triple {1676#(= (mod main_~d~0 4294967296) (mod (* main_~B~0 main_~p~0) 4294967296))} assume !false; {1676#(= (mod main_~d~0 4294967296) (mod (* main_~B~0 main_~p~0) 4294967296))} is VALID [2022-04-27 11:52:27,214 INFO L290 TraceCheckUtils]: 28: Hoare triple {1713#(= (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; {1676#(= (mod main_~d~0 4294967296) (mod (* main_~B~0 main_~p~0) 4294967296))} is VALID [2022-04-27 11:52:27,215 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {1529#true} {1713#(= (mod (* main_~d~0 2) 4294967296) (mod (* (* main_~p~0 2) main_~B~0) 4294967296))} #84#return; {1713#(= (mod (* main_~d~0 2) 4294967296) (mod (* (* main_~p~0 2) main_~B~0) 4294967296))} is VALID [2022-04-27 11:52:27,216 INFO L290 TraceCheckUtils]: 26: Hoare triple {1529#true} assume true; {1529#true} is VALID [2022-04-27 11:52:27,216 INFO L290 TraceCheckUtils]: 25: Hoare triple {1529#true} assume !(0 == ~cond); {1529#true} is VALID [2022-04-27 11:52:27,216 INFO L290 TraceCheckUtils]: 24: Hoare triple {1529#true} ~cond := #in~cond; {1529#true} is VALID [2022-04-27 11:52:27,216 INFO L272 TraceCheckUtils]: 23: Hoare triple {1713#(= (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)); {1529#true} is VALID [2022-04-27 11:52:27,216 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {1529#true} {1713#(= (mod (* main_~d~0 2) 4294967296) (mod (* (* main_~p~0 2) main_~B~0) 4294967296))} #82#return; {1713#(= (mod (* main_~d~0 2) 4294967296) (mod (* (* main_~p~0 2) main_~B~0) 4294967296))} is VALID [2022-04-27 11:52:27,216 INFO L290 TraceCheckUtils]: 21: Hoare triple {1529#true} assume true; {1529#true} is VALID [2022-04-27 11:52:27,217 INFO L290 TraceCheckUtils]: 20: Hoare triple {1529#true} assume !(0 == ~cond); {1529#true} is VALID [2022-04-27 11:52:27,217 INFO L290 TraceCheckUtils]: 19: Hoare triple {1529#true} ~cond := #in~cond; {1529#true} is VALID [2022-04-27 11:52:27,217 INFO L272 TraceCheckUtils]: 18: Hoare triple {1713#(= (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)); {1529#true} is VALID [2022-04-27 11:52:27,218 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {1529#true} {1713#(= (mod (* main_~d~0 2) 4294967296) (mod (* (* main_~p~0 2) main_~B~0) 4294967296))} #80#return; {1713#(= (mod (* main_~d~0 2) 4294967296) (mod (* (* main_~p~0 2) main_~B~0) 4294967296))} is VALID [2022-04-27 11:52:27,218 INFO L290 TraceCheckUtils]: 16: Hoare triple {1529#true} assume true; {1529#true} is VALID [2022-04-27 11:52:27,218 INFO L290 TraceCheckUtils]: 15: Hoare triple {1529#true} assume !(0 == ~cond); {1529#true} is VALID [2022-04-27 11:52:27,218 INFO L290 TraceCheckUtils]: 14: Hoare triple {1529#true} ~cond := #in~cond; {1529#true} is VALID [2022-04-27 11:52:27,218 INFO L272 TraceCheckUtils]: 13: Hoare triple {1713#(= (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)); {1529#true} is VALID [2022-04-27 11:52:27,219 INFO L290 TraceCheckUtils]: 12: Hoare triple {1713#(= (mod (* main_~d~0 2) 4294967296) (mod (* (* main_~p~0 2) main_~B~0) 4294967296))} assume !false; {1713#(= (mod (* main_~d~0 2) 4294967296) (mod (* (* main_~p~0 2) main_~B~0) 4294967296))} is VALID [2022-04-27 11:52:27,219 INFO L290 TraceCheckUtils]: 11: Hoare triple {1529#true} ~r~0 := ~A~0;~d~0 := ~B~0;~p~0 := 1;~q~0 := 0; {1713#(= (mod (* main_~d~0 2) 4294967296) (mod (* (* main_~p~0 2) main_~B~0) 4294967296))} is VALID [2022-04-27 11:52:27,219 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1529#true} {1529#true} #78#return; {1529#true} is VALID [2022-04-27 11:52:27,219 INFO L290 TraceCheckUtils]: 9: Hoare triple {1529#true} assume true; {1529#true} is VALID [2022-04-27 11:52:27,220 INFO L290 TraceCheckUtils]: 8: Hoare triple {1529#true} assume !(0 == ~cond); {1529#true} is VALID [2022-04-27 11:52:27,220 INFO L290 TraceCheckUtils]: 7: Hoare triple {1529#true} ~cond := #in~cond; {1529#true} is VALID [2022-04-27 11:52:27,220 INFO L272 TraceCheckUtils]: 6: Hoare triple {1529#true} call assume_abort_if_not((if ~B~0 % 4294967296 >= 1 then 1 else 0)); {1529#true} is VALID [2022-04-27 11:52:27,220 INFO L290 TraceCheckUtils]: 5: Hoare triple {1529#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; {1529#true} is VALID [2022-04-27 11:52:27,220 INFO L272 TraceCheckUtils]: 4: Hoare triple {1529#true} call #t~ret6 := main(); {1529#true} is VALID [2022-04-27 11:52:27,220 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1529#true} {1529#true} #94#return; {1529#true} is VALID [2022-04-27 11:52:27,220 INFO L290 TraceCheckUtils]: 2: Hoare triple {1529#true} assume true; {1529#true} is VALID [2022-04-27 11:52:27,220 INFO L290 TraceCheckUtils]: 1: Hoare triple {1529#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); {1529#true} is VALID [2022-04-27 11:52:27,220 INFO L272 TraceCheckUtils]: 0: Hoare triple {1529#true} call ULTIMATE.init(); {1529#true} is VALID [2022-04-27 11:52:27,220 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2022-04-27 11:52:27,221 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 11:52:27,221 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1212346345] [2022-04-27 11:52:27,221 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 11:52:27,221 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [622468842] [2022-04-27 11:52:27,221 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [622468842] provided 1 perfect and 1 imperfect interpolant sequences [2022-04-27 11:52:27,221 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-04-27 11:52:27,221 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 8 [2022-04-27 11:52:27,221 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2015904795] [2022-04-27 11:52:27,221 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 11:52:27,222 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 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 44 [2022-04-27 11:52:27,222 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 11:52:27,222 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 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 11:52:29,260 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 31 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-27 11:52:29,260 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-27 11:52:29,260 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 11:52:29,261 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-27 11:52:29,261 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2022-04-27 11:52:29,261 INFO L87 Difference]: Start difference. First operand 69 states and 82 transitions. Second operand has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 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 11:52:34,529 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 11:52:37,009 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 11:52:39,242 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 11:52:42,535 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 11:52:45,696 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.16s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-27 11:52:45,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:52:45,990 INFO L93 Difference]: Finished difference Result 81 states and 97 transitions. [2022-04-27 11:52:45,990 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-27 11:52:45,990 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 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 44 [2022-04-27 11:52:45,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 11:52:45,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 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 11:52:45,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 53 transitions. [2022-04-27 11:52:45,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 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 11:52:45,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 53 transitions. [2022-04-27 11:52:45,993 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 53 transitions. [2022-04-27 11:52:48,079 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 53 edges. 52 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-27 11:52:48,080 INFO L225 Difference]: With dead ends: 81 [2022-04-27 11:52:48,080 INFO L226 Difference]: Without dead ends: 79 [2022-04-27 11:52:48,080 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 80 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2022-04-27 11:52:48,081 INFO L413 NwaCegarLoop]: 36 mSDtfsCounter, 8 mSDsluCounter, 96 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 2 mSolverCounterUnsat, 5 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 12.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 132 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 5 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 12.2s IncrementalHoareTripleChecker+Time [2022-04-27 11:52:48,081 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 132 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 59 Invalid, 5 Unknown, 0 Unchecked, 12.2s Time] [2022-04-27 11:52:48,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2022-04-27 11:52:48,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 76. [2022-04-27 11:52:48,110 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 11:52:48,111 INFO L82 GeneralOperation]: Start isEquivalent. First operand 79 states. Second operand has 76 states, 45 states have (on average 1.1555555555555554) internal successors, (52), 48 states have internal predecessors, (52), 20 states have call successors, (20), 11 states have call predecessors, (20), 10 states have return successors, (18), 16 states have call predecessors, (18), 18 states have call successors, (18) [2022-04-27 11:52:48,112 INFO L74 IsIncluded]: Start isIncluded. First operand 79 states. Second operand has 76 states, 45 states have (on average 1.1555555555555554) internal successors, (52), 48 states have internal predecessors, (52), 20 states have call successors, (20), 11 states have call predecessors, (20), 10 states have return successors, (18), 16 states have call predecessors, (18), 18 states have call successors, (18) [2022-04-27 11:52:48,113 INFO L87 Difference]: Start difference. First operand 79 states. Second operand has 76 states, 45 states have (on average 1.1555555555555554) internal successors, (52), 48 states have internal predecessors, (52), 20 states have call successors, (20), 11 states have call predecessors, (20), 10 states have return successors, (18), 16 states have call predecessors, (18), 18 states have call successors, (18) [2022-04-27 11:52:48,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:52:48,116 INFO L93 Difference]: Finished difference Result 79 states and 95 transitions. [2022-04-27 11:52:48,116 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 95 transitions. [2022-04-27 11:52:48,117 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:52:48,117 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:52:48,117 INFO L74 IsIncluded]: Start isIncluded. First operand has 76 states, 45 states have (on average 1.1555555555555554) internal successors, (52), 48 states have internal predecessors, (52), 20 states have call successors, (20), 11 states have call predecessors, (20), 10 states have return successors, (18), 16 states have call predecessors, (18), 18 states have call successors, (18) Second operand 79 states. [2022-04-27 11:52:48,117 INFO L87 Difference]: Start difference. First operand has 76 states, 45 states have (on average 1.1555555555555554) internal successors, (52), 48 states have internal predecessors, (52), 20 states have call successors, (20), 11 states have call predecessors, (20), 10 states have return successors, (18), 16 states have call predecessors, (18), 18 states have call successors, (18) Second operand 79 states. [2022-04-27 11:52:48,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:52:48,120 INFO L93 Difference]: Finished difference Result 79 states and 95 transitions. [2022-04-27 11:52:48,120 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 95 transitions. [2022-04-27 11:52:48,121 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:52:48,121 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:52:48,121 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 11:52:48,121 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 11:52:48,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 45 states have (on average 1.1555555555555554) internal successors, (52), 48 states have internal predecessors, (52), 20 states have call successors, (20), 11 states have call predecessors, (20), 10 states have return successors, (18), 16 states have call predecessors, (18), 18 states have call successors, (18) [2022-04-27 11:52:48,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 90 transitions. [2022-04-27 11:52:48,124 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 90 transitions. Word has length 44 [2022-04-27 11:52:48,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 11:52:48,125 INFO L495 AbstractCegarLoop]: Abstraction has 76 states and 90 transitions. [2022-04-27 11:52:48,125 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 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 11:52:48,125 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 90 transitions. [2022-04-27 11:52:48,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2022-04-27 11:52:48,126 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 11:52:48,126 INFO L195 NwaCegarLoop]: trace histogram [6, 5, 5, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 11:52:48,143 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 11:52:48,343 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 11:52:48,344 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 11:52:48,344 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 11:52:48,345 INFO L85 PathProgramCache]: Analyzing trace with hash 1352613400, now seen corresponding path program 1 times [2022-04-27 11:52:48,345 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 11:52:48,345 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1399036180] [2022-04-27 11:52:48,345 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 11:52:48,345 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 11:52:48,369 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 11:52:48,369 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1894796060] [2022-04-27 11:52:48,369 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 11:52:48,369 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 11:52:48,369 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 11:52:48,375 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 11:52:48,376 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process