/usr/bin/java -ea -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --core.log.level.for.class de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/nla-digbench-scaling/dijkstra-u_valuebound1.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-fb4f59a-m [2022-04-27 12:17:57,401 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-27 12:17:57,403 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-27 12:17:57,448 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-27 12:17:57,449 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-27 12:17:57,449 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-27 12:17:57,450 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-27 12:17:57,452 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-27 12:17:57,454 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-27 12:17:57,458 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-27 12:17:57,458 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-27 12:17:57,460 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-27 12:17:57,460 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-27 12:17:57,462 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-27 12:17:57,463 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-27 12:17:57,465 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-27 12:17:57,466 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-27 12:17:57,467 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-27 12:17:57,469 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-27 12:17:57,474 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-27 12:17:57,475 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-27 12:17:57,476 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-27 12:17:57,477 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-27 12:17:57,478 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-27 12:17:57,479 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-27 12:17:57,485 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-27 12:17:57,486 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-27 12:17:57,486 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-27 12:17:57,487 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-27 12:17:57,487 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-27 12:17:57,488 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-27 12:17:57,488 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-27 12:17:57,489 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-27 12:17:57,490 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-27 12:17:57,490 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-27 12:17:57,491 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-27 12:17:57,491 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-27 12:17:57,492 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-27 12:17:57,492 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-27 12:17:57,492 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-27 12:17:57,493 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-27 12:17:57,494 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-27 12:17:57,494 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2022-04-27 12:17:57,523 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-27 12:17:57,523 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-27 12:17:57,523 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-04-27 12:17:57,524 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-04-27 12:17:57,524 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-04-27 12:17:57,524 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-04-27 12:17:57,525 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-04-27 12:17:57,525 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-04-27 12:17:57,525 INFO L138 SettingsManager]: * Use SBE=true [2022-04-27 12:17:57,526 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-27 12:17:57,526 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-27 12:17:57,526 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-27 12:17:57,526 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-27 12:17:57,526 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-27 12:17:57,526 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-27 12:17:57,526 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-27 12:17:57,526 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-27 12:17:57,527 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-27 12:17:57,528 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-27 12:17:57,528 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-27 12:17:57,528 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-27 12:17:57,528 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-27 12:17:57,528 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-27 12:17:57,528 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-27 12:17:57,528 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 12:17:57,528 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-27 12:17:57,529 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-04-27 12:17:57,529 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-04-27 12:17:57,529 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-04-27 12:17:57,529 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-04-27 12:17:57,529 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-04-27 12:17:57,529 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-04-27 12:17:57,529 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-27 12:17:57,529 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-04-27 12:17:57,764 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-27 12:17:57,780 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-27 12:17:57,782 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-27 12:17:57,782 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-27 12:17:57,782 INFO L275 PluginConnector]: CDTParser initialized [2022-04-27 12:17:57,783 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/nla-digbench-scaling/dijkstra-u_valuebound1.c [2022-04-27 12:17:57,832 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8a7f3009b/aa7b667a0e1a4c09b2577a580867f3b6/FLAGd950263d3 [2022-04-27 12:17:58,170 INFO L306 CDTParser]: Found 1 translation units. [2022-04-27 12:17:58,171 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/dijkstra-u_valuebound1.c [2022-04-27 12:17:58,176 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8a7f3009b/aa7b667a0e1a4c09b2577a580867f3b6/FLAGd950263d3 [2022-04-27 12:17:58,186 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8a7f3009b/aa7b667a0e1a4c09b2577a580867f3b6 [2022-04-27 12:17:58,188 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-27 12:17:58,189 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-27 12:17:58,195 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-27 12:17:58,195 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-27 12:17:58,198 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-27 12:17:58,199 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 12:17:58" (1/1) ... [2022-04-27 12:17:58,200 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4a2d0477 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 12:17:58, skipping insertion in model container [2022-04-27 12:17:58,200 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 12:17:58" (1/1) ... [2022-04-27 12:17:58,205 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-27 12:17:58,217 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-27 12:17:58,361 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/dijkstra-u_valuebound1.c[525,538] [2022-04-27 12:17:58,390 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 12:17:58,397 INFO L203 MainTranslator]: Completed pre-run [2022-04-27 12:17:58,407 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/dijkstra-u_valuebound1.c[525,538] [2022-04-27 12:17:58,422 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 12:17:58,432 INFO L208 MainTranslator]: Completed translation [2022-04-27 12:17:58,433 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 12:17:58 WrapperNode [2022-04-27 12:17:58,433 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-27 12:17:58,434 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-27 12:17:58,434 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-27 12:17:58,434 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-27 12:17:58,443 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 12:17:58" (1/1) ... [2022-04-27 12:17:58,443 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 12:17:58" (1/1) ... [2022-04-27 12:17:58,448 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 12:17:58" (1/1) ... [2022-04-27 12:17:58,448 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 12:17:58" (1/1) ... [2022-04-27 12:17:58,454 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 12:17:58" (1/1) ... [2022-04-27 12:17:58,458 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 12:17:58" (1/1) ... [2022-04-27 12:17:58,459 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 12:17:58" (1/1) ... [2022-04-27 12:17:58,460 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-27 12:17:58,461 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-27 12:17:58,461 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-27 12:17:58,461 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-27 12:17:58,462 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 12:17:58" (1/1) ... [2022-04-27 12:17:58,468 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 12:17:58,478 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 12:17:58,487 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-04-27 12:17:58,494 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-04-27 12:17:58,519 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-27 12:17:58,519 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-27 12:17:58,519 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-27 12:17:58,519 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-27 12:17:58,520 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-27 12:17:58,520 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-27 12:17:58,520 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-27 12:17:58,520 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-27 12:17:58,520 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-27 12:17:58,520 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-27 12:17:58,520 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uint [2022-04-27 12:17:58,520 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-27 12:17:58,520 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-27 12:17:58,521 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-27 12:17:58,521 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-27 12:17:58,521 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-27 12:17:58,521 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-27 12:17:58,521 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-27 12:17:58,521 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-27 12:17:58,521 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-27 12:17:58,570 INFO L234 CfgBuilder]: Building ICFG [2022-04-27 12:17:58,571 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-27 12:17:58,742 INFO L275 CfgBuilder]: Performing block encoding [2022-04-27 12:17:58,768 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-27 12:17:58,768 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-04-27 12:17:58,770 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 12:17:58 BoogieIcfgContainer [2022-04-27 12:17:58,770 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-27 12:17:58,772 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-27 12:17:58,772 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-27 12:17:58,774 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-27 12:17:58,775 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.04 12:17:58" (1/3) ... [2022-04-27 12:17:58,775 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@aa86d70 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 12:17:58, skipping insertion in model container [2022-04-27 12:17:58,775 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 12:17:58" (2/3) ... [2022-04-27 12:17:58,776 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@aa86d70 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 12:17:58, skipping insertion in model container [2022-04-27 12:17:58,776 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 12:17:58" (3/3) ... [2022-04-27 12:17:58,777 INFO L111 eAbstractionObserver]: Analyzing ICFG dijkstra-u_valuebound1.c [2022-04-27 12:17:58,798 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-04-27 12:17:58,799 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-27 12:17:58,838 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-27 12:17:58,853 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@2c1b5560, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@112d2467 [2022-04-27 12:17:58,853 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-27 12:17:58,860 INFO L276 IsEmpty]: Start isEmpty. Operand has 38 states, 19 states have (on average 1.5263157894736843) internal successors, (29), 20 states have internal predecessors, (29), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-27 12:17:58,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-04-27 12:17:58,866 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 12:17:58,866 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 12:17:58,867 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 12:17:58,871 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 12:17:58,871 INFO L85 PathProgramCache]: Analyzing trace with hash 223850557, now seen corresponding path program 1 times [2022-04-27 12:17:58,878 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 12:17:58,879 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1294143835] [2022-04-27 12:17:58,879 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 12:17:58,880 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 12:17:58,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:17:59,039 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 12:17:59,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:17:59,067 INFO L290 TraceCheckUtils]: 0: Hoare triple {54#(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(13, 2);call #Ultimate.allocInit(12, 3); {41#true} is VALID [2022-04-27 12:17:59,067 INFO L290 TraceCheckUtils]: 1: Hoare triple {41#true} assume true; {41#true} is VALID [2022-04-27 12:17:59,067 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {41#true} {41#true} #103#return; {41#true} is VALID [2022-04-27 12:17:59,068 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-27 12:17:59,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:17:59,082 INFO L290 TraceCheckUtils]: 0: Hoare triple {41#true} ~cond := #in~cond; {41#true} is VALID [2022-04-27 12:17:59,083 INFO L290 TraceCheckUtils]: 1: Hoare triple {41#true} assume 0 == ~cond;assume false; {42#false} is VALID [2022-04-27 12:17:59,084 INFO L290 TraceCheckUtils]: 2: Hoare triple {42#false} assume true; {42#false} is VALID [2022-04-27 12:17:59,084 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {42#false} {41#true} #81#return; {42#false} is VALID [2022-04-27 12:17:59,085 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-04-27 12:17:59,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:17:59,099 INFO L290 TraceCheckUtils]: 0: Hoare triple {41#true} ~cond := #in~cond; {41#true} is VALID [2022-04-27 12:17:59,100 INFO L290 TraceCheckUtils]: 1: Hoare triple {41#true} assume 0 == ~cond;assume false; {42#false} is VALID [2022-04-27 12:17:59,100 INFO L290 TraceCheckUtils]: 2: Hoare triple {42#false} assume true; {42#false} is VALID [2022-04-27 12:17:59,100 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {42#false} {42#false} #83#return; {42#false} is VALID [2022-04-27 12:17:59,101 INFO L272 TraceCheckUtils]: 0: Hoare triple {41#true} call ULTIMATE.init(); {54#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 12:17:59,102 INFO L290 TraceCheckUtils]: 1: Hoare triple {54#(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(13, 2);call #Ultimate.allocInit(12, 3); {41#true} is VALID [2022-04-27 12:17:59,102 INFO L290 TraceCheckUtils]: 2: Hoare triple {41#true} assume true; {41#true} is VALID [2022-04-27 12:17:59,102 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {41#true} {41#true} #103#return; {41#true} is VALID [2022-04-27 12:17:59,102 INFO L272 TraceCheckUtils]: 4: Hoare triple {41#true} call #t~ret5 := main(); {41#true} is VALID [2022-04-27 12:17:59,102 INFO L290 TraceCheckUtils]: 5: Hoare triple {41#true} havoc ~n~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~h~0;~n~0 := #t~nondet4;havoc #t~nondet4; {41#true} is VALID [2022-04-27 12:17:59,103 INFO L272 TraceCheckUtils]: 6: Hoare triple {41#true} call assume_abort_if_not((if ~n~0 % 4294967296 >= 0 && ~n~0 % 4294967296 <= 1 then 1 else 0)); {41#true} is VALID [2022-04-27 12:17:59,103 INFO L290 TraceCheckUtils]: 7: Hoare triple {41#true} ~cond := #in~cond; {41#true} is VALID [2022-04-27 12:17:59,103 INFO L290 TraceCheckUtils]: 8: Hoare triple {41#true} assume 0 == ~cond;assume false; {42#false} is VALID [2022-04-27 12:17:59,104 INFO L290 TraceCheckUtils]: 9: Hoare triple {42#false} assume true; {42#false} is VALID [2022-04-27 12:17:59,104 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {42#false} {41#true} #81#return; {42#false} is VALID [2022-04-27 12:17:59,104 INFO L272 TraceCheckUtils]: 11: Hoare triple {42#false} call assume_abort_if_not((if ~n~0 % 4294967296 < 1073741823 then 1 else 0)); {41#true} is VALID [2022-04-27 12:17:59,105 INFO L290 TraceCheckUtils]: 12: Hoare triple {41#true} ~cond := #in~cond; {41#true} is VALID [2022-04-27 12:17:59,106 INFO L290 TraceCheckUtils]: 13: Hoare triple {41#true} assume 0 == ~cond;assume false; {42#false} is VALID [2022-04-27 12:17:59,106 INFO L290 TraceCheckUtils]: 14: Hoare triple {42#false} assume true; {42#false} is VALID [2022-04-27 12:17:59,106 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {42#false} {42#false} #83#return; {42#false} is VALID [2022-04-27 12:17:59,106 INFO L290 TraceCheckUtils]: 16: Hoare triple {42#false} ~p~0 := 0;~q~0 := 1;~r~0 := ~n~0;~h~0 := 0; {42#false} is VALID [2022-04-27 12:17:59,107 INFO L290 TraceCheckUtils]: 17: Hoare triple {42#false} assume false; {42#false} is VALID [2022-04-27 12:17:59,107 INFO L290 TraceCheckUtils]: 18: Hoare triple {42#false} assume false; {42#false} is VALID [2022-04-27 12:17:59,107 INFO L272 TraceCheckUtils]: 19: Hoare triple {42#false} call __VERIFIER_assert((if 0 == (~h~0 * ~h~0 * ~h~0 - 12 * ~h~0 * ~n~0 + 16 * ~n~0 * ~p~0 + 12 * ~h~0 * ~r~0 - 16 * ~p~0 * ~r~0 - ~h~0 - 4 * ~p~0) % 4294967296 then 1 else 0)); {42#false} is VALID [2022-04-27 12:17:59,107 INFO L290 TraceCheckUtils]: 20: Hoare triple {42#false} ~cond := #in~cond; {42#false} is VALID [2022-04-27 12:17:59,108 INFO L290 TraceCheckUtils]: 21: Hoare triple {42#false} assume 0 == ~cond; {42#false} is VALID [2022-04-27 12:17:59,113 INFO L290 TraceCheckUtils]: 22: Hoare triple {42#false} assume !false; {42#false} is VALID [2022-04-27 12:17:59,113 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-27 12:17:59,115 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 12:17:59,116 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1294143835] [2022-04-27 12:17:59,116 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1294143835] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 12:17:59,116 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 12:17:59,116 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-27 12:17:59,118 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1182079612] [2022-04-27 12:17:59,118 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 12:17:59,125 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 23 [2022-04-27 12:17:59,126 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 12:17:59,129 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-27 12:17:59,155 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 12:17:59,155 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-27 12:17:59,155 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 12:17:59,179 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-27 12:17:59,180 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-27 12:17:59,184 INFO L87 Difference]: Start difference. First operand has 38 states, 19 states have (on average 1.5263157894736843) internal successors, (29), 20 states have internal predecessors, (29), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-27 12:18:06,239 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 12:18:06,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:18:06,566 INFO L93 Difference]: Finished difference Result 69 states and 113 transitions. [2022-04-27 12:18:06,566 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-27 12:18:06,567 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 23 [2022-04-27 12:18:06,567 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 12:18:06,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-27 12:18:06,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 113 transitions. [2022-04-27 12:18:06,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-27 12:18:06,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 113 transitions. [2022-04-27 12:18:06,602 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 113 transitions. [2022-04-27 12:18:06,760 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 113 edges. 113 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 12:18:06,772 INFO L225 Difference]: With dead ends: 69 [2022-04-27 12:18:06,772 INFO L226 Difference]: Without dead ends: 33 [2022-04-27 12:18:06,775 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-27 12:18:06,780 INFO L413 NwaCegarLoop]: 39 mSDtfsCounter, 20 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 13 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 42 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2022-04-27 12:18:06,782 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 42 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 11 Invalid, 1 Unknown, 0 Unchecked, 2.1s Time] [2022-04-27 12:18:06,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2022-04-27 12:18:06,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2022-04-27 12:18:06,818 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 12:18:06,821 INFO L82 GeneralOperation]: Start isEquivalent. First operand 33 states. Second operand has 33 states, 16 states have (on average 1.25) internal successors, (20), 17 states have internal predecessors, (20), 13 states have call successors, (13), 4 states have call predecessors, (13), 3 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-27 12:18:06,823 INFO L74 IsIncluded]: Start isIncluded. First operand 33 states. Second operand has 33 states, 16 states have (on average 1.25) internal successors, (20), 17 states have internal predecessors, (20), 13 states have call successors, (13), 4 states have call predecessors, (13), 3 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-27 12:18:06,828 INFO L87 Difference]: Start difference. First operand 33 states. Second operand has 33 states, 16 states have (on average 1.25) internal successors, (20), 17 states have internal predecessors, (20), 13 states have call successors, (13), 4 states have call predecessors, (13), 3 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-27 12:18:06,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:18:06,837 INFO L93 Difference]: Finished difference Result 33 states and 44 transitions. [2022-04-27 12:18:06,837 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 44 transitions. [2022-04-27 12:18:06,838 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 12:18:06,838 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 12:18:06,839 INFO L74 IsIncluded]: Start isIncluded. First operand has 33 states, 16 states have (on average 1.25) internal successors, (20), 17 states have internal predecessors, (20), 13 states have call successors, (13), 4 states have call predecessors, (13), 3 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand 33 states. [2022-04-27 12:18:06,840 INFO L87 Difference]: Start difference. First operand has 33 states, 16 states have (on average 1.25) internal successors, (20), 17 states have internal predecessors, (20), 13 states have call successors, (13), 4 states have call predecessors, (13), 3 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand 33 states. [2022-04-27 12:18:06,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:18:06,846 INFO L93 Difference]: Finished difference Result 33 states and 44 transitions. [2022-04-27 12:18:06,846 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 44 transitions. [2022-04-27 12:18:06,847 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 12:18:06,847 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 12:18:06,847 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 12:18:06,848 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 12:18:06,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 16 states have (on average 1.25) internal successors, (20), 17 states have internal predecessors, (20), 13 states have call successors, (13), 4 states have call predecessors, (13), 3 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-27 12:18:06,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 44 transitions. [2022-04-27 12:18:06,856 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 44 transitions. Word has length 23 [2022-04-27 12:18:06,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 12:18:06,857 INFO L495 AbstractCegarLoop]: Abstraction has 33 states and 44 transitions. [2022-04-27 12:18:06,859 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-27 12:18:06,859 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 44 transitions. [2022-04-27 12:18:06,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-04-27 12:18:06,861 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 12:18:06,861 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 12:18:06,862 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-27 12:18:06,862 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 12:18:06,866 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 12:18:06,866 INFO L85 PathProgramCache]: Analyzing trace with hash -563604624, now seen corresponding path program 1 times [2022-04-27 12:18:06,866 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 12:18:06,867 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1896019673] [2022-04-27 12:18:06,867 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 12:18:06,867 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 12:18:06,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:18:07,170 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 12:18:07,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:18:07,177 INFO L290 TraceCheckUtils]: 0: Hoare triple {291#(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(13, 2);call #Ultimate.allocInit(12, 3); {274#true} is VALID [2022-04-27 12:18:07,177 INFO L290 TraceCheckUtils]: 1: Hoare triple {274#true} assume true; {274#true} is VALID [2022-04-27 12:18:07,178 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {274#true} {274#true} #103#return; {274#true} is VALID [2022-04-27 12:18:07,178 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-27 12:18:07,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:18:07,182 INFO L290 TraceCheckUtils]: 0: Hoare triple {274#true} ~cond := #in~cond; {274#true} is VALID [2022-04-27 12:18:07,183 INFO L290 TraceCheckUtils]: 1: Hoare triple {274#true} assume !(0 == ~cond); {274#true} is VALID [2022-04-27 12:18:07,183 INFO L290 TraceCheckUtils]: 2: Hoare triple {274#true} assume true; {274#true} is VALID [2022-04-27 12:18:07,183 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {274#true} {274#true} #81#return; {274#true} is VALID [2022-04-27 12:18:07,183 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-04-27 12:18:07,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:18:07,188 INFO L290 TraceCheckUtils]: 0: Hoare triple {274#true} ~cond := #in~cond; {274#true} is VALID [2022-04-27 12:18:07,188 INFO L290 TraceCheckUtils]: 1: Hoare triple {274#true} assume !(0 == ~cond); {274#true} is VALID [2022-04-27 12:18:07,188 INFO L290 TraceCheckUtils]: 2: Hoare triple {274#true} assume true; {274#true} is VALID [2022-04-27 12:18:07,188 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {274#true} {274#true} #83#return; {274#true} is VALID [2022-04-27 12:18:07,189 INFO L272 TraceCheckUtils]: 0: Hoare triple {274#true} call ULTIMATE.init(); {291#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 12:18:07,189 INFO L290 TraceCheckUtils]: 1: Hoare triple {291#(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(13, 2);call #Ultimate.allocInit(12, 3); {274#true} is VALID [2022-04-27 12:18:07,189 INFO L290 TraceCheckUtils]: 2: Hoare triple {274#true} assume true; {274#true} is VALID [2022-04-27 12:18:07,190 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {274#true} {274#true} #103#return; {274#true} is VALID [2022-04-27 12:18:07,190 INFO L272 TraceCheckUtils]: 4: Hoare triple {274#true} call #t~ret5 := main(); {274#true} is VALID [2022-04-27 12:18:07,190 INFO L290 TraceCheckUtils]: 5: Hoare triple {274#true} havoc ~n~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~h~0;~n~0 := #t~nondet4;havoc #t~nondet4; {274#true} is VALID [2022-04-27 12:18:07,190 INFO L272 TraceCheckUtils]: 6: Hoare triple {274#true} call assume_abort_if_not((if ~n~0 % 4294967296 >= 0 && ~n~0 % 4294967296 <= 1 then 1 else 0)); {274#true} is VALID [2022-04-27 12:18:07,190 INFO L290 TraceCheckUtils]: 7: Hoare triple {274#true} ~cond := #in~cond; {274#true} is VALID [2022-04-27 12:18:07,190 INFO L290 TraceCheckUtils]: 8: Hoare triple {274#true} assume !(0 == ~cond); {274#true} is VALID [2022-04-27 12:18:07,191 INFO L290 TraceCheckUtils]: 9: Hoare triple {274#true} assume true; {274#true} is VALID [2022-04-27 12:18:07,191 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {274#true} {274#true} #81#return; {274#true} is VALID [2022-04-27 12:18:07,191 INFO L272 TraceCheckUtils]: 11: Hoare triple {274#true} call assume_abort_if_not((if ~n~0 % 4294967296 < 1073741823 then 1 else 0)); {274#true} is VALID [2022-04-27 12:18:07,191 INFO L290 TraceCheckUtils]: 12: Hoare triple {274#true} ~cond := #in~cond; {274#true} is VALID [2022-04-27 12:18:07,192 INFO L290 TraceCheckUtils]: 13: Hoare triple {274#true} assume !(0 == ~cond); {274#true} is VALID [2022-04-27 12:18:07,192 INFO L290 TraceCheckUtils]: 14: Hoare triple {274#true} assume true; {274#true} is VALID [2022-04-27 12:18:07,192 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {274#true} {274#true} #83#return; {274#true} is VALID [2022-04-27 12:18:07,193 INFO L290 TraceCheckUtils]: 16: Hoare triple {274#true} ~p~0 := 0;~q~0 := 1;~r~0 := ~n~0;~h~0 := 0; {287#(and (= main_~p~0 0) (= main_~n~0 main_~r~0) (= main_~q~0 1))} is VALID [2022-04-27 12:18:07,193 INFO L290 TraceCheckUtils]: 17: Hoare triple {287#(and (= main_~p~0 0) (= main_~n~0 main_~r~0) (= main_~q~0 1))} assume !false; {287#(and (= main_~p~0 0) (= main_~n~0 main_~r~0) (= main_~q~0 1))} is VALID [2022-04-27 12:18:07,194 INFO L290 TraceCheckUtils]: 18: Hoare triple {287#(and (= main_~p~0 0) (= main_~n~0 main_~r~0) (= main_~q~0 1))} assume !(~q~0 % 4294967296 <= ~n~0 % 4294967296); {288#(and (= main_~p~0 0) (<= (+ (* (div (+ (* main_~p~0 2) main_~q~0) 4294967296) 4294967296) (* 4294967296 (div main_~q~0 4294967296)) main_~r~0 1) (+ main_~q~0 (* (div main_~r~0 4294967296) 4294967296))) (= (+ (- 1) main_~q~0) 0))} is VALID [2022-04-27 12:18:07,195 INFO L290 TraceCheckUtils]: 19: Hoare triple {288#(and (= main_~p~0 0) (<= (+ (* (div (+ (* main_~p~0 2) main_~q~0) 4294967296) 4294967296) (* 4294967296 (div main_~q~0 4294967296)) main_~r~0 1) (+ main_~q~0 (* (div main_~r~0 4294967296) 4294967296))) (= (+ (- 1) main_~q~0) 0))} assume !false; {288#(and (= main_~p~0 0) (<= (+ (* (div (+ (* main_~p~0 2) main_~q~0) 4294967296) 4294967296) (* 4294967296 (div main_~q~0 4294967296)) main_~r~0 1) (+ main_~q~0 (* (div main_~r~0 4294967296) 4294967296))) (= (+ (- 1) main_~q~0) 0))} is VALID [2022-04-27 12:18:07,196 INFO L272 TraceCheckUtils]: 20: Hoare triple {288#(and (= main_~p~0 0) (<= (+ (* (div (+ (* main_~p~0 2) main_~q~0) 4294967296) 4294967296) (* 4294967296 (div main_~q~0 4294967296)) main_~r~0 1) (+ main_~q~0 (* (div main_~r~0 4294967296) 4294967296))) (= (+ (- 1) main_~q~0) 0))} call __VERIFIER_assert((if ~r~0 % 4294967296 < (2 * ~p~0 + ~q~0) % 4294967296 then 1 else 0)); {289#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 12:18:07,197 INFO L290 TraceCheckUtils]: 21: Hoare triple {289#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {290#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-27 12:18:07,197 INFO L290 TraceCheckUtils]: 22: Hoare triple {290#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {275#false} is VALID [2022-04-27 12:18:07,197 INFO L290 TraceCheckUtils]: 23: Hoare triple {275#false} assume !false; {275#false} is VALID [2022-04-27 12:18:07,198 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-27 12:18:07,198 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 12:18:07,198 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1896019673] [2022-04-27 12:18:07,198 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1896019673] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 12:18:07,198 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 12:18:07,199 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-27 12:18:07,199 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [791185197] [2022-04-27 12:18:07,199 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 12:18:07,200 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 24 [2022-04-27 12:18:07,200 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 12:18:07,201 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-27 12:18:07,219 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 21 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 12:18:07,219 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-27 12:18:07,220 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 12:18:07,220 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-27 12:18:07,220 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-04-27 12:18:07,221 INFO L87 Difference]: Start difference. First operand 33 states and 44 transitions. Second operand has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-27 12:18:14,386 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 12:18:17,367 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-27 12:18:19,369 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-27 12:18:23,160 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 12:18:23,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:18:23,848 INFO L93 Difference]: Finished difference Result 68 states and 98 transitions. [2022-04-27 12:18:23,848 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-27 12:18:23,848 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 24 [2022-04-27 12:18:23,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 12:18:23,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-27 12:18:23,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 98 transitions. [2022-04-27 12:18:23,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-27 12:18:23,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 98 transitions. [2022-04-27 12:18:23,855 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 98 transitions. [2022-04-27 12:18:24,110 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 98 edges. 98 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 12:18:24,112 INFO L225 Difference]: With dead ends: 68 [2022-04-27 12:18:24,112 INFO L226 Difference]: Without dead ends: 48 [2022-04-27 12:18:24,113 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2022-04-27 12:18:24,114 INFO L413 NwaCegarLoop]: 31 mSDtfsCounter, 35 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 195 mSolverCounterSat, 52 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 11.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 53 SdHoareTripleChecker+Invalid, 251 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 195 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 11.9s IncrementalHoareTripleChecker+Time [2022-04-27 12:18:24,114 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 53 Invalid, 251 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 195 Invalid, 4 Unknown, 0 Unchecked, 11.9s Time] [2022-04-27 12:18:24,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2022-04-27 12:18:24,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2022-04-27 12:18:24,129 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 12:18:24,130 INFO L82 GeneralOperation]: Start isEquivalent. First operand 48 states. Second operand has 48 states, 23 states have (on average 1.2173913043478262) internal successors, (28), 25 states have internal predecessors, (28), 20 states have call successors, (20), 5 states have call predecessors, (20), 4 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2022-04-27 12:18:24,130 INFO L74 IsIncluded]: Start isIncluded. First operand 48 states. Second operand has 48 states, 23 states have (on average 1.2173913043478262) internal successors, (28), 25 states have internal predecessors, (28), 20 states have call successors, (20), 5 states have call predecessors, (20), 4 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2022-04-27 12:18:24,131 INFO L87 Difference]: Start difference. First operand 48 states. Second operand has 48 states, 23 states have (on average 1.2173913043478262) internal successors, (28), 25 states have internal predecessors, (28), 20 states have call successors, (20), 5 states have call predecessors, (20), 4 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2022-04-27 12:18:24,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:18:24,134 INFO L93 Difference]: Finished difference Result 48 states and 65 transitions. [2022-04-27 12:18:24,134 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 65 transitions. [2022-04-27 12:18:24,135 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 12:18:24,135 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 12:18:24,136 INFO L74 IsIncluded]: Start isIncluded. First operand has 48 states, 23 states have (on average 1.2173913043478262) internal successors, (28), 25 states have internal predecessors, (28), 20 states have call successors, (20), 5 states have call predecessors, (20), 4 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) Second operand 48 states. [2022-04-27 12:18:24,136 INFO L87 Difference]: Start difference. First operand has 48 states, 23 states have (on average 1.2173913043478262) internal successors, (28), 25 states have internal predecessors, (28), 20 states have call successors, (20), 5 states have call predecessors, (20), 4 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) Second operand 48 states. [2022-04-27 12:18:24,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:18:24,139 INFO L93 Difference]: Finished difference Result 48 states and 65 transitions. [2022-04-27 12:18:24,139 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 65 transitions. [2022-04-27 12:18:24,140 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 12:18:24,140 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 12:18:24,140 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 12:18:24,141 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 12:18:24,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 23 states have (on average 1.2173913043478262) internal successors, (28), 25 states have internal predecessors, (28), 20 states have call successors, (20), 5 states have call predecessors, (20), 4 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2022-04-27 12:18:24,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 65 transitions. [2022-04-27 12:18:24,144 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 65 transitions. Word has length 24 [2022-04-27 12:18:24,144 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 12:18:24,144 INFO L495 AbstractCegarLoop]: Abstraction has 48 states and 65 transitions. [2022-04-27 12:18:24,144 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-27 12:18:24,144 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 65 transitions. [2022-04-27 12:18:24,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-04-27 12:18:24,145 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 12:18:24,145 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 12:18:24,145 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-27 12:18:24,146 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 12:18:24,146 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 12:18:24,146 INFO L85 PathProgramCache]: Analyzing trace with hash -5094773, now seen corresponding path program 1 times [2022-04-27 12:18:24,146 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 12:18:24,146 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [892588811] [2022-04-27 12:18:24,146 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 12:18:24,147 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 12:18:24,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:18:24,328 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 12:18:24,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:18:24,333 INFO L290 TraceCheckUtils]: 0: Hoare triple {600#(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(13, 2);call #Ultimate.allocInit(12, 3); {582#true} is VALID [2022-04-27 12:18:24,333 INFO L290 TraceCheckUtils]: 1: Hoare triple {582#true} assume true; {582#true} is VALID [2022-04-27 12:18:24,334 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {582#true} {582#true} #103#return; {582#true} is VALID [2022-04-27 12:18:24,334 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-27 12:18:24,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:18:24,337 INFO L290 TraceCheckUtils]: 0: Hoare triple {582#true} ~cond := #in~cond; {582#true} is VALID [2022-04-27 12:18:24,338 INFO L290 TraceCheckUtils]: 1: Hoare triple {582#true} assume !(0 == ~cond); {582#true} is VALID [2022-04-27 12:18:24,338 INFO L290 TraceCheckUtils]: 2: Hoare triple {582#true} assume true; {582#true} is VALID [2022-04-27 12:18:24,338 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {582#true} {582#true} #81#return; {582#true} is VALID [2022-04-27 12:18:24,338 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-04-27 12:18:24,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:18:24,342 INFO L290 TraceCheckUtils]: 0: Hoare triple {582#true} ~cond := #in~cond; {582#true} is VALID [2022-04-27 12:18:24,342 INFO L290 TraceCheckUtils]: 1: Hoare triple {582#true} assume !(0 == ~cond); {582#true} is VALID [2022-04-27 12:18:24,342 INFO L290 TraceCheckUtils]: 2: Hoare triple {582#true} assume true; {582#true} is VALID [2022-04-27 12:18:24,342 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {582#true} {582#true} #83#return; {582#true} is VALID [2022-04-27 12:18:24,343 INFO L272 TraceCheckUtils]: 0: Hoare triple {582#true} call ULTIMATE.init(); {600#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 12:18:24,343 INFO L290 TraceCheckUtils]: 1: Hoare triple {600#(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(13, 2);call #Ultimate.allocInit(12, 3); {582#true} is VALID [2022-04-27 12:18:24,343 INFO L290 TraceCheckUtils]: 2: Hoare triple {582#true} assume true; {582#true} is VALID [2022-04-27 12:18:24,343 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {582#true} {582#true} #103#return; {582#true} is VALID [2022-04-27 12:18:24,344 INFO L272 TraceCheckUtils]: 4: Hoare triple {582#true} call #t~ret5 := main(); {582#true} is VALID [2022-04-27 12:18:24,344 INFO L290 TraceCheckUtils]: 5: Hoare triple {582#true} havoc ~n~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~h~0;~n~0 := #t~nondet4;havoc #t~nondet4; {582#true} is VALID [2022-04-27 12:18:24,344 INFO L272 TraceCheckUtils]: 6: Hoare triple {582#true} call assume_abort_if_not((if ~n~0 % 4294967296 >= 0 && ~n~0 % 4294967296 <= 1 then 1 else 0)); {582#true} is VALID [2022-04-27 12:18:24,344 INFO L290 TraceCheckUtils]: 7: Hoare triple {582#true} ~cond := #in~cond; {582#true} is VALID [2022-04-27 12:18:24,344 INFO L290 TraceCheckUtils]: 8: Hoare triple {582#true} assume !(0 == ~cond); {582#true} is VALID [2022-04-27 12:18:24,344 INFO L290 TraceCheckUtils]: 9: Hoare triple {582#true} assume true; {582#true} is VALID [2022-04-27 12:18:24,345 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {582#true} {582#true} #81#return; {582#true} is VALID [2022-04-27 12:18:24,345 INFO L272 TraceCheckUtils]: 11: Hoare triple {582#true} call assume_abort_if_not((if ~n~0 % 4294967296 < 1073741823 then 1 else 0)); {582#true} is VALID [2022-04-27 12:18:24,345 INFO L290 TraceCheckUtils]: 12: Hoare triple {582#true} ~cond := #in~cond; {582#true} is VALID [2022-04-27 12:18:24,345 INFO L290 TraceCheckUtils]: 13: Hoare triple {582#true} assume !(0 == ~cond); {582#true} is VALID [2022-04-27 12:18:24,345 INFO L290 TraceCheckUtils]: 14: Hoare triple {582#true} assume true; {582#true} is VALID [2022-04-27 12:18:24,345 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {582#true} {582#true} #83#return; {582#true} is VALID [2022-04-27 12:18:24,346 INFO L290 TraceCheckUtils]: 16: Hoare triple {582#true} ~p~0 := 0;~q~0 := 1;~r~0 := ~n~0;~h~0 := 0; {595#(and (= main_~p~0 0) (= (+ (- 1) main_~q~0) 0) (= (+ main_~n~0 (* (- 1) main_~r~0)) 0))} is VALID [2022-04-27 12:18:24,346 INFO L290 TraceCheckUtils]: 17: Hoare triple {595#(and (= main_~p~0 0) (= (+ (- 1) main_~q~0) 0) (= (+ main_~n~0 (* (- 1) main_~r~0)) 0))} assume !false; {595#(and (= main_~p~0 0) (= (+ (- 1) main_~q~0) 0) (= (+ main_~n~0 (* (- 1) main_~r~0)) 0))} is VALID [2022-04-27 12:18:24,347 INFO L290 TraceCheckUtils]: 18: Hoare triple {595#(and (= main_~p~0 0) (= (+ (- 1) main_~q~0) 0) (= (+ main_~n~0 (* (- 1) main_~r~0)) 0))} assume !!(~q~0 % 4294967296 <= ~n~0 % 4294967296);~q~0 := 4 * ~q~0; {596#(and (not (<= (+ (div main_~q~0 4294967296) 1) 0)) (= main_~p~0 0) (<= (+ (div (+ (* main_~p~0 2) main_~q~0) 4294967296) (div main_~n~0 4294967296)) (div main_~r~0 4294967296)) (= (+ main_~n~0 (* (- 1) main_~r~0)) 0))} is VALID [2022-04-27 12:18:24,348 INFO L290 TraceCheckUtils]: 19: Hoare triple {596#(and (not (<= (+ (div main_~q~0 4294967296) 1) 0)) (= main_~p~0 0) (<= (+ (div (+ (* main_~p~0 2) main_~q~0) 4294967296) (div main_~n~0 4294967296)) (div main_~r~0 4294967296)) (= (+ main_~n~0 (* (- 1) main_~r~0)) 0))} assume !false; {596#(and (not (<= (+ (div main_~q~0 4294967296) 1) 0)) (= main_~p~0 0) (<= (+ (div (+ (* main_~p~0 2) main_~q~0) 4294967296) (div main_~n~0 4294967296)) (div main_~r~0 4294967296)) (= (+ main_~n~0 (* (- 1) main_~r~0)) 0))} is VALID [2022-04-27 12:18:24,349 INFO L290 TraceCheckUtils]: 20: Hoare triple {596#(and (not (<= (+ (div main_~q~0 4294967296) 1) 0)) (= main_~p~0 0) (<= (+ (div (+ (* main_~p~0 2) main_~q~0) 4294967296) (div main_~n~0 4294967296)) (div main_~r~0 4294967296)) (= (+ main_~n~0 (* (- 1) main_~r~0)) 0))} assume !(~q~0 % 4294967296 <= ~n~0 % 4294967296); {597#(and (< 0 (+ (div main_~q~0 4294967296) 1)) (= main_~p~0 0) (<= (+ (* (div (+ (* main_~p~0 2) main_~q~0) 4294967296) 4294967296) (* 4294967296 (div main_~q~0 4294967296)) main_~r~0 1) (+ main_~q~0 (* (div main_~r~0 4294967296) 4294967296))))} is VALID [2022-04-27 12:18:24,350 INFO L290 TraceCheckUtils]: 21: Hoare triple {597#(and (< 0 (+ (div main_~q~0 4294967296) 1)) (= main_~p~0 0) (<= (+ (* (div (+ (* main_~p~0 2) main_~q~0) 4294967296) 4294967296) (* 4294967296 (div main_~q~0 4294967296)) main_~r~0 1) (+ main_~q~0 (* (div main_~r~0 4294967296) 4294967296))))} assume !false; {597#(and (< 0 (+ (div main_~q~0 4294967296) 1)) (= main_~p~0 0) (<= (+ (* (div (+ (* main_~p~0 2) main_~q~0) 4294967296) 4294967296) (* 4294967296 (div main_~q~0 4294967296)) main_~r~0 1) (+ main_~q~0 (* (div main_~r~0 4294967296) 4294967296))))} is VALID [2022-04-27 12:18:24,351 INFO L272 TraceCheckUtils]: 22: Hoare triple {597#(and (< 0 (+ (div main_~q~0 4294967296) 1)) (= main_~p~0 0) (<= (+ (* (div (+ (* main_~p~0 2) main_~q~0) 4294967296) 4294967296) (* 4294967296 (div main_~q~0 4294967296)) main_~r~0 1) (+ main_~q~0 (* (div main_~r~0 4294967296) 4294967296))))} call __VERIFIER_assert((if ~r~0 % 4294967296 < (2 * ~p~0 + ~q~0) % 4294967296 then 1 else 0)); {598#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 12:18:24,352 INFO L290 TraceCheckUtils]: 23: Hoare triple {598#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {599#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-27 12:18:24,352 INFO L290 TraceCheckUtils]: 24: Hoare triple {599#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {583#false} is VALID [2022-04-27 12:18:24,353 INFO L290 TraceCheckUtils]: 25: Hoare triple {583#false} assume !false; {583#false} is VALID [2022-04-27 12:18:24,353 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-27 12:18:24,353 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 12:18:24,353 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [892588811] [2022-04-27 12:18:24,353 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [892588811] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 12:18:24,354 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1412546634] [2022-04-27 12:18:24,354 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 12:18:24,354 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 12:18:24,354 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 12:18:24,356 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 12:18:24,377 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-04-27 12:18:24,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:18:24,424 INFO L263 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 16 conjunts are in the unsatisfiable core [2022-04-27 12:18:24,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:18:24,443 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 12:18:24,993 INFO L272 TraceCheckUtils]: 0: Hoare triple {582#true} call ULTIMATE.init(); {582#true} is VALID [2022-04-27 12:18:24,994 INFO L290 TraceCheckUtils]: 1: Hoare triple {582#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(13, 2);call #Ultimate.allocInit(12, 3); {582#true} is VALID [2022-04-27 12:18:24,994 INFO L290 TraceCheckUtils]: 2: Hoare triple {582#true} assume true; {582#true} is VALID [2022-04-27 12:18:24,994 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {582#true} {582#true} #103#return; {582#true} is VALID [2022-04-27 12:18:24,994 INFO L272 TraceCheckUtils]: 4: Hoare triple {582#true} call #t~ret5 := main(); {582#true} is VALID [2022-04-27 12:18:24,994 INFO L290 TraceCheckUtils]: 5: Hoare triple {582#true} havoc ~n~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~h~0;~n~0 := #t~nondet4;havoc #t~nondet4; {582#true} is VALID [2022-04-27 12:18:24,994 INFO L272 TraceCheckUtils]: 6: Hoare triple {582#true} call assume_abort_if_not((if ~n~0 % 4294967296 >= 0 && ~n~0 % 4294967296 <= 1 then 1 else 0)); {582#true} is VALID [2022-04-27 12:18:24,995 INFO L290 TraceCheckUtils]: 7: Hoare triple {582#true} ~cond := #in~cond; {625#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-27 12:18:24,995 INFO L290 TraceCheckUtils]: 8: Hoare triple {625#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {629#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-27 12:18:24,996 INFO L290 TraceCheckUtils]: 9: Hoare triple {629#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {629#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-27 12:18:24,996 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {629#(not (= |assume_abort_if_not_#in~cond| 0))} {582#true} #81#return; {636#(<= (mod main_~n~0 4294967296) 1)} is VALID [2022-04-27 12:18:24,997 INFO L272 TraceCheckUtils]: 11: Hoare triple {636#(<= (mod main_~n~0 4294967296) 1)} call assume_abort_if_not((if ~n~0 % 4294967296 < 1073741823 then 1 else 0)); {582#true} is VALID [2022-04-27 12:18:24,997 INFO L290 TraceCheckUtils]: 12: Hoare triple {582#true} ~cond := #in~cond; {582#true} is VALID [2022-04-27 12:18:24,997 INFO L290 TraceCheckUtils]: 13: Hoare triple {582#true} assume !(0 == ~cond); {582#true} is VALID [2022-04-27 12:18:24,997 INFO L290 TraceCheckUtils]: 14: Hoare triple {582#true} assume true; {582#true} is VALID [2022-04-27 12:18:24,998 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {582#true} {636#(<= (mod main_~n~0 4294967296) 1)} #83#return; {636#(<= (mod main_~n~0 4294967296) 1)} is VALID [2022-04-27 12:18:24,998 INFO L290 TraceCheckUtils]: 16: Hoare triple {636#(<= (mod main_~n~0 4294967296) 1)} ~p~0 := 0;~q~0 := 1;~r~0 := ~n~0;~h~0 := 0; {655#(and (<= (mod main_~r~0 4294967296) 1) (= main_~p~0 0) (= main_~q~0 1))} is VALID [2022-04-27 12:18:24,999 INFO L290 TraceCheckUtils]: 17: Hoare triple {655#(and (<= (mod main_~r~0 4294967296) 1) (= main_~p~0 0) (= main_~q~0 1))} assume !false; {655#(and (<= (mod main_~r~0 4294967296) 1) (= main_~p~0 0) (= main_~q~0 1))} is VALID [2022-04-27 12:18:24,999 INFO L290 TraceCheckUtils]: 18: Hoare triple {655#(and (<= (mod main_~r~0 4294967296) 1) (= main_~p~0 0) (= main_~q~0 1))} assume !!(~q~0 % 4294967296 <= ~n~0 % 4294967296);~q~0 := 4 * ~q~0; {662#(and (<= (mod main_~r~0 4294967296) 1) (= main_~p~0 0) (= main_~q~0 4))} is VALID [2022-04-27 12:18:25,000 INFO L290 TraceCheckUtils]: 19: Hoare triple {662#(and (<= (mod main_~r~0 4294967296) 1) (= main_~p~0 0) (= main_~q~0 4))} assume !false; {662#(and (<= (mod main_~r~0 4294967296) 1) (= main_~p~0 0) (= main_~q~0 4))} is VALID [2022-04-27 12:18:25,001 INFO L290 TraceCheckUtils]: 20: Hoare triple {662#(and (<= (mod main_~r~0 4294967296) 1) (= main_~p~0 0) (= main_~q~0 4))} assume !(~q~0 % 4294967296 <= ~n~0 % 4294967296); {662#(and (<= (mod main_~r~0 4294967296) 1) (= main_~p~0 0) (= main_~q~0 4))} is VALID [2022-04-27 12:18:25,001 INFO L290 TraceCheckUtils]: 21: Hoare triple {662#(and (<= (mod main_~r~0 4294967296) 1) (= main_~p~0 0) (= main_~q~0 4))} assume !false; {662#(and (<= (mod main_~r~0 4294967296) 1) (= main_~p~0 0) (= main_~q~0 4))} is VALID [2022-04-27 12:18:25,002 INFO L272 TraceCheckUtils]: 22: Hoare triple {662#(and (<= (mod main_~r~0 4294967296) 1) (= main_~p~0 0) (= main_~q~0 4))} call __VERIFIER_assert((if ~r~0 % 4294967296 < (2 * ~p~0 + ~q~0) % 4294967296 then 1 else 0)); {675#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 12:18:25,003 INFO L290 TraceCheckUtils]: 23: Hoare triple {675#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {679#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 12:18:25,003 INFO L290 TraceCheckUtils]: 24: Hoare triple {679#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {583#false} is VALID [2022-04-27 12:18:25,003 INFO L290 TraceCheckUtils]: 25: Hoare triple {583#false} assume !false; {583#false} is VALID [2022-04-27 12:18:25,004 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-27 12:18:25,004 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 12:18:25,570 INFO L290 TraceCheckUtils]: 25: Hoare triple {583#false} assume !false; {583#false} is VALID [2022-04-27 12:18:25,571 INFO L290 TraceCheckUtils]: 24: Hoare triple {679#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {583#false} is VALID [2022-04-27 12:18:25,572 INFO L290 TraceCheckUtils]: 23: Hoare triple {675#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {679#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 12:18:25,572 INFO L272 TraceCheckUtils]: 22: Hoare triple {695#(< (mod main_~r~0 4294967296) (mod (+ (* main_~p~0 2) main_~q~0) 4294967296))} call __VERIFIER_assert((if ~r~0 % 4294967296 < (2 * ~p~0 + ~q~0) % 4294967296 then 1 else 0)); {675#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 12:18:25,573 INFO L290 TraceCheckUtils]: 21: Hoare triple {695#(< (mod main_~r~0 4294967296) (mod (+ (* main_~p~0 2) main_~q~0) 4294967296))} assume !false; {695#(< (mod main_~r~0 4294967296) (mod (+ (* main_~p~0 2) main_~q~0) 4294967296))} is VALID [2022-04-27 12:18:25,574 INFO L290 TraceCheckUtils]: 20: Hoare triple {695#(< (mod main_~r~0 4294967296) (mod (+ (* main_~p~0 2) main_~q~0) 4294967296))} assume !(~q~0 % 4294967296 <= ~n~0 % 4294967296); {695#(< (mod main_~r~0 4294967296) (mod (+ (* main_~p~0 2) main_~q~0) 4294967296))} is VALID [2022-04-27 12:18:25,574 INFO L290 TraceCheckUtils]: 19: Hoare triple {695#(< (mod main_~r~0 4294967296) (mod (+ (* main_~p~0 2) main_~q~0) 4294967296))} assume !false; {695#(< (mod main_~r~0 4294967296) (mod (+ (* main_~p~0 2) main_~q~0) 4294967296))} is VALID [2022-04-27 12:18:25,577 INFO L290 TraceCheckUtils]: 18: Hoare triple {708#(< (mod main_~r~0 4294967296) (mod (+ (* main_~p~0 2) (* main_~q~0 4)) 4294967296))} assume !!(~q~0 % 4294967296 <= ~n~0 % 4294967296);~q~0 := 4 * ~q~0; {695#(< (mod main_~r~0 4294967296) (mod (+ (* main_~p~0 2) main_~q~0) 4294967296))} is VALID [2022-04-27 12:18:25,578 INFO L290 TraceCheckUtils]: 17: Hoare triple {708#(< (mod main_~r~0 4294967296) (mod (+ (* main_~p~0 2) (* main_~q~0 4)) 4294967296))} assume !false; {708#(< (mod main_~r~0 4294967296) (mod (+ (* main_~p~0 2) (* main_~q~0 4)) 4294967296))} is VALID [2022-04-27 12:18:25,578 INFO L290 TraceCheckUtils]: 16: Hoare triple {715#(< (mod main_~n~0 4294967296) 4)} ~p~0 := 0;~q~0 := 1;~r~0 := ~n~0;~h~0 := 0; {708#(< (mod main_~r~0 4294967296) (mod (+ (* main_~p~0 2) (* main_~q~0 4)) 4294967296))} is VALID [2022-04-27 12:18:25,581 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {582#true} {715#(< (mod main_~n~0 4294967296) 4)} #83#return; {715#(< (mod main_~n~0 4294967296) 4)} is VALID [2022-04-27 12:18:25,581 INFO L290 TraceCheckUtils]: 14: Hoare triple {582#true} assume true; {582#true} is VALID [2022-04-27 12:18:25,581 INFO L290 TraceCheckUtils]: 13: Hoare triple {582#true} assume !(0 == ~cond); {582#true} is VALID [2022-04-27 12:18:25,581 INFO L290 TraceCheckUtils]: 12: Hoare triple {582#true} ~cond := #in~cond; {582#true} is VALID [2022-04-27 12:18:25,581 INFO L272 TraceCheckUtils]: 11: Hoare triple {715#(< (mod main_~n~0 4294967296) 4)} call assume_abort_if_not((if ~n~0 % 4294967296 < 1073741823 then 1 else 0)); {582#true} is VALID [2022-04-27 12:18:25,582 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {629#(not (= |assume_abort_if_not_#in~cond| 0))} {582#true} #81#return; {715#(< (mod main_~n~0 4294967296) 4)} is VALID [2022-04-27 12:18:25,583 INFO L290 TraceCheckUtils]: 9: Hoare triple {629#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {629#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-27 12:18:25,585 INFO L290 TraceCheckUtils]: 8: Hoare triple {743#(or (not (= |assume_abort_if_not_#in~cond| 0)) (= assume_abort_if_not_~cond 0))} assume !(0 == ~cond); {629#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-27 12:18:25,586 INFO L290 TraceCheckUtils]: 7: Hoare triple {582#true} ~cond := #in~cond; {743#(or (not (= |assume_abort_if_not_#in~cond| 0)) (= assume_abort_if_not_~cond 0))} is VALID [2022-04-27 12:18:25,586 INFO L272 TraceCheckUtils]: 6: Hoare triple {582#true} call assume_abort_if_not((if ~n~0 % 4294967296 >= 0 && ~n~0 % 4294967296 <= 1 then 1 else 0)); {582#true} is VALID [2022-04-27 12:18:25,586 INFO L290 TraceCheckUtils]: 5: Hoare triple {582#true} havoc ~n~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~h~0;~n~0 := #t~nondet4;havoc #t~nondet4; {582#true} is VALID [2022-04-27 12:18:25,586 INFO L272 TraceCheckUtils]: 4: Hoare triple {582#true} call #t~ret5 := main(); {582#true} is VALID [2022-04-27 12:18:25,587 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {582#true} {582#true} #103#return; {582#true} is VALID [2022-04-27 12:18:25,587 INFO L290 TraceCheckUtils]: 2: Hoare triple {582#true} assume true; {582#true} is VALID [2022-04-27 12:18:25,587 INFO L290 TraceCheckUtils]: 1: Hoare triple {582#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(13, 2);call #Ultimate.allocInit(12, 3); {582#true} is VALID [2022-04-27 12:18:25,587 INFO L272 TraceCheckUtils]: 0: Hoare triple {582#true} call ULTIMATE.init(); {582#true} is VALID [2022-04-27 12:18:25,587 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-27 12:18:25,587 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1412546634] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 12:18:25,588 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-27 12:18:25,588 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9, 9] total 19 [2022-04-27 12:18:25,588 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1379279942] [2022-04-27 12:18:25,588 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-27 12:18:25,589 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 1.8421052631578947) internal successors, (35), 14 states have internal predecessors, (35), 6 states have call successors, (10), 4 states have call predecessors, (10), 2 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 26 [2022-04-27 12:18:25,589 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 12:18:25,590 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 19 states, 19 states have (on average 1.8421052631578947) internal successors, (35), 14 states have internal predecessors, (35), 6 states have call successors, (10), 4 states have call predecessors, (10), 2 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-04-27 12:18:25,653 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 52 edges. 52 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 12:18:25,654 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-04-27 12:18:25,654 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 12:18:25,654 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-04-27 12:18:25,655 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=296, Unknown=0, NotChecked=0, Total=342 [2022-04-27 12:18:25,655 INFO L87 Difference]: Start difference. First operand 48 states and 65 transitions. Second operand has 19 states, 19 states have (on average 1.8421052631578947) internal successors, (35), 14 states have internal predecessors, (35), 6 states have call successors, (10), 4 states have call predecessors, (10), 2 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-04-27 12:18:32,005 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-27 12:18:34,007 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-27 12:18:36,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 12:18:38,042 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-27 12:18:40,983 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-27 12:18:59,084 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-27 12:19:01,099 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-27 12:19:03,101 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-27 12:19:05,136 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-27 12:19:07,295 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 12:19:13,688 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 12:19:15,692 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 12:19:17,734 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 12:19:19,739 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 12:19:28,529 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 12:19:30,663 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 12:19:41,856 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-27 12:19:42,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:19:42,903 INFO L93 Difference]: Finished difference Result 82 states and 116 transitions. [2022-04-27 12:19:42,903 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-04-27 12:19:42,903 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 1.8421052631578947) internal successors, (35), 14 states have internal predecessors, (35), 6 states have call successors, (10), 4 states have call predecessors, (10), 2 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 26 [2022-04-27 12:19:42,904 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 12:19:42,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 19 states have (on average 1.8421052631578947) internal successors, (35), 14 states have internal predecessors, (35), 6 states have call successors, (10), 4 states have call predecessors, (10), 2 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-04-27 12:19:42,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 113 transitions. [2022-04-27 12:19:42,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 19 states have (on average 1.8421052631578947) internal successors, (35), 14 states have internal predecessors, (35), 6 states have call successors, (10), 4 states have call predecessors, (10), 2 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-04-27 12:19:42,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 113 transitions. [2022-04-27 12:19:42,911 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 13 states and 113 transitions. [2022-04-27 12:19:43,361 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 113 edges. 113 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 12:19:43,363 INFO L225 Difference]: With dead ends: 82 [2022-04-27 12:19:43,363 INFO L226 Difference]: Without dead ends: 62 [2022-04-27 12:19:43,364 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 46 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 103 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=121, Invalid=691, Unknown=0, NotChecked=0, Total=812 [2022-04-27 12:19:43,365 INFO L413 NwaCegarLoop]: 34 mSDtfsCounter, 63 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 632 mSolverCounterSat, 131 mSolverCounterUnsat, 17 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 49.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 112 SdHoareTripleChecker+Invalid, 780 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 131 IncrementalHoareTripleChecker+Valid, 632 IncrementalHoareTripleChecker+Invalid, 17 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 50.1s IncrementalHoareTripleChecker+Time [2022-04-27 12:19:43,366 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 112 Invalid, 780 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [131 Valid, 632 Invalid, 17 Unknown, 0 Unchecked, 50.1s Time] [2022-04-27 12:19:43,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2022-04-27 12:19:43,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 60. [2022-04-27 12:19:43,387 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 12:19:43,388 INFO L82 GeneralOperation]: Start isEquivalent. First operand 62 states. Second operand has 60 states, 28 states have (on average 1.1428571428571428) internal successors, (32), 30 states have internal predecessors, (32), 26 states have call successors, (26), 6 states have call predecessors, (26), 5 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2022-04-27 12:19:43,388 INFO L74 IsIncluded]: Start isIncluded. First operand 62 states. Second operand has 60 states, 28 states have (on average 1.1428571428571428) internal successors, (32), 30 states have internal predecessors, (32), 26 states have call successors, (26), 6 states have call predecessors, (26), 5 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2022-04-27 12:19:43,389 INFO L87 Difference]: Start difference. First operand 62 states. Second operand has 60 states, 28 states have (on average 1.1428571428571428) internal successors, (32), 30 states have internal predecessors, (32), 26 states have call successors, (26), 6 states have call predecessors, (26), 5 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2022-04-27 12:19:43,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:19:43,393 INFO L93 Difference]: Finished difference Result 62 states and 83 transitions. [2022-04-27 12:19:43,393 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 83 transitions. [2022-04-27 12:19:43,394 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 12:19:43,394 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 12:19:43,395 INFO L74 IsIncluded]: Start isIncluded. First operand has 60 states, 28 states have (on average 1.1428571428571428) internal successors, (32), 30 states have internal predecessors, (32), 26 states have call successors, (26), 6 states have call predecessors, (26), 5 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) Second operand 62 states. [2022-04-27 12:19:43,395 INFO L87 Difference]: Start difference. First operand has 60 states, 28 states have (on average 1.1428571428571428) internal successors, (32), 30 states have internal predecessors, (32), 26 states have call successors, (26), 6 states have call predecessors, (26), 5 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) Second operand 62 states. [2022-04-27 12:19:43,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:19:43,399 INFO L93 Difference]: Finished difference Result 62 states and 83 transitions. [2022-04-27 12:19:43,399 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 83 transitions. [2022-04-27 12:19:43,400 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 12:19:43,400 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 12:19:43,400 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 12:19:43,400 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 12:19:43,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 28 states have (on average 1.1428571428571428) internal successors, (32), 30 states have internal predecessors, (32), 26 states have call successors, (26), 6 states have call predecessors, (26), 5 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2022-04-27 12:19:43,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 81 transitions. [2022-04-27 12:19:43,404 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 81 transitions. Word has length 26 [2022-04-27 12:19:43,404 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 12:19:43,404 INFO L495 AbstractCegarLoop]: Abstraction has 60 states and 81 transitions. [2022-04-27 12:19:43,404 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 1.8421052631578947) internal successors, (35), 14 states have internal predecessors, (35), 6 states have call successors, (10), 4 states have call predecessors, (10), 2 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-04-27 12:19:43,404 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 81 transitions. [2022-04-27 12:19:43,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-04-27 12:19:43,405 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 12:19:43,405 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 12:19:43,424 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 12:19:43,611 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 12:19:43,612 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 12:19:43,612 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 12:19:43,612 INFO L85 PathProgramCache]: Analyzing trace with hash -2000886032, now seen corresponding path program 1 times [2022-04-27 12:19:43,612 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 12:19:43,613 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [54066138] [2022-04-27 12:19:43,613 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 12:19:43,613 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 12:19:43,635 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 12:19:43,635 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1767482289] [2022-04-27 12:19:43,635 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 12:19:43,636 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 12:19:43,636 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 12:19:43,637 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 12:19:43,639 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-04-27 12:19:43,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:19:43,714 INFO L263 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-27 12:19:43,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:19:43,726 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 12:19:43,952 INFO L272 TraceCheckUtils]: 0: Hoare triple {1133#true} call ULTIMATE.init(); {1133#true} is VALID [2022-04-27 12:19:43,952 INFO L290 TraceCheckUtils]: 1: Hoare triple {1133#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(13, 2);call #Ultimate.allocInit(12, 3); {1133#true} is VALID [2022-04-27 12:19:43,952 INFO L290 TraceCheckUtils]: 2: Hoare triple {1133#true} assume true; {1133#true} is VALID [2022-04-27 12:19:43,952 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1133#true} {1133#true} #103#return; {1133#true} is VALID [2022-04-27 12:19:43,952 INFO L272 TraceCheckUtils]: 4: Hoare triple {1133#true} call #t~ret5 := main(); {1133#true} is VALID [2022-04-27 12:19:43,953 INFO L290 TraceCheckUtils]: 5: Hoare triple {1133#true} havoc ~n~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~h~0;~n~0 := #t~nondet4;havoc #t~nondet4; {1133#true} is VALID [2022-04-27 12:19:43,953 INFO L272 TraceCheckUtils]: 6: Hoare triple {1133#true} call assume_abort_if_not((if ~n~0 % 4294967296 >= 0 && ~n~0 % 4294967296 <= 1 then 1 else 0)); {1133#true} is VALID [2022-04-27 12:19:43,953 INFO L290 TraceCheckUtils]: 7: Hoare triple {1133#true} ~cond := #in~cond; {1133#true} is VALID [2022-04-27 12:19:43,953 INFO L290 TraceCheckUtils]: 8: Hoare triple {1133#true} assume !(0 == ~cond); {1133#true} is VALID [2022-04-27 12:19:43,953 INFO L290 TraceCheckUtils]: 9: Hoare triple {1133#true} assume true; {1133#true} is VALID [2022-04-27 12:19:43,953 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1133#true} {1133#true} #81#return; {1133#true} is VALID [2022-04-27 12:19:43,953 INFO L272 TraceCheckUtils]: 11: Hoare triple {1133#true} call assume_abort_if_not((if ~n~0 % 4294967296 < 1073741823 then 1 else 0)); {1133#true} is VALID [2022-04-27 12:19:43,954 INFO L290 TraceCheckUtils]: 12: Hoare triple {1133#true} ~cond := #in~cond; {1133#true} is VALID [2022-04-27 12:19:43,954 INFO L290 TraceCheckUtils]: 13: Hoare triple {1133#true} assume !(0 == ~cond); {1133#true} is VALID [2022-04-27 12:19:43,954 INFO L290 TraceCheckUtils]: 14: Hoare triple {1133#true} assume true; {1133#true} is VALID [2022-04-27 12:19:43,954 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {1133#true} {1133#true} #83#return; {1133#true} is VALID [2022-04-27 12:19:43,955 INFO L290 TraceCheckUtils]: 16: Hoare triple {1133#true} ~p~0 := 0;~q~0 := 1;~r~0 := ~n~0;~h~0 := 0; {1186#(and (= main_~p~0 0) (= main_~h~0 0) (= main_~q~0 1))} is VALID [2022-04-27 12:19:43,955 INFO L290 TraceCheckUtils]: 17: Hoare triple {1186#(and (= main_~p~0 0) (= main_~h~0 0) (= main_~q~0 1))} assume !false; {1186#(and (= main_~p~0 0) (= main_~h~0 0) (= main_~q~0 1))} is VALID [2022-04-27 12:19:43,956 INFO L290 TraceCheckUtils]: 18: Hoare triple {1186#(and (= main_~p~0 0) (= main_~h~0 0) (= main_~q~0 1))} assume !(~q~0 % 4294967296 <= ~n~0 % 4294967296); {1186#(and (= main_~p~0 0) (= main_~h~0 0) (= main_~q~0 1))} is VALID [2022-04-27 12:19:43,956 INFO L290 TraceCheckUtils]: 19: Hoare triple {1186#(and (= main_~p~0 0) (= main_~h~0 0) (= main_~q~0 1))} assume !false; {1186#(and (= main_~p~0 0) (= main_~h~0 0) (= main_~q~0 1))} is VALID [2022-04-27 12:19:43,956 INFO L272 TraceCheckUtils]: 20: Hoare triple {1186#(and (= main_~p~0 0) (= main_~h~0 0) (= main_~q~0 1))} call __VERIFIER_assert((if ~r~0 % 4294967296 < (2 * ~p~0 + ~q~0) % 4294967296 then 1 else 0)); {1133#true} is VALID [2022-04-27 12:19:43,956 INFO L290 TraceCheckUtils]: 21: Hoare triple {1133#true} ~cond := #in~cond; {1133#true} is VALID [2022-04-27 12:19:43,957 INFO L290 TraceCheckUtils]: 22: Hoare triple {1133#true} assume !(0 == ~cond); {1133#true} is VALID [2022-04-27 12:19:43,957 INFO L290 TraceCheckUtils]: 23: Hoare triple {1133#true} assume true; {1133#true} is VALID [2022-04-27 12:19:43,958 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {1133#true} {1186#(and (= main_~p~0 0) (= main_~h~0 0) (= main_~q~0 1))} #85#return; {1186#(and (= main_~p~0 0) (= main_~h~0 0) (= main_~q~0 1))} is VALID [2022-04-27 12:19:43,958 INFO L272 TraceCheckUtils]: 25: Hoare triple {1186#(and (= main_~p~0 0) (= main_~h~0 0) (= main_~q~0 1))} call __VERIFIER_assert((if (~p~0 * ~p~0 + ~r~0 * ~q~0) % 4294967296 == ~n~0 * ~q~0 % 4294967296 then 1 else 0)); {1133#true} is VALID [2022-04-27 12:19:43,958 INFO L290 TraceCheckUtils]: 26: Hoare triple {1133#true} ~cond := #in~cond; {1133#true} is VALID [2022-04-27 12:19:43,958 INFO L290 TraceCheckUtils]: 27: Hoare triple {1133#true} assume !(0 == ~cond); {1133#true} is VALID [2022-04-27 12:19:43,958 INFO L290 TraceCheckUtils]: 28: Hoare triple {1133#true} assume true; {1133#true} is VALID [2022-04-27 12:19:43,959 INFO L284 TraceCheckUtils]: 29: Hoare quadruple {1133#true} {1186#(and (= main_~p~0 0) (= main_~h~0 0) (= main_~q~0 1))} #87#return; {1186#(and (= main_~p~0 0) (= main_~h~0 0) (= main_~q~0 1))} is VALID [2022-04-27 12:19:43,961 INFO L272 TraceCheckUtils]: 30: Hoare triple {1186#(and (= main_~p~0 0) (= main_~h~0 0) (= main_~q~0 1))} call __VERIFIER_assert((if 0 == (~h~0 * ~h~0 * ~h~0 - 12 * ~h~0 * ~n~0 * ~q~0 + 16 * ~n~0 * ~p~0 * ~q~0 - ~h~0 * ~q~0 * ~q~0 - 4 * ~p~0 * ~q~0 * ~q~0 + 12 * ~h~0 * ~q~0 * ~r~0 - 16 * ~p~0 * ~q~0 * ~r~0) % 4294967296 then 1 else 0)); {1229#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 12:19:43,962 INFO L290 TraceCheckUtils]: 31: Hoare triple {1229#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1233#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 12:19:43,962 INFO L290 TraceCheckUtils]: 32: Hoare triple {1233#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1134#false} is VALID [2022-04-27 12:19:43,962 INFO L290 TraceCheckUtils]: 33: Hoare triple {1134#false} assume !false; {1134#false} is VALID [2022-04-27 12:19:43,963 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-04-27 12:19:43,963 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-27 12:19:43,963 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 12:19:43,963 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [54066138] [2022-04-27 12:19:43,963 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 12:19:43,963 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1767482289] [2022-04-27 12:19:43,963 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1767482289] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 12:19:43,963 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 12:19:43,964 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-27 12:19:43,964 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [88286574] [2022-04-27 12:19:43,964 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 12:19:43,964 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 2 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 12:19:43,965 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 12:19:43,965 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 2 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 12:19:43,994 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 12:19:43,994 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-27 12:19:43,995 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 12:19:43,996 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-27 12:19:43,996 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-27 12:19:43,996 INFO L87 Difference]: Start difference. First operand 60 states and 81 transitions. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 2 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 12:19:52,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:19:52,855 INFO L93 Difference]: Finished difference Result 70 states and 89 transitions. [2022-04-27 12:19:52,855 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-27 12:19:52,856 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 2 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 12:19:52,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 12:19:52,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 2 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 12:19:52,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 66 transitions. [2022-04-27 12:19:52,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 2 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 12:19:52,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 66 transitions. [2022-04-27 12:19:52,864 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 66 transitions. [2022-04-27 12:19:52,932 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 66 edges. 66 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 12:19:52,933 INFO L225 Difference]: With dead ends: 70 [2022-04-27 12:19:52,934 INFO L226 Difference]: Without dead ends: 47 [2022-04-27 12:19:52,934 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-27 12:19:52,937 INFO L413 NwaCegarLoop]: 46 mSDtfsCounter, 6 mSDsluCounter, 98 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 144 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-04-27 12:19:52,938 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 144 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-04-27 12:19:52,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2022-04-27 12:19:52,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2022-04-27 12:19:52,952 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 12:19:52,952 INFO L82 GeneralOperation]: Start isEquivalent. First operand 47 states. Second operand has 47 states, 23 states have (on average 1.1304347826086956) internal successors, (26), 24 states have internal predecessors, (26), 19 states have call successors, (19), 5 states have call predecessors, (19), 4 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2022-04-27 12:19:52,952 INFO L74 IsIncluded]: Start isIncluded. First operand 47 states. Second operand has 47 states, 23 states have (on average 1.1304347826086956) internal successors, (26), 24 states have internal predecessors, (26), 19 states have call successors, (19), 5 states have call predecessors, (19), 4 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2022-04-27 12:19:52,953 INFO L87 Difference]: Start difference. First operand 47 states. Second operand has 47 states, 23 states have (on average 1.1304347826086956) internal successors, (26), 24 states have internal predecessors, (26), 19 states have call successors, (19), 5 states have call predecessors, (19), 4 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2022-04-27 12:19:52,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:19:52,955 INFO L93 Difference]: Finished difference Result 47 states and 62 transitions. [2022-04-27 12:19:52,956 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 62 transitions. [2022-04-27 12:19:52,956 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 12:19:52,956 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 12:19:52,956 INFO L74 IsIncluded]: Start isIncluded. First operand has 47 states, 23 states have (on average 1.1304347826086956) internal successors, (26), 24 states have internal predecessors, (26), 19 states have call successors, (19), 5 states have call predecessors, (19), 4 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) Second operand 47 states. [2022-04-27 12:19:52,957 INFO L87 Difference]: Start difference. First operand has 47 states, 23 states have (on average 1.1304347826086956) internal successors, (26), 24 states have internal predecessors, (26), 19 states have call successors, (19), 5 states have call predecessors, (19), 4 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) Second operand 47 states. [2022-04-27 12:19:52,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:19:52,960 INFO L93 Difference]: Finished difference Result 47 states and 62 transitions. [2022-04-27 12:19:52,960 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 62 transitions. [2022-04-27 12:19:52,960 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 12:19:52,960 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 12:19:52,960 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 12:19:52,960 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 12:19:52,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 23 states have (on average 1.1304347826086956) internal successors, (26), 24 states have internal predecessors, (26), 19 states have call successors, (19), 5 states have call predecessors, (19), 4 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2022-04-27 12:19:52,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 62 transitions. [2022-04-27 12:19:52,963 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 62 transitions. Word has length 34 [2022-04-27 12:19:52,963 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 12:19:52,963 INFO L495 AbstractCegarLoop]: Abstraction has 47 states and 62 transitions. [2022-04-27 12:19:52,964 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 2 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 12:19:52,964 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 62 transitions. [2022-04-27 12:19:52,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-04-27 12:19:52,964 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 12:19:52,965 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 12:19:52,974 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-04-27 12:19:53,169 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2022-04-27 12:19:53,169 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 12:19:53,170 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 12:19:53,170 INFO L85 PathProgramCache]: Analyzing trace with hash -965267381, now seen corresponding path program 1 times [2022-04-27 12:19:53,170 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 12:19:53,170 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1179453069] [2022-04-27 12:19:53,170 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 12:19:53,171 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 12:19:53,193 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 12:19:53,193 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1083676900] [2022-04-27 12:19:53,193 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 12:19:53,194 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 12:19:53,194 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 12:19:53,199 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 12:19:53,200 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-04-27 12:19:53,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:19:53,295 INFO L263 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-27 12:19:53,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:19:53,309 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 12:19:53,535 INFO L272 TraceCheckUtils]: 0: Hoare triple {1514#true} call ULTIMATE.init(); {1514#true} is VALID [2022-04-27 12:19:53,535 INFO L290 TraceCheckUtils]: 1: Hoare triple {1514#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(13, 2);call #Ultimate.allocInit(12, 3); {1514#true} is VALID [2022-04-27 12:19:53,535 INFO L290 TraceCheckUtils]: 2: Hoare triple {1514#true} assume true; {1514#true} is VALID [2022-04-27 12:19:53,535 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1514#true} {1514#true} #103#return; {1514#true} is VALID [2022-04-27 12:19:53,535 INFO L272 TraceCheckUtils]: 4: Hoare triple {1514#true} call #t~ret5 := main(); {1514#true} is VALID [2022-04-27 12:19:53,539 INFO L290 TraceCheckUtils]: 5: Hoare triple {1514#true} havoc ~n~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~h~0;~n~0 := #t~nondet4;havoc #t~nondet4; {1514#true} is VALID [2022-04-27 12:19:53,540 INFO L272 TraceCheckUtils]: 6: Hoare triple {1514#true} call assume_abort_if_not((if ~n~0 % 4294967296 >= 0 && ~n~0 % 4294967296 <= 1 then 1 else 0)); {1514#true} is VALID [2022-04-27 12:19:53,540 INFO L290 TraceCheckUtils]: 7: Hoare triple {1514#true} ~cond := #in~cond; {1514#true} is VALID [2022-04-27 12:19:53,540 INFO L290 TraceCheckUtils]: 8: Hoare triple {1514#true} assume !(0 == ~cond); {1514#true} is VALID [2022-04-27 12:19:53,540 INFO L290 TraceCheckUtils]: 9: Hoare triple {1514#true} assume true; {1514#true} is VALID [2022-04-27 12:19:53,540 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1514#true} {1514#true} #81#return; {1514#true} is VALID [2022-04-27 12:19:53,540 INFO L272 TraceCheckUtils]: 11: Hoare triple {1514#true} call assume_abort_if_not((if ~n~0 % 4294967296 < 1073741823 then 1 else 0)); {1514#true} is VALID [2022-04-27 12:19:53,541 INFO L290 TraceCheckUtils]: 12: Hoare triple {1514#true} ~cond := #in~cond; {1514#true} is VALID [2022-04-27 12:19:53,541 INFO L290 TraceCheckUtils]: 13: Hoare triple {1514#true} assume !(0 == ~cond); {1514#true} is VALID [2022-04-27 12:19:53,541 INFO L290 TraceCheckUtils]: 14: Hoare triple {1514#true} assume true; {1514#true} is VALID [2022-04-27 12:19:53,541 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {1514#true} {1514#true} #83#return; {1514#true} is VALID [2022-04-27 12:19:53,542 INFO L290 TraceCheckUtils]: 16: Hoare triple {1514#true} ~p~0 := 0;~q~0 := 1;~r~0 := ~n~0;~h~0 := 0; {1567#(and (= main_~p~0 0) (= main_~h~0 0))} is VALID [2022-04-27 12:19:53,543 INFO L290 TraceCheckUtils]: 17: Hoare triple {1567#(and (= main_~p~0 0) (= main_~h~0 0))} assume !false; {1567#(and (= main_~p~0 0) (= main_~h~0 0))} is VALID [2022-04-27 12:19:53,543 INFO L290 TraceCheckUtils]: 18: Hoare triple {1567#(and (= main_~p~0 0) (= main_~h~0 0))} assume !!(~q~0 % 4294967296 <= ~n~0 % 4294967296);~q~0 := 4 * ~q~0; {1567#(and (= main_~p~0 0) (= main_~h~0 0))} is VALID [2022-04-27 12:19:53,544 INFO L290 TraceCheckUtils]: 19: Hoare triple {1567#(and (= main_~p~0 0) (= main_~h~0 0))} assume !false; {1567#(and (= main_~p~0 0) (= main_~h~0 0))} is VALID [2022-04-27 12:19:53,544 INFO L290 TraceCheckUtils]: 20: Hoare triple {1567#(and (= main_~p~0 0) (= main_~h~0 0))} assume !(~q~0 % 4294967296 <= ~n~0 % 4294967296); {1567#(and (= main_~p~0 0) (= main_~h~0 0))} is VALID [2022-04-27 12:19:53,545 INFO L290 TraceCheckUtils]: 21: Hoare triple {1567#(and (= main_~p~0 0) (= main_~h~0 0))} assume !false; {1567#(and (= main_~p~0 0) (= main_~h~0 0))} is VALID [2022-04-27 12:19:53,545 INFO L272 TraceCheckUtils]: 22: Hoare triple {1567#(and (= main_~p~0 0) (= main_~h~0 0))} call __VERIFIER_assert((if ~r~0 % 4294967296 < (2 * ~p~0 + ~q~0) % 4294967296 then 1 else 0)); {1514#true} is VALID [2022-04-27 12:19:53,545 INFO L290 TraceCheckUtils]: 23: Hoare triple {1514#true} ~cond := #in~cond; {1514#true} is VALID [2022-04-27 12:19:53,545 INFO L290 TraceCheckUtils]: 24: Hoare triple {1514#true} assume !(0 == ~cond); {1514#true} is VALID [2022-04-27 12:19:53,545 INFO L290 TraceCheckUtils]: 25: Hoare triple {1514#true} assume true; {1514#true} is VALID [2022-04-27 12:19:53,546 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {1514#true} {1567#(and (= main_~p~0 0) (= main_~h~0 0))} #85#return; {1567#(and (= main_~p~0 0) (= main_~h~0 0))} is VALID [2022-04-27 12:19:53,546 INFO L272 TraceCheckUtils]: 27: Hoare triple {1567#(and (= main_~p~0 0) (= main_~h~0 0))} call __VERIFIER_assert((if (~p~0 * ~p~0 + ~r~0 * ~q~0) % 4294967296 == ~n~0 * ~q~0 % 4294967296 then 1 else 0)); {1514#true} is VALID [2022-04-27 12:19:53,546 INFO L290 TraceCheckUtils]: 28: Hoare triple {1514#true} ~cond := #in~cond; {1514#true} is VALID [2022-04-27 12:19:53,546 INFO L290 TraceCheckUtils]: 29: Hoare triple {1514#true} assume !(0 == ~cond); {1514#true} is VALID [2022-04-27 12:19:53,546 INFO L290 TraceCheckUtils]: 30: Hoare triple {1514#true} assume true; {1514#true} is VALID [2022-04-27 12:19:53,547 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {1514#true} {1567#(and (= main_~p~0 0) (= main_~h~0 0))} #87#return; {1567#(and (= main_~p~0 0) (= main_~h~0 0))} is VALID [2022-04-27 12:19:53,548 INFO L272 TraceCheckUtils]: 32: Hoare triple {1567#(and (= main_~p~0 0) (= main_~h~0 0))} call __VERIFIER_assert((if 0 == (~h~0 * ~h~0 * ~h~0 - 12 * ~h~0 * ~n~0 * ~q~0 + 16 * ~n~0 * ~p~0 * ~q~0 - ~h~0 * ~q~0 * ~q~0 - 4 * ~p~0 * ~q~0 * ~q~0 + 12 * ~h~0 * ~q~0 * ~r~0 - 16 * ~p~0 * ~q~0 * ~r~0) % 4294967296 then 1 else 0)); {1616#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 12:19:53,549 INFO L290 TraceCheckUtils]: 33: Hoare triple {1616#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1620#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 12:19:53,549 INFO L290 TraceCheckUtils]: 34: Hoare triple {1620#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1515#false} is VALID [2022-04-27 12:19:53,549 INFO L290 TraceCheckUtils]: 35: Hoare triple {1515#false} assume !false; {1515#false} is VALID [2022-04-27 12:19:53,550 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-04-27 12:19:53,550 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-27 12:19:53,551 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 12:19:53,551 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1179453069] [2022-04-27 12:19:53,551 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 12:19:53,551 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1083676900] [2022-04-27 12:19:53,551 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1083676900] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 12:19:53,551 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 12:19:53,551 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-27 12:19:53,551 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [933412504] [2022-04-27 12:19:53,552 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 12:19:53,552 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 36 [2022-04-27 12:19:53,554 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 12:19:53,554 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 2 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 12:19:53,587 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 29 edges. 29 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 12:19:53,587 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-27 12:19:53,587 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 12:19:53,587 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-27 12:19:53,587 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-27 12:19:53,588 INFO L87 Difference]: Start difference. First operand 47 states and 62 transitions. Second operand has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 2 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 12:20:00,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:20:00,435 INFO L93 Difference]: Finished difference Result 57 states and 70 transitions. [2022-04-27 12:20:00,436 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-27 12:20:00,436 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 36 [2022-04-27 12:20:00,436 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 12:20:00,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 2 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 12:20:00,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 63 transitions. [2022-04-27 12:20:00,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 2 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 12:20:00,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 63 transitions. [2022-04-27 12:20:00,440 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 63 transitions. [2022-04-27 12:20:00,516 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 63 edges. 63 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 12:20:00,517 INFO L225 Difference]: With dead ends: 57 [2022-04-27 12:20:00,518 INFO L226 Difference]: Without dead ends: 55 [2022-04-27 12:20:00,518 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-27 12:20:00,519 INFO L413 NwaCegarLoop]: 48 mSDtfsCounter, 5 mSDsluCounter, 103 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 151 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-04-27 12:20:00,519 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 151 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-04-27 12:20:00,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2022-04-27 12:20:00,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2022-04-27 12:20:00,531 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 12:20:00,532 INFO L82 GeneralOperation]: Start isEquivalent. First operand 55 states. Second operand has 55 states, 29 states have (on average 1.103448275862069) internal successors, (32), 30 states have internal predecessors, (32), 19 states have call successors, (19), 7 states have call predecessors, (19), 6 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2022-04-27 12:20:00,532 INFO L74 IsIncluded]: Start isIncluded. First operand 55 states. Second operand has 55 states, 29 states have (on average 1.103448275862069) internal successors, (32), 30 states have internal predecessors, (32), 19 states have call successors, (19), 7 states have call predecessors, (19), 6 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2022-04-27 12:20:00,532 INFO L87 Difference]: Start difference. First operand 55 states. Second operand has 55 states, 29 states have (on average 1.103448275862069) internal successors, (32), 30 states have internal predecessors, (32), 19 states have call successors, (19), 7 states have call predecessors, (19), 6 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2022-04-27 12:20:00,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:20:00,535 INFO L93 Difference]: Finished difference Result 55 states and 68 transitions. [2022-04-27 12:20:00,535 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 68 transitions. [2022-04-27 12:20:00,535 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 12:20:00,536 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 12:20:00,536 INFO L74 IsIncluded]: Start isIncluded. First operand has 55 states, 29 states have (on average 1.103448275862069) internal successors, (32), 30 states have internal predecessors, (32), 19 states have call successors, (19), 7 states have call predecessors, (19), 6 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) Second operand 55 states. [2022-04-27 12:20:00,536 INFO L87 Difference]: Start difference. First operand has 55 states, 29 states have (on average 1.103448275862069) internal successors, (32), 30 states have internal predecessors, (32), 19 states have call successors, (19), 7 states have call predecessors, (19), 6 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) Second operand 55 states. [2022-04-27 12:20:00,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:20:00,539 INFO L93 Difference]: Finished difference Result 55 states and 68 transitions. [2022-04-27 12:20:00,539 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 68 transitions. [2022-04-27 12:20:00,539 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 12:20:00,539 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 12:20:00,540 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 12:20:00,540 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 12:20:00,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 29 states have (on average 1.103448275862069) internal successors, (32), 30 states have internal predecessors, (32), 19 states have call successors, (19), 7 states have call predecessors, (19), 6 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2022-04-27 12:20:00,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 68 transitions. [2022-04-27 12:20:00,542 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 68 transitions. Word has length 36 [2022-04-27 12:20:00,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 12:20:00,543 INFO L495 AbstractCegarLoop]: Abstraction has 55 states and 68 transitions. [2022-04-27 12:20:00,543 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 2 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 12:20:00,543 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 68 transitions. [2022-04-27 12:20:00,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-04-27 12:20:00,544 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 12:20:00,544 INFO L195 NwaCegarLoop]: trace histogram [7, 6, 6, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 12:20:00,551 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-04-27 12:20:00,749 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 12:20:00,749 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 12:20:00,750 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 12:20:00,750 INFO L85 PathProgramCache]: Analyzing trace with hash 1670386034, now seen corresponding path program 1 times [2022-04-27 12:20:00,750 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 12:20:00,750 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [424847703] [2022-04-27 12:20:00,750 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 12:20:00,750 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 12:20:00,772 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 12:20:00,772 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [833284624] [2022-04-27 12:20:00,772 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 12:20:00,772 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 12:20:00,772 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 12:20:00,778 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 12:20:00,804 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-04-27 12:20:00,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:20:00,956 INFO L263 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 29 conjunts are in the unsatisfiable core [2022-04-27 12:20:00,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 12:20:00,973 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 12:20:03,273 INFO L272 TraceCheckUtils]: 0: Hoare triple {1906#true} call ULTIMATE.init(); {1906#true} is VALID [2022-04-27 12:20:03,274 INFO L290 TraceCheckUtils]: 1: Hoare triple {1906#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(13, 2);call #Ultimate.allocInit(12, 3); {1906#true} is VALID [2022-04-27 12:20:03,274 INFO L290 TraceCheckUtils]: 2: Hoare triple {1906#true} assume true; {1906#true} is VALID [2022-04-27 12:20:03,274 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1906#true} {1906#true} #103#return; {1906#true} is VALID [2022-04-27 12:20:03,274 INFO L272 TraceCheckUtils]: 4: Hoare triple {1906#true} call #t~ret5 := main(); {1906#true} is VALID [2022-04-27 12:20:03,274 INFO L290 TraceCheckUtils]: 5: Hoare triple {1906#true} havoc ~n~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~h~0;~n~0 := #t~nondet4;havoc #t~nondet4; {1906#true} is VALID [2022-04-27 12:20:03,274 INFO L272 TraceCheckUtils]: 6: Hoare triple {1906#true} call assume_abort_if_not((if ~n~0 % 4294967296 >= 0 && ~n~0 % 4294967296 <= 1 then 1 else 0)); {1906#true} is VALID [2022-04-27 12:20:03,278 INFO L290 TraceCheckUtils]: 7: Hoare triple {1906#true} ~cond := #in~cond; {1932#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-27 12:20:03,278 INFO L290 TraceCheckUtils]: 8: Hoare triple {1932#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {1936#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-27 12:20:03,279 INFO L290 TraceCheckUtils]: 9: Hoare triple {1936#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {1936#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-27 12:20:03,279 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1936#(not (= |assume_abort_if_not_#in~cond| 0))} {1906#true} #81#return; {1943#(<= (mod main_~n~0 4294967296) 1)} is VALID [2022-04-27 12:20:03,279 INFO L272 TraceCheckUtils]: 11: Hoare triple {1943#(<= (mod main_~n~0 4294967296) 1)} call assume_abort_if_not((if ~n~0 % 4294967296 < 1073741823 then 1 else 0)); {1906#true} is VALID [2022-04-27 12:20:03,279 INFO L290 TraceCheckUtils]: 12: Hoare triple {1906#true} ~cond := #in~cond; {1906#true} is VALID [2022-04-27 12:20:03,279 INFO L290 TraceCheckUtils]: 13: Hoare triple {1906#true} assume !(0 == ~cond); {1906#true} is VALID [2022-04-27 12:20:03,280 INFO L290 TraceCheckUtils]: 14: Hoare triple {1906#true} assume true; {1906#true} is VALID [2022-04-27 12:20:03,285 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {1906#true} {1943#(<= (mod main_~n~0 4294967296) 1)} #83#return; {1943#(<= (mod main_~n~0 4294967296) 1)} is VALID [2022-04-27 12:20:03,285 INFO L290 TraceCheckUtils]: 16: Hoare triple {1943#(<= (mod main_~n~0 4294967296) 1)} ~p~0 := 0;~q~0 := 1;~r~0 := ~n~0;~h~0 := 0; {1962#(and (<= (mod main_~n~0 4294967296) 1) (= main_~p~0 0) (= main_~n~0 main_~r~0) (= main_~q~0 1))} is VALID [2022-04-27 12:20:03,286 INFO L290 TraceCheckUtils]: 17: Hoare triple {1962#(and (<= (mod main_~n~0 4294967296) 1) (= main_~p~0 0) (= main_~n~0 main_~r~0) (= main_~q~0 1))} assume !false; {1962#(and (<= (mod main_~n~0 4294967296) 1) (= main_~p~0 0) (= main_~n~0 main_~r~0) (= main_~q~0 1))} is VALID [2022-04-27 12:20:03,287 INFO L290 TraceCheckUtils]: 18: Hoare triple {1962#(and (<= (mod main_~n~0 4294967296) 1) (= main_~p~0 0) (= main_~n~0 main_~r~0) (= main_~q~0 1))} assume !!(~q~0 % 4294967296 <= ~n~0 % 4294967296);~q~0 := 4 * ~q~0; {1969#(and (<= (mod main_~n~0 4294967296) 1) (= main_~p~0 0) (= main_~n~0 main_~r~0) (= main_~q~0 4) (<= 1 (mod main_~n~0 4294967296)))} is VALID [2022-04-27 12:20:03,287 INFO L290 TraceCheckUtils]: 19: Hoare triple {1969#(and (<= (mod main_~n~0 4294967296) 1) (= main_~p~0 0) (= main_~n~0 main_~r~0) (= main_~q~0 4) (<= 1 (mod main_~n~0 4294967296)))} assume !false; {1969#(and (<= (mod main_~n~0 4294967296) 1) (= main_~p~0 0) (= main_~n~0 main_~r~0) (= main_~q~0 4) (<= 1 (mod main_~n~0 4294967296)))} is VALID [2022-04-27 12:20:03,288 INFO L290 TraceCheckUtils]: 20: Hoare triple {1969#(and (<= (mod main_~n~0 4294967296) 1) (= main_~p~0 0) (= main_~n~0 main_~r~0) (= main_~q~0 4) (<= 1 (mod main_~n~0 4294967296)))} assume !(~q~0 % 4294967296 <= ~n~0 % 4294967296); {1976#(and (<= (mod main_~r~0 4294967296) 1) (= main_~p~0 0) (<= 1 (mod main_~r~0 4294967296)) (= main_~q~0 4))} is VALID [2022-04-27 12:20:03,288 INFO L290 TraceCheckUtils]: 21: Hoare triple {1976#(and (<= (mod main_~r~0 4294967296) 1) (= main_~p~0 0) (<= 1 (mod main_~r~0 4294967296)) (= main_~q~0 4))} assume !false; {1976#(and (<= (mod main_~r~0 4294967296) 1) (= main_~p~0 0) (<= 1 (mod main_~r~0 4294967296)) (= main_~q~0 4))} is VALID [2022-04-27 12:20:03,288 INFO L272 TraceCheckUtils]: 22: Hoare triple {1976#(and (<= (mod main_~r~0 4294967296) 1) (= main_~p~0 0) (<= 1 (mod main_~r~0 4294967296)) (= main_~q~0 4))} call __VERIFIER_assert((if ~r~0 % 4294967296 < (2 * ~p~0 + ~q~0) % 4294967296 then 1 else 0)); {1906#true} is VALID [2022-04-27 12:20:03,288 INFO L290 TraceCheckUtils]: 23: Hoare triple {1906#true} ~cond := #in~cond; {1906#true} is VALID [2022-04-27 12:20:03,288 INFO L290 TraceCheckUtils]: 24: Hoare triple {1906#true} assume !(0 == ~cond); {1906#true} is VALID [2022-04-27 12:20:03,289 INFO L290 TraceCheckUtils]: 25: Hoare triple {1906#true} assume true; {1906#true} is VALID [2022-04-27 12:20:03,289 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {1906#true} {1976#(and (<= (mod main_~r~0 4294967296) 1) (= main_~p~0 0) (<= 1 (mod main_~r~0 4294967296)) (= main_~q~0 4))} #85#return; {1976#(and (<= (mod main_~r~0 4294967296) 1) (= main_~p~0 0) (<= 1 (mod main_~r~0 4294967296)) (= main_~q~0 4))} is VALID [2022-04-27 12:20:03,289 INFO L272 TraceCheckUtils]: 27: Hoare triple {1976#(and (<= (mod main_~r~0 4294967296) 1) (= main_~p~0 0) (<= 1 (mod main_~r~0 4294967296)) (= main_~q~0 4))} call __VERIFIER_assert((if (~p~0 * ~p~0 + ~r~0 * ~q~0) % 4294967296 == ~n~0 * ~q~0 % 4294967296 then 1 else 0)); {1906#true} is VALID [2022-04-27 12:20:03,289 INFO L290 TraceCheckUtils]: 28: Hoare triple {1906#true} ~cond := #in~cond; {1906#true} is VALID [2022-04-27 12:20:03,290 INFO L290 TraceCheckUtils]: 29: Hoare triple {1906#true} assume !(0 == ~cond); {1906#true} is VALID [2022-04-27 12:20:03,290 INFO L290 TraceCheckUtils]: 30: Hoare triple {1906#true} assume true; {1906#true} is VALID [2022-04-27 12:20:03,290 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {1906#true} {1976#(and (<= (mod main_~r~0 4294967296) 1) (= main_~p~0 0) (<= 1 (mod main_~r~0 4294967296)) (= main_~q~0 4))} #87#return; {1976#(and (<= (mod main_~r~0 4294967296) 1) (= main_~p~0 0) (<= 1 (mod main_~r~0 4294967296)) (= main_~q~0 4))} is VALID [2022-04-27 12:20:03,290 INFO L272 TraceCheckUtils]: 32: Hoare triple {1976#(and (<= (mod main_~r~0 4294967296) 1) (= main_~p~0 0) (<= 1 (mod main_~r~0 4294967296)) (= main_~q~0 4))} call __VERIFIER_assert((if 0 == (~h~0 * ~h~0 * ~h~0 - 12 * ~h~0 * ~n~0 * ~q~0 + 16 * ~n~0 * ~p~0 * ~q~0 - ~h~0 * ~q~0 * ~q~0 - 4 * ~p~0 * ~q~0 * ~q~0 + 12 * ~h~0 * ~q~0 * ~r~0 - 16 * ~p~0 * ~q~0 * ~r~0) % 4294967296 then 1 else 0)); {1906#true} is VALID [2022-04-27 12:20:03,291 INFO L290 TraceCheckUtils]: 33: Hoare triple {1906#true} ~cond := #in~cond; {1906#true} is VALID [2022-04-27 12:20:03,291 INFO L290 TraceCheckUtils]: 34: Hoare triple {1906#true} assume !(0 == ~cond); {1906#true} is VALID [2022-04-27 12:20:03,291 INFO L290 TraceCheckUtils]: 35: Hoare triple {1906#true} assume true; {1906#true} is VALID [2022-04-27 12:20:03,291 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {1906#true} {1976#(and (<= (mod main_~r~0 4294967296) 1) (= main_~p~0 0) (<= 1 (mod main_~r~0 4294967296)) (= main_~q~0 4))} #89#return; {1976#(and (<= (mod main_~r~0 4294967296) 1) (= main_~p~0 0) (<= 1 (mod main_~r~0 4294967296)) (= main_~q~0 4))} is VALID [2022-04-27 12:20:03,292 INFO L272 TraceCheckUtils]: 37: Hoare triple {1976#(and (<= (mod main_~r~0 4294967296) 1) (= main_~p~0 0) (<= 1 (mod main_~r~0 4294967296)) (= main_~q~0 4))} call __VERIFIER_assert((if 0 == (~h~0 * ~h~0 * ~n~0 - 4 * ~h~0 * ~n~0 * ~p~0 + 4 * (~n~0 * ~n~0) * ~q~0 - ~n~0 * ~q~0 * ~q~0 - ~h~0 * ~h~0 * ~r~0 + 4 * ~h~0 * ~p~0 * ~r~0 - 8 * ~n~0 * ~q~0 * ~r~0 + ~q~0 * ~q~0 * ~r~0 + 4 * ~q~0 * ~r~0 * ~r~0) % 4294967296 then 1 else 0)); {1906#true} is VALID [2022-04-27 12:20:03,292 INFO L290 TraceCheckUtils]: 38: Hoare triple {1906#true} ~cond := #in~cond; {1906#true} is VALID [2022-04-27 12:20:03,292 INFO L290 TraceCheckUtils]: 39: Hoare triple {1906#true} assume !(0 == ~cond); {1906#true} is VALID [2022-04-27 12:20:03,292 INFO L290 TraceCheckUtils]: 40: Hoare triple {1906#true} assume true; {1906#true} is VALID [2022-04-27 12:20:03,292 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {1906#true} {1976#(and (<= (mod main_~r~0 4294967296) 1) (= main_~p~0 0) (<= 1 (mod main_~r~0 4294967296)) (= main_~q~0 4))} #91#return; {1976#(and (<= (mod main_~r~0 4294967296) 1) (= main_~p~0 0) (<= 1 (mod main_~r~0 4294967296)) (= main_~q~0 4))} is VALID [2022-04-27 12:20:03,293 INFO L272 TraceCheckUtils]: 42: Hoare triple {1976#(and (<= (mod main_~r~0 4294967296) 1) (= main_~p~0 0) (<= 1 (mod main_~r~0 4294967296)) (= main_~q~0 4))} call __VERIFIER_assert((if 0 == (~h~0 * ~h~0 * ~p~0 - 4 * ~h~0 * ~n~0 * ~q~0 + 4 * ~n~0 * ~p~0 * ~q~0 - ~p~0 * ~q~0 * ~q~0 + 4 * ~h~0 * ~q~0 * ~r~0 - 4 * ~p~0 * ~q~0 * ~r~0) % 4294967296 then 1 else 0)); {1906#true} is VALID [2022-04-27 12:20:03,293 INFO L290 TraceCheckUtils]: 43: Hoare triple {1906#true} ~cond := #in~cond; {1906#true} is VALID [2022-04-27 12:20:03,293 INFO L290 TraceCheckUtils]: 44: Hoare triple {1906#true} assume !(0 == ~cond); {1906#true} is VALID [2022-04-27 12:20:03,293 INFO L290 TraceCheckUtils]: 45: Hoare triple {1906#true} assume true; {1906#true} is VALID [2022-04-27 12:20:03,293 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {1906#true} {1976#(and (<= (mod main_~r~0 4294967296) 1) (= main_~p~0 0) (<= 1 (mod main_~r~0 4294967296)) (= main_~q~0 4))} #93#return; {1976#(and (<= (mod main_~r~0 4294967296) 1) (= main_~p~0 0) (<= 1 (mod main_~r~0 4294967296)) (= main_~q~0 4))} is VALID [2022-04-27 12:20:03,294 INFO L272 TraceCheckUtils]: 47: Hoare triple {1976#(and (<= (mod main_~r~0 4294967296) 1) (= main_~p~0 0) (<= 1 (mod main_~r~0 4294967296)) (= main_~q~0 4))} call __VERIFIER_assert((if 0 == (~p~0 * ~p~0 - ~n~0 * ~q~0 + ~q~0 * ~r~0) % 4294967296 then 1 else 0)); {1906#true} is VALID [2022-04-27 12:20:03,294 INFO L290 TraceCheckUtils]: 48: Hoare triple {1906#true} ~cond := #in~cond; {1906#true} is VALID [2022-04-27 12:20:03,294 INFO L290 TraceCheckUtils]: 49: Hoare triple {1906#true} assume !(0 == ~cond); {1906#true} is VALID [2022-04-27 12:20:03,294 INFO L290 TraceCheckUtils]: 50: Hoare triple {1906#true} assume true; {1906#true} is VALID [2022-04-27 12:20:03,295 INFO L284 TraceCheckUtils]: 51: Hoare quadruple {1906#true} {1976#(and (<= (mod main_~r~0 4294967296) 1) (= main_~p~0 0) (<= 1 (mod main_~r~0 4294967296)) (= main_~q~0 4))} #95#return; {1976#(and (<= (mod main_~r~0 4294967296) 1) (= main_~p~0 0) (<= 1 (mod main_~r~0 4294967296)) (= main_~q~0 4))} is VALID [2022-04-27 12:20:03,295 INFO L290 TraceCheckUtils]: 52: Hoare triple {1976#(and (<= (mod main_~r~0 4294967296) 1) (= main_~p~0 0) (<= 1 (mod main_~r~0 4294967296)) (= main_~q~0 4))} assume !!(1 != ~q~0 % 4294967296);~q~0 := (if ~q~0 % 4294967296 < 0 && 0 != ~q~0 % 4294967296 % 4 then 1 + ~q~0 % 4294967296 / 4 else ~q~0 % 4294967296 / 4);~h~0 := ~p~0 + ~q~0;~p~0 := (if ~p~0 % 4294967296 < 0 && 0 != ~p~0 % 4294967296 % 2 then 1 + ~p~0 % 4294967296 / 2 else ~p~0 % 4294967296 / 2); {2073#(and (= main_~h~0 main_~q~0) (<= (mod main_~r~0 4294967296) 1) (= main_~p~0 0) (<= 1 (mod main_~r~0 4294967296)) (= main_~q~0 1))} is VALID [2022-04-27 12:20:03,297 INFO L290 TraceCheckUtils]: 53: Hoare triple {2073#(and (= main_~h~0 main_~q~0) (<= (mod main_~r~0 4294967296) 1) (= main_~p~0 0) (<= 1 (mod main_~r~0 4294967296)) (= main_~q~0 1))} assume ~r~0 % 4294967296 >= ~h~0 % 4294967296;~p~0 := ~p~0 + ~q~0;~r~0 := ~r~0 - ~h~0; {2077#(and (= main_~q~0 main_~p~0) (<= 1 (mod (+ main_~q~0 main_~r~0) 4294967296)) (<= (mod (+ main_~q~0 main_~r~0) 4294967296) 1) (= main_~q~0 1))} is VALID [2022-04-27 12:20:03,297 INFO L290 TraceCheckUtils]: 54: Hoare triple {2077#(and (= main_~q~0 main_~p~0) (<= 1 (mod (+ main_~q~0 main_~r~0) 4294967296)) (<= (mod (+ main_~q~0 main_~r~0) 4294967296) 1) (= main_~q~0 1))} assume !false; {2077#(and (= main_~q~0 main_~p~0) (<= 1 (mod (+ main_~q~0 main_~r~0) 4294967296)) (<= (mod (+ main_~q~0 main_~r~0) 4294967296) 1) (= main_~q~0 1))} is VALID [2022-04-27 12:20:03,299 INFO L272 TraceCheckUtils]: 55: Hoare triple {2077#(and (= main_~q~0 main_~p~0) (<= 1 (mod (+ main_~q~0 main_~r~0) 4294967296)) (<= (mod (+ main_~q~0 main_~r~0) 4294967296) 1) (= main_~q~0 1))} call __VERIFIER_assert((if ~r~0 % 4294967296 < (2 * ~p~0 + ~q~0) % 4294967296 then 1 else 0)); {2084#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 12:20:03,299 INFO L290 TraceCheckUtils]: 56: Hoare triple {2084#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {2088#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 12:20:03,300 INFO L290 TraceCheckUtils]: 57: Hoare triple {2088#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1907#false} is VALID [2022-04-27 12:20:03,300 INFO L290 TraceCheckUtils]: 58: Hoare triple {1907#false} assume !false; {1907#false} is VALID [2022-04-27 12:20:03,300 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 12 proven. 7 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2022-04-27 12:20:03,300 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 12:20:07,709 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (mod c_main_~q~0 4294967296))) (or (let ((.cse0 (div .cse1 4))) (< (mod (+ (* 4294967295 .cse0) c_main_~r~0 (* 4294967295 c_main_~p~0)) 4294967296) (mod (+ (* 3 .cse0) (* 2 (div (mod c_main_~p~0 4294967296) 2))) 4294967296))) (= .cse1 1))) is different from false [2022-04-27 12:21:18,234 WARN L855 $PredicateComparison]: unable to prove that (let ((.cse1 (mod (* c_main_~q~0 4) 4294967296)) (.cse2 (mod c_main_~n~0 4294967296))) (or (let ((.cse0 (div .cse1 4))) (< (mod (+ (* 4294967295 .cse0) c_main_~r~0 (* 4294967295 c_main_~p~0)) 4294967296) (mod (+ (* 2 (div (mod c_main_~p~0 4294967296) 2)) (* 3 .cse0)) 4294967296))) (<= .cse1 .cse2) (< .cse2 (mod c_main_~q~0 4294967296)))) is different from true [2022-04-27 12:21:31,378 INFO L290 TraceCheckUtils]: 58: Hoare triple {1907#false} assume !false; {1907#false} is VALID [2022-04-27 12:21:31,379 INFO L290 TraceCheckUtils]: 57: Hoare triple {2088#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1907#false} is VALID [2022-04-27 12:21:31,379 INFO L290 TraceCheckUtils]: 56: Hoare triple {2084#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {2088#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 12:21:31,380 INFO L272 TraceCheckUtils]: 55: Hoare triple {2104#(< (mod main_~r~0 4294967296) (mod (+ (* main_~p~0 2) main_~q~0) 4294967296))} call __VERIFIER_assert((if ~r~0 % 4294967296 < (2 * ~p~0 + ~q~0) % 4294967296 then 1 else 0)); {2084#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 12:21:31,380 INFO L290 TraceCheckUtils]: 54: Hoare triple {2104#(< (mod main_~r~0 4294967296) (mod (+ (* main_~p~0 2) main_~q~0) 4294967296))} assume !false; {2104#(< (mod main_~r~0 4294967296) (mod (+ (* main_~p~0 2) main_~q~0) 4294967296))} is VALID [2022-04-27 12:21:31,382 INFO L290 TraceCheckUtils]: 53: Hoare triple {2111#(< (mod (+ (* main_~h~0 4294967295) main_~r~0) 4294967296) (mod (+ (* main_~p~0 2) (* main_~q~0 3)) 4294967296))} assume ~r~0 % 4294967296 >= ~h~0 % 4294967296;~p~0 := ~p~0 + ~q~0;~r~0 := ~r~0 - ~h~0; {2104#(< (mod main_~r~0 4294967296) (mod (+ (* main_~p~0 2) main_~q~0) 4294967296))} is VALID [2022-04-27 12:21:33,531 WARN L290 TraceCheckUtils]: 52: Hoare triple {2115#(or (= (mod main_~q~0 4294967296) 1) (< (mod (+ (* main_~p~0 4294967295) main_~r~0 (* (div (mod main_~q~0 4294967296) 4) 4294967295)) 4294967296) (mod (+ (* (div (mod main_~p~0 4294967296) 2) 2) (* (div (mod main_~q~0 4294967296) 4) 3)) 4294967296)))} assume !!(1 != ~q~0 % 4294967296);~q~0 := (if ~q~0 % 4294967296 < 0 && 0 != ~q~0 % 4294967296 % 4 then 1 + ~q~0 % 4294967296 / 4 else ~q~0 % 4294967296 / 4);~h~0 := ~p~0 + ~q~0;~p~0 := (if ~p~0 % 4294967296 < 0 && 0 != ~p~0 % 4294967296 % 2 then 1 + ~p~0 % 4294967296 / 2 else ~p~0 % 4294967296 / 2); {2111#(< (mod (+ (* main_~h~0 4294967295) main_~r~0) 4294967296) (mod (+ (* main_~p~0 2) (* main_~q~0 3)) 4294967296))} is UNKNOWN [2022-04-27 12:21:33,532 INFO L284 TraceCheckUtils]: 51: Hoare quadruple {1906#true} {2115#(or (= (mod main_~q~0 4294967296) 1) (< (mod (+ (* main_~p~0 4294967295) main_~r~0 (* (div (mod main_~q~0 4294967296) 4) 4294967295)) 4294967296) (mod (+ (* (div (mod main_~p~0 4294967296) 2) 2) (* (div (mod main_~q~0 4294967296) 4) 3)) 4294967296)))} #95#return; {2115#(or (= (mod main_~q~0 4294967296) 1) (< (mod (+ (* main_~p~0 4294967295) main_~r~0 (* (div (mod main_~q~0 4294967296) 4) 4294967295)) 4294967296) (mod (+ (* (div (mod main_~p~0 4294967296) 2) 2) (* (div (mod main_~q~0 4294967296) 4) 3)) 4294967296)))} is VALID [2022-04-27 12:21:33,532 INFO L290 TraceCheckUtils]: 50: Hoare triple {1906#true} assume true; {1906#true} is VALID [2022-04-27 12:21:33,532 INFO L290 TraceCheckUtils]: 49: Hoare triple {1906#true} assume !(0 == ~cond); {1906#true} is VALID [2022-04-27 12:21:33,533 INFO L290 TraceCheckUtils]: 48: Hoare triple {1906#true} ~cond := #in~cond; {1906#true} is VALID [2022-04-27 12:21:33,533 INFO L272 TraceCheckUtils]: 47: Hoare triple {2115#(or (= (mod main_~q~0 4294967296) 1) (< (mod (+ (* main_~p~0 4294967295) main_~r~0 (* (div (mod main_~q~0 4294967296) 4) 4294967295)) 4294967296) (mod (+ (* (div (mod main_~p~0 4294967296) 2) 2) (* (div (mod main_~q~0 4294967296) 4) 3)) 4294967296)))} call __VERIFIER_assert((if 0 == (~p~0 * ~p~0 - ~n~0 * ~q~0 + ~q~0 * ~r~0) % 4294967296 then 1 else 0)); {1906#true} is VALID [2022-04-27 12:21:33,533 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {1906#true} {2115#(or (= (mod main_~q~0 4294967296) 1) (< (mod (+ (* main_~p~0 4294967295) main_~r~0 (* (div (mod main_~q~0 4294967296) 4) 4294967295)) 4294967296) (mod (+ (* (div (mod main_~p~0 4294967296) 2) 2) (* (div (mod main_~q~0 4294967296) 4) 3)) 4294967296)))} #93#return; {2115#(or (= (mod main_~q~0 4294967296) 1) (< (mod (+ (* main_~p~0 4294967295) main_~r~0 (* (div (mod main_~q~0 4294967296) 4) 4294967295)) 4294967296) (mod (+ (* (div (mod main_~p~0 4294967296) 2) 2) (* (div (mod main_~q~0 4294967296) 4) 3)) 4294967296)))} is VALID [2022-04-27 12:21:33,534 INFO L290 TraceCheckUtils]: 45: Hoare triple {1906#true} assume true; {1906#true} is VALID [2022-04-27 12:21:33,534 INFO L290 TraceCheckUtils]: 44: Hoare triple {1906#true} assume !(0 == ~cond); {1906#true} is VALID [2022-04-27 12:21:33,534 INFO L290 TraceCheckUtils]: 43: Hoare triple {1906#true} ~cond := #in~cond; {1906#true} is VALID [2022-04-27 12:21:33,534 INFO L272 TraceCheckUtils]: 42: Hoare triple {2115#(or (= (mod main_~q~0 4294967296) 1) (< (mod (+ (* main_~p~0 4294967295) main_~r~0 (* (div (mod main_~q~0 4294967296) 4) 4294967295)) 4294967296) (mod (+ (* (div (mod main_~p~0 4294967296) 2) 2) (* (div (mod main_~q~0 4294967296) 4) 3)) 4294967296)))} call __VERIFIER_assert((if 0 == (~h~0 * ~h~0 * ~p~0 - 4 * ~h~0 * ~n~0 * ~q~0 + 4 * ~n~0 * ~p~0 * ~q~0 - ~p~0 * ~q~0 * ~q~0 + 4 * ~h~0 * ~q~0 * ~r~0 - 4 * ~p~0 * ~q~0 * ~r~0) % 4294967296 then 1 else 0)); {1906#true} is VALID [2022-04-27 12:21:33,535 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {1906#true} {2115#(or (= (mod main_~q~0 4294967296) 1) (< (mod (+ (* main_~p~0 4294967295) main_~r~0 (* (div (mod main_~q~0 4294967296) 4) 4294967295)) 4294967296) (mod (+ (* (div (mod main_~p~0 4294967296) 2) 2) (* (div (mod main_~q~0 4294967296) 4) 3)) 4294967296)))} #91#return; {2115#(or (= (mod main_~q~0 4294967296) 1) (< (mod (+ (* main_~p~0 4294967295) main_~r~0 (* (div (mod main_~q~0 4294967296) 4) 4294967295)) 4294967296) (mod (+ (* (div (mod main_~p~0 4294967296) 2) 2) (* (div (mod main_~q~0 4294967296) 4) 3)) 4294967296)))} is VALID [2022-04-27 12:21:33,535 INFO L290 TraceCheckUtils]: 40: Hoare triple {1906#true} assume true; {1906#true} is VALID [2022-04-27 12:21:33,535 INFO L290 TraceCheckUtils]: 39: Hoare triple {1906#true} assume !(0 == ~cond); {1906#true} is VALID [2022-04-27 12:21:33,535 INFO L290 TraceCheckUtils]: 38: Hoare triple {1906#true} ~cond := #in~cond; {1906#true} is VALID [2022-04-27 12:21:33,535 INFO L272 TraceCheckUtils]: 37: Hoare triple {2115#(or (= (mod main_~q~0 4294967296) 1) (< (mod (+ (* main_~p~0 4294967295) main_~r~0 (* (div (mod main_~q~0 4294967296) 4) 4294967295)) 4294967296) (mod (+ (* (div (mod main_~p~0 4294967296) 2) 2) (* (div (mod main_~q~0 4294967296) 4) 3)) 4294967296)))} call __VERIFIER_assert((if 0 == (~h~0 * ~h~0 * ~n~0 - 4 * ~h~0 * ~n~0 * ~p~0 + 4 * (~n~0 * ~n~0) * ~q~0 - ~n~0 * ~q~0 * ~q~0 - ~h~0 * ~h~0 * ~r~0 + 4 * ~h~0 * ~p~0 * ~r~0 - 8 * ~n~0 * ~q~0 * ~r~0 + ~q~0 * ~q~0 * ~r~0 + 4 * ~q~0 * ~r~0 * ~r~0) % 4294967296 then 1 else 0)); {1906#true} is VALID [2022-04-27 12:21:33,536 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {1906#true} {2115#(or (= (mod main_~q~0 4294967296) 1) (< (mod (+ (* main_~p~0 4294967295) main_~r~0 (* (div (mod main_~q~0 4294967296) 4) 4294967295)) 4294967296) (mod (+ (* (div (mod main_~p~0 4294967296) 2) 2) (* (div (mod main_~q~0 4294967296) 4) 3)) 4294967296)))} #89#return; {2115#(or (= (mod main_~q~0 4294967296) 1) (< (mod (+ (* main_~p~0 4294967295) main_~r~0 (* (div (mod main_~q~0 4294967296) 4) 4294967295)) 4294967296) (mod (+ (* (div (mod main_~p~0 4294967296) 2) 2) (* (div (mod main_~q~0 4294967296) 4) 3)) 4294967296)))} is VALID [2022-04-27 12:21:33,536 INFO L290 TraceCheckUtils]: 35: Hoare triple {1906#true} assume true; {1906#true} is VALID [2022-04-27 12:21:33,536 INFO L290 TraceCheckUtils]: 34: Hoare triple {1906#true} assume !(0 == ~cond); {1906#true} is VALID [2022-04-27 12:21:33,536 INFO L290 TraceCheckUtils]: 33: Hoare triple {1906#true} ~cond := #in~cond; {1906#true} is VALID [2022-04-27 12:21:33,536 INFO L272 TraceCheckUtils]: 32: Hoare triple {2115#(or (= (mod main_~q~0 4294967296) 1) (< (mod (+ (* main_~p~0 4294967295) main_~r~0 (* (div (mod main_~q~0 4294967296) 4) 4294967295)) 4294967296) (mod (+ (* (div (mod main_~p~0 4294967296) 2) 2) (* (div (mod main_~q~0 4294967296) 4) 3)) 4294967296)))} call __VERIFIER_assert((if 0 == (~h~0 * ~h~0 * ~h~0 - 12 * ~h~0 * ~n~0 * ~q~0 + 16 * ~n~0 * ~p~0 * ~q~0 - ~h~0 * ~q~0 * ~q~0 - 4 * ~p~0 * ~q~0 * ~q~0 + 12 * ~h~0 * ~q~0 * ~r~0 - 16 * ~p~0 * ~q~0 * ~r~0) % 4294967296 then 1 else 0)); {1906#true} is VALID [2022-04-27 12:21:33,537 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {1906#true} {2115#(or (= (mod main_~q~0 4294967296) 1) (< (mod (+ (* main_~p~0 4294967295) main_~r~0 (* (div (mod main_~q~0 4294967296) 4) 4294967295)) 4294967296) (mod (+ (* (div (mod main_~p~0 4294967296) 2) 2) (* (div (mod main_~q~0 4294967296) 4) 3)) 4294967296)))} #87#return; {2115#(or (= (mod main_~q~0 4294967296) 1) (< (mod (+ (* main_~p~0 4294967295) main_~r~0 (* (div (mod main_~q~0 4294967296) 4) 4294967295)) 4294967296) (mod (+ (* (div (mod main_~p~0 4294967296) 2) 2) (* (div (mod main_~q~0 4294967296) 4) 3)) 4294967296)))} is VALID [2022-04-27 12:21:33,537 INFO L290 TraceCheckUtils]: 30: Hoare triple {1906#true} assume true; {1906#true} is VALID [2022-04-27 12:21:33,537 INFO L290 TraceCheckUtils]: 29: Hoare triple {1906#true} assume !(0 == ~cond); {1906#true} is VALID [2022-04-27 12:21:33,537 INFO L290 TraceCheckUtils]: 28: Hoare triple {1906#true} ~cond := #in~cond; {1906#true} is VALID [2022-04-27 12:21:33,538 INFO L272 TraceCheckUtils]: 27: Hoare triple {2115#(or (= (mod main_~q~0 4294967296) 1) (< (mod (+ (* main_~p~0 4294967295) main_~r~0 (* (div (mod main_~q~0 4294967296) 4) 4294967295)) 4294967296) (mod (+ (* (div (mod main_~p~0 4294967296) 2) 2) (* (div (mod main_~q~0 4294967296) 4) 3)) 4294967296)))} call __VERIFIER_assert((if (~p~0 * ~p~0 + ~r~0 * ~q~0) % 4294967296 == ~n~0 * ~q~0 % 4294967296 then 1 else 0)); {1906#true} is VALID [2022-04-27 12:21:33,538 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {1906#true} {2115#(or (= (mod main_~q~0 4294967296) 1) (< (mod (+ (* main_~p~0 4294967295) main_~r~0 (* (div (mod main_~q~0 4294967296) 4) 4294967295)) 4294967296) (mod (+ (* (div (mod main_~p~0 4294967296) 2) 2) (* (div (mod main_~q~0 4294967296) 4) 3)) 4294967296)))} #85#return; {2115#(or (= (mod main_~q~0 4294967296) 1) (< (mod (+ (* main_~p~0 4294967295) main_~r~0 (* (div (mod main_~q~0 4294967296) 4) 4294967295)) 4294967296) (mod (+ (* (div (mod main_~p~0 4294967296) 2) 2) (* (div (mod main_~q~0 4294967296) 4) 3)) 4294967296)))} is VALID [2022-04-27 12:21:33,538 INFO L290 TraceCheckUtils]: 25: Hoare triple {1906#true} assume true; {1906#true} is VALID [2022-04-27 12:21:33,538 INFO L290 TraceCheckUtils]: 24: Hoare triple {1906#true} assume !(0 == ~cond); {1906#true} is VALID [2022-04-27 12:21:33,539 INFO L290 TraceCheckUtils]: 23: Hoare triple {1906#true} ~cond := #in~cond; {1906#true} is VALID [2022-04-27 12:21:33,539 INFO L272 TraceCheckUtils]: 22: Hoare triple {2115#(or (= (mod main_~q~0 4294967296) 1) (< (mod (+ (* main_~p~0 4294967295) main_~r~0 (* (div (mod main_~q~0 4294967296) 4) 4294967295)) 4294967296) (mod (+ (* (div (mod main_~p~0 4294967296) 2) 2) (* (div (mod main_~q~0 4294967296) 4) 3)) 4294967296)))} call __VERIFIER_assert((if ~r~0 % 4294967296 < (2 * ~p~0 + ~q~0) % 4294967296 then 1 else 0)); {1906#true} is VALID [2022-04-27 12:21:33,539 INFO L290 TraceCheckUtils]: 21: Hoare triple {2115#(or (= (mod main_~q~0 4294967296) 1) (< (mod (+ (* main_~p~0 4294967295) main_~r~0 (* (div (mod main_~q~0 4294967296) 4) 4294967295)) 4294967296) (mod (+ (* (div (mod main_~p~0 4294967296) 2) 2) (* (div (mod main_~q~0 4294967296) 4) 3)) 4294967296)))} assume !false; {2115#(or (= (mod main_~q~0 4294967296) 1) (< (mod (+ (* main_~p~0 4294967295) main_~r~0 (* (div (mod main_~q~0 4294967296) 4) 4294967295)) 4294967296) (mod (+ (* (div (mod main_~p~0 4294967296) 2) 2) (* (div (mod main_~q~0 4294967296) 4) 3)) 4294967296)))} is VALID [2022-04-27 12:21:33,545 INFO L290 TraceCheckUtils]: 20: Hoare triple {2212#(or (= (mod main_~q~0 4294967296) 1) (< (mod (+ (* main_~p~0 4294967295) main_~r~0 (* (div (mod main_~q~0 4294967296) 4) 4294967295)) 4294967296) (mod (+ (* (div (mod main_~p~0 4294967296) 2) 2) (* (div (mod main_~q~0 4294967296) 4) 3)) 4294967296)) (<= (mod main_~q~0 4294967296) (mod main_~n~0 4294967296)))} assume !(~q~0 % 4294967296 <= ~n~0 % 4294967296); {2115#(or (= (mod main_~q~0 4294967296) 1) (< (mod (+ (* main_~p~0 4294967295) main_~r~0 (* (div (mod main_~q~0 4294967296) 4) 4294967295)) 4294967296) (mod (+ (* (div (mod main_~p~0 4294967296) 2) 2) (* (div (mod main_~q~0 4294967296) 4) 3)) 4294967296)))} is VALID [2022-04-27 12:21:33,547 INFO L290 TraceCheckUtils]: 19: Hoare triple {2212#(or (= (mod main_~q~0 4294967296) 1) (< (mod (+ (* main_~p~0 4294967295) main_~r~0 (* (div (mod main_~q~0 4294967296) 4) 4294967295)) 4294967296) (mod (+ (* (div (mod main_~p~0 4294967296) 2) 2) (* (div (mod main_~q~0 4294967296) 4) 3)) 4294967296)) (<= (mod main_~q~0 4294967296) (mod main_~n~0 4294967296)))} assume !false; {2212#(or (= (mod main_~q~0 4294967296) 1) (< (mod (+ (* main_~p~0 4294967295) main_~r~0 (* (div (mod main_~q~0 4294967296) 4) 4294967295)) 4294967296) (mod (+ (* (div (mod main_~p~0 4294967296) 2) 2) (* (div (mod main_~q~0 4294967296) 4) 3)) 4294967296)) (<= (mod main_~q~0 4294967296) (mod main_~n~0 4294967296)))} is VALID [2022-04-27 12:21:35,663 WARN L290 TraceCheckUtils]: 18: Hoare triple {2219#(or (< (mod (+ (* main_~p~0 4294967295) (* (div (mod (* main_~q~0 4) 4294967296) 4) 4294967295) main_~r~0) 4294967296) (mod (+ (* (div (mod (* main_~q~0 4) 4294967296) 4) 3) (* (div (mod main_~p~0 4294967296) 2) 2)) 4294967296)) (< (mod main_~n~0 4294967296) (mod main_~q~0 4294967296)) (<= (mod (* main_~q~0 4) 4294967296) (mod main_~n~0 4294967296)))} assume !!(~q~0 % 4294967296 <= ~n~0 % 4294967296);~q~0 := 4 * ~q~0; {2212#(or (= (mod main_~q~0 4294967296) 1) (< (mod (+ (* main_~p~0 4294967295) main_~r~0 (* (div (mod main_~q~0 4294967296) 4) 4294967295)) 4294967296) (mod (+ (* (div (mod main_~p~0 4294967296) 2) 2) (* (div (mod main_~q~0 4294967296) 4) 3)) 4294967296)) (<= (mod main_~q~0 4294967296) (mod main_~n~0 4294967296)))} is UNKNOWN [2022-04-27 12:21:35,668 INFO L290 TraceCheckUtils]: 17: Hoare triple {2219#(or (< (mod (+ (* main_~p~0 4294967295) (* (div (mod (* main_~q~0 4) 4294967296) 4) 4294967295) main_~r~0) 4294967296) (mod (+ (* (div (mod (* main_~q~0 4) 4294967296) 4) 3) (* (div (mod main_~p~0 4294967296) 2) 2)) 4294967296)) (< (mod main_~n~0 4294967296) (mod main_~q~0 4294967296)) (<= (mod (* main_~q~0 4) 4294967296) (mod main_~n~0 4294967296)))} assume !false; {2219#(or (< (mod (+ (* main_~p~0 4294967295) (* (div (mod (* main_~q~0 4) 4294967296) 4) 4294967295) main_~r~0) 4294967296) (mod (+ (* (div (mod (* main_~q~0 4) 4294967296) 4) 3) (* (div (mod main_~p~0 4294967296) 2) 2)) 4294967296)) (< (mod main_~n~0 4294967296) (mod main_~q~0 4294967296)) (<= (mod (* main_~q~0 4) 4294967296) (mod main_~n~0 4294967296)))} is VALID [2022-04-27 12:21:35,670 INFO L290 TraceCheckUtils]: 16: Hoare triple {1906#true} ~p~0 := 0;~q~0 := 1;~r~0 := ~n~0;~h~0 := 0; {2219#(or (< (mod (+ (* main_~p~0 4294967295) (* (div (mod (* main_~q~0 4) 4294967296) 4) 4294967295) main_~r~0) 4294967296) (mod (+ (* (div (mod (* main_~q~0 4) 4294967296) 4) 3) (* (div (mod main_~p~0 4294967296) 2) 2)) 4294967296)) (< (mod main_~n~0 4294967296) (mod main_~q~0 4294967296)) (<= (mod (* main_~q~0 4) 4294967296) (mod main_~n~0 4294967296)))} is VALID [2022-04-27 12:21:35,671 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {1906#true} {1906#true} #83#return; {1906#true} is VALID [2022-04-27 12:21:35,671 INFO L290 TraceCheckUtils]: 14: Hoare triple {1906#true} assume true; {1906#true} is VALID [2022-04-27 12:21:35,671 INFO L290 TraceCheckUtils]: 13: Hoare triple {1906#true} assume !(0 == ~cond); {1906#true} is VALID [2022-04-27 12:21:35,671 INFO L290 TraceCheckUtils]: 12: Hoare triple {1906#true} ~cond := #in~cond; {1906#true} is VALID [2022-04-27 12:21:35,671 INFO L272 TraceCheckUtils]: 11: Hoare triple {1906#true} call assume_abort_if_not((if ~n~0 % 4294967296 < 1073741823 then 1 else 0)); {1906#true} is VALID [2022-04-27 12:21:35,671 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1906#true} {1906#true} #81#return; {1906#true} is VALID [2022-04-27 12:21:35,671 INFO L290 TraceCheckUtils]: 9: Hoare triple {1906#true} assume true; {1906#true} is VALID [2022-04-27 12:21:35,671 INFO L290 TraceCheckUtils]: 8: Hoare triple {1906#true} assume !(0 == ~cond); {1906#true} is VALID [2022-04-27 12:21:35,671 INFO L290 TraceCheckUtils]: 7: Hoare triple {1906#true} ~cond := #in~cond; {1906#true} is VALID [2022-04-27 12:21:35,671 INFO L272 TraceCheckUtils]: 6: Hoare triple {1906#true} call assume_abort_if_not((if ~n~0 % 4294967296 >= 0 && ~n~0 % 4294967296 <= 1 then 1 else 0)); {1906#true} is VALID [2022-04-27 12:21:35,671 INFO L290 TraceCheckUtils]: 5: Hoare triple {1906#true} havoc ~n~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~h~0;~n~0 := #t~nondet4;havoc #t~nondet4; {1906#true} is VALID [2022-04-27 12:21:35,671 INFO L272 TraceCheckUtils]: 4: Hoare triple {1906#true} call #t~ret5 := main(); {1906#true} is VALID [2022-04-27 12:21:35,671 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1906#true} {1906#true} #103#return; {1906#true} is VALID [2022-04-27 12:21:35,671 INFO L290 TraceCheckUtils]: 2: Hoare triple {1906#true} assume true; {1906#true} is VALID [2022-04-27 12:21:35,672 INFO L290 TraceCheckUtils]: 1: Hoare triple {1906#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(13, 2);call #Ultimate.allocInit(12, 3); {1906#true} is VALID [2022-04-27 12:21:35,672 INFO L272 TraceCheckUtils]: 0: Hoare triple {1906#true} call ULTIMATE.init(); {1906#true} is VALID [2022-04-27 12:21:35,672 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 64 trivial. 4 not checked. [2022-04-27 12:21:35,672 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 12:21:35,672 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [424847703] [2022-04-27 12:21:35,672 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-27 12:21:35,672 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [833284624] [2022-04-27 12:21:35,672 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [833284624] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 12:21:35,672 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-27 12:21:35,673 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9] total 17 [2022-04-27 12:21:35,673 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [427229919] [2022-04-27 12:21:35,673 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-27 12:21:35,674 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 1.9411764705882353) internal successors, (33), 15 states have internal predecessors, (33), 6 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (17), 4 states have call predecessors, (17), 4 states have call successors, (17) Word has length 59 [2022-04-27 12:21:35,674 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 12:21:35,674 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 17 states, 17 states have (on average 1.9411764705882353) internal successors, (33), 15 states have internal predecessors, (33), 6 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (17), 4 states have call predecessors, (17), 4 states have call successors, (17) [2022-04-27 12:21:40,001 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 69 edges. 67 inductive. 0 not inductive. 2 times theorem prover too weak to decide inductivity. [2022-04-27 12:21:40,001 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-04-27 12:21:40,002 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 12:21:40,002 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-04-27 12:21:40,002 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=161, Unknown=14, NotChecked=54, Total=272 [2022-04-27 12:21:40,002 INFO L87 Difference]: Start difference. First operand 55 states and 68 transitions. Second operand has 17 states, 17 states have (on average 1.9411764705882353) internal successors, (33), 15 states have internal predecessors, (33), 6 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (17), 4 states have call predecessors, (17), 4 states have call successors, (17) [2022-04-27 12:21:46,467 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 12:21:48,617 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 12:21:50,764 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 12:22:01,816 WARN L232 SmtUtils]: Spent 8.66s on a formula simplification. DAG size of input: 44 DAG size of output: 25 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-04-27 12:22:06,204 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 12:22:12,265 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-27 12:22:17,359 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-27 12:22:20,166 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-27 12:22:24,793 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-27 12:22:27,354 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-27 12:22:30,146 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 12:22:32,660 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-27 12:22:34,002 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.01s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-27 12:22:39,379 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.06s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-27 12:22:41,445 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-27 12:22:45,724 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-27 12:22:48,341 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.98s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-27 12:22:50,352 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-27 12:22:52,412 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-27 12:22:54,416 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-27 12:22:56,576 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.16s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-27 12:23:08,716 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-27 12:23:12,029 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 12:23:14,299 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 12:23:19,767 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-27 12:23:21,906 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.14s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-27 12:23:34,139 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-27 12:23:36,147 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-27 12:23:38,152 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-27 12:23:40,156 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-27 12:23:42,160 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-27 12:23:44,162 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-27 12:23:46,165 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-27 12:23:48,169 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-27 12:24:08,953 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-27 12:24:11,126 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.17s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-27 12:24:15,475 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 12:24:24,077 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 12:24:26,961 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.88s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-27 12:24:31,277 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 12:24:33,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:24:33,904 INFO L93 Difference]: Finished difference Result 91 states and 123 transitions. [2022-04-27 12:24:33,904 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-04-27 12:24:33,905 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 1.9411764705882353) internal successors, (33), 15 states have internal predecessors, (33), 6 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (17), 4 states have call predecessors, (17), 4 states have call successors, (17) Word has length 59 [2022-04-27 12:24:33,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 12:24:33,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 17 states have (on average 1.9411764705882353) internal successors, (33), 15 states have internal predecessors, (33), 6 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (17), 4 states have call predecessors, (17), 4 states have call successors, (17) [2022-04-27 12:24:33,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 114 transitions. [2022-04-27 12:24:33,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 17 states have (on average 1.9411764705882353) internal successors, (33), 15 states have internal predecessors, (33), 6 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (17), 4 states have call predecessors, (17), 4 states have call successors, (17) [2022-04-27 12:24:33,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 114 transitions. [2022-04-27 12:24:33,911 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 13 states and 114 transitions. [2022-04-27 12:24:34,077 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 114 edges. 114 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 12:24:34,079 INFO L225 Difference]: With dead ends: 91 [2022-04-27 12:24:34,079 INFO L226 Difference]: Without dead ends: 73 [2022-04-27 12:24:34,083 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 101 SyntacticMatches, 2 SemanticMatches, 19 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 49.7s TimeCoverageRelationStatistics Valid=65, Invalid=267, Unknown=18, NotChecked=70, Total=420 [2022-04-27 12:24:34,084 INFO L413 NwaCegarLoop]: 49 mSDtfsCounter, 20 mSDsluCounter, 289 mSDsCounter, 0 mSdLazyCounter, 356 mSolverCounterSat, 25 mSolverCounterUnsat, 36 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 94.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 338 SdHoareTripleChecker+Invalid, 527 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 356 IncrementalHoareTripleChecker+Invalid, 36 IncrementalHoareTripleChecker+Unknown, 110 IncrementalHoareTripleChecker+Unchecked, 96.9s IncrementalHoareTripleChecker+Time [2022-04-27 12:24:34,084 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 338 Invalid, 527 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 356 Invalid, 36 Unknown, 110 Unchecked, 96.9s Time] [2022-04-27 12:24:34,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2022-04-27 12:24:34,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 62. [2022-04-27 12:24:34,123 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 12:24:34,124 INFO L82 GeneralOperation]: Start isEquivalent. First operand 73 states. Second operand has 62 states, 34 states have (on average 1.088235294117647) internal successors, (37), 36 states have internal predecessors, (37), 20 states have call successors, (20), 8 states have call predecessors, (20), 7 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18) [2022-04-27 12:24:34,124 INFO L74 IsIncluded]: Start isIncluded. First operand 73 states. Second operand has 62 states, 34 states have (on average 1.088235294117647) internal successors, (37), 36 states have internal predecessors, (37), 20 states have call successors, (20), 8 states have call predecessors, (20), 7 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18) [2022-04-27 12:24:34,124 INFO L87 Difference]: Start difference. First operand 73 states. Second operand has 62 states, 34 states have (on average 1.088235294117647) internal successors, (37), 36 states have internal predecessors, (37), 20 states have call successors, (20), 8 states have call predecessors, (20), 7 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18) [2022-04-27 12:24:34,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:24:34,128 INFO L93 Difference]: Finished difference Result 73 states and 94 transitions. [2022-04-27 12:24:34,128 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 94 transitions. [2022-04-27 12:24:34,128 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 12:24:34,128 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 12:24:34,129 INFO L74 IsIncluded]: Start isIncluded. First operand has 62 states, 34 states have (on average 1.088235294117647) internal successors, (37), 36 states have internal predecessors, (37), 20 states have call successors, (20), 8 states have call predecessors, (20), 7 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18) Second operand 73 states. [2022-04-27 12:24:34,129 INFO L87 Difference]: Start difference. First operand has 62 states, 34 states have (on average 1.088235294117647) internal successors, (37), 36 states have internal predecessors, (37), 20 states have call successors, (20), 8 states have call predecessors, (20), 7 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18) Second operand 73 states. [2022-04-27 12:24:34,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 12:24:34,132 INFO L93 Difference]: Finished difference Result 73 states and 94 transitions. [2022-04-27 12:24:34,132 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 94 transitions. [2022-04-27 12:24:34,133 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 12:24:34,133 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 12:24:34,133 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 12:24:34,133 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 12:24:34,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 34 states have (on average 1.088235294117647) internal successors, (37), 36 states have internal predecessors, (37), 20 states have call successors, (20), 8 states have call predecessors, (20), 7 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18) [2022-04-27 12:24:34,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 75 transitions. [2022-04-27 12:24:34,136 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 75 transitions. Word has length 59 [2022-04-27 12:24:34,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 12:24:34,136 INFO L495 AbstractCegarLoop]: Abstraction has 62 states and 75 transitions. [2022-04-27 12:24:34,137 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 1.9411764705882353) internal successors, (33), 15 states have internal predecessors, (33), 6 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (17), 4 states have call predecessors, (17), 4 states have call successors, (17) [2022-04-27 12:24:34,137 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 75 transitions. [2022-04-27 12:24:34,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2022-04-27 12:24:34,137 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 12:24:34,137 INFO L195 NwaCegarLoop]: trace histogram [8, 7, 7, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 12:24:34,143 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2022-04-27 12:24:34,342 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 12:24:34,342 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 12:24:34,343 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 12:24:34,343 INFO L85 PathProgramCache]: Analyzing trace with hash 825776884, now seen corresponding path program 2 times [2022-04-27 12:24:34,343 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 12:24:34,343 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2044582882] [2022-04-27 12:24:34,343 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 12:24:34,343 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 12:24:34,355 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-27 12:24:34,355 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [534400509] [2022-04-27 12:24:34,355 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-27 12:24:34,355 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 12:24:34,355 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 12:24:34,356 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 12:24:34,363 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process