/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_unwindbound5.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-e106359-m [2022-04-14 15:16:02,299 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-14 15:16:02,301 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-14 15:16:02,350 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-14 15:16:02,351 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-14 15:16:02,352 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-14 15:16:02,354 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-14 15:16:02,359 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-14 15:16:02,361 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-14 15:16:02,366 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-14 15:16:02,366 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-14 15:16:02,367 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-14 15:16:02,367 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-14 15:16:02,368 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-14 15:16:02,369 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-14 15:16:02,369 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-14 15:16:02,370 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-14 15:16:02,370 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-14 15:16:02,371 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-14 15:16:02,373 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-14 15:16:02,374 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-14 15:16:02,376 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-14 15:16:02,378 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-14 15:16:02,381 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-14 15:16:02,382 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-14 15:16:02,392 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-14 15:16:02,392 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-14 15:16:02,392 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-14 15:16:02,393 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-14 15:16:02,393 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-14 15:16:02,394 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-14 15:16:02,394 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-14 15:16:02,395 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-14 15:16:02,395 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-14 15:16:02,396 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-14 15:16:02,396 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-14 15:16:02,397 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-14 15:16:02,397 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-14 15:16:02,397 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-14 15:16:02,398 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-14 15:16:02,398 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-14 15:16:02,401 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-14 15:16:02,402 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:02,431 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-14 15:16:02,431 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-14 15:16:02,431 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-04-14 15:16:02,431 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-04-14 15:16:02,432 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-04-14 15:16:02,432 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-04-14 15:16:02,432 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-04-14 15:16:02,433 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-04-14 15:16:02,433 INFO L138 SettingsManager]: * Use SBE=true [2022-04-14 15:16:02,433 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-14 15:16:02,433 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-14 15:16:02,433 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-14 15:16:02,433 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-14 15:16:02,433 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-14 15:16:02,433 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-14 15:16:02,434 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-14 15:16:02,434 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-14 15:16:02,434 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-14 15:16:02,434 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-14 15:16:02,434 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-14 15:16:02,434 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-14 15:16:02,434 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-14 15:16:02,434 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-14 15:16:02,435 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-14 15:16:02,435 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-14 15:16:02,435 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-14 15:16:02,437 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-04-14 15:16:02,437 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-04-14 15:16:02,437 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-04-14 15:16:02,438 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-04-14 15:16:02,438 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-04-14 15:16:02,438 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-04-14 15:16:02,438 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-14 15:16:02,438 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:02,665 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-14 15:16:02,690 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-14 15:16:02,692 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-14 15:16:02,693 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-14 15:16:02,693 INFO L275 PluginConnector]: CDTParser initialized [2022-04-14 15:16:02,694 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/nla-digbench-scaling/dijkstra-u_unwindbound5.c [2022-04-14 15:16:02,764 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2dbe4f8e6/c1efac46567c4263b007932096cb7bd1/FLAGe9872365e [2022-04-14 15:16:03,110 INFO L306 CDTParser]: Found 1 translation units. [2022-04-14 15:16:03,110 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/dijkstra-u_unwindbound5.c [2022-04-14 15:16:03,119 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2dbe4f8e6/c1efac46567c4263b007932096cb7bd1/FLAGe9872365e [2022-04-14 15:16:03,130 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2dbe4f8e6/c1efac46567c4263b007932096cb7bd1 [2022-04-14 15:16:03,132 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-14 15:16:03,133 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-14 15:16:03,135 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-14 15:16:03,135 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-14 15:16:03,137 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-14 15:16:03,138 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.04 03:16:03" (1/1) ... [2022-04-14 15:16:03,138 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@437b1ba0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 03:16:03, skipping insertion in model container [2022-04-14 15:16:03,139 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.04 03:16:03" (1/1) ... [2022-04-14 15:16:03,144 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-14 15:16:03,156 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-14 15:16:03,288 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_unwindbound5.c[525,538] [2022-04-14 15:16:03,326 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-14 15:16:03,333 INFO L203 MainTranslator]: Completed pre-run [2022-04-14 15:16:03,344 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_unwindbound5.c[525,538] [2022-04-14 15:16:03,360 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-14 15:16:03,371 INFO L208 MainTranslator]: Completed translation [2022-04-14 15:16:03,372 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 03:16:03 WrapperNode [2022-04-14 15:16:03,372 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-14 15:16:03,373 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-14 15:16:03,373 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-14 15:16:03,373 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-14 15:16:03,387 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:03" (1/1) ... [2022-04-14 15:16:03,387 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:03" (1/1) ... [2022-04-14 15:16:03,392 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:03" (1/1) ... [2022-04-14 15:16:03,393 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:03" (1/1) ... [2022-04-14 15:16:03,398 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:03" (1/1) ... [2022-04-14 15:16:03,406 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:03" (1/1) ... [2022-04-14 15:16:03,407 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:03" (1/1) ... [2022-04-14 15:16:03,409 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-14 15:16:03,410 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-14 15:16:03,410 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-14 15:16:03,410 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-14 15:16:03,417 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 03:16:03" (1/1) ... [2022-04-14 15:16:03,430 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-14 15:16:03,445 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-14 15:16:03,460 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:03,484 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:03,510 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-14 15:16:03,511 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-14 15:16:03,511 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-14 15:16:03,511 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-14 15:16:03,513 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-14 15:16:03,514 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-14 15:16:03,514 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-14 15:16:03,514 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-14 15:16:03,514 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-14 15:16:03,514 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-14 15:16:03,514 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uint [2022-04-14 15:16:03,514 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-14 15:16:03,514 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-14 15:16:03,514 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-14 15:16:03,515 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-14 15:16:03,515 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-14 15:16:03,515 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-14 15:16:03,515 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-14 15:16:03,515 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-14 15:16:03,515 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-14 15:16:03,576 INFO L234 CfgBuilder]: Building ICFG [2022-04-14 15:16:03,579 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-14 15:16:03,803 INFO L275 CfgBuilder]: Performing block encoding [2022-04-14 15:16:03,813 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-14 15:16:03,813 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-04-14 15:16:03,815 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.04 03:16:03 BoogieIcfgContainer [2022-04-14 15:16:03,815 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-14 15:16:03,816 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-14 15:16:03,816 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-14 15:16:03,819 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-14 15:16:03,820 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.04 03:16:03" (1/3) ... [2022-04-14 15:16:03,820 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@d0986a6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.04 03:16:03, skipping insertion in model container [2022-04-14 15:16:03,820 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 03:16:03" (2/3) ... [2022-04-14 15:16:03,821 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@d0986a6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.04 03:16:03, skipping insertion in model container [2022-04-14 15:16:03,821 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.04 03:16:03" (3/3) ... [2022-04-14 15:16:03,822 INFO L111 eAbstractionObserver]: Analyzing ICFG dijkstra-u_unwindbound5.c [2022-04-14 15:16:03,826 INFO L202 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-04-14 15:16:03,826 INFO L161 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-14 15:16:03,866 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-14 15:16:03,872 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:03,872 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-14 15:16:03,889 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:03,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-04-14 15:16:03,894 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 15:16:03,894 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:03,894 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 15:16:03,899 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 15:16:03,899 INFO L85 PathProgramCache]: Analyzing trace with hash -2024343623, now seen corresponding path program 1 times [2022-04-14 15:16:03,907 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 15:16:03,907 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1193358713] [2022-04-14 15:16:03,908 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 15:16:03,908 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 15:16:03,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 15:16:04,031 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-14 15:16:04,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 15:16:04,049 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:04,050 INFO L290 TraceCheckUtils]: 1: Hoare triple {42#true} assume true; {42#true} is VALID [2022-04-14 15:16:04,050 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {42#true} {42#true} #102#return; {42#true} is VALID [2022-04-14 15:16:04,051 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-14 15:16:04,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 15:16:04,058 INFO L290 TraceCheckUtils]: 0: Hoare triple {42#true} ~cond := #in~cond; {42#true} is VALID [2022-04-14 15:16:04,059 INFO L290 TraceCheckUtils]: 1: Hoare triple {42#true} assume 0 == ~cond;assume false; {43#false} is VALID [2022-04-14 15:16:04,059 INFO L290 TraceCheckUtils]: 2: Hoare triple {43#false} assume true; {43#false} is VALID [2022-04-14 15:16:04,059 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {43#false} {42#true} #82#return; {43#false} is VALID [2022-04-14 15:16:04,060 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:04,061 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:04,061 INFO L290 TraceCheckUtils]: 2: Hoare triple {42#true} assume true; {42#true} is VALID [2022-04-14 15:16:04,061 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {42#true} {42#true} #102#return; {42#true} is VALID [2022-04-14 15:16:04,061 INFO L272 TraceCheckUtils]: 4: Hoare triple {42#true} call #t~ret7 := main(); {42#true} is VALID [2022-04-14 15:16:04,062 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:04,062 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:04,062 INFO L290 TraceCheckUtils]: 7: Hoare triple {42#true} ~cond := #in~cond; {42#true} is VALID [2022-04-14 15:16:04,062 INFO L290 TraceCheckUtils]: 8: Hoare triple {42#true} assume 0 == ~cond;assume false; {43#false} is VALID [2022-04-14 15:16:04,063 INFO L290 TraceCheckUtils]: 9: Hoare triple {43#false} assume true; {43#false} is VALID [2022-04-14 15:16:04,063 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {43#false} {42#true} #82#return; {43#false} is VALID [2022-04-14 15:16:04,063 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:04,063 INFO L290 TraceCheckUtils]: 12: Hoare triple {43#false} assume !true; {43#false} is VALID [2022-04-14 15:16:04,064 INFO L290 TraceCheckUtils]: 13: Hoare triple {43#false} assume !true; {43#false} is VALID [2022-04-14 15:16:04,064 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:04,064 INFO L290 TraceCheckUtils]: 15: Hoare triple {43#false} ~cond := #in~cond; {43#false} is VALID [2022-04-14 15:16:04,064 INFO L290 TraceCheckUtils]: 16: Hoare triple {43#false} assume 0 == ~cond; {43#false} is VALID [2022-04-14 15:16:04,064 INFO L290 TraceCheckUtils]: 17: Hoare triple {43#false} assume !false; {43#false} is VALID [2022-04-14 15:16:04,065 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:04,065 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 15:16:04,066 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1193358713] [2022-04-14 15:16:04,066 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1193358713] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-14 15:16:04,066 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-14 15:16:04,066 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-14 15:16:04,068 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [479902760] [2022-04-14 15:16:04,068 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-14 15:16:04,073 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:04,074 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 15:16:04,077 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:04,098 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:04,099 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-14 15:16:04,099 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 15:16:04,115 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-14 15:16:04,116 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-14 15:16:04,118 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:10,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 15:16:10,926 INFO L93 Difference]: Finished difference Result 70 states and 111 transitions. [2022-04-14 15:16:10,926 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-14 15:16:10,926 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:10,926 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-14 15:16:10,927 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:10,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 111 transitions. [2022-04-14 15:16:10,939 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:10,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 111 transitions. [2022-04-14 15:16:10,946 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 111 transitions. [2022-04-14 15:16:11,088 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:11,096 INFO L225 Difference]: With dead ends: 70 [2022-04-14 15:16:11,097 INFO L226 Difference]: Without dead ends: 35 [2022-04-14 15:16:11,099 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:11,102 INFO L913 BasicCegarLoop]: 49 mSDtfsCounter, 10 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s 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.3s IncrementalHoareTripleChecker+Time [2022-04-14 15:16:11,103 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.3s Time] [2022-04-14 15:16:11,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2022-04-14 15:16:11,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 34. [2022-04-14 15:16:11,175 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-14 15:16:11,176 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:11,177 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:11,177 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:11,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 15:16:11,193 INFO L93 Difference]: Finished difference Result 35 states and 47 transitions. [2022-04-14 15:16:11,193 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 47 transitions. [2022-04-14 15:16:11,195 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 15:16:11,195 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 15:16:11,195 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:11,196 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:11,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 15:16:11,202 INFO L93 Difference]: Finished difference Result 35 states and 47 transitions. [2022-04-14 15:16:11,202 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 47 transitions. [2022-04-14 15:16:11,203 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 15:16:11,203 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 15:16:11,203 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-14 15:16:11,203 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-14 15:16:11,204 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:11,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 46 transitions. [2022-04-14 15:16:11,215 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 46 transitions. Word has length 18 [2022-04-14 15:16:11,215 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-14 15:16:11,215 INFO L478 AbstractCegarLoop]: Abstraction has 34 states and 46 transitions. [2022-04-14 15:16:11,216 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:11,216 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 46 transitions. [2022-04-14 15:16:11,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-04-14 15:16:11,217 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 15:16:11,217 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:11,217 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-14 15:16:11,217 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 15:16:11,218 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 15:16:11,218 INFO L85 PathProgramCache]: Analyzing trace with hash -96361696, now seen corresponding path program 1 times [2022-04-14 15:16:11,218 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 15:16:11,218 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [920456003] [2022-04-14 15:16:11,219 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 15:16:11,219 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 15:16:11,260 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-14 15:16:11,260 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1550449894] [2022-04-14 15:16:11,261 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 15:16:11,261 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-14 15:16:11,262 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-14 15:16:11,265 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:11,265 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:11,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 15:16:11,337 INFO L263 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 5 conjunts are in the unsatisfiable core [2022-04-14 15:16:11,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 15:16:11,358 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-14 15:16:11,548 INFO L272 TraceCheckUtils]: 0: Hoare triple {274#true} call ULTIMATE.init(); {274#true} is VALID [2022-04-14 15:16:11,549 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:11,549 INFO L290 TraceCheckUtils]: 2: Hoare triple {282#(<= ~counter~0 0)} assume true; {282#(<= ~counter~0 0)} is VALID [2022-04-14 15:16:11,550 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:11,550 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:11,551 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:11,551 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:11,552 INFO L290 TraceCheckUtils]: 7: Hoare triple {282#(<= ~counter~0 0)} ~cond := #in~cond; {282#(<= ~counter~0 0)} is VALID [2022-04-14 15:16:11,552 INFO L290 TraceCheckUtils]: 8: Hoare triple {282#(<= ~counter~0 0)} assume !(0 == ~cond); {282#(<= ~counter~0 0)} is VALID [2022-04-14 15:16:11,553 INFO L290 TraceCheckUtils]: 9: Hoare triple {282#(<= ~counter~0 0)} assume true; {282#(<= ~counter~0 0)} is VALID [2022-04-14 15:16:11,553 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:11,554 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:11,555 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:11,555 INFO L290 TraceCheckUtils]: 13: Hoare triple {316#(<= |main_#t~post5| 0)} assume !(#t~post5 < 5);havoc #t~post5; {275#false} is VALID [2022-04-14 15:16:11,556 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:11,556 INFO L290 TraceCheckUtils]: 15: Hoare triple {275#false} assume !(#t~post6 < 5);havoc #t~post6; {275#false} is VALID [2022-04-14 15:16:11,556 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:11,556 INFO L290 TraceCheckUtils]: 17: Hoare triple {275#false} ~cond := #in~cond; {275#false} is VALID [2022-04-14 15:16:11,557 INFO L290 TraceCheckUtils]: 18: Hoare triple {275#false} assume 0 == ~cond; {275#false} is VALID [2022-04-14 15:16:11,557 INFO L290 TraceCheckUtils]: 19: Hoare triple {275#false} assume !false; {275#false} is VALID [2022-04-14 15:16:11,557 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:11,557 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-14 15:16:11,557 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 15:16:11,558 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [920456003] [2022-04-14 15:16:11,558 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-14 15:16:11,558 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1550449894] [2022-04-14 15:16:11,558 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1550449894] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-14 15:16:11,558 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-14 15:16:11,559 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-14 15:16:11,559 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [238231200] [2022-04-14 15:16:11,560 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-14 15:16:11,560 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:11,561 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 15:16:11,561 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:11,584 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:11,584 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-14 15:16:11,585 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 15:16:11,587 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-14 15:16:11,587 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-14 15:16:11,588 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:17,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 15:16:17,764 INFO L93 Difference]: Finished difference Result 55 states and 78 transitions. [2022-04-14 15:16:17,764 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-14 15:16:17,764 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:17,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-14 15:16:17,765 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:17,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 78 transitions. [2022-04-14 15:16:17,770 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:17,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 78 transitions. [2022-04-14 15:16:17,773 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 78 transitions. [2022-04-14 15:16:17,875 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:17,877 INFO L225 Difference]: With dead ends: 55 [2022-04-14 15:16:17,877 INFO L226 Difference]: Without dead ends: 36 [2022-04-14 15:16:17,878 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:17,879 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:17,879 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:17,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2022-04-14 15:16:17,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2022-04-14 15:16:17,889 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-14 15:16:17,889 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:17,890 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:17,890 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:17,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 15:16:17,893 INFO L93 Difference]: Finished difference Result 36 states and 48 transitions. [2022-04-14 15:16:17,894 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 48 transitions. [2022-04-14 15:16:17,894 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 15:16:17,894 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 15:16:17,895 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:17,895 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:17,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 15:16:17,898 INFO L93 Difference]: Finished difference Result 36 states and 48 transitions. [2022-04-14 15:16:17,899 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 48 transitions. [2022-04-14 15:16:17,899 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 15:16:17,899 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 15:16:17,900 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-14 15:16:17,900 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-14 15:16:17,900 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:17,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 48 transitions. [2022-04-14 15:16:17,903 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 48 transitions. Word has length 20 [2022-04-14 15:16:17,903 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-14 15:16:17,903 INFO L478 AbstractCegarLoop]: Abstraction has 36 states and 48 transitions. [2022-04-14 15:16:17,903 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:17,903 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 48 transitions. [2022-04-14 15:16:17,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-04-14 15:16:17,904 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 15:16:17,904 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:17,934 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-04-14 15:16:18,123 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:18,124 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 15:16:18,124 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 15:16:18,124 INFO L85 PathProgramCache]: Analyzing trace with hash 962099791, now seen corresponding path program 1 times [2022-04-14 15:16:18,125 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 15:16:18,125 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [88380239] [2022-04-14 15:16:18,125 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 15:16:18,125 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 15:16:18,142 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-14 15:16:18,142 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1081626988] [2022-04-14 15:16:18,143 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 15:16:18,143 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-14 15:16:18,143 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-14 15:16:18,144 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:18,145 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:18,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 15:16:18,187 INFO L263 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-14 15:16:18,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 15:16:18,200 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-14 15:16:18,368 INFO L272 TraceCheckUtils]: 0: Hoare triple {546#true} call ULTIMATE.init(); {546#true} is VALID [2022-04-14 15:16:18,369 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:18,369 INFO L290 TraceCheckUtils]: 2: Hoare triple {554#(<= ~counter~0 0)} assume true; {554#(<= ~counter~0 0)} is VALID [2022-04-14 15:16:18,370 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:18,374 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:18,374 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:18,376 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:18,376 INFO L290 TraceCheckUtils]: 7: Hoare triple {554#(<= ~counter~0 0)} ~cond := #in~cond; {554#(<= ~counter~0 0)} is VALID [2022-04-14 15:16:18,379 INFO L290 TraceCheckUtils]: 8: Hoare triple {554#(<= ~counter~0 0)} assume !(0 == ~cond); {554#(<= ~counter~0 0)} is VALID [2022-04-14 15:16:18,380 INFO L290 TraceCheckUtils]: 9: Hoare triple {554#(<= ~counter~0 0)} assume true; {554#(<= ~counter~0 0)} is VALID [2022-04-14 15:16:18,380 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:18,381 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:18,381 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:18,382 INFO L290 TraceCheckUtils]: 13: Hoare triple {588#(<= ~counter~0 1)} assume !!(#t~post5 < 5);havoc #t~post5; {588#(<= ~counter~0 1)} is VALID [2022-04-14 15:16:18,382 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:18,383 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:18,383 INFO L290 TraceCheckUtils]: 16: Hoare triple {598#(<= |main_#t~post6| 1)} assume !(#t~post6 < 5);havoc #t~post6; {547#false} is VALID [2022-04-14 15:16:18,383 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:18,384 INFO L290 TraceCheckUtils]: 18: Hoare triple {547#false} ~cond := #in~cond; {547#false} is VALID [2022-04-14 15:16:18,384 INFO L290 TraceCheckUtils]: 19: Hoare triple {547#false} assume 0 == ~cond; {547#false} is VALID [2022-04-14 15:16:18,384 INFO L290 TraceCheckUtils]: 20: Hoare triple {547#false} assume !false; {547#false} is VALID [2022-04-14 15:16:18,384 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:18,384 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-14 15:16:18,385 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 15:16:18,385 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [88380239] [2022-04-14 15:16:18,385 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-14 15:16:18,385 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1081626988] [2022-04-14 15:16:18,385 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1081626988] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-14 15:16:18,385 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-14 15:16:18,385 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-14 15:16:18,385 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1349887314] [2022-04-14 15:16:18,386 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-14 15:16:18,386 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:18,386 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 15:16:18,387 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:18,405 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:18,405 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-14 15:16:18,406 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 15:16:18,406 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-14 15:16:18,406 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-04-14 15:16:18,406 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:27,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 15:16:27,138 INFO L93 Difference]: Finished difference Result 49 states and 64 transitions. [2022-04-14 15:16:27,138 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-14 15:16:27,138 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:27,139 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-14 15:16:27,139 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:27,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 64 transitions. [2022-04-14 15:16:27,141 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:27,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 64 transitions. [2022-04-14 15:16:27,143 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 64 transitions. [2022-04-14 15:16:27,207 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:27,209 INFO L225 Difference]: With dead ends: 49 [2022-04-14 15:16:27,209 INFO L226 Difference]: Without dead ends: 40 [2022-04-14 15:16:27,209 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:27,210 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:27,211 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:27,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2022-04-14 15:16:27,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 39. [2022-04-14 15:16:27,218 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-14 15:16:27,218 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:27,219 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:27,219 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:27,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 15:16:27,222 INFO L93 Difference]: Finished difference Result 40 states and 53 transitions. [2022-04-14 15:16:27,222 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 53 transitions. [2022-04-14 15:16:27,223 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 15:16:27,223 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 15:16:27,223 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:27,223 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:27,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 15:16:27,226 INFO L93 Difference]: Finished difference Result 40 states and 53 transitions. [2022-04-14 15:16:27,226 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 53 transitions. [2022-04-14 15:16:27,227 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 15:16:27,227 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 15:16:27,227 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-14 15:16:27,227 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-14 15:16:27,228 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:27,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 52 transitions. [2022-04-14 15:16:27,230 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 52 transitions. Word has length 21 [2022-04-14 15:16:27,230 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-14 15:16:27,230 INFO L478 AbstractCegarLoop]: Abstraction has 39 states and 52 transitions. [2022-04-14 15:16:27,230 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:27,231 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 52 transitions. [2022-04-14 15:16:27,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-04-14 15:16:27,231 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 15:16:27,231 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:27,263 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:27,444 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:27,445 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 15:16:27,445 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 15:16:27,445 INFO L85 PathProgramCache]: Analyzing trace with hash 963589341, now seen corresponding path program 1 times [2022-04-14 15:16:27,446 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 15:16:27,446 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1348079728] [2022-04-14 15:16:27,446 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 15:16:27,446 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 15:16:27,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 15:16:27,644 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-14 15:16:27,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 15:16:27,651 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,652 INFO L290 TraceCheckUtils]: 1: Hoare triple {822#true} assume true; {822#true} is VALID [2022-04-14 15:16:27,652 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {822#true} {822#true} #102#return; {822#true} is VALID [2022-04-14 15:16:27,652 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-14 15:16:27,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 15:16:27,657 INFO L290 TraceCheckUtils]: 0: Hoare triple {822#true} ~cond := #in~cond; {822#true} is VALID [2022-04-14 15:16:27,657 INFO L290 TraceCheckUtils]: 1: Hoare triple {822#true} assume !(0 == ~cond); {822#true} is VALID [2022-04-14 15:16:27,658 INFO L290 TraceCheckUtils]: 2: Hoare triple {822#true} assume true; {822#true} is VALID [2022-04-14 15:16:27,658 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {822#true} {822#true} #82#return; {822#true} is VALID [2022-04-14 15:16:27,659 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,659 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,659 INFO L290 TraceCheckUtils]: 2: Hoare triple {822#true} assume true; {822#true} is VALID [2022-04-14 15:16:27,659 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {822#true} {822#true} #102#return; {822#true} is VALID [2022-04-14 15:16:27,660 INFO L272 TraceCheckUtils]: 4: Hoare triple {822#true} call #t~ret7 := main(); {822#true} is VALID [2022-04-14 15:16:27,660 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,660 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,660 INFO L290 TraceCheckUtils]: 7: Hoare triple {822#true} ~cond := #in~cond; {822#true} is VALID [2022-04-14 15:16:27,660 INFO L290 TraceCheckUtils]: 8: Hoare triple {822#true} assume !(0 == ~cond); {822#true} is VALID [2022-04-14 15:16:27,660 INFO L290 TraceCheckUtils]: 9: Hoare triple {822#true} assume true; {822#true} is VALID [2022-04-14 15:16:27,661 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {822#true} {822#true} #82#return; {822#true} is VALID [2022-04-14 15:16:27,661 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,662 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,662 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 < 5);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,663 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,664 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,665 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 < 5);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,666 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,667 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,667 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,667 INFO L290 TraceCheckUtils]: 20: Hoare triple {823#false} assume !false; {823#false} is VALID [2022-04-14 15:16:27,667 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,668 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 15:16:27,668 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1348079728] [2022-04-14 15:16:27,668 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1348079728] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-14 15:16:27,668 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-14 15:16:27,668 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-14 15:16:27,668 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1634628511] [2022-04-14 15:16:27,668 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-14 15:16:27,669 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,669 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 15:16:27,669 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,685 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,686 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-14 15:16:27,686 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 15:16:27,686 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-14 15:16:27,687 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-04-14 15:16:27,687 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:32,593 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:39,445 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:16:44,120 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:16:46,122 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:16:47,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 15:16:47,697 INFO L93 Difference]: Finished difference Result 72 states and 104 transitions. [2022-04-14 15:16:47,697 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-14 15:16:47,697 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:47,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-14 15:16:47,698 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:47,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 104 transitions. [2022-04-14 15:16:47,701 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:47,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 104 transitions. [2022-04-14 15:16:47,703 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 104 transitions. [2022-04-14 15:16:47,958 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:47,959 INFO L225 Difference]: With dead ends: 72 [2022-04-14 15:16:47,960 INFO L226 Difference]: Without dead ends: 51 [2022-04-14 15:16:47,960 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:47,961 INFO L913 BasicCegarLoop]: 49 mSDtfsCounter, 24 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 205 mSolverCounterSat, 37 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 14.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 107 SdHoareTripleChecker+Invalid, 246 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 205 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 14.3s IncrementalHoareTripleChecker+Time [2022-04-14 15:16:47,961 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [25 Valid, 107 Invalid, 246 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 205 Invalid, 4 Unknown, 0 Unchecked, 14.3s Time] [2022-04-14 15:16:47,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2022-04-14 15:16:47,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2022-04-14 15:16:47,978 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-14 15:16:47,978 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:47,978 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:47,979 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:47,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 15:16:47,982 INFO L93 Difference]: Finished difference Result 51 states and 69 transitions. [2022-04-14 15:16:47,982 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 69 transitions. [2022-04-14 15:16:47,983 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 15:16:47,983 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 15:16:47,983 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:47,984 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:47,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 15:16:47,987 INFO L93 Difference]: Finished difference Result 51 states and 69 transitions. [2022-04-14 15:16:47,987 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 69 transitions. [2022-04-14 15:16:47,987 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 15:16:47,987 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 15:16:47,988 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-14 15:16:47,988 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-14 15:16:47,988 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:47,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 69 transitions. [2022-04-14 15:16:47,990 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 69 transitions. Word has length 21 [2022-04-14 15:16:47,991 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-14 15:16:47,991 INFO L478 AbstractCegarLoop]: Abstraction has 51 states and 69 transitions. [2022-04-14 15:16:47,991 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:47,991 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 69 transitions. [2022-04-14 15:16:47,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-04-14 15:16:47,991 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 15:16:47,992 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:47,992 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-04-14 15:16:47,992 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 15:16:47,992 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 15:16:47,992 INFO L85 PathProgramCache]: Analyzing trace with hash -1701877900, now seen corresponding path program 1 times [2022-04-14 15:16:47,993 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 15:16:47,993 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [17350489] [2022-04-14 15:16:47,993 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 15:16:47,993 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 15:16:48,005 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-14 15:16:48,005 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [443480928] [2022-04-14 15:16:48,005 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 15:16:48,005 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-14 15:16:48,005 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-14 15:16:48,006 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:48,016 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:48,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 15:16:48,046 INFO L263 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-14 15:16:48,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 15:16:48,054 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-14 15:16:48,212 INFO L272 TraceCheckUtils]: 0: Hoare triple {1137#true} call ULTIMATE.init(); {1137#true} is VALID [2022-04-14 15:16:48,213 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:48,213 INFO L290 TraceCheckUtils]: 2: Hoare triple {1145#(<= ~counter~0 0)} assume true; {1145#(<= ~counter~0 0)} is VALID [2022-04-14 15:16:48,213 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:48,214 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:48,214 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:48,215 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:48,218 INFO L290 TraceCheckUtils]: 7: Hoare triple {1145#(<= ~counter~0 0)} ~cond := #in~cond; {1145#(<= ~counter~0 0)} is VALID [2022-04-14 15:16:48,218 INFO L290 TraceCheckUtils]: 8: Hoare triple {1145#(<= ~counter~0 0)} assume !(0 == ~cond); {1145#(<= ~counter~0 0)} is VALID [2022-04-14 15:16:48,219 INFO L290 TraceCheckUtils]: 9: Hoare triple {1145#(<= ~counter~0 0)} assume true; {1145#(<= ~counter~0 0)} is VALID [2022-04-14 15:16:48,219 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:48,220 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:48,221 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:48,221 INFO L290 TraceCheckUtils]: 13: Hoare triple {1179#(<= ~counter~0 1)} assume !!(#t~post5 < 5);havoc #t~post5; {1179#(<= ~counter~0 1)} is VALID [2022-04-14 15:16:48,221 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:48,222 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:48,222 INFO L290 TraceCheckUtils]: 16: Hoare triple {1189#(<= |main_#t~post5| 1)} assume !(#t~post5 < 5);havoc #t~post5; {1138#false} is VALID [2022-04-14 15:16:48,224 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:48,224 INFO L290 TraceCheckUtils]: 18: Hoare triple {1138#false} assume !(#t~post6 < 5);havoc #t~post6; {1138#false} is VALID [2022-04-14 15:16:48,225 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:48,226 INFO L290 TraceCheckUtils]: 20: Hoare triple {1138#false} ~cond := #in~cond; {1138#false} is VALID [2022-04-14 15:16:48,226 INFO L290 TraceCheckUtils]: 21: Hoare triple {1138#false} assume 0 == ~cond; {1138#false} is VALID [2022-04-14 15:16:48,238 INFO L290 TraceCheckUtils]: 22: Hoare triple {1138#false} assume !false; {1138#false} is VALID [2022-04-14 15:16:48,239 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:48,239 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-14 15:16:48,405 INFO L290 TraceCheckUtils]: 22: Hoare triple {1138#false} assume !false; {1138#false} is VALID [2022-04-14 15:16:48,405 INFO L290 TraceCheckUtils]: 21: Hoare triple {1138#false} assume 0 == ~cond; {1138#false} is VALID [2022-04-14 15:16:48,406 INFO L290 TraceCheckUtils]: 20: Hoare triple {1138#false} ~cond := #in~cond; {1138#false} is VALID [2022-04-14 15:16:48,406 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:48,406 INFO L290 TraceCheckUtils]: 18: Hoare triple {1138#false} assume !(#t~post6 < 5);havoc #t~post6; {1138#false} is VALID [2022-04-14 15:16:48,406 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:48,414 INFO L290 TraceCheckUtils]: 16: Hoare triple {1229#(< |main_#t~post5| 5)} assume !(#t~post5 < 5);havoc #t~post5; {1138#false} is VALID [2022-04-14 15:16:48,414 INFO L290 TraceCheckUtils]: 15: Hoare triple {1233#(< ~counter~0 5)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {1229#(< |main_#t~post5| 5)} is VALID [2022-04-14 15:16:48,415 INFO L290 TraceCheckUtils]: 14: Hoare triple {1233#(< ~counter~0 5)} assume !!(~q~0 % 4294967296 <= ~n~0 % 4294967296);~q~0 := 4 * ~q~0; {1233#(< ~counter~0 5)} is VALID [2022-04-14 15:16:48,415 INFO L290 TraceCheckUtils]: 13: Hoare triple {1233#(< ~counter~0 5)} assume !!(#t~post5 < 5);havoc #t~post5; {1233#(< ~counter~0 5)} is VALID [2022-04-14 15:16:48,415 INFO L290 TraceCheckUtils]: 12: Hoare triple {1243#(< ~counter~0 4)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {1233#(< ~counter~0 5)} is VALID [2022-04-14 15:16:48,416 INFO L290 TraceCheckUtils]: 11: Hoare triple {1243#(< ~counter~0 4)} ~p~0 := 0;~q~0 := 1;~r~0 := ~n~0;~h~0 := 0; {1243#(< ~counter~0 4)} is VALID [2022-04-14 15:16:48,416 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1137#true} {1243#(< ~counter~0 4)} #82#return; {1243#(< ~counter~0 4)} is VALID [2022-04-14 15:16:48,416 INFO L290 TraceCheckUtils]: 9: Hoare triple {1137#true} assume true; {1137#true} is VALID [2022-04-14 15:16:48,417 INFO L290 TraceCheckUtils]: 8: Hoare triple {1137#true} assume !(0 == ~cond); {1137#true} is VALID [2022-04-14 15:16:48,417 INFO L290 TraceCheckUtils]: 7: Hoare triple {1137#true} ~cond := #in~cond; {1137#true} is VALID [2022-04-14 15:16:48,417 INFO L272 TraceCheckUtils]: 6: Hoare triple {1243#(< ~counter~0 4)} call assume_abort_if_not((if ~n~0 % 4294967296 < 1073741823 then 1 else 0)); {1137#true} is VALID [2022-04-14 15:16:48,417 INFO L290 TraceCheckUtils]: 5: Hoare triple {1243#(< ~counter~0 4)} 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 4)} is VALID [2022-04-14 15:16:48,417 INFO L272 TraceCheckUtils]: 4: Hoare triple {1243#(< ~counter~0 4)} call #t~ret7 := main(); {1243#(< ~counter~0 4)} is VALID [2022-04-14 15:16:48,418 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1243#(< ~counter~0 4)} {1137#true} #102#return; {1243#(< ~counter~0 4)} is VALID [2022-04-14 15:16:48,418 INFO L290 TraceCheckUtils]: 2: Hoare triple {1243#(< ~counter~0 4)} assume true; {1243#(< ~counter~0 4)} is VALID [2022-04-14 15:16:48,419 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 4)} is VALID [2022-04-14 15:16:48,419 INFO L272 TraceCheckUtils]: 0: Hoare triple {1137#true} call ULTIMATE.init(); {1137#true} is VALID [2022-04-14 15:16:48,419 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:48,419 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 15:16:48,419 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [17350489] [2022-04-14 15:16:48,419 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-14 15:16:48,419 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [443480928] [2022-04-14 15:16:48,419 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [443480928] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-14 15:16:48,419 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-14 15:16:48,420 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2022-04-14 15:16:48,420 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1595383326] [2022-04-14 15:16:48,420 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-14 15:16:48,420 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:48,421 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 15:16:48,421 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:48,445 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:48,445 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-14 15:16:48,446 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 15:16:48,446 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-14 15:16:48,446 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2022-04-14 15:16:48,446 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:50,754 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:03,273 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:07,370 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.67s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-14 15:17:16,265 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:16,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 15:17:16,713 INFO L93 Difference]: Finished difference Result 108 states and 149 transitions. [2022-04-14 15:17:16,713 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-04-14 15:17:16,713 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:16,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-14 15:17:16,714 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:16,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 135 transitions. [2022-04-14 15:17:16,717 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:16,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 135 transitions. [2022-04-14 15:17:16,720 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 10 states and 135 transitions. [2022-04-14 15:17:16,839 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 135 edges. 135 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 15:17:16,842 INFO L225 Difference]: With dead ends: 108 [2022-04-14 15:17:16,842 INFO L226 Difference]: Without dead ends: 89 [2022-04-14 15:17:16,842 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:16,843 INFO L913 BasicCegarLoop]: 57 mSDtfsCounter, 62 mSDsluCounter, 187 mSDsCounter, 0 mSdLazyCounter, 76 mSolverCounterSat, 22 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 244 SdHoareTripleChecker+Invalid, 101 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 76 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9.3s IncrementalHoareTripleChecker+Time [2022-04-14 15:17:16,843 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [62 Valid, 244 Invalid, 101 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 76 Invalid, 3 Unknown, 0 Unchecked, 9.3s Time] [2022-04-14 15:17:16,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2022-04-14 15:17:16,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 67. [2022-04-14 15:17:16,867 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-14 15:17:16,867 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:16,867 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:16,868 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:16,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 15:17:16,872 INFO L93 Difference]: Finished difference Result 89 states and 117 transitions. [2022-04-14 15:17:16,872 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 117 transitions. [2022-04-14 15:17:16,873 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 15:17:16,873 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 15:17:16,874 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:16,874 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:16,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 15:17:16,879 INFO L93 Difference]: Finished difference Result 89 states and 117 transitions. [2022-04-14 15:17:16,879 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 117 transitions. [2022-04-14 15:17:16,879 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 15:17:16,879 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 15:17:16,880 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-14 15:17:16,880 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-14 15:17:16,880 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:16,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 86 transitions. [2022-04-14 15:17:16,883 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 86 transitions. Word has length 23 [2022-04-14 15:17:16,883 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-14 15:17:16,883 INFO L478 AbstractCegarLoop]: Abstraction has 67 states and 86 transitions. [2022-04-14 15:17:16,884 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:16,884 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 86 transitions. [2022-04-14 15:17:16,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-04-14 15:17:16,884 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 15:17:16,884 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:16,911 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:17,103 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:17,104 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 15:17:17,104 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 15:17:17,104 INFO L85 PathProgramCache]: Analyzing trace with hash -1564262277, now seen corresponding path program 1 times [2022-04-14 15:17:17,104 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 15:17:17,104 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [18719655] [2022-04-14 15:17:17,104 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 15:17:17,105 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 15:17:17,117 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-14 15:17:17,118 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [151009525] [2022-04-14 15:17:17,118 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 15:17:17,118 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-14 15:17:17,118 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-14 15:17:17,127 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:17,131 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:17,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 15:17:17,164 INFO L263 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-14 15:17:17,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 15:17:17,174 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-14 15:17:17,330 INFO L272 TraceCheckUtils]: 0: Hoare triple {1723#true} call ULTIMATE.init(); {1723#true} is VALID [2022-04-14 15:17:17,331 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:17,331 INFO L290 TraceCheckUtils]: 2: Hoare triple {1731#(<= ~counter~0 0)} assume true; {1731#(<= ~counter~0 0)} is VALID [2022-04-14 15:17:17,331 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:17,332 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:17,332 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:17,333 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:17,333 INFO L290 TraceCheckUtils]: 7: Hoare triple {1731#(<= ~counter~0 0)} ~cond := #in~cond; {1731#(<= ~counter~0 0)} is VALID [2022-04-14 15:17:17,333 INFO L290 TraceCheckUtils]: 8: Hoare triple {1731#(<= ~counter~0 0)} assume !(0 == ~cond); {1731#(<= ~counter~0 0)} is VALID [2022-04-14 15:17:17,334 INFO L290 TraceCheckUtils]: 9: Hoare triple {1731#(<= ~counter~0 0)} assume true; {1731#(<= ~counter~0 0)} is VALID [2022-04-14 15:17:17,334 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:17,335 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:17,335 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:17,335 INFO L290 TraceCheckUtils]: 13: Hoare triple {1765#(<= ~counter~0 1)} assume !!(#t~post5 < 5);havoc #t~post5; {1765#(<= ~counter~0 1)} is VALID [2022-04-14 15:17:17,336 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:17,336 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:17,336 INFO L290 TraceCheckUtils]: 16: Hoare triple {1775#(<= ~counter~0 2)} assume !!(#t~post5 < 5);havoc #t~post5; {1775#(<= ~counter~0 2)} is VALID [2022-04-14 15:17:17,337 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:17,337 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:17,338 INFO L290 TraceCheckUtils]: 19: Hoare triple {1785#(<= |main_#t~post6| 2)} assume !(#t~post6 < 5);havoc #t~post6; {1724#false} is VALID [2022-04-14 15:17:17,338 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:17,338 INFO L290 TraceCheckUtils]: 21: Hoare triple {1724#false} ~cond := #in~cond; {1724#false} is VALID [2022-04-14 15:17:17,338 INFO L290 TraceCheckUtils]: 22: Hoare triple {1724#false} assume 0 == ~cond; {1724#false} is VALID [2022-04-14 15:17:17,338 INFO L290 TraceCheckUtils]: 23: Hoare triple {1724#false} assume !false; {1724#false} is VALID [2022-04-14 15:17:17,338 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:17,338 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-14 15:17:17,529 INFO L290 TraceCheckUtils]: 23: Hoare triple {1724#false} assume !false; {1724#false} is VALID [2022-04-14 15:17:17,529 INFO L290 TraceCheckUtils]: 22: Hoare triple {1724#false} assume 0 == ~cond; {1724#false} is VALID [2022-04-14 15:17:17,529 INFO L290 TraceCheckUtils]: 21: Hoare triple {1724#false} ~cond := #in~cond; {1724#false} is VALID [2022-04-14 15:17:17,529 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:17,530 INFO L290 TraceCheckUtils]: 19: Hoare triple {1813#(< |main_#t~post6| 5)} assume !(#t~post6 < 5);havoc #t~post6; {1724#false} is VALID [2022-04-14 15:17:17,530 INFO L290 TraceCheckUtils]: 18: Hoare triple {1817#(< ~counter~0 5)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {1813#(< |main_#t~post6| 5)} is VALID [2022-04-14 15:17:17,530 INFO L290 TraceCheckUtils]: 17: Hoare triple {1817#(< ~counter~0 5)} assume !(~q~0 % 4294967296 <= ~n~0 % 4294967296); {1817#(< ~counter~0 5)} is VALID [2022-04-14 15:17:17,531 INFO L290 TraceCheckUtils]: 16: Hoare triple {1817#(< ~counter~0 5)} assume !!(#t~post5 < 5);havoc #t~post5; {1817#(< ~counter~0 5)} is VALID [2022-04-14 15:17:17,531 INFO L290 TraceCheckUtils]: 15: Hoare triple {1827#(< ~counter~0 4)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {1817#(< ~counter~0 5)} is VALID [2022-04-14 15:17:17,531 INFO L290 TraceCheckUtils]: 14: Hoare triple {1827#(< ~counter~0 4)} assume !!(~q~0 % 4294967296 <= ~n~0 % 4294967296);~q~0 := 4 * ~q~0; {1827#(< ~counter~0 4)} is VALID [2022-04-14 15:17:17,532 INFO L290 TraceCheckUtils]: 13: Hoare triple {1827#(< ~counter~0 4)} assume !!(#t~post5 < 5);havoc #t~post5; {1827#(< ~counter~0 4)} is VALID [2022-04-14 15:17:17,532 INFO L290 TraceCheckUtils]: 12: Hoare triple {1775#(<= ~counter~0 2)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {1827#(< ~counter~0 4)} is VALID [2022-04-14 15:17:17,532 INFO L290 TraceCheckUtils]: 11: Hoare triple {1775#(<= ~counter~0 2)} ~p~0 := 0;~q~0 := 1;~r~0 := ~n~0;~h~0 := 0; {1775#(<= ~counter~0 2)} is VALID [2022-04-14 15:17:17,534 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1723#true} {1775#(<= ~counter~0 2)} #82#return; {1775#(<= ~counter~0 2)} is VALID [2022-04-14 15:17:17,534 INFO L290 TraceCheckUtils]: 9: Hoare triple {1723#true} assume true; {1723#true} is VALID [2022-04-14 15:17:17,534 INFO L290 TraceCheckUtils]: 8: Hoare triple {1723#true} assume !(0 == ~cond); {1723#true} is VALID [2022-04-14 15:17:17,534 INFO L290 TraceCheckUtils]: 7: Hoare triple {1723#true} ~cond := #in~cond; {1723#true} is VALID [2022-04-14 15:17:17,534 INFO L272 TraceCheckUtils]: 6: Hoare triple {1775#(<= ~counter~0 2)} call assume_abort_if_not((if ~n~0 % 4294967296 < 1073741823 then 1 else 0)); {1723#true} is VALID [2022-04-14 15:17:17,534 INFO L290 TraceCheckUtils]: 5: Hoare triple {1775#(<= ~counter~0 2)} havoc ~n~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~h~0;~n~0 := #t~nondet4;havoc #t~nondet4; {1775#(<= ~counter~0 2)} is VALID [2022-04-14 15:17:17,535 INFO L272 TraceCheckUtils]: 4: Hoare triple {1775#(<= ~counter~0 2)} call #t~ret7 := main(); {1775#(<= ~counter~0 2)} is VALID [2022-04-14 15:17:17,535 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1775#(<= ~counter~0 2)} {1723#true} #102#return; {1775#(<= ~counter~0 2)} is VALID [2022-04-14 15:17:17,535 INFO L290 TraceCheckUtils]: 2: Hoare triple {1775#(<= ~counter~0 2)} assume true; {1775#(<= ~counter~0 2)} is VALID [2022-04-14 15:17:17,536 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; {1775#(<= ~counter~0 2)} is VALID [2022-04-14 15:17:17,536 INFO L272 TraceCheckUtils]: 0: Hoare triple {1723#true} call ULTIMATE.init(); {1723#true} is VALID [2022-04-14 15:17:17,536 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:17,536 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 15:17:17,536 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [18719655] [2022-04-14 15:17:17,536 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-14 15:17:17,536 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [151009525] [2022-04-14 15:17:17,537 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [151009525] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-14 15:17:17,537 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-14 15:17:17,537 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 9 [2022-04-14 15:17:17,537 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1281094268] [2022-04-14 15:17:17,537 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-14 15:17:17,538 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.6666666666666665) internal successors, (33), 9 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:17,538 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 15:17:17,538 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 9 states, 9 states have (on average 3.6666666666666665) internal successors, (33), 9 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:17,573 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:17,573 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-14 15:17:17,573 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 15:17:17,574 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-14 15:17:17,574 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2022-04-14 15:17:17,574 INFO L87 Difference]: Start difference. First operand 67 states and 86 transitions. Second operand has 9 states, 9 states have (on average 3.6666666666666665) internal successors, (33), 9 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:44,138 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.37s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-14 15:17:46,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 15:17:46,301 INFO L93 Difference]: Finished difference Result 118 states and 154 transitions. [2022-04-14 15:17:46,301 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-04-14 15:17:46,301 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.6666666666666665) internal successors, (33), 9 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:46,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-14 15:17:46,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 3.6666666666666665) internal successors, (33), 9 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:46,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 144 transitions. [2022-04-14 15:17:46,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 3.6666666666666665) internal successors, (33), 9 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:46,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 144 transitions. [2022-04-14 15:17:46,309 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 11 states and 144 transitions. [2022-04-14 15:17:46,461 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:17:46,464 INFO L225 Difference]: With dead ends: 118 [2022-04-14 15:17:46,464 INFO L226 Difference]: Without dead ends: 107 [2022-04-14 15:17:46,465 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 39 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2022-04-14 15:17:46,465 INFO L913 BasicCegarLoop]: 67 mSDtfsCounter, 85 mSDsluCounter, 220 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 31 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 287 SdHoareTripleChecker+Invalid, 105 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 73 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.7s IncrementalHoareTripleChecker+Time [2022-04-14 15:17:46,466 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [85 Valid, 287 Invalid, 105 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 73 Invalid, 1 Unknown, 0 Unchecked, 6.7s Time] [2022-04-14 15:17:46,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2022-04-14 15:17:46,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 100. [2022-04-14 15:17:46,517 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-14 15:17:46,517 INFO L82 GeneralOperation]: Start isEquivalent. First operand 107 states. Second operand has 100 states, 58 states have (on average 1.2586206896551724) internal successors, (73), 61 states have internal predecessors, (73), 33 states have call successors, (33), 10 states have call predecessors, (33), 8 states have return successors, (29), 28 states have call predecessors, (29), 29 states have call successors, (29) [2022-04-14 15:17:46,518 INFO L74 IsIncluded]: Start isIncluded. First operand 107 states. Second operand has 100 states, 58 states have (on average 1.2586206896551724) internal successors, (73), 61 states have internal predecessors, (73), 33 states have call successors, (33), 10 states have call predecessors, (33), 8 states have return successors, (29), 28 states have call predecessors, (29), 29 states have call successors, (29) [2022-04-14 15:17:46,518 INFO L87 Difference]: Start difference. First operand 107 states. Second operand has 100 states, 58 states have (on average 1.2586206896551724) internal successors, (73), 61 states have internal predecessors, (73), 33 states have call successors, (33), 10 states have call predecessors, (33), 8 states have return successors, (29), 28 states have call predecessors, (29), 29 states have call successors, (29) [2022-04-14 15:17:46,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 15:17:46,523 INFO L93 Difference]: Finished difference Result 107 states and 139 transitions. [2022-04-14 15:17:46,523 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 139 transitions. [2022-04-14 15:17:46,524 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 15:17:46,524 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 15:17:46,524 INFO L74 IsIncluded]: Start isIncluded. First operand has 100 states, 58 states have (on average 1.2586206896551724) internal successors, (73), 61 states have internal predecessors, (73), 33 states have call successors, (33), 10 states have call predecessors, (33), 8 states have return successors, (29), 28 states have call predecessors, (29), 29 states have call successors, (29) Second operand 107 states. [2022-04-14 15:17:46,525 INFO L87 Difference]: Start difference. First operand has 100 states, 58 states have (on average 1.2586206896551724) internal successors, (73), 61 states have internal predecessors, (73), 33 states have call successors, (33), 10 states have call predecessors, (33), 8 states have return successors, (29), 28 states have call predecessors, (29), 29 states have call successors, (29) Second operand 107 states. [2022-04-14 15:17:46,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 15:17:46,530 INFO L93 Difference]: Finished difference Result 107 states and 139 transitions. [2022-04-14 15:17:46,530 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 139 transitions. [2022-04-14 15:17:46,530 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 15:17:46,530 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 15:17:46,530 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-14 15:17:46,531 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-14 15:17:46,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 58 states have (on average 1.2586206896551724) internal successors, (73), 61 states have internal predecessors, (73), 33 states have call successors, (33), 10 states have call predecessors, (33), 8 states have return successors, (29), 28 states have call predecessors, (29), 29 states have call successors, (29) [2022-04-14 15:17:46,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 135 transitions. [2022-04-14 15:17:46,535 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 135 transitions. Word has length 24 [2022-04-14 15:17:46,535 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-14 15:17:46,535 INFO L478 AbstractCegarLoop]: Abstraction has 100 states and 135 transitions. [2022-04-14 15:17:46,536 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.6666666666666665) internal successors, (33), 9 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:46,536 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 135 transitions. [2022-04-14 15:17:46,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-04-14 15:17:46,536 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 15:17:46,536 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:46,566 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:46,751 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:46,751 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 15:17:46,752 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 15:17:46,752 INFO L85 PathProgramCache]: Analyzing trace with hash -1562772727, now seen corresponding path program 1 times [2022-04-14 15:17:46,752 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 15:17:46,752 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2079190190] [2022-04-14 15:17:46,752 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 15:17:46,752 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 15:17:46,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 15:17:47,001 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-14 15:17:47,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 15:17:47,010 INFO L290 TraceCheckUtils]: 0: Hoare triple {2428#(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; {2414#true} is VALID [2022-04-14 15:17:47,010 INFO L290 TraceCheckUtils]: 1: Hoare triple {2414#true} assume true; {2414#true} is VALID [2022-04-14 15:17:47,010 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {2414#true} {2414#true} #102#return; {2414#true} is VALID [2022-04-14 15:17:47,010 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-14 15:17:47,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 15:17:47,015 INFO L290 TraceCheckUtils]: 0: Hoare triple {2414#true} ~cond := #in~cond; {2414#true} is VALID [2022-04-14 15:17:47,015 INFO L290 TraceCheckUtils]: 1: Hoare triple {2414#true} assume !(0 == ~cond); {2414#true} is VALID [2022-04-14 15:17:47,015 INFO L290 TraceCheckUtils]: 2: Hoare triple {2414#true} assume true; {2414#true} is VALID [2022-04-14 15:17:47,015 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2414#true} {2414#true} #82#return; {2414#true} is VALID [2022-04-14 15:17:47,016 INFO L272 TraceCheckUtils]: 0: Hoare triple {2414#true} call ULTIMATE.init(); {2428#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-14 15:17:47,016 INFO L290 TraceCheckUtils]: 1: Hoare triple {2428#(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; {2414#true} is VALID [2022-04-14 15:17:47,016 INFO L290 TraceCheckUtils]: 2: Hoare triple {2414#true} assume true; {2414#true} is VALID [2022-04-14 15:17:47,016 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2414#true} {2414#true} #102#return; {2414#true} is VALID [2022-04-14 15:17:47,017 INFO L272 TraceCheckUtils]: 4: Hoare triple {2414#true} call #t~ret7 := main(); {2414#true} is VALID [2022-04-14 15:17:47,017 INFO L290 TraceCheckUtils]: 5: Hoare triple {2414#true} havoc ~n~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~h~0;~n~0 := #t~nondet4;havoc #t~nondet4; {2414#true} is VALID [2022-04-14 15:17:47,017 INFO L272 TraceCheckUtils]: 6: Hoare triple {2414#true} call assume_abort_if_not((if ~n~0 % 4294967296 < 1073741823 then 1 else 0)); {2414#true} is VALID [2022-04-14 15:17:47,017 INFO L290 TraceCheckUtils]: 7: Hoare triple {2414#true} ~cond := #in~cond; {2414#true} is VALID [2022-04-14 15:17:47,017 INFO L290 TraceCheckUtils]: 8: Hoare triple {2414#true} assume !(0 == ~cond); {2414#true} is VALID [2022-04-14 15:17:47,017 INFO L290 TraceCheckUtils]: 9: Hoare triple {2414#true} assume true; {2414#true} is VALID [2022-04-14 15:17:47,017 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2414#true} {2414#true} #82#return; {2414#true} is VALID [2022-04-14 15:17:47,018 INFO L290 TraceCheckUtils]: 11: Hoare triple {2414#true} ~p~0 := 0;~q~0 := 1;~r~0 := ~n~0;~h~0 := 0; {2423#(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:47,018 INFO L290 TraceCheckUtils]: 12: Hoare triple {2423#(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; {2423#(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:47,019 INFO L290 TraceCheckUtils]: 13: Hoare triple {2423#(and (= main_~p~0 0) (= (+ (- 1) main_~q~0) 0) (= (+ main_~n~0 (* (- 1) main_~r~0)) 0))} assume !!(#t~post5 < 5);havoc #t~post5; {2423#(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:47,019 INFO L290 TraceCheckUtils]: 14: Hoare triple {2423#(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; {2424#(and (= main_~p~0 0) (= main_~n~0 main_~r~0))} is VALID [2022-04-14 15:17:47,020 INFO L290 TraceCheckUtils]: 15: Hoare triple {2424#(and (= main_~p~0 0) (= main_~n~0 main_~r~0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {2424#(and (= main_~p~0 0) (= main_~n~0 main_~r~0))} is VALID [2022-04-14 15:17:47,020 INFO L290 TraceCheckUtils]: 16: Hoare triple {2424#(and (= main_~p~0 0) (= main_~n~0 main_~r~0))} assume !!(#t~post5 < 5);havoc #t~post5; {2424#(and (= main_~p~0 0) (= main_~n~0 main_~r~0))} is VALID [2022-04-14 15:17:47,021 INFO L290 TraceCheckUtils]: 17: Hoare triple {2424#(and (= main_~p~0 0) (= main_~n~0 main_~r~0))} assume !(~q~0 % 4294967296 <= ~n~0 % 4294967296); {2425#(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:47,022 INFO L290 TraceCheckUtils]: 18: Hoare triple {2425#(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; {2425#(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:47,022 INFO L290 TraceCheckUtils]: 19: Hoare triple {2425#(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 < 5);havoc #t~post6; {2425#(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:47,023 INFO L272 TraceCheckUtils]: 20: Hoare triple {2425#(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)); {2426#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-14 15:17:47,024 INFO L290 TraceCheckUtils]: 21: Hoare triple {2426#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {2427#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-14 15:17:47,024 INFO L290 TraceCheckUtils]: 22: Hoare triple {2427#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {2415#false} is VALID [2022-04-14 15:17:47,024 INFO L290 TraceCheckUtils]: 23: Hoare triple {2415#false} assume !false; {2415#false} is VALID [2022-04-14 15:17:47,025 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:47,025 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 15:17:47,025 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2079190190] [2022-04-14 15:17:47,025 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2079190190] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-14 15:17:47,025 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1503239151] [2022-04-14 15:17:47,025 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 15:17:47,025 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-14 15:17:47,025 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-14 15:17:47,026 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:47,061 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:47,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 15:17:47,083 INFO L263 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 12 conjunts are in the unsatisfiable core [2022-04-14 15:17:47,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 15:17:47,092 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-14 15:17:47,417 INFO L272 TraceCheckUtils]: 0: Hoare triple {2414#true} call ULTIMATE.init(); {2414#true} is VALID [2022-04-14 15:17:47,418 INFO L290 TraceCheckUtils]: 1: Hoare triple {2414#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; {2414#true} is VALID [2022-04-14 15:17:47,418 INFO L290 TraceCheckUtils]: 2: Hoare triple {2414#true} assume true; {2414#true} is VALID [2022-04-14 15:17:47,418 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2414#true} {2414#true} #102#return; {2414#true} is VALID [2022-04-14 15:17:47,418 INFO L272 TraceCheckUtils]: 4: Hoare triple {2414#true} call #t~ret7 := main(); {2414#true} is VALID [2022-04-14 15:17:47,418 INFO L290 TraceCheckUtils]: 5: Hoare triple {2414#true} havoc ~n~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~h~0;~n~0 := #t~nondet4;havoc #t~nondet4; {2414#true} is VALID [2022-04-14 15:17:47,418 INFO L272 TraceCheckUtils]: 6: Hoare triple {2414#true} call assume_abort_if_not((if ~n~0 % 4294967296 < 1073741823 then 1 else 0)); {2414#true} is VALID [2022-04-14 15:17:47,418 INFO L290 TraceCheckUtils]: 7: Hoare triple {2414#true} ~cond := #in~cond; {2414#true} is VALID [2022-04-14 15:17:47,419 INFO L290 TraceCheckUtils]: 8: Hoare triple {2414#true} assume !(0 == ~cond); {2414#true} is VALID [2022-04-14 15:17:47,419 INFO L290 TraceCheckUtils]: 9: Hoare triple {2414#true} assume true; {2414#true} is VALID [2022-04-14 15:17:47,419 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2414#true} {2414#true} #82#return; {2414#true} is VALID [2022-04-14 15:17:47,420 INFO L290 TraceCheckUtils]: 11: Hoare triple {2414#true} ~p~0 := 0;~q~0 := 1;~r~0 := ~n~0;~h~0 := 0; {2423#(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:47,420 INFO L290 TraceCheckUtils]: 12: Hoare triple {2423#(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; {2423#(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:47,421 INFO L290 TraceCheckUtils]: 13: Hoare triple {2423#(and (= main_~p~0 0) (= (+ (- 1) main_~q~0) 0) (= (+ main_~n~0 (* (- 1) main_~r~0)) 0))} assume !!(#t~post5 < 5);havoc #t~post5; {2423#(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:47,421 INFO L290 TraceCheckUtils]: 14: Hoare triple {2423#(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; {2474#(and (= main_~p~0 0) (= main_~q~0 4) (= (+ main_~n~0 (* (- 1) main_~r~0)) 0))} is VALID [2022-04-14 15:17:47,423 INFO L290 TraceCheckUtils]: 15: Hoare triple {2474#(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; {2474#(and (= main_~p~0 0) (= main_~q~0 4) (= (+ main_~n~0 (* (- 1) main_~r~0)) 0))} is VALID [2022-04-14 15:17:47,423 INFO L290 TraceCheckUtils]: 16: Hoare triple {2474#(and (= main_~p~0 0) (= main_~q~0 4) (= (+ main_~n~0 (* (- 1) main_~r~0)) 0))} assume !!(#t~post5 < 5);havoc #t~post5; {2474#(and (= main_~p~0 0) (= main_~q~0 4) (= (+ main_~n~0 (* (- 1) main_~r~0)) 0))} is VALID [2022-04-14 15:17:47,424 INFO L290 TraceCheckUtils]: 17: Hoare triple {2474#(and (= main_~p~0 0) (= main_~q~0 4) (= (+ main_~n~0 (* (- 1) main_~r~0)) 0))} assume !(~q~0 % 4294967296 <= ~n~0 % 4294967296); {2484#(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:47,425 INFO L290 TraceCheckUtils]: 18: Hoare triple {2484#(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; {2484#(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:47,425 INFO L290 TraceCheckUtils]: 19: Hoare triple {2484#(and (not (<= (mod main_~q~0 4294967296) (mod main_~r~0 4294967296))) (= main_~p~0 0) (= main_~q~0 4))} assume !!(#t~post6 < 5);havoc #t~post6; {2484#(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:47,426 INFO L272 TraceCheckUtils]: 20: Hoare triple {2484#(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)); {2494#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-14 15:17:47,427 INFO L290 TraceCheckUtils]: 21: Hoare triple {2494#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {2498#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-14 15:17:47,433 INFO L290 TraceCheckUtils]: 22: Hoare triple {2498#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2415#false} is VALID [2022-04-14 15:17:47,433 INFO L290 TraceCheckUtils]: 23: Hoare triple {2415#false} assume !false; {2415#false} is VALID [2022-04-14 15:17:47,434 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:47,434 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-14 15:17:47,715 INFO L290 TraceCheckUtils]: 23: Hoare triple {2415#false} assume !false; {2415#false} is VALID [2022-04-14 15:17:47,717 INFO L290 TraceCheckUtils]: 22: Hoare triple {2498#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2415#false} is VALID [2022-04-14 15:17:47,719 INFO L290 TraceCheckUtils]: 21: Hoare triple {2494#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {2498#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-14 15:17:47,720 INFO L272 TraceCheckUtils]: 20: Hoare triple {2514#(< (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)); {2494#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-14 15:17:47,720 INFO L290 TraceCheckUtils]: 19: Hoare triple {2514#(< (mod main_~r~0 4294967296) (mod (+ (* main_~p~0 2) main_~q~0) 4294967296))} assume !!(#t~post6 < 5);havoc #t~post6; {2514#(< (mod main_~r~0 4294967296) (mod (+ (* main_~p~0 2) main_~q~0) 4294967296))} is VALID [2022-04-14 15:17:47,721 INFO L290 TraceCheckUtils]: 18: Hoare triple {2514#(< (mod main_~r~0 4294967296) (mod (+ (* main_~p~0 2) main_~q~0) 4294967296))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {2514#(< (mod main_~r~0 4294967296) (mod (+ (* main_~p~0 2) main_~q~0) 4294967296))} is VALID [2022-04-14 15:17:47,722 INFO L290 TraceCheckUtils]: 17: Hoare triple {2524#(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); {2514#(< (mod main_~r~0 4294967296) (mod (+ (* main_~p~0 2) main_~q~0) 4294967296))} is VALID [2022-04-14 15:17:47,723 INFO L290 TraceCheckUtils]: 16: Hoare triple {2524#(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 < 5);havoc #t~post5; {2524#(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:47,724 INFO L290 TraceCheckUtils]: 15: Hoare triple {2524#(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; {2524#(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:47,737 INFO L290 TraceCheckUtils]: 14: Hoare triple {2534#(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; {2524#(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:47,737 INFO L290 TraceCheckUtils]: 13: Hoare triple {2534#(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 < 5);havoc #t~post5; {2534#(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:47,741 INFO L290 TraceCheckUtils]: 12: Hoare triple {2534#(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; {2534#(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:47,744 INFO L290 TraceCheckUtils]: 11: Hoare triple {2414#true} ~p~0 := 0;~q~0 := 1;~r~0 := ~n~0;~h~0 := 0; {2534#(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:47,744 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2414#true} {2414#true} #82#return; {2414#true} is VALID [2022-04-14 15:17:47,744 INFO L290 TraceCheckUtils]: 9: Hoare triple {2414#true} assume true; {2414#true} is VALID [2022-04-14 15:17:47,744 INFO L290 TraceCheckUtils]: 8: Hoare triple {2414#true} assume !(0 == ~cond); {2414#true} is VALID [2022-04-14 15:17:47,744 INFO L290 TraceCheckUtils]: 7: Hoare triple {2414#true} ~cond := #in~cond; {2414#true} is VALID [2022-04-14 15:17:47,744 INFO L272 TraceCheckUtils]: 6: Hoare triple {2414#true} call assume_abort_if_not((if ~n~0 % 4294967296 < 1073741823 then 1 else 0)); {2414#true} is VALID [2022-04-14 15:17:47,745 INFO L290 TraceCheckUtils]: 5: Hoare triple {2414#true} havoc ~n~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~h~0;~n~0 := #t~nondet4;havoc #t~nondet4; {2414#true} is VALID [2022-04-14 15:17:47,745 INFO L272 TraceCheckUtils]: 4: Hoare triple {2414#true} call #t~ret7 := main(); {2414#true} is VALID [2022-04-14 15:17:47,745 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2414#true} {2414#true} #102#return; {2414#true} is VALID [2022-04-14 15:17:47,745 INFO L290 TraceCheckUtils]: 2: Hoare triple {2414#true} assume true; {2414#true} is VALID [2022-04-14 15:17:47,745 INFO L290 TraceCheckUtils]: 1: Hoare triple {2414#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; {2414#true} is VALID [2022-04-14 15:17:47,745 INFO L272 TraceCheckUtils]: 0: Hoare triple {2414#true} call ULTIMATE.init(); {2414#true} is VALID [2022-04-14 15:17:47,745 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:47,746 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1503239151] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-14 15:17:47,746 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-14 15:17:47,746 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 15 [2022-04-14 15:17:47,746 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1322090119] [2022-04-14 15:17:47,746 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-14 15:17:47,747 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:47,747 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 15:17:47,747 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:47,812 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:47,812 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-04-14 15:17:47,812 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 15:17:47,813 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-04-14 15:17:47,813 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=166, Unknown=0, NotChecked=0, Total=210 [2022-04-14 15:17:47,813 INFO L87 Difference]: Start difference. First operand 100 states and 135 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:52,795 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:54,847 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:56,863 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:58,865 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,922 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:02,929 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:05,033 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:10,852 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,854 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:14,856 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-14 15:18:17,120 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,561 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:22,905 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:24,658 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.38s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-14 15:18:26,452 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.22s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-14 15:18:28,519 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.05s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-14 15:18:33,683 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:35,869 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:39,829 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.20s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-14 15:18:44,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 15:18:44,409 INFO L93 Difference]: Finished difference Result 149 states and 208 transitions. [2022-04-14 15:18:44,409 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-04-14 15:18:44,409 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:44,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-14 15:18:44,410 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:44,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 144 transitions. [2022-04-14 15:18:44,414 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:44,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 144 transitions. [2022-04-14 15:18:44,417 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 13 states and 144 transitions. [2022-04-14 15:18:45,177 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:45,182 INFO L225 Difference]: With dead ends: 149 [2022-04-14 15:18:45,183 INFO L226 Difference]: Without dead ends: 136 [2022-04-14 15:18:45,183 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 43 SyntacticMatches, 2 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=95, Invalid=367, Unknown=0, NotChecked=0, Total=462 [2022-04-14 15:18:45,184 INFO L913 BasicCegarLoop]: 60 mSDtfsCounter, 54 mSDsluCounter, 89 mSDsCounter, 0 mSdLazyCounter, 449 mSolverCounterSat, 151 mSolverCounterUnsat, 16 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 46.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 149 SdHoareTripleChecker+Invalid, 616 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 151 IncrementalHoareTripleChecker+Valid, 449 IncrementalHoareTripleChecker+Invalid, 16 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 46.3s IncrementalHoareTripleChecker+Time [2022-04-14 15:18:45,185 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [63 Valid, 149 Invalid, 616 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [151 Valid, 449 Invalid, 16 Unknown, 0 Unchecked, 46.3s Time] [2022-04-14 15:18:45,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2022-04-14 15:18:45,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 129. [2022-04-14 15:18:45,253 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-14 15:18:45,253 INFO L82 GeneralOperation]: Start isEquivalent. First operand 136 states. Second operand has 129 states, 74 states have (on average 1.2297297297297298) internal successors, (91), 79 states have internal predecessors, (91), 43 states have call successors, (43), 13 states have call predecessors, (43), 11 states have return successors, (39), 36 states have call predecessors, (39), 39 states have call successors, (39) [2022-04-14 15:18:45,254 INFO L74 IsIncluded]: Start isIncluded. First operand 136 states. Second operand has 129 states, 74 states have (on average 1.2297297297297298) internal successors, (91), 79 states have internal predecessors, (91), 43 states have call successors, (43), 13 states have call predecessors, (43), 11 states have return successors, (39), 36 states have call predecessors, (39), 39 states have call successors, (39) [2022-04-14 15:18:45,254 INFO L87 Difference]: Start difference. First operand 136 states. Second operand has 129 states, 74 states have (on average 1.2297297297297298) internal successors, (91), 79 states have internal predecessors, (91), 43 states have call successors, (43), 13 states have call predecessors, (43), 11 states have return successors, (39), 36 states have call predecessors, (39), 39 states have call successors, (39) [2022-04-14 15:18:45,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 15:18:45,260 INFO L93 Difference]: Finished difference Result 136 states and 186 transitions. [2022-04-14 15:18:45,260 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 186 transitions. [2022-04-14 15:18:45,260 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 15:18:45,261 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 15:18:45,261 INFO L74 IsIncluded]: Start isIncluded. First operand has 129 states, 74 states have (on average 1.2297297297297298) internal successors, (91), 79 states have internal predecessors, (91), 43 states have call successors, (43), 13 states have call predecessors, (43), 11 states have return successors, (39), 36 states have call predecessors, (39), 39 states have call successors, (39) Second operand 136 states. [2022-04-14 15:18:45,262 INFO L87 Difference]: Start difference. First operand has 129 states, 74 states have (on average 1.2297297297297298) internal successors, (91), 79 states have internal predecessors, (91), 43 states have call successors, (43), 13 states have call predecessors, (43), 11 states have return successors, (39), 36 states have call predecessors, (39), 39 states have call successors, (39) Second operand 136 states. [2022-04-14 15:18:45,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 15:18:45,267 INFO L93 Difference]: Finished difference Result 136 states and 186 transitions. [2022-04-14 15:18:45,267 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 186 transitions. [2022-04-14 15:18:45,268 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 15:18:45,268 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 15:18:45,268 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-14 15:18:45,268 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-14 15:18:45,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 129 states, 74 states have (on average 1.2297297297297298) internal successors, (91), 79 states have internal predecessors, (91), 43 states have call successors, (43), 13 states have call predecessors, (43), 11 states have return successors, (39), 36 states have call predecessors, (39), 39 states have call successors, (39) [2022-04-14 15:18:45,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 173 transitions. [2022-04-14 15:18:45,274 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 173 transitions. Word has length 24 [2022-04-14 15:18:45,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-14 15:18:45,274 INFO L478 AbstractCegarLoop]: Abstraction has 129 states and 173 transitions. [2022-04-14 15:18:45,274 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:45,274 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 173 transitions. [2022-04-14 15:18:45,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-04-14 15:18:45,275 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 15:18:45,275 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:45,302 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-04-14 15:18:45,491 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:45,492 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 15:18:45,492 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 15:18:45,492 INFO L85 PathProgramCache]: Analyzing trace with hash -45171523, now seen corresponding path program 1 times [2022-04-14 15:18:45,492 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 15:18:45,492 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [242861730] [2022-04-14 15:18:45,492 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 15:18:45,492 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 15:18:45,504 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-14 15:18:45,505 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1448460962] [2022-04-14 15:18:45,505 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 15:18:45,505 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-14 15:18:45,505 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-14 15:18:45,513 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:45,514 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:45,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 15:18:45,644 INFO L263 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-14 15:18:45,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 15:18:45,660 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-14 15:18:45,863 INFO L272 TraceCheckUtils]: 0: Hoare triple {3279#true} call ULTIMATE.init(); {3279#true} is VALID [2022-04-14 15:18:45,864 INFO L290 TraceCheckUtils]: 1: Hoare triple {3279#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; {3279#true} is VALID [2022-04-14 15:18:45,864 INFO L290 TraceCheckUtils]: 2: Hoare triple {3279#true} assume true; {3279#true} is VALID [2022-04-14 15:18:45,864 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3279#true} {3279#true} #102#return; {3279#true} is VALID [2022-04-14 15:18:45,864 INFO L272 TraceCheckUtils]: 4: Hoare triple {3279#true} call #t~ret7 := main(); {3279#true} is VALID [2022-04-14 15:18:45,864 INFO L290 TraceCheckUtils]: 5: Hoare triple {3279#true} havoc ~n~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~h~0;~n~0 := #t~nondet4;havoc #t~nondet4; {3279#true} is VALID [2022-04-14 15:18:45,864 INFO L272 TraceCheckUtils]: 6: Hoare triple {3279#true} call assume_abort_if_not((if ~n~0 % 4294967296 < 1073741823 then 1 else 0)); {3279#true} is VALID [2022-04-14 15:18:45,864 INFO L290 TraceCheckUtils]: 7: Hoare triple {3279#true} ~cond := #in~cond; {3279#true} is VALID [2022-04-14 15:18:45,864 INFO L290 TraceCheckUtils]: 8: Hoare triple {3279#true} assume !(0 == ~cond); {3279#true} is VALID [2022-04-14 15:18:45,864 INFO L290 TraceCheckUtils]: 9: Hoare triple {3279#true} assume true; {3279#true} is VALID [2022-04-14 15:18:45,864 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {3279#true} {3279#true} #82#return; {3279#true} is VALID [2022-04-14 15:18:45,865 INFO L290 TraceCheckUtils]: 11: Hoare triple {3279#true} ~p~0 := 0;~q~0 := 1;~r~0 := ~n~0;~h~0 := 0; {3317#(and (= main_~p~0 0) (= main_~h~0 0) (= main_~q~0 1))} is VALID [2022-04-14 15:18:45,866 INFO L290 TraceCheckUtils]: 12: Hoare triple {3317#(and (= main_~p~0 0) (= main_~h~0 0) (= main_~q~0 1))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {3317#(and (= main_~p~0 0) (= main_~h~0 0) (= main_~q~0 1))} is VALID [2022-04-14 15:18:45,866 INFO L290 TraceCheckUtils]: 13: Hoare triple {3317#(and (= main_~p~0 0) (= main_~h~0 0) (= main_~q~0 1))} assume !!(#t~post5 < 5);havoc #t~post5; {3317#(and (= main_~p~0 0) (= main_~h~0 0) (= main_~q~0 1))} is VALID [2022-04-14 15:18:45,867 INFO L290 TraceCheckUtils]: 14: Hoare triple {3317#(and (= main_~p~0 0) (= main_~h~0 0) (= main_~q~0 1))} assume !(~q~0 % 4294967296 <= ~n~0 % 4294967296); {3317#(and (= main_~p~0 0) (= main_~h~0 0) (= main_~q~0 1))} is VALID [2022-04-14 15:18:45,867 INFO L290 TraceCheckUtils]: 15: Hoare triple {3317#(and (= main_~p~0 0) (= main_~h~0 0) (= main_~q~0 1))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {3317#(and (= main_~p~0 0) (= main_~h~0 0) (= main_~q~0 1))} is VALID [2022-04-14 15:18:45,868 INFO L290 TraceCheckUtils]: 16: Hoare triple {3317#(and (= main_~p~0 0) (= main_~h~0 0) (= main_~q~0 1))} assume !!(#t~post6 < 5);havoc #t~post6; {3317#(and (= main_~p~0 0) (= main_~h~0 0) (= main_~q~0 1))} is VALID [2022-04-14 15:18:45,868 INFO L272 TraceCheckUtils]: 17: Hoare triple {3317#(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)); {3279#true} is VALID [2022-04-14 15:18:45,868 INFO L290 TraceCheckUtils]: 18: Hoare triple {3279#true} ~cond := #in~cond; {3279#true} is VALID [2022-04-14 15:18:45,868 INFO L290 TraceCheckUtils]: 19: Hoare triple {3279#true} assume !(0 == ~cond); {3279#true} is VALID [2022-04-14 15:18:45,868 INFO L290 TraceCheckUtils]: 20: Hoare triple {3279#true} assume true; {3279#true} is VALID [2022-04-14 15:18:45,869 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {3279#true} {3317#(and (= main_~p~0 0) (= main_~h~0 0) (= main_~q~0 1))} #84#return; {3317#(and (= main_~p~0 0) (= main_~h~0 0) (= main_~q~0 1))} is VALID [2022-04-14 15:18:45,869 INFO L272 TraceCheckUtils]: 22: Hoare triple {3317#(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)); {3279#true} is VALID [2022-04-14 15:18:45,869 INFO L290 TraceCheckUtils]: 23: Hoare triple {3279#true} ~cond := #in~cond; {3279#true} is VALID [2022-04-14 15:18:45,869 INFO L290 TraceCheckUtils]: 24: Hoare triple {3279#true} assume !(0 == ~cond); {3279#true} is VALID [2022-04-14 15:18:45,869 INFO L290 TraceCheckUtils]: 25: Hoare triple {3279#true} assume true; {3279#true} is VALID [2022-04-14 15:18:45,870 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {3279#true} {3317#(and (= main_~p~0 0) (= main_~h~0 0) (= main_~q~0 1))} #86#return; {3317#(and (= main_~p~0 0) (= main_~h~0 0) (= main_~q~0 1))} is VALID [2022-04-14 15:18:45,871 INFO L272 TraceCheckUtils]: 27: Hoare triple {3317#(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)); {3366#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-14 15:18:45,872 INFO L290 TraceCheckUtils]: 28: Hoare triple {3366#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {3370#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-14 15:18:45,872 INFO L290 TraceCheckUtils]: 29: Hoare triple {3370#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {3280#false} is VALID [2022-04-14 15:18:45,872 INFO L290 TraceCheckUtils]: 30: Hoare triple {3280#false} assume !false; {3280#false} is VALID [2022-04-14 15:18:45,874 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:45,874 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-14 15:18:45,874 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 15:18:45,874 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [242861730] [2022-04-14 15:18:45,874 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-14 15:18:45,874 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1448460962] [2022-04-14 15:18:45,875 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1448460962] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-14 15:18:45,875 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-14 15:18:45,875 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-14 15:18:45,875 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2118417330] [2022-04-14 15:18:45,875 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-14 15:18:45,875 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:45,876 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 15:18:45,876 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:45,906 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:45,906 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-14 15:18:45,907 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 15:18:45,907 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-14 15:18:45,907 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-14 15:18:45,907 INFO L87 Difference]: Start difference. First operand 129 states and 173 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:18:52,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 15:18:52,216 INFO L93 Difference]: Finished difference Result 135 states and 177 transitions. [2022-04-14 15:18:52,216 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-14 15:18:52,216 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:52,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-14 15:18:52,217 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:18:52,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 71 transitions. [2022-04-14 15:18:52,218 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:18:52,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 71 transitions. [2022-04-14 15:18:52,220 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 71 transitions. [2022-04-14 15:18:52,310 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:18:52,312 INFO L225 Difference]: With dead ends: 135 [2022-04-14 15:18:52,312 INFO L226 Difference]: Without dead ends: 105 [2022-04-14 15:18:52,313 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:18:52,313 INFO L913 BasicCegarLoop]: 49 mSDtfsCounter, 6 mSDsluCounter, 105 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s 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, 1.1s IncrementalHoareTripleChecker+Time [2022-04-14 15:18:52,313 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [10 Valid, 154 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-04-14 15:18:52,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2022-04-14 15:18:52,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 105. [2022-04-14 15:18:52,352 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-14 15:18:52,352 INFO L82 GeneralOperation]: Start isEquivalent. First operand 105 states. Second operand has 105 states, 60 states have (on average 1.25) internal successors, (75), 65 states have internal predecessors, (75), 36 states have call successors, (36), 9 states have call predecessors, (36), 8 states have return successors, (33), 30 states have call predecessors, (33), 33 states have call successors, (33) [2022-04-14 15:18:52,353 INFO L74 IsIncluded]: Start isIncluded. First operand 105 states. Second operand has 105 states, 60 states have (on average 1.25) internal successors, (75), 65 states have internal predecessors, (75), 36 states have call successors, (36), 9 states have call predecessors, (36), 8 states have return successors, (33), 30 states have call predecessors, (33), 33 states have call successors, (33) [2022-04-14 15:18:52,353 INFO L87 Difference]: Start difference. First operand 105 states. Second operand has 105 states, 60 states have (on average 1.25) internal successors, (75), 65 states have internal predecessors, (75), 36 states have call successors, (36), 9 states have call predecessors, (36), 8 states have return successors, (33), 30 states have call predecessors, (33), 33 states have call successors, (33) [2022-04-14 15:18:52,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 15:18:52,357 INFO L93 Difference]: Finished difference Result 105 states and 144 transitions. [2022-04-14 15:18:52,357 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 144 transitions. [2022-04-14 15:18:52,358 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 15:18:52,358 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 15:18:52,358 INFO L74 IsIncluded]: Start isIncluded. First operand has 105 states, 60 states have (on average 1.25) internal successors, (75), 65 states have internal predecessors, (75), 36 states have call successors, (36), 9 states have call predecessors, (36), 8 states have return successors, (33), 30 states have call predecessors, (33), 33 states have call successors, (33) Second operand 105 states. [2022-04-14 15:18:52,359 INFO L87 Difference]: Start difference. First operand has 105 states, 60 states have (on average 1.25) internal successors, (75), 65 states have internal predecessors, (75), 36 states have call successors, (36), 9 states have call predecessors, (36), 8 states have return successors, (33), 30 states have call predecessors, (33), 33 states have call successors, (33) Second operand 105 states. [2022-04-14 15:18:52,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 15:18:52,363 INFO L93 Difference]: Finished difference Result 105 states and 144 transitions. [2022-04-14 15:18:52,363 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 144 transitions. [2022-04-14 15:18:52,364 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 15:18:52,364 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 15:18:52,364 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-14 15:18:52,364 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-14 15:18:52,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 60 states have (on average 1.25) internal successors, (75), 65 states have internal predecessors, (75), 36 states have call successors, (36), 9 states have call predecessors, (36), 8 states have return successors, (33), 30 states have call predecessors, (33), 33 states have call successors, (33) [2022-04-14 15:18:52,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 144 transitions. [2022-04-14 15:18:52,369 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 144 transitions. Word has length 31 [2022-04-14 15:18:52,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-14 15:18:52,369 INFO L478 AbstractCegarLoop]: Abstraction has 105 states and 144 transitions. [2022-04-14 15:18:52,370 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:18:52,370 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 144 transitions. [2022-04-14 15:18:52,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-04-14 15:18:52,370 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 15:18:52,370 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:18:52,379 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-04-14 15:18:52,583 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:18:52,584 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 15:18:52,584 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 15:18:52,584 INFO L85 PathProgramCache]: Analyzing trace with hash -1547125783, now seen corresponding path program 1 times [2022-04-14 15:18:52,584 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 15:18:52,584 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [310170558] [2022-04-14 15:18:52,585 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 15:18:52,585 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 15:18:52,615 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-14 15:18:52,615 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1292962741] [2022-04-14 15:18:52,615 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 15:18:52,615 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-14 15:18:52,615 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-14 15:18:52,616 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:18:52,627 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:18:52,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 15:18:52,701 INFO L263 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-14 15:18:52,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 15:18:52,710 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-14 15:18:52,889 INFO L272 TraceCheckUtils]: 0: Hoare triple {3940#true} call ULTIMATE.init(); {3940#true} is VALID [2022-04-14 15:18:52,889 INFO L290 TraceCheckUtils]: 1: Hoare triple {3940#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; {3940#true} is VALID [2022-04-14 15:18:52,889 INFO L290 TraceCheckUtils]: 2: Hoare triple {3940#true} assume true; {3940#true} is VALID [2022-04-14 15:18:52,889 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3940#true} {3940#true} #102#return; {3940#true} is VALID [2022-04-14 15:18:52,889 INFO L272 TraceCheckUtils]: 4: Hoare triple {3940#true} call #t~ret7 := main(); {3940#true} is VALID [2022-04-14 15:18:52,889 INFO L290 TraceCheckUtils]: 5: Hoare triple {3940#true} havoc ~n~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~h~0;~n~0 := #t~nondet4;havoc #t~nondet4; {3940#true} is VALID [2022-04-14 15:18:52,889 INFO L272 TraceCheckUtils]: 6: Hoare triple {3940#true} call assume_abort_if_not((if ~n~0 % 4294967296 < 1073741823 then 1 else 0)); {3940#true} is VALID [2022-04-14 15:18:52,890 INFO L290 TraceCheckUtils]: 7: Hoare triple {3940#true} ~cond := #in~cond; {3940#true} is VALID [2022-04-14 15:18:52,890 INFO L290 TraceCheckUtils]: 8: Hoare triple {3940#true} assume !(0 == ~cond); {3940#true} is VALID [2022-04-14 15:18:52,890 INFO L290 TraceCheckUtils]: 9: Hoare triple {3940#true} assume true; {3940#true} is VALID [2022-04-14 15:18:52,890 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {3940#true} {3940#true} #82#return; {3940#true} is VALID [2022-04-14 15:18:52,890 INFO L290 TraceCheckUtils]: 11: Hoare triple {3940#true} ~p~0 := 0;~q~0 := 1;~r~0 := ~n~0;~h~0 := 0; {3978#(and (= main_~p~0 0) (= main_~h~0 0))} is VALID [2022-04-14 15:18:52,891 INFO L290 TraceCheckUtils]: 12: Hoare triple {3978#(and (= main_~p~0 0) (= main_~h~0 0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {3978#(and (= main_~p~0 0) (= main_~h~0 0))} is VALID [2022-04-14 15:18:52,891 INFO L290 TraceCheckUtils]: 13: Hoare triple {3978#(and (= main_~p~0 0) (= main_~h~0 0))} assume !!(#t~post5 < 5);havoc #t~post5; {3978#(and (= main_~p~0 0) (= main_~h~0 0))} is VALID [2022-04-14 15:18:52,892 INFO L290 TraceCheckUtils]: 14: Hoare triple {3978#(and (= main_~p~0 0) (= main_~h~0 0))} assume !!(~q~0 % 4294967296 <= ~n~0 % 4294967296);~q~0 := 4 * ~q~0; {3978#(and (= main_~p~0 0) (= main_~h~0 0))} is VALID [2022-04-14 15:18:52,892 INFO L290 TraceCheckUtils]: 15: Hoare triple {3978#(and (= main_~p~0 0) (= main_~h~0 0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {3978#(and (= main_~p~0 0) (= main_~h~0 0))} is VALID [2022-04-14 15:18:52,893 INFO L290 TraceCheckUtils]: 16: Hoare triple {3978#(and (= main_~p~0 0) (= main_~h~0 0))} assume !!(#t~post5 < 5);havoc #t~post5; {3978#(and (= main_~p~0 0) (= main_~h~0 0))} is VALID [2022-04-14 15:18:52,893 INFO L290 TraceCheckUtils]: 17: Hoare triple {3978#(and (= main_~p~0 0) (= main_~h~0 0))} assume !(~q~0 % 4294967296 <= ~n~0 % 4294967296); {3978#(and (= main_~p~0 0) (= main_~h~0 0))} is VALID [2022-04-14 15:18:52,894 INFO L290 TraceCheckUtils]: 18: Hoare triple {3978#(and (= main_~p~0 0) (= main_~h~0 0))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {3978#(and (= main_~p~0 0) (= main_~h~0 0))} is VALID [2022-04-14 15:18:52,894 INFO L290 TraceCheckUtils]: 19: Hoare triple {3978#(and (= main_~p~0 0) (= main_~h~0 0))} assume !!(#t~post6 < 5);havoc #t~post6; {3978#(and (= main_~p~0 0) (= main_~h~0 0))} is VALID [2022-04-14 15:18:52,894 INFO L272 TraceCheckUtils]: 20: Hoare triple {3978#(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)); {3940#true} is VALID [2022-04-14 15:18:52,894 INFO L290 TraceCheckUtils]: 21: Hoare triple {3940#true} ~cond := #in~cond; {3940#true} is VALID [2022-04-14 15:18:52,894 INFO L290 TraceCheckUtils]: 22: Hoare triple {3940#true} assume !(0 == ~cond); {3940#true} is VALID [2022-04-14 15:18:52,894 INFO L290 TraceCheckUtils]: 23: Hoare triple {3940#true} assume true; {3940#true} is VALID [2022-04-14 15:18:52,895 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {3940#true} {3978#(and (= main_~p~0 0) (= main_~h~0 0))} #84#return; {3978#(and (= main_~p~0 0) (= main_~h~0 0))} is VALID [2022-04-14 15:18:52,895 INFO L272 TraceCheckUtils]: 25: Hoare triple {3978#(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)); {3940#true} is VALID [2022-04-14 15:18:52,895 INFO L290 TraceCheckUtils]: 26: Hoare triple {3940#true} ~cond := #in~cond; {3940#true} is VALID [2022-04-14 15:18:52,896 INFO L290 TraceCheckUtils]: 27: Hoare triple {3940#true} assume !(0 == ~cond); {3940#true} is VALID [2022-04-14 15:18:52,896 INFO L290 TraceCheckUtils]: 28: Hoare triple {3940#true} assume true; {3940#true} is VALID [2022-04-14 15:18:52,896 INFO L284 TraceCheckUtils]: 29: Hoare quadruple {3940#true} {3978#(and (= main_~p~0 0) (= main_~h~0 0))} #86#return; {3978#(and (= main_~p~0 0) (= main_~h~0 0))} is VALID [2022-04-14 15:18:52,898 INFO L272 TraceCheckUtils]: 30: Hoare triple {3978#(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)); {4036#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-14 15:18:52,898 INFO L290 TraceCheckUtils]: 31: Hoare triple {4036#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {4040#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-14 15:18:52,899 INFO L290 TraceCheckUtils]: 32: Hoare triple {4040#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {3941#false} is VALID [2022-04-14 15:18:52,899 INFO L290 TraceCheckUtils]: 33: Hoare triple {3941#false} assume !false; {3941#false} is VALID [2022-04-14 15:18:52,899 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:18:52,899 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-14 15:18:52,899 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 15:18:52,899 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [310170558] [2022-04-14 15:18:52,899 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-14 15:18:52,899 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1292962741] [2022-04-14 15:18:52,899 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1292962741] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-14 15:18:52,900 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-14 15:18:52,900 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-14 15:18:52,900 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [89004742] [2022-04-14 15:18:52,900 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-14 15:18:52,900 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:18:52,901 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 15:18:52,901 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:18:52,931 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:18:52,931 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-14 15:18:52,931 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 15:18:52,932 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-14 15:18:52,932 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-14 15:18:52,932 INFO L87 Difference]: Start difference. First operand 105 states and 144 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:18:57,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 15:18:57,734 INFO L93 Difference]: Finished difference Result 127 states and 162 transitions. [2022-04-14 15:18:57,734 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-14 15:18:57,734 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:18:57,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-14 15:18:57,735 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:18:57,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 69 transitions. [2022-04-14 15:18:57,736 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:18:57,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 69 transitions. [2022-04-14 15:18:57,738 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 69 transitions. [2022-04-14 15:18:57,823 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 69 edges. 69 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 15:18:57,825 INFO L225 Difference]: With dead ends: 127 [2022-04-14 15:18:57,825 INFO L226 Difference]: Without dead ends: 124 [2022-04-14 15:18:57,826 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:18:57,826 INFO L913 BasicCegarLoop]: 50 mSDtfsCounter, 8 mSDsluCounter, 106 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 156 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-04-14 15:18:57,827 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [12 Valid, 156 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-04-14 15:18:57,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2022-04-14 15:18:57,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 116. [2022-04-14 15:18:57,870 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-14 15:18:57,871 INFO L82 GeneralOperation]: Start isEquivalent. First operand 124 states. Second operand has 116 states, 69 states have (on average 1.144927536231884) internal successors, (79), 73 states have internal predecessors, (79), 34 states have call successors, (34), 13 states have call predecessors, (34), 12 states have return successors, (32), 29 states have call predecessors, (32), 32 states have call successors, (32) [2022-04-14 15:18:57,871 INFO L74 IsIncluded]: Start isIncluded. First operand 124 states. Second operand has 116 states, 69 states have (on average 1.144927536231884) internal successors, (79), 73 states have internal predecessors, (79), 34 states have call successors, (34), 13 states have call predecessors, (34), 12 states have return successors, (32), 29 states have call predecessors, (32), 32 states have call successors, (32) [2022-04-14 15:18:57,871 INFO L87 Difference]: Start difference. First operand 124 states. Second operand has 116 states, 69 states have (on average 1.144927536231884) internal successors, (79), 73 states have internal predecessors, (79), 34 states have call successors, (34), 13 states have call predecessors, (34), 12 states have return successors, (32), 29 states have call predecessors, (32), 32 states have call successors, (32) [2022-04-14 15:18:57,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 15:18:57,876 INFO L93 Difference]: Finished difference Result 124 states and 154 transitions. [2022-04-14 15:18:57,876 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 154 transitions. [2022-04-14 15:18:57,877 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 15:18:57,877 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 15:18:57,877 INFO L74 IsIncluded]: Start isIncluded. First operand has 116 states, 69 states have (on average 1.144927536231884) internal successors, (79), 73 states have internal predecessors, (79), 34 states have call successors, (34), 13 states have call predecessors, (34), 12 states have return successors, (32), 29 states have call predecessors, (32), 32 states have call successors, (32) Second operand 124 states. [2022-04-14 15:18:57,877 INFO L87 Difference]: Start difference. First operand has 116 states, 69 states have (on average 1.144927536231884) internal successors, (79), 73 states have internal predecessors, (79), 34 states have call successors, (34), 13 states have call predecessors, (34), 12 states have return successors, (32), 29 states have call predecessors, (32), 32 states have call successors, (32) Second operand 124 states. [2022-04-14 15:18:57,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 15:18:57,882 INFO L93 Difference]: Finished difference Result 124 states and 154 transitions. [2022-04-14 15:18:57,882 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 154 transitions. [2022-04-14 15:18:57,883 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 15:18:57,883 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 15:18:57,883 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-14 15:18:57,883 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-14 15:18:57,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 69 states have (on average 1.144927536231884) internal successors, (79), 73 states have internal predecessors, (79), 34 states have call successors, (34), 13 states have call predecessors, (34), 12 states have return successors, (32), 29 states have call predecessors, (32), 32 states have call successors, (32) [2022-04-14 15:18:57,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 145 transitions. [2022-04-14 15:18:57,887 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 145 transitions. Word has length 34 [2022-04-14 15:18:57,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-14 15:18:57,887 INFO L478 AbstractCegarLoop]: Abstraction has 116 states and 145 transitions. [2022-04-14 15:18:57,887 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:18:57,888 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 145 transitions. [2022-04-14 15:18:57,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-04-14 15:18:57,888 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 15:18:57,888 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:18:57,898 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:18:58,097 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:18:58,098 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 15:18:58,098 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 15:18:58,098 INFO L85 PathProgramCache]: Analyzing trace with hash 821435566, now seen corresponding path program 1 times [2022-04-14 15:18:58,098 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 15:18:58,099 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1775198961] [2022-04-14 15:18:58,099 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 15:18:58,099 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 15:18:58,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 15:18:58,252 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-14 15:18:58,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 15:18:58,262 INFO L290 TraceCheckUtils]: 0: Hoare triple {4661#(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; {4651#(<= ~counter~0 0)} is VALID [2022-04-14 15:18:58,263 INFO L290 TraceCheckUtils]: 1: Hoare triple {4651#(<= ~counter~0 0)} assume true; {4651#(<= ~counter~0 0)} is VALID [2022-04-14 15:18:58,263 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {4651#(<= ~counter~0 0)} {4646#true} #102#return; {4651#(<= ~counter~0 0)} is VALID [2022-04-14 15:18:58,263 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-14 15:18:58,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 15:18:58,270 INFO L290 TraceCheckUtils]: 0: Hoare triple {4646#true} ~cond := #in~cond; {4646#true} is VALID [2022-04-14 15:18:58,270 INFO L290 TraceCheckUtils]: 1: Hoare triple {4646#true} assume !(0 == ~cond); {4646#true} is VALID [2022-04-14 15:18:58,271 INFO L290 TraceCheckUtils]: 2: Hoare triple {4646#true} assume true; {4646#true} is VALID [2022-04-14 15:18:58,271 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4646#true} {4651#(<= ~counter~0 0)} #82#return; {4651#(<= ~counter~0 0)} is VALID [2022-04-14 15:18:58,272 INFO L272 TraceCheckUtils]: 0: Hoare triple {4646#true} call ULTIMATE.init(); {4661#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-14 15:18:58,273 INFO L290 TraceCheckUtils]: 1: Hoare triple {4661#(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; {4651#(<= ~counter~0 0)} is VALID [2022-04-14 15:18:58,273 INFO L290 TraceCheckUtils]: 2: Hoare triple {4651#(<= ~counter~0 0)} assume true; {4651#(<= ~counter~0 0)} is VALID [2022-04-14 15:18:58,273 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4651#(<= ~counter~0 0)} {4646#true} #102#return; {4651#(<= ~counter~0 0)} is VALID [2022-04-14 15:18:58,274 INFO L272 TraceCheckUtils]: 4: Hoare triple {4651#(<= ~counter~0 0)} call #t~ret7 := main(); {4651#(<= ~counter~0 0)} is VALID [2022-04-14 15:18:58,274 INFO L290 TraceCheckUtils]: 5: Hoare triple {4651#(<= ~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; {4651#(<= ~counter~0 0)} is VALID [2022-04-14 15:18:58,274 INFO L272 TraceCheckUtils]: 6: Hoare triple {4651#(<= ~counter~0 0)} call assume_abort_if_not((if ~n~0 % 4294967296 < 1073741823 then 1 else 0)); {4646#true} is VALID [2022-04-14 15:18:58,275 INFO L290 TraceCheckUtils]: 7: Hoare triple {4646#true} ~cond := #in~cond; {4646#true} is VALID [2022-04-14 15:18:58,275 INFO L290 TraceCheckUtils]: 8: Hoare triple {4646#true} assume !(0 == ~cond); {4646#true} is VALID [2022-04-14 15:18:58,275 INFO L290 TraceCheckUtils]: 9: Hoare triple {4646#true} assume true; {4646#true} is VALID [2022-04-14 15:18:58,275 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {4646#true} {4651#(<= ~counter~0 0)} #82#return; {4651#(<= ~counter~0 0)} is VALID [2022-04-14 15:18:58,276 INFO L290 TraceCheckUtils]: 11: Hoare triple {4651#(<= ~counter~0 0)} ~p~0 := 0;~q~0 := 1;~r~0 := ~n~0;~h~0 := 0; {4651#(<= ~counter~0 0)} is VALID [2022-04-14 15:18:58,277 INFO L290 TraceCheckUtils]: 12: Hoare triple {4651#(<= ~counter~0 0)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {4656#(<= ~counter~0 1)} is VALID [2022-04-14 15:18:58,278 INFO L290 TraceCheckUtils]: 13: Hoare triple {4656#(<= ~counter~0 1)} assume !!(#t~post5 < 5);havoc #t~post5; {4656#(<= ~counter~0 1)} is VALID [2022-04-14 15:18:58,278 INFO L290 TraceCheckUtils]: 14: Hoare triple {4656#(<= ~counter~0 1)} assume !!(~q~0 % 4294967296 <= ~n~0 % 4294967296);~q~0 := 4 * ~q~0; {4656#(<= ~counter~0 1)} is VALID [2022-04-14 15:18:58,279 INFO L290 TraceCheckUtils]: 15: Hoare triple {4656#(<= ~counter~0 1)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {4657#(<= ~counter~0 2)} is VALID [2022-04-14 15:18:58,280 INFO L290 TraceCheckUtils]: 16: Hoare triple {4657#(<= ~counter~0 2)} assume !!(#t~post5 < 5);havoc #t~post5; {4657#(<= ~counter~0 2)} is VALID [2022-04-14 15:18:58,280 INFO L290 TraceCheckUtils]: 17: Hoare triple {4657#(<= ~counter~0 2)} assume !!(~q~0 % 4294967296 <= ~n~0 % 4294967296);~q~0 := 4 * ~q~0; {4657#(<= ~counter~0 2)} is VALID [2022-04-14 15:18:58,281 INFO L290 TraceCheckUtils]: 18: Hoare triple {4657#(<= ~counter~0 2)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {4658#(<= ~counter~0 3)} is VALID [2022-04-14 15:18:58,281 INFO L290 TraceCheckUtils]: 19: Hoare triple {4658#(<= ~counter~0 3)} assume !!(#t~post5 < 5);havoc #t~post5; {4658#(<= ~counter~0 3)} is VALID [2022-04-14 15:18:58,281 INFO L290 TraceCheckUtils]: 20: Hoare triple {4658#(<= ~counter~0 3)} assume !!(~q~0 % 4294967296 <= ~n~0 % 4294967296);~q~0 := 4 * ~q~0; {4658#(<= ~counter~0 3)} is VALID [2022-04-14 15:18:58,282 INFO L290 TraceCheckUtils]: 21: Hoare triple {4658#(<= ~counter~0 3)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {4659#(<= ~counter~0 4)} is VALID [2022-04-14 15:18:58,283 INFO L290 TraceCheckUtils]: 22: Hoare triple {4659#(<= ~counter~0 4)} assume !!(#t~post5 < 5);havoc #t~post5; {4659#(<= ~counter~0 4)} is VALID [2022-04-14 15:18:58,283 INFO L290 TraceCheckUtils]: 23: Hoare triple {4659#(<= ~counter~0 4)} assume !!(~q~0 % 4294967296 <= ~n~0 % 4294967296);~q~0 := 4 * ~q~0; {4659#(<= ~counter~0 4)} is VALID [2022-04-14 15:18:58,283 INFO L290 TraceCheckUtils]: 24: Hoare triple {4659#(<= ~counter~0 4)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {4660#(<= |main_#t~post5| 4)} is VALID [2022-04-14 15:18:58,284 INFO L290 TraceCheckUtils]: 25: Hoare triple {4660#(<= |main_#t~post5| 4)} assume !(#t~post5 < 5);havoc #t~post5; {4647#false} is VALID [2022-04-14 15:18:58,284 INFO L290 TraceCheckUtils]: 26: Hoare triple {4647#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {4647#false} is VALID [2022-04-14 15:18:58,284 INFO L290 TraceCheckUtils]: 27: Hoare triple {4647#false} assume !!(#t~post6 < 5);havoc #t~post6; {4647#false} is VALID [2022-04-14 15:18:58,284 INFO L272 TraceCheckUtils]: 28: Hoare triple {4647#false} call __VERIFIER_assert((if ~r~0 % 4294967296 < (2 * ~p~0 + ~q~0) % 4294967296 then 1 else 0)); {4647#false} is VALID [2022-04-14 15:18:58,286 INFO L290 TraceCheckUtils]: 29: Hoare triple {4647#false} ~cond := #in~cond; {4647#false} is VALID [2022-04-14 15:18:58,286 INFO L290 TraceCheckUtils]: 30: Hoare triple {4647#false} assume 0 == ~cond; {4647#false} is VALID [2022-04-14 15:18:58,286 INFO L290 TraceCheckUtils]: 31: Hoare triple {4647#false} assume !false; {4647#false} is VALID [2022-04-14 15:18:58,286 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:18:58,286 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 15:18:58,287 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1775198961] [2022-04-14 15:18:58,287 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1775198961] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-14 15:18:58,287 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [505455727] [2022-04-14 15:18:58,287 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 15:18:58,287 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-14 15:18:58,287 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-14 15:18:58,288 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:18:58,289 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:18:58,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 15:18:58,332 INFO L263 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 13 conjunts are in the unsatisfiable core [2022-04-14 15:18:58,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 15:18:58,350 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-14 15:18:58,603 INFO L272 TraceCheckUtils]: 0: Hoare triple {4646#true} call ULTIMATE.init(); {4646#true} is VALID [2022-04-14 15:18:58,610 INFO L290 TraceCheckUtils]: 1: Hoare triple {4646#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; {4651#(<= ~counter~0 0)} is VALID [2022-04-14 15:18:58,611 INFO L290 TraceCheckUtils]: 2: Hoare triple {4651#(<= ~counter~0 0)} assume true; {4651#(<= ~counter~0 0)} is VALID [2022-04-14 15:18:58,611 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4651#(<= ~counter~0 0)} {4646#true} #102#return; {4651#(<= ~counter~0 0)} is VALID [2022-04-14 15:18:58,611 INFO L272 TraceCheckUtils]: 4: Hoare triple {4651#(<= ~counter~0 0)} call #t~ret7 := main(); {4651#(<= ~counter~0 0)} is VALID [2022-04-14 15:18:58,612 INFO L290 TraceCheckUtils]: 5: Hoare triple {4651#(<= ~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; {4651#(<= ~counter~0 0)} is VALID [2022-04-14 15:18:58,612 INFO L272 TraceCheckUtils]: 6: Hoare triple {4651#(<= ~counter~0 0)} call assume_abort_if_not((if ~n~0 % 4294967296 < 1073741823 then 1 else 0)); {4651#(<= ~counter~0 0)} is VALID [2022-04-14 15:18:58,613 INFO L290 TraceCheckUtils]: 7: Hoare triple {4651#(<= ~counter~0 0)} ~cond := #in~cond; {4651#(<= ~counter~0 0)} is VALID [2022-04-14 15:18:58,613 INFO L290 TraceCheckUtils]: 8: Hoare triple {4651#(<= ~counter~0 0)} assume !(0 == ~cond); {4651#(<= ~counter~0 0)} is VALID [2022-04-14 15:18:58,613 INFO L290 TraceCheckUtils]: 9: Hoare triple {4651#(<= ~counter~0 0)} assume true; {4651#(<= ~counter~0 0)} is VALID [2022-04-14 15:18:58,614 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {4651#(<= ~counter~0 0)} {4651#(<= ~counter~0 0)} #82#return; {4651#(<= ~counter~0 0)} is VALID [2022-04-14 15:18:58,614 INFO L290 TraceCheckUtils]: 11: Hoare triple {4651#(<= ~counter~0 0)} ~p~0 := 0;~q~0 := 1;~r~0 := ~n~0;~h~0 := 0; {4651#(<= ~counter~0 0)} is VALID [2022-04-14 15:18:58,615 INFO L290 TraceCheckUtils]: 12: Hoare triple {4651#(<= ~counter~0 0)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {4656#(<= ~counter~0 1)} is VALID [2022-04-14 15:18:58,615 INFO L290 TraceCheckUtils]: 13: Hoare triple {4656#(<= ~counter~0 1)} assume !!(#t~post5 < 5);havoc #t~post5; {4656#(<= ~counter~0 1)} is VALID [2022-04-14 15:18:58,616 INFO L290 TraceCheckUtils]: 14: Hoare triple {4656#(<= ~counter~0 1)} assume !!(~q~0 % 4294967296 <= ~n~0 % 4294967296);~q~0 := 4 * ~q~0; {4656#(<= ~counter~0 1)} is VALID [2022-04-14 15:18:58,616 INFO L290 TraceCheckUtils]: 15: Hoare triple {4656#(<= ~counter~0 1)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {4657#(<= ~counter~0 2)} is VALID [2022-04-14 15:18:58,617 INFO L290 TraceCheckUtils]: 16: Hoare triple {4657#(<= ~counter~0 2)} assume !!(#t~post5 < 5);havoc #t~post5; {4657#(<= ~counter~0 2)} is VALID [2022-04-14 15:18:58,617 INFO L290 TraceCheckUtils]: 17: Hoare triple {4657#(<= ~counter~0 2)} assume !!(~q~0 % 4294967296 <= ~n~0 % 4294967296);~q~0 := 4 * ~q~0; {4657#(<= ~counter~0 2)} is VALID [2022-04-14 15:18:58,618 INFO L290 TraceCheckUtils]: 18: Hoare triple {4657#(<= ~counter~0 2)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {4658#(<= ~counter~0 3)} is VALID [2022-04-14 15:18:58,618 INFO L290 TraceCheckUtils]: 19: Hoare triple {4658#(<= ~counter~0 3)} assume !!(#t~post5 < 5);havoc #t~post5; {4658#(<= ~counter~0 3)} is VALID [2022-04-14 15:18:58,618 INFO L290 TraceCheckUtils]: 20: Hoare triple {4658#(<= ~counter~0 3)} assume !!(~q~0 % 4294967296 <= ~n~0 % 4294967296);~q~0 := 4 * ~q~0; {4658#(<= ~counter~0 3)} is VALID [2022-04-14 15:18:58,619 INFO L290 TraceCheckUtils]: 21: Hoare triple {4658#(<= ~counter~0 3)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {4659#(<= ~counter~0 4)} is VALID [2022-04-14 15:18:58,619 INFO L290 TraceCheckUtils]: 22: Hoare triple {4659#(<= ~counter~0 4)} assume !!(#t~post5 < 5);havoc #t~post5; {4659#(<= ~counter~0 4)} is VALID [2022-04-14 15:18:58,620 INFO L290 TraceCheckUtils]: 23: Hoare triple {4659#(<= ~counter~0 4)} assume !!(~q~0 % 4294967296 <= ~n~0 % 4294967296);~q~0 := 4 * ~q~0; {4659#(<= ~counter~0 4)} is VALID [2022-04-14 15:18:58,620 INFO L290 TraceCheckUtils]: 24: Hoare triple {4659#(<= ~counter~0 4)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {4660#(<= |main_#t~post5| 4)} is VALID [2022-04-14 15:18:58,621 INFO L290 TraceCheckUtils]: 25: Hoare triple {4660#(<= |main_#t~post5| 4)} assume !(#t~post5 < 5);havoc #t~post5; {4647#false} is VALID [2022-04-14 15:18:58,621 INFO L290 TraceCheckUtils]: 26: Hoare triple {4647#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {4647#false} is VALID [2022-04-14 15:18:58,621 INFO L290 TraceCheckUtils]: 27: Hoare triple {4647#false} assume !!(#t~post6 < 5);havoc #t~post6; {4647#false} is VALID [2022-04-14 15:18:58,621 INFO L272 TraceCheckUtils]: 28: Hoare triple {4647#false} call __VERIFIER_assert((if ~r~0 % 4294967296 < (2 * ~p~0 + ~q~0) % 4294967296 then 1 else 0)); {4647#false} is VALID [2022-04-14 15:18:58,621 INFO L290 TraceCheckUtils]: 29: Hoare triple {4647#false} ~cond := #in~cond; {4647#false} is VALID [2022-04-14 15:18:58,621 INFO L290 TraceCheckUtils]: 30: Hoare triple {4647#false} assume 0 == ~cond; {4647#false} is VALID [2022-04-14 15:18:58,621 INFO L290 TraceCheckUtils]: 31: Hoare triple {4647#false} assume !false; {4647#false} is VALID [2022-04-14 15:18:58,621 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:18:58,621 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-14 15:18:58,864 INFO L290 TraceCheckUtils]: 31: Hoare triple {4647#false} assume !false; {4647#false} is VALID [2022-04-14 15:18:58,864 INFO L290 TraceCheckUtils]: 30: Hoare triple {4647#false} assume 0 == ~cond; {4647#false} is VALID [2022-04-14 15:18:58,864 INFO L290 TraceCheckUtils]: 29: Hoare triple {4647#false} ~cond := #in~cond; {4647#false} is VALID [2022-04-14 15:18:58,864 INFO L272 TraceCheckUtils]: 28: Hoare triple {4647#false} call __VERIFIER_assert((if ~r~0 % 4294967296 < (2 * ~p~0 + ~q~0) % 4294967296 then 1 else 0)); {4647#false} is VALID [2022-04-14 15:18:58,865 INFO L290 TraceCheckUtils]: 27: Hoare triple {4647#false} assume !!(#t~post6 < 5);havoc #t~post6; {4647#false} is VALID [2022-04-14 15:18:58,865 INFO L290 TraceCheckUtils]: 26: Hoare triple {4647#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {4647#false} is VALID [2022-04-14 15:18:58,865 INFO L290 TraceCheckUtils]: 25: Hoare triple {4660#(<= |main_#t~post5| 4)} assume !(#t~post5 < 5);havoc #t~post5; {4647#false} is VALID [2022-04-14 15:18:58,866 INFO L290 TraceCheckUtils]: 24: Hoare triple {4659#(<= ~counter~0 4)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {4660#(<= |main_#t~post5| 4)} is VALID [2022-04-14 15:18:58,866 INFO L290 TraceCheckUtils]: 23: Hoare triple {4659#(<= ~counter~0 4)} assume !!(~q~0 % 4294967296 <= ~n~0 % 4294967296);~q~0 := 4 * ~q~0; {4659#(<= ~counter~0 4)} is VALID [2022-04-14 15:18:58,866 INFO L290 TraceCheckUtils]: 22: Hoare triple {4659#(<= ~counter~0 4)} assume !!(#t~post5 < 5);havoc #t~post5; {4659#(<= ~counter~0 4)} is VALID [2022-04-14 15:18:58,867 INFO L290 TraceCheckUtils]: 21: Hoare triple {4658#(<= ~counter~0 3)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {4659#(<= ~counter~0 4)} is VALID [2022-04-14 15:18:58,868 INFO L290 TraceCheckUtils]: 20: Hoare triple {4658#(<= ~counter~0 3)} assume !!(~q~0 % 4294967296 <= ~n~0 % 4294967296);~q~0 := 4 * ~q~0; {4658#(<= ~counter~0 3)} is VALID [2022-04-14 15:18:58,868 INFO L290 TraceCheckUtils]: 19: Hoare triple {4658#(<= ~counter~0 3)} assume !!(#t~post5 < 5);havoc #t~post5; {4658#(<= ~counter~0 3)} is VALID [2022-04-14 15:18:58,869 INFO L290 TraceCheckUtils]: 18: Hoare triple {4657#(<= ~counter~0 2)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {4658#(<= ~counter~0 3)} is VALID [2022-04-14 15:18:58,869 INFO L290 TraceCheckUtils]: 17: Hoare triple {4657#(<= ~counter~0 2)} assume !!(~q~0 % 4294967296 <= ~n~0 % 4294967296);~q~0 := 4 * ~q~0; {4657#(<= ~counter~0 2)} is VALID [2022-04-14 15:18:58,869 INFO L290 TraceCheckUtils]: 16: Hoare triple {4657#(<= ~counter~0 2)} assume !!(#t~post5 < 5);havoc #t~post5; {4657#(<= ~counter~0 2)} is VALID [2022-04-14 15:18:58,870 INFO L290 TraceCheckUtils]: 15: Hoare triple {4656#(<= ~counter~0 1)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {4657#(<= ~counter~0 2)} is VALID [2022-04-14 15:18:58,870 INFO L290 TraceCheckUtils]: 14: Hoare triple {4656#(<= ~counter~0 1)} assume !!(~q~0 % 4294967296 <= ~n~0 % 4294967296);~q~0 := 4 * ~q~0; {4656#(<= ~counter~0 1)} is VALID [2022-04-14 15:18:58,871 INFO L290 TraceCheckUtils]: 13: Hoare triple {4656#(<= ~counter~0 1)} assume !!(#t~post5 < 5);havoc #t~post5; {4656#(<= ~counter~0 1)} is VALID [2022-04-14 15:18:58,871 INFO L290 TraceCheckUtils]: 12: Hoare triple {4651#(<= ~counter~0 0)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {4656#(<= ~counter~0 1)} is VALID [2022-04-14 15:18:58,872 INFO L290 TraceCheckUtils]: 11: Hoare triple {4651#(<= ~counter~0 0)} ~p~0 := 0;~q~0 := 1;~r~0 := ~n~0;~h~0 := 0; {4651#(<= ~counter~0 0)} is VALID [2022-04-14 15:18:58,872 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {4646#true} {4651#(<= ~counter~0 0)} #82#return; {4651#(<= ~counter~0 0)} is VALID [2022-04-14 15:18:58,872 INFO L290 TraceCheckUtils]: 9: Hoare triple {4646#true} assume true; {4646#true} is VALID [2022-04-14 15:18:58,873 INFO L290 TraceCheckUtils]: 8: Hoare triple {4646#true} assume !(0 == ~cond); {4646#true} is VALID [2022-04-14 15:18:58,873 INFO L290 TraceCheckUtils]: 7: Hoare triple {4646#true} ~cond := #in~cond; {4646#true} is VALID [2022-04-14 15:18:58,873 INFO L272 TraceCheckUtils]: 6: Hoare triple {4651#(<= ~counter~0 0)} call assume_abort_if_not((if ~n~0 % 4294967296 < 1073741823 then 1 else 0)); {4646#true} is VALID [2022-04-14 15:18:58,873 INFO L290 TraceCheckUtils]: 5: Hoare triple {4651#(<= ~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; {4651#(<= ~counter~0 0)} is VALID [2022-04-14 15:18:58,873 INFO L272 TraceCheckUtils]: 4: Hoare triple {4651#(<= ~counter~0 0)} call #t~ret7 := main(); {4651#(<= ~counter~0 0)} is VALID [2022-04-14 15:18:58,874 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4651#(<= ~counter~0 0)} {4646#true} #102#return; {4651#(<= ~counter~0 0)} is VALID [2022-04-14 15:18:58,874 INFO L290 TraceCheckUtils]: 2: Hoare triple {4651#(<= ~counter~0 0)} assume true; {4651#(<= ~counter~0 0)} is VALID [2022-04-14 15:18:58,875 INFO L290 TraceCheckUtils]: 1: Hoare triple {4646#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; {4651#(<= ~counter~0 0)} is VALID [2022-04-14 15:18:58,875 INFO L272 TraceCheckUtils]: 0: Hoare triple {4646#true} call ULTIMATE.init(); {4646#true} is VALID [2022-04-14 15:18:58,875 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:18:58,875 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [505455727] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-14 15:18:58,875 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-14 15:18:58,876 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 9 [2022-04-14 15:18:58,876 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [675625659] [2022-04-14 15:18:58,876 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-14 15:18:58,876 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 8 states have internal predecessors, (30), 3 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) Word has length 32 [2022-04-14 15:18:58,877 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 15:18:58,877 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 9 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 8 states have internal predecessors, (30), 3 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-14 15:18:58,911 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:18:58,911 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-14 15:18:58,911 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 15:18:58,912 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-14 15:18:58,912 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2022-04-14 15:18:58,912 INFO L87 Difference]: Start difference. First operand 116 states and 145 transitions. Second operand has 9 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 8 states have internal predecessors, (30), 3 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-14 15:19:03,307 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.32s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-14 15:19:10,696 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:14,783 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:17,095 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:19,767 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-14 15:19:21,772 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:25,550 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:27,553 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:28,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 15:19:28,101 INFO L93 Difference]: Finished difference Result 167 states and 210 transitions. [2022-04-14 15:19:28,101 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-04-14 15:19:28,101 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 8 states have internal predecessors, (30), 3 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) Word has length 32 [2022-04-14 15:19:28,101 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-14 15:19:28,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 8 states have internal predecessors, (30), 3 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-14 15:19:28,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 131 transitions. [2022-04-14 15:19:28,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 8 states have internal predecessors, (30), 3 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-14 15:19:28,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 131 transitions. [2022-04-14 15:19:28,106 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 16 states and 131 transitions. [2022-04-14 15:19:28,272 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 131 edges. 131 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 15:19:28,274 INFO L225 Difference]: With dead ends: 167 [2022-04-14 15:19:28,275 INFO L226 Difference]: Without dead ends: 127 [2022-04-14 15:19:28,275 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 68 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=73, Invalid=167, Unknown=0, NotChecked=0, Total=240 [2022-04-14 15:19:28,276 INFO L913 BasicCegarLoop]: 44 mSDtfsCounter, 56 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 159 mSolverCounterSat, 35 mSolverCounterUnsat, 7 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 21.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 113 SdHoareTripleChecker+Invalid, 201 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 159 IncrementalHoareTripleChecker+Invalid, 7 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 21.6s IncrementalHoareTripleChecker+Time [2022-04-14 15:19:28,276 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [66 Valid, 113 Invalid, 201 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 159 Invalid, 7 Unknown, 0 Unchecked, 21.6s Time] [2022-04-14 15:19:28,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2022-04-14 15:19:28,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 119. [2022-04-14 15:19:28,331 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-14 15:19:28,332 INFO L82 GeneralOperation]: Start isEquivalent. First operand 127 states. Second operand has 119 states, 72 states have (on average 1.1527777777777777) internal successors, (83), 76 states have internal predecessors, (83), 34 states have call successors, (34), 13 states have call predecessors, (34), 12 states have return successors, (32), 29 states have call predecessors, (32), 32 states have call successors, (32) [2022-04-14 15:19:28,332 INFO L74 IsIncluded]: Start isIncluded. First operand 127 states. Second operand has 119 states, 72 states have (on average 1.1527777777777777) internal successors, (83), 76 states have internal predecessors, (83), 34 states have call successors, (34), 13 states have call predecessors, (34), 12 states have return successors, (32), 29 states have call predecessors, (32), 32 states have call successors, (32) [2022-04-14 15:19:28,332 INFO L87 Difference]: Start difference. First operand 127 states. Second operand has 119 states, 72 states have (on average 1.1527777777777777) internal successors, (83), 76 states have internal predecessors, (83), 34 states have call successors, (34), 13 states have call predecessors, (34), 12 states have return successors, (32), 29 states have call predecessors, (32), 32 states have call successors, (32) [2022-04-14 15:19:28,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 15:19:28,336 INFO L93 Difference]: Finished difference Result 127 states and 156 transitions. [2022-04-14 15:19:28,336 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 156 transitions. [2022-04-14 15:19:28,336 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 15:19:28,336 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 15:19:28,337 INFO L74 IsIncluded]: Start isIncluded. First operand has 119 states, 72 states have (on average 1.1527777777777777) internal successors, (83), 76 states have internal predecessors, (83), 34 states have call successors, (34), 13 states have call predecessors, (34), 12 states have return successors, (32), 29 states have call predecessors, (32), 32 states have call successors, (32) Second operand 127 states. [2022-04-14 15:19:28,337 INFO L87 Difference]: Start difference. First operand has 119 states, 72 states have (on average 1.1527777777777777) internal successors, (83), 76 states have internal predecessors, (83), 34 states have call successors, (34), 13 states have call predecessors, (34), 12 states have return successors, (32), 29 states have call predecessors, (32), 32 states have call successors, (32) Second operand 127 states. [2022-04-14 15:19:28,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 15:19:28,341 INFO L93 Difference]: Finished difference Result 127 states and 156 transitions. [2022-04-14 15:19:28,341 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 156 transitions. [2022-04-14 15:19:28,341 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 15:19:28,341 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 15:19:28,341 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-14 15:19:28,341 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-14 15:19:28,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 72 states have (on average 1.1527777777777777) internal successors, (83), 76 states have internal predecessors, (83), 34 states have call successors, (34), 13 states have call predecessors, (34), 12 states have return successors, (32), 29 states have call predecessors, (32), 32 states have call successors, (32) [2022-04-14 15:19:28,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 149 transitions. [2022-04-14 15:19:28,345 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 149 transitions. Word has length 32 [2022-04-14 15:19:28,345 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-14 15:19:28,345 INFO L478 AbstractCegarLoop]: Abstraction has 119 states and 149 transitions. [2022-04-14 15:19:28,345 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 8 states have internal predecessors, (30), 3 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-14 15:19:28,345 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 149 transitions. [2022-04-14 15:19:28,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-04-14 15:19:28,347 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 15:19:28,347 INFO L499 BasicCegarLoop]: trace histogram [6, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-14 15:19:28,373 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:19:28,571 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:19:28,571 INFO L403 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 15:19:28,571 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 15:19:28,571 INFO L85 PathProgramCache]: Analyzing trace with hash 1505493762, now seen corresponding path program 2 times [2022-04-14 15:19:28,572 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 15:19:28,572 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [773711990] [2022-04-14 15:19:28,572 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 15:19:28,572 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 15:19:28,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 15:19:28,669 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-14 15:19:28,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 15:19:28,674 INFO L290 TraceCheckUtils]: 0: Hoare triple {5547#(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; {5535#true} is VALID [2022-04-14 15:19:28,675 INFO L290 TraceCheckUtils]: 1: Hoare triple {5535#true} assume true; {5535#true} is VALID [2022-04-14 15:19:28,675 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {5535#true} {5535#true} #102#return; {5535#true} is VALID [2022-04-14 15:19:28,675 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-14 15:19:28,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 15:19:28,678 INFO L290 TraceCheckUtils]: 0: Hoare triple {5535#true} ~cond := #in~cond; {5535#true} is VALID [2022-04-14 15:19:28,679 INFO L290 TraceCheckUtils]: 1: Hoare triple {5535#true} assume !(0 == ~cond); {5535#true} is VALID [2022-04-14 15:19:28,679 INFO L290 TraceCheckUtils]: 2: Hoare triple {5535#true} assume true; {5535#true} is VALID [2022-04-14 15:19:28,679 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5535#true} {5535#true} #82#return; {5535#true} is VALID [2022-04-14 15:19:28,680 INFO L272 TraceCheckUtils]: 0: Hoare triple {5535#true} call ULTIMATE.init(); {5547#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-14 15:19:28,680 INFO L290 TraceCheckUtils]: 1: Hoare triple {5547#(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; {5535#true} is VALID [2022-04-14 15:19:28,680 INFO L290 TraceCheckUtils]: 2: Hoare triple {5535#true} assume true; {5535#true} is VALID [2022-04-14 15:19:28,680 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5535#true} {5535#true} #102#return; {5535#true} is VALID [2022-04-14 15:19:28,680 INFO L272 TraceCheckUtils]: 4: Hoare triple {5535#true} call #t~ret7 := main(); {5535#true} is VALID [2022-04-14 15:19:28,680 INFO L290 TraceCheckUtils]: 5: Hoare triple {5535#true} havoc ~n~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~h~0;~n~0 := #t~nondet4;havoc #t~nondet4; {5535#true} is VALID [2022-04-14 15:19:28,680 INFO L272 TraceCheckUtils]: 6: Hoare triple {5535#true} call assume_abort_if_not((if ~n~0 % 4294967296 < 1073741823 then 1 else 0)); {5535#true} is VALID [2022-04-14 15:19:28,680 INFO L290 TraceCheckUtils]: 7: Hoare triple {5535#true} ~cond := #in~cond; {5535#true} is VALID [2022-04-14 15:19:28,680 INFO L290 TraceCheckUtils]: 8: Hoare triple {5535#true} assume !(0 == ~cond); {5535#true} is VALID [2022-04-14 15:19:28,681 INFO L290 TraceCheckUtils]: 9: Hoare triple {5535#true} assume true; {5535#true} is VALID [2022-04-14 15:19:28,681 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {5535#true} {5535#true} #82#return; {5535#true} is VALID [2022-04-14 15:19:28,681 INFO L290 TraceCheckUtils]: 11: Hoare triple {5535#true} ~p~0 := 0;~q~0 := 1;~r~0 := ~n~0;~h~0 := 0; {5535#true} is VALID [2022-04-14 15:19:28,681 INFO L290 TraceCheckUtils]: 12: Hoare triple {5535#true} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {5535#true} is VALID [2022-04-14 15:19:28,681 INFO L290 TraceCheckUtils]: 13: Hoare triple {5535#true} assume !!(#t~post5 < 5);havoc #t~post5; {5535#true} is VALID [2022-04-14 15:19:28,681 INFO L290 TraceCheckUtils]: 14: Hoare triple {5535#true} assume !!(~q~0 % 4294967296 <= ~n~0 % 4294967296);~q~0 := 4 * ~q~0; {5535#true} is VALID [2022-04-14 15:19:28,681 INFO L290 TraceCheckUtils]: 15: Hoare triple {5535#true} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {5535#true} is VALID [2022-04-14 15:19:28,681 INFO L290 TraceCheckUtils]: 16: Hoare triple {5535#true} assume !!(#t~post5 < 5);havoc #t~post5; {5535#true} is VALID [2022-04-14 15:19:28,681 INFO L290 TraceCheckUtils]: 17: Hoare triple {5535#true} assume !!(~q~0 % 4294967296 <= ~n~0 % 4294967296);~q~0 := 4 * ~q~0; {5535#true} is VALID [2022-04-14 15:19:28,681 INFO L290 TraceCheckUtils]: 18: Hoare triple {5535#true} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {5535#true} is VALID [2022-04-14 15:19:28,682 INFO L290 TraceCheckUtils]: 19: Hoare triple {5535#true} assume !!(#t~post5 < 5);havoc #t~post5; {5535#true} is VALID [2022-04-14 15:19:28,682 INFO L290 TraceCheckUtils]: 20: Hoare triple {5535#true} assume !!(~q~0 % 4294967296 <= ~n~0 % 4294967296);~q~0 := 4 * ~q~0; {5535#true} is VALID [2022-04-14 15:19:28,682 INFO L290 TraceCheckUtils]: 21: Hoare triple {5535#true} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {5535#true} is VALID [2022-04-14 15:19:28,682 INFO L290 TraceCheckUtils]: 22: Hoare triple {5535#true} assume !!(#t~post5 < 5);havoc #t~post5; {5535#true} is VALID [2022-04-14 15:19:28,682 INFO L290 TraceCheckUtils]: 23: Hoare triple {5535#true} assume !!(~q~0 % 4294967296 <= ~n~0 % 4294967296);~q~0 := 4 * ~q~0; {5535#true} is VALID [2022-04-14 15:19:28,682 INFO L290 TraceCheckUtils]: 24: Hoare triple {5535#true} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {5535#true} is VALID [2022-04-14 15:19:28,682 INFO L290 TraceCheckUtils]: 25: Hoare triple {5535#true} assume !!(#t~post5 < 5);havoc #t~post5; {5535#true} is VALID [2022-04-14 15:19:28,682 INFO L290 TraceCheckUtils]: 26: Hoare triple {5535#true} assume !!(~q~0 % 4294967296 <= ~n~0 % 4294967296);~q~0 := 4 * ~q~0; {5535#true} is VALID [2022-04-14 15:19:28,683 INFO L290 TraceCheckUtils]: 27: Hoare triple {5535#true} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {5544#(<= (+ |main_#t~post5| 1) ~counter~0)} is VALID [2022-04-14 15:19:28,684 INFO L290 TraceCheckUtils]: 28: Hoare triple {5544#(<= (+ |main_#t~post5| 1) ~counter~0)} assume !(#t~post5 < 5);havoc #t~post5; {5545#(<= 6 ~counter~0)} is VALID [2022-04-14 15:19:28,684 INFO L290 TraceCheckUtils]: 29: Hoare triple {5545#(<= 6 ~counter~0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {5546#(<= 6 |main_#t~post6|)} is VALID [2022-04-14 15:19:28,684 INFO L290 TraceCheckUtils]: 30: Hoare triple {5546#(<= 6 |main_#t~post6|)} assume !!(#t~post6 < 5);havoc #t~post6; {5536#false} is VALID [2022-04-14 15:19:28,685 INFO L272 TraceCheckUtils]: 31: Hoare triple {5536#false} call __VERIFIER_assert((if ~r~0 % 4294967296 < (2 * ~p~0 + ~q~0) % 4294967296 then 1 else 0)); {5536#false} is VALID [2022-04-14 15:19:28,685 INFO L290 TraceCheckUtils]: 32: Hoare triple {5536#false} ~cond := #in~cond; {5536#false} is VALID [2022-04-14 15:19:28,685 INFO L290 TraceCheckUtils]: 33: Hoare triple {5536#false} assume 0 == ~cond; {5536#false} is VALID [2022-04-14 15:19:28,685 INFO L290 TraceCheckUtils]: 34: Hoare triple {5536#false} assume !false; {5536#false} is VALID [2022-04-14 15:19:28,685 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2022-04-14 15:19:28,685 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 15:19:28,685 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [773711990] [2022-04-14 15:19:28,685 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [773711990] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-14 15:19:28,685 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-14 15:19:28,686 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-14 15:19:28,686 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1685664153] [2022-04-14 15:19:28,686 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-14 15:19:28,686 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 5 states have internal predecessors, (17), 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 35 [2022-04-14 15:19:28,686 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 15:19:28,687 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 5 states have internal predecessors, (17), 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:19:28,706 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:19:28,706 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-14 15:19:28,706 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 15:19:28,707 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-14 15:19:28,707 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-14 15:19:28,707 INFO L87 Difference]: Start difference. First operand 119 states and 149 transitions. Second operand has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 5 states have internal predecessors, (17), 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:19:36,702 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:43,482 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:45,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 15:19:45,884 INFO L93 Difference]: Finished difference Result 156 states and 198 transitions. [2022-04-14 15:19:45,884 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-14 15:19:45,884 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 5 states have internal predecessors, (17), 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 35 [2022-04-14 15:19:45,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-14 15:19:45,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 5 states have internal predecessors, (17), 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:19:45,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 78 transitions. [2022-04-14 15:19:45,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 5 states have internal predecessors, (17), 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:19:45,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 78 transitions. [2022-04-14 15:19:45,887 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 78 transitions. [2022-04-14 15:19:45,971 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:19:45,973 INFO L225 Difference]: With dead ends: 156 [2022-04-14 15:19:45,973 INFO L226 Difference]: Without dead ends: 116 [2022-04-14 15:19:45,974 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-04-14 15:19:45,974 INFO L913 BasicCegarLoop]: 42 mSDtfsCounter, 10 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 100 mSolverCounterSat, 12 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 106 SdHoareTripleChecker+Invalid, 114 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 100 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.6s IncrementalHoareTripleChecker+Time [2022-04-14 15:19:45,974 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [11 Valid, 106 Invalid, 114 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 100 Invalid, 2 Unknown, 0 Unchecked, 5.6s Time] [2022-04-14 15:19:45,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2022-04-14 15:19:46,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 111. [2022-04-14 15:19:46,035 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-14 15:19:46,036 INFO L82 GeneralOperation]: Start isEquivalent. First operand 116 states. Second operand has 111 states, 65 states have (on average 1.1384615384615384) internal successors, (74), 68 states have internal predecessors, (74), 33 states have call successors, (33), 13 states have call predecessors, (33), 12 states have return successors, (31), 29 states have call predecessors, (31), 31 states have call successors, (31) [2022-04-14 15:19:46,036 INFO L74 IsIncluded]: Start isIncluded. First operand 116 states. Second operand has 111 states, 65 states have (on average 1.1384615384615384) internal successors, (74), 68 states have internal predecessors, (74), 33 states have call successors, (33), 13 states have call predecessors, (33), 12 states have return successors, (31), 29 states have call predecessors, (31), 31 states have call successors, (31) [2022-04-14 15:19:46,037 INFO L87 Difference]: Start difference. First operand 116 states. Second operand has 111 states, 65 states have (on average 1.1384615384615384) internal successors, (74), 68 states have internal predecessors, (74), 33 states have call successors, (33), 13 states have call predecessors, (33), 12 states have return successors, (31), 29 states have call predecessors, (31), 31 states have call successors, (31) [2022-04-14 15:19:46,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 15:19:46,040 INFO L93 Difference]: Finished difference Result 116 states and 144 transitions. [2022-04-14 15:19:46,040 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 144 transitions. [2022-04-14 15:19:46,040 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 15:19:46,041 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 15:19:46,041 INFO L74 IsIncluded]: Start isIncluded. First operand has 111 states, 65 states have (on average 1.1384615384615384) internal successors, (74), 68 states have internal predecessors, (74), 33 states have call successors, (33), 13 states have call predecessors, (33), 12 states have return successors, (31), 29 states have call predecessors, (31), 31 states have call successors, (31) Second operand 116 states. [2022-04-14 15:19:46,041 INFO L87 Difference]: Start difference. First operand has 111 states, 65 states have (on average 1.1384615384615384) internal successors, (74), 68 states have internal predecessors, (74), 33 states have call successors, (33), 13 states have call predecessors, (33), 12 states have return successors, (31), 29 states have call predecessors, (31), 31 states have call successors, (31) Second operand 116 states. [2022-04-14 15:19:46,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 15:19:46,044 INFO L93 Difference]: Finished difference Result 116 states and 144 transitions. [2022-04-14 15:19:46,044 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 144 transitions. [2022-04-14 15:19:46,045 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 15:19:46,045 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 15:19:46,045 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-14 15:19:46,045 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-14 15:19:46,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 65 states have (on average 1.1384615384615384) internal successors, (74), 68 states have internal predecessors, (74), 33 states have call successors, (33), 13 states have call predecessors, (33), 12 states have return successors, (31), 29 states have call predecessors, (31), 31 states have call successors, (31) [2022-04-14 15:19:46,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 138 transitions. [2022-04-14 15:19:46,049 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 138 transitions. Word has length 35 [2022-04-14 15:19:46,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-14 15:19:46,049 INFO L478 AbstractCegarLoop]: Abstraction has 111 states and 138 transitions. [2022-04-14 15:19:46,049 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 5 states have internal predecessors, (17), 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:19:46,049 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 138 transitions. [2022-04-14 15:19:46,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-04-14 15:19:46,050 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 15:19:46,050 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:19:46,050 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-04-14 15:19:46,050 INFO L403 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 15:19:46,051 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 15:19:46,051 INFO L85 PathProgramCache]: Analyzing trace with hash 109392637, now seen corresponding path program 1 times [2022-04-14 15:19:46,051 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 15:19:46,051 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [506526850] [2022-04-14 15:19:46,051 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 15:19:46,051 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 15:19:46,062 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-14 15:19:46,062 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1653313966] [2022-04-14 15:19:46,062 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 15:19:46,062 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-14 15:19:46,063 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-14 15:19:46,068 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:19:46,069 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process