/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_unwindbound50.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-e106359-m [2022-04-14 15:16:03,360 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-14 15:16:03,361 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-14 15:16:03,409 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-14 15:16:03,409 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-14 15:16:03,411 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-14 15:16:03,413 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-14 15:16:03,418 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-14 15:16:03,420 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-14 15:16:03,423 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-14 15:16:03,424 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-14 15:16:03,425 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-14 15:16:03,425 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-14 15:16:03,426 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-14 15:16:03,426 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-14 15:16:03,427 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-14 15:16:03,428 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-14 15:16:03,428 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-14 15:16:03,429 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-14 15:16:03,431 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-14 15:16:03,432 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-14 15:16:03,434 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-14 15:16:03,436 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-14 15:16:03,438 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-14 15:16:03,439 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-14 15:16:03,449 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-14 15:16:03,449 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-14 15:16:03,449 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-14 15:16:03,450 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-14 15:16:03,450 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-14 15:16:03,452 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-14 15:16:03,452 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-14 15:16:03,453 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-14 15:16:03,454 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-14 15:16:03,454 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-14 15:16:03,455 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-14 15:16:03,455 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-14 15:16:03,456 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-14 15:16:03,456 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-14 15:16:03,456 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-14 15:16:03,457 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-14 15:16:03,459 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-14 15:16:03,460 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-14 15:16:03,483 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-14 15:16:03,484 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-14 15:16:03,484 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-04-14 15:16:03,484 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-04-14 15:16:03,485 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-04-14 15:16:03,485 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-04-14 15:16:03,485 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-04-14 15:16:03,485 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-04-14 15:16:03,485 INFO L138 SettingsManager]: * Use SBE=true [2022-04-14 15:16:03,486 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-14 15:16:03,486 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-14 15:16:03,486 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-14 15:16:03,486 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-14 15:16:03,486 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-14 15:16:03,486 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-14 15:16:03,486 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-14 15:16:03,487 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-14 15:16:03,487 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-14 15:16:03,487 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-14 15:16:03,487 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-14 15:16:03,487 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-14 15:16:03,487 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-14 15:16:03,487 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-14 15:16:03,488 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-14 15:16:03,488 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-14 15:16:03,488 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-14 15:16:03,488 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-04-14 15:16:03,488 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-04-14 15:16:03,488 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-04-14 15:16:03,488 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-04-14 15:16:03,489 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-04-14 15:16:03,489 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-04-14 15:16:03,489 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-14 15:16:03,489 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-14 15:16:03,714 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-14 15:16:03,731 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-14 15:16:03,733 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-14 15:16:03,734 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-14 15:16:03,735 INFO L275 PluginConnector]: CDTParser initialized [2022-04-14 15:16:03,736 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/nla-digbench-scaling/dijkstra-u_unwindbound50.c [2022-04-14 15:16:03,800 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7a4db28f0/55977d886c14488a853ae70259e33327/FLAG58aaaf1af [2022-04-14 15:16:04,163 INFO L306 CDTParser]: Found 1 translation units. [2022-04-14 15:16:04,163 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/dijkstra-u_unwindbound50.c [2022-04-14 15:16:04,176 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7a4db28f0/55977d886c14488a853ae70259e33327/FLAG58aaaf1af [2022-04-14 15:16:04,581 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7a4db28f0/55977d886c14488a853ae70259e33327 [2022-04-14 15:16:04,584 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-14 15:16:04,586 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-14 15:16:04,588 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-14 15:16:04,588 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-14 15:16:04,591 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-14 15:16:04,592 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.04 03:16:04" (1/1) ... [2022-04-14 15:16:04,593 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@830f8c4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 03:16:04, skipping insertion in model container [2022-04-14 15:16:04,593 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.04 03:16:04" (1/1) ... [2022-04-14 15:16:04,599 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-14 15:16:04,616 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-14 15:16:04,768 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_unwindbound50.c[525,538] [2022-04-14 15:16:04,797 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-14 15:16:04,803 INFO L203 MainTranslator]: Completed pre-run [2022-04-14 15:16:04,816 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_unwindbound50.c[525,538] [2022-04-14 15:16:04,842 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-14 15:16:04,868 INFO L208 MainTranslator]: Completed translation [2022-04-14 15:16:04,868 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 03:16:04 WrapperNode [2022-04-14 15:16:04,868 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-14 15:16:04,869 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-14 15:16:04,869 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-14 15:16:04,869 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-14 15:16:04,878 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 03:16:04" (1/1) ... [2022-04-14 15:16:04,878 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 03:16:04" (1/1) ... [2022-04-14 15:16:04,896 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 03:16:04" (1/1) ... [2022-04-14 15:16:04,896 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 03:16:04" (1/1) ... [2022-04-14 15:16:04,902 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 03:16:04" (1/1) ... [2022-04-14 15:16:04,913 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 03:16:04" (1/1) ... [2022-04-14 15:16:04,914 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 03:16:04" (1/1) ... [2022-04-14 15:16:04,916 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-14 15:16:04,917 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-14 15:16:04,917 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-14 15:16:04,917 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-14 15:16:04,918 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 03:16:04" (1/1) ... [2022-04-14 15:16:04,927 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-14 15:16:04,935 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-14 15:16:04,948 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-14 15:16:04,951 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-14 15:16:04,979 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-14 15:16:04,979 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-14 15:16:04,979 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-14 15:16:04,980 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-14 15:16:04,982 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-14 15:16:04,982 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-14 15:16:04,982 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-14 15:16:04,982 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-14 15:16:04,983 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-14 15:16:04,983 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-14 15:16:04,983 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uint [2022-04-14 15:16:04,983 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-14 15:16:04,986 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-14 15:16:04,986 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-14 15:16:04,986 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-14 15:16:04,986 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-14 15:16:04,986 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-14 15:16:04,987 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-14 15:16:04,987 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-14 15:16:04,987 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-14 15:16:05,040 INFO L234 CfgBuilder]: Building ICFG [2022-04-14 15:16:05,042 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-14 15:16:05,298 INFO L275 CfgBuilder]: Performing block encoding [2022-04-14 15:16:05,303 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-14 15:16:05,303 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-04-14 15:16:05,305 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.04 03:16:05 BoogieIcfgContainer [2022-04-14 15:16:05,305 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-14 15:16:05,306 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-14 15:16:05,306 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-14 15:16:05,309 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-14 15:16:05,309 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.04 03:16:04" (1/3) ... [2022-04-14 15:16:05,309 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1bc9c08d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.04 03:16:05, skipping insertion in model container [2022-04-14 15:16:05,310 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 03:16:04" (2/3) ... [2022-04-14 15:16:05,310 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1bc9c08d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.04 03:16:05, skipping insertion in model container [2022-04-14 15:16:05,310 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.04 03:16:05" (3/3) ... [2022-04-14 15:16:05,311 INFO L111 eAbstractionObserver]: Analyzing ICFG dijkstra-u_unwindbound50.c [2022-04-14 15:16:05,315 INFO L202 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-04-14 15:16:05,315 INFO L161 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-14 15:16:05,347 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-14 15:16:05,352 INFO L340 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 [2022-04-14 15:16:05,353 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-14 15:16:05,377 INFO L276 IsEmpty]: Start isEmpty. Operand has 39 states, 21 states have (on average 1.4761904761904763) internal successors, (31), 22 states have internal predecessors, (31), 12 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-14 15:16:05,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-04-14 15:16:05,381 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 15:16:05,382 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-14 15:16:05,382 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 15:16:05,386 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 15:16:05,386 INFO L85 PathProgramCache]: Analyzing trace with hash -2024343623, now seen corresponding path program 1 times [2022-04-14 15:16:05,394 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 15:16:05,394 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1214887358] [2022-04-14 15:16:05,394 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 15:16:05,395 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 15:16:05,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 15:16:05,594 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-14 15:16:05,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 15:16:05,622 INFO L290 TraceCheckUtils]: 0: Hoare triple {51#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {42#true} is VALID [2022-04-14 15:16:05,622 INFO L290 TraceCheckUtils]: 1: Hoare triple {42#true} assume true; {42#true} is VALID [2022-04-14 15:16:05,622 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {42#true} {42#true} #102#return; {42#true} is VALID [2022-04-14 15:16:05,623 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-14 15:16:05,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 15:16:05,642 INFO L290 TraceCheckUtils]: 0: Hoare triple {42#true} ~cond := #in~cond; {42#true} is VALID [2022-04-14 15:16:05,643 INFO L290 TraceCheckUtils]: 1: Hoare triple {42#true} assume 0 == ~cond;assume false; {43#false} is VALID [2022-04-14 15:16:05,643 INFO L290 TraceCheckUtils]: 2: Hoare triple {43#false} assume true; {43#false} is VALID [2022-04-14 15:16:05,644 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {43#false} {42#true} #82#return; {43#false} is VALID [2022-04-14 15:16:05,645 INFO L272 TraceCheckUtils]: 0: Hoare triple {42#true} call ULTIMATE.init(); {51#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-14 15:16:05,645 INFO L290 TraceCheckUtils]: 1: Hoare triple {51#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {42#true} is VALID [2022-04-14 15:16:05,645 INFO L290 TraceCheckUtils]: 2: Hoare triple {42#true} assume true; {42#true} is VALID [2022-04-14 15:16:05,646 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {42#true} {42#true} #102#return; {42#true} is VALID [2022-04-14 15:16:05,646 INFO L272 TraceCheckUtils]: 4: Hoare triple {42#true} call #t~ret7 := main(); {42#true} is VALID [2022-04-14 15:16:05,646 INFO L290 TraceCheckUtils]: 5: Hoare triple {42#true} havoc ~n~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~h~0;~n~0 := #t~nondet4;havoc #t~nondet4; {42#true} is VALID [2022-04-14 15:16:05,646 INFO L272 TraceCheckUtils]: 6: Hoare triple {42#true} call assume_abort_if_not((if ~n~0 % 4294967296 < 1073741823 then 1 else 0)); {42#true} is VALID [2022-04-14 15:16:05,646 INFO L290 TraceCheckUtils]: 7: Hoare triple {42#true} ~cond := #in~cond; {42#true} is VALID [2022-04-14 15:16:05,647 INFO L290 TraceCheckUtils]: 8: Hoare triple {42#true} assume 0 == ~cond;assume false; {43#false} is VALID [2022-04-14 15:16:05,647 INFO L290 TraceCheckUtils]: 9: Hoare triple {43#false} assume true; {43#false} is VALID [2022-04-14 15:16:05,648 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {43#false} {42#true} #82#return; {43#false} is VALID [2022-04-14 15:16:05,648 INFO L290 TraceCheckUtils]: 11: Hoare triple {43#false} ~p~0 := 0;~q~0 := 1;~r~0 := ~n~0;~h~0 := 0; {43#false} is VALID [2022-04-14 15:16:05,648 INFO L290 TraceCheckUtils]: 12: Hoare triple {43#false} assume !true; {43#false} is VALID [2022-04-14 15:16:05,648 INFO L290 TraceCheckUtils]: 13: Hoare triple {43#false} assume !true; {43#false} is VALID [2022-04-14 15:16:05,648 INFO L272 TraceCheckUtils]: 14: Hoare triple {43#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)); {43#false} is VALID [2022-04-14 15:16:05,649 INFO L290 TraceCheckUtils]: 15: Hoare triple {43#false} ~cond := #in~cond; {43#false} is VALID [2022-04-14 15:16:05,649 INFO L290 TraceCheckUtils]: 16: Hoare triple {43#false} assume 0 == ~cond; {43#false} is VALID [2022-04-14 15:16:05,650 INFO L290 TraceCheckUtils]: 17: Hoare triple {43#false} assume !false; {43#false} is VALID [2022-04-14 15:16:05,651 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-14 15:16:05,651 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 15:16:05,651 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1214887358] [2022-04-14 15:16:05,653 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1214887358] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-14 15:16:05,653 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-14 15:16:05,653 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-14 15:16:05,657 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1651531748] [2022-04-14 15:16:05,658 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-14 15:16:05,662 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 18 [2022-04-14 15:16:05,664 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 15:16:05,667 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-14 15:16:05,696 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 15:16:05,697 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-14 15:16:05,697 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 15:16:05,719 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-14 15:16:05,720 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-14 15:16:05,722 INFO L87 Difference]: Start difference. First operand has 39 states, 21 states have (on average 1.4761904761904763) internal successors, (31), 22 states have internal predecessors, (31), 12 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-14 15:16:08,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 15:16:08,589 INFO L93 Difference]: Finished difference Result 70 states and 111 transitions. [2022-04-14 15:16:08,589 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-14 15:16:08,589 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 18 [2022-04-14 15:16:08,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-14 15:16:08,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, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-14 15:16:08,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 111 transitions. [2022-04-14 15:16:08,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-14 15:16:08,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 111 transitions. [2022-04-14 15:16:08,611 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 111 transitions. [2022-04-14 15:16:08,733 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 111 edges. 111 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 15:16:08,742 INFO L225 Difference]: With dead ends: 70 [2022-04-14 15:16:08,742 INFO L226 Difference]: Without dead ends: 35 [2022-04-14 15:16:08,744 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-14 15:16:08,747 INFO L913 BasicCegarLoop]: 49 mSDtfsCounter, 10 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 53 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-14 15:16:08,748 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [11 Valid, 53 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-14 15:16:08,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2022-04-14 15:16:08,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 34. [2022-04-14 15:16:08,772 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-14 15:16:08,773 INFO L82 GeneralOperation]: Start isEquivalent. First operand 35 states. Second operand has 34 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 19 states have internal predecessors, (24), 12 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-14 15:16:08,774 INFO L74 IsIncluded]: Start isIncluded. First operand 35 states. Second operand has 34 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 19 states have internal predecessors, (24), 12 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-14 15:16:08,774 INFO L87 Difference]: Start difference. First operand 35 states. Second operand has 34 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 19 states have internal predecessors, (24), 12 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-14 15:16:08,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 15:16:08,785 INFO L93 Difference]: Finished difference Result 35 states and 47 transitions. [2022-04-14 15:16:08,785 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 47 transitions. [2022-04-14 15:16:08,786 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 15:16:08,786 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 15:16:08,787 INFO L74 IsIncluded]: Start isIncluded. First operand has 34 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 19 states have internal predecessors, (24), 12 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand 35 states. [2022-04-14 15:16:08,787 INFO L87 Difference]: Start difference. First operand has 34 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 19 states have internal predecessors, (24), 12 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand 35 states. [2022-04-14 15:16:08,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 15:16:08,791 INFO L93 Difference]: Finished difference Result 35 states and 47 transitions. [2022-04-14 15:16:08,791 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 47 transitions. [2022-04-14 15:16:08,792 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 15:16:08,792 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 15:16:08,792 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-14 15:16:08,792 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-14 15:16:08,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 19 states have internal predecessors, (24), 12 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-14 15:16:08,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 46 transitions. [2022-04-14 15:16:08,803 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 46 transitions. Word has length 18 [2022-04-14 15:16:08,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-14 15:16:08,803 INFO L478 AbstractCegarLoop]: Abstraction has 34 states and 46 transitions. [2022-04-14 15:16:08,803 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-14 15:16:08,804 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 46 transitions. [2022-04-14 15:16:08,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-04-14 15:16:08,806 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 15:16:08,806 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-14 15:16:08,807 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-14 15:16:08,807 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 15:16:08,808 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 15:16:08,808 INFO L85 PathProgramCache]: Analyzing trace with hash -96361696, now seen corresponding path program 1 times [2022-04-14 15:16:08,808 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 15:16:08,809 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1157388596] [2022-04-14 15:16:08,809 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 15:16:08,809 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 15:16:08,842 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-14 15:16:08,843 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1280600443] [2022-04-14 15:16:08,843 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 15:16:08,843 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-14 15:16:08,843 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-14 15:16:08,848 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-14 15:16:08,862 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-14 15:16:08,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 15:16:08,924 INFO L263 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 5 conjunts are in the unsatisfiable core [2022-04-14 15:16:08,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 15:16:08,952 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-14 15:16:09,123 INFO L272 TraceCheckUtils]: 0: Hoare triple {274#true} call ULTIMATE.init(); {274#true} is VALID [2022-04-14 15:16:09,124 INFO L290 TraceCheckUtils]: 1: Hoare triple {274#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);~counter~0 := 0; {282#(<= ~counter~0 0)} is VALID [2022-04-14 15:16:09,124 INFO L290 TraceCheckUtils]: 2: Hoare triple {282#(<= ~counter~0 0)} assume true; {282#(<= ~counter~0 0)} is VALID [2022-04-14 15:16:09,125 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {282#(<= ~counter~0 0)} {274#true} #102#return; {282#(<= ~counter~0 0)} is VALID [2022-04-14 15:16:09,125 INFO L272 TraceCheckUtils]: 4: Hoare triple {282#(<= ~counter~0 0)} call #t~ret7 := main(); {282#(<= ~counter~0 0)} is VALID [2022-04-14 15:16:09,126 INFO L290 TraceCheckUtils]: 5: Hoare triple {282#(<= ~counter~0 0)} havoc ~n~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~h~0;~n~0 := #t~nondet4;havoc #t~nondet4; {282#(<= ~counter~0 0)} is VALID [2022-04-14 15:16:09,126 INFO L272 TraceCheckUtils]: 6: Hoare triple {282#(<= ~counter~0 0)} call assume_abort_if_not((if ~n~0 % 4294967296 < 1073741823 then 1 else 0)); {282#(<= ~counter~0 0)} is VALID [2022-04-14 15:16:09,127 INFO L290 TraceCheckUtils]: 7: Hoare triple {282#(<= ~counter~0 0)} ~cond := #in~cond; {282#(<= ~counter~0 0)} is VALID [2022-04-14 15:16:09,127 INFO L290 TraceCheckUtils]: 8: Hoare triple {282#(<= ~counter~0 0)} assume !(0 == ~cond); {282#(<= ~counter~0 0)} is VALID [2022-04-14 15:16:09,128 INFO L290 TraceCheckUtils]: 9: Hoare triple {282#(<= ~counter~0 0)} assume true; {282#(<= ~counter~0 0)} is VALID [2022-04-14 15:16:09,128 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {282#(<= ~counter~0 0)} {282#(<= ~counter~0 0)} #82#return; {282#(<= ~counter~0 0)} is VALID [2022-04-14 15:16:09,129 INFO L290 TraceCheckUtils]: 11: Hoare triple {282#(<= ~counter~0 0)} ~p~0 := 0;~q~0 := 1;~r~0 := ~n~0;~h~0 := 0; {282#(<= ~counter~0 0)} is VALID [2022-04-14 15:16:09,130 INFO L290 TraceCheckUtils]: 12: Hoare triple {282#(<= ~counter~0 0)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {316#(<= |main_#t~post5| 0)} is VALID [2022-04-14 15:16:09,130 INFO L290 TraceCheckUtils]: 13: Hoare triple {316#(<= |main_#t~post5| 0)} assume !(#t~post5 < 50);havoc #t~post5; {275#false} is VALID [2022-04-14 15:16:09,131 INFO L290 TraceCheckUtils]: 14: Hoare triple {275#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {275#false} is VALID [2022-04-14 15:16:09,131 INFO L290 TraceCheckUtils]: 15: Hoare triple {275#false} assume !(#t~post6 < 50);havoc #t~post6; {275#false} is VALID [2022-04-14 15:16:09,131 INFO L272 TraceCheckUtils]: 16: Hoare triple {275#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)); {275#false} is VALID [2022-04-14 15:16:09,131 INFO L290 TraceCheckUtils]: 17: Hoare triple {275#false} ~cond := #in~cond; {275#false} is VALID [2022-04-14 15:16:09,131 INFO L290 TraceCheckUtils]: 18: Hoare triple {275#false} assume 0 == ~cond; {275#false} is VALID [2022-04-14 15:16:09,132 INFO L290 TraceCheckUtils]: 19: Hoare triple {275#false} assume !false; {275#false} is VALID [2022-04-14 15:16:09,132 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-14 15:16:09,133 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-14 15:16:09,133 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 15:16:09,133 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1157388596] [2022-04-14 15:16:09,133 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-14 15:16:09,134 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1280600443] [2022-04-14 15:16:09,137 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1280600443] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-14 15:16:09,138 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-14 15:16:09,138 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-14 15:16:09,139 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [654995955] [2022-04-14 15:16:09,139 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-14 15:16:09,140 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 20 [2022-04-14 15:16:09,140 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 15:16:09,140 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-14 15:16:09,157 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-14 15:16:09,157 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-14 15:16:09,158 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 15:16:09,158 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-14 15:16:09,158 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-14 15:16:09,159 INFO L87 Difference]: Start difference. First operand 34 states and 46 transitions. Second operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-14 15:16:20,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 15:16:20,490 INFO L93 Difference]: Finished difference Result 55 states and 78 transitions. [2022-04-14 15:16:20,490 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-14 15:16:20,490 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 20 [2022-04-14 15:16:20,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-14 15:16:20,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-14 15:16:20,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 78 transitions. [2022-04-14 15:16:20,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-14 15:16:20,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 78 transitions. [2022-04-14 15:16:20,499 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 78 transitions. [2022-04-14 15:16:20,592 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 78 edges. 78 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 15:16:20,595 INFO L225 Difference]: With dead ends: 55 [2022-04-14 15:16:20,595 INFO L226 Difference]: Without dead ends: 36 [2022-04-14 15:16:20,596 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-14 15:16:20,596 INFO L913 BasicCegarLoop]: 44 mSDtfsCounter, 0 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 119 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-14 15:16:20,597 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 119 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-14 15:16:20,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2022-04-14 15:16:20,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2022-04-14 15:16:20,609 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-14 15:16:20,610 INFO L82 GeneralOperation]: Start isEquivalent. First operand 36 states. Second operand has 36 states, 20 states have (on average 1.3) internal successors, (26), 21 states have internal predecessors, (26), 12 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-14 15:16:20,611 INFO L74 IsIncluded]: Start isIncluded. First operand 36 states. Second operand has 36 states, 20 states have (on average 1.3) internal successors, (26), 21 states have internal predecessors, (26), 12 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-14 15:16:20,611 INFO L87 Difference]: Start difference. First operand 36 states. Second operand has 36 states, 20 states have (on average 1.3) internal successors, (26), 21 states have internal predecessors, (26), 12 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-14 15:16:20,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 15:16:20,618 INFO L93 Difference]: Finished difference Result 36 states and 48 transitions. [2022-04-14 15:16:20,618 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 48 transitions. [2022-04-14 15:16:20,619 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 15:16:20,619 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 15:16:20,619 INFO L74 IsIncluded]: Start isIncluded. First operand has 36 states, 20 states have (on average 1.3) internal successors, (26), 21 states have internal predecessors, (26), 12 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand 36 states. [2022-04-14 15:16:20,620 INFO L87 Difference]: Start difference. First operand has 36 states, 20 states have (on average 1.3) internal successors, (26), 21 states have internal predecessors, (26), 12 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand 36 states. [2022-04-14 15:16:20,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 15:16:20,622 INFO L93 Difference]: Finished difference Result 36 states and 48 transitions. [2022-04-14 15:16:20,622 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 48 transitions. [2022-04-14 15:16:20,623 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 15:16:20,623 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 15:16:20,623 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-14 15:16:20,623 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-14 15:16:20,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 20 states have (on average 1.3) internal successors, (26), 21 states have internal predecessors, (26), 12 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-14 15:16:20,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 48 transitions. [2022-04-14 15:16:20,626 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 48 transitions. Word has length 20 [2022-04-14 15:16:20,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-14 15:16:20,626 INFO L478 AbstractCegarLoop]: Abstraction has 36 states and 48 transitions. [2022-04-14 15:16:20,626 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-14 15:16:20,627 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 48 transitions. [2022-04-14 15:16:20,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-04-14 15:16:20,629 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 15:16:20,629 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-14 15:16:20,651 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-14 15:16:20,847 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-14 15:16:20,848 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 15:16:20,848 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 15:16:20,849 INFO L85 PathProgramCache]: Analyzing trace with hash 962099791, now seen corresponding path program 1 times [2022-04-14 15:16:20,849 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 15:16:20,850 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1534471575] [2022-04-14 15:16:20,851 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 15:16:20,852 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 15:16:20,869 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-14 15:16:20,869 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1052287078] [2022-04-14 15:16:20,869 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 15:16:20,869 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-14 15:16:20,869 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-14 15:16:20,870 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-14 15:16:20,907 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-14 15:16:20,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 15:16:20,931 INFO L263 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-14 15:16:20,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 15:16:20,945 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-14 15:16:21,112 INFO L272 TraceCheckUtils]: 0: Hoare triple {546#true} call ULTIMATE.init(); {546#true} is VALID [2022-04-14 15:16:21,114 INFO L290 TraceCheckUtils]: 1: Hoare triple {546#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);~counter~0 := 0; {554#(<= ~counter~0 0)} is VALID [2022-04-14 15:16:21,114 INFO L290 TraceCheckUtils]: 2: Hoare triple {554#(<= ~counter~0 0)} assume true; {554#(<= ~counter~0 0)} is VALID [2022-04-14 15:16:21,115 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {554#(<= ~counter~0 0)} {546#true} #102#return; {554#(<= ~counter~0 0)} is VALID [2022-04-14 15:16:21,115 INFO L272 TraceCheckUtils]: 4: Hoare triple {554#(<= ~counter~0 0)} call #t~ret7 := main(); {554#(<= ~counter~0 0)} is VALID [2022-04-14 15:16:21,116 INFO L290 TraceCheckUtils]: 5: Hoare triple {554#(<= ~counter~0 0)} havoc ~n~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~h~0;~n~0 := #t~nondet4;havoc #t~nondet4; {554#(<= ~counter~0 0)} is VALID [2022-04-14 15:16:21,116 INFO L272 TraceCheckUtils]: 6: Hoare triple {554#(<= ~counter~0 0)} call assume_abort_if_not((if ~n~0 % 4294967296 < 1073741823 then 1 else 0)); {554#(<= ~counter~0 0)} is VALID [2022-04-14 15:16:21,117 INFO L290 TraceCheckUtils]: 7: Hoare triple {554#(<= ~counter~0 0)} ~cond := #in~cond; {554#(<= ~counter~0 0)} is VALID [2022-04-14 15:16:21,117 INFO L290 TraceCheckUtils]: 8: Hoare triple {554#(<= ~counter~0 0)} assume !(0 == ~cond); {554#(<= ~counter~0 0)} is VALID [2022-04-14 15:16:21,118 INFO L290 TraceCheckUtils]: 9: Hoare triple {554#(<= ~counter~0 0)} assume true; {554#(<= ~counter~0 0)} is VALID [2022-04-14 15:16:21,118 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {554#(<= ~counter~0 0)} {554#(<= ~counter~0 0)} #82#return; {554#(<= ~counter~0 0)} is VALID [2022-04-14 15:16:21,118 INFO L290 TraceCheckUtils]: 11: Hoare triple {554#(<= ~counter~0 0)} ~p~0 := 0;~q~0 := 1;~r~0 := ~n~0;~h~0 := 0; {554#(<= ~counter~0 0)} is VALID [2022-04-14 15:16:21,119 INFO L290 TraceCheckUtils]: 12: Hoare triple {554#(<= ~counter~0 0)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {588#(<= ~counter~0 1)} is VALID [2022-04-14 15:16:21,120 INFO L290 TraceCheckUtils]: 13: Hoare triple {588#(<= ~counter~0 1)} assume !!(#t~post5 < 50);havoc #t~post5; {588#(<= ~counter~0 1)} is VALID [2022-04-14 15:16:21,120 INFO L290 TraceCheckUtils]: 14: Hoare triple {588#(<= ~counter~0 1)} assume !(~q~0 % 4294967296 <= ~n~0 % 4294967296); {588#(<= ~counter~0 1)} is VALID [2022-04-14 15:16:21,120 INFO L290 TraceCheckUtils]: 15: Hoare triple {588#(<= ~counter~0 1)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {598#(<= |main_#t~post6| 1)} is VALID [2022-04-14 15:16:21,121 INFO L290 TraceCheckUtils]: 16: Hoare triple {598#(<= |main_#t~post6| 1)} assume !(#t~post6 < 50);havoc #t~post6; {547#false} is VALID [2022-04-14 15:16:21,121 INFO L272 TraceCheckUtils]: 17: Hoare triple {547#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)); {547#false} is VALID [2022-04-14 15:16:21,121 INFO L290 TraceCheckUtils]: 18: Hoare triple {547#false} ~cond := #in~cond; {547#false} is VALID [2022-04-14 15:16:21,121 INFO L290 TraceCheckUtils]: 19: Hoare triple {547#false} assume 0 == ~cond; {547#false} is VALID [2022-04-14 15:16:21,122 INFO L290 TraceCheckUtils]: 20: Hoare triple {547#false} assume !false; {547#false} is VALID [2022-04-14 15:16:21,122 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-14 15:16:21,122 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-14 15:16:21,122 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 15:16:21,122 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1534471575] [2022-04-14 15:16:21,122 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-14 15:16:21,122 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1052287078] [2022-04-14 15:16:21,123 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1052287078] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-14 15:16:21,123 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-14 15:16:21,123 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-14 15:16:21,123 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1274250215] [2022-04-14 15:16:21,123 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-14 15:16:21,124 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 21 [2022-04-14 15:16:21,124 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 15:16:21,124 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-14 15:16:21,139 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-14 15:16:21,139 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-14 15:16:21,139 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 15:16:21,140 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-14 15:16:21,140 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-04-14 15:16:21,140 INFO L87 Difference]: Start difference. First operand 36 states and 48 transitions. Second operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-14 15:16:26,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 15:16:26,640 INFO L93 Difference]: Finished difference Result 49 states and 64 transitions. [2022-04-14 15:16:26,640 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-14 15:16:26,641 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 21 [2022-04-14 15:16:26,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-14 15:16:26,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-14 15:16:26,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 64 transitions. [2022-04-14 15:16:26,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-14 15:16:26,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 64 transitions. [2022-04-14 15:16:26,645 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 64 transitions. [2022-04-14 15:16:26,705 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 64 edges. 64 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 15:16:26,707 INFO L225 Difference]: With dead ends: 49 [2022-04-14 15:16:26,707 INFO L226 Difference]: Without dead ends: 40 [2022-04-14 15:16:26,707 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-04-14 15:16:26,708 INFO L913 BasicCegarLoop]: 43 mSDtfsCounter, 7 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 120 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-14 15:16:26,709 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [7 Valid, 120 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-14 15:16:26,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2022-04-14 15:16:26,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 39. [2022-04-14 15:16:26,716 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-14 15:16:26,716 INFO L82 GeneralOperation]: Start isEquivalent. First operand 40 states. Second operand has 39 states, 23 states have (on average 1.3043478260869565) internal successors, (30), 24 states have internal predecessors, (30), 12 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-14 15:16:26,717 INFO L74 IsIncluded]: Start isIncluded. First operand 40 states. Second operand has 39 states, 23 states have (on average 1.3043478260869565) internal successors, (30), 24 states have internal predecessors, (30), 12 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-14 15:16:26,717 INFO L87 Difference]: Start difference. First operand 40 states. Second operand has 39 states, 23 states have (on average 1.3043478260869565) internal successors, (30), 24 states have internal predecessors, (30), 12 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-14 15:16:26,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 15:16:26,720 INFO L93 Difference]: Finished difference Result 40 states and 53 transitions. [2022-04-14 15:16:26,720 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 53 transitions. [2022-04-14 15:16:26,721 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 15:16:26,721 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 15:16:26,721 INFO L74 IsIncluded]: Start isIncluded. First operand has 39 states, 23 states have (on average 1.3043478260869565) internal successors, (30), 24 states have internal predecessors, (30), 12 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand 40 states. [2022-04-14 15:16:26,721 INFO L87 Difference]: Start difference. First operand has 39 states, 23 states have (on average 1.3043478260869565) internal successors, (30), 24 states have internal predecessors, (30), 12 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand 40 states. [2022-04-14 15:16:26,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 15:16:26,724 INFO L93 Difference]: Finished difference Result 40 states and 53 transitions. [2022-04-14 15:16:26,724 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 53 transitions. [2022-04-14 15:16:26,725 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 15:16:26,725 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 15:16:26,725 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-14 15:16:26,725 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-14 15:16:26,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 23 states have (on average 1.3043478260869565) internal successors, (30), 24 states have internal predecessors, (30), 12 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-14 15:16:26,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 52 transitions. [2022-04-14 15:16:26,727 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 52 transitions. Word has length 21 [2022-04-14 15:16:26,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-14 15:16:26,727 INFO L478 AbstractCegarLoop]: Abstraction has 39 states and 52 transitions. [2022-04-14 15:16:26,728 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-14 15:16:26,728 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 52 transitions. [2022-04-14 15:16:26,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-04-14 15:16:26,728 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 15:16:26,728 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-14 15:16:26,759 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-14 15:16:26,946 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2022-04-14 15:16:26,946 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 15:16:26,947 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 15:16:26,947 INFO L85 PathProgramCache]: Analyzing trace with hash 963589341, now seen corresponding path program 1 times [2022-04-14 15:16:26,947 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 15:16:26,947 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2082399681] [2022-04-14 15:16:26,947 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 15:16:26,947 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 15:16:26,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 15:16:27,182 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-14 15:16:27,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 15:16:27,209 INFO L290 TraceCheckUtils]: 0: Hoare triple {835#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {822#true} is VALID [2022-04-14 15:16:27,210 INFO L290 TraceCheckUtils]: 1: Hoare triple {822#true} assume true; {822#true} is VALID [2022-04-14 15:16:27,210 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {822#true} {822#true} #102#return; {822#true} is VALID [2022-04-14 15:16:27,210 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-14 15:16:27,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 15:16:27,215 INFO L290 TraceCheckUtils]: 0: Hoare triple {822#true} ~cond := #in~cond; {822#true} is VALID [2022-04-14 15:16:27,216 INFO L290 TraceCheckUtils]: 1: Hoare triple {822#true} assume !(0 == ~cond); {822#true} is VALID [2022-04-14 15:16:27,216 INFO L290 TraceCheckUtils]: 2: Hoare triple {822#true} assume true; {822#true} is VALID [2022-04-14 15:16:27,216 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {822#true} {822#true} #82#return; {822#true} is VALID [2022-04-14 15:16:27,217 INFO L272 TraceCheckUtils]: 0: Hoare triple {822#true} call ULTIMATE.init(); {835#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-14 15:16:27,217 INFO L290 TraceCheckUtils]: 1: Hoare triple {835#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {822#true} is VALID [2022-04-14 15:16:27,217 INFO L290 TraceCheckUtils]: 2: Hoare triple {822#true} assume true; {822#true} is VALID [2022-04-14 15:16:27,217 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {822#true} {822#true} #102#return; {822#true} is VALID [2022-04-14 15:16:27,217 INFO L272 TraceCheckUtils]: 4: Hoare triple {822#true} call #t~ret7 := main(); {822#true} is VALID [2022-04-14 15:16:27,218 INFO L290 TraceCheckUtils]: 5: Hoare triple {822#true} havoc ~n~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~h~0;~n~0 := #t~nondet4;havoc #t~nondet4; {822#true} is VALID [2022-04-14 15:16:27,218 INFO L272 TraceCheckUtils]: 6: Hoare triple {822#true} call assume_abort_if_not((if ~n~0 % 4294967296 < 1073741823 then 1 else 0)); {822#true} is VALID [2022-04-14 15:16:27,218 INFO L290 TraceCheckUtils]: 7: Hoare triple {822#true} ~cond := #in~cond; {822#true} is VALID [2022-04-14 15:16:27,218 INFO L290 TraceCheckUtils]: 8: Hoare triple {822#true} assume !(0 == ~cond); {822#true} is VALID [2022-04-14 15:16:27,218 INFO L290 TraceCheckUtils]: 9: Hoare triple {822#true} assume true; {822#true} is VALID [2022-04-14 15:16:27,218 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {822#true} {822#true} #82#return; {822#true} is VALID [2022-04-14 15:16:27,223 INFO L290 TraceCheckUtils]: 11: Hoare triple {822#true} ~p~0 := 0;~q~0 := 1;~r~0 := ~n~0;~h~0 := 0; {831#(and (= main_~p~0 0) (= main_~n~0 main_~r~0) (= main_~q~0 1))} is VALID [2022-04-14 15:16:27,223 INFO L290 TraceCheckUtils]: 12: Hoare triple {831#(and (= main_~p~0 0) (= main_~n~0 main_~r~0) (= main_~q~0 1))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {831#(and (= main_~p~0 0) (= main_~n~0 main_~r~0) (= main_~q~0 1))} is VALID [2022-04-14 15:16:27,224 INFO L290 TraceCheckUtils]: 13: Hoare triple {831#(and (= main_~p~0 0) (= main_~n~0 main_~r~0) (= main_~q~0 1))} assume !!(#t~post5 < 50);havoc #t~post5; {831#(and (= main_~p~0 0) (= main_~n~0 main_~r~0) (= main_~q~0 1))} is VALID [2022-04-14 15:16:27,225 INFO L290 TraceCheckUtils]: 14: Hoare triple {831#(and (= main_~p~0 0) (= main_~n~0 main_~r~0) (= main_~q~0 1))} assume !(~q~0 % 4294967296 <= ~n~0 % 4294967296); {832#(and (<= (+ (* (div (+ (* main_~p~0 2) main_~q~0) 4294967296) 4294967296) main_~r~0 1) (+ main_~q~0 (* (div main_~r~0 4294967296) 4294967296))) (= main_~p~0 0) (= (+ (- 1) main_~q~0) 0))} is VALID [2022-04-14 15:16:27,226 INFO L290 TraceCheckUtils]: 15: Hoare triple {832#(and (<= (+ (* (div (+ (* main_~p~0 2) main_~q~0) 4294967296) 4294967296) main_~r~0 1) (+ main_~q~0 (* (div main_~r~0 4294967296) 4294967296))) (= main_~p~0 0) (= (+ (- 1) main_~q~0) 0))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {832#(and (<= (+ (* (div (+ (* main_~p~0 2) main_~q~0) 4294967296) 4294967296) main_~r~0 1) (+ main_~q~0 (* (div main_~r~0 4294967296) 4294967296))) (= main_~p~0 0) (= (+ (- 1) main_~q~0) 0))} is VALID [2022-04-14 15:16:27,227 INFO L290 TraceCheckUtils]: 16: Hoare triple {832#(and (<= (+ (* (div (+ (* main_~p~0 2) main_~q~0) 4294967296) 4294967296) main_~r~0 1) (+ main_~q~0 (* (div main_~r~0 4294967296) 4294967296))) (= main_~p~0 0) (= (+ (- 1) main_~q~0) 0))} assume !!(#t~post6 < 50);havoc #t~post6; {832#(and (<= (+ (* (div (+ (* main_~p~0 2) main_~q~0) 4294967296) 4294967296) main_~r~0 1) (+ main_~q~0 (* (div main_~r~0 4294967296) 4294967296))) (= main_~p~0 0) (= (+ (- 1) main_~q~0) 0))} is VALID [2022-04-14 15:16:27,228 INFO L272 TraceCheckUtils]: 17: Hoare triple {832#(and (<= (+ (* (div (+ (* main_~p~0 2) main_~q~0) 4294967296) 4294967296) main_~r~0 1) (+ main_~q~0 (* (div main_~r~0 4294967296) 4294967296))) (= main_~p~0 0) (= (+ (- 1) main_~q~0) 0))} call __VERIFIER_assert((if ~r~0 % 4294967296 < (2 * ~p~0 + ~q~0) % 4294967296 then 1 else 0)); {833#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-14 15:16:27,229 INFO L290 TraceCheckUtils]: 18: Hoare triple {833#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {834#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-14 15:16:27,229 INFO L290 TraceCheckUtils]: 19: Hoare triple {834#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {823#false} is VALID [2022-04-14 15:16:27,229 INFO L290 TraceCheckUtils]: 20: Hoare triple {823#false} assume !false; {823#false} is VALID [2022-04-14 15:16:27,229 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-14 15:16:27,230 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 15:16:27,230 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2082399681] [2022-04-14 15:16:27,230 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2082399681] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-14 15:16:27,230 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-14 15:16:27,230 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-14 15:16:27,230 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1495608621] [2022-04-14 15:16:27,230 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-14 15:16:27,231 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 5 states have internal predecessors, (15), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 21 [2022-04-14 15:16:27,231 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 15:16:27,231 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 5 states have internal predecessors, (15), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-14 15:16:27,251 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-14 15:16:27,251 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-14 15:16:27,252 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 15:16:27,252 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-14 15:16:27,252 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-04-14 15:16:27,253 INFO L87 Difference]: Start difference. First operand 39 states and 52 transitions. Second operand has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 5 states have internal predecessors, (15), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-14 15:16:39,924 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-14 15:16:42,674 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-14 15:16:46,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 15:16:46,350 INFO L93 Difference]: Finished difference Result 72 states and 104 transitions. [2022-04-14 15:16:46,350 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-14 15:16:46,351 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 5 states have internal predecessors, (15), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 21 [2022-04-14 15:16:46,351 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-14 15:16:46,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 5 states have internal predecessors, (15), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-14 15:16:46,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 104 transitions. [2022-04-14 15:16:46,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 5 states have internal predecessors, (15), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-14 15:16:46,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 104 transitions. [2022-04-14 15:16:46,357 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 104 transitions. [2022-04-14 15:16:46,609 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 104 edges. 104 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 15:16:46,611 INFO L225 Difference]: With dead ends: 72 [2022-04-14 15:16:46,611 INFO L226 Difference]: Without dead ends: 51 [2022-04-14 15:16:46,612 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2022-04-14 15:16:46,613 INFO L913 BasicCegarLoop]: 49 mSDtfsCounter, 24 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 207 mSolverCounterSat, 37 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 11.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 107 SdHoareTripleChecker+Invalid, 246 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 207 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 11.7s IncrementalHoareTripleChecker+Time [2022-04-14 15:16:46,613 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [25 Valid, 107 Invalid, 246 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 207 Invalid, 2 Unknown, 0 Unchecked, 11.7s Time] [2022-04-14 15:16:46,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2022-04-14 15:16:46,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2022-04-14 15:16:46,629 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-14 15:16:46,629 INFO L82 GeneralOperation]: Start isEquivalent. First operand 51 states. Second operand has 51 states, 27 states have (on average 1.2592592592592593) internal successors, (34), 29 states have internal predecessors, (34), 19 states have call successors, (19), 5 states have call predecessors, (19), 4 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-14 15:16:46,629 INFO L74 IsIncluded]: Start isIncluded. First operand 51 states. Second operand has 51 states, 27 states have (on average 1.2592592592592593) internal successors, (34), 29 states have internal predecessors, (34), 19 states have call successors, (19), 5 states have call predecessors, (19), 4 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-14 15:16:46,630 INFO L87 Difference]: Start difference. First operand 51 states. Second operand has 51 states, 27 states have (on average 1.2592592592592593) internal successors, (34), 29 states have internal predecessors, (34), 19 states have call successors, (19), 5 states have call predecessors, (19), 4 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-14 15:16:46,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 15:16:46,633 INFO L93 Difference]: Finished difference Result 51 states and 69 transitions. [2022-04-14 15:16:46,633 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 69 transitions. [2022-04-14 15:16:46,634 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 15:16:46,634 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 15:16:46,634 INFO L74 IsIncluded]: Start isIncluded. First operand has 51 states, 27 states have (on average 1.2592592592592593) internal successors, (34), 29 states have internal predecessors, (34), 19 states have call successors, (19), 5 states have call predecessors, (19), 4 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) Second operand 51 states. [2022-04-14 15:16:46,634 INFO L87 Difference]: Start difference. First operand has 51 states, 27 states have (on average 1.2592592592592593) internal successors, (34), 29 states have internal predecessors, (34), 19 states have call successors, (19), 5 states have call predecessors, (19), 4 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) Second operand 51 states. [2022-04-14 15:16:46,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 15:16:46,637 INFO L93 Difference]: Finished difference Result 51 states and 69 transitions. [2022-04-14 15:16:46,637 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 69 transitions. [2022-04-14 15:16:46,638 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 15:16:46,638 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 15:16:46,638 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-14 15:16:46,638 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-14 15:16:46,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 27 states have (on average 1.2592592592592593) internal successors, (34), 29 states have internal predecessors, (34), 19 states have call successors, (19), 5 states have call predecessors, (19), 4 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-14 15:16:46,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 69 transitions. [2022-04-14 15:16:46,641 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 69 transitions. Word has length 21 [2022-04-14 15:16:46,641 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-14 15:16:46,641 INFO L478 AbstractCegarLoop]: Abstraction has 51 states and 69 transitions. [2022-04-14 15:16:46,641 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 5 states have internal predecessors, (15), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-14 15:16:46,641 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 69 transitions. [2022-04-14 15:16:46,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-04-14 15:16:46,642 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 15:16:46,642 INFO L499 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-14 15:16:46,642 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-04-14 15:16:46,642 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 15:16:46,642 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 15:16:46,643 INFO L85 PathProgramCache]: Analyzing trace with hash -1701877900, now seen corresponding path program 1 times [2022-04-14 15:16:46,643 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 15:16:46,643 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1212511121] [2022-04-14 15:16:46,643 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 15:16:46,643 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 15:16:46,654 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-14 15:16:46,654 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1213864672] [2022-04-14 15:16:46,654 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 15:16:46,654 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-14 15:16:46,655 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-14 15:16:46,655 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-14 15:16:46,670 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-14 15:16:46,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 15:16:46,707 INFO L263 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-14 15:16:46,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 15:16:46,731 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-14 15:16:46,872 INFO L272 TraceCheckUtils]: 0: Hoare triple {1137#true} call ULTIMATE.init(); {1137#true} is VALID [2022-04-14 15:16:46,875 INFO L290 TraceCheckUtils]: 1: Hoare triple {1137#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);~counter~0 := 0; {1145#(<= ~counter~0 0)} is VALID [2022-04-14 15:16:46,878 INFO L290 TraceCheckUtils]: 2: Hoare triple {1145#(<= ~counter~0 0)} assume true; {1145#(<= ~counter~0 0)} is VALID [2022-04-14 15:16:46,878 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1145#(<= ~counter~0 0)} {1137#true} #102#return; {1145#(<= ~counter~0 0)} is VALID [2022-04-14 15:16:46,879 INFO L272 TraceCheckUtils]: 4: Hoare triple {1145#(<= ~counter~0 0)} call #t~ret7 := main(); {1145#(<= ~counter~0 0)} is VALID [2022-04-14 15:16:46,879 INFO L290 TraceCheckUtils]: 5: Hoare triple {1145#(<= ~counter~0 0)} havoc ~n~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~h~0;~n~0 := #t~nondet4;havoc #t~nondet4; {1145#(<= ~counter~0 0)} is VALID [2022-04-14 15:16:46,880 INFO L272 TraceCheckUtils]: 6: Hoare triple {1145#(<= ~counter~0 0)} call assume_abort_if_not((if ~n~0 % 4294967296 < 1073741823 then 1 else 0)); {1145#(<= ~counter~0 0)} is VALID [2022-04-14 15:16:46,880 INFO L290 TraceCheckUtils]: 7: Hoare triple {1145#(<= ~counter~0 0)} ~cond := #in~cond; {1145#(<= ~counter~0 0)} is VALID [2022-04-14 15:16:46,883 INFO L290 TraceCheckUtils]: 8: Hoare triple {1145#(<= ~counter~0 0)} assume !(0 == ~cond); {1145#(<= ~counter~0 0)} is VALID [2022-04-14 15:16:46,883 INFO L290 TraceCheckUtils]: 9: Hoare triple {1145#(<= ~counter~0 0)} assume true; {1145#(<= ~counter~0 0)} is VALID [2022-04-14 15:16:46,884 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1145#(<= ~counter~0 0)} {1145#(<= ~counter~0 0)} #82#return; {1145#(<= ~counter~0 0)} is VALID [2022-04-14 15:16:46,884 INFO L290 TraceCheckUtils]: 11: Hoare triple {1145#(<= ~counter~0 0)} ~p~0 := 0;~q~0 := 1;~r~0 := ~n~0;~h~0 := 0; {1145#(<= ~counter~0 0)} is VALID [2022-04-14 15:16:46,885 INFO L290 TraceCheckUtils]: 12: Hoare triple {1145#(<= ~counter~0 0)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {1179#(<= ~counter~0 1)} is VALID [2022-04-14 15:16:46,885 INFO L290 TraceCheckUtils]: 13: Hoare triple {1179#(<= ~counter~0 1)} assume !!(#t~post5 < 50);havoc #t~post5; {1179#(<= ~counter~0 1)} is VALID [2022-04-14 15:16:46,885 INFO L290 TraceCheckUtils]: 14: Hoare triple {1179#(<= ~counter~0 1)} assume !!(~q~0 % 4294967296 <= ~n~0 % 4294967296);~q~0 := 4 * ~q~0; {1179#(<= ~counter~0 1)} is VALID [2022-04-14 15:16:46,886 INFO L290 TraceCheckUtils]: 15: Hoare triple {1179#(<= ~counter~0 1)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {1189#(<= |main_#t~post5| 1)} is VALID [2022-04-14 15:16:46,887 INFO L290 TraceCheckUtils]: 16: Hoare triple {1189#(<= |main_#t~post5| 1)} assume !(#t~post5 < 50);havoc #t~post5; {1138#false} is VALID [2022-04-14 15:16:46,887 INFO L290 TraceCheckUtils]: 17: Hoare triple {1138#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {1138#false} is VALID [2022-04-14 15:16:46,887 INFO L290 TraceCheckUtils]: 18: Hoare triple {1138#false} assume !(#t~post6 < 50);havoc #t~post6; {1138#false} is VALID [2022-04-14 15:16:46,887 INFO L272 TraceCheckUtils]: 19: Hoare triple {1138#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)); {1138#false} is VALID [2022-04-14 15:16:46,887 INFO L290 TraceCheckUtils]: 20: Hoare triple {1138#false} ~cond := #in~cond; {1138#false} is VALID [2022-04-14 15:16:46,888 INFO L290 TraceCheckUtils]: 21: Hoare triple {1138#false} assume 0 == ~cond; {1138#false} is VALID [2022-04-14 15:16:46,888 INFO L290 TraceCheckUtils]: 22: Hoare triple {1138#false} assume !false; {1138#false} is VALID [2022-04-14 15:16:46,888 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-14 15:16:46,888 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-14 15:16:47,063 INFO L290 TraceCheckUtils]: 22: Hoare triple {1138#false} assume !false; {1138#false} is VALID [2022-04-14 15:16:47,064 INFO L290 TraceCheckUtils]: 21: Hoare triple {1138#false} assume 0 == ~cond; {1138#false} is VALID [2022-04-14 15:16:47,064 INFO L290 TraceCheckUtils]: 20: Hoare triple {1138#false} ~cond := #in~cond; {1138#false} is VALID [2022-04-14 15:16:47,064 INFO L272 TraceCheckUtils]: 19: Hoare triple {1138#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)); {1138#false} is VALID [2022-04-14 15:16:47,064 INFO L290 TraceCheckUtils]: 18: Hoare triple {1138#false} assume !(#t~post6 < 50);havoc #t~post6; {1138#false} is VALID [2022-04-14 15:16:47,064 INFO L290 TraceCheckUtils]: 17: Hoare triple {1138#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {1138#false} is VALID [2022-04-14 15:16:47,075 INFO L290 TraceCheckUtils]: 16: Hoare triple {1229#(< |main_#t~post5| 50)} assume !(#t~post5 < 50);havoc #t~post5; {1138#false} is VALID [2022-04-14 15:16:47,076 INFO L290 TraceCheckUtils]: 15: Hoare triple {1233#(< ~counter~0 50)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {1229#(< |main_#t~post5| 50)} is VALID [2022-04-14 15:16:47,076 INFO L290 TraceCheckUtils]: 14: Hoare triple {1233#(< ~counter~0 50)} assume !!(~q~0 % 4294967296 <= ~n~0 % 4294967296);~q~0 := 4 * ~q~0; {1233#(< ~counter~0 50)} is VALID [2022-04-14 15:16:47,079 INFO L290 TraceCheckUtils]: 13: Hoare triple {1233#(< ~counter~0 50)} assume !!(#t~post5 < 50);havoc #t~post5; {1233#(< ~counter~0 50)} is VALID [2022-04-14 15:16:47,080 INFO L290 TraceCheckUtils]: 12: Hoare triple {1243#(< ~counter~0 49)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {1233#(< ~counter~0 50)} is VALID [2022-04-14 15:16:47,080 INFO L290 TraceCheckUtils]: 11: Hoare triple {1243#(< ~counter~0 49)} ~p~0 := 0;~q~0 := 1;~r~0 := ~n~0;~h~0 := 0; {1243#(< ~counter~0 49)} is VALID [2022-04-14 15:16:47,081 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1137#true} {1243#(< ~counter~0 49)} #82#return; {1243#(< ~counter~0 49)} is VALID [2022-04-14 15:16:47,081 INFO L290 TraceCheckUtils]: 9: Hoare triple {1137#true} assume true; {1137#true} is VALID [2022-04-14 15:16:47,081 INFO L290 TraceCheckUtils]: 8: Hoare triple {1137#true} assume !(0 == ~cond); {1137#true} is VALID [2022-04-14 15:16:47,081 INFO L290 TraceCheckUtils]: 7: Hoare triple {1137#true} ~cond := #in~cond; {1137#true} is VALID [2022-04-14 15:16:47,081 INFO L272 TraceCheckUtils]: 6: Hoare triple {1243#(< ~counter~0 49)} call assume_abort_if_not((if ~n~0 % 4294967296 < 1073741823 then 1 else 0)); {1137#true} is VALID [2022-04-14 15:16:47,082 INFO L290 TraceCheckUtils]: 5: Hoare triple {1243#(< ~counter~0 49)} havoc ~n~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~h~0;~n~0 := #t~nondet4;havoc #t~nondet4; {1243#(< ~counter~0 49)} is VALID [2022-04-14 15:16:47,082 INFO L272 TraceCheckUtils]: 4: Hoare triple {1243#(< ~counter~0 49)} call #t~ret7 := main(); {1243#(< ~counter~0 49)} is VALID [2022-04-14 15:16:47,083 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1243#(< ~counter~0 49)} {1137#true} #102#return; {1243#(< ~counter~0 49)} is VALID [2022-04-14 15:16:47,083 INFO L290 TraceCheckUtils]: 2: Hoare triple {1243#(< ~counter~0 49)} assume true; {1243#(< ~counter~0 49)} is VALID [2022-04-14 15:16:47,084 INFO L290 TraceCheckUtils]: 1: Hoare triple {1137#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);~counter~0 := 0; {1243#(< ~counter~0 49)} is VALID [2022-04-14 15:16:47,084 INFO L272 TraceCheckUtils]: 0: Hoare triple {1137#true} call ULTIMATE.init(); {1137#true} is VALID [2022-04-14 15:16:47,084 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-14 15:16:47,084 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 15:16:47,084 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1212511121] [2022-04-14 15:16:47,084 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-14 15:16:47,084 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1213864672] [2022-04-14 15:16:47,085 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1213864672] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-14 15:16:47,085 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-14 15:16:47,085 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2022-04-14 15:16:47,085 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1481333163] [2022-04-14 15:16:47,085 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-14 15:16:47,085 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.625) internal successors, (29), 8 states have internal predecessors, (29), 4 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) Word has length 23 [2022-04-14 15:16:47,086 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 15:16:47,086 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 3.625) internal successors, (29), 8 states have internal predecessors, (29), 4 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) [2022-04-14 15:16:47,115 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 39 edges. 39 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 15:16:47,115 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-14 15:16:47,115 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 15:16:47,116 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-14 15:16:47,116 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2022-04-14 15:16:47,116 INFO L87 Difference]: Start difference. First operand 51 states and 69 transitions. Second operand has 8 states, 8 states have (on average 3.625) internal successors, (29), 8 states have internal predecessors, (29), 4 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) [2022-04-14 15:16:51,304 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-14 15:16:53,338 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-14 15:17:08,141 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.95s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-14 15:17:16,909 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-14 15:17:18,393 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.06s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-14 15:17:20,396 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-14 15:17:27,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 15:17:27,608 INFO L93 Difference]: Finished difference Result 108 states and 149 transitions. [2022-04-14 15:17:27,608 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-04-14 15:17:27,608 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.625) internal successors, (29), 8 states have internal predecessors, (29), 4 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) Word has length 23 [2022-04-14 15:17:27,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-14 15:17:27,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 3.625) internal successors, (29), 8 states have internal predecessors, (29), 4 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) [2022-04-14 15:17:27,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 139 transitions. [2022-04-14 15:17:27,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 3.625) internal successors, (29), 8 states have internal predecessors, (29), 4 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) [2022-04-14 15:17:27,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 139 transitions. [2022-04-14 15:17:27,614 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 10 states and 139 transitions. [2022-04-14 15:17:27,746 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 139 edges. 139 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 15:17:27,749 INFO L225 Difference]: With dead ends: 108 [2022-04-14 15:17:27,749 INFO L226 Difference]: Without dead ends: 89 [2022-04-14 15:17:27,749 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2022-04-14 15:17:27,752 INFO L913 BasicCegarLoop]: 58 mSDtfsCounter, 66 mSDsluCounter, 189 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 25 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 13.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 247 SdHoareTripleChecker+Invalid, 110 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 13.9s IncrementalHoareTripleChecker+Time [2022-04-14 15:17:27,752 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [66 Valid, 247 Invalid, 110 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 81 Invalid, 4 Unknown, 0 Unchecked, 13.9s Time] [2022-04-14 15:17:27,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2022-04-14 15:17:27,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 67. [2022-04-14 15:17:27,776 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-14 15:17:27,777 INFO L82 GeneralOperation]: Start isEquivalent. First operand 89 states. Second operand has 67 states, 41 states have (on average 1.2439024390243902) internal successors, (51), 43 states have internal predecessors, (51), 19 states have call successors, (19), 7 states have call predecessors, (19), 6 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-14 15:17:27,777 INFO L74 IsIncluded]: Start isIncluded. First operand 89 states. Second operand has 67 states, 41 states have (on average 1.2439024390243902) internal successors, (51), 43 states have internal predecessors, (51), 19 states have call successors, (19), 7 states have call predecessors, (19), 6 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-14 15:17:27,777 INFO L87 Difference]: Start difference. First operand 89 states. Second operand has 67 states, 41 states have (on average 1.2439024390243902) internal successors, (51), 43 states have internal predecessors, (51), 19 states have call successors, (19), 7 states have call predecessors, (19), 6 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-14 15:17:27,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 15:17:27,782 INFO L93 Difference]: Finished difference Result 89 states and 117 transitions. [2022-04-14 15:17:27,782 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 117 transitions. [2022-04-14 15:17:27,783 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 15:17:27,783 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 15:17:27,783 INFO L74 IsIncluded]: Start isIncluded. First operand has 67 states, 41 states have (on average 1.2439024390243902) internal successors, (51), 43 states have internal predecessors, (51), 19 states have call successors, (19), 7 states have call predecessors, (19), 6 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) Second operand 89 states. [2022-04-14 15:17:27,783 INFO L87 Difference]: Start difference. First operand has 67 states, 41 states have (on average 1.2439024390243902) internal successors, (51), 43 states have internal predecessors, (51), 19 states have call successors, (19), 7 states have call predecessors, (19), 6 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) Second operand 89 states. [2022-04-14 15:17:27,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 15:17:27,788 INFO L93 Difference]: Finished difference Result 89 states and 117 transitions. [2022-04-14 15:17:27,788 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 117 transitions. [2022-04-14 15:17:27,788 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 15:17:27,788 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 15:17:27,788 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-14 15:17:27,788 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-14 15:17:27,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 41 states have (on average 1.2439024390243902) internal successors, (51), 43 states have internal predecessors, (51), 19 states have call successors, (19), 7 states have call predecessors, (19), 6 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-14 15:17:27,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 86 transitions. [2022-04-14 15:17:27,792 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 86 transitions. Word has length 23 [2022-04-14 15:17:27,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-14 15:17:27,792 INFO L478 AbstractCegarLoop]: Abstraction has 67 states and 86 transitions. [2022-04-14 15:17:27,792 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.625) internal successors, (29), 8 states have internal predecessors, (29), 4 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) [2022-04-14 15:17:27,792 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 86 transitions. [2022-04-14 15:17:27,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-04-14 15:17:27,793 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 15:17:27,793 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-14 15:17:27,822 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-14 15:17:28,016 WARN L460 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-14 15:17:28,017 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 15:17:28,017 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 15:17:28,017 INFO L85 PathProgramCache]: Analyzing trace with hash -1564262277, now seen corresponding path program 1 times [2022-04-14 15:17:28,017 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 15:17:28,017 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1393328592] [2022-04-14 15:17:28,017 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 15:17:28,017 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 15:17:28,036 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-14 15:17:28,036 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1277628540] [2022-04-14 15:17:28,036 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 15:17:28,037 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-14 15:17:28,037 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-14 15:17:28,041 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-14 15:17:28,059 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-14 15:17:28,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 15:17:28,084 INFO L263 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-14 15:17:28,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 15:17:28,094 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-14 15:17:28,264 INFO L272 TraceCheckUtils]: 0: Hoare triple {1723#true} call ULTIMATE.init(); {1723#true} is VALID [2022-04-14 15:17:28,265 INFO L290 TraceCheckUtils]: 1: Hoare triple {1723#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);~counter~0 := 0; {1731#(<= ~counter~0 0)} is VALID [2022-04-14 15:17:28,265 INFO L290 TraceCheckUtils]: 2: Hoare triple {1731#(<= ~counter~0 0)} assume true; {1731#(<= ~counter~0 0)} is VALID [2022-04-14 15:17:28,265 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1731#(<= ~counter~0 0)} {1723#true} #102#return; {1731#(<= ~counter~0 0)} is VALID [2022-04-14 15:17:28,266 INFO L272 TraceCheckUtils]: 4: Hoare triple {1731#(<= ~counter~0 0)} call #t~ret7 := main(); {1731#(<= ~counter~0 0)} is VALID [2022-04-14 15:17:28,266 INFO L290 TraceCheckUtils]: 5: Hoare triple {1731#(<= ~counter~0 0)} havoc ~n~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~h~0;~n~0 := #t~nondet4;havoc #t~nondet4; {1731#(<= ~counter~0 0)} is VALID [2022-04-14 15:17:28,266 INFO L272 TraceCheckUtils]: 6: Hoare triple {1731#(<= ~counter~0 0)} call assume_abort_if_not((if ~n~0 % 4294967296 < 1073741823 then 1 else 0)); {1731#(<= ~counter~0 0)} is VALID [2022-04-14 15:17:28,267 INFO L290 TraceCheckUtils]: 7: Hoare triple {1731#(<= ~counter~0 0)} ~cond := #in~cond; {1731#(<= ~counter~0 0)} is VALID [2022-04-14 15:17:28,267 INFO L290 TraceCheckUtils]: 8: Hoare triple {1731#(<= ~counter~0 0)} assume !(0 == ~cond); {1731#(<= ~counter~0 0)} is VALID [2022-04-14 15:17:28,267 INFO L290 TraceCheckUtils]: 9: Hoare triple {1731#(<= ~counter~0 0)} assume true; {1731#(<= ~counter~0 0)} is VALID [2022-04-14 15:17:28,268 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1731#(<= ~counter~0 0)} {1731#(<= ~counter~0 0)} #82#return; {1731#(<= ~counter~0 0)} is VALID [2022-04-14 15:17:28,268 INFO L290 TraceCheckUtils]: 11: Hoare triple {1731#(<= ~counter~0 0)} ~p~0 := 0;~q~0 := 1;~r~0 := ~n~0;~h~0 := 0; {1731#(<= ~counter~0 0)} is VALID [2022-04-14 15:17:28,268 INFO L290 TraceCheckUtils]: 12: Hoare triple {1731#(<= ~counter~0 0)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {1765#(<= ~counter~0 1)} is VALID [2022-04-14 15:17:28,269 INFO L290 TraceCheckUtils]: 13: Hoare triple {1765#(<= ~counter~0 1)} assume !!(#t~post5 < 50);havoc #t~post5; {1765#(<= ~counter~0 1)} is VALID [2022-04-14 15:17:28,269 INFO L290 TraceCheckUtils]: 14: Hoare triple {1765#(<= ~counter~0 1)} assume !!(~q~0 % 4294967296 <= ~n~0 % 4294967296);~q~0 := 4 * ~q~0; {1765#(<= ~counter~0 1)} is VALID [2022-04-14 15:17:28,270 INFO L290 TraceCheckUtils]: 15: Hoare triple {1765#(<= ~counter~0 1)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {1775#(<= ~counter~0 2)} is VALID [2022-04-14 15:17:28,270 INFO L290 TraceCheckUtils]: 16: Hoare triple {1775#(<= ~counter~0 2)} assume !!(#t~post5 < 50);havoc #t~post5; {1775#(<= ~counter~0 2)} is VALID [2022-04-14 15:17:28,271 INFO L290 TraceCheckUtils]: 17: Hoare triple {1775#(<= ~counter~0 2)} assume !(~q~0 % 4294967296 <= ~n~0 % 4294967296); {1775#(<= ~counter~0 2)} is VALID [2022-04-14 15:17:28,271 INFO L290 TraceCheckUtils]: 18: Hoare triple {1775#(<= ~counter~0 2)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {1785#(<= |main_#t~post6| 2)} is VALID [2022-04-14 15:17:28,272 INFO L290 TraceCheckUtils]: 19: Hoare triple {1785#(<= |main_#t~post6| 2)} assume !(#t~post6 < 50);havoc #t~post6; {1724#false} is VALID [2022-04-14 15:17:28,272 INFO L272 TraceCheckUtils]: 20: Hoare triple {1724#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)); {1724#false} is VALID [2022-04-14 15:17:28,272 INFO L290 TraceCheckUtils]: 21: Hoare triple {1724#false} ~cond := #in~cond; {1724#false} is VALID [2022-04-14 15:17:28,272 INFO L290 TraceCheckUtils]: 22: Hoare triple {1724#false} assume 0 == ~cond; {1724#false} is VALID [2022-04-14 15:17:28,272 INFO L290 TraceCheckUtils]: 23: Hoare triple {1724#false} assume !false; {1724#false} is VALID [2022-04-14 15:17:28,272 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-14 15:17:28,272 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-14 15:17:28,467 INFO L290 TraceCheckUtils]: 23: Hoare triple {1724#false} assume !false; {1724#false} is VALID [2022-04-14 15:17:28,467 INFO L290 TraceCheckUtils]: 22: Hoare triple {1724#false} assume 0 == ~cond; {1724#false} is VALID [2022-04-14 15:17:28,467 INFO L290 TraceCheckUtils]: 21: Hoare triple {1724#false} ~cond := #in~cond; {1724#false} is VALID [2022-04-14 15:17:28,467 INFO L272 TraceCheckUtils]: 20: Hoare triple {1724#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)); {1724#false} is VALID [2022-04-14 15:17:28,468 INFO L290 TraceCheckUtils]: 19: Hoare triple {1813#(< |main_#t~post6| 50)} assume !(#t~post6 < 50);havoc #t~post6; {1724#false} is VALID [2022-04-14 15:17:28,468 INFO L290 TraceCheckUtils]: 18: Hoare triple {1817#(< ~counter~0 50)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {1813#(< |main_#t~post6| 50)} is VALID [2022-04-14 15:17:28,469 INFO L290 TraceCheckUtils]: 17: Hoare triple {1817#(< ~counter~0 50)} assume !(~q~0 % 4294967296 <= ~n~0 % 4294967296); {1817#(< ~counter~0 50)} is VALID [2022-04-14 15:17:28,469 INFO L290 TraceCheckUtils]: 16: Hoare triple {1817#(< ~counter~0 50)} assume !!(#t~post5 < 50);havoc #t~post5; {1817#(< ~counter~0 50)} is VALID [2022-04-14 15:17:28,470 INFO L290 TraceCheckUtils]: 15: Hoare triple {1827#(< ~counter~0 49)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {1817#(< ~counter~0 50)} is VALID [2022-04-14 15:17:28,470 INFO L290 TraceCheckUtils]: 14: Hoare triple {1827#(< ~counter~0 49)} assume !!(~q~0 % 4294967296 <= ~n~0 % 4294967296);~q~0 := 4 * ~q~0; {1827#(< ~counter~0 49)} is VALID [2022-04-14 15:17:28,470 INFO L290 TraceCheckUtils]: 13: Hoare triple {1827#(< ~counter~0 49)} assume !!(#t~post5 < 50);havoc #t~post5; {1827#(< ~counter~0 49)} is VALID [2022-04-14 15:17:28,471 INFO L290 TraceCheckUtils]: 12: Hoare triple {1837#(< ~counter~0 48)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {1827#(< ~counter~0 49)} is VALID [2022-04-14 15:17:28,471 INFO L290 TraceCheckUtils]: 11: Hoare triple {1837#(< ~counter~0 48)} ~p~0 := 0;~q~0 := 1;~r~0 := ~n~0;~h~0 := 0; {1837#(< ~counter~0 48)} is VALID [2022-04-14 15:17:28,472 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1723#true} {1837#(< ~counter~0 48)} #82#return; {1837#(< ~counter~0 48)} is VALID [2022-04-14 15:17:28,472 INFO L290 TraceCheckUtils]: 9: Hoare triple {1723#true} assume true; {1723#true} is VALID [2022-04-14 15:17:28,472 INFO L290 TraceCheckUtils]: 8: Hoare triple {1723#true} assume !(0 == ~cond); {1723#true} is VALID [2022-04-14 15:17:28,472 INFO L290 TraceCheckUtils]: 7: Hoare triple {1723#true} ~cond := #in~cond; {1723#true} is VALID [2022-04-14 15:17:28,472 INFO L272 TraceCheckUtils]: 6: Hoare triple {1837#(< ~counter~0 48)} call assume_abort_if_not((if ~n~0 % 4294967296 < 1073741823 then 1 else 0)); {1723#true} is VALID [2022-04-14 15:17:28,473 INFO L290 TraceCheckUtils]: 5: Hoare triple {1837#(< ~counter~0 48)} havoc ~n~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~h~0;~n~0 := #t~nondet4;havoc #t~nondet4; {1837#(< ~counter~0 48)} is VALID [2022-04-14 15:17:28,474 INFO L272 TraceCheckUtils]: 4: Hoare triple {1837#(< ~counter~0 48)} call #t~ret7 := main(); {1837#(< ~counter~0 48)} is VALID [2022-04-14 15:17:28,474 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1837#(< ~counter~0 48)} {1723#true} #102#return; {1837#(< ~counter~0 48)} is VALID [2022-04-14 15:17:28,474 INFO L290 TraceCheckUtils]: 2: Hoare triple {1837#(< ~counter~0 48)} assume true; {1837#(< ~counter~0 48)} is VALID [2022-04-14 15:17:28,479 INFO L290 TraceCheckUtils]: 1: Hoare triple {1723#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);~counter~0 := 0; {1837#(< ~counter~0 48)} is VALID [2022-04-14 15:17:28,480 INFO L272 TraceCheckUtils]: 0: Hoare triple {1723#true} call ULTIMATE.init(); {1723#true} is VALID [2022-04-14 15:17:28,480 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-14 15:17:28,480 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 15:17:28,480 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1393328592] [2022-04-14 15:17:28,480 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-14 15:17:28,480 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1277628540] [2022-04-14 15:17:28,480 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1277628540] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-14 15:17:28,480 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-14 15:17:28,480 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2022-04-14 15:17:28,481 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [134148840] [2022-04-14 15:17:28,481 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-14 15:17:28,481 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.3) internal successors, (33), 10 states have internal predecessors, (33), 4 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) Word has length 24 [2022-04-14 15:17:28,481 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 15:17:28,482 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 10 states, 10 states have (on average 3.3) internal successors, (33), 10 states have internal predecessors, (33), 4 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) [2022-04-14 15:17:28,509 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 43 edges. 43 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 15:17:28,509 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-14 15:17:28,509 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 15:17:28,509 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-14 15:17:28,509 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-04-14 15:17:28,510 INFO L87 Difference]: Start difference. First operand 67 states and 86 transitions. Second operand has 10 states, 10 states have (on average 3.3) internal successors, (33), 10 states have internal predecessors, (33), 4 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) [2022-04-14 15:17:41,286 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-14 15:17:52,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 15:17:52,240 INFO L93 Difference]: Finished difference Result 138 states and 184 transitions. [2022-04-14 15:17:52,240 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-04-14 15:17:52,240 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.3) internal successors, (33), 10 states have internal predecessors, (33), 4 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) Word has length 24 [2022-04-14 15:17:52,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-14 15:17:52,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 3.3) internal successors, (33), 10 states have internal predecessors, (33), 4 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) [2022-04-14 15:17:52,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 174 transitions. [2022-04-14 15:17:52,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 3.3) internal successors, (33), 10 states have internal predecessors, (33), 4 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) [2022-04-14 15:17:52,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 174 transitions. [2022-04-14 15:17:52,250 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 13 states and 174 transitions. [2022-04-14 15:17:52,417 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 174 edges. 174 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 15:17:52,420 INFO L225 Difference]: With dead ends: 138 [2022-04-14 15:17:52,420 INFO L226 Difference]: Without dead ends: 127 [2022-04-14 15:17:52,421 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=119, Unknown=0, NotChecked=0, Total=182 [2022-04-14 15:17:52,421 INFO L913 BasicCegarLoop]: 73 mSDtfsCounter, 125 mSDsluCounter, 246 mSDsCounter, 0 mSdLazyCounter, 105 mSolverCounterSat, 55 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 125 SdHoareTripleChecker+Valid, 319 SdHoareTripleChecker+Invalid, 161 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 105 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.6s IncrementalHoareTripleChecker+Time [2022-04-14 15:17:52,422 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [125 Valid, 319 Invalid, 161 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 105 Invalid, 1 Unknown, 0 Unchecked, 7.6s Time] [2022-04-14 15:17:52,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2022-04-14 15:17:52,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 118. [2022-04-14 15:17:52,498 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-14 15:17:52,499 INFO L82 GeneralOperation]: Start isEquivalent. First operand 127 states. Second operand has 118 states, 68 states have (on average 1.2941176470588236) internal successors, (88), 72 states have internal predecessors, (88), 40 states have call successors, (40), 11 states have call predecessors, (40), 9 states have return successors, (35), 34 states have call predecessors, (35), 35 states have call successors, (35) [2022-04-14 15:17:52,499 INFO L74 IsIncluded]: Start isIncluded. First operand 127 states. Second operand has 118 states, 68 states have (on average 1.2941176470588236) internal successors, (88), 72 states have internal predecessors, (88), 40 states have call successors, (40), 11 states have call predecessors, (40), 9 states have return successors, (35), 34 states have call predecessors, (35), 35 states have call successors, (35) [2022-04-14 15:17:52,499 INFO L87 Difference]: Start difference. First operand 127 states. Second operand has 118 states, 68 states have (on average 1.2941176470588236) internal successors, (88), 72 states have internal predecessors, (88), 40 states have call successors, (40), 11 states have call predecessors, (40), 9 states have return successors, (35), 34 states have call predecessors, (35), 35 states have call successors, (35) [2022-04-14 15:17:52,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 15:17:52,505 INFO L93 Difference]: Finished difference Result 127 states and 168 transitions. [2022-04-14 15:17:52,505 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 168 transitions. [2022-04-14 15:17:52,506 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 15:17:52,506 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 15:17:52,506 INFO L74 IsIncluded]: Start isIncluded. First operand has 118 states, 68 states have (on average 1.2941176470588236) internal successors, (88), 72 states have internal predecessors, (88), 40 states have call successors, (40), 11 states have call predecessors, (40), 9 states have return successors, (35), 34 states have call predecessors, (35), 35 states have call successors, (35) Second operand 127 states. [2022-04-14 15:17:52,507 INFO L87 Difference]: Start difference. First operand has 118 states, 68 states have (on average 1.2941176470588236) internal successors, (88), 72 states have internal predecessors, (88), 40 states have call successors, (40), 11 states have call predecessors, (40), 9 states have return successors, (35), 34 states have call predecessors, (35), 35 states have call successors, (35) Second operand 127 states. [2022-04-14 15:17:52,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 15:17:52,512 INFO L93 Difference]: Finished difference Result 127 states and 168 transitions. [2022-04-14 15:17:52,512 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 168 transitions. [2022-04-14 15:17:52,514 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 15:17:52,514 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 15:17:52,514 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-14 15:17:52,514 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-14 15:17:52,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 118 states, 68 states have (on average 1.2941176470588236) internal successors, (88), 72 states have internal predecessors, (88), 40 states have call successors, (40), 11 states have call predecessors, (40), 9 states have return successors, (35), 34 states have call predecessors, (35), 35 states have call successors, (35) [2022-04-14 15:17:52,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 163 transitions. [2022-04-14 15:17:52,537 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 163 transitions. Word has length 24 [2022-04-14 15:17:52,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-14 15:17:52,539 INFO L478 AbstractCegarLoop]: Abstraction has 118 states and 163 transitions. [2022-04-14 15:17:52,539 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.3) internal successors, (33), 10 states have internal predecessors, (33), 4 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) [2022-04-14 15:17:52,539 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 163 transitions. [2022-04-14 15:17:52,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-04-14 15:17:52,540 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 15:17:52,540 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-14 15:17:52,564 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-04-14 15:17:52,763 WARN L460 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-14 15:17:52,764 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 15:17:52,764 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 15:17:52,764 INFO L85 PathProgramCache]: Analyzing trace with hash -1562772727, now seen corresponding path program 1 times [2022-04-14 15:17:52,764 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 15:17:52,764 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [412359324] [2022-04-14 15:17:52,765 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 15:17:52,765 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 15:17:52,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 15:17:53,002 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-14 15:17:53,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 15:17:53,014 INFO L290 TraceCheckUtils]: 0: Hoare triple {2527#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {2513#true} is VALID [2022-04-14 15:17:53,014 INFO L290 TraceCheckUtils]: 1: Hoare triple {2513#true} assume true; {2513#true} is VALID [2022-04-14 15:17:53,015 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {2513#true} {2513#true} #102#return; {2513#true} is VALID [2022-04-14 15:17:53,015 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-14 15:17:53,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 15:17:53,027 INFO L290 TraceCheckUtils]: 0: Hoare triple {2513#true} ~cond := #in~cond; {2513#true} is VALID [2022-04-14 15:17:53,027 INFO L290 TraceCheckUtils]: 1: Hoare triple {2513#true} assume !(0 == ~cond); {2513#true} is VALID [2022-04-14 15:17:53,028 INFO L290 TraceCheckUtils]: 2: Hoare triple {2513#true} assume true; {2513#true} is VALID [2022-04-14 15:17:53,028 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2513#true} {2513#true} #82#return; {2513#true} is VALID [2022-04-14 15:17:53,028 INFO L272 TraceCheckUtils]: 0: Hoare triple {2513#true} call ULTIMATE.init(); {2527#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-14 15:17:53,028 INFO L290 TraceCheckUtils]: 1: Hoare triple {2527#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {2513#true} is VALID [2022-04-14 15:17:53,028 INFO L290 TraceCheckUtils]: 2: Hoare triple {2513#true} assume true; {2513#true} is VALID [2022-04-14 15:17:53,031 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2513#true} {2513#true} #102#return; {2513#true} is VALID [2022-04-14 15:17:53,032 INFO L272 TraceCheckUtils]: 4: Hoare triple {2513#true} call #t~ret7 := main(); {2513#true} is VALID [2022-04-14 15:17:53,032 INFO L290 TraceCheckUtils]: 5: Hoare triple {2513#true} havoc ~n~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~h~0;~n~0 := #t~nondet4;havoc #t~nondet4; {2513#true} is VALID [2022-04-14 15:17:53,032 INFO L272 TraceCheckUtils]: 6: Hoare triple {2513#true} call assume_abort_if_not((if ~n~0 % 4294967296 < 1073741823 then 1 else 0)); {2513#true} is VALID [2022-04-14 15:17:53,032 INFO L290 TraceCheckUtils]: 7: Hoare triple {2513#true} ~cond := #in~cond; {2513#true} is VALID [2022-04-14 15:17:53,032 INFO L290 TraceCheckUtils]: 8: Hoare triple {2513#true} assume !(0 == ~cond); {2513#true} is VALID [2022-04-14 15:17:53,032 INFO L290 TraceCheckUtils]: 9: Hoare triple {2513#true} assume true; {2513#true} is VALID [2022-04-14 15:17:53,032 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2513#true} {2513#true} #82#return; {2513#true} is VALID [2022-04-14 15:17:53,033 INFO L290 TraceCheckUtils]: 11: Hoare triple {2513#true} ~p~0 := 0;~q~0 := 1;~r~0 := ~n~0;~h~0 := 0; {2522#(and (= main_~p~0 0) (= (+ (- 1) main_~q~0) 0) (= (+ main_~n~0 (* (- 1) main_~r~0)) 0))} is VALID [2022-04-14 15:17:53,033 INFO L290 TraceCheckUtils]: 12: Hoare triple {2522#(and (= main_~p~0 0) (= (+ (- 1) main_~q~0) 0) (= (+ main_~n~0 (* (- 1) main_~r~0)) 0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {2522#(and (= main_~p~0 0) (= (+ (- 1) main_~q~0) 0) (= (+ main_~n~0 (* (- 1) main_~r~0)) 0))} is VALID [2022-04-14 15:17:53,034 INFO L290 TraceCheckUtils]: 13: Hoare triple {2522#(and (= main_~p~0 0) (= (+ (- 1) main_~q~0) 0) (= (+ main_~n~0 (* (- 1) main_~r~0)) 0))} assume !!(#t~post5 < 50);havoc #t~post5; {2522#(and (= main_~p~0 0) (= (+ (- 1) main_~q~0) 0) (= (+ main_~n~0 (* (- 1) main_~r~0)) 0))} is VALID [2022-04-14 15:17:53,034 INFO L290 TraceCheckUtils]: 14: Hoare triple {2522#(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; {2523#(and (= main_~p~0 0) (= main_~n~0 main_~r~0))} is VALID [2022-04-14 15:17:53,035 INFO L290 TraceCheckUtils]: 15: Hoare triple {2523#(and (= main_~p~0 0) (= main_~n~0 main_~r~0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {2523#(and (= main_~p~0 0) (= main_~n~0 main_~r~0))} is VALID [2022-04-14 15:17:53,035 INFO L290 TraceCheckUtils]: 16: Hoare triple {2523#(and (= main_~p~0 0) (= main_~n~0 main_~r~0))} assume !!(#t~post5 < 50);havoc #t~post5; {2523#(and (= main_~p~0 0) (= main_~n~0 main_~r~0))} is VALID [2022-04-14 15:17:53,036 INFO L290 TraceCheckUtils]: 17: Hoare triple {2523#(and (= main_~p~0 0) (= main_~n~0 main_~r~0))} assume !(~q~0 % 4294967296 <= ~n~0 % 4294967296); {2524#(and (<= (+ (* (div (+ (* main_~p~0 2) main_~q~0) 4294967296) 4294967296) main_~r~0 1) (+ main_~q~0 (* (div main_~r~0 4294967296) 4294967296))) (= main_~p~0 0))} is VALID [2022-04-14 15:17:53,036 INFO L290 TraceCheckUtils]: 18: Hoare triple {2524#(and (<= (+ (* (div (+ (* main_~p~0 2) main_~q~0) 4294967296) 4294967296) main_~r~0 1) (+ main_~q~0 (* (div main_~r~0 4294967296) 4294967296))) (= main_~p~0 0))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {2524#(and (<= (+ (* (div (+ (* main_~p~0 2) main_~q~0) 4294967296) 4294967296) main_~r~0 1) (+ main_~q~0 (* (div main_~r~0 4294967296) 4294967296))) (= main_~p~0 0))} is VALID [2022-04-14 15:17:53,037 INFO L290 TraceCheckUtils]: 19: Hoare triple {2524#(and (<= (+ (* (div (+ (* main_~p~0 2) main_~q~0) 4294967296) 4294967296) main_~r~0 1) (+ main_~q~0 (* (div main_~r~0 4294967296) 4294967296))) (= main_~p~0 0))} assume !!(#t~post6 < 50);havoc #t~post6; {2524#(and (<= (+ (* (div (+ (* main_~p~0 2) main_~q~0) 4294967296) 4294967296) main_~r~0 1) (+ main_~q~0 (* (div main_~r~0 4294967296) 4294967296))) (= main_~p~0 0))} is VALID [2022-04-14 15:17:53,038 INFO L272 TraceCheckUtils]: 20: Hoare triple {2524#(and (<= (+ (* (div (+ (* main_~p~0 2) main_~q~0) 4294967296) 4294967296) main_~r~0 1) (+ main_~q~0 (* (div main_~r~0 4294967296) 4294967296))) (= main_~p~0 0))} call __VERIFIER_assert((if ~r~0 % 4294967296 < (2 * ~p~0 + ~q~0) % 4294967296 then 1 else 0)); {2525#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-14 15:17:53,038 INFO L290 TraceCheckUtils]: 21: Hoare triple {2525#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {2526#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-14 15:17:53,039 INFO L290 TraceCheckUtils]: 22: Hoare triple {2526#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {2514#false} is VALID [2022-04-14 15:17:53,039 INFO L290 TraceCheckUtils]: 23: Hoare triple {2514#false} assume !false; {2514#false} is VALID [2022-04-14 15:17:53,040 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-14 15:17:53,040 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 15:17:53,040 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [412359324] [2022-04-14 15:17:53,040 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [412359324] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-14 15:17:53,040 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [53303862] [2022-04-14 15:17:53,040 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 15:17:53,041 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-14 15:17:53,041 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-14 15:17:53,044 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-14 15:17:53,048 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-04-14 15:17:53,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 15:17:53,096 INFO L263 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 12 conjunts are in the unsatisfiable core [2022-04-14 15:17:53,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 15:17:53,104 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-14 15:17:53,396 INFO L272 TraceCheckUtils]: 0: Hoare triple {2513#true} call ULTIMATE.init(); {2513#true} is VALID [2022-04-14 15:17:53,396 INFO L290 TraceCheckUtils]: 1: Hoare triple {2513#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);~counter~0 := 0; {2513#true} is VALID [2022-04-14 15:17:53,396 INFO L290 TraceCheckUtils]: 2: Hoare triple {2513#true} assume true; {2513#true} is VALID [2022-04-14 15:17:53,396 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2513#true} {2513#true} #102#return; {2513#true} is VALID [2022-04-14 15:17:53,396 INFO L272 TraceCheckUtils]: 4: Hoare triple {2513#true} call #t~ret7 := main(); {2513#true} is VALID [2022-04-14 15:17:53,396 INFO L290 TraceCheckUtils]: 5: Hoare triple {2513#true} havoc ~n~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~h~0;~n~0 := #t~nondet4;havoc #t~nondet4; {2513#true} is VALID [2022-04-14 15:17:53,396 INFO L272 TraceCheckUtils]: 6: Hoare triple {2513#true} call assume_abort_if_not((if ~n~0 % 4294967296 < 1073741823 then 1 else 0)); {2513#true} is VALID [2022-04-14 15:17:53,397 INFO L290 TraceCheckUtils]: 7: Hoare triple {2513#true} ~cond := #in~cond; {2513#true} is VALID [2022-04-14 15:17:53,397 INFO L290 TraceCheckUtils]: 8: Hoare triple {2513#true} assume !(0 == ~cond); {2513#true} is VALID [2022-04-14 15:17:53,397 INFO L290 TraceCheckUtils]: 9: Hoare triple {2513#true} assume true; {2513#true} is VALID [2022-04-14 15:17:53,397 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2513#true} {2513#true} #82#return; {2513#true} is VALID [2022-04-14 15:17:53,398 INFO L290 TraceCheckUtils]: 11: Hoare triple {2513#true} ~p~0 := 0;~q~0 := 1;~r~0 := ~n~0;~h~0 := 0; {2522#(and (= main_~p~0 0) (= (+ (- 1) main_~q~0) 0) (= (+ main_~n~0 (* (- 1) main_~r~0)) 0))} is VALID [2022-04-14 15:17:53,399 INFO L290 TraceCheckUtils]: 12: Hoare triple {2522#(and (= main_~p~0 0) (= (+ (- 1) main_~q~0) 0) (= (+ main_~n~0 (* (- 1) main_~r~0)) 0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {2522#(and (= main_~p~0 0) (= (+ (- 1) main_~q~0) 0) (= (+ main_~n~0 (* (- 1) main_~r~0)) 0))} is VALID [2022-04-14 15:17:53,399 INFO L290 TraceCheckUtils]: 13: Hoare triple {2522#(and (= main_~p~0 0) (= (+ (- 1) main_~q~0) 0) (= (+ main_~n~0 (* (- 1) main_~r~0)) 0))} assume !!(#t~post5 < 50);havoc #t~post5; {2522#(and (= main_~p~0 0) (= (+ (- 1) main_~q~0) 0) (= (+ main_~n~0 (* (- 1) main_~r~0)) 0))} is VALID [2022-04-14 15:17:53,400 INFO L290 TraceCheckUtils]: 14: Hoare triple {2522#(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; {2573#(and (= main_~p~0 0) (= main_~q~0 4) (= (+ main_~n~0 (* (- 1) main_~r~0)) 0))} is VALID [2022-04-14 15:17:53,400 INFO L290 TraceCheckUtils]: 15: Hoare triple {2573#(and (= main_~p~0 0) (= main_~q~0 4) (= (+ main_~n~0 (* (- 1) main_~r~0)) 0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {2573#(and (= main_~p~0 0) (= main_~q~0 4) (= (+ main_~n~0 (* (- 1) main_~r~0)) 0))} is VALID [2022-04-14 15:17:53,401 INFO L290 TraceCheckUtils]: 16: Hoare triple {2573#(and (= main_~p~0 0) (= main_~q~0 4) (= (+ main_~n~0 (* (- 1) main_~r~0)) 0))} assume !!(#t~post5 < 50);havoc #t~post5; {2573#(and (= main_~p~0 0) (= main_~q~0 4) (= (+ main_~n~0 (* (- 1) main_~r~0)) 0))} is VALID [2022-04-14 15:17:53,402 INFO L290 TraceCheckUtils]: 17: Hoare triple {2573#(and (= main_~p~0 0) (= main_~q~0 4) (= (+ main_~n~0 (* (- 1) main_~r~0)) 0))} assume !(~q~0 % 4294967296 <= ~n~0 % 4294967296); {2583#(and (not (<= (mod main_~q~0 4294967296) (mod main_~r~0 4294967296))) (= main_~p~0 0) (= main_~q~0 4))} is VALID [2022-04-14 15:17:53,402 INFO L290 TraceCheckUtils]: 18: Hoare triple {2583#(and (not (<= (mod main_~q~0 4294967296) (mod main_~r~0 4294967296))) (= main_~p~0 0) (= main_~q~0 4))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {2583#(and (not (<= (mod main_~q~0 4294967296) (mod main_~r~0 4294967296))) (= main_~p~0 0) (= main_~q~0 4))} is VALID [2022-04-14 15:17:53,403 INFO L290 TraceCheckUtils]: 19: Hoare triple {2583#(and (not (<= (mod main_~q~0 4294967296) (mod main_~r~0 4294967296))) (= main_~p~0 0) (= main_~q~0 4))} assume !!(#t~post6 < 50);havoc #t~post6; {2583#(and (not (<= (mod main_~q~0 4294967296) (mod main_~r~0 4294967296))) (= main_~p~0 0) (= main_~q~0 4))} is VALID [2022-04-14 15:17:53,404 INFO L272 TraceCheckUtils]: 20: Hoare triple {2583#(and (not (<= (mod main_~q~0 4294967296) (mod main_~r~0 4294967296))) (= 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)); {2593#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-14 15:17:53,404 INFO L290 TraceCheckUtils]: 21: Hoare triple {2593#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {2597#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-14 15:17:53,404 INFO L290 TraceCheckUtils]: 22: Hoare triple {2597#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2514#false} is VALID [2022-04-14 15:17:53,405 INFO L290 TraceCheckUtils]: 23: Hoare triple {2514#false} assume !false; {2514#false} is VALID [2022-04-14 15:17:53,405 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-14 15:17:53,405 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-14 15:17:53,688 INFO L290 TraceCheckUtils]: 23: Hoare triple {2514#false} assume !false; {2514#false} is VALID [2022-04-14 15:17:53,688 INFO L290 TraceCheckUtils]: 22: Hoare triple {2597#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2514#false} is VALID [2022-04-14 15:17:53,689 INFO L290 TraceCheckUtils]: 21: Hoare triple {2593#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {2597#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-14 15:17:53,690 INFO L272 TraceCheckUtils]: 20: Hoare triple {2613#(< (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)); {2593#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-14 15:17:53,691 INFO L290 TraceCheckUtils]: 19: Hoare triple {2613#(< (mod main_~r~0 4294967296) (mod (+ (* main_~p~0 2) main_~q~0) 4294967296))} assume !!(#t~post6 < 50);havoc #t~post6; {2613#(< (mod main_~r~0 4294967296) (mod (+ (* main_~p~0 2) main_~q~0) 4294967296))} is VALID [2022-04-14 15:17:53,693 INFO L290 TraceCheckUtils]: 18: Hoare triple {2613#(< (mod main_~r~0 4294967296) (mod (+ (* main_~p~0 2) main_~q~0) 4294967296))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {2613#(< (mod main_~r~0 4294967296) (mod (+ (* main_~p~0 2) main_~q~0) 4294967296))} is VALID [2022-04-14 15:17:53,694 INFO L290 TraceCheckUtils]: 17: Hoare triple {2623#(or (<= (mod main_~q~0 4294967296) (mod main_~n~0 4294967296)) (< (mod main_~r~0 4294967296) (mod (+ (* main_~p~0 2) main_~q~0) 4294967296)))} assume !(~q~0 % 4294967296 <= ~n~0 % 4294967296); {2613#(< (mod main_~r~0 4294967296) (mod (+ (* main_~p~0 2) main_~q~0) 4294967296))} is VALID [2022-04-14 15:17:53,695 INFO L290 TraceCheckUtils]: 16: Hoare triple {2623#(or (<= (mod main_~q~0 4294967296) (mod main_~n~0 4294967296)) (< (mod main_~r~0 4294967296) (mod (+ (* main_~p~0 2) main_~q~0) 4294967296)))} assume !!(#t~post5 < 50);havoc #t~post5; {2623#(or (<= (mod main_~q~0 4294967296) (mod main_~n~0 4294967296)) (< (mod main_~r~0 4294967296) (mod (+ (* main_~p~0 2) main_~q~0) 4294967296)))} is VALID [2022-04-14 15:17:53,696 INFO L290 TraceCheckUtils]: 15: Hoare triple {2623#(or (<= (mod main_~q~0 4294967296) (mod main_~n~0 4294967296)) (< (mod main_~r~0 4294967296) (mod (+ (* main_~p~0 2) main_~q~0) 4294967296)))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {2623#(or (<= (mod main_~q~0 4294967296) (mod main_~n~0 4294967296)) (< (mod main_~r~0 4294967296) (mod (+ (* main_~p~0 2) main_~q~0) 4294967296)))} is VALID [2022-04-14 15:17:53,707 INFO L290 TraceCheckUtils]: 14: Hoare triple {2633#(or (<= (mod (* main_~q~0 4) 4294967296) (mod main_~n~0 4294967296)) (< (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; {2623#(or (<= (mod main_~q~0 4294967296) (mod main_~n~0 4294967296)) (< (mod main_~r~0 4294967296) (mod (+ (* main_~p~0 2) main_~q~0) 4294967296)))} is VALID [2022-04-14 15:17:53,708 INFO L290 TraceCheckUtils]: 13: Hoare triple {2633#(or (<= (mod (* main_~q~0 4) 4294967296) (mod main_~n~0 4294967296)) (< (mod main_~r~0 4294967296) (mod (+ (* main_~p~0 2) (* main_~q~0 4)) 4294967296)))} assume !!(#t~post5 < 50);havoc #t~post5; {2633#(or (<= (mod (* main_~q~0 4) 4294967296) (mod main_~n~0 4294967296)) (< (mod main_~r~0 4294967296) (mod (+ (* main_~p~0 2) (* main_~q~0 4)) 4294967296)))} is VALID [2022-04-14 15:17:53,709 INFO L290 TraceCheckUtils]: 12: Hoare triple {2633#(or (<= (mod (* main_~q~0 4) 4294967296) (mod main_~n~0 4294967296)) (< (mod main_~r~0 4294967296) (mod (+ (* main_~p~0 2) (* main_~q~0 4)) 4294967296)))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {2633#(or (<= (mod (* main_~q~0 4) 4294967296) (mod main_~n~0 4294967296)) (< (mod main_~r~0 4294967296) (mod (+ (* main_~p~0 2) (* main_~q~0 4)) 4294967296)))} is VALID [2022-04-14 15:17:53,711 INFO L290 TraceCheckUtils]: 11: Hoare triple {2513#true} ~p~0 := 0;~q~0 := 1;~r~0 := ~n~0;~h~0 := 0; {2633#(or (<= (mod (* main_~q~0 4) 4294967296) (mod main_~n~0 4294967296)) (< (mod main_~r~0 4294967296) (mod (+ (* main_~p~0 2) (* main_~q~0 4)) 4294967296)))} is VALID [2022-04-14 15:17:53,712 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2513#true} {2513#true} #82#return; {2513#true} is VALID [2022-04-14 15:17:53,712 INFO L290 TraceCheckUtils]: 9: Hoare triple {2513#true} assume true; {2513#true} is VALID [2022-04-14 15:17:53,712 INFO L290 TraceCheckUtils]: 8: Hoare triple {2513#true} assume !(0 == ~cond); {2513#true} is VALID [2022-04-14 15:17:53,712 INFO L290 TraceCheckUtils]: 7: Hoare triple {2513#true} ~cond := #in~cond; {2513#true} is VALID [2022-04-14 15:17:53,712 INFO L272 TraceCheckUtils]: 6: Hoare triple {2513#true} call assume_abort_if_not((if ~n~0 % 4294967296 < 1073741823 then 1 else 0)); {2513#true} is VALID [2022-04-14 15:17:53,712 INFO L290 TraceCheckUtils]: 5: Hoare triple {2513#true} havoc ~n~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~h~0;~n~0 := #t~nondet4;havoc #t~nondet4; {2513#true} is VALID [2022-04-14 15:17:53,712 INFO L272 TraceCheckUtils]: 4: Hoare triple {2513#true} call #t~ret7 := main(); {2513#true} is VALID [2022-04-14 15:17:53,712 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2513#true} {2513#true} #102#return; {2513#true} is VALID [2022-04-14 15:17:53,712 INFO L290 TraceCheckUtils]: 2: Hoare triple {2513#true} assume true; {2513#true} is VALID [2022-04-14 15:17:53,712 INFO L290 TraceCheckUtils]: 1: Hoare triple {2513#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);~counter~0 := 0; {2513#true} is VALID [2022-04-14 15:17:53,713 INFO L272 TraceCheckUtils]: 0: Hoare triple {2513#true} call ULTIMATE.init(); {2513#true} is VALID [2022-04-14 15:17:53,713 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-14 15:17:53,713 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [53303862] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-14 15:17:53,713 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-14 15:17:53,713 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 15 [2022-04-14 15:17:53,713 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1199975616] [2022-04-14 15:17:53,713 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-14 15:17:53,714 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 2.4) internal successors, (36), 12 states have internal predecessors, (36), 4 states have call successors, (7), 4 states have call predecessors, (7), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 24 [2022-04-14 15:17:53,714 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 15:17:53,714 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 15 states, 15 states have (on average 2.4) internal successors, (36), 12 states have internal predecessors, (36), 4 states have call successors, (7), 4 states have call predecessors, (7), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-14 15:17:53,764 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 45 edges. 45 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 15:17:53,764 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-04-14 15:17:53,764 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 15:17:53,764 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-04-14 15:17:53,765 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=166, Unknown=0, NotChecked=0, Total=210 [2022-04-14 15:17:53,765 INFO L87 Difference]: Start difference. First operand 118 states and 163 transitions. Second operand has 15 states, 15 states have (on average 2.4) internal successors, (36), 12 states have internal predecessors, (36), 4 states have call successors, (7), 4 states have call predecessors, (7), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-14 15:17:58,473 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-14 15:18:00,483 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-14 15:18:02,522 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-14 15:18:04,619 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-14 15:18:06,621 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-14 15:18:12,251 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-14 15:18:15,325 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-14 15:18:19,878 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-14 15:18:40,497 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.34s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-14 15:18:42,504 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-14 15:18:47,108 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.02s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-14 15:18:50,721 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.06s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-14 15:18:53,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 15:18:53,364 INFO L93 Difference]: Finished difference Result 183 states and 259 transitions. [2022-04-14 15:18:53,364 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-04-14 15:18:53,364 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 2.4) internal successors, (36), 12 states have internal predecessors, (36), 4 states have call successors, (7), 4 states have call predecessors, (7), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 24 [2022-04-14 15:18:53,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-14 15:18:53,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 15 states have (on average 2.4) internal successors, (36), 12 states have internal predecessors, (36), 4 states have call successors, (7), 4 states have call predecessors, (7), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-14 15:18:53,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 144 transitions. [2022-04-14 15:18:53,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 15 states have (on average 2.4) internal successors, (36), 12 states have internal predecessors, (36), 4 states have call successors, (7), 4 states have call predecessors, (7), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-14 15:18:53,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 144 transitions. [2022-04-14 15:18:53,372 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 14 states and 144 transitions. [2022-04-14 15:18:53,967 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 144 edges. 144 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 15:18:53,971 INFO L225 Difference]: With dead ends: 183 [2022-04-14 15:18:53,971 INFO L226 Difference]: Without dead ends: 172 [2022-04-14 15:18:53,972 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 43 SyntacticMatches, 2 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 86 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=105, Invalid=401, Unknown=0, NotChecked=0, Total=506 [2022-04-14 15:18:53,973 INFO L913 BasicCegarLoop]: 61 mSDtfsCounter, 76 mSDsluCounter, 107 mSDsCounter, 0 mSdLazyCounter, 527 mSolverCounterSat, 153 mSolverCounterUnsat, 9 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 35.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 168 SdHoareTripleChecker+Invalid, 689 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 153 IncrementalHoareTripleChecker+Valid, 527 IncrementalHoareTripleChecker+Invalid, 9 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 35.9s IncrementalHoareTripleChecker+Time [2022-04-14 15:18:53,973 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [85 Valid, 168 Invalid, 689 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [153 Valid, 527 Invalid, 9 Unknown, 0 Unchecked, 35.9s Time] [2022-04-14 15:18:53,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2022-04-14 15:18:54,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 164. [2022-04-14 15:18:54,082 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-14 15:18:54,082 INFO L82 GeneralOperation]: Start isEquivalent. First operand 172 states. Second operand has 164 states, 91 states have (on average 1.2417582417582418) internal successors, (113), 98 states have internal predecessors, (113), 59 states have call successors, (59), 15 states have call predecessors, (59), 13 states have return successors, (54), 50 states have call predecessors, (54), 54 states have call successors, (54) [2022-04-14 15:18:54,083 INFO L74 IsIncluded]: Start isIncluded. First operand 172 states. Second operand has 164 states, 91 states have (on average 1.2417582417582418) internal successors, (113), 98 states have internal predecessors, (113), 59 states have call successors, (59), 15 states have call predecessors, (59), 13 states have return successors, (54), 50 states have call predecessors, (54), 54 states have call successors, (54) [2022-04-14 15:18:54,083 INFO L87 Difference]: Start difference. First operand 172 states. Second operand has 164 states, 91 states have (on average 1.2417582417582418) internal successors, (113), 98 states have internal predecessors, (113), 59 states have call successors, (59), 15 states have call predecessors, (59), 13 states have return successors, (54), 50 states have call predecessors, (54), 54 states have call successors, (54) [2022-04-14 15:18:54,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 15:18:54,090 INFO L93 Difference]: Finished difference Result 172 states and 240 transitions. [2022-04-14 15:18:54,090 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 240 transitions. [2022-04-14 15:18:54,091 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 15:18:54,091 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 15:18:54,092 INFO L74 IsIncluded]: Start isIncluded. First operand has 164 states, 91 states have (on average 1.2417582417582418) internal successors, (113), 98 states have internal predecessors, (113), 59 states have call successors, (59), 15 states have call predecessors, (59), 13 states have return successors, (54), 50 states have call predecessors, (54), 54 states have call successors, (54) Second operand 172 states. [2022-04-14 15:18:54,093 INFO L87 Difference]: Start difference. First operand has 164 states, 91 states have (on average 1.2417582417582418) internal successors, (113), 98 states have internal predecessors, (113), 59 states have call successors, (59), 15 states have call predecessors, (59), 13 states have return successors, (54), 50 states have call predecessors, (54), 54 states have call successors, (54) Second operand 172 states. [2022-04-14 15:18:54,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 15:18:54,100 INFO L93 Difference]: Finished difference Result 172 states and 240 transitions. [2022-04-14 15:18:54,100 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 240 transitions. [2022-04-14 15:18:54,101 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 15:18:54,101 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 15:18:54,101 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-14 15:18:54,101 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-14 15:18:54,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 164 states, 91 states have (on average 1.2417582417582418) internal successors, (113), 98 states have internal predecessors, (113), 59 states have call successors, (59), 15 states have call predecessors, (59), 13 states have return successors, (54), 50 states have call predecessors, (54), 54 states have call successors, (54) [2022-04-14 15:18:54,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 226 transitions. [2022-04-14 15:18:54,108 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 226 transitions. Word has length 24 [2022-04-14 15:18:54,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-14 15:18:54,109 INFO L478 AbstractCegarLoop]: Abstraction has 164 states and 226 transitions. [2022-04-14 15:18:54,109 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 2.4) internal successors, (36), 12 states have internal predecessors, (36), 4 states have call successors, (7), 4 states have call predecessors, (7), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-14 15:18:54,109 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 226 transitions. [2022-04-14 15:18:54,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-04-14 15:18:54,110 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 15:18:54,110 INFO L499 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-14 15:18:54,133 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2022-04-14 15:18:54,323 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-14 15:18:54,324 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 15:18:54,324 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 15:18:54,324 INFO L85 PathProgramCache]: Analyzing trace with hash -45171523, now seen corresponding path program 1 times [2022-04-14 15:18:54,324 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 15:18:54,324 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [374355792] [2022-04-14 15:18:54,324 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 15:18:54,324 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 15:18:54,334 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-14 15:18:54,334 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [292766630] [2022-04-14 15:18:54,334 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 15:18:54,335 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-14 15:18:54,335 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-14 15:18:54,341 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-14 15:18:54,345 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-04-14 15:18:54,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 15:18:54,464 INFO L263 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-14 15:18:54,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 15:18:54,474 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-14 15:18:54,650 INFO L272 TraceCheckUtils]: 0: Hoare triple {3557#true} call ULTIMATE.init(); {3557#true} is VALID [2022-04-14 15:18:54,650 INFO L290 TraceCheckUtils]: 1: Hoare triple {3557#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);~counter~0 := 0; {3557#true} is VALID [2022-04-14 15:18:54,650 INFO L290 TraceCheckUtils]: 2: Hoare triple {3557#true} assume true; {3557#true} is VALID [2022-04-14 15:18:54,650 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3557#true} {3557#true} #102#return; {3557#true} is VALID [2022-04-14 15:18:54,651 INFO L272 TraceCheckUtils]: 4: Hoare triple {3557#true} call #t~ret7 := main(); {3557#true} is VALID [2022-04-14 15:18:54,651 INFO L290 TraceCheckUtils]: 5: Hoare triple {3557#true} havoc ~n~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~h~0;~n~0 := #t~nondet4;havoc #t~nondet4; {3557#true} is VALID [2022-04-14 15:18:54,651 INFO L272 TraceCheckUtils]: 6: Hoare triple {3557#true} call assume_abort_if_not((if ~n~0 % 4294967296 < 1073741823 then 1 else 0)); {3557#true} is VALID [2022-04-14 15:18:54,651 INFO L290 TraceCheckUtils]: 7: Hoare triple {3557#true} ~cond := #in~cond; {3557#true} is VALID [2022-04-14 15:18:54,651 INFO L290 TraceCheckUtils]: 8: Hoare triple {3557#true} assume !(0 == ~cond); {3557#true} is VALID [2022-04-14 15:18:54,651 INFO L290 TraceCheckUtils]: 9: Hoare triple {3557#true} assume true; {3557#true} is VALID [2022-04-14 15:18:54,651 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {3557#true} {3557#true} #82#return; {3557#true} is VALID [2022-04-14 15:18:54,652 INFO L290 TraceCheckUtils]: 11: Hoare triple {3557#true} ~p~0 := 0;~q~0 := 1;~r~0 := ~n~0;~h~0 := 0; {3595#(and (= main_~p~0 0) (= main_~h~0 0) (= main_~q~0 1))} is VALID [2022-04-14 15:18:54,652 INFO L290 TraceCheckUtils]: 12: Hoare triple {3595#(and (= main_~p~0 0) (= main_~h~0 0) (= main_~q~0 1))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {3595#(and (= main_~p~0 0) (= main_~h~0 0) (= main_~q~0 1))} is VALID [2022-04-14 15:18:54,653 INFO L290 TraceCheckUtils]: 13: Hoare triple {3595#(and (= main_~p~0 0) (= main_~h~0 0) (= main_~q~0 1))} assume !!(#t~post5 < 50);havoc #t~post5; {3595#(and (= main_~p~0 0) (= main_~h~0 0) (= main_~q~0 1))} is VALID [2022-04-14 15:18:54,653 INFO L290 TraceCheckUtils]: 14: Hoare triple {3595#(and (= main_~p~0 0) (= main_~h~0 0) (= main_~q~0 1))} assume !(~q~0 % 4294967296 <= ~n~0 % 4294967296); {3595#(and (= main_~p~0 0) (= main_~h~0 0) (= main_~q~0 1))} is VALID [2022-04-14 15:18:54,654 INFO L290 TraceCheckUtils]: 15: Hoare triple {3595#(and (= main_~p~0 0) (= main_~h~0 0) (= main_~q~0 1))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {3595#(and (= main_~p~0 0) (= main_~h~0 0) (= main_~q~0 1))} is VALID [2022-04-14 15:18:54,655 INFO L290 TraceCheckUtils]: 16: Hoare triple {3595#(and (= main_~p~0 0) (= main_~h~0 0) (= main_~q~0 1))} assume !!(#t~post6 < 50);havoc #t~post6; {3595#(and (= main_~p~0 0) (= main_~h~0 0) (= main_~q~0 1))} is VALID [2022-04-14 15:18:54,655 INFO L272 TraceCheckUtils]: 17: Hoare triple {3595#(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)); {3557#true} is VALID [2022-04-14 15:18:54,655 INFO L290 TraceCheckUtils]: 18: Hoare triple {3557#true} ~cond := #in~cond; {3557#true} is VALID [2022-04-14 15:18:54,655 INFO L290 TraceCheckUtils]: 19: Hoare triple {3557#true} assume !(0 == ~cond); {3557#true} is VALID [2022-04-14 15:18:54,655 INFO L290 TraceCheckUtils]: 20: Hoare triple {3557#true} assume true; {3557#true} is VALID [2022-04-14 15:18:54,656 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {3557#true} {3595#(and (= main_~p~0 0) (= main_~h~0 0) (= main_~q~0 1))} #84#return; {3595#(and (= main_~p~0 0) (= main_~h~0 0) (= main_~q~0 1))} is VALID [2022-04-14 15:18:54,656 INFO L272 TraceCheckUtils]: 22: Hoare triple {3595#(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)); {3557#true} is VALID [2022-04-14 15:18:54,656 INFO L290 TraceCheckUtils]: 23: Hoare triple {3557#true} ~cond := #in~cond; {3557#true} is VALID [2022-04-14 15:18:54,656 INFO L290 TraceCheckUtils]: 24: Hoare triple {3557#true} assume !(0 == ~cond); {3557#true} is VALID [2022-04-14 15:18:54,656 INFO L290 TraceCheckUtils]: 25: Hoare triple {3557#true} assume true; {3557#true} is VALID [2022-04-14 15:18:54,657 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {3557#true} {3595#(and (= main_~p~0 0) (= main_~h~0 0) (= main_~q~0 1))} #86#return; {3595#(and (= main_~p~0 0) (= main_~h~0 0) (= main_~q~0 1))} is VALID [2022-04-14 15:18:54,658 INFO L272 TraceCheckUtils]: 27: Hoare triple {3595#(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)); {3644#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-14 15:18:54,658 INFO L290 TraceCheckUtils]: 28: Hoare triple {3644#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {3648#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-14 15:18:54,659 INFO L290 TraceCheckUtils]: 29: Hoare triple {3648#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {3558#false} is VALID [2022-04-14 15:18:54,659 INFO L290 TraceCheckUtils]: 30: Hoare triple {3558#false} assume !false; {3558#false} is VALID [2022-04-14 15:18:54,659 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-14 15:18:54,659 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-14 15:18:54,659 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 15:18:54,659 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [374355792] [2022-04-14 15:18:54,659 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-14 15:18:54,659 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [292766630] [2022-04-14 15:18:54,659 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [292766630] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-14 15:18:54,660 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-14 15:18:54,660 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-14 15:18:54,660 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1741413704] [2022-04-14 15:18:54,660 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-14 15:18:54,660 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 31 [2022-04-14 15:18:54,660 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 15:18:54,661 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-14 15:18:54,689 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-14 15:18:54,690 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-14 15:18:54,690 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 15:18:54,690 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-14 15:18:54,690 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-14 15:18:54,690 INFO L87 Difference]: Start difference. First operand 164 states and 226 transitions. Second operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-14 15:19:00,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 15:19:00,956 INFO L93 Difference]: Finished difference Result 170 states and 230 transitions. [2022-04-14 15:19:00,956 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-14 15:19:00,957 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 31 [2022-04-14 15:19:00,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-14 15:19:00,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-14 15:19:00,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 71 transitions. [2022-04-14 15:19:00,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-14 15:19:00,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 71 transitions. [2022-04-14 15:19:00,960 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 71 transitions. [2022-04-14 15:19:01,047 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 71 edges. 71 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 15:19:01,051 INFO L225 Difference]: With dead ends: 170 [2022-04-14 15:19:01,051 INFO L226 Difference]: Without dead ends: 140 [2022-04-14 15:19:01,051 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 27 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-14 15:19:01,052 INFO L913 BasicCegarLoop]: 49 mSDtfsCounter, 6 mSDsluCounter, 105 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 154 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-04-14 15:19:01,052 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [10 Valid, 154 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-04-14 15:19:01,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2022-04-14 15:19:01,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 140. [2022-04-14 15:19:01,124 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-14 15:19:01,125 INFO L82 GeneralOperation]: Start isEquivalent. First operand 140 states. Second operand has 140 states, 77 states have (on average 1.2597402597402598) internal successors, (97), 84 states have internal predecessors, (97), 52 states have call successors, (52), 11 states have call predecessors, (52), 10 states have return successors, (48), 44 states have call predecessors, (48), 48 states have call successors, (48) [2022-04-14 15:19:01,125 INFO L74 IsIncluded]: Start isIncluded. First operand 140 states. Second operand has 140 states, 77 states have (on average 1.2597402597402598) internal successors, (97), 84 states have internal predecessors, (97), 52 states have call successors, (52), 11 states have call predecessors, (52), 10 states have return successors, (48), 44 states have call predecessors, (48), 48 states have call successors, (48) [2022-04-14 15:19:01,126 INFO L87 Difference]: Start difference. First operand 140 states. Second operand has 140 states, 77 states have (on average 1.2597402597402598) internal successors, (97), 84 states have internal predecessors, (97), 52 states have call successors, (52), 11 states have call predecessors, (52), 10 states have return successors, (48), 44 states have call predecessors, (48), 48 states have call successors, (48) [2022-04-14 15:19:01,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 15:19:01,132 INFO L93 Difference]: Finished difference Result 140 states and 197 transitions. [2022-04-14 15:19:01,132 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 197 transitions. [2022-04-14 15:19:01,132 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 15:19:01,133 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 15:19:01,134 INFO L74 IsIncluded]: Start isIncluded. First operand has 140 states, 77 states have (on average 1.2597402597402598) internal successors, (97), 84 states have internal predecessors, (97), 52 states have call successors, (52), 11 states have call predecessors, (52), 10 states have return successors, (48), 44 states have call predecessors, (48), 48 states have call successors, (48) Second operand 140 states. [2022-04-14 15:19:01,134 INFO L87 Difference]: Start difference. First operand has 140 states, 77 states have (on average 1.2597402597402598) internal successors, (97), 84 states have internal predecessors, (97), 52 states have call successors, (52), 11 states have call predecessors, (52), 10 states have return successors, (48), 44 states have call predecessors, (48), 48 states have call successors, (48) Second operand 140 states. [2022-04-14 15:19:01,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 15:19:01,140 INFO L93 Difference]: Finished difference Result 140 states and 197 transitions. [2022-04-14 15:19:01,140 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 197 transitions. [2022-04-14 15:19:01,141 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 15:19:01,141 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 15:19:01,141 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-14 15:19:01,141 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-14 15:19:01,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 140 states, 77 states have (on average 1.2597402597402598) internal successors, (97), 84 states have internal predecessors, (97), 52 states have call successors, (52), 11 states have call predecessors, (52), 10 states have return successors, (48), 44 states have call predecessors, (48), 48 states have call successors, (48) [2022-04-14 15:19:01,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 197 transitions. [2022-04-14 15:19:01,147 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 197 transitions. Word has length 31 [2022-04-14 15:19:01,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-14 15:19:01,147 INFO L478 AbstractCegarLoop]: Abstraction has 140 states and 197 transitions. [2022-04-14 15:19:01,148 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-14 15:19:01,148 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 197 transitions. [2022-04-14 15:19:01,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-04-14 15:19:01,148 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 15:19:01,148 INFO L499 BasicCegarLoop]: trace histogram [3, 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] [2022-04-14 15:19:01,154 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2022-04-14 15:19:01,353 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-14 15:19:01,353 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 15:19:01,353 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 15:19:01,353 INFO L85 PathProgramCache]: Analyzing trace with hash -1547125783, now seen corresponding path program 1 times [2022-04-14 15:19:01,353 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 15:19:01,353 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1743263164] [2022-04-14 15:19:01,353 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 15:19:01,353 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 15:19:01,363 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-14 15:19:01,364 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1609322678] [2022-04-14 15:19:01,364 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 15:19:01,364 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-14 15:19:01,364 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-14 15:19:01,365 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-14 15:19:01,388 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-04-14 15:19:01,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 15:19:01,462 INFO L263 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-14 15:19:01,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 15:19:01,470 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-14 15:19:01,640 INFO L272 TraceCheckUtils]: 0: Hoare triple {4396#true} call ULTIMATE.init(); {4396#true} is VALID [2022-04-14 15:19:01,641 INFO L290 TraceCheckUtils]: 1: Hoare triple {4396#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);~counter~0 := 0; {4396#true} is VALID [2022-04-14 15:19:01,641 INFO L290 TraceCheckUtils]: 2: Hoare triple {4396#true} assume true; {4396#true} is VALID [2022-04-14 15:19:01,641 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4396#true} {4396#true} #102#return; {4396#true} is VALID [2022-04-14 15:19:01,641 INFO L272 TraceCheckUtils]: 4: Hoare triple {4396#true} call #t~ret7 := main(); {4396#true} is VALID [2022-04-14 15:19:01,641 INFO L290 TraceCheckUtils]: 5: Hoare triple {4396#true} havoc ~n~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~h~0;~n~0 := #t~nondet4;havoc #t~nondet4; {4396#true} is VALID [2022-04-14 15:19:01,641 INFO L272 TraceCheckUtils]: 6: Hoare triple {4396#true} call assume_abort_if_not((if ~n~0 % 4294967296 < 1073741823 then 1 else 0)); {4396#true} is VALID [2022-04-14 15:19:01,641 INFO L290 TraceCheckUtils]: 7: Hoare triple {4396#true} ~cond := #in~cond; {4396#true} is VALID [2022-04-14 15:19:01,641 INFO L290 TraceCheckUtils]: 8: Hoare triple {4396#true} assume !(0 == ~cond); {4396#true} is VALID [2022-04-14 15:19:01,641 INFO L290 TraceCheckUtils]: 9: Hoare triple {4396#true} assume true; {4396#true} is VALID [2022-04-14 15:19:01,641 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {4396#true} {4396#true} #82#return; {4396#true} is VALID [2022-04-14 15:19:01,642 INFO L290 TraceCheckUtils]: 11: Hoare triple {4396#true} ~p~0 := 0;~q~0 := 1;~r~0 := ~n~0;~h~0 := 0; {4434#(and (= main_~p~0 0) (= main_~h~0 0))} is VALID [2022-04-14 15:19:01,642 INFO L290 TraceCheckUtils]: 12: Hoare triple {4434#(and (= main_~p~0 0) (= main_~h~0 0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {4434#(and (= main_~p~0 0) (= main_~h~0 0))} is VALID [2022-04-14 15:19:01,643 INFO L290 TraceCheckUtils]: 13: Hoare triple {4434#(and (= main_~p~0 0) (= main_~h~0 0))} assume !!(#t~post5 < 50);havoc #t~post5; {4434#(and (= main_~p~0 0) (= main_~h~0 0))} is VALID [2022-04-14 15:19:01,643 INFO L290 TraceCheckUtils]: 14: Hoare triple {4434#(and (= main_~p~0 0) (= main_~h~0 0))} assume !!(~q~0 % 4294967296 <= ~n~0 % 4294967296);~q~0 := 4 * ~q~0; {4434#(and (= main_~p~0 0) (= main_~h~0 0))} is VALID [2022-04-14 15:19:01,644 INFO L290 TraceCheckUtils]: 15: Hoare triple {4434#(and (= main_~p~0 0) (= main_~h~0 0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {4434#(and (= main_~p~0 0) (= main_~h~0 0))} is VALID [2022-04-14 15:19:01,644 INFO L290 TraceCheckUtils]: 16: Hoare triple {4434#(and (= main_~p~0 0) (= main_~h~0 0))} assume !!(#t~post5 < 50);havoc #t~post5; {4434#(and (= main_~p~0 0) (= main_~h~0 0))} is VALID [2022-04-14 15:19:01,645 INFO L290 TraceCheckUtils]: 17: Hoare triple {4434#(and (= main_~p~0 0) (= main_~h~0 0))} assume !(~q~0 % 4294967296 <= ~n~0 % 4294967296); {4434#(and (= main_~p~0 0) (= main_~h~0 0))} is VALID [2022-04-14 15:19:01,645 INFO L290 TraceCheckUtils]: 18: Hoare triple {4434#(and (= main_~p~0 0) (= main_~h~0 0))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {4434#(and (= main_~p~0 0) (= main_~h~0 0))} is VALID [2022-04-14 15:19:01,646 INFO L290 TraceCheckUtils]: 19: Hoare triple {4434#(and (= main_~p~0 0) (= main_~h~0 0))} assume !!(#t~post6 < 50);havoc #t~post6; {4434#(and (= main_~p~0 0) (= main_~h~0 0))} is VALID [2022-04-14 15:19:01,646 INFO L272 TraceCheckUtils]: 20: Hoare triple {4434#(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)); {4396#true} is VALID [2022-04-14 15:19:01,646 INFO L290 TraceCheckUtils]: 21: Hoare triple {4396#true} ~cond := #in~cond; {4396#true} is VALID [2022-04-14 15:19:01,646 INFO L290 TraceCheckUtils]: 22: Hoare triple {4396#true} assume !(0 == ~cond); {4396#true} is VALID [2022-04-14 15:19:01,646 INFO L290 TraceCheckUtils]: 23: Hoare triple {4396#true} assume true; {4396#true} is VALID [2022-04-14 15:19:01,647 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {4396#true} {4434#(and (= main_~p~0 0) (= main_~h~0 0))} #84#return; {4434#(and (= main_~p~0 0) (= main_~h~0 0))} is VALID [2022-04-14 15:19:01,647 INFO L272 TraceCheckUtils]: 25: Hoare triple {4434#(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)); {4396#true} is VALID [2022-04-14 15:19:01,647 INFO L290 TraceCheckUtils]: 26: Hoare triple {4396#true} ~cond := #in~cond; {4396#true} is VALID [2022-04-14 15:19:01,647 INFO L290 TraceCheckUtils]: 27: Hoare triple {4396#true} assume !(0 == ~cond); {4396#true} is VALID [2022-04-14 15:19:01,647 INFO L290 TraceCheckUtils]: 28: Hoare triple {4396#true} assume true; {4396#true} is VALID [2022-04-14 15:19:01,648 INFO L284 TraceCheckUtils]: 29: Hoare quadruple {4396#true} {4434#(and (= main_~p~0 0) (= main_~h~0 0))} #86#return; {4434#(and (= main_~p~0 0) (= main_~h~0 0))} is VALID [2022-04-14 15:19:01,649 INFO L272 TraceCheckUtils]: 30: Hoare triple {4434#(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)); {4492#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-14 15:19:01,649 INFO L290 TraceCheckUtils]: 31: Hoare triple {4492#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {4496#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-14 15:19:01,649 INFO L290 TraceCheckUtils]: 32: Hoare triple {4496#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {4397#false} is VALID [2022-04-14 15:19:01,649 INFO L290 TraceCheckUtils]: 33: Hoare triple {4397#false} assume !false; {4397#false} is VALID [2022-04-14 15:19:01,650 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-04-14 15:19:01,650 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-14 15:19:01,650 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 15:19:01,650 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1743263164] [2022-04-14 15:19:01,650 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-14 15:19:01,650 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1609322678] [2022-04-14 15:19:01,650 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1609322678] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-14 15:19:01,650 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-14 15:19:01,650 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-14 15:19:01,650 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [127122331] [2022-04-14 15:19:01,650 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-14 15:19:01,651 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.8) internal successors, (19), 4 states have internal predecessors, (19), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 34 [2022-04-14 15:19:01,651 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 15:19:01,651 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 3.8) internal successors, (19), 4 states have internal predecessors, (19), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-14 15:19:01,679 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-14 15:19:01,679 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-14 15:19:01,679 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 15:19:01,680 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-14 15:19:01,680 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-14 15:19:01,680 INFO L87 Difference]: Start difference. First operand 140 states and 197 transitions. Second operand has 5 states, 5 states have (on average 3.8) internal successors, (19), 4 states have internal predecessors, (19), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-14 15:19:08,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 15:19:08,211 INFO L93 Difference]: Finished difference Result 174 states and 233 transitions. [2022-04-14 15:19:08,211 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-14 15:19:08,212 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.8) internal successors, (19), 4 states have internal predecessors, (19), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 34 [2022-04-14 15:19:08,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-14 15:19:08,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.8) internal successors, (19), 4 states have internal predecessors, (19), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-14 15:19:08,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 73 transitions. [2022-04-14 15:19:08,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.8) internal successors, (19), 4 states have internal predecessors, (19), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-14 15:19:08,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 73 transitions. [2022-04-14 15:19:08,215 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 73 transitions. [2022-04-14 15:19:08,306 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 73 edges. 73 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 15:19:08,310 INFO L225 Difference]: With dead ends: 174 [2022-04-14 15:19:08,310 INFO L226 Difference]: Without dead ends: 169 [2022-04-14 15:19:08,310 INFO L912 BasicCegarLoop]: 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-14 15:19:08,311 INFO L913 BasicCegarLoop]: 51 mSDtfsCounter, 8 mSDsluCounter, 106 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 157 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-04-14 15:19:08,311 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [14 Valid, 157 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-04-14 15:19:08,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2022-04-14 15:19:08,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 167. [2022-04-14 15:19:08,392 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-14 15:19:08,393 INFO L82 GeneralOperation]: Start isEquivalent. First operand 169 states. Second operand has 167 states, 95 states have (on average 1.2) internal successors, (114), 101 states have internal predecessors, (114), 55 states have call successors, (55), 17 states have call predecessors, (55), 16 states have return successors, (50), 48 states have call predecessors, (50), 50 states have call successors, (50) [2022-04-14 15:19:08,393 INFO L74 IsIncluded]: Start isIncluded. First operand 169 states. Second operand has 167 states, 95 states have (on average 1.2) internal successors, (114), 101 states have internal predecessors, (114), 55 states have call successors, (55), 17 states have call predecessors, (55), 16 states have return successors, (50), 48 states have call predecessors, (50), 50 states have call successors, (50) [2022-04-14 15:19:08,393 INFO L87 Difference]: Start difference. First operand 169 states. Second operand has 167 states, 95 states have (on average 1.2) internal successors, (114), 101 states have internal predecessors, (114), 55 states have call successors, (55), 17 states have call predecessors, (55), 16 states have return successors, (50), 48 states have call predecessors, (50), 50 states have call successors, (50) [2022-04-14 15:19:08,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 15:19:08,399 INFO L93 Difference]: Finished difference Result 169 states and 221 transitions. [2022-04-14 15:19:08,400 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 221 transitions. [2022-04-14 15:19:08,400 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 15:19:08,400 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 15:19:08,401 INFO L74 IsIncluded]: Start isIncluded. First operand has 167 states, 95 states have (on average 1.2) internal successors, (114), 101 states have internal predecessors, (114), 55 states have call successors, (55), 17 states have call predecessors, (55), 16 states have return successors, (50), 48 states have call predecessors, (50), 50 states have call successors, (50) Second operand 169 states. [2022-04-14 15:19:08,401 INFO L87 Difference]: Start difference. First operand has 167 states, 95 states have (on average 1.2) internal successors, (114), 101 states have internal predecessors, (114), 55 states have call successors, (55), 17 states have call predecessors, (55), 16 states have return successors, (50), 48 states have call predecessors, (50), 50 states have call successors, (50) Second operand 169 states. [2022-04-14 15:19:08,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 15:19:08,406 INFO L93 Difference]: Finished difference Result 169 states and 221 transitions. [2022-04-14 15:19:08,406 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 221 transitions. [2022-04-14 15:19:08,407 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 15:19:08,407 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 15:19:08,407 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-14 15:19:08,407 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-14 15:19:08,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 167 states, 95 states have (on average 1.2) internal successors, (114), 101 states have internal predecessors, (114), 55 states have call successors, (55), 17 states have call predecessors, (55), 16 states have return successors, (50), 48 states have call predecessors, (50), 50 states have call successors, (50) [2022-04-14 15:19:08,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 219 transitions. [2022-04-14 15:19:08,413 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 219 transitions. Word has length 34 [2022-04-14 15:19:08,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-14 15:19:08,413 INFO L478 AbstractCegarLoop]: Abstraction has 167 states and 219 transitions. [2022-04-14 15:19:08,413 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.8) internal successors, (19), 4 states have internal predecessors, (19), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-14 15:19:08,413 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 219 transitions. [2022-04-14 15:19:08,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-04-14 15:19:08,414 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 15:19:08,414 INFO L499 BasicCegarLoop]: trace histogram [5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-14 15:19:08,426 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-04-14 15:19:08,625 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-14 15:19:08,626 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 15:19:08,626 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 15:19:08,626 INFO L85 PathProgramCache]: Analyzing trace with hash 821435566, now seen corresponding path program 1 times [2022-04-14 15:19:08,626 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 15:19:08,626 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [597944285] [2022-04-14 15:19:08,626 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 15:19:08,627 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 15:19:08,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 15:19:08,722 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-14 15:19:08,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 15:19:08,732 INFO L290 TraceCheckUtils]: 0: Hoare triple {5357#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {5347#(<= ~counter~0 0)} is VALID [2022-04-14 15:19:08,732 INFO L290 TraceCheckUtils]: 1: Hoare triple {5347#(<= ~counter~0 0)} assume true; {5347#(<= ~counter~0 0)} is VALID [2022-04-14 15:19:08,733 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {5347#(<= ~counter~0 0)} {5342#true} #102#return; {5347#(<= ~counter~0 0)} is VALID [2022-04-14 15:19:08,733 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-14 15:19:08,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 15:19:08,738 INFO L290 TraceCheckUtils]: 0: Hoare triple {5342#true} ~cond := #in~cond; {5342#true} is VALID [2022-04-14 15:19:08,738 INFO L290 TraceCheckUtils]: 1: Hoare triple {5342#true} assume !(0 == ~cond); {5342#true} is VALID [2022-04-14 15:19:08,738 INFO L290 TraceCheckUtils]: 2: Hoare triple {5342#true} assume true; {5342#true} is VALID [2022-04-14 15:19:08,739 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5342#true} {5347#(<= ~counter~0 0)} #82#return; {5347#(<= ~counter~0 0)} is VALID [2022-04-14 15:19:08,740 INFO L272 TraceCheckUtils]: 0: Hoare triple {5342#true} call ULTIMATE.init(); {5357#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-14 15:19:08,740 INFO L290 TraceCheckUtils]: 1: Hoare triple {5357#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {5347#(<= ~counter~0 0)} is VALID [2022-04-14 15:19:08,741 INFO L290 TraceCheckUtils]: 2: Hoare triple {5347#(<= ~counter~0 0)} assume true; {5347#(<= ~counter~0 0)} is VALID [2022-04-14 15:19:08,741 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5347#(<= ~counter~0 0)} {5342#true} #102#return; {5347#(<= ~counter~0 0)} is VALID [2022-04-14 15:19:08,741 INFO L272 TraceCheckUtils]: 4: Hoare triple {5347#(<= ~counter~0 0)} call #t~ret7 := main(); {5347#(<= ~counter~0 0)} is VALID [2022-04-14 15:19:08,742 INFO L290 TraceCheckUtils]: 5: Hoare triple {5347#(<= ~counter~0 0)} havoc ~n~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~h~0;~n~0 := #t~nondet4;havoc #t~nondet4; {5347#(<= ~counter~0 0)} is VALID [2022-04-14 15:19:08,742 INFO L272 TraceCheckUtils]: 6: Hoare triple {5347#(<= ~counter~0 0)} call assume_abort_if_not((if ~n~0 % 4294967296 < 1073741823 then 1 else 0)); {5342#true} is VALID [2022-04-14 15:19:08,742 INFO L290 TraceCheckUtils]: 7: Hoare triple {5342#true} ~cond := #in~cond; {5342#true} is VALID [2022-04-14 15:19:08,742 INFO L290 TraceCheckUtils]: 8: Hoare triple {5342#true} assume !(0 == ~cond); {5342#true} is VALID [2022-04-14 15:19:08,742 INFO L290 TraceCheckUtils]: 9: Hoare triple {5342#true} assume true; {5342#true} is VALID [2022-04-14 15:19:08,743 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {5342#true} {5347#(<= ~counter~0 0)} #82#return; {5347#(<= ~counter~0 0)} is VALID [2022-04-14 15:19:08,743 INFO L290 TraceCheckUtils]: 11: Hoare triple {5347#(<= ~counter~0 0)} ~p~0 := 0;~q~0 := 1;~r~0 := ~n~0;~h~0 := 0; {5347#(<= ~counter~0 0)} is VALID [2022-04-14 15:19:08,744 INFO L290 TraceCheckUtils]: 12: Hoare triple {5347#(<= ~counter~0 0)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {5352#(<= ~counter~0 1)} is VALID [2022-04-14 15:19:08,745 INFO L290 TraceCheckUtils]: 13: Hoare triple {5352#(<= ~counter~0 1)} assume !!(#t~post5 < 50);havoc #t~post5; {5352#(<= ~counter~0 1)} is VALID [2022-04-14 15:19:08,745 INFO L290 TraceCheckUtils]: 14: Hoare triple {5352#(<= ~counter~0 1)} assume !!(~q~0 % 4294967296 <= ~n~0 % 4294967296);~q~0 := 4 * ~q~0; {5352#(<= ~counter~0 1)} is VALID [2022-04-14 15:19:08,746 INFO L290 TraceCheckUtils]: 15: Hoare triple {5352#(<= ~counter~0 1)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {5353#(<= ~counter~0 2)} is VALID [2022-04-14 15:19:08,746 INFO L290 TraceCheckUtils]: 16: Hoare triple {5353#(<= ~counter~0 2)} assume !!(#t~post5 < 50);havoc #t~post5; {5353#(<= ~counter~0 2)} is VALID [2022-04-14 15:19:08,747 INFO L290 TraceCheckUtils]: 17: Hoare triple {5353#(<= ~counter~0 2)} assume !!(~q~0 % 4294967296 <= ~n~0 % 4294967296);~q~0 := 4 * ~q~0; {5353#(<= ~counter~0 2)} is VALID [2022-04-14 15:19:08,747 INFO L290 TraceCheckUtils]: 18: Hoare triple {5353#(<= ~counter~0 2)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {5354#(<= ~counter~0 3)} is VALID [2022-04-14 15:19:08,748 INFO L290 TraceCheckUtils]: 19: Hoare triple {5354#(<= ~counter~0 3)} assume !!(#t~post5 < 50);havoc #t~post5; {5354#(<= ~counter~0 3)} is VALID [2022-04-14 15:19:08,748 INFO L290 TraceCheckUtils]: 20: Hoare triple {5354#(<= ~counter~0 3)} assume !!(~q~0 % 4294967296 <= ~n~0 % 4294967296);~q~0 := 4 * ~q~0; {5354#(<= ~counter~0 3)} is VALID [2022-04-14 15:19:08,749 INFO L290 TraceCheckUtils]: 21: Hoare triple {5354#(<= ~counter~0 3)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {5355#(<= ~counter~0 4)} is VALID [2022-04-14 15:19:08,749 INFO L290 TraceCheckUtils]: 22: Hoare triple {5355#(<= ~counter~0 4)} assume !!(#t~post5 < 50);havoc #t~post5; {5355#(<= ~counter~0 4)} is VALID [2022-04-14 15:19:08,749 INFO L290 TraceCheckUtils]: 23: Hoare triple {5355#(<= ~counter~0 4)} assume !!(~q~0 % 4294967296 <= ~n~0 % 4294967296);~q~0 := 4 * ~q~0; {5355#(<= ~counter~0 4)} is VALID [2022-04-14 15:19:08,750 INFO L290 TraceCheckUtils]: 24: Hoare triple {5355#(<= ~counter~0 4)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {5356#(<= |main_#t~post5| 4)} is VALID [2022-04-14 15:19:08,750 INFO L290 TraceCheckUtils]: 25: Hoare triple {5356#(<= |main_#t~post5| 4)} assume !(#t~post5 < 50);havoc #t~post5; {5343#false} is VALID [2022-04-14 15:19:08,751 INFO L290 TraceCheckUtils]: 26: Hoare triple {5343#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {5343#false} is VALID [2022-04-14 15:19:08,751 INFO L290 TraceCheckUtils]: 27: Hoare triple {5343#false} assume !!(#t~post6 < 50);havoc #t~post6; {5343#false} is VALID [2022-04-14 15:19:08,751 INFO L272 TraceCheckUtils]: 28: Hoare triple {5343#false} call __VERIFIER_assert((if ~r~0 % 4294967296 < (2 * ~p~0 + ~q~0) % 4294967296 then 1 else 0)); {5343#false} is VALID [2022-04-14 15:19:08,751 INFO L290 TraceCheckUtils]: 29: Hoare triple {5343#false} ~cond := #in~cond; {5343#false} is VALID [2022-04-14 15:19:08,751 INFO L290 TraceCheckUtils]: 30: Hoare triple {5343#false} assume 0 == ~cond; {5343#false} is VALID [2022-04-14 15:19:08,751 INFO L290 TraceCheckUtils]: 31: Hoare triple {5343#false} assume !false; {5343#false} is VALID [2022-04-14 15:19:08,751 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-14 15:19:08,751 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 15:19:08,751 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [597944285] [2022-04-14 15:19:08,751 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [597944285] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-14 15:19:08,752 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1994923794] [2022-04-14 15:19:08,752 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 15:19:08,752 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-14 15:19:08,752 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-14 15:19:08,756 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-14 15:19:08,779 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-04-14 15:19:08,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 15:19:08,805 INFO L263 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 13 conjunts are in the unsatisfiable core [2022-04-14 15:19:08,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 15:19:08,825 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-14 15:19:09,081 INFO L272 TraceCheckUtils]: 0: Hoare triple {5342#true} call ULTIMATE.init(); {5342#true} is VALID [2022-04-14 15:19:09,081 INFO L290 TraceCheckUtils]: 1: Hoare triple {5342#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);~counter~0 := 0; {5347#(<= ~counter~0 0)} is VALID [2022-04-14 15:19:09,082 INFO L290 TraceCheckUtils]: 2: Hoare triple {5347#(<= ~counter~0 0)} assume true; {5347#(<= ~counter~0 0)} is VALID [2022-04-14 15:19:09,084 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5347#(<= ~counter~0 0)} {5342#true} #102#return; {5347#(<= ~counter~0 0)} is VALID [2022-04-14 15:19:09,085 INFO L272 TraceCheckUtils]: 4: Hoare triple {5347#(<= ~counter~0 0)} call #t~ret7 := main(); {5347#(<= ~counter~0 0)} is VALID [2022-04-14 15:19:09,086 INFO L290 TraceCheckUtils]: 5: Hoare triple {5347#(<= ~counter~0 0)} havoc ~n~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~h~0;~n~0 := #t~nondet4;havoc #t~nondet4; {5347#(<= ~counter~0 0)} is VALID [2022-04-14 15:19:09,088 INFO L272 TraceCheckUtils]: 6: Hoare triple {5347#(<= ~counter~0 0)} call assume_abort_if_not((if ~n~0 % 4294967296 < 1073741823 then 1 else 0)); {5347#(<= ~counter~0 0)} is VALID [2022-04-14 15:19:09,089 INFO L290 TraceCheckUtils]: 7: Hoare triple {5347#(<= ~counter~0 0)} ~cond := #in~cond; {5347#(<= ~counter~0 0)} is VALID [2022-04-14 15:19:09,090 INFO L290 TraceCheckUtils]: 8: Hoare triple {5347#(<= ~counter~0 0)} assume !(0 == ~cond); {5347#(<= ~counter~0 0)} is VALID [2022-04-14 15:19:09,090 INFO L290 TraceCheckUtils]: 9: Hoare triple {5347#(<= ~counter~0 0)} assume true; {5347#(<= ~counter~0 0)} is VALID [2022-04-14 15:19:09,091 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {5347#(<= ~counter~0 0)} {5347#(<= ~counter~0 0)} #82#return; {5347#(<= ~counter~0 0)} is VALID [2022-04-14 15:19:09,091 INFO L290 TraceCheckUtils]: 11: Hoare triple {5347#(<= ~counter~0 0)} ~p~0 := 0;~q~0 := 1;~r~0 := ~n~0;~h~0 := 0; {5347#(<= ~counter~0 0)} is VALID [2022-04-14 15:19:09,092 INFO L290 TraceCheckUtils]: 12: Hoare triple {5347#(<= ~counter~0 0)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {5352#(<= ~counter~0 1)} is VALID [2022-04-14 15:19:09,092 INFO L290 TraceCheckUtils]: 13: Hoare triple {5352#(<= ~counter~0 1)} assume !!(#t~post5 < 50);havoc #t~post5; {5352#(<= ~counter~0 1)} is VALID [2022-04-14 15:19:09,093 INFO L290 TraceCheckUtils]: 14: Hoare triple {5352#(<= ~counter~0 1)} assume !!(~q~0 % 4294967296 <= ~n~0 % 4294967296);~q~0 := 4 * ~q~0; {5352#(<= ~counter~0 1)} is VALID [2022-04-14 15:19:09,093 INFO L290 TraceCheckUtils]: 15: Hoare triple {5352#(<= ~counter~0 1)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {5353#(<= ~counter~0 2)} is VALID [2022-04-14 15:19:09,094 INFO L290 TraceCheckUtils]: 16: Hoare triple {5353#(<= ~counter~0 2)} assume !!(#t~post5 < 50);havoc #t~post5; {5353#(<= ~counter~0 2)} is VALID [2022-04-14 15:19:09,094 INFO L290 TraceCheckUtils]: 17: Hoare triple {5353#(<= ~counter~0 2)} assume !!(~q~0 % 4294967296 <= ~n~0 % 4294967296);~q~0 := 4 * ~q~0; {5353#(<= ~counter~0 2)} is VALID [2022-04-14 15:19:09,095 INFO L290 TraceCheckUtils]: 18: Hoare triple {5353#(<= ~counter~0 2)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {5354#(<= ~counter~0 3)} is VALID [2022-04-14 15:19:09,095 INFO L290 TraceCheckUtils]: 19: Hoare triple {5354#(<= ~counter~0 3)} assume !!(#t~post5 < 50);havoc #t~post5; {5354#(<= ~counter~0 3)} is VALID [2022-04-14 15:19:09,095 INFO L290 TraceCheckUtils]: 20: Hoare triple {5354#(<= ~counter~0 3)} assume !!(~q~0 % 4294967296 <= ~n~0 % 4294967296);~q~0 := 4 * ~q~0; {5354#(<= ~counter~0 3)} is VALID [2022-04-14 15:19:09,096 INFO L290 TraceCheckUtils]: 21: Hoare triple {5354#(<= ~counter~0 3)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {5355#(<= ~counter~0 4)} is VALID [2022-04-14 15:19:09,096 INFO L290 TraceCheckUtils]: 22: Hoare triple {5355#(<= ~counter~0 4)} assume !!(#t~post5 < 50);havoc #t~post5; {5355#(<= ~counter~0 4)} is VALID [2022-04-14 15:19:09,097 INFO L290 TraceCheckUtils]: 23: Hoare triple {5355#(<= ~counter~0 4)} assume !!(~q~0 % 4294967296 <= ~n~0 % 4294967296);~q~0 := 4 * ~q~0; {5355#(<= ~counter~0 4)} is VALID [2022-04-14 15:19:09,097 INFO L290 TraceCheckUtils]: 24: Hoare triple {5355#(<= ~counter~0 4)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {5356#(<= |main_#t~post5| 4)} is VALID [2022-04-14 15:19:09,098 INFO L290 TraceCheckUtils]: 25: Hoare triple {5356#(<= |main_#t~post5| 4)} assume !(#t~post5 < 50);havoc #t~post5; {5343#false} is VALID [2022-04-14 15:19:09,098 INFO L290 TraceCheckUtils]: 26: Hoare triple {5343#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {5343#false} is VALID [2022-04-14 15:19:09,098 INFO L290 TraceCheckUtils]: 27: Hoare triple {5343#false} assume !!(#t~post6 < 50);havoc #t~post6; {5343#false} is VALID [2022-04-14 15:19:09,098 INFO L272 TraceCheckUtils]: 28: Hoare triple {5343#false} call __VERIFIER_assert((if ~r~0 % 4294967296 < (2 * ~p~0 + ~q~0) % 4294967296 then 1 else 0)); {5343#false} is VALID [2022-04-14 15:19:09,098 INFO L290 TraceCheckUtils]: 29: Hoare triple {5343#false} ~cond := #in~cond; {5343#false} is VALID [2022-04-14 15:19:09,098 INFO L290 TraceCheckUtils]: 30: Hoare triple {5343#false} assume 0 == ~cond; {5343#false} is VALID [2022-04-14 15:19:09,098 INFO L290 TraceCheckUtils]: 31: Hoare triple {5343#false} assume !false; {5343#false} is VALID [2022-04-14 15:19:09,098 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-14 15:19:09,098 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-14 15:19:09,438 INFO L290 TraceCheckUtils]: 31: Hoare triple {5343#false} assume !false; {5343#false} is VALID [2022-04-14 15:19:09,438 INFO L290 TraceCheckUtils]: 30: Hoare triple {5343#false} assume 0 == ~cond; {5343#false} is VALID [2022-04-14 15:19:09,438 INFO L290 TraceCheckUtils]: 29: Hoare triple {5343#false} ~cond := #in~cond; {5343#false} is VALID [2022-04-14 15:19:09,438 INFO L272 TraceCheckUtils]: 28: Hoare triple {5343#false} call __VERIFIER_assert((if ~r~0 % 4294967296 < (2 * ~p~0 + ~q~0) % 4294967296 then 1 else 0)); {5343#false} is VALID [2022-04-14 15:19:09,438 INFO L290 TraceCheckUtils]: 27: Hoare triple {5343#false} assume !!(#t~post6 < 50);havoc #t~post6; {5343#false} is VALID [2022-04-14 15:19:09,438 INFO L290 TraceCheckUtils]: 26: Hoare triple {5343#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {5343#false} is VALID [2022-04-14 15:19:09,439 INFO L290 TraceCheckUtils]: 25: Hoare triple {5472#(< |main_#t~post5| 50)} assume !(#t~post5 < 50);havoc #t~post5; {5343#false} is VALID [2022-04-14 15:19:09,439 INFO L290 TraceCheckUtils]: 24: Hoare triple {5476#(< ~counter~0 50)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {5472#(< |main_#t~post5| 50)} is VALID [2022-04-14 15:19:09,440 INFO L290 TraceCheckUtils]: 23: Hoare triple {5476#(< ~counter~0 50)} assume !!(~q~0 % 4294967296 <= ~n~0 % 4294967296);~q~0 := 4 * ~q~0; {5476#(< ~counter~0 50)} is VALID [2022-04-14 15:19:09,440 INFO L290 TraceCheckUtils]: 22: Hoare triple {5476#(< ~counter~0 50)} assume !!(#t~post5 < 50);havoc #t~post5; {5476#(< ~counter~0 50)} is VALID [2022-04-14 15:19:09,441 INFO L290 TraceCheckUtils]: 21: Hoare triple {5486#(< ~counter~0 49)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {5476#(< ~counter~0 50)} is VALID [2022-04-14 15:19:09,441 INFO L290 TraceCheckUtils]: 20: Hoare triple {5486#(< ~counter~0 49)} assume !!(~q~0 % 4294967296 <= ~n~0 % 4294967296);~q~0 := 4 * ~q~0; {5486#(< ~counter~0 49)} is VALID [2022-04-14 15:19:09,441 INFO L290 TraceCheckUtils]: 19: Hoare triple {5486#(< ~counter~0 49)} assume !!(#t~post5 < 50);havoc #t~post5; {5486#(< ~counter~0 49)} is VALID [2022-04-14 15:19:09,442 INFO L290 TraceCheckUtils]: 18: Hoare triple {5496#(< ~counter~0 48)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {5486#(< ~counter~0 49)} is VALID [2022-04-14 15:19:09,442 INFO L290 TraceCheckUtils]: 17: Hoare triple {5496#(< ~counter~0 48)} assume !!(~q~0 % 4294967296 <= ~n~0 % 4294967296);~q~0 := 4 * ~q~0; {5496#(< ~counter~0 48)} is VALID [2022-04-14 15:19:09,443 INFO L290 TraceCheckUtils]: 16: Hoare triple {5496#(< ~counter~0 48)} assume !!(#t~post5 < 50);havoc #t~post5; {5496#(< ~counter~0 48)} is VALID [2022-04-14 15:19:09,443 INFO L290 TraceCheckUtils]: 15: Hoare triple {5506#(< ~counter~0 47)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {5496#(< ~counter~0 48)} is VALID [2022-04-14 15:19:09,444 INFO L290 TraceCheckUtils]: 14: Hoare triple {5506#(< ~counter~0 47)} assume !!(~q~0 % 4294967296 <= ~n~0 % 4294967296);~q~0 := 4 * ~q~0; {5506#(< ~counter~0 47)} is VALID [2022-04-14 15:19:09,444 INFO L290 TraceCheckUtils]: 13: Hoare triple {5506#(< ~counter~0 47)} assume !!(#t~post5 < 50);havoc #t~post5; {5506#(< ~counter~0 47)} is VALID [2022-04-14 15:19:09,444 INFO L290 TraceCheckUtils]: 12: Hoare triple {5516#(< ~counter~0 46)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {5506#(< ~counter~0 47)} is VALID [2022-04-14 15:19:09,445 INFO L290 TraceCheckUtils]: 11: Hoare triple {5516#(< ~counter~0 46)} ~p~0 := 0;~q~0 := 1;~r~0 := ~n~0;~h~0 := 0; {5516#(< ~counter~0 46)} is VALID [2022-04-14 15:19:09,445 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {5342#true} {5516#(< ~counter~0 46)} #82#return; {5516#(< ~counter~0 46)} is VALID [2022-04-14 15:19:09,445 INFO L290 TraceCheckUtils]: 9: Hoare triple {5342#true} assume true; {5342#true} is VALID [2022-04-14 15:19:09,445 INFO L290 TraceCheckUtils]: 8: Hoare triple {5342#true} assume !(0 == ~cond); {5342#true} is VALID [2022-04-14 15:19:09,446 INFO L290 TraceCheckUtils]: 7: Hoare triple {5342#true} ~cond := #in~cond; {5342#true} is VALID [2022-04-14 15:19:09,446 INFO L272 TraceCheckUtils]: 6: Hoare triple {5516#(< ~counter~0 46)} call assume_abort_if_not((if ~n~0 % 4294967296 < 1073741823 then 1 else 0)); {5342#true} is VALID [2022-04-14 15:19:09,446 INFO L290 TraceCheckUtils]: 5: Hoare triple {5516#(< ~counter~0 46)} havoc ~n~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~h~0;~n~0 := #t~nondet4;havoc #t~nondet4; {5516#(< ~counter~0 46)} is VALID [2022-04-14 15:19:09,446 INFO L272 TraceCheckUtils]: 4: Hoare triple {5516#(< ~counter~0 46)} call #t~ret7 := main(); {5516#(< ~counter~0 46)} is VALID [2022-04-14 15:19:09,447 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5516#(< ~counter~0 46)} {5342#true} #102#return; {5516#(< ~counter~0 46)} is VALID [2022-04-14 15:19:09,447 INFO L290 TraceCheckUtils]: 2: Hoare triple {5516#(< ~counter~0 46)} assume true; {5516#(< ~counter~0 46)} is VALID [2022-04-14 15:19:09,448 INFO L290 TraceCheckUtils]: 1: Hoare triple {5342#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);~counter~0 := 0; {5516#(< ~counter~0 46)} is VALID [2022-04-14 15:19:09,448 INFO L272 TraceCheckUtils]: 0: Hoare triple {5342#true} call ULTIMATE.init(); {5342#true} is VALID [2022-04-14 15:19:09,448 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-14 15:19:09,448 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1994923794] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-14 15:19:09,448 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-14 15:19:09,448 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 15 [2022-04-14 15:19:09,448 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [599398376] [2022-04-14 15:19:09,449 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-14 15:19:09,449 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 3.2) internal successors, (48), 14 states have internal predecessors, (48), 4 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (5), 2 states have call predecessors, (5), 3 states have call successors, (5) Word has length 32 [2022-04-14 15:19:09,449 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 15:19:09,450 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 15 states, 15 states have (on average 3.2) internal successors, (48), 14 states have internal predecessors, (48), 4 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (5), 2 states have call predecessors, (5), 3 states have call successors, (5) [2022-04-14 15:19:09,500 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 61 edges. 61 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 15:19:09,500 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-04-14 15:19:09,500 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 15:19:09,501 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-04-14 15:19:09,501 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=137, Unknown=0, NotChecked=0, Total=210 [2022-04-14 15:19:09,501 INFO L87 Difference]: Start difference. First operand 167 states and 219 transitions. Second operand has 15 states, 15 states have (on average 3.2) internal successors, (48), 14 states have internal predecessors, (48), 4 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (5), 2 states have call predecessors, (5), 3 states have call successors, (5) [2022-04-14 15:19:15,693 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-14 15:19:23,375 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-14 15:19:25,419 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.13s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-14 15:19:29,256 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-14 15:19:31,400 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-14 15:19:35,564 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-14 15:19:48,074 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-14 15:20:00,131 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.80s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-14 15:20:04,218 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-14 15:20:06,224 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-14 15:20:07,487 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.26s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-14 15:20:15,310 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-14 15:20:17,681 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-14 15:20:19,685 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-14 15:20:21,689 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-14 15:20:24,189 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-14 15:20:33,417 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-14 15:20:34,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 15:20:34,285 INFO L93 Difference]: Finished difference Result 367 states and 475 transitions. [2022-04-14 15:20:34,285 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-04-14 15:20:34,286 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 3.2) internal successors, (48), 14 states have internal predecessors, (48), 4 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (5), 2 states have call predecessors, (5), 3 states have call successors, (5) Word has length 32 [2022-04-14 15:20:34,286 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-14 15:20:34,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 15 states have (on average 3.2) internal successors, (48), 14 states have internal predecessors, (48), 4 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (5), 2 states have call predecessors, (5), 3 states have call successors, (5) [2022-04-14 15:20:34,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 277 transitions. [2022-04-14 15:20:34,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 15 states have (on average 3.2) internal successors, (48), 14 states have internal predecessors, (48), 4 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (5), 2 states have call predecessors, (5), 3 states have call successors, (5) [2022-04-14 15:20:34,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 277 transitions. [2022-04-14 15:20:34,294 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 31 states and 277 transitions. [2022-04-14 15:20:34,604 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 277 edges. 277 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 15:20:34,613 INFO L225 Difference]: With dead ends: 367 [2022-04-14 15:20:34,613 INFO L226 Difference]: Without dead ends: 323 [2022-04-14 15:20:34,614 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 165 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=276, Invalid=716, Unknown=0, NotChecked=0, Total=992 [2022-04-14 15:20:34,614 INFO L913 BasicCegarLoop]: 60 mSDtfsCounter, 204 mSDsluCounter, 127 mSDsCounter, 0 mSdLazyCounter, 432 mSolverCounterSat, 138 mSolverCounterUnsat, 15 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 51.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 244 SdHoareTripleChecker+Valid, 187 SdHoareTripleChecker+Invalid, 585 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 138 IncrementalHoareTripleChecker+Valid, 432 IncrementalHoareTripleChecker+Invalid, 15 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 52.0s IncrementalHoareTripleChecker+Time [2022-04-14 15:20:34,614 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [244 Valid, 187 Invalid, 585 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [138 Valid, 432 Invalid, 15 Unknown, 0 Unchecked, 52.0s Time] [2022-04-14 15:20:34,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 323 states. [2022-04-14 15:20:34,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 323 to 306. [2022-04-14 15:20:34,761 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-14 15:20:34,762 INFO L82 GeneralOperation]: Start isEquivalent. First operand 323 states. Second operand has 306 states, 172 states have (on average 1.2093023255813953) internal successors, (208), 187 states have internal predecessors, (208), 102 states have call successors, (102), 33 states have call predecessors, (102), 31 states have return successors, (90), 85 states have call predecessors, (90), 90 states have call successors, (90) [2022-04-14 15:20:34,763 INFO L74 IsIncluded]: Start isIncluded. First operand 323 states. Second operand has 306 states, 172 states have (on average 1.2093023255813953) internal successors, (208), 187 states have internal predecessors, (208), 102 states have call successors, (102), 33 states have call predecessors, (102), 31 states have return successors, (90), 85 states have call predecessors, (90), 90 states have call successors, (90) [2022-04-14 15:20:34,763 INFO L87 Difference]: Start difference. First operand 323 states. Second operand has 306 states, 172 states have (on average 1.2093023255813953) internal successors, (208), 187 states have internal predecessors, (208), 102 states have call successors, (102), 33 states have call predecessors, (102), 31 states have return successors, (90), 85 states have call predecessors, (90), 90 states have call successors, (90) [2022-04-14 15:20:34,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 15:20:34,774 INFO L93 Difference]: Finished difference Result 323 states and 412 transitions. [2022-04-14 15:20:34,775 INFO L276 IsEmpty]: Start isEmpty. Operand 323 states and 412 transitions. [2022-04-14 15:20:34,776 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 15:20:34,776 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 15:20:34,777 INFO L74 IsIncluded]: Start isIncluded. First operand has 306 states, 172 states have (on average 1.2093023255813953) internal successors, (208), 187 states have internal predecessors, (208), 102 states have call successors, (102), 33 states have call predecessors, (102), 31 states have return successors, (90), 85 states have call predecessors, (90), 90 states have call successors, (90) Second operand 323 states. [2022-04-14 15:20:34,777 INFO L87 Difference]: Start difference. First operand has 306 states, 172 states have (on average 1.2093023255813953) internal successors, (208), 187 states have internal predecessors, (208), 102 states have call successors, (102), 33 states have call predecessors, (102), 31 states have return successors, (90), 85 states have call predecessors, (90), 90 states have call successors, (90) Second operand 323 states. [2022-04-14 15:20:34,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 15:20:34,789 INFO L93 Difference]: Finished difference Result 323 states and 412 transitions. [2022-04-14 15:20:34,789 INFO L276 IsEmpty]: Start isEmpty. Operand 323 states and 412 transitions. [2022-04-14 15:20:34,790 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 15:20:34,790 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 15:20:34,790 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-14 15:20:34,790 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-14 15:20:34,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 306 states, 172 states have (on average 1.2093023255813953) internal successors, (208), 187 states have internal predecessors, (208), 102 states have call successors, (102), 33 states have call predecessors, (102), 31 states have return successors, (90), 85 states have call predecessors, (90), 90 states have call successors, (90) [2022-04-14 15:20:34,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 306 states to 306 states and 400 transitions. [2022-04-14 15:20:34,802 INFO L78 Accepts]: Start accepts. Automaton has 306 states and 400 transitions. Word has length 32 [2022-04-14 15:20:34,802 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-14 15:20:34,802 INFO L478 AbstractCegarLoop]: Abstraction has 306 states and 400 transitions. [2022-04-14 15:20:34,802 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 3.2) internal successors, (48), 14 states have internal predecessors, (48), 4 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (5), 2 states have call predecessors, (5), 3 states have call successors, (5) [2022-04-14 15:20:34,802 INFO L276 IsEmpty]: Start isEmpty. Operand 306 states and 400 transitions. [2022-04-14 15:20:34,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-04-14 15:20:34,805 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 15:20:34,805 INFO L499 BasicCegarLoop]: trace histogram [6, 6, 5, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-14 15:20:34,828 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-04-14 15:20:35,019 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-04-14 15:20:35,020 INFO L403 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 15:20:35,020 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 15:20:35,020 INFO L85 PathProgramCache]: Analyzing trace with hash 1930383628, now seen corresponding path program 1 times [2022-04-14 15:20:35,020 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 15:20:35,020 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [677114713] [2022-04-14 15:20:35,020 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 15:20:35,020 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 15:20:35,033 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-14 15:20:35,033 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [857104727] [2022-04-14 15:20:35,033 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 15:20:35,033 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-14 15:20:35,034 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-14 15:20:35,034 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-14 15:20:35,038 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-04-14 15:20:35,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 15:20:35,082 INFO L263 TraceCheckSpWp]: Trace formula consists of 135 conjuncts, 17 conjunts are in the unsatisfiable core [2022-04-14 15:20:35,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 15:20:35,096 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-14 15:20:35,403 INFO L272 TraceCheckUtils]: 0: Hoare triple {7223#true} call ULTIMATE.init(); {7223#true} is VALID [2022-04-14 15:20:35,404 INFO L290 TraceCheckUtils]: 1: Hoare triple {7223#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);~counter~0 := 0; {7231#(<= ~counter~0 0)} is VALID [2022-04-14 15:20:35,404 INFO L290 TraceCheckUtils]: 2: Hoare triple {7231#(<= ~counter~0 0)} assume true; {7231#(<= ~counter~0 0)} is VALID [2022-04-14 15:20:35,404 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7231#(<= ~counter~0 0)} {7223#true} #102#return; {7231#(<= ~counter~0 0)} is VALID [2022-04-14 15:20:35,405 INFO L272 TraceCheckUtils]: 4: Hoare triple {7231#(<= ~counter~0 0)} call #t~ret7 := main(); {7231#(<= ~counter~0 0)} is VALID [2022-04-14 15:20:35,405 INFO L290 TraceCheckUtils]: 5: Hoare triple {7231#(<= ~counter~0 0)} havoc ~n~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~h~0;~n~0 := #t~nondet4;havoc #t~nondet4; {7231#(<= ~counter~0 0)} is VALID [2022-04-14 15:20:35,406 INFO L272 TraceCheckUtils]: 6: Hoare triple {7231#(<= ~counter~0 0)} call assume_abort_if_not((if ~n~0 % 4294967296 < 1073741823 then 1 else 0)); {7231#(<= ~counter~0 0)} is VALID [2022-04-14 15:20:35,406 INFO L290 TraceCheckUtils]: 7: Hoare triple {7231#(<= ~counter~0 0)} ~cond := #in~cond; {7231#(<= ~counter~0 0)} is VALID [2022-04-14 15:20:35,407 INFO L290 TraceCheckUtils]: 8: Hoare triple {7231#(<= ~counter~0 0)} assume !(0 == ~cond); {7231#(<= ~counter~0 0)} is VALID [2022-04-14 15:20:35,407 INFO L290 TraceCheckUtils]: 9: Hoare triple {7231#(<= ~counter~0 0)} assume true; {7231#(<= ~counter~0 0)} is VALID [2022-04-14 15:20:35,411 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {7231#(<= ~counter~0 0)} {7231#(<= ~counter~0 0)} #82#return; {7231#(<= ~counter~0 0)} is VALID [2022-04-14 15:20:35,412 INFO L290 TraceCheckUtils]: 11: Hoare triple {7231#(<= ~counter~0 0)} ~p~0 := 0;~q~0 := 1;~r~0 := ~n~0;~h~0 := 0; {7231#(<= ~counter~0 0)} is VALID [2022-04-14 15:20:35,412 INFO L290 TraceCheckUtils]: 12: Hoare triple {7231#(<= ~counter~0 0)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {7265#(<= ~counter~0 1)} is VALID [2022-04-14 15:20:35,413 INFO L290 TraceCheckUtils]: 13: Hoare triple {7265#(<= ~counter~0 1)} assume !!(#t~post5 < 50);havoc #t~post5; {7265#(<= ~counter~0 1)} is VALID [2022-04-14 15:20:35,413 INFO L290 TraceCheckUtils]: 14: Hoare triple {7265#(<= ~counter~0 1)} assume !!(~q~0 % 4294967296 <= ~n~0 % 4294967296);~q~0 := 4 * ~q~0; {7265#(<= ~counter~0 1)} is VALID [2022-04-14 15:20:35,413 INFO L290 TraceCheckUtils]: 15: Hoare triple {7265#(<= ~counter~0 1)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {7275#(<= ~counter~0 2)} is VALID [2022-04-14 15:20:35,414 INFO L290 TraceCheckUtils]: 16: Hoare triple {7275#(<= ~counter~0 2)} assume !!(#t~post5 < 50);havoc #t~post5; {7275#(<= ~counter~0 2)} is VALID [2022-04-14 15:20:35,414 INFO L290 TraceCheckUtils]: 17: Hoare triple {7275#(<= ~counter~0 2)} assume !!(~q~0 % 4294967296 <= ~n~0 % 4294967296);~q~0 := 4 * ~q~0; {7275#(<= ~counter~0 2)} is VALID [2022-04-14 15:20:35,414 INFO L290 TraceCheckUtils]: 18: Hoare triple {7275#(<= ~counter~0 2)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {7285#(<= ~counter~0 3)} is VALID [2022-04-14 15:20:35,415 INFO L290 TraceCheckUtils]: 19: Hoare triple {7285#(<= ~counter~0 3)} assume !!(#t~post5 < 50);havoc #t~post5; {7285#(<= ~counter~0 3)} is VALID [2022-04-14 15:20:35,415 INFO L290 TraceCheckUtils]: 20: Hoare triple {7285#(<= ~counter~0 3)} assume !!(~q~0 % 4294967296 <= ~n~0 % 4294967296);~q~0 := 4 * ~q~0; {7285#(<= ~counter~0 3)} is VALID [2022-04-14 15:20:35,415 INFO L290 TraceCheckUtils]: 21: Hoare triple {7285#(<= ~counter~0 3)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {7295#(<= ~counter~0 4)} is VALID [2022-04-14 15:20:35,416 INFO L290 TraceCheckUtils]: 22: Hoare triple {7295#(<= ~counter~0 4)} assume !!(#t~post5 < 50);havoc #t~post5; {7295#(<= ~counter~0 4)} is VALID [2022-04-14 15:20:35,416 INFO L290 TraceCheckUtils]: 23: Hoare triple {7295#(<= ~counter~0 4)} assume !!(~q~0 % 4294967296 <= ~n~0 % 4294967296);~q~0 := 4 * ~q~0; {7295#(<= ~counter~0 4)} is VALID [2022-04-14 15:20:35,416 INFO L290 TraceCheckUtils]: 24: Hoare triple {7295#(<= ~counter~0 4)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {7305#(<= ~counter~0 5)} is VALID [2022-04-14 15:20:35,417 INFO L290 TraceCheckUtils]: 25: Hoare triple {7305#(<= ~counter~0 5)} assume !!(#t~post5 < 50);havoc #t~post5; {7305#(<= ~counter~0 5)} is VALID [2022-04-14 15:20:35,418 INFO L290 TraceCheckUtils]: 26: Hoare triple {7305#(<= ~counter~0 5)} assume !!(~q~0 % 4294967296 <= ~n~0 % 4294967296);~q~0 := 4 * ~q~0; {7305#(<= ~counter~0 5)} is VALID [2022-04-14 15:20:35,419 INFO L290 TraceCheckUtils]: 27: Hoare triple {7305#(<= ~counter~0 5)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {7315#(<= ~counter~0 6)} is VALID [2022-04-14 15:20:35,420 INFO L290 TraceCheckUtils]: 28: Hoare triple {7315#(<= ~counter~0 6)} assume !!(#t~post5 < 50);havoc #t~post5; {7315#(<= ~counter~0 6)} is VALID [2022-04-14 15:20:35,420 INFO L290 TraceCheckUtils]: 29: Hoare triple {7315#(<= ~counter~0 6)} assume !(~q~0 % 4294967296 <= ~n~0 % 4294967296); {7315#(<= ~counter~0 6)} is VALID [2022-04-14 15:20:35,421 INFO L290 TraceCheckUtils]: 30: Hoare triple {7315#(<= ~counter~0 6)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {7325#(<= |main_#t~post6| 6)} is VALID [2022-04-14 15:20:35,421 INFO L290 TraceCheckUtils]: 31: Hoare triple {7325#(<= |main_#t~post6| 6)} assume !(#t~post6 < 50);havoc #t~post6; {7224#false} is VALID [2022-04-14 15:20:35,421 INFO L272 TraceCheckUtils]: 32: Hoare triple {7224#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)); {7224#false} is VALID [2022-04-14 15:20:35,421 INFO L290 TraceCheckUtils]: 33: Hoare triple {7224#false} ~cond := #in~cond; {7224#false} is VALID [2022-04-14 15:20:35,421 INFO L290 TraceCheckUtils]: 34: Hoare triple {7224#false} assume !(0 == ~cond); {7224#false} is VALID [2022-04-14 15:20:35,421 INFO L290 TraceCheckUtils]: 35: Hoare triple {7224#false} assume true; {7224#false} is VALID [2022-04-14 15:20:35,421 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {7224#false} {7224#false} #96#return; {7224#false} is VALID [2022-04-14 15:20:35,422 INFO L272 TraceCheckUtils]: 37: Hoare triple {7224#false} call __VERIFIER_assert((if 0 == (~p~0 * ~p~0 - ~n~0 + ~r~0) % 4294967296 then 1 else 0)); {7224#false} is VALID [2022-04-14 15:20:35,422 INFO L290 TraceCheckUtils]: 38: Hoare triple {7224#false} ~cond := #in~cond; {7224#false} is VALID [2022-04-14 15:20:35,422 INFO L290 TraceCheckUtils]: 39: Hoare triple {7224#false} assume 0 == ~cond; {7224#false} is VALID [2022-04-14 15:20:35,422 INFO L290 TraceCheckUtils]: 40: Hoare triple {7224#false} assume !false; {7224#false} is VALID [2022-04-14 15:20:35,422 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-14 15:20:35,422 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-14 15:20:35,810 INFO L290 TraceCheckUtils]: 40: Hoare triple {7224#false} assume !false; {7224#false} is VALID [2022-04-14 15:20:35,810 INFO L290 TraceCheckUtils]: 39: Hoare triple {7224#false} assume 0 == ~cond; {7224#false} is VALID [2022-04-14 15:20:35,810 INFO L290 TraceCheckUtils]: 38: Hoare triple {7224#false} ~cond := #in~cond; {7224#false} is VALID [2022-04-14 15:20:35,810 INFO L272 TraceCheckUtils]: 37: Hoare triple {7224#false} call __VERIFIER_assert((if 0 == (~p~0 * ~p~0 - ~n~0 + ~r~0) % 4294967296 then 1 else 0)); {7224#false} is VALID [2022-04-14 15:20:35,810 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {7223#true} {7224#false} #96#return; {7224#false} is VALID [2022-04-14 15:20:35,810 INFO L290 TraceCheckUtils]: 35: Hoare triple {7223#true} assume true; {7223#true} is VALID [2022-04-14 15:20:35,811 INFO L290 TraceCheckUtils]: 34: Hoare triple {7223#true} assume !(0 == ~cond); {7223#true} is VALID [2022-04-14 15:20:35,811 INFO L290 TraceCheckUtils]: 33: Hoare triple {7223#true} ~cond := #in~cond; {7223#true} is VALID [2022-04-14 15:20:35,811 INFO L272 TraceCheckUtils]: 32: Hoare triple {7224#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)); {7223#true} is VALID [2022-04-14 15:20:35,811 INFO L290 TraceCheckUtils]: 31: Hoare triple {7383#(< |main_#t~post6| 50)} assume !(#t~post6 < 50);havoc #t~post6; {7224#false} is VALID [2022-04-14 15:20:35,811 INFO L290 TraceCheckUtils]: 30: Hoare triple {7387#(< ~counter~0 50)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {7383#(< |main_#t~post6| 50)} is VALID [2022-04-14 15:20:35,812 INFO L290 TraceCheckUtils]: 29: Hoare triple {7387#(< ~counter~0 50)} assume !(~q~0 % 4294967296 <= ~n~0 % 4294967296); {7387#(< ~counter~0 50)} is VALID [2022-04-14 15:20:35,812 INFO L290 TraceCheckUtils]: 28: Hoare triple {7387#(< ~counter~0 50)} assume !!(#t~post5 < 50);havoc #t~post5; {7387#(< ~counter~0 50)} is VALID [2022-04-14 15:20:35,813 INFO L290 TraceCheckUtils]: 27: Hoare triple {7397#(< ~counter~0 49)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {7387#(< ~counter~0 50)} is VALID [2022-04-14 15:20:35,813 INFO L290 TraceCheckUtils]: 26: Hoare triple {7397#(< ~counter~0 49)} assume !!(~q~0 % 4294967296 <= ~n~0 % 4294967296);~q~0 := 4 * ~q~0; {7397#(< ~counter~0 49)} is VALID [2022-04-14 15:20:35,813 INFO L290 TraceCheckUtils]: 25: Hoare triple {7397#(< ~counter~0 49)} assume !!(#t~post5 < 50);havoc #t~post5; {7397#(< ~counter~0 49)} is VALID [2022-04-14 15:20:35,814 INFO L290 TraceCheckUtils]: 24: Hoare triple {7407#(< ~counter~0 48)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {7397#(< ~counter~0 49)} is VALID [2022-04-14 15:20:35,814 INFO L290 TraceCheckUtils]: 23: Hoare triple {7407#(< ~counter~0 48)} assume !!(~q~0 % 4294967296 <= ~n~0 % 4294967296);~q~0 := 4 * ~q~0; {7407#(< ~counter~0 48)} is VALID [2022-04-14 15:20:35,814 INFO L290 TraceCheckUtils]: 22: Hoare triple {7407#(< ~counter~0 48)} assume !!(#t~post5 < 50);havoc #t~post5; {7407#(< ~counter~0 48)} is VALID [2022-04-14 15:20:35,815 INFO L290 TraceCheckUtils]: 21: Hoare triple {7417#(< ~counter~0 47)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {7407#(< ~counter~0 48)} is VALID [2022-04-14 15:20:35,815 INFO L290 TraceCheckUtils]: 20: Hoare triple {7417#(< ~counter~0 47)} assume !!(~q~0 % 4294967296 <= ~n~0 % 4294967296);~q~0 := 4 * ~q~0; {7417#(< ~counter~0 47)} is VALID [2022-04-14 15:20:35,815 INFO L290 TraceCheckUtils]: 19: Hoare triple {7417#(< ~counter~0 47)} assume !!(#t~post5 < 50);havoc #t~post5; {7417#(< ~counter~0 47)} is VALID [2022-04-14 15:20:35,816 INFO L290 TraceCheckUtils]: 18: Hoare triple {7427#(< ~counter~0 46)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {7417#(< ~counter~0 47)} is VALID [2022-04-14 15:20:35,816 INFO L290 TraceCheckUtils]: 17: Hoare triple {7427#(< ~counter~0 46)} assume !!(~q~0 % 4294967296 <= ~n~0 % 4294967296);~q~0 := 4 * ~q~0; {7427#(< ~counter~0 46)} is VALID [2022-04-14 15:20:35,816 INFO L290 TraceCheckUtils]: 16: Hoare triple {7427#(< ~counter~0 46)} assume !!(#t~post5 < 50);havoc #t~post5; {7427#(< ~counter~0 46)} is VALID [2022-04-14 15:20:35,817 INFO L290 TraceCheckUtils]: 15: Hoare triple {7437#(< ~counter~0 45)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {7427#(< ~counter~0 46)} is VALID [2022-04-14 15:20:35,820 INFO L290 TraceCheckUtils]: 14: Hoare triple {7437#(< ~counter~0 45)} assume !!(~q~0 % 4294967296 <= ~n~0 % 4294967296);~q~0 := 4 * ~q~0; {7437#(< ~counter~0 45)} is VALID [2022-04-14 15:20:35,820 INFO L290 TraceCheckUtils]: 13: Hoare triple {7437#(< ~counter~0 45)} assume !!(#t~post5 < 50);havoc #t~post5; {7437#(< ~counter~0 45)} is VALID [2022-04-14 15:20:35,821 INFO L290 TraceCheckUtils]: 12: Hoare triple {7447#(< ~counter~0 44)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {7437#(< ~counter~0 45)} is VALID [2022-04-14 15:20:35,827 INFO L290 TraceCheckUtils]: 11: Hoare triple {7447#(< ~counter~0 44)} ~p~0 := 0;~q~0 := 1;~r~0 := ~n~0;~h~0 := 0; {7447#(< ~counter~0 44)} is VALID [2022-04-14 15:20:35,827 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {7223#true} {7447#(< ~counter~0 44)} #82#return; {7447#(< ~counter~0 44)} is VALID [2022-04-14 15:20:35,827 INFO L290 TraceCheckUtils]: 9: Hoare triple {7223#true} assume true; {7223#true} is VALID [2022-04-14 15:20:35,828 INFO L290 TraceCheckUtils]: 8: Hoare triple {7223#true} assume !(0 == ~cond); {7223#true} is VALID [2022-04-14 15:20:35,828 INFO L290 TraceCheckUtils]: 7: Hoare triple {7223#true} ~cond := #in~cond; {7223#true} is VALID [2022-04-14 15:20:35,828 INFO L272 TraceCheckUtils]: 6: Hoare triple {7447#(< ~counter~0 44)} call assume_abort_if_not((if ~n~0 % 4294967296 < 1073741823 then 1 else 0)); {7223#true} is VALID [2022-04-14 15:20:35,828 INFO L290 TraceCheckUtils]: 5: Hoare triple {7447#(< ~counter~0 44)} havoc ~n~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~h~0;~n~0 := #t~nondet4;havoc #t~nondet4; {7447#(< ~counter~0 44)} is VALID [2022-04-14 15:20:35,828 INFO L272 TraceCheckUtils]: 4: Hoare triple {7447#(< ~counter~0 44)} call #t~ret7 := main(); {7447#(< ~counter~0 44)} is VALID [2022-04-14 15:20:35,829 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7447#(< ~counter~0 44)} {7223#true} #102#return; {7447#(< ~counter~0 44)} is VALID [2022-04-14 15:20:35,829 INFO L290 TraceCheckUtils]: 2: Hoare triple {7447#(< ~counter~0 44)} assume true; {7447#(< ~counter~0 44)} is VALID [2022-04-14 15:20:35,829 INFO L290 TraceCheckUtils]: 1: Hoare triple {7223#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);~counter~0 := 0; {7447#(< ~counter~0 44)} is VALID [2022-04-14 15:20:35,829 INFO L272 TraceCheckUtils]: 0: Hoare triple {7223#true} call ULTIMATE.init(); {7223#true} is VALID [2022-04-14 15:20:35,830 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 2 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-14 15:20:35,830 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 15:20:35,830 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [677114713] [2022-04-14 15:20:35,830 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-14 15:20:35,830 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [857104727] [2022-04-14 15:20:35,830 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [857104727] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-14 15:20:35,830 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-14 15:20:35,830 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 18 [2022-04-14 15:20:35,830 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1164429123] [2022-04-14 15:20:35,830 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-14 15:20:35,831 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 3.4444444444444446) internal successors, (62), 18 states have internal predecessors, (62), 4 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (6), 3 states have call predecessors, (6), 4 states have call successors, (6) Word has length 41 [2022-04-14 15:20:35,831 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 15:20:35,831 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 18 states, 18 states have (on average 3.4444444444444446) internal successors, (62), 18 states have internal predecessors, (62), 4 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (6), 3 states have call predecessors, (6), 4 states have call successors, (6) [2022-04-14 15:20:35,885 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 76 edges. 76 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 15:20:35,886 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-04-14 15:20:35,886 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 15:20:35,886 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-04-14 15:20:35,886 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=125, Invalid=181, Unknown=0, NotChecked=0, Total=306 [2022-04-14 15:20:35,886 INFO L87 Difference]: Start difference. First operand 306 states and 400 transitions. Second operand has 18 states, 18 states have (on average 3.4444444444444446) internal successors, (62), 18 states have internal predecessors, (62), 4 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (6), 3 states have call predecessors, (6), 4 states have call successors, (6) [2022-04-14 15:20:47,930 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-14 15:20:52,390 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-14 15:20:59,059 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-14 15:21:01,587 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.61s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-14 15:21:05,851 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.14s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-14 15:21:08,680 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-14 15:21:13,499 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-14 15:21:16,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-14 15:21:23,178 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-14 15:21:32,043 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.40s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-14 15:21:36,794 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-14 15:21:50,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 15:21:50,480 INFO L93 Difference]: Finished difference Result 656 states and 866 transitions. [2022-04-14 15:21:50,480 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-04-14 15:21:50,480 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 3.4444444444444446) internal successors, (62), 18 states have internal predecessors, (62), 4 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (6), 3 states have call predecessors, (6), 4 states have call successors, (6) Word has length 41 [2022-04-14 15:21:50,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-14 15:21:50,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 18 states have (on average 3.4444444444444446) internal successors, (62), 18 states have internal predecessors, (62), 4 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (6), 3 states have call predecessors, (6), 4 states have call successors, (6) [2022-04-14 15:21:50,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 422 transitions. [2022-04-14 15:21:50,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 18 states have (on average 3.4444444444444446) internal successors, (62), 18 states have internal predecessors, (62), 4 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (6), 3 states have call predecessors, (6), 4 states have call successors, (6) [2022-04-14 15:21:50,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 422 transitions. [2022-04-14 15:21:50,491 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 28 states and 422 transitions. [2022-04-14 15:21:50,897 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 422 edges. 422 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 15:21:50,923 INFO L225 Difference]: With dead ends: 656 [2022-04-14 15:21:50,924 INFO L226 Difference]: Without dead ends: 608 [2022-04-14 15:21:50,924 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 65 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 89 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=284, Invalid=528, Unknown=0, NotChecked=0, Total=812 [2022-04-14 15:21:50,925 INFO L913 BasicCegarLoop]: 147 mSDtfsCounter, 422 mSDsluCounter, 361 mSDsCounter, 0 mSdLazyCounter, 342 mSolverCounterSat, 231 mSolverCounterUnsat, 9 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 40.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 422 SdHoareTripleChecker+Valid, 508 SdHoareTripleChecker+Invalid, 582 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 231 IncrementalHoareTripleChecker+Valid, 342 IncrementalHoareTripleChecker+Invalid, 9 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 40.9s IncrementalHoareTripleChecker+Time [2022-04-14 15:21:50,925 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [422 Valid, 508 Invalid, 582 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [231 Valid, 342 Invalid, 9 Unknown, 0 Unchecked, 40.9s Time] [2022-04-14 15:21:50,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 608 states. [2022-04-14 15:21:51,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 608 to 585. [2022-04-14 15:21:51,233 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-14 15:21:51,234 INFO L82 GeneralOperation]: Start isEquivalent. First operand 608 states. Second operand has 585 states, 312 states have (on average 1.2115384615384615) internal successors, (378), 334 states have internal predecessors, (378), 214 states have call successors, (214), 59 states have call predecessors, (214), 58 states have return successors, (191), 191 states have call predecessors, (191), 191 states have call successors, (191) [2022-04-14 15:21:51,235 INFO L74 IsIncluded]: Start isIncluded. First operand 608 states. Second operand has 585 states, 312 states have (on average 1.2115384615384615) internal successors, (378), 334 states have internal predecessors, (378), 214 states have call successors, (214), 59 states have call predecessors, (214), 58 states have return successors, (191), 191 states have call predecessors, (191), 191 states have call successors, (191) [2022-04-14 15:21:51,236 INFO L87 Difference]: Start difference. First operand 608 states. Second operand has 585 states, 312 states have (on average 1.2115384615384615) internal successors, (378), 334 states have internal predecessors, (378), 214 states have call successors, (214), 59 states have call predecessors, (214), 58 states have return successors, (191), 191 states have call predecessors, (191), 191 states have call successors, (191) [2022-04-14 15:21:51,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 15:21:51,260 INFO L93 Difference]: Finished difference Result 608 states and 796 transitions. [2022-04-14 15:21:51,260 INFO L276 IsEmpty]: Start isEmpty. Operand 608 states and 796 transitions. [2022-04-14 15:21:51,262 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 15:21:51,262 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 15:21:51,264 INFO L74 IsIncluded]: Start isIncluded. First operand has 585 states, 312 states have (on average 1.2115384615384615) internal successors, (378), 334 states have internal predecessors, (378), 214 states have call successors, (214), 59 states have call predecessors, (214), 58 states have return successors, (191), 191 states have call predecessors, (191), 191 states have call successors, (191) Second operand 608 states. [2022-04-14 15:21:51,265 INFO L87 Difference]: Start difference. First operand has 585 states, 312 states have (on average 1.2115384615384615) internal successors, (378), 334 states have internal predecessors, (378), 214 states have call successors, (214), 59 states have call predecessors, (214), 58 states have return successors, (191), 191 states have call predecessors, (191), 191 states have call successors, (191) Second operand 608 states. [2022-04-14 15:21:51,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 15:21:51,290 INFO L93 Difference]: Finished difference Result 608 states and 796 transitions. [2022-04-14 15:21:51,290 INFO L276 IsEmpty]: Start isEmpty. Operand 608 states and 796 transitions. [2022-04-14 15:21:51,292 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 15:21:51,292 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 15:21:51,292 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-14 15:21:51,292 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-14 15:21:51,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 585 states, 312 states have (on average 1.2115384615384615) internal successors, (378), 334 states have internal predecessors, (378), 214 states have call successors, (214), 59 states have call predecessors, (214), 58 states have return successors, (191), 191 states have call predecessors, (191), 191 states have call successors, (191) [2022-04-14 15:21:51,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 585 states to 585 states and 783 transitions. [2022-04-14 15:21:51,321 INFO L78 Accepts]: Start accepts. Automaton has 585 states and 783 transitions. Word has length 41 [2022-04-14 15:21:51,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-14 15:21:51,321 INFO L478 AbstractCegarLoop]: Abstraction has 585 states and 783 transitions. [2022-04-14 15:21:51,322 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 3.4444444444444446) internal successors, (62), 18 states have internal predecessors, (62), 4 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (6), 3 states have call predecessors, (6), 4 states have call successors, (6) [2022-04-14 15:21:51,322 INFO L276 IsEmpty]: Start isEmpty. Operand 585 states and 783 transitions. [2022-04-14 15:21:51,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2022-04-14 15:21:51,323 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 15:21:51,323 INFO L499 BasicCegarLoop]: trace histogram [11, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-14 15:21:51,347 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-04-14 15:21:51,547 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-14 15:21:51,547 INFO L403 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 15:21:51,547 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 15:21:51,547 INFO L85 PathProgramCache]: Analyzing trace with hash -271152338, now seen corresponding path program 2 times [2022-04-14 15:21:51,547 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 15:21:51,548 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2136645960] [2022-04-14 15:21:51,548 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 15:21:51,548 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 15:21:51,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 15:21:51,775 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-14 15:21:51,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 15:21:51,783 INFO L290 TraceCheckUtils]: 0: Hoare triple {10585#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {10569#(<= ~counter~0 0)} is VALID [2022-04-14 15:21:51,784 INFO L290 TraceCheckUtils]: 1: Hoare triple {10569#(<= ~counter~0 0)} assume true; {10569#(<= ~counter~0 0)} is VALID [2022-04-14 15:21:51,784 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {10569#(<= ~counter~0 0)} {10564#true} #102#return; {10569#(<= ~counter~0 0)} is VALID [2022-04-14 15:21:51,784 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-14 15:21:51,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 15:21:51,789 INFO L290 TraceCheckUtils]: 0: Hoare triple {10564#true} ~cond := #in~cond; {10564#true} is VALID [2022-04-14 15:21:51,789 INFO L290 TraceCheckUtils]: 1: Hoare triple {10564#true} assume !(0 == ~cond); {10564#true} is VALID [2022-04-14 15:21:51,789 INFO L290 TraceCheckUtils]: 2: Hoare triple {10564#true} assume true; {10564#true} is VALID [2022-04-14 15:21:51,789 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10564#true} {10569#(<= ~counter~0 0)} #82#return; {10569#(<= ~counter~0 0)} is VALID [2022-04-14 15:21:51,790 INFO L272 TraceCheckUtils]: 0: Hoare triple {10564#true} call ULTIMATE.init(); {10585#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-14 15:21:51,791 INFO L290 TraceCheckUtils]: 1: Hoare triple {10585#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {10569#(<= ~counter~0 0)} is VALID [2022-04-14 15:21:51,791 INFO L290 TraceCheckUtils]: 2: Hoare triple {10569#(<= ~counter~0 0)} assume true; {10569#(<= ~counter~0 0)} is VALID [2022-04-14 15:21:51,791 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10569#(<= ~counter~0 0)} {10564#true} #102#return; {10569#(<= ~counter~0 0)} is VALID [2022-04-14 15:21:51,792 INFO L272 TraceCheckUtils]: 4: Hoare triple {10569#(<= ~counter~0 0)} call #t~ret7 := main(); {10569#(<= ~counter~0 0)} is VALID [2022-04-14 15:21:51,792 INFO L290 TraceCheckUtils]: 5: Hoare triple {10569#(<= ~counter~0 0)} havoc ~n~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~h~0;~n~0 := #t~nondet4;havoc #t~nondet4; {10569#(<= ~counter~0 0)} is VALID [2022-04-14 15:21:51,792 INFO L272 TraceCheckUtils]: 6: Hoare triple {10569#(<= ~counter~0 0)} call assume_abort_if_not((if ~n~0 % 4294967296 < 1073741823 then 1 else 0)); {10564#true} is VALID [2022-04-14 15:21:51,792 INFO L290 TraceCheckUtils]: 7: Hoare triple {10564#true} ~cond := #in~cond; {10564#true} is VALID [2022-04-14 15:21:51,792 INFO L290 TraceCheckUtils]: 8: Hoare triple {10564#true} assume !(0 == ~cond); {10564#true} is VALID [2022-04-14 15:21:51,792 INFO L290 TraceCheckUtils]: 9: Hoare triple {10564#true} assume true; {10564#true} is VALID [2022-04-14 15:21:51,793 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {10564#true} {10569#(<= ~counter~0 0)} #82#return; {10569#(<= ~counter~0 0)} is VALID [2022-04-14 15:21:51,793 INFO L290 TraceCheckUtils]: 11: Hoare triple {10569#(<= ~counter~0 0)} ~p~0 := 0;~q~0 := 1;~r~0 := ~n~0;~h~0 := 0; {10569#(<= ~counter~0 0)} is VALID [2022-04-14 15:21:51,793 INFO L290 TraceCheckUtils]: 12: Hoare triple {10569#(<= ~counter~0 0)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {10574#(<= ~counter~0 1)} is VALID [2022-04-14 15:21:51,794 INFO L290 TraceCheckUtils]: 13: Hoare triple {10574#(<= ~counter~0 1)} assume !!(#t~post5 < 50);havoc #t~post5; {10574#(<= ~counter~0 1)} is VALID [2022-04-14 15:21:51,794 INFO L290 TraceCheckUtils]: 14: Hoare triple {10574#(<= ~counter~0 1)} assume !!(~q~0 % 4294967296 <= ~n~0 % 4294967296);~q~0 := 4 * ~q~0; {10574#(<= ~counter~0 1)} is VALID [2022-04-14 15:21:51,794 INFO L290 TraceCheckUtils]: 15: Hoare triple {10574#(<= ~counter~0 1)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {10575#(<= ~counter~0 2)} is VALID [2022-04-14 15:21:51,795 INFO L290 TraceCheckUtils]: 16: Hoare triple {10575#(<= ~counter~0 2)} assume !!(#t~post5 < 50);havoc #t~post5; {10575#(<= ~counter~0 2)} is VALID [2022-04-14 15:21:51,795 INFO L290 TraceCheckUtils]: 17: Hoare triple {10575#(<= ~counter~0 2)} assume !!(~q~0 % 4294967296 <= ~n~0 % 4294967296);~q~0 := 4 * ~q~0; {10575#(<= ~counter~0 2)} is VALID [2022-04-14 15:21:51,795 INFO L290 TraceCheckUtils]: 18: Hoare triple {10575#(<= ~counter~0 2)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {10576#(<= ~counter~0 3)} is VALID [2022-04-14 15:21:51,796 INFO L290 TraceCheckUtils]: 19: Hoare triple {10576#(<= ~counter~0 3)} assume !!(#t~post5 < 50);havoc #t~post5; {10576#(<= ~counter~0 3)} is VALID [2022-04-14 15:21:51,796 INFO L290 TraceCheckUtils]: 20: Hoare triple {10576#(<= ~counter~0 3)} assume !!(~q~0 % 4294967296 <= ~n~0 % 4294967296);~q~0 := 4 * ~q~0; {10576#(<= ~counter~0 3)} is VALID [2022-04-14 15:21:51,796 INFO L290 TraceCheckUtils]: 21: Hoare triple {10576#(<= ~counter~0 3)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {10577#(<= ~counter~0 4)} is VALID [2022-04-14 15:21:51,797 INFO L290 TraceCheckUtils]: 22: Hoare triple {10577#(<= ~counter~0 4)} assume !!(#t~post5 < 50);havoc #t~post5; {10577#(<= ~counter~0 4)} is VALID [2022-04-14 15:21:51,797 INFO L290 TraceCheckUtils]: 23: Hoare triple {10577#(<= ~counter~0 4)} assume !!(~q~0 % 4294967296 <= ~n~0 % 4294967296);~q~0 := 4 * ~q~0; {10577#(<= ~counter~0 4)} is VALID [2022-04-14 15:21:51,797 INFO L290 TraceCheckUtils]: 24: Hoare triple {10577#(<= ~counter~0 4)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {10578#(<= ~counter~0 5)} is VALID [2022-04-14 15:21:51,798 INFO L290 TraceCheckUtils]: 25: Hoare triple {10578#(<= ~counter~0 5)} assume !!(#t~post5 < 50);havoc #t~post5; {10578#(<= ~counter~0 5)} is VALID [2022-04-14 15:21:51,798 INFO L290 TraceCheckUtils]: 26: Hoare triple {10578#(<= ~counter~0 5)} assume !!(~q~0 % 4294967296 <= ~n~0 % 4294967296);~q~0 := 4 * ~q~0; {10578#(<= ~counter~0 5)} is VALID [2022-04-14 15:21:51,798 INFO L290 TraceCheckUtils]: 27: Hoare triple {10578#(<= ~counter~0 5)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {10579#(<= ~counter~0 6)} is VALID [2022-04-14 15:21:51,799 INFO L290 TraceCheckUtils]: 28: Hoare triple {10579#(<= ~counter~0 6)} assume !!(#t~post5 < 50);havoc #t~post5; {10579#(<= ~counter~0 6)} is VALID [2022-04-14 15:21:51,799 INFO L290 TraceCheckUtils]: 29: Hoare triple {10579#(<= ~counter~0 6)} assume !!(~q~0 % 4294967296 <= ~n~0 % 4294967296);~q~0 := 4 * ~q~0; {10579#(<= ~counter~0 6)} is VALID [2022-04-14 15:21:51,799 INFO L290 TraceCheckUtils]: 30: Hoare triple {10579#(<= ~counter~0 6)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {10580#(<= ~counter~0 7)} is VALID [2022-04-14 15:21:51,800 INFO L290 TraceCheckUtils]: 31: Hoare triple {10580#(<= ~counter~0 7)} assume !!(#t~post5 < 50);havoc #t~post5; {10580#(<= ~counter~0 7)} is VALID [2022-04-14 15:21:51,800 INFO L290 TraceCheckUtils]: 32: Hoare triple {10580#(<= ~counter~0 7)} assume !!(~q~0 % 4294967296 <= ~n~0 % 4294967296);~q~0 := 4 * ~q~0; {10580#(<= ~counter~0 7)} is VALID [2022-04-14 15:21:51,800 INFO L290 TraceCheckUtils]: 33: Hoare triple {10580#(<= ~counter~0 7)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {10581#(<= ~counter~0 8)} is VALID [2022-04-14 15:21:51,801 INFO L290 TraceCheckUtils]: 34: Hoare triple {10581#(<= ~counter~0 8)} assume !!(#t~post5 < 50);havoc #t~post5; {10581#(<= ~counter~0 8)} is VALID [2022-04-14 15:21:51,801 INFO L290 TraceCheckUtils]: 35: Hoare triple {10581#(<= ~counter~0 8)} assume !!(~q~0 % 4294967296 <= ~n~0 % 4294967296);~q~0 := 4 * ~q~0; {10581#(<= ~counter~0 8)} is VALID [2022-04-14 15:21:51,801 INFO L290 TraceCheckUtils]: 36: Hoare triple {10581#(<= ~counter~0 8)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {10582#(<= ~counter~0 9)} is VALID [2022-04-14 15:21:51,801 INFO L290 TraceCheckUtils]: 37: Hoare triple {10582#(<= ~counter~0 9)} assume !!(#t~post5 < 50);havoc #t~post5; {10582#(<= ~counter~0 9)} is VALID [2022-04-14 15:21:51,802 INFO L290 TraceCheckUtils]: 38: Hoare triple {10582#(<= ~counter~0 9)} assume !!(~q~0 % 4294967296 <= ~n~0 % 4294967296);~q~0 := 4 * ~q~0; {10582#(<= ~counter~0 9)} is VALID [2022-04-14 15:21:51,802 INFO L290 TraceCheckUtils]: 39: Hoare triple {10582#(<= ~counter~0 9)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {10583#(<= ~counter~0 10)} is VALID [2022-04-14 15:21:51,802 INFO L290 TraceCheckUtils]: 40: Hoare triple {10583#(<= ~counter~0 10)} assume !!(#t~post5 < 50);havoc #t~post5; {10583#(<= ~counter~0 10)} is VALID [2022-04-14 15:21:51,803 INFO L290 TraceCheckUtils]: 41: Hoare triple {10583#(<= ~counter~0 10)} assume !!(~q~0 % 4294967296 <= ~n~0 % 4294967296);~q~0 := 4 * ~q~0; {10583#(<= ~counter~0 10)} is VALID [2022-04-14 15:21:51,803 INFO L290 TraceCheckUtils]: 42: Hoare triple {10583#(<= ~counter~0 10)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {10584#(<= |main_#t~post5| 10)} is VALID [2022-04-14 15:21:51,803 INFO L290 TraceCheckUtils]: 43: Hoare triple {10584#(<= |main_#t~post5| 10)} assume !(#t~post5 < 50);havoc #t~post5; {10565#false} is VALID [2022-04-14 15:21:51,803 INFO L290 TraceCheckUtils]: 44: Hoare triple {10565#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {10565#false} is VALID [2022-04-14 15:21:51,803 INFO L290 TraceCheckUtils]: 45: Hoare triple {10565#false} assume !!(#t~post6 < 50);havoc #t~post6; {10565#false} is VALID [2022-04-14 15:21:51,804 INFO L272 TraceCheckUtils]: 46: Hoare triple {10565#false} call __VERIFIER_assert((if ~r~0 % 4294967296 < (2 * ~p~0 + ~q~0) % 4294967296 then 1 else 0)); {10565#false} is VALID [2022-04-14 15:21:51,804 INFO L290 TraceCheckUtils]: 47: Hoare triple {10565#false} ~cond := #in~cond; {10565#false} is VALID [2022-04-14 15:21:51,804 INFO L290 TraceCheckUtils]: 48: Hoare triple {10565#false} assume 0 == ~cond; {10565#false} is VALID [2022-04-14 15:21:51,804 INFO L290 TraceCheckUtils]: 49: Hoare triple {10565#false} assume !false; {10565#false} is VALID [2022-04-14 15:21:51,804 INFO L134 CoverageAnalysis]: Checked inductivity of 155 backedges. 0 proven. 155 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-14 15:21:51,804 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 15:21:51,804 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2136645960] [2022-04-14 15:21:51,804 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2136645960] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-14 15:21:51,804 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2075212852] [2022-04-14 15:21:51,804 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-14 15:21:51,805 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-14 15:21:51,805 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-14 15:21:51,805 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-14 15:21:51,806 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-04-14 15:21:51,851 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-04-14 15:21:51,851 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-14 15:21:51,852 INFO L263 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 4 conjunts are in the unsatisfiable core [2022-04-14 15:21:51,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 15:21:51,868 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-14 15:21:52,037 INFO L272 TraceCheckUtils]: 0: Hoare triple {10564#true} call ULTIMATE.init(); {10564#true} is VALID [2022-04-14 15:21:52,038 INFO L290 TraceCheckUtils]: 1: Hoare triple {10564#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);~counter~0 := 0; {10564#true} is VALID [2022-04-14 15:21:52,038 INFO L290 TraceCheckUtils]: 2: Hoare triple {10564#true} assume true; {10564#true} is VALID [2022-04-14 15:21:52,038 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10564#true} {10564#true} #102#return; {10564#true} is VALID [2022-04-14 15:21:52,038 INFO L272 TraceCheckUtils]: 4: Hoare triple {10564#true} call #t~ret7 := main(); {10564#true} is VALID [2022-04-14 15:21:52,038 INFO L290 TraceCheckUtils]: 5: Hoare triple {10564#true} havoc ~n~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~h~0;~n~0 := #t~nondet4;havoc #t~nondet4; {10564#true} is VALID [2022-04-14 15:21:52,038 INFO L272 TraceCheckUtils]: 6: Hoare triple {10564#true} call assume_abort_if_not((if ~n~0 % 4294967296 < 1073741823 then 1 else 0)); {10564#true} is VALID [2022-04-14 15:21:52,038 INFO L290 TraceCheckUtils]: 7: Hoare triple {10564#true} ~cond := #in~cond; {10564#true} is VALID [2022-04-14 15:21:52,038 INFO L290 TraceCheckUtils]: 8: Hoare triple {10564#true} assume !(0 == ~cond); {10564#true} is VALID [2022-04-14 15:21:52,038 INFO L290 TraceCheckUtils]: 9: Hoare triple {10564#true} assume true; {10564#true} is VALID [2022-04-14 15:21:52,038 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {10564#true} {10564#true} #82#return; {10564#true} is VALID [2022-04-14 15:21:52,038 INFO L290 TraceCheckUtils]: 11: Hoare triple {10564#true} ~p~0 := 0;~q~0 := 1;~r~0 := ~n~0;~h~0 := 0; {10564#true} is VALID [2022-04-14 15:21:52,039 INFO L290 TraceCheckUtils]: 12: Hoare triple {10564#true} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {10564#true} is VALID [2022-04-14 15:21:52,039 INFO L290 TraceCheckUtils]: 13: Hoare triple {10564#true} assume !!(#t~post5 < 50);havoc #t~post5; {10564#true} is VALID [2022-04-14 15:21:52,039 INFO L290 TraceCheckUtils]: 14: Hoare triple {10564#true} assume !!(~q~0 % 4294967296 <= ~n~0 % 4294967296);~q~0 := 4 * ~q~0; {10564#true} is VALID [2022-04-14 15:21:52,039 INFO L290 TraceCheckUtils]: 15: Hoare triple {10564#true} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {10564#true} is VALID [2022-04-14 15:21:52,039 INFO L290 TraceCheckUtils]: 16: Hoare triple {10564#true} assume !!(#t~post5 < 50);havoc #t~post5; {10564#true} is VALID [2022-04-14 15:21:52,039 INFO L290 TraceCheckUtils]: 17: Hoare triple {10564#true} assume !!(~q~0 % 4294967296 <= ~n~0 % 4294967296);~q~0 := 4 * ~q~0; {10564#true} is VALID [2022-04-14 15:21:52,039 INFO L290 TraceCheckUtils]: 18: Hoare triple {10564#true} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {10564#true} is VALID [2022-04-14 15:21:52,039 INFO L290 TraceCheckUtils]: 19: Hoare triple {10564#true} assume !!(#t~post5 < 50);havoc #t~post5; {10564#true} is VALID [2022-04-14 15:21:52,039 INFO L290 TraceCheckUtils]: 20: Hoare triple {10564#true} assume !!(~q~0 % 4294967296 <= ~n~0 % 4294967296);~q~0 := 4 * ~q~0; {10564#true} is VALID [2022-04-14 15:21:52,039 INFO L290 TraceCheckUtils]: 21: Hoare triple {10564#true} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {10564#true} is VALID [2022-04-14 15:21:52,039 INFO L290 TraceCheckUtils]: 22: Hoare triple {10564#true} assume !!(#t~post5 < 50);havoc #t~post5; {10564#true} is VALID [2022-04-14 15:21:52,039 INFO L290 TraceCheckUtils]: 23: Hoare triple {10564#true} assume !!(~q~0 % 4294967296 <= ~n~0 % 4294967296);~q~0 := 4 * ~q~0; {10564#true} is VALID [2022-04-14 15:21:52,039 INFO L290 TraceCheckUtils]: 24: Hoare triple {10564#true} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {10564#true} is VALID [2022-04-14 15:21:52,039 INFO L290 TraceCheckUtils]: 25: Hoare triple {10564#true} assume !!(#t~post5 < 50);havoc #t~post5; {10564#true} is VALID [2022-04-14 15:21:52,039 INFO L290 TraceCheckUtils]: 26: Hoare triple {10564#true} assume !!(~q~0 % 4294967296 <= ~n~0 % 4294967296);~q~0 := 4 * ~q~0; {10564#true} is VALID [2022-04-14 15:21:52,040 INFO L290 TraceCheckUtils]: 27: Hoare triple {10564#true} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {10564#true} is VALID [2022-04-14 15:21:52,040 INFO L290 TraceCheckUtils]: 28: Hoare triple {10564#true} assume !!(#t~post5 < 50);havoc #t~post5; {10564#true} is VALID [2022-04-14 15:21:52,040 INFO L290 TraceCheckUtils]: 29: Hoare triple {10564#true} assume !!(~q~0 % 4294967296 <= ~n~0 % 4294967296);~q~0 := 4 * ~q~0; {10564#true} is VALID [2022-04-14 15:21:52,040 INFO L290 TraceCheckUtils]: 30: Hoare triple {10564#true} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {10564#true} is VALID [2022-04-14 15:21:52,040 INFO L290 TraceCheckUtils]: 31: Hoare triple {10564#true} assume !!(#t~post5 < 50);havoc #t~post5; {10564#true} is VALID [2022-04-14 15:21:52,040 INFO L290 TraceCheckUtils]: 32: Hoare triple {10564#true} assume !!(~q~0 % 4294967296 <= ~n~0 % 4294967296);~q~0 := 4 * ~q~0; {10564#true} is VALID [2022-04-14 15:21:52,040 INFO L290 TraceCheckUtils]: 33: Hoare triple {10564#true} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {10564#true} is VALID [2022-04-14 15:21:52,040 INFO L290 TraceCheckUtils]: 34: Hoare triple {10564#true} assume !!(#t~post5 < 50);havoc #t~post5; {10564#true} is VALID [2022-04-14 15:21:52,040 INFO L290 TraceCheckUtils]: 35: Hoare triple {10564#true} assume !!(~q~0 % 4294967296 <= ~n~0 % 4294967296);~q~0 := 4 * ~q~0; {10564#true} is VALID [2022-04-14 15:21:52,040 INFO L290 TraceCheckUtils]: 36: Hoare triple {10564#true} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {10564#true} is VALID [2022-04-14 15:21:52,040 INFO L290 TraceCheckUtils]: 37: Hoare triple {10564#true} assume !!(#t~post5 < 50);havoc #t~post5; {10564#true} is VALID [2022-04-14 15:21:52,040 INFO L290 TraceCheckUtils]: 38: Hoare triple {10564#true} assume !!(~q~0 % 4294967296 <= ~n~0 % 4294967296);~q~0 := 4 * ~q~0; {10564#true} is VALID [2022-04-14 15:21:52,040 INFO L290 TraceCheckUtils]: 39: Hoare triple {10564#true} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {10564#true} is VALID [2022-04-14 15:21:52,040 INFO L290 TraceCheckUtils]: 40: Hoare triple {10564#true} assume !!(#t~post5 < 50);havoc #t~post5; {10564#true} is VALID [2022-04-14 15:21:52,041 INFO L290 TraceCheckUtils]: 41: Hoare triple {10564#true} assume !!(~q~0 % 4294967296 <= ~n~0 % 4294967296);~q~0 := 4 * ~q~0; {10564#true} is VALID [2022-04-14 15:21:52,041 INFO L290 TraceCheckUtils]: 42: Hoare triple {10564#true} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {10715#(<= (+ |main_#t~post5| 1) ~counter~0)} is VALID [2022-04-14 15:21:52,042 INFO L290 TraceCheckUtils]: 43: Hoare triple {10715#(<= (+ |main_#t~post5| 1) ~counter~0)} assume !(#t~post5 < 50);havoc #t~post5; {10719#(<= 51 ~counter~0)} is VALID [2022-04-14 15:21:52,042 INFO L290 TraceCheckUtils]: 44: Hoare triple {10719#(<= 51 ~counter~0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {10723#(<= 51 |main_#t~post6|)} is VALID [2022-04-14 15:21:52,043 INFO L290 TraceCheckUtils]: 45: Hoare triple {10723#(<= 51 |main_#t~post6|)} assume !!(#t~post6 < 50);havoc #t~post6; {10565#false} is VALID [2022-04-14 15:21:52,043 INFO L272 TraceCheckUtils]: 46: Hoare triple {10565#false} call __VERIFIER_assert((if ~r~0 % 4294967296 < (2 * ~p~0 + ~q~0) % 4294967296 then 1 else 0)); {10565#false} is VALID [2022-04-14 15:21:52,043 INFO L290 TraceCheckUtils]: 47: Hoare triple {10565#false} ~cond := #in~cond; {10565#false} is VALID [2022-04-14 15:21:52,043 INFO L290 TraceCheckUtils]: 48: Hoare triple {10565#false} assume 0 == ~cond; {10565#false} is VALID [2022-04-14 15:21:52,043 INFO L290 TraceCheckUtils]: 49: Hoare triple {10565#false} assume !false; {10565#false} is VALID [2022-04-14 15:21:52,043 INFO L134 CoverageAnalysis]: Checked inductivity of 155 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2022-04-14 15:21:52,043 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-14 15:21:52,043 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2075212852] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-14 15:21:52,043 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-04-14 15:21:52,044 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [15] total 18 [2022-04-14 15:21:52,044 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [94637265] [2022-04-14 15:21:52,044 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-14 15:21:52,044 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 50 [2022-04-14 15:21:52,044 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 15:21:52,044 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), 5 states have internal predecessors, (17), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-14 15:21:52,067 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 15:21:52,067 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-14 15:21:52,067 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 15:21:52,067 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-14 15:21:52,068 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=218, Unknown=0, NotChecked=0, Total=306 [2022-04-14 15:21:52,068 INFO L87 Difference]: Start difference. First operand 585 states and 783 transitions. Second operand has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-14 15:21:59,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 15:21:59,413 INFO L93 Difference]: Finished difference Result 664 states and 874 transitions. [2022-04-14 15:21:59,413 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-14 15:21:59,413 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 50 [2022-04-14 15:21:59,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-14 15:21:59,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-14 15:21:59,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 77 transitions. [2022-04-14 15:21:59,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-14 15:21:59,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 77 transitions. [2022-04-14 15:21:59,415 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 77 transitions. [2022-04-14 15:21:59,495 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 77 edges. 77 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 15:21:59,516 INFO L225 Difference]: With dead ends: 664 [2022-04-14 15:21:59,517 INFO L226 Difference]: Without dead ends: 558 [2022-04-14 15:21:59,517 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=92, Invalid=250, Unknown=0, NotChecked=0, Total=342 [2022-04-14 15:21:59,518 INFO L913 BasicCegarLoop]: 44 mSDtfsCounter, 0 mSDsluCounter, 123 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 167 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-14 15:21:59,518 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 167 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-14 15:21:59,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 558 states. [2022-04-14 15:21:59,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 558 to 558. [2022-04-14 15:21:59,841 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-14 15:21:59,842 INFO L82 GeneralOperation]: Start isEquivalent. First operand 558 states. Second operand has 558 states, 303 states have (on average 1.2046204620462047) internal successors, (365), 325 states have internal predecessors, (365), 196 states have call successors, (196), 59 states have call predecessors, (196), 58 states have return successors, (173), 173 states have call predecessors, (173), 173 states have call successors, (173) [2022-04-14 15:21:59,843 INFO L74 IsIncluded]: Start isIncluded. First operand 558 states. Second operand has 558 states, 303 states have (on average 1.2046204620462047) internal successors, (365), 325 states have internal predecessors, (365), 196 states have call successors, (196), 59 states have call predecessors, (196), 58 states have return successors, (173), 173 states have call predecessors, (173), 173 states have call successors, (173) [2022-04-14 15:21:59,844 INFO L87 Difference]: Start difference. First operand 558 states. Second operand has 558 states, 303 states have (on average 1.2046204620462047) internal successors, (365), 325 states have internal predecessors, (365), 196 states have call successors, (196), 59 states have call predecessors, (196), 58 states have return successors, (173), 173 states have call predecessors, (173), 173 states have call successors, (173) [2022-04-14 15:21:59,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 15:21:59,864 INFO L93 Difference]: Finished difference Result 558 states and 734 transitions. [2022-04-14 15:21:59,864 INFO L276 IsEmpty]: Start isEmpty. Operand 558 states and 734 transitions. [2022-04-14 15:21:59,866 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 15:21:59,866 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 15:21:59,867 INFO L74 IsIncluded]: Start isIncluded. First operand has 558 states, 303 states have (on average 1.2046204620462047) internal successors, (365), 325 states have internal predecessors, (365), 196 states have call successors, (196), 59 states have call predecessors, (196), 58 states have return successors, (173), 173 states have call predecessors, (173), 173 states have call successors, (173) Second operand 558 states. [2022-04-14 15:21:59,868 INFO L87 Difference]: Start difference. First operand has 558 states, 303 states have (on average 1.2046204620462047) internal successors, (365), 325 states have internal predecessors, (365), 196 states have call successors, (196), 59 states have call predecessors, (196), 58 states have return successors, (173), 173 states have call predecessors, (173), 173 states have call successors, (173) Second operand 558 states. [2022-04-14 15:21:59,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 15:21:59,888 INFO L93 Difference]: Finished difference Result 558 states and 734 transitions. [2022-04-14 15:21:59,889 INFO L276 IsEmpty]: Start isEmpty. Operand 558 states and 734 transitions. [2022-04-14 15:21:59,891 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 15:21:59,891 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 15:21:59,891 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-14 15:21:59,891 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-14 15:21:59,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 558 states, 303 states have (on average 1.2046204620462047) internal successors, (365), 325 states have internal predecessors, (365), 196 states have call successors, (196), 59 states have call predecessors, (196), 58 states have return successors, (173), 173 states have call predecessors, (173), 173 states have call successors, (173) [2022-04-14 15:21:59,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 558 states to 558 states and 734 transitions. [2022-04-14 15:21:59,918 INFO L78 Accepts]: Start accepts. Automaton has 558 states and 734 transitions. Word has length 50 [2022-04-14 15:21:59,918 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-14 15:21:59,918 INFO L478 AbstractCegarLoop]: Abstraction has 558 states and 734 transitions. [2022-04-14 15:21:59,919 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-14 15:21:59,919 INFO L276 IsEmpty]: Start isEmpty. Operand 558 states and 734 transitions. [2022-04-14 15:21:59,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-04-14 15:21:59,920 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 15:21:59,920 INFO L499 BasicCegarLoop]: trace histogram [7, 6, 6, 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, 1] [2022-04-14 15:21:59,943 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-04-14 15:22:00,143 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2022-04-14 15:22:00,143 INFO L403 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 15:22:00,143 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 15:22:00,143 INFO L85 PathProgramCache]: Analyzing trace with hash 109392637, now seen corresponding path program 1 times [2022-04-14 15:22:00,143 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 15:22:00,144 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2002727106] [2022-04-14 15:22:00,144 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 15:22:00,144 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 15:22:00,163 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-14 15:22:00,163 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [201531569] [2022-04-14 15:22:00,163 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 15:22:00,163 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-14 15:22:00,163 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-14 15:22:00,164 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-14 15:22:00,196 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process