/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-MCRwithDepranks.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread/fib_unsafe-5.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.mcr-reduction-44898dd [2022-02-16 02:30:52,204 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-16 02:30:52,206 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-16 02:30:52,255 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-16 02:30:52,255 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-16 02:30:52,270 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-16 02:30:52,274 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-16 02:30:52,276 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-16 02:30:52,277 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-16 02:30:52,281 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-16 02:30:52,281 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-16 02:30:52,282 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-16 02:30:52,283 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-16 02:30:52,284 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-16 02:30:52,285 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-16 02:30:52,287 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-16 02:30:52,288 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-16 02:30:52,289 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-16 02:30:52,291 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-16 02:30:52,295 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-16 02:30:52,296 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-16 02:30:52,297 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-16 02:30:52,298 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-16 02:30:52,299 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-16 02:30:52,304 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-16 02:30:52,304 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-16 02:30:52,305 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-16 02:30:52,306 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-16 02:30:52,306 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-16 02:30:52,306 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-16 02:30:52,307 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-16 02:30:52,307 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-16 02:30:52,308 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-16 02:30:52,309 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-16 02:30:52,310 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-16 02:30:52,310 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-16 02:30:52,310 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-16 02:30:52,310 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-16 02:30:52,311 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-16 02:30:52,311 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-16 02:30:52,312 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-16 02:30:52,312 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-MCRwithDepranks.epf [2022-02-16 02:30:52,341 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-16 02:30:52,341 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-16 02:30:52,342 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-16 02:30:52,342 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-16 02:30:52,342 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-16 02:30:52,343 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-16 02:30:52,343 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-16 02:30:52,343 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-16 02:30:52,343 INFO L138 SettingsManager]: * Use SBE=true [2022-02-16 02:30:52,343 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-16 02:30:52,344 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-16 02:30:52,344 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-16 02:30:52,344 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-16 02:30:52,344 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-16 02:30:52,344 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-16 02:30:52,344 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-16 02:30:52,344 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-16 02:30:52,345 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-16 02:30:52,345 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-16 02:30:52,345 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-16 02:30:52,345 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-16 02:30:52,345 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-16 02:30:52,345 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-16 02:30:52,345 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-02-16 02:30:52,346 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-16 02:30:52,346 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-16 02:30:52,347 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-16 02:30:52,347 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-16 02:30:52,347 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-16 02:30:52,347 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-16 02:30:52,347 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-16 02:30:52,347 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-16 02:30:52,347 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2022-02-16 02:30:52,347 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-16 02:30:52,348 INFO L138 SettingsManager]: * Partial Order Reduction in concurrent analysis=MCR_WITH_DEPRANKS [2022-02-16 02:30:52,348 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 [2022-02-16 02:30:52,555 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-16 02:30:52,573 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-16 02:30:52,575 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-16 02:30:52,576 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-16 02:30:52,577 INFO L275 PluginConnector]: CDTParser initialized [2022-02-16 02:30:52,578 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread/fib_unsafe-5.i [2022-02-16 02:30:52,624 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b33d1cf52/631e882365824ec7803b349eae88f23c/FLAG85f6285c5 [2022-02-16 02:30:53,192 INFO L306 CDTParser]: Found 1 translation units. [2022-02-16 02:30:53,192 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread/fib_unsafe-5.i [2022-02-16 02:30:53,218 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b33d1cf52/631e882365824ec7803b349eae88f23c/FLAG85f6285c5 [2022-02-16 02:30:53,486 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b33d1cf52/631e882365824ec7803b349eae88f23c [2022-02-16 02:30:53,489 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-16 02:30:53,492 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-02-16 02:30:53,496 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-16 02:30:53,496 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-16 02:30:53,502 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-16 02:30:53,502 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.02 02:30:53" (1/1) ... [2022-02-16 02:30:53,503 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3ee0e4fc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 02:30:53, skipping insertion in model container [2022-02-16 02:30:53,503 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.02 02:30:53" (1/1) ... [2022-02-16 02:30:53,508 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-16 02:30:53,578 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-16 02:30:54,029 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread/fib_unsafe-5.i[30819,30832] [2022-02-16 02:30:54,032 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-16 02:30:54,036 INFO L203 MainTranslator]: Completed pre-run [2022-02-16 02:30:54,093 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread/fib_unsafe-5.i[30819,30832] [2022-02-16 02:30:54,094 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-16 02:30:54,145 INFO L208 MainTranslator]: Completed translation [2022-02-16 02:30:54,146 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 02:30:54 WrapperNode [2022-02-16 02:30:54,146 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-16 02:30:54,147 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-16 02:30:54,147 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-16 02:30:54,147 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-16 02:30:54,152 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 02:30:54" (1/1) ... [2022-02-16 02:30:54,168 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 02:30:54" (1/1) ... [2022-02-16 02:30:54,202 INFO L137 Inliner]: procedures = 164, calls = 26, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 71 [2022-02-16 02:30:54,202 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-16 02:30:54,203 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-16 02:30:54,203 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-16 02:30:54,203 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-16 02:30:54,208 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 02:30:54" (1/1) ... [2022-02-16 02:30:54,208 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 02:30:54" (1/1) ... [2022-02-16 02:30:54,210 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 02:30:54" (1/1) ... [2022-02-16 02:30:54,210 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 02:30:54" (1/1) ... [2022-02-16 02:30:54,214 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 02:30:54" (1/1) ... [2022-02-16 02:30:54,217 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 02:30:54" (1/1) ... [2022-02-16 02:30:54,218 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 02:30:54" (1/1) ... [2022-02-16 02:30:54,219 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-16 02:30:54,220 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-16 02:30:54,220 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-16 02:30:54,220 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-16 02:30:54,221 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 02:30:54" (1/1) ... [2022-02-16 02:30:54,228 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-16 02:30:54,237 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-16 02:30:54,248 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-02-16 02:30:54,255 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-02-16 02:30:54,286 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2022-02-16 02:30:54,287 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2022-02-16 02:30:54,287 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2022-02-16 02:30:54,287 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2022-02-16 02:30:54,287 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-02-16 02:30:54,287 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-02-16 02:30:54,287 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-16 02:30:54,287 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-02-16 02:30:54,287 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-02-16 02:30:54,287 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-16 02:30:54,287 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-02-16 02:30:54,288 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-16 02:30:54,288 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-16 02:30:54,289 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-02-16 02:30:54,376 INFO L234 CfgBuilder]: Building ICFG [2022-02-16 02:30:54,378 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-16 02:30:54,518 INFO L275 CfgBuilder]: Performing block encoding [2022-02-16 02:30:54,523 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-16 02:30:54,523 INFO L299 CfgBuilder]: Removed 3 assume(true) statements. [2022-02-16 02:30:54,524 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.02 02:30:54 BoogieIcfgContainer [2022-02-16 02:30:54,525 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-16 02:30:54,526 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-16 02:30:54,526 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-16 02:30:54,534 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-16 02:30:54,535 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.02 02:30:53" (1/3) ... [2022-02-16 02:30:54,535 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@24d672fe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.02 02:30:54, skipping insertion in model container [2022-02-16 02:30:54,536 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 02:30:54" (2/3) ... [2022-02-16 02:30:54,536 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@24d672fe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.02 02:30:54, skipping insertion in model container [2022-02-16 02:30:54,536 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.02 02:30:54" (3/3) ... [2022-02-16 02:30:54,537 INFO L111 eAbstractionObserver]: Analyzing ICFG fib_unsafe-5.i [2022-02-16 02:30:54,541 WARN L150 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-02-16 02:30:54,541 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-16 02:30:54,542 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-02-16 02:30:54,542 INFO L534 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-02-16 02:30:54,573 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-16 02:30:54,573 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-16 02:30:54,573 WARN L322 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-16 02:30:54,573 WARN L322 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-16 02:30:54,573 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-16 02:30:54,574 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-16 02:30:54,574 WARN L322 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-16 02:30:54,574 WARN L322 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-16 02:30:54,577 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-16 02:30:54,578 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-16 02:30:54,578 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-16 02:30:54,578 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-16 02:30:54,578 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~post1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-16 02:30:54,578 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~post1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-16 02:30:54,578 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~post1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-16 02:30:54,579 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~post1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-16 02:30:54,579 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~post1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-16 02:30:54,579 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~post1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-16 02:30:54,579 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-16 02:30:54,579 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-16 02:30:54,579 WARN L322 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-16 02:30:54,580 WARN L322 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-16 02:30:54,580 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-16 02:30:54,580 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-16 02:30:54,580 WARN L322 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-16 02:30:54,580 WARN L322 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-16 02:30:54,580 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-16 02:30:54,581 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-16 02:30:54,581 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-16 02:30:54,581 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-16 02:30:54,581 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~post2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-16 02:30:54,581 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~post2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-16 02:30:54,581 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~post2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-16 02:30:54,581 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~post2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-16 02:30:54,582 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~post2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-16 02:30:54,582 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~post2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-16 02:30:54,584 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~post1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-16 02:30:54,584 WARN L322 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-16 02:30:54,585 WARN L322 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-16 02:30:54,585 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-16 02:30:54,585 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-16 02:30:54,586 WARN L322 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-16 02:30:54,587 WARN L322 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-16 02:30:54,587 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-16 02:30:54,587 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~post2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-16 02:30:54,587 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-16 02:30:54,587 INFO L148 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-02-16 02:30:54,617 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2022-02-16 02:30:54,617 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-16 02:30:54,634 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2022-02-16 02:30:54,638 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Waiting until timeout for monitored process [2022-02-16 02:30:54,657 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-16 02:30:54,661 INFO L339 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=PARTIAL_ORDER_FA, mLazyFiniteAutomaton=false, 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, mLoopAccelerationTechnique=FAST_UPR [2022-02-16 02:30:54,661 INFO L340 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2022-02-16 02:30:54,669 INFO L111 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 96 places, 96 transitions, 202 flow [2022-02-16 02:30:54,771 INFO L133 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 2292 states, 2291 states have (on average 3.185508511567001) internal successors, (7298), 2291 states have internal predecessors, (7298), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-16 02:30:54,795 INFO L104 alCausalityReduction]: MaximalCausalityReduction evaluated 91 transitions and produced 92 states. [2022-02-16 02:30:54,797 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-02-16 02:30:54,804 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-16 02:30:54,805 INFO L85 PathProgramCache]: Analyzing trace with hash -1927097680, now seen corresponding path program 1 times [2022-02-16 02:30:54,811 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-16 02:30:54,811 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1700354162] [2022-02-16 02:30:54,811 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-16 02:30:54,812 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-16 02:30:54,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-16 02:30:54,990 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-16 02:30:54,990 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-16 02:30:54,990 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1700354162] [2022-02-16 02:30:54,991 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1700354162] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-16 02:30:54,991 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-16 02:30:54,991 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-16 02:30:54,992 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1419337044] [2022-02-16 02:30:54,993 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-16 02:30:54,994 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-02-16 02:30:54,994 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-16 02:30:55,011 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-02-16 02:30:55,012 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-02-16 02:30:55,013 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-16 02:30:55,015 INFO L470 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-02-16 02:30:55,015 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 26.5) internal successors, (53), 2 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-16 02:30:55,015 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-02-16 02:30:55,035 INFO L104 alCausalityReduction]: MaximalCausalityReduction evaluated 91 transitions and produced 92 states. [2022-02-16 02:30:55,036 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-16 02:30:55,036 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-16 02:30:55,036 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-02-16 02:30:55,037 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-16 02:30:55,037 INFO L85 PathProgramCache]: Analyzing trace with hash 560415153, now seen corresponding path program 1 times [2022-02-16 02:30:55,037 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-16 02:30:55,037 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1107877859] [2022-02-16 02:30:55,037 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-16 02:30:55,037 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-16 02:30:55,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-16 02:30:55,112 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-16 02:30:55,113 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-16 02:30:55,113 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1107877859] [2022-02-16 02:30:55,113 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1107877859] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-16 02:30:55,113 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-16 02:30:55,113 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-16 02:30:55,113 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [659337196] [2022-02-16 02:30:55,113 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-16 02:30:55,114 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-16 02:30:55,114 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-16 02:30:55,115 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-16 02:30:55,115 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-16 02:30:55,115 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-16 02:30:55,115 INFO L470 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-02-16 02:30:55,115 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-16 02:30:55,115 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-02-16 02:30:55,116 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-02-16 02:30:55,151 INFO L104 alCausalityReduction]: MaximalCausalityReduction evaluated 114 transitions and produced 115 states. [2022-02-16 02:30:55,151 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-16 02:30:55,152 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-16 02:30:55,153 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-02-16 02:30:55,153 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-02-16 02:30:55,153 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-16 02:30:55,153 INFO L85 PathProgramCache]: Analyzing trace with hash -951035470, now seen corresponding path program 1 times [2022-02-16 02:30:55,153 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-16 02:30:55,154 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1425536706] [2022-02-16 02:30:55,154 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-16 02:30:55,154 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-16 02:30:55,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-16 02:30:55,228 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-16 02:30:55,228 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-16 02:30:55,228 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1425536706] [2022-02-16 02:30:55,228 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1425536706] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-16 02:30:55,229 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [709792393] [2022-02-16 02:30:55,229 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-16 02:30:55,229 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-16 02:30:55,229 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-16 02:30:55,260 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-02-16 02:30:55,315 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-02-16 02:30:55,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-16 02:30:55,396 INFO L263 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 4 conjunts are in the unsatisfiable core [2022-02-16 02:30:55,402 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-16 02:30:55,565 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-16 02:30:55,565 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-16 02:30:55,682 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-16 02:30:55,682 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [709792393] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-16 02:30:55,682 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-16 02:30:55,683 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2022-02-16 02:30:55,683 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [374883715] [2022-02-16 02:30:55,683 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-16 02:30:55,684 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-02-16 02:30:55,685 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-16 02:30:55,685 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-02-16 02:30:55,686 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2022-02-16 02:30:55,686 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-16 02:30:55,686 INFO L470 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-02-16 02:30:55,686 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.6) internal successors, (76), 10 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-16 02:30:55,686 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-02-16 02:30:55,686 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-02-16 02:30:55,686 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-02-16 02:30:55,802 INFO L104 alCausalityReduction]: MaximalCausalityReduction evaluated 160 transitions and produced 161 states. [2022-02-16 02:30:55,803 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-16 02:30:55,803 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-16 02:30:55,803 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-02-16 02:30:55,820 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-02-16 02:30:56,019 WARN L452 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-02-16 02:30:56,020 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-02-16 02:30:56,020 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-16 02:30:56,020 INFO L85 PathProgramCache]: Analyzing trace with hash 1666707666, now seen corresponding path program 2 times [2022-02-16 02:30:56,020 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-16 02:30:56,021 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1627493599] [2022-02-16 02:30:56,021 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-16 02:30:56,021 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-16 02:30:56,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-16 02:30:56,112 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-16 02:30:56,113 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-16 02:30:56,113 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1627493599] [2022-02-16 02:30:56,113 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1627493599] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-16 02:30:56,113 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1365974832] [2022-02-16 02:30:56,113 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-02-16 02:30:56,113 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-16 02:30:56,114 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-16 02:30:56,115 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-02-16 02:30:56,116 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-02-16 02:30:56,179 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-02-16 02:30:56,179 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-16 02:30:56,180 INFO L263 TraceCheckSpWp]: Trace formula consists of 176 conjuncts, 8 conjunts are in the unsatisfiable core [2022-02-16 02:30:56,182 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-16 02:30:56,297 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-16 02:30:56,297 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-16 02:30:56,427 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-16 02:30:56,427 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1365974832] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-16 02:30:56,428 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-16 02:30:56,428 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 18 [2022-02-16 02:30:56,428 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [899728312] [2022-02-16 02:30:56,428 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-16 02:30:56,429 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-02-16 02:30:56,429 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-16 02:30:56,429 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-02-16 02:30:56,430 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=216, Unknown=0, NotChecked=0, Total=306 [2022-02-16 02:30:56,430 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-16 02:30:56,430 INFO L470 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-02-16 02:30:56,430 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 5.777777777777778) internal successors, (104), 18 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-16 02:30:56,431 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-02-16 02:30:56,431 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-02-16 02:30:56,431 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2022-02-16 02:30:56,431 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-02-16 02:30:56,576 INFO L104 alCausalityReduction]: MaximalCausalityReduction evaluated 252 transitions and produced 249 states. [2022-02-16 02:30:56,576 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-16 02:30:56,576 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-16 02:30:56,576 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-02-16 02:30:56,577 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-02-16 02:30:56,597 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-02-16 02:30:56,797 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-16 02:30:56,797 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-02-16 02:30:56,798 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-16 02:30:56,798 INFO L85 PathProgramCache]: Analyzing trace with hash -1283180782, now seen corresponding path program 3 times [2022-02-16 02:30:56,798 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-16 02:30:56,798 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [913361204] [2022-02-16 02:30:56,798 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-16 02:30:56,798 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-16 02:30:56,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-16 02:30:56,938 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 0 proven. 154 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-16 02:30:56,938 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-16 02:30:56,938 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [913361204] [2022-02-16 02:30:56,938 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [913361204] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-16 02:30:56,938 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1583422190] [2022-02-16 02:30:56,938 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-02-16 02:30:56,939 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-16 02:30:56,939 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-16 02:30:56,941 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-02-16 02:30:56,942 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-02-16 02:30:57,036 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2022-02-16 02:30:57,036 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-16 02:30:57,037 INFO L263 TraceCheckSpWp]: Trace formula consists of 224 conjuncts, 16 conjunts are in the unsatisfiable core [2022-02-16 02:30:57,039 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-16 02:30:57,214 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 0 proven. 154 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-16 02:30:57,214 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-16 02:30:57,418 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 0 proven. 154 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-16 02:30:57,419 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1583422190] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-16 02:30:57,419 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-16 02:30:57,419 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 27 [2022-02-16 02:30:57,419 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1727204249] [2022-02-16 02:30:57,419 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-16 02:30:57,420 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-02-16 02:30:57,420 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-16 02:30:57,421 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-02-16 02:30:57,422 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=195, Invalid=507, Unknown=0, NotChecked=0, Total=702 [2022-02-16 02:30:57,422 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-16 02:30:57,422 INFO L470 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-02-16 02:30:57,422 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 5.148148148148148) internal successors, (139), 27 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-16 02:30:57,422 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-02-16 02:30:57,422 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-02-16 02:30:57,422 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2022-02-16 02:30:57,422 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2022-02-16 02:30:57,422 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-02-16 02:30:57,745 INFO L104 alCausalityReduction]: MaximalCausalityReduction evaluated 367 transitions and produced 355 states. [2022-02-16 02:30:57,746 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-16 02:30:57,746 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-16 02:30:57,746 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-02-16 02:30:57,746 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-02-16 02:30:57,746 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2022-02-16 02:30:57,766 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-02-16 02:30:57,963 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-16 02:30:57,963 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-02-16 02:30:57,963 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-16 02:30:57,964 INFO L85 PathProgramCache]: Analyzing trace with hash 1938020081, now seen corresponding path program 4 times [2022-02-16 02:30:57,964 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-16 02:30:57,964 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [752856423] [2022-02-16 02:30:57,964 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-16 02:30:57,964 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-16 02:30:58,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-16 02:30:59,058 INFO L134 CoverageAnalysis]: Checked inductivity of 474 backedges. 0 proven. 474 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-16 02:30:59,058 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-16 02:30:59,059 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [752856423] [2022-02-16 02:30:59,059 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [752856423] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-16 02:30:59,059 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1335832246] [2022-02-16 02:30:59,059 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-02-16 02:30:59,059 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-16 02:30:59,059 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-16 02:30:59,076 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-02-16 02:30:59,124 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-02-16 02:30:59,165 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-02-16 02:30:59,166 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-16 02:30:59,167 INFO L263 TraceCheckSpWp]: Trace formula consists of 267 conjuncts, 41 conjunts are in the unsatisfiable core [2022-02-16 02:30:59,170 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-16 02:31:01,754 INFO L134 CoverageAnalysis]: Checked inductivity of 474 backedges. 335 proven. 139 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-16 02:31:01,755 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-16 02:37:00,035 INFO L134 CoverageAnalysis]: Checked inductivity of 474 backedges. 0 proven. 472 refuted. 2 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-16 02:37:00,035 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1335832246] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-16 02:37:00,035 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-16 02:37:00,038 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [42, 42, 42] total 121 [2022-02-16 02:37:00,038 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [71918233] [2022-02-16 02:37:00,038 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-16 02:37:00,040 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 121 states [2022-02-16 02:37:00,041 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-16 02:37:00,056 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 121 interpolants. [2022-02-16 02:37:00,059 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=946, Invalid=13505, Unknown=69, NotChecked=0, Total=14520 [2022-02-16 02:37:00,060 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-16 02:37:00,060 INFO L470 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-02-16 02:37:00,060 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 121 states, 121 states have (on average 3.15702479338843) internal successors, (382), 121 states have internal predecessors, (382), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-16 02:37:00,060 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-02-16 02:37:00,060 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-02-16 02:37:00,060 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2022-02-16 02:37:00,060 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2022-02-16 02:37:00,060 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 36 states. [2022-02-16 02:37:00,061 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-02-16 02:37:13,689 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse5 (* (- 1) c_~j~0)) (.cse8 (* (- 1) c_~i~0)) (.cse22 (* 2 c_~cur~0))) (let ((.cse4 (+ c_~prev~0 c_~next~0)) (.cse9 (+ .cse22 3 c_~prev~0)) (.cse11 (+ .cse22 c_~prev~0)) (.cse6 (+ c_~next~0 1)) (.cse10 (div (+ (- 3) .cse8 c_~cur~0) (- 2))) (.cse12 (div (+ .cse8 c_~next~0 (- 5)) (- 2))) (.cse3 (+ 2 c_~prev~0 c_~next~0)) (.cse7 (+ (* 2 c_~next~0) 4 c_~cur~0)) (.cse2 (div (+ .cse5 c_~next~0 (- 5)) (- 2))) (.cse13 (+ 2 c_~next~0 c_~cur~0)) (.cse18 (div (+ (- 3) .cse5 c_~cur~0) (- 2))) (.cse20 (+ c_~prev~0 1 c_~cur~0)) (.cse17 (+ c_~prev~0 c_~cur~0)) (.cse15 (+ c_~next~0 c_~cur~0))) (and (forall ((v_~cur~0_26 Int)) (or (and (forall ((aux_mod_v_~cur~0_22_51 Int) (aux_div_v_~next~0_20_56 Int) (aux_div_v_~cur~0_22_51 Int) (v_~prev~0_24 Int) (aux_mod_v_~next~0_20_56 Int)) (let ((.cse0 (* 2 v_~cur~0_26))) (or (< v_~prev~0_24 (+ v_~cur~0_26 c_~cur~0)) (>= aux_mod_v_~cur~0_22_51 2) (< (+ aux_mod_v_~next~0_20_56 c_~j~0 (* 2 aux_mod_v_~cur~0_22_51) 11) (+ .cse0 (* v_~prev~0_24 3) (* aux_div_v_~cur~0_22_51 4) (* 2 aux_div_v_~next~0_20_56) c_~cur~0)) (>= aux_mod_v_~next~0_20_56 2) (<= (+ (* 5 aux_div_v_~next~0_20_56) (* 2 aux_div_v_~cur~0_22_51) v_~prev~0_24) (+ 23 aux_mod_v_~cur~0_22_51 (* 2 c_~j~0) (* aux_mod_v_~next~0_20_56 2))) (> 0 aux_mod_v_~cur~0_22_51) (< aux_div_v_~cur~0_22_51 (+ .cse0 1 c_~cur~0)) (> 0 aux_mod_v_~next~0_20_56)))) (forall ((aux_mod_v_~cur~0_22_51 Int) (aux_div_v_~next~0_20_56 Int) (aux_div_v_~cur~0_22_51 Int) (v_~prev~0_24 Int) (aux_mod_v_~next~0_20_56 Int)) (let ((.cse1 (* 2 v_~cur~0_26))) (or (< v_~prev~0_24 (+ v_~cur~0_26 c_~cur~0)) (>= aux_mod_v_~cur~0_22_51 2) (>= aux_mod_v_~next~0_20_56 2) (< (+ aux_mod_v_~next~0_20_56 c_~i~0 (* 2 aux_mod_v_~cur~0_22_51) 11) (+ .cse1 (* v_~prev~0_24 3) (* aux_div_v_~cur~0_22_51 4) (* 2 aux_div_v_~next~0_20_56) c_~cur~0)) (<= (+ (* 5 aux_div_v_~next~0_20_56) (* 2 aux_div_v_~cur~0_22_51) v_~prev~0_24) (+ 23 aux_mod_v_~cur~0_22_51 (* 2 c_~i~0) (* aux_mod_v_~next~0_20_56 2))) (> 0 aux_mod_v_~cur~0_22_51) (< aux_div_v_~cur~0_22_51 (+ .cse1 1 c_~cur~0)) (> 0 aux_mod_v_~next~0_20_56))))) (< v_~cur~0_26 (+ c_~prev~0 c_~cur~0)))) (< c_~i~0 c_~cur~0) (<= .cse2 .cse3) (< c_~j~0 .cse4) (< (div (+ (- 1) c_~prev~0 .cse5) (- 2)) .cse6) (<= (div (+ (- 9) .cse5 c_~next~0 c_~cur~0) (- 2)) .cse7) (< c_~j~0 |c_ULTIMATE.start_main_~correct~0#1|) (<= (div (+ (- 7) c_~prev~0 .cse8 c_~cur~0) (- 2)) .cse9) (< c_~i~0 .cse4) (forall ((v_~prev~0_24 Int)) (or (not (<= c_~cur~0 v_~prev~0_24)) (and (forall ((aux_mod_v_~cur~0_22_51 Int) (aux_div_v_~next~0_20_56 Int) (aux_div_v_~cur~0_22_51 Int) (aux_mod_v_~next~0_20_56 Int)) (or (< (+ aux_mod_v_~next~0_20_56 c_~i~0 (* 2 aux_mod_v_~cur~0_22_51) 11) (+ (* v_~prev~0_24 3) (* aux_div_v_~cur~0_22_51 4) c_~prev~0 (* 2 aux_div_v_~next~0_20_56) c_~cur~0)) (>= aux_mod_v_~cur~0_22_51 2) (< aux_div_v_~cur~0_22_51 (+ c_~prev~0 1 c_~cur~0)) (>= aux_mod_v_~next~0_20_56 2) (<= (+ (* 5 aux_div_v_~next~0_20_56) (* 2 aux_div_v_~cur~0_22_51) v_~prev~0_24) (+ 23 aux_mod_v_~cur~0_22_51 (* 2 c_~i~0) (* aux_mod_v_~next~0_20_56 2))) (> 0 aux_mod_v_~cur~0_22_51) (> 0 aux_mod_v_~next~0_20_56))) (forall ((aux_mod_v_~cur~0_22_51 Int) (aux_div_v_~next~0_20_56 Int) (aux_div_v_~cur~0_22_51 Int) (aux_mod_v_~next~0_20_56 Int)) (or (< (+ aux_mod_v_~next~0_20_56 c_~j~0 (* 2 aux_mod_v_~cur~0_22_51) 11) (+ (* v_~prev~0_24 3) (* aux_div_v_~cur~0_22_51 4) c_~prev~0 (* 2 aux_div_v_~next~0_20_56) c_~cur~0)) (>= aux_mod_v_~cur~0_22_51 2) (< aux_div_v_~cur~0_22_51 (+ c_~prev~0 1 c_~cur~0)) (>= aux_mod_v_~next~0_20_56 2) (<= (+ (* 5 aux_div_v_~next~0_20_56) (* 2 aux_div_v_~cur~0_22_51) v_~prev~0_24) (+ 23 aux_mod_v_~cur~0_22_51 (* 2 c_~j~0) (* aux_mod_v_~next~0_20_56 2))) (> 0 aux_mod_v_~cur~0_22_51) (> 0 aux_mod_v_~next~0_20_56)))))) (<= .cse10 .cse6) (< c_~i~0 c_~next~0) (< c_~i~0 .cse11) (<= .cse12 .cse13) (< c_~i~0 |c_ULTIMATE.start_main_~correct~0#1|) (forall ((aux_mod_v_~cur~0_22_51 Int) (aux_div_v_~next~0_20_56 Int) (aux_div_v_~cur~0_22_51 Int) (v_~prev~0_24 Int) (aux_mod_v_~next~0_20_56 Int)) (let ((.cse14 (* 2 c_~cur~0))) (or (< v_~prev~0_24 (+ c_~prev~0 c_~cur~0)) (< (+ aux_mod_v_~next~0_20_56 c_~i~0 (* 2 aux_mod_v_~cur~0_22_51) 11) (+ .cse14 (* v_~prev~0_24 3) (* aux_div_v_~cur~0_22_51 4) c_~prev~0 (* 2 aux_div_v_~next~0_20_56))) (>= aux_mod_v_~cur~0_22_51 2) (>= aux_mod_v_~next~0_20_56 2) (<= (+ (* 5 aux_div_v_~next~0_20_56) (* 2 aux_div_v_~cur~0_22_51) v_~prev~0_24) (+ 23 aux_mod_v_~cur~0_22_51 (* 2 c_~i~0) (* aux_mod_v_~next~0_20_56 2))) (> 0 aux_mod_v_~cur~0_22_51) (< aux_div_v_~cur~0_22_51 (+ .cse14 c_~prev~0 1)) (> 0 aux_mod_v_~next~0_20_56)))) (<= (div (+ (- 7) c_~prev~0 .cse5 c_~cur~0) (- 2)) .cse9) (< c_~j~0 .cse15) (forall ((v_~cur~0_22 Int)) (or (< v_~cur~0_22 (+ c_~prev~0 c_~cur~0)) (and (forall ((aux_div_v_~next~0_20_56 Int) (aux_mod_v_~next~0_20_56 Int)) (or (< (+ aux_mod_v_~next~0_20_56 c_~j~0 9) (+ (* 2 v_~cur~0_22) (* 2 aux_div_v_~next~0_20_56) c_~cur~0)) (<= (+ (* 5 aux_div_v_~next~0_20_56) v_~cur~0_22) (+ 22 (* 2 c_~j~0) (* aux_mod_v_~next~0_20_56 2))) (>= aux_mod_v_~next~0_20_56 2) (> 0 aux_mod_v_~next~0_20_56))) (forall ((aux_div_v_~next~0_20_56 Int) (aux_mod_v_~next~0_20_56 Int)) (or (< (+ aux_mod_v_~next~0_20_56 9 c_~i~0) (+ (* 2 v_~cur~0_22) (* 2 aux_div_v_~next~0_20_56) c_~cur~0)) (>= aux_mod_v_~next~0_20_56 2) (<= (+ (* 5 aux_div_v_~next~0_20_56) v_~cur~0_22) (+ 22 (* 2 c_~i~0) (* aux_mod_v_~next~0_20_56 2))) (> 0 aux_mod_v_~next~0_20_56)))))) (< c_~i~0 |c_ULTIMATE.start_fib_#res#1|) (forall ((aux_mod_v_~cur~0_22_51 Int) (aux_div_v_~next~0_20_56 Int) (aux_div_v_~cur~0_22_51 Int) (v_~prev~0_24 Int) (aux_mod_v_~next~0_20_56 Int)) (let ((.cse16 (* 2 c_~cur~0))) (or (< v_~prev~0_24 (+ c_~prev~0 c_~cur~0)) (>= aux_mod_v_~cur~0_22_51 2) (>= aux_mod_v_~next~0_20_56 2) (<= (+ (* 5 aux_div_v_~next~0_20_56) (* 2 aux_div_v_~cur~0_22_51) v_~prev~0_24) (+ 23 aux_mod_v_~cur~0_22_51 (* 2 c_~j~0) (* aux_mod_v_~next~0_20_56 2))) (> 0 aux_mod_v_~cur~0_22_51) (< aux_div_v_~cur~0_22_51 (+ .cse16 c_~prev~0 1)) (< (+ aux_mod_v_~next~0_20_56 c_~j~0 (* 2 aux_mod_v_~cur~0_22_51) 11) (+ .cse16 (* v_~prev~0_24 3) (* aux_div_v_~cur~0_22_51 4) c_~prev~0 (* 2 aux_div_v_~next~0_20_56))) (> 0 aux_mod_v_~next~0_20_56)))) (< c_~j~0 .cse11) (< (div (+ (- 1) c_~prev~0 .cse8) (- 2)) .cse6) (< c_~j~0 .cse17) (<= .cse18 .cse6) (< c_~j~0 |c_ULTIMATE.start_fib_#res#1|) (<= 0 c_~prev~0) (forall ((aux_mod_v_~cur~0_22_51 Int) (aux_div_v_~next~0_20_56 Int) (aux_div_v_~cur~0_22_51 Int) (v_~prev~0_24 Int) (v_~cur~0_26 Int) (aux_mod_v_~next~0_20_56 Int)) (let ((.cse19 (* 2 v_~cur~0_26))) (or (>= aux_mod_v_~cur~0_22_51 2) (>= aux_mod_v_~next~0_20_56 2) (< v_~prev~0_24 (+ c_~prev~0 v_~cur~0_26 c_~cur~0)) (< aux_div_v_~cur~0_22_51 (+ .cse19 c_~prev~0 1 c_~cur~0)) (<= (+ (* 5 aux_div_v_~next~0_20_56) (* 2 aux_div_v_~cur~0_22_51) v_~prev~0_24) (+ 23 aux_mod_v_~cur~0_22_51 (* 2 c_~j~0) (* aux_mod_v_~next~0_20_56 2))) (> 0 aux_mod_v_~cur~0_22_51) (< (+ aux_mod_v_~next~0_20_56 c_~j~0 (* 2 aux_mod_v_~cur~0_22_51) 11) (+ .cse19 (* v_~prev~0_24 3) (* aux_div_v_~cur~0_22_51 4) c_~prev~0 (* 2 aux_div_v_~next~0_20_56) c_~cur~0)) (< v_~cur~0_26 (+ (* 2 c_~cur~0) c_~prev~0)) (> 0 aux_mod_v_~next~0_20_56)))) (<= .cse10 .cse20) (<= .cse12 .cse3) (<= (div (+ (- 9) .cse8 c_~next~0 c_~cur~0) (- 2)) .cse7) (< c_~j~0 c_~cur~0) (forall ((aux_div_v_~next~0_20_56 Int) (v_~cur~0_22 Int) (aux_mod_v_~next~0_20_56 Int)) (or (< (+ aux_mod_v_~next~0_20_56 c_~j~0 9) (+ (* 2 v_~cur~0_22) c_~prev~0 (* 2 aux_div_v_~next~0_20_56) c_~cur~0)) (<= (+ (* 5 aux_div_v_~next~0_20_56) v_~cur~0_22) (+ 22 (* 2 c_~j~0) (* aux_mod_v_~next~0_20_56 2))) (>= aux_mod_v_~next~0_20_56 2) (< v_~cur~0_22 (+ (* 2 c_~cur~0) c_~prev~0)) (> 0 aux_mod_v_~next~0_20_56))) (< c_~i~0 c_~prev~0) (< c_~j~0 c_~prev~0) (<= .cse2 .cse13) (<= .cse18 .cse20) (forall ((aux_div_v_~next~0_20_56 Int) (aux_mod_v_~next~0_20_56 Int)) (or (not (<= (+ (* 2 c_~cur~0) c_~prev~0 (* 2 aux_div_v_~next~0_20_56)) (+ aux_mod_v_~next~0_20_56 9 c_~i~0))) (>= aux_mod_v_~next~0_20_56 2) (<= (+ (* 5 aux_div_v_~next~0_20_56) c_~cur~0) (+ 22 (* 2 c_~i~0) (* aux_mod_v_~next~0_20_56 2))) (> 0 aux_mod_v_~next~0_20_56))) (forall ((aux_div_v_~next~0_20_56 Int) (v_~cur~0_22 Int) (aux_mod_v_~next~0_20_56 Int)) (or (< (+ aux_mod_v_~next~0_20_56 9 c_~i~0) (+ (* 2 v_~cur~0_22) c_~prev~0 (* 2 aux_div_v_~next~0_20_56) c_~cur~0)) (>= aux_mod_v_~next~0_20_56 2) (< v_~cur~0_22 (+ (* 2 c_~cur~0) c_~prev~0)) (<= (+ (* 5 aux_div_v_~next~0_20_56) v_~cur~0_22) (+ 22 (* 2 c_~i~0) (* aux_mod_v_~next~0_20_56 2))) (> 0 aux_mod_v_~next~0_20_56))) (< c_~j~0 c_~next~0) (forall ((aux_div_v_~next~0_20_56 Int) (aux_mod_v_~next~0_20_56 Int)) (or (<= (+ (* 5 aux_div_v_~next~0_20_56) c_~cur~0) (+ 22 (* 2 c_~j~0) (* aux_mod_v_~next~0_20_56 2))) (not (<= (+ (* 2 c_~cur~0) c_~prev~0 (* 2 aux_div_v_~next~0_20_56)) (+ aux_mod_v_~next~0_20_56 c_~j~0 9))) (>= aux_mod_v_~next~0_20_56 2) (> 0 aux_mod_v_~next~0_20_56))) (< c_~i~0 .cse17) (forall ((aux_mod_v_~cur~0_22_51 Int) (aux_div_v_~next~0_20_56 Int) (aux_div_v_~cur~0_22_51 Int) (v_~prev~0_24 Int) (v_~cur~0_26 Int) (aux_mod_v_~next~0_20_56 Int)) (let ((.cse21 (* 2 v_~cur~0_26))) (or (< (+ aux_mod_v_~next~0_20_56 c_~i~0 (* 2 aux_mod_v_~cur~0_22_51) 11) (+ .cse21 (* v_~prev~0_24 3) (* aux_div_v_~cur~0_22_51 4) c_~prev~0 (* 2 aux_div_v_~next~0_20_56) c_~cur~0)) (>= aux_mod_v_~cur~0_22_51 2) (>= aux_mod_v_~next~0_20_56 2) (< v_~prev~0_24 (+ c_~prev~0 v_~cur~0_26 c_~cur~0)) (<= (+ (* 5 aux_div_v_~next~0_20_56) (* 2 aux_div_v_~cur~0_22_51) v_~prev~0_24) (+ 23 aux_mod_v_~cur~0_22_51 (* 2 c_~i~0) (* aux_mod_v_~next~0_20_56 2))) (< aux_div_v_~cur~0_22_51 (+ .cse21 c_~prev~0 1 c_~cur~0)) (> 0 aux_mod_v_~cur~0_22_51) (< v_~cur~0_26 (+ (* 2 c_~cur~0) c_~prev~0)) (> 0 aux_mod_v_~next~0_20_56)))) (<= c_~i~0 1) (< c_~i~0 .cse15) (<= 1 c_~cur~0)))) is different from false [2022-02-16 02:37:13,780 INFO L104 alCausalityReduction]: MaximalCausalityReduction evaluated 414 transitions and produced 385 states. [2022-02-16 02:37:13,780 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-16 02:37:13,781 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-16 02:37:13,781 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-02-16 02:37:13,781 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-02-16 02:37:13,781 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2022-02-16 02:37:13,781 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2022-02-16 02:37:13,798 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2022-02-16 02:37:13,981 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-16 02:37:13,982 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-02-16 02:37:13,982 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-16 02:37:13,982 INFO L85 PathProgramCache]: Analyzing trace with hash -2006804384, now seen corresponding path program 1 times [2022-02-16 02:37:13,983 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-16 02:37:13,983 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1355226505] [2022-02-16 02:37:13,983 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-16 02:37:13,983 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-16 02:37:14,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-16 02:37:14,032 INFO L134 CoverageAnalysis]: Checked inductivity of 476 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 476 trivial. 0 not checked. [2022-02-16 02:37:14,032 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-16 02:37:14,032 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1355226505] [2022-02-16 02:37:14,033 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1355226505] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-16 02:37:14,033 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-16 02:37:14,033 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-16 02:37:14,033 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [676988193] [2022-02-16 02:37:14,033 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-16 02:37:14,033 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-16 02:37:14,033 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-16 02:37:14,034 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-16 02:37:14,034 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-16 02:37:14,034 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-16 02:37:14,034 INFO L470 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-02-16 02:37:14,034 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-16 02:37:14,034 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-02-16 02:37:14,034 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-02-16 02:37:14,034 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2022-02-16 02:37:14,034 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2022-02-16 02:37:14,035 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 36 states. [2022-02-16 02:37:14,035 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 47 states. [2022-02-16 02:37:14,035 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-02-16 02:37:17,606 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse5 (* (- 1) c_~j~0)) (.cse8 (* (- 1) c_~i~0)) (.cse24 (* 2 c_~cur~0))) (let ((.cse4 (+ c_~prev~0 c_~next~0)) (.cse9 (+ .cse24 3 c_~prev~0)) (.cse11 (+ .cse24 c_~prev~0)) (.cse6 (+ c_~next~0 1)) (.cse10 (div (+ (- 3) .cse8 c_~cur~0) (- 2))) (.cse12 (div (+ .cse8 c_~next~0 (- 5)) (- 2))) (.cse3 (+ 2 c_~prev~0 c_~next~0)) (.cse7 (+ (* 2 c_~next~0) 4 c_~cur~0)) (.cse2 (div (+ .cse5 c_~next~0 (- 5)) (- 2))) (.cse13 (+ 2 c_~next~0 c_~cur~0)) (.cse20 (div (+ (- 3) .cse5 c_~cur~0) (- 2))) (.cse22 (+ c_~prev~0 1 c_~cur~0)) (.cse19 (+ c_~prev~0 c_~cur~0)) (.cse15 (+ c_~next~0 c_~cur~0))) (and (forall ((v_~cur~0_26 Int)) (or (and (forall ((aux_mod_v_~cur~0_22_51 Int) (aux_div_v_~next~0_20_56 Int) (aux_div_v_~cur~0_22_51 Int) (v_~prev~0_24 Int) (aux_mod_v_~next~0_20_56 Int)) (let ((.cse0 (* 2 v_~cur~0_26))) (or (< v_~prev~0_24 (+ v_~cur~0_26 c_~cur~0)) (>= aux_mod_v_~cur~0_22_51 2) (< (+ aux_mod_v_~next~0_20_56 c_~j~0 (* 2 aux_mod_v_~cur~0_22_51) 11) (+ .cse0 (* v_~prev~0_24 3) (* aux_div_v_~cur~0_22_51 4) (* 2 aux_div_v_~next~0_20_56) c_~cur~0)) (>= aux_mod_v_~next~0_20_56 2) (<= (+ (* 5 aux_div_v_~next~0_20_56) (* 2 aux_div_v_~cur~0_22_51) v_~prev~0_24) (+ 23 aux_mod_v_~cur~0_22_51 (* 2 c_~j~0) (* aux_mod_v_~next~0_20_56 2))) (> 0 aux_mod_v_~cur~0_22_51) (< aux_div_v_~cur~0_22_51 (+ .cse0 1 c_~cur~0)) (> 0 aux_mod_v_~next~0_20_56)))) (forall ((aux_mod_v_~cur~0_22_51 Int) (aux_div_v_~next~0_20_56 Int) (aux_div_v_~cur~0_22_51 Int) (v_~prev~0_24 Int) (aux_mod_v_~next~0_20_56 Int)) (let ((.cse1 (* 2 v_~cur~0_26))) (or (< v_~prev~0_24 (+ v_~cur~0_26 c_~cur~0)) (>= aux_mod_v_~cur~0_22_51 2) (>= aux_mod_v_~next~0_20_56 2) (< (+ aux_mod_v_~next~0_20_56 c_~i~0 (* 2 aux_mod_v_~cur~0_22_51) 11) (+ .cse1 (* v_~prev~0_24 3) (* aux_div_v_~cur~0_22_51 4) (* 2 aux_div_v_~next~0_20_56) c_~cur~0)) (<= (+ (* 5 aux_div_v_~next~0_20_56) (* 2 aux_div_v_~cur~0_22_51) v_~prev~0_24) (+ 23 aux_mod_v_~cur~0_22_51 (* 2 c_~i~0) (* aux_mod_v_~next~0_20_56 2))) (> 0 aux_mod_v_~cur~0_22_51) (< aux_div_v_~cur~0_22_51 (+ .cse1 1 c_~cur~0)) (> 0 aux_mod_v_~next~0_20_56))))) (< v_~cur~0_26 (+ c_~prev~0 c_~cur~0)))) (< c_~i~0 c_~cur~0) (<= .cse2 .cse3) (< c_~j~0 .cse4) (< (div (+ (- 1) c_~prev~0 .cse5) (- 2)) .cse6) (<= (div (+ (- 9) .cse5 c_~next~0 c_~cur~0) (- 2)) .cse7) (< c_~j~0 |c_ULTIMATE.start_main_~correct~0#1|) (<= (div (+ (- 7) c_~prev~0 .cse8 c_~cur~0) (- 2)) .cse9) (< c_~i~0 .cse4) (forall ((v_~prev~0_24 Int)) (or (not (<= c_~cur~0 v_~prev~0_24)) (and (forall ((aux_mod_v_~cur~0_22_51 Int) (aux_div_v_~next~0_20_56 Int) (aux_div_v_~cur~0_22_51 Int) (aux_mod_v_~next~0_20_56 Int)) (or (< (+ aux_mod_v_~next~0_20_56 c_~i~0 (* 2 aux_mod_v_~cur~0_22_51) 11) (+ (* v_~prev~0_24 3) (* aux_div_v_~cur~0_22_51 4) c_~prev~0 (* 2 aux_div_v_~next~0_20_56) c_~cur~0)) (>= aux_mod_v_~cur~0_22_51 2) (< aux_div_v_~cur~0_22_51 (+ c_~prev~0 1 c_~cur~0)) (>= aux_mod_v_~next~0_20_56 2) (<= (+ (* 5 aux_div_v_~next~0_20_56) (* 2 aux_div_v_~cur~0_22_51) v_~prev~0_24) (+ 23 aux_mod_v_~cur~0_22_51 (* 2 c_~i~0) (* aux_mod_v_~next~0_20_56 2))) (> 0 aux_mod_v_~cur~0_22_51) (> 0 aux_mod_v_~next~0_20_56))) (forall ((aux_mod_v_~cur~0_22_51 Int) (aux_div_v_~next~0_20_56 Int) (aux_div_v_~cur~0_22_51 Int) (aux_mod_v_~next~0_20_56 Int)) (or (< (+ aux_mod_v_~next~0_20_56 c_~j~0 (* 2 aux_mod_v_~cur~0_22_51) 11) (+ (* v_~prev~0_24 3) (* aux_div_v_~cur~0_22_51 4) c_~prev~0 (* 2 aux_div_v_~next~0_20_56) c_~cur~0)) (>= aux_mod_v_~cur~0_22_51 2) (< aux_div_v_~cur~0_22_51 (+ c_~prev~0 1 c_~cur~0)) (>= aux_mod_v_~next~0_20_56 2) (<= (+ (* 5 aux_div_v_~next~0_20_56) (* 2 aux_div_v_~cur~0_22_51) v_~prev~0_24) (+ 23 aux_mod_v_~cur~0_22_51 (* 2 c_~j~0) (* aux_mod_v_~next~0_20_56 2))) (> 0 aux_mod_v_~cur~0_22_51) (> 0 aux_mod_v_~next~0_20_56)))))) (<= .cse10 .cse6) (< c_~i~0 c_~next~0) (< c_~i~0 .cse11) (<= .cse12 .cse13) (< c_~i~0 |c_ULTIMATE.start_main_~correct~0#1|) (forall ((aux_mod_v_~cur~0_22_51 Int) (aux_div_v_~next~0_20_56 Int) (aux_div_v_~cur~0_22_51 Int) (v_~prev~0_24 Int) (aux_mod_v_~next~0_20_56 Int)) (let ((.cse14 (* 2 c_~cur~0))) (or (< v_~prev~0_24 (+ c_~prev~0 c_~cur~0)) (< (+ aux_mod_v_~next~0_20_56 c_~i~0 (* 2 aux_mod_v_~cur~0_22_51) 11) (+ .cse14 (* v_~prev~0_24 3) (* aux_div_v_~cur~0_22_51 4) c_~prev~0 (* 2 aux_div_v_~next~0_20_56))) (>= aux_mod_v_~cur~0_22_51 2) (>= aux_mod_v_~next~0_20_56 2) (<= (+ (* 5 aux_div_v_~next~0_20_56) (* 2 aux_div_v_~cur~0_22_51) v_~prev~0_24) (+ 23 aux_mod_v_~cur~0_22_51 (* 2 c_~i~0) (* aux_mod_v_~next~0_20_56 2))) (> 0 aux_mod_v_~cur~0_22_51) (< aux_div_v_~cur~0_22_51 (+ .cse14 c_~prev~0 1)) (> 0 aux_mod_v_~next~0_20_56)))) (<= (div (+ (- 7) c_~prev~0 .cse5 c_~cur~0) (- 2)) .cse9) (< c_~j~0 .cse15) (forall ((v_~cur~0_22 Int)) (or (< v_~cur~0_22 (+ c_~prev~0 c_~cur~0)) (and (forall ((aux_div_v_~next~0_20_56 Int) (aux_mod_v_~next~0_20_56 Int)) (or (< (+ aux_mod_v_~next~0_20_56 c_~j~0 9) (+ (* 2 v_~cur~0_22) (* 2 aux_div_v_~next~0_20_56) c_~cur~0)) (<= (+ (* 5 aux_div_v_~next~0_20_56) v_~cur~0_22) (+ 22 (* 2 c_~j~0) (* aux_mod_v_~next~0_20_56 2))) (>= aux_mod_v_~next~0_20_56 2) (> 0 aux_mod_v_~next~0_20_56))) (forall ((aux_div_v_~next~0_20_56 Int) (aux_mod_v_~next~0_20_56 Int)) (or (< (+ aux_mod_v_~next~0_20_56 9 c_~i~0) (+ (* 2 v_~cur~0_22) (* 2 aux_div_v_~next~0_20_56) c_~cur~0)) (>= aux_mod_v_~next~0_20_56 2) (<= (+ (* 5 aux_div_v_~next~0_20_56) v_~cur~0_22) (+ 22 (* 2 c_~i~0) (* aux_mod_v_~next~0_20_56 2))) (> 0 aux_mod_v_~next~0_20_56)))))) (< c_~i~0 |c_ULTIMATE.start_fib_#res#1|) (forall ((aux_mod_v_~cur~0_22_51 Int) (aux_div_v_~next~0_20_56 Int) (aux_div_v_~cur~0_22_51 Int) (v_~prev~0_24 Int) (aux_mod_v_~next~0_20_56 Int)) (let ((.cse16 (* 2 c_~cur~0))) (or (< v_~prev~0_24 (+ c_~prev~0 c_~cur~0)) (>= aux_mod_v_~cur~0_22_51 2) (>= aux_mod_v_~next~0_20_56 2) (<= (+ (* 5 aux_div_v_~next~0_20_56) (* 2 aux_div_v_~cur~0_22_51) v_~prev~0_24) (+ 23 aux_mod_v_~cur~0_22_51 (* 2 c_~j~0) (* aux_mod_v_~next~0_20_56 2))) (> 0 aux_mod_v_~cur~0_22_51) (< aux_div_v_~cur~0_22_51 (+ .cse16 c_~prev~0 1)) (< (+ aux_mod_v_~next~0_20_56 c_~j~0 (* 2 aux_mod_v_~cur~0_22_51) 11) (+ .cse16 (* v_~prev~0_24 3) (* aux_div_v_~cur~0_22_51 4) c_~prev~0 (* 2 aux_div_v_~next~0_20_56))) (> 0 aux_mod_v_~next~0_20_56)))) (< c_~j~0 .cse11) (< (div (+ (- 1) c_~prev~0 .cse8) (- 2)) .cse6) (forall ((v_~j~0_8 Int)) (or (and (forall ((aux_mod_v_~cur~0_22_51 Int) (aux_div_v_~next~0_20_56 Int) (aux_div_v_~cur~0_22_51 Int) (v_~prev~0_24 Int) (v_~cur~0_26 Int) (aux_mod_v_~next~0_20_56 Int)) (let ((.cse17 (* 2 v_~cur~0_26))) (or (<= (+ (* 5 aux_div_v_~next~0_20_56) (* 2 aux_div_v_~cur~0_22_51) v_~prev~0_24) (+ 23 aux_mod_v_~cur~0_22_51 (* 2 v_~j~0_8) (* aux_mod_v_~next~0_20_56 2))) (>= aux_mod_v_~cur~0_22_51 2) (>= aux_mod_v_~next~0_20_56 2) (< v_~prev~0_24 (+ c_~prev~0 v_~cur~0_26 c_~cur~0)) (< aux_div_v_~cur~0_22_51 (+ .cse17 c_~prev~0 1 c_~cur~0)) (> 0 aux_mod_v_~cur~0_22_51) (< v_~cur~0_26 (+ (* 2 c_~cur~0) c_~prev~0)) (< (+ aux_mod_v_~next~0_20_56 (* 2 aux_mod_v_~cur~0_22_51) 11 v_~j~0_8) (+ .cse17 (* v_~prev~0_24 3) (* aux_div_v_~cur~0_22_51 4) c_~prev~0 (* 2 aux_div_v_~next~0_20_56) c_~cur~0)) (> 0 aux_mod_v_~next~0_20_56)))) (forall ((aux_mod_v_~cur~0_22_51 Int) (aux_div_v_~next~0_20_56 Int) (aux_div_v_~cur~0_22_51 Int) (v_~prev~0_24 Int) (v_~cur~0_26 Int) (aux_mod_v_~next~0_20_56 Int)) (let ((.cse18 (* 2 v_~cur~0_26))) (or (< (+ aux_mod_v_~next~0_20_56 c_~i~0 (* 2 aux_mod_v_~cur~0_22_51) 11) (+ .cse18 (* v_~prev~0_24 3) (* aux_div_v_~cur~0_22_51 4) c_~prev~0 (* 2 aux_div_v_~next~0_20_56) c_~cur~0)) (>= aux_mod_v_~cur~0_22_51 2) (>= aux_mod_v_~next~0_20_56 2) (< v_~prev~0_24 (+ c_~prev~0 v_~cur~0_26 c_~cur~0)) (<= (+ (* 5 aux_div_v_~next~0_20_56) (* 2 aux_div_v_~cur~0_22_51) v_~prev~0_24) (+ 23 aux_mod_v_~cur~0_22_51 (* 2 c_~i~0) (* aux_mod_v_~next~0_20_56 2))) (< aux_div_v_~cur~0_22_51 (+ .cse18 c_~prev~0 1 c_~cur~0)) (> 0 aux_mod_v_~cur~0_22_51) (< v_~cur~0_26 (+ (* 2 c_~cur~0) c_~prev~0)) (> 0 aux_mod_v_~next~0_20_56))))) (not (<= v_~j~0_8 1)))) (< c_~j~0 .cse19) (<= .cse20 .cse6) (< c_~j~0 |c_ULTIMATE.start_fib_#res#1|) (<= 0 c_~prev~0) (forall ((aux_mod_v_~cur~0_22_51 Int) (aux_div_v_~next~0_20_56 Int) (aux_div_v_~cur~0_22_51 Int) (v_~prev~0_24 Int) (v_~cur~0_26 Int) (aux_mod_v_~next~0_20_56 Int)) (let ((.cse21 (* 2 v_~cur~0_26))) (or (>= aux_mod_v_~cur~0_22_51 2) (>= aux_mod_v_~next~0_20_56 2) (< v_~prev~0_24 (+ c_~prev~0 v_~cur~0_26 c_~cur~0)) (< aux_div_v_~cur~0_22_51 (+ .cse21 c_~prev~0 1 c_~cur~0)) (<= (+ (* 5 aux_div_v_~next~0_20_56) (* 2 aux_div_v_~cur~0_22_51) v_~prev~0_24) (+ 23 aux_mod_v_~cur~0_22_51 (* 2 c_~j~0) (* aux_mod_v_~next~0_20_56 2))) (> 0 aux_mod_v_~cur~0_22_51) (< (+ aux_mod_v_~next~0_20_56 c_~j~0 (* 2 aux_mod_v_~cur~0_22_51) 11) (+ .cse21 (* v_~prev~0_24 3) (* aux_div_v_~cur~0_22_51 4) c_~prev~0 (* 2 aux_div_v_~next~0_20_56) c_~cur~0)) (< v_~cur~0_26 (+ (* 2 c_~cur~0) c_~prev~0)) (> 0 aux_mod_v_~next~0_20_56)))) (<= .cse10 .cse22) (<= .cse12 .cse3) (<= (div (+ (- 9) .cse8 c_~next~0 c_~cur~0) (- 2)) .cse7) (< c_~j~0 c_~cur~0) (forall ((aux_div_v_~next~0_20_56 Int) (v_~cur~0_22 Int) (aux_mod_v_~next~0_20_56 Int)) (or (< (+ aux_mod_v_~next~0_20_56 c_~j~0 9) (+ (* 2 v_~cur~0_22) c_~prev~0 (* 2 aux_div_v_~next~0_20_56) c_~cur~0)) (<= (+ (* 5 aux_div_v_~next~0_20_56) v_~cur~0_22) (+ 22 (* 2 c_~j~0) (* aux_mod_v_~next~0_20_56 2))) (>= aux_mod_v_~next~0_20_56 2) (< v_~cur~0_22 (+ (* 2 c_~cur~0) c_~prev~0)) (> 0 aux_mod_v_~next~0_20_56))) (< c_~i~0 c_~prev~0) (< c_~j~0 c_~prev~0) (<= .cse2 .cse13) (<= .cse20 .cse22) (forall ((aux_div_v_~next~0_20_56 Int) (aux_mod_v_~next~0_20_56 Int)) (or (not (<= (+ (* 2 c_~cur~0) c_~prev~0 (* 2 aux_div_v_~next~0_20_56)) (+ aux_mod_v_~next~0_20_56 9 c_~i~0))) (>= aux_mod_v_~next~0_20_56 2) (<= (+ (* 5 aux_div_v_~next~0_20_56) c_~cur~0) (+ 22 (* 2 c_~i~0) (* aux_mod_v_~next~0_20_56 2))) (> 0 aux_mod_v_~next~0_20_56))) (forall ((aux_div_v_~next~0_20_56 Int) (v_~cur~0_22 Int) (aux_mod_v_~next~0_20_56 Int)) (or (< (+ aux_mod_v_~next~0_20_56 9 c_~i~0) (+ (* 2 v_~cur~0_22) c_~prev~0 (* 2 aux_div_v_~next~0_20_56) c_~cur~0)) (>= aux_mod_v_~next~0_20_56 2) (< v_~cur~0_22 (+ (* 2 c_~cur~0) c_~prev~0)) (<= (+ (* 5 aux_div_v_~next~0_20_56) v_~cur~0_22) (+ 22 (* 2 c_~i~0) (* aux_mod_v_~next~0_20_56 2))) (> 0 aux_mod_v_~next~0_20_56))) (< c_~j~0 c_~next~0) (forall ((aux_div_v_~next~0_20_56 Int) (aux_mod_v_~next~0_20_56 Int)) (or (<= (+ (* 5 aux_div_v_~next~0_20_56) c_~cur~0) (+ 22 (* 2 c_~j~0) (* aux_mod_v_~next~0_20_56 2))) (not (<= (+ (* 2 c_~cur~0) c_~prev~0 (* 2 aux_div_v_~next~0_20_56)) (+ aux_mod_v_~next~0_20_56 c_~j~0 9))) (>= aux_mod_v_~next~0_20_56 2) (> 0 aux_mod_v_~next~0_20_56))) (< c_~i~0 .cse19) (forall ((aux_mod_v_~cur~0_22_51 Int) (aux_div_v_~next~0_20_56 Int) (aux_div_v_~cur~0_22_51 Int) (v_~prev~0_24 Int) (v_~cur~0_26 Int) (aux_mod_v_~next~0_20_56 Int)) (let ((.cse23 (* 2 v_~cur~0_26))) (or (< (+ aux_mod_v_~next~0_20_56 c_~i~0 (* 2 aux_mod_v_~cur~0_22_51) 11) (+ .cse23 (* v_~prev~0_24 3) (* aux_div_v_~cur~0_22_51 4) c_~prev~0 (* 2 aux_div_v_~next~0_20_56) c_~cur~0)) (>= aux_mod_v_~cur~0_22_51 2) (>= aux_mod_v_~next~0_20_56 2) (< v_~prev~0_24 (+ c_~prev~0 v_~cur~0_26 c_~cur~0)) (<= (+ (* 5 aux_div_v_~next~0_20_56) (* 2 aux_div_v_~cur~0_22_51) v_~prev~0_24) (+ 23 aux_mod_v_~cur~0_22_51 (* 2 c_~i~0) (* aux_mod_v_~next~0_20_56 2))) (< aux_div_v_~cur~0_22_51 (+ .cse23 c_~prev~0 1 c_~cur~0)) (> 0 aux_mod_v_~cur~0_22_51) (< v_~cur~0_26 (+ (* 2 c_~cur~0) c_~prev~0)) (> 0 aux_mod_v_~next~0_20_56)))) (< c_~i~0 .cse15) (<= 1 c_~cur~0)))) is different from false [2022-02-16 02:37:17,633 INFO L104 alCausalityReduction]: MaximalCausalityReduction evaluated 414 transitions and produced 388 states. [2022-02-16 02:37:17,633 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-16 02:37:17,633 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-16 02:37:17,633 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-02-16 02:37:17,633 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-02-16 02:37:17,633 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2022-02-16 02:37:17,633 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2022-02-16 02:37:17,637 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-16 02:37:17,637 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-02-16 02:37:17,637 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-02-16 02:37:17,637 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-16 02:37:17,638 INFO L85 PathProgramCache]: Analyzing trace with hash -240107661, now seen corresponding path program 1 times [2022-02-16 02:37:17,638 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-16 02:37:17,638 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1401216280] [2022-02-16 02:37:17,638 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-16 02:37:17,638 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-16 02:37:17,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-16 02:37:17,704 INFO L134 CoverageAnalysis]: Checked inductivity of 475 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 474 trivial. 0 not checked. [2022-02-16 02:37:17,704 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-16 02:37:17,704 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1401216280] [2022-02-16 02:37:17,706 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1401216280] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-16 02:37:17,706 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [816557972] [2022-02-16 02:37:17,706 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-16 02:37:17,706 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-16 02:37:17,707 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-16 02:37:17,709 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-02-16 02:37:17,710 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-02-16 02:37:17,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-16 02:37:17,782 INFO L263 TraceCheckSpWp]: Trace formula consists of 313 conjuncts, 4 conjunts are in the unsatisfiable core [2022-02-16 02:37:17,785 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-16 02:37:17,995 INFO L134 CoverageAnalysis]: Checked inductivity of 475 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 474 trivial. 0 not checked. [2022-02-16 02:37:17,995 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-16 02:37:18,219 INFO L134 CoverageAnalysis]: Checked inductivity of 475 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 474 trivial. 0 not checked. [2022-02-16 02:37:18,220 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [816557972] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-16 02:37:18,220 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-16 02:37:18,220 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2022-02-16 02:37:18,220 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [824977777] [2022-02-16 02:37:18,220 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-16 02:37:18,220 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-02-16 02:37:18,220 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-16 02:37:18,221 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-02-16 02:37:18,221 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2022-02-16 02:37:18,221 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-16 02:37:18,221 INFO L470 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-02-16 02:37:18,221 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.6) internal successors, (86), 10 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-16 02:37:18,221 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-02-16 02:37:18,221 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-02-16 02:37:18,221 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2022-02-16 02:37:18,221 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2022-02-16 02:37:18,221 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 36 states. [2022-02-16 02:37:18,221 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 49 states. [2022-02-16 02:37:18,222 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-02-16 02:37:18,222 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-02-16 02:37:18,323 INFO L104 alCausalityReduction]: MaximalCausalityReduction evaluated 398 transitions and produced 380 states. [2022-02-16 02:37:18,323 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-16 02:37:18,323 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-16 02:37:18,323 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-02-16 02:37:18,323 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-02-16 02:37:18,323 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2022-02-16 02:37:18,323 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2022-02-16 02:37:18,323 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-16 02:37:18,323 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-02-16 02:37:18,343 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-02-16 02:37:18,524 WARN L452 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-02-16 02:37:18,524 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-02-16 02:37:18,524 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-16 02:37:18,524 INFO L85 PathProgramCache]: Analyzing trace with hash -440658106, now seen corresponding path program 1 times [2022-02-16 02:37:18,525 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-16 02:37:18,525 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1728497464] [2022-02-16 02:37:18,525 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-16 02:37:18,525 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-16 02:37:18,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-16 02:37:21,504 INFO L134 CoverageAnalysis]: Checked inductivity of 476 backedges. 0 proven. 476 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-16 02:37:21,504 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-16 02:37:21,504 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1728497464] [2022-02-16 02:37:21,504 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1728497464] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-16 02:37:21,504 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2091053345] [2022-02-16 02:37:21,504 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-16 02:37:21,504 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-16 02:37:21,505 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-16 02:37:21,506 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-02-16 02:37:21,506 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-02-16 02:37:21,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-16 02:37:21,588 INFO L263 TraceCheckSpWp]: Trace formula consists of 301 conjuncts, 43 conjunts are in the unsatisfiable core [2022-02-16 02:37:21,590 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-16 02:37:28,822 INFO L134 CoverageAnalysis]: Checked inductivity of 476 backedges. 335 proven. 141 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-16 02:37:28,822 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-16 02:42:17,191 INFO L134 CoverageAnalysis]: Checked inductivity of 476 backedges. 0 proven. 474 refuted. 2 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-16 02:42:17,192 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2091053345] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-16 02:42:17,192 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-16 02:42:17,193 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [44, 44, 44] total 127 [2022-02-16 02:42:17,193 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [32055164] [2022-02-16 02:42:17,193 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-16 02:42:17,196 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 127 states [2022-02-16 02:42:17,196 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-16 02:42:17,197 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 127 interpolants. [2022-02-16 02:42:17,218 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=948, Invalid=15000, Unknown=54, NotChecked=0, Total=16002 [2022-02-16 02:42:17,218 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-16 02:42:17,218 INFO L470 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-02-16 02:42:17,219 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 127 states, 127 states have (on average 3.220472440944882) internal successors, (409), 127 states have internal predecessors, (409), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-16 02:42:17,219 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-02-16 02:42:17,219 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-02-16 02:42:17,219 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2022-02-16 02:42:17,219 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2022-02-16 02:42:17,219 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 36 states. [2022-02-16 02:42:17,219 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 49 states. [2022-02-16 02:42:17,219 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-02-16 02:42:17,219 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2022-02-16 02:42:17,219 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-02-16 02:42:21,325 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 (+ (* 2 c_~next~0) 4 c_~cur~0)) (.cse2 (* (- 1) c_~i~0)) (.cse0 (* (- 1) c_~j~0)) (.cse3 (+ 2 c_~next~0 c_~cur~0))) (and (= (+ (- 1) c_~i~0) 0) (<= (div (+ (- 9) .cse0 c_~next~0 c_~cur~0) (- 2)) .cse1) (<= (+ c_~j~0 (div (+ (- 9) .cse2 c_~next~0 c_~cur~0) (- 2))) .cse1) (<= (+ (div (+ .cse2 c_~next~0 (- 5)) (- 2)) c_~j~0) .cse3) (= (+ (- 1) c_~j~0) 0) (forall ((aux_div_v_~next~0_33_56 Int) (v_~cur~0_35 Int) (aux_mod_v_~next~0_33_56 Int)) (or (>= aux_mod_v_~next~0_33_56 2) (> 0 aux_mod_v_~next~0_33_56) (< (+ aux_mod_v_~next~0_33_56 c_~j~0 9) (+ (* 2 v_~cur~0_35) c_~next~0 (* 2 aux_div_v_~next~0_33_56))) (<= (+ (* 5 aux_div_v_~next~0_33_56) v_~cur~0_35) (+ 22 (* 2 c_~j~0) (* aux_mod_v_~next~0_33_56 2))) (< v_~cur~0_35 (+ c_~next~0 c_~cur~0)))) (<= 1 c_~next~0) (forall ((v_~cur~0_39 Int) (v_~prev~0_37 Int) (v_~next~0_36 Int)) (or (< v_~prev~0_37 (+ v_~cur~0_39 c_~cur~0)) (< v_~next~0_36 (+ (* 2 v_~cur~0_39) c_~cur~0)) (not (<= c_~next~0 v_~cur~0_39)) (and (forall ((aux_div_v_~cur~0_35_51 Int) (aux_div_aux_mod_v_~next~0_33_56_89 Int) (aux_mod_aux_mod_v_~next~0_33_56_89 Int)) (let ((.cse5 (+ (* v_~prev~0_37 3) v_~next~0_36)) (.cse4 (* aux_div_aux_mod_v_~next~0_33_56_89 2))) (or (>= aux_mod_aux_mod_v_~next~0_33_56_89 2) (> 0 aux_mod_aux_mod_v_~next~0_33_56_89) (< aux_div_v_~cur~0_35_51 (+ v_~next~0_36 1)) (<= 0 (+ (div (+ (* 2 v_~next~0_36) (* aux_div_aux_mod_v_~next~0_33_56_89 (- 3)) (* (- 1) c_~j~0) (* (- 2) aux_mod_aux_mod_v_~next~0_33_56_89) (* 5 v_~prev~0_37)) 4) aux_div_aux_mod_v_~next~0_33_56_89 (* 2 aux_div_v_~cur~0_35_51))) (<= (+ aux_mod_aux_mod_v_~next~0_33_56_89 14 c_~i~0 .cse4) .cse5) (< .cse5 (+ aux_mod_aux_mod_v_~next~0_33_56_89 c_~i~0 12 .cse4))))) (forall ((aux_div_v_~cur~0_35_51 Int) (aux_mod_aux_mod_v_~next~0_33_56_89 Int) (aux_div_aux_mod_v_~next~0_33_56_89 Int)) (let ((.cse7 (+ (* v_~prev~0_37 3) v_~next~0_36)) (.cse6 (* aux_div_aux_mod_v_~next~0_33_56_89 2))) (or (>= aux_mod_aux_mod_v_~next~0_33_56_89 2) (<= (+ aux_mod_aux_mod_v_~next~0_33_56_89 c_~j~0 14 .cse6) .cse7) (> 0 aux_mod_aux_mod_v_~next~0_33_56_89) (< aux_div_v_~cur~0_35_51 (+ v_~next~0_36 1)) (< .cse7 (+ aux_mod_aux_mod_v_~next~0_33_56_89 c_~j~0 12 .cse6)) (<= 0 (+ aux_div_aux_mod_v_~next~0_33_56_89 (div (+ (* 2 v_~next~0_36) (* aux_div_aux_mod_v_~next~0_33_56_89 (- 3)) (* (- 2) aux_mod_aux_mod_v_~next~0_33_56_89) (* 5 v_~prev~0_37)) 4) (* 2 aux_div_v_~cur~0_35_51))))))))) (forall ((v_~prev~0_37 Int)) (or (not (<= c_~cur~0 v_~prev~0_37)) (and (forall ((aux_div_v_~cur~0_35_51 Int) (aux_div_aux_mod_v_~next~0_33_56_89 Int) (aux_mod_aux_mod_v_~next~0_33_56_89 Int)) (let ((.cse9 (+ (* v_~prev~0_37 3) c_~next~0)) (.cse8 (* aux_div_aux_mod_v_~next~0_33_56_89 2))) (or (<= (+ aux_mod_aux_mod_v_~next~0_33_56_89 14 c_~i~0 .cse8) .cse9) (>= aux_mod_aux_mod_v_~next~0_33_56_89 2) (< aux_div_v_~cur~0_35_51 (+ c_~next~0 1)) (> 0 aux_mod_aux_mod_v_~next~0_33_56_89) (< .cse9 (+ aux_mod_aux_mod_v_~next~0_33_56_89 c_~i~0 12 .cse8)) (<= 0 (+ aux_div_aux_mod_v_~next~0_33_56_89 (* 2 aux_div_v_~cur~0_35_51) (div (+ (* aux_div_aux_mod_v_~next~0_33_56_89 (- 3)) (* (- 1) c_~j~0) (* (- 2) aux_mod_aux_mod_v_~next~0_33_56_89) (* 2 c_~next~0) (* 5 v_~prev~0_37)) 4)))))) (forall ((aux_div_v_~cur~0_35_51 Int) (aux_mod_aux_mod_v_~next~0_33_56_89 Int) (aux_div_aux_mod_v_~next~0_33_56_89 Int)) (let ((.cse11 (* aux_div_aux_mod_v_~next~0_33_56_89 2)) (.cse10 (+ (* v_~prev~0_37 3) c_~next~0))) (or (>= aux_mod_aux_mod_v_~next~0_33_56_89 2) (< aux_div_v_~cur~0_35_51 (+ c_~next~0 1)) (> 0 aux_mod_aux_mod_v_~next~0_33_56_89) (< .cse10 (+ aux_mod_aux_mod_v_~next~0_33_56_89 c_~j~0 12 .cse11)) (<= 0 (+ aux_div_aux_mod_v_~next~0_33_56_89 (div (+ (* aux_div_aux_mod_v_~next~0_33_56_89 (- 3)) (* (- 2) aux_mod_aux_mod_v_~next~0_33_56_89) (* 2 c_~next~0) (* 5 v_~prev~0_37)) 4) (* 2 aux_div_v_~cur~0_35_51))) (<= (+ aux_mod_aux_mod_v_~next~0_33_56_89 c_~j~0 14 .cse11) .cse10))))))) (forall ((v_~cur~0_39 Int) (v_~prev~0_37 Int) (v_~next~0_36 Int)) (or (< v_~next~0_36 (+ c_~next~0 (* 2 v_~cur~0_39))) (< v_~cur~0_39 (+ c_~next~0 c_~cur~0)) (and (forall ((aux_div_v_~cur~0_35_51 Int) (aux_div_aux_mod_v_~next~0_33_56_89 Int) (aux_mod_aux_mod_v_~next~0_33_56_89 Int)) (let ((.cse13 (+ (* v_~prev~0_37 3) v_~next~0_36)) (.cse12 (* aux_div_aux_mod_v_~next~0_33_56_89 2))) (or (>= aux_mod_aux_mod_v_~next~0_33_56_89 2) (> 0 aux_mod_aux_mod_v_~next~0_33_56_89) (< aux_div_v_~cur~0_35_51 (+ v_~next~0_36 1)) (<= 0 (+ (div (+ (* 2 v_~next~0_36) (* aux_div_aux_mod_v_~next~0_33_56_89 (- 3)) (* (- 1) c_~j~0) (* (- 2) aux_mod_aux_mod_v_~next~0_33_56_89) (* 5 v_~prev~0_37)) 4) aux_div_aux_mod_v_~next~0_33_56_89 (* 2 aux_div_v_~cur~0_35_51))) (<= (+ aux_mod_aux_mod_v_~next~0_33_56_89 14 c_~i~0 .cse12) .cse13) (< .cse13 (+ aux_mod_aux_mod_v_~next~0_33_56_89 c_~i~0 12 .cse12))))) (forall ((aux_div_v_~cur~0_35_51 Int) (aux_mod_aux_mod_v_~next~0_33_56_89 Int) (aux_div_aux_mod_v_~next~0_33_56_89 Int)) (let ((.cse15 (+ (* v_~prev~0_37 3) v_~next~0_36)) (.cse14 (* aux_div_aux_mod_v_~next~0_33_56_89 2))) (or (>= aux_mod_aux_mod_v_~next~0_33_56_89 2) (<= (+ aux_mod_aux_mod_v_~next~0_33_56_89 c_~j~0 14 .cse14) .cse15) (> 0 aux_mod_aux_mod_v_~next~0_33_56_89) (< aux_div_v_~cur~0_35_51 (+ v_~next~0_36 1)) (< .cse15 (+ aux_mod_aux_mod_v_~next~0_33_56_89 c_~j~0 12 .cse14)) (<= 0 (+ aux_div_aux_mod_v_~next~0_33_56_89 (div (+ (* 2 v_~next~0_36) (* aux_div_aux_mod_v_~next~0_33_56_89 (- 3)) (* (- 2) aux_mod_aux_mod_v_~next~0_33_56_89) (* 5 v_~prev~0_37)) 4) (* 2 aux_div_v_~cur~0_35_51))))))) (< v_~prev~0_37 (+ c_~next~0 v_~cur~0_39)))) (<= (div (+ .cse0 c_~next~0 (- 5)) (- 2)) .cse3) (forall ((aux_div_v_~next~0_33_56 Int) (v_~cur~0_35 Int) (aux_mod_v_~next~0_33_56 Int)) (or (>= aux_mod_v_~next~0_33_56 2) (> 0 aux_mod_v_~next~0_33_56) (< (+ aux_mod_v_~next~0_33_56 9 c_~i~0) (+ (* 2 v_~cur~0_35) c_~next~0 (* 2 aux_div_v_~next~0_33_56))) (<= (+ c_~j~0 (* 5 aux_div_v_~next~0_33_56) v_~cur~0_35) (+ 22 (* 2 c_~i~0) (* aux_mod_v_~next~0_33_56 2))) (< v_~cur~0_35 (+ c_~next~0 c_~cur~0)))) (forall ((v_~cur~0_35 Int)) (or (not (<= c_~next~0 v_~cur~0_35)) (and (forall ((aux_div_v_~next~0_33_56 Int) (aux_mod_v_~next~0_33_56 Int)) (or (>= aux_mod_v_~next~0_33_56 2) (> 0 aux_mod_v_~next~0_33_56) (< (+ aux_mod_v_~next~0_33_56 c_~j~0 9) (+ (* 2 v_~cur~0_35) (* 2 aux_div_v_~next~0_33_56) c_~cur~0)) (<= (+ (* 5 aux_div_v_~next~0_33_56) v_~cur~0_35) (+ 22 (* 2 c_~j~0) (* aux_mod_v_~next~0_33_56 2))))) (forall ((aux_div_v_~next~0_33_56 Int) (aux_mod_v_~next~0_33_56 Int)) (or (< (+ aux_mod_v_~next~0_33_56 9 c_~i~0) (+ (* 2 v_~cur~0_35) (* 2 aux_div_v_~next~0_33_56) c_~cur~0)) (>= aux_mod_v_~next~0_33_56 2) (> 0 aux_mod_v_~next~0_33_56) (<= (+ c_~j~0 (* 5 aux_div_v_~next~0_33_56) v_~cur~0_35) (+ 22 (* 2 c_~i~0) (* aux_mod_v_~next~0_33_56 2)))))))) (= (+ (- 1) c_~prev~0) 0) (forall ((v_~prev~0_37 Int) (v_~next~0_36 Int)) (or (and (forall ((aux_div_v_~cur~0_35_51 Int) (aux_div_aux_mod_v_~next~0_33_56_89 Int) (aux_mod_aux_mod_v_~next~0_33_56_89 Int)) (let ((.cse17 (+ (* v_~prev~0_37 3) v_~next~0_36)) (.cse16 (* aux_div_aux_mod_v_~next~0_33_56_89 2))) (or (>= aux_mod_aux_mod_v_~next~0_33_56_89 2) (> 0 aux_mod_aux_mod_v_~next~0_33_56_89) (< aux_div_v_~cur~0_35_51 (+ v_~next~0_36 1)) (<= 0 (+ (div (+ (* 2 v_~next~0_36) (* aux_div_aux_mod_v_~next~0_33_56_89 (- 3)) (* (- 1) c_~j~0) (* (- 2) aux_mod_aux_mod_v_~next~0_33_56_89) (* 5 v_~prev~0_37)) 4) aux_div_aux_mod_v_~next~0_33_56_89 (* 2 aux_div_v_~cur~0_35_51))) (<= (+ aux_mod_aux_mod_v_~next~0_33_56_89 14 c_~i~0 .cse16) .cse17) (< .cse17 (+ aux_mod_aux_mod_v_~next~0_33_56_89 c_~i~0 12 .cse16))))) (forall ((aux_div_v_~cur~0_35_51 Int) (aux_mod_aux_mod_v_~next~0_33_56_89 Int) (aux_div_aux_mod_v_~next~0_33_56_89 Int)) (let ((.cse19 (+ (* v_~prev~0_37 3) v_~next~0_36)) (.cse18 (* aux_div_aux_mod_v_~next~0_33_56_89 2))) (or (>= aux_mod_aux_mod_v_~next~0_33_56_89 2) (<= (+ aux_mod_aux_mod_v_~next~0_33_56_89 c_~j~0 14 .cse18) .cse19) (> 0 aux_mod_aux_mod_v_~next~0_33_56_89) (< aux_div_v_~cur~0_35_51 (+ v_~next~0_36 1)) (< .cse19 (+ aux_mod_aux_mod_v_~next~0_33_56_89 c_~j~0 12 .cse18)) (<= 0 (+ aux_div_aux_mod_v_~next~0_33_56_89 (div (+ (* 2 v_~next~0_36) (* aux_div_aux_mod_v_~next~0_33_56_89 (- 3)) (* (- 2) aux_mod_aux_mod_v_~next~0_33_56_89) (* 5 v_~prev~0_37)) 4) (* 2 aux_div_v_~cur~0_35_51))))))) (< v_~prev~0_37 c_~next~0) (< v_~next~0_36 (+ c_~next~0 c_~cur~0)))) (<= 1 c_~cur~0))) is different from false [2022-02-16 02:42:24,541 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 (+ (* 2 c_~next~0) 4 c_~cur~0)) (.cse2 (* (- 1) c_~i~0)) (.cse5 (* c_~next~0 55)) (.cse3 (+ c_~next~0 1)) (.cse0 (* (- 1) c_~j~0)) (.cse4 (+ 2 c_~next~0 c_~cur~0))) (and (= (+ (- 1) c_~i~0) 0) (<= (div (+ (- 9) .cse0 c_~next~0 c_~cur~0) (- 2)) .cse1) (<= (+ c_~j~0 (div (+ (- 9) .cse2 c_~next~0 c_~cur~0) (- 2))) .cse1) (<= (+ (div (+ (- 3) .cse2 c_~cur~0) (- 2)) c_~j~0) .cse3) (<= (+ (div (+ .cse2 c_~next~0 (- 5)) (- 2)) c_~j~0) .cse4) (= (+ (- 1) c_~j~0) 0) (<= 144 (+ .cse5 (* 34 c_~cur~0))) (<= 144 (+ .cse5 (* c_~prev~0 34))) (forall ((aux_div_v_~next~0_33_56 Int) (v_~cur~0_35 Int) (aux_mod_v_~next~0_33_56 Int)) (or (>= aux_mod_v_~next~0_33_56 2) (> 0 aux_mod_v_~next~0_33_56) (< (+ aux_mod_v_~next~0_33_56 c_~j~0 9) (+ (* 2 v_~cur~0_35) c_~next~0 (* 2 aux_div_v_~next~0_33_56))) (<= (+ (* 5 aux_div_v_~next~0_33_56) v_~cur~0_35) (+ 22 (* 2 c_~j~0) (* aux_mod_v_~next~0_33_56 2))) (< v_~cur~0_35 (+ c_~next~0 c_~cur~0)))) (<= 2 c_~next~0) (forall ((v_~prev~0_37 Int)) (or (not (<= c_~cur~0 v_~prev~0_37)) (and (forall ((aux_div_v_~cur~0_35_51 Int) (aux_div_aux_mod_v_~next~0_33_56_89 Int) (aux_mod_aux_mod_v_~next~0_33_56_89 Int)) (let ((.cse7 (+ (* v_~prev~0_37 3) c_~next~0)) (.cse6 (* aux_div_aux_mod_v_~next~0_33_56_89 2))) (or (<= (+ aux_mod_aux_mod_v_~next~0_33_56_89 14 c_~i~0 .cse6) .cse7) (>= aux_mod_aux_mod_v_~next~0_33_56_89 2) (< aux_div_v_~cur~0_35_51 (+ c_~next~0 1)) (> 0 aux_mod_aux_mod_v_~next~0_33_56_89) (< .cse7 (+ aux_mod_aux_mod_v_~next~0_33_56_89 c_~i~0 12 .cse6)) (<= 0 (+ aux_div_aux_mod_v_~next~0_33_56_89 (* 2 aux_div_v_~cur~0_35_51) (div (+ (* aux_div_aux_mod_v_~next~0_33_56_89 (- 3)) (* (- 1) c_~j~0) (* (- 2) aux_mod_aux_mod_v_~next~0_33_56_89) (* 2 c_~next~0) (* 5 v_~prev~0_37)) 4)))))) (forall ((aux_div_v_~cur~0_35_51 Int) (aux_mod_aux_mod_v_~next~0_33_56_89 Int) (aux_div_aux_mod_v_~next~0_33_56_89 Int)) (let ((.cse9 (* aux_div_aux_mod_v_~next~0_33_56_89 2)) (.cse8 (+ (* v_~prev~0_37 3) c_~next~0))) (or (>= aux_mod_aux_mod_v_~next~0_33_56_89 2) (< aux_div_v_~cur~0_35_51 (+ c_~next~0 1)) (> 0 aux_mod_aux_mod_v_~next~0_33_56_89) (< .cse8 (+ aux_mod_aux_mod_v_~next~0_33_56_89 c_~j~0 12 .cse9)) (<= 0 (+ aux_div_aux_mod_v_~next~0_33_56_89 (div (+ (* aux_div_aux_mod_v_~next~0_33_56_89 (- 3)) (* (- 2) aux_mod_aux_mod_v_~next~0_33_56_89) (* 2 c_~next~0) (* 5 v_~prev~0_37)) 4) (* 2 aux_div_v_~cur~0_35_51))) (<= (+ aux_mod_aux_mod_v_~next~0_33_56_89 c_~j~0 14 .cse9) .cse8))))))) (<= c_~j~0 1) (<= (div (+ (- 3) .cse0 c_~cur~0) (- 2)) .cse3) (forall ((v_~cur~0_39 Int) (v_~prev~0_37 Int) (v_~next~0_36 Int)) (or (< v_~next~0_36 (+ c_~next~0 (* 2 v_~cur~0_39))) (< v_~cur~0_39 (+ c_~next~0 c_~cur~0)) (and (forall ((aux_div_v_~cur~0_35_51 Int) (aux_div_aux_mod_v_~next~0_33_56_89 Int) (aux_mod_aux_mod_v_~next~0_33_56_89 Int)) (let ((.cse11 (+ (* v_~prev~0_37 3) v_~next~0_36)) (.cse10 (* aux_div_aux_mod_v_~next~0_33_56_89 2))) (or (>= aux_mod_aux_mod_v_~next~0_33_56_89 2) (> 0 aux_mod_aux_mod_v_~next~0_33_56_89) (< aux_div_v_~cur~0_35_51 (+ v_~next~0_36 1)) (<= 0 (+ (div (+ (* 2 v_~next~0_36) (* aux_div_aux_mod_v_~next~0_33_56_89 (- 3)) (* (- 1) c_~j~0) (* (- 2) aux_mod_aux_mod_v_~next~0_33_56_89) (* 5 v_~prev~0_37)) 4) aux_div_aux_mod_v_~next~0_33_56_89 (* 2 aux_div_v_~cur~0_35_51))) (<= (+ aux_mod_aux_mod_v_~next~0_33_56_89 14 c_~i~0 .cse10) .cse11) (< .cse11 (+ aux_mod_aux_mod_v_~next~0_33_56_89 c_~i~0 12 .cse10))))) (forall ((aux_div_v_~cur~0_35_51 Int) (aux_mod_aux_mod_v_~next~0_33_56_89 Int) (aux_div_aux_mod_v_~next~0_33_56_89 Int)) (let ((.cse13 (+ (* v_~prev~0_37 3) v_~next~0_36)) (.cse12 (* aux_div_aux_mod_v_~next~0_33_56_89 2))) (or (>= aux_mod_aux_mod_v_~next~0_33_56_89 2) (<= (+ aux_mod_aux_mod_v_~next~0_33_56_89 c_~j~0 14 .cse12) .cse13) (> 0 aux_mod_aux_mod_v_~next~0_33_56_89) (< aux_div_v_~cur~0_35_51 (+ v_~next~0_36 1)) (< .cse13 (+ aux_mod_aux_mod_v_~next~0_33_56_89 c_~j~0 12 .cse12)) (<= 0 (+ aux_div_aux_mod_v_~next~0_33_56_89 (div (+ (* 2 v_~next~0_36) (* aux_div_aux_mod_v_~next~0_33_56_89 (- 3)) (* (- 2) aux_mod_aux_mod_v_~next~0_33_56_89) (* 5 v_~prev~0_37)) 4) (* 2 aux_div_v_~cur~0_35_51))))))) (< v_~prev~0_37 (+ c_~next~0 v_~cur~0_39)))) (<= 1 c_~prev~0) (<= (div (+ .cse0 c_~next~0 (- 5)) (- 2)) .cse4) (forall ((aux_div_v_~next~0_33_56 Int) (v_~cur~0_35 Int) (aux_mod_v_~next~0_33_56 Int)) (or (>= aux_mod_v_~next~0_33_56 2) (> 0 aux_mod_v_~next~0_33_56) (< (+ aux_mod_v_~next~0_33_56 9 c_~i~0) (+ (* 2 v_~cur~0_35) c_~next~0 (* 2 aux_div_v_~next~0_33_56))) (<= (+ c_~j~0 (* 5 aux_div_v_~next~0_33_56) v_~cur~0_35) (+ 22 (* 2 c_~i~0) (* aux_mod_v_~next~0_33_56 2))) (< v_~cur~0_35 (+ c_~next~0 c_~cur~0)))) (<= c_~i~0 1) (forall ((v_~cur~0_35 Int)) (or (not (<= c_~next~0 v_~cur~0_35)) (and (forall ((aux_div_v_~next~0_33_56 Int) (aux_mod_v_~next~0_33_56 Int)) (or (>= aux_mod_v_~next~0_33_56 2) (> 0 aux_mod_v_~next~0_33_56) (< (+ aux_mod_v_~next~0_33_56 c_~j~0 9) (+ (* 2 v_~cur~0_35) (* 2 aux_div_v_~next~0_33_56) c_~cur~0)) (<= (+ (* 5 aux_div_v_~next~0_33_56) v_~cur~0_35) (+ 22 (* 2 c_~j~0) (* aux_mod_v_~next~0_33_56 2))))) (forall ((aux_div_v_~next~0_33_56 Int) (aux_mod_v_~next~0_33_56 Int)) (or (< (+ aux_mod_v_~next~0_33_56 9 c_~i~0) (+ (* 2 v_~cur~0_35) (* 2 aux_div_v_~next~0_33_56) c_~cur~0)) (>= aux_mod_v_~next~0_33_56 2) (> 0 aux_mod_v_~next~0_33_56) (<= (+ c_~j~0 (* 5 aux_div_v_~next~0_33_56) v_~cur~0_35) (+ 22 (* 2 c_~i~0) (* aux_mod_v_~next~0_33_56 2)))))))) (forall ((v_~prev~0_37 Int) (v_~next~0_36 Int)) (or (and (forall ((aux_div_v_~cur~0_35_51 Int) (aux_div_aux_mod_v_~next~0_33_56_89 Int) (aux_mod_aux_mod_v_~next~0_33_56_89 Int)) (let ((.cse15 (+ (* v_~prev~0_37 3) v_~next~0_36)) (.cse14 (* aux_div_aux_mod_v_~next~0_33_56_89 2))) (or (>= aux_mod_aux_mod_v_~next~0_33_56_89 2) (> 0 aux_mod_aux_mod_v_~next~0_33_56_89) (< aux_div_v_~cur~0_35_51 (+ v_~next~0_36 1)) (<= 0 (+ (div (+ (* 2 v_~next~0_36) (* aux_div_aux_mod_v_~next~0_33_56_89 (- 3)) (* (- 1) c_~j~0) (* (- 2) aux_mod_aux_mod_v_~next~0_33_56_89) (* 5 v_~prev~0_37)) 4) aux_div_aux_mod_v_~next~0_33_56_89 (* 2 aux_div_v_~cur~0_35_51))) (<= (+ aux_mod_aux_mod_v_~next~0_33_56_89 14 c_~i~0 .cse14) .cse15) (< .cse15 (+ aux_mod_aux_mod_v_~next~0_33_56_89 c_~i~0 12 .cse14))))) (forall ((aux_div_v_~cur~0_35_51 Int) (aux_mod_aux_mod_v_~next~0_33_56_89 Int) (aux_div_aux_mod_v_~next~0_33_56_89 Int)) (let ((.cse17 (+ (* v_~prev~0_37 3) v_~next~0_36)) (.cse16 (* aux_div_aux_mod_v_~next~0_33_56_89 2))) (or (>= aux_mod_aux_mod_v_~next~0_33_56_89 2) (<= (+ aux_mod_aux_mod_v_~next~0_33_56_89 c_~j~0 14 .cse16) .cse17) (> 0 aux_mod_aux_mod_v_~next~0_33_56_89) (< aux_div_v_~cur~0_35_51 (+ v_~next~0_36 1)) (< .cse17 (+ aux_mod_aux_mod_v_~next~0_33_56_89 c_~j~0 12 .cse16)) (<= 0 (+ aux_div_aux_mod_v_~next~0_33_56_89 (div (+ (* 2 v_~next~0_36) (* aux_div_aux_mod_v_~next~0_33_56_89 (- 3)) (* (- 2) aux_mod_aux_mod_v_~next~0_33_56_89) (* 5 v_~prev~0_37)) 4) (* 2 aux_div_v_~cur~0_35_51))))))) (< v_~prev~0_37 c_~next~0) (< v_~next~0_36 (+ c_~next~0 c_~cur~0)))) (<= 1 c_~cur~0))) is different from false [2022-02-16 02:42:26,740 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse6 (* (- 1) c_~j~0)) (.cse9 (* (- 1) c_~i~0))) (let ((.cse8 (+ (* 2 c_~next~0) 4 c_~cur~0)) (.cse16 (+ c_~next~0 c_~cur~0)) (.cse10 (+ (div (+ .cse9 c_~next~0 (- 5)) (- 2)) c_~j~0)) (.cse5 (+ 2 c_~prev~0 c_~next~0)) (.cse7 (+ c_~next~0 1)) (.cse4 (div (+ .cse6 c_~next~0 (- 5)) (- 2))) (.cse11 (+ 2 c_~next~0 c_~cur~0))) (and (= (+ (- 1) c_~i~0) 0) (forall ((v_~cur~0_39 Int)) (or (not (<= c_~next~0 v_~cur~0_39)) (forall ((v_~prev~0_37 Int) (v_~next~0_36 Int)) (or (< v_~next~0_36 (+ c_~prev~0 (* 2 v_~cur~0_39))) (and (forall ((aux_div_v_~cur~0_35_51 Int) (aux_div_aux_mod_v_~next~0_33_56_89 Int) (aux_mod_aux_mod_v_~next~0_33_56_89 Int)) (let ((.cse1 (+ (* v_~prev~0_37 3) v_~next~0_36)) (.cse0 (* aux_div_aux_mod_v_~next~0_33_56_89 2))) (or (>= aux_mod_aux_mod_v_~next~0_33_56_89 2) (> 0 aux_mod_aux_mod_v_~next~0_33_56_89) (< aux_div_v_~cur~0_35_51 (+ v_~next~0_36 1)) (<= 0 (+ (div (+ (* 2 v_~next~0_36) (* aux_div_aux_mod_v_~next~0_33_56_89 (- 3)) (* (- 1) c_~j~0) (* (- 2) aux_mod_aux_mod_v_~next~0_33_56_89) (* 5 v_~prev~0_37)) 4) aux_div_aux_mod_v_~next~0_33_56_89 (* 2 aux_div_v_~cur~0_35_51))) (<= (+ aux_mod_aux_mod_v_~next~0_33_56_89 14 c_~i~0 .cse0) .cse1) (< .cse1 (+ aux_mod_aux_mod_v_~next~0_33_56_89 c_~i~0 12 .cse0))))) (forall ((aux_div_v_~cur~0_35_51 Int) (aux_mod_aux_mod_v_~next~0_33_56_89 Int) (aux_div_aux_mod_v_~next~0_33_56_89 Int)) (let ((.cse3 (+ (* v_~prev~0_37 3) v_~next~0_36)) (.cse2 (* aux_div_aux_mod_v_~next~0_33_56_89 2))) (or (>= aux_mod_aux_mod_v_~next~0_33_56_89 2) (<= (+ aux_mod_aux_mod_v_~next~0_33_56_89 c_~j~0 14 .cse2) .cse3) (> 0 aux_mod_aux_mod_v_~next~0_33_56_89) (< aux_div_v_~cur~0_35_51 (+ v_~next~0_36 1)) (< .cse3 (+ aux_mod_aux_mod_v_~next~0_33_56_89 c_~j~0 12 .cse2)) (<= 0 (+ aux_div_aux_mod_v_~next~0_33_56_89 (div (+ (* 2 v_~next~0_36) (* aux_div_aux_mod_v_~next~0_33_56_89 (- 3)) (* (- 2) aux_mod_aux_mod_v_~next~0_33_56_89) (* 5 v_~prev~0_37)) 4) (* 2 aux_div_v_~cur~0_35_51))))))) (< v_~prev~0_37 (+ c_~prev~0 v_~cur~0_39)))))) (<= .cse4 .cse5) (<= 144 (+ (* c_~prev~0 34) (* 55 c_~cur~0))) (< (div (+ (- 1) c_~prev~0 .cse6) (- 2)) .cse7) (<= (div (+ (- 9) .cse6 c_~next~0 c_~cur~0) (- 2)) .cse8) (forall ((v_~cur~0_35 Int)) (or (not (<= c_~next~0 v_~cur~0_35)) (and (forall ((aux_div_v_~next~0_33_56 Int) (aux_mod_v_~next~0_33_56 Int)) (or (>= aux_mod_v_~next~0_33_56 2) (not (<= (+ (* 2 v_~cur~0_35) c_~prev~0 (* 2 aux_div_v_~next~0_33_56)) (+ aux_mod_v_~next~0_33_56 9 c_~i~0))) (> 0 aux_mod_v_~next~0_33_56) (<= (+ c_~j~0 (* 5 aux_div_v_~next~0_33_56) v_~cur~0_35) (+ 22 (* 2 c_~i~0) (* aux_mod_v_~next~0_33_56 2))))) (forall ((aux_div_v_~next~0_33_56 Int) (aux_mod_v_~next~0_33_56 Int)) (or (>= aux_mod_v_~next~0_33_56 2) (> 0 aux_mod_v_~next~0_33_56) (<= (+ (* 5 aux_div_v_~next~0_33_56) v_~cur~0_35) (+ 22 (* 2 c_~j~0) (* aux_mod_v_~next~0_33_56 2))) (not (<= (+ (* 2 v_~cur~0_35) c_~prev~0 (* 2 aux_div_v_~next~0_33_56)) (+ aux_mod_v_~next~0_33_56 c_~j~0 9)))))))) (forall ((aux_mod_v_~cur~0_34_56 Int) (aux_div_v_~cur~0_34_56 Int)) (or (> 0 aux_mod_v_~cur~0_34_56) (>= aux_mod_v_~cur~0_34_56 2) (not (<= (+ c_~prev~0 c_~next~0 (* 2 aux_div_v_~cur~0_34_56)) (+ 7 c_~i~0 aux_mod_v_~cur~0_34_56))) (<= (+ (* 5 aux_div_v_~cur~0_34_56) c_~j~0 c_~prev~0) (+ (* 2 aux_mod_v_~cur~0_34_56) (* 2 c_~i~0) 17)))) (<= (+ c_~j~0 (div (+ (- 9) .cse9 c_~next~0 c_~cur~0) (- 2))) .cse8) (<= (+ (div (+ (- 3) .cse9 c_~cur~0) (- 2)) c_~j~0) .cse7) (<= .cse10 .cse11) (forall ((aux_mod_v_~cur~0_34_56 Int) (aux_div_v_~cur~0_34_56 Int)) (or (<= (+ (* 5 aux_div_v_~cur~0_34_56) c_~prev~0) (+ (* 2 aux_mod_v_~cur~0_34_56) (* 2 c_~j~0) 17)) (> 0 aux_mod_v_~cur~0_34_56) (>= aux_mod_v_~cur~0_34_56 2) (not (<= (+ c_~prev~0 c_~next~0 (* 2 aux_div_v_~cur~0_34_56)) (+ 7 c_~j~0 aux_mod_v_~cur~0_34_56))))) (forall ((v_~cur~0_39 Int) (v_~prev~0_37 Int) (v_~next~0_36 Int)) (or (< v_~next~0_36 (+ c_~next~0 (* 2 v_~cur~0_39))) (and (forall ((aux_div_v_~cur~0_35_51 Int) (aux_div_aux_mod_v_~next~0_33_56_89 Int) (aux_mod_aux_mod_v_~next~0_33_56_89 Int)) (let ((.cse13 (+ (* v_~prev~0_37 3) v_~next~0_36)) (.cse12 (* aux_div_aux_mod_v_~next~0_33_56_89 2))) (or (>= aux_mod_aux_mod_v_~next~0_33_56_89 2) (> 0 aux_mod_aux_mod_v_~next~0_33_56_89) (< aux_div_v_~cur~0_35_51 (+ v_~next~0_36 1)) (<= 0 (+ (div (+ (* 2 v_~next~0_36) (* aux_div_aux_mod_v_~next~0_33_56_89 (- 3)) (* (- 1) c_~j~0) (* (- 2) aux_mod_aux_mod_v_~next~0_33_56_89) (* 5 v_~prev~0_37)) 4) aux_div_aux_mod_v_~next~0_33_56_89 (* 2 aux_div_v_~cur~0_35_51))) (<= (+ aux_mod_aux_mod_v_~next~0_33_56_89 14 c_~i~0 .cse12) .cse13) (< .cse13 (+ aux_mod_aux_mod_v_~next~0_33_56_89 c_~i~0 12 .cse12))))) (forall ((aux_div_v_~cur~0_35_51 Int) (aux_mod_aux_mod_v_~next~0_33_56_89 Int) (aux_div_aux_mod_v_~next~0_33_56_89 Int)) (let ((.cse15 (+ (* v_~prev~0_37 3) v_~next~0_36)) (.cse14 (* aux_div_aux_mod_v_~next~0_33_56_89 2))) (or (>= aux_mod_aux_mod_v_~next~0_33_56_89 2) (<= (+ aux_mod_aux_mod_v_~next~0_33_56_89 c_~j~0 14 .cse14) .cse15) (> 0 aux_mod_aux_mod_v_~next~0_33_56_89) (< aux_div_v_~cur~0_35_51 (+ v_~next~0_36 1)) (< .cse15 (+ aux_mod_aux_mod_v_~next~0_33_56_89 c_~j~0 12 .cse14)) (<= 0 (+ aux_div_aux_mod_v_~next~0_33_56_89 (div (+ (* 2 v_~next~0_36) (* aux_div_aux_mod_v_~next~0_33_56_89 (- 3)) (* (- 2) aux_mod_aux_mod_v_~next~0_33_56_89) (* 5 v_~prev~0_37)) 4) (* 2 aux_div_v_~cur~0_35_51))))))) (< v_~cur~0_39 (+ c_~prev~0 c_~next~0)) (< v_~prev~0_37 (+ c_~next~0 v_~cur~0_39)))) (< (+ c_~i~0 (* 2 c_~j~0)) .cse16) (forall ((v_~prev~0_37 Int) (v_~next~0_36 Int)) (or (and (forall ((aux_div_v_~cur~0_35_51 Int) (aux_div_aux_mod_v_~next~0_33_56_89 Int) (aux_mod_aux_mod_v_~next~0_33_56_89 Int)) (let ((.cse18 (+ (* v_~prev~0_37 3) v_~next~0_36)) (.cse17 (* aux_div_aux_mod_v_~next~0_33_56_89 2))) (or (>= aux_mod_aux_mod_v_~next~0_33_56_89 2) (> 0 aux_mod_aux_mod_v_~next~0_33_56_89) (< aux_div_v_~cur~0_35_51 (+ v_~next~0_36 1)) (<= 0 (+ (div (+ (* 2 v_~next~0_36) (* aux_div_aux_mod_v_~next~0_33_56_89 (- 3)) (* (- 1) c_~j~0) (* (- 2) aux_mod_aux_mod_v_~next~0_33_56_89) (* 5 v_~prev~0_37)) 4) aux_div_aux_mod_v_~next~0_33_56_89 (* 2 aux_div_v_~cur~0_35_51))) (<= (+ aux_mod_aux_mod_v_~next~0_33_56_89 14 c_~i~0 .cse17) .cse18) (< .cse18 (+ aux_mod_aux_mod_v_~next~0_33_56_89 c_~i~0 12 .cse17))))) (forall ((aux_div_v_~cur~0_35_51 Int) (aux_mod_aux_mod_v_~next~0_33_56_89 Int) (aux_div_aux_mod_v_~next~0_33_56_89 Int)) (let ((.cse20 (+ (* v_~prev~0_37 3) v_~next~0_36)) (.cse19 (* aux_div_aux_mod_v_~next~0_33_56_89 2))) (or (>= aux_mod_aux_mod_v_~next~0_33_56_89 2) (<= (+ aux_mod_aux_mod_v_~next~0_33_56_89 c_~j~0 14 .cse19) .cse20) (> 0 aux_mod_aux_mod_v_~next~0_33_56_89) (< aux_div_v_~cur~0_35_51 (+ v_~next~0_36 1)) (< .cse20 (+ aux_mod_aux_mod_v_~next~0_33_56_89 c_~j~0 12 .cse19)) (<= 0 (+ aux_div_aux_mod_v_~next~0_33_56_89 (div (+ (* 2 v_~next~0_36) (* aux_div_aux_mod_v_~next~0_33_56_89 (- 3)) (* (- 2) aux_mod_aux_mod_v_~next~0_33_56_89) (* 5 v_~prev~0_37)) 4) (* 2 aux_div_v_~cur~0_35_51))))))) (< v_~next~0_36 (+ c_~prev~0 c_~next~0)) (< v_~prev~0_37 c_~next~0))) (< (+ (div (+ (- 1) c_~prev~0 .cse9) (- 2)) c_~j~0) .cse7) (forall ((aux_div_v_~next~0_33_56 Int) (v_~cur~0_35 Int) (aux_mod_v_~next~0_33_56 Int)) (or (>= aux_mod_v_~next~0_33_56 2) (> 0 aux_mod_v_~next~0_33_56) (< (+ aux_mod_v_~next~0_33_56 c_~j~0 9) (+ (* 2 v_~cur~0_35) c_~next~0 (* 2 aux_div_v_~next~0_33_56))) (<= (+ (* 5 aux_div_v_~next~0_33_56) v_~cur~0_35) (+ 22 (* 2 c_~j~0) (* aux_mod_v_~next~0_33_56 2))) (< v_~cur~0_35 (+ c_~prev~0 c_~next~0)))) (< c_~j~0 .cse16) (= (+ (- 1) c_~j~0) 0) (<= 144 (+ (* c_~next~0 55) (* 34 c_~cur~0))) (forall ((aux_div_v_~next~0_33_56 Int) (v_~cur~0_35 Int) (aux_mod_v_~next~0_33_56 Int)) (or (>= aux_mod_v_~next~0_33_56 2) (> 0 aux_mod_v_~next~0_33_56) (< (+ aux_mod_v_~next~0_33_56 c_~j~0 9) (+ (* 2 v_~cur~0_35) c_~next~0 (* 2 aux_div_v_~next~0_33_56))) (<= (+ (* 5 aux_div_v_~next~0_33_56) v_~cur~0_35) (+ 22 (* 2 c_~j~0) (* aux_mod_v_~next~0_33_56 2))) (< v_~cur~0_35 (+ c_~next~0 c_~cur~0)))) (<= .cse10 .cse5) (forall ((aux_div_v_~cur~0_35_51 Int) (aux_mod_aux_mod_v_~next~0_33_56_89 Int) (aux_div_aux_mod_v_~next~0_33_56_89 Int)) (let ((.cse22 (* aux_div_aux_mod_v_~next~0_33_56_89 2)) (.cse21 (+ (* 3 c_~prev~0) c_~next~0))) (or (<= 0 (+ aux_div_aux_mod_v_~next~0_33_56_89 (div (+ (* 5 c_~prev~0) (* aux_div_aux_mod_v_~next~0_33_56_89 (- 3)) (* (- 2) aux_mod_aux_mod_v_~next~0_33_56_89) (* 2 c_~next~0)) 4) (* 2 aux_div_v_~cur~0_35_51))) (>= aux_mod_aux_mod_v_~next~0_33_56_89 2) (< .cse21 (+ aux_mod_aux_mod_v_~next~0_33_56_89 c_~j~0 12 .cse22)) (< aux_div_v_~cur~0_35_51 (+ c_~next~0 1)) (> 0 aux_mod_aux_mod_v_~next~0_33_56_89) (<= (+ aux_mod_aux_mod_v_~next~0_33_56_89 c_~j~0 14 .cse22) .cse21)))) (<= 2 c_~cur~0) (forall ((v_~prev~0_37 Int)) (or (not (<= c_~cur~0 v_~prev~0_37)) (and (forall ((aux_div_v_~cur~0_35_51 Int) (aux_div_aux_mod_v_~next~0_33_56_89 Int) (aux_mod_aux_mod_v_~next~0_33_56_89 Int)) (let ((.cse24 (+ (* v_~prev~0_37 3) c_~next~0)) (.cse23 (* aux_div_aux_mod_v_~next~0_33_56_89 2))) (or (<= (+ aux_mod_aux_mod_v_~next~0_33_56_89 14 c_~i~0 .cse23) .cse24) (>= aux_mod_aux_mod_v_~next~0_33_56_89 2) (< aux_div_v_~cur~0_35_51 (+ c_~next~0 1)) (> 0 aux_mod_aux_mod_v_~next~0_33_56_89) (< .cse24 (+ aux_mod_aux_mod_v_~next~0_33_56_89 c_~i~0 12 .cse23)) (<= 0 (+ aux_div_aux_mod_v_~next~0_33_56_89 (* 2 aux_div_v_~cur~0_35_51) (div (+ (* aux_div_aux_mod_v_~next~0_33_56_89 (- 3)) (* (- 1) c_~j~0) (* (- 2) aux_mod_aux_mod_v_~next~0_33_56_89) (* 2 c_~next~0) (* 5 v_~prev~0_37)) 4)))))) (forall ((aux_div_v_~cur~0_35_51 Int) (aux_mod_aux_mod_v_~next~0_33_56_89 Int) (aux_div_aux_mod_v_~next~0_33_56_89 Int)) (let ((.cse26 (* aux_div_aux_mod_v_~next~0_33_56_89 2)) (.cse25 (+ (* v_~prev~0_37 3) c_~next~0))) (or (>= aux_mod_aux_mod_v_~next~0_33_56_89 2) (< aux_div_v_~cur~0_35_51 (+ c_~next~0 1)) (> 0 aux_mod_aux_mod_v_~next~0_33_56_89) (< .cse25 (+ aux_mod_aux_mod_v_~next~0_33_56_89 c_~j~0 12 .cse26)) (<= 0 (+ aux_div_aux_mod_v_~next~0_33_56_89 (div (+ (* aux_div_aux_mod_v_~next~0_33_56_89 (- 3)) (* (- 2) aux_mod_aux_mod_v_~next~0_33_56_89) (* 2 c_~next~0) (* 5 v_~prev~0_37)) 4) (* 2 aux_div_v_~cur~0_35_51))) (<= (+ aux_mod_aux_mod_v_~next~0_33_56_89 c_~j~0 14 .cse26) .cse25))))))) (<= c_~j~0 1) (<= (div (+ (- 3) .cse6 c_~cur~0) (- 2)) .cse7) (forall ((v_~cur~0_39 Int) (v_~prev~0_37 Int) (v_~next~0_36 Int)) (or (< v_~next~0_36 (+ c_~next~0 (* 2 v_~cur~0_39))) (< v_~cur~0_39 (+ c_~next~0 c_~cur~0)) (and (forall ((aux_div_v_~cur~0_35_51 Int) (aux_div_aux_mod_v_~next~0_33_56_89 Int) (aux_mod_aux_mod_v_~next~0_33_56_89 Int)) (let ((.cse28 (+ (* v_~prev~0_37 3) v_~next~0_36)) (.cse27 (* aux_div_aux_mod_v_~next~0_33_56_89 2))) (or (>= aux_mod_aux_mod_v_~next~0_33_56_89 2) (> 0 aux_mod_aux_mod_v_~next~0_33_56_89) (< aux_div_v_~cur~0_35_51 (+ v_~next~0_36 1)) (<= 0 (+ (div (+ (* 2 v_~next~0_36) (* aux_div_aux_mod_v_~next~0_33_56_89 (- 3)) (* (- 1) c_~j~0) (* (- 2) aux_mod_aux_mod_v_~next~0_33_56_89) (* 5 v_~prev~0_37)) 4) aux_div_aux_mod_v_~next~0_33_56_89 (* 2 aux_div_v_~cur~0_35_51))) (<= (+ aux_mod_aux_mod_v_~next~0_33_56_89 14 c_~i~0 .cse27) .cse28) (< .cse28 (+ aux_mod_aux_mod_v_~next~0_33_56_89 c_~i~0 12 .cse27))))) (forall ((aux_div_v_~cur~0_35_51 Int) (aux_mod_aux_mod_v_~next~0_33_56_89 Int) (aux_div_aux_mod_v_~next~0_33_56_89 Int)) (let ((.cse30 (+ (* v_~prev~0_37 3) v_~next~0_36)) (.cse29 (* aux_div_aux_mod_v_~next~0_33_56_89 2))) (or (>= aux_mod_aux_mod_v_~next~0_33_56_89 2) (<= (+ aux_mod_aux_mod_v_~next~0_33_56_89 c_~j~0 14 .cse29) .cse30) (> 0 aux_mod_aux_mod_v_~next~0_33_56_89) (< aux_div_v_~cur~0_35_51 (+ v_~next~0_36 1)) (< .cse30 (+ aux_mod_aux_mod_v_~next~0_33_56_89 c_~j~0 12 .cse29)) (<= 0 (+ aux_div_aux_mod_v_~next~0_33_56_89 (div (+ (* 2 v_~next~0_36) (* aux_div_aux_mod_v_~next~0_33_56_89 (- 3)) (* (- 2) aux_mod_aux_mod_v_~next~0_33_56_89) (* 5 v_~prev~0_37)) 4) (* 2 aux_div_v_~cur~0_35_51))))))) (< v_~prev~0_37 (+ c_~next~0 v_~cur~0_39)))) (<= 1 c_~prev~0) (forall ((aux_div_v_~next~0_33_56 Int) (v_~cur~0_35 Int) (aux_mod_v_~next~0_33_56 Int)) (or (>= aux_mod_v_~next~0_33_56 2) (> 0 aux_mod_v_~next~0_33_56) (< v_~cur~0_35 (+ c_~prev~0 c_~next~0)) (< (+ aux_mod_v_~next~0_33_56 9 c_~i~0) (+ (* 2 v_~cur~0_35) c_~next~0 (* 2 aux_div_v_~next~0_33_56))) (<= (+ c_~j~0 (* 5 aux_div_v_~next~0_33_56) v_~cur~0_35) (+ 22 (* 2 c_~i~0) (* aux_mod_v_~next~0_33_56 2))))) (<= .cse4 .cse11) (forall ((aux_div_v_~cur~0_35_51 Int) (aux_div_aux_mod_v_~next~0_33_56_89 Int) (aux_mod_aux_mod_v_~next~0_33_56_89 Int)) (let ((.cse32 (* aux_div_aux_mod_v_~next~0_33_56_89 2)) (.cse31 (+ (* 3 c_~prev~0) c_~next~0))) (or (>= aux_mod_aux_mod_v_~next~0_33_56_89 2) (< aux_div_v_~cur~0_35_51 (+ c_~next~0 1)) (<= 0 (+ aux_div_aux_mod_v_~next~0_33_56_89 (div (+ (* 5 c_~prev~0) (* aux_div_aux_mod_v_~next~0_33_56_89 (- 3)) (* (- 1) c_~j~0) (* (- 2) aux_mod_aux_mod_v_~next~0_33_56_89) (* 2 c_~next~0)) 4) (* 2 aux_div_v_~cur~0_35_51))) (> 0 aux_mod_aux_mod_v_~next~0_33_56_89) (< .cse31 (+ aux_mod_aux_mod_v_~next~0_33_56_89 c_~i~0 12 .cse32)) (<= (+ aux_mod_aux_mod_v_~next~0_33_56_89 14 c_~i~0 .cse32) .cse31)))) (forall ((aux_div_v_~next~0_33_56 Int) (v_~cur~0_35 Int) (aux_mod_v_~next~0_33_56 Int)) (or (>= aux_mod_v_~next~0_33_56 2) (> 0 aux_mod_v_~next~0_33_56) (< (+ aux_mod_v_~next~0_33_56 9 c_~i~0) (+ (* 2 v_~cur~0_35) c_~next~0 (* 2 aux_div_v_~next~0_33_56))) (<= (+ c_~j~0 (* 5 aux_div_v_~next~0_33_56) v_~cur~0_35) (+ 22 (* 2 c_~i~0) (* aux_mod_v_~next~0_33_56 2))) (< v_~cur~0_35 (+ c_~next~0 c_~cur~0)))) (<= c_~i~0 1) (forall ((v_~cur~0_35 Int)) (or (not (<= c_~next~0 v_~cur~0_35)) (and (forall ((aux_div_v_~next~0_33_56 Int) (aux_mod_v_~next~0_33_56 Int)) (or (>= aux_mod_v_~next~0_33_56 2) (> 0 aux_mod_v_~next~0_33_56) (< (+ aux_mod_v_~next~0_33_56 c_~j~0 9) (+ (* 2 v_~cur~0_35) (* 2 aux_div_v_~next~0_33_56) c_~cur~0)) (<= (+ (* 5 aux_div_v_~next~0_33_56) v_~cur~0_35) (+ 22 (* 2 c_~j~0) (* aux_mod_v_~next~0_33_56 2))))) (forall ((aux_div_v_~next~0_33_56 Int) (aux_mod_v_~next~0_33_56 Int)) (or (< (+ aux_mod_v_~next~0_33_56 9 c_~i~0) (+ (* 2 v_~cur~0_35) (* 2 aux_div_v_~next~0_33_56) c_~cur~0)) (>= aux_mod_v_~next~0_33_56 2) (> 0 aux_mod_v_~next~0_33_56) (<= (+ c_~j~0 (* 5 aux_div_v_~next~0_33_56) v_~cur~0_35) (+ 22 (* 2 c_~i~0) (* aux_mod_v_~next~0_33_56 2)))))))) (forall ((v_~prev~0_37 Int) (v_~next~0_36 Int)) (or (and (forall ((aux_div_v_~cur~0_35_51 Int) (aux_div_aux_mod_v_~next~0_33_56_89 Int) (aux_mod_aux_mod_v_~next~0_33_56_89 Int)) (let ((.cse34 (+ (* v_~prev~0_37 3) v_~next~0_36)) (.cse33 (* aux_div_aux_mod_v_~next~0_33_56_89 2))) (or (>= aux_mod_aux_mod_v_~next~0_33_56_89 2) (> 0 aux_mod_aux_mod_v_~next~0_33_56_89) (< aux_div_v_~cur~0_35_51 (+ v_~next~0_36 1)) (<= 0 (+ (div (+ (* 2 v_~next~0_36) (* aux_div_aux_mod_v_~next~0_33_56_89 (- 3)) (* (- 1) c_~j~0) (* (- 2) aux_mod_aux_mod_v_~next~0_33_56_89) (* 5 v_~prev~0_37)) 4) aux_div_aux_mod_v_~next~0_33_56_89 (* 2 aux_div_v_~cur~0_35_51))) (<= (+ aux_mod_aux_mod_v_~next~0_33_56_89 14 c_~i~0 .cse33) .cse34) (< .cse34 (+ aux_mod_aux_mod_v_~next~0_33_56_89 c_~i~0 12 .cse33))))) (forall ((aux_div_v_~cur~0_35_51 Int) (aux_mod_aux_mod_v_~next~0_33_56_89 Int) (aux_div_aux_mod_v_~next~0_33_56_89 Int)) (let ((.cse36 (+ (* v_~prev~0_37 3) v_~next~0_36)) (.cse35 (* aux_div_aux_mod_v_~next~0_33_56_89 2))) (or (>= aux_mod_aux_mod_v_~next~0_33_56_89 2) (<= (+ aux_mod_aux_mod_v_~next~0_33_56_89 c_~j~0 14 .cse35) .cse36) (> 0 aux_mod_aux_mod_v_~next~0_33_56_89) (< aux_div_v_~cur~0_35_51 (+ v_~next~0_36 1)) (< .cse36 (+ aux_mod_aux_mod_v_~next~0_33_56_89 c_~j~0 12 .cse35)) (<= 0 (+ aux_div_aux_mod_v_~next~0_33_56_89 (div (+ (* 2 v_~next~0_36) (* aux_div_aux_mod_v_~next~0_33_56_89 (- 3)) (* (- 2) aux_mod_aux_mod_v_~next~0_33_56_89) (* 5 v_~prev~0_37)) 4) (* 2 aux_div_v_~cur~0_35_51))))))) (< v_~prev~0_37 c_~next~0) (< v_~next~0_36 (+ c_~next~0 c_~cur~0))))))) is different from false [2022-02-16 02:42:30,206 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse2 (+ (* 2 c_~next~0) 4 c_~cur~0)) (.cse3 (* (- 1) c_~i~0)) (.cse7 (+ c_~next~0 c_~cur~0)) (.cse9 (* c_~next~0 55)) (.cse0 (* c_~prev~0 34)) (.cse4 (+ c_~next~0 1)) (.cse8 (* c_~next~0 34)) (.cse1 (* (- 1) c_~j~0)) (.cse5 (+ 2 c_~next~0 c_~cur~0)) (.cse6 (+ c_~i~0 (* 2 c_~j~0))) (.cse14 (+ c_~prev~0 c_~cur~0))) (and (= (+ (- 1) c_~i~0) 0) (<= 144 (+ .cse0 (* 55 c_~cur~0))) (<= (div (+ (- 9) .cse1 c_~next~0 c_~cur~0) (- 2)) .cse2) (<= (+ c_~j~0 (div (+ (- 9) .cse3 c_~next~0 c_~cur~0) (- 2))) .cse2) (<= (+ (div (+ (- 3) .cse3 c_~cur~0) (- 2)) c_~j~0) .cse4) (<= (+ (div (+ .cse3 c_~next~0 (- 5)) (- 2)) c_~j~0) .cse5) (<= 2 c_~prev~0) (< .cse6 .cse7) (<= 144 (+ .cse8 (* 21 c_~prev~0))) (< c_~j~0 .cse7) (= (+ (- 1) c_~j~0) 0) (<= 144 (+ .cse9 (* 34 c_~cur~0))) (<= 144 (+ .cse9 .cse0)) (forall ((aux_div_v_~next~0_33_56 Int) (v_~cur~0_35 Int) (aux_mod_v_~next~0_33_56 Int)) (or (>= aux_mod_v_~next~0_33_56 2) (> 0 aux_mod_v_~next~0_33_56) (< (+ aux_mod_v_~next~0_33_56 c_~j~0 9) (+ (* 2 v_~cur~0_35) c_~next~0 (* 2 aux_div_v_~next~0_33_56))) (<= (+ (* 5 aux_div_v_~next~0_33_56) v_~cur~0_35) (+ 22 (* 2 c_~j~0) (* aux_mod_v_~next~0_33_56 2))) (< v_~cur~0_35 (+ c_~next~0 c_~cur~0)))) (<= 2 c_~cur~0) (forall ((v_~prev~0_37 Int)) (or (not (<= c_~cur~0 v_~prev~0_37)) (and (forall ((aux_div_v_~cur~0_35_51 Int) (aux_div_aux_mod_v_~next~0_33_56_89 Int) (aux_mod_aux_mod_v_~next~0_33_56_89 Int)) (let ((.cse11 (+ (* v_~prev~0_37 3) c_~next~0)) (.cse10 (* aux_div_aux_mod_v_~next~0_33_56_89 2))) (or (<= (+ aux_mod_aux_mod_v_~next~0_33_56_89 14 c_~i~0 .cse10) .cse11) (>= aux_mod_aux_mod_v_~next~0_33_56_89 2) (< aux_div_v_~cur~0_35_51 (+ c_~next~0 1)) (> 0 aux_mod_aux_mod_v_~next~0_33_56_89) (< .cse11 (+ aux_mod_aux_mod_v_~next~0_33_56_89 c_~i~0 12 .cse10)) (<= 0 (+ aux_div_aux_mod_v_~next~0_33_56_89 (* 2 aux_div_v_~cur~0_35_51) (div (+ (* aux_div_aux_mod_v_~next~0_33_56_89 (- 3)) (* (- 1) c_~j~0) (* (- 2) aux_mod_aux_mod_v_~next~0_33_56_89) (* 2 c_~next~0) (* 5 v_~prev~0_37)) 4)))))) (forall ((aux_div_v_~cur~0_35_51 Int) (aux_mod_aux_mod_v_~next~0_33_56_89 Int) (aux_div_aux_mod_v_~next~0_33_56_89 Int)) (let ((.cse13 (* aux_div_aux_mod_v_~next~0_33_56_89 2)) (.cse12 (+ (* v_~prev~0_37 3) c_~next~0))) (or (>= aux_mod_aux_mod_v_~next~0_33_56_89 2) (< aux_div_v_~cur~0_35_51 (+ c_~next~0 1)) (> 0 aux_mod_aux_mod_v_~next~0_33_56_89) (< .cse12 (+ aux_mod_aux_mod_v_~next~0_33_56_89 c_~j~0 12 .cse13)) (<= 0 (+ aux_div_aux_mod_v_~next~0_33_56_89 (div (+ (* aux_div_aux_mod_v_~next~0_33_56_89 (- 3)) (* (- 2) aux_mod_aux_mod_v_~next~0_33_56_89) (* 2 c_~next~0) (* 5 v_~prev~0_37)) 4) (* 2 aux_div_v_~cur~0_35_51))) (<= (+ aux_mod_aux_mod_v_~next~0_33_56_89 c_~j~0 14 .cse13) .cse12))))))) (<= c_~j~0 1) (< c_~j~0 .cse14) (<= (div (+ (- 3) .cse1 c_~cur~0) (- 2)) .cse4) (forall ((v_~cur~0_39 Int) (v_~prev~0_37 Int) (v_~next~0_36 Int)) (or (< v_~next~0_36 (+ c_~next~0 (* 2 v_~cur~0_39))) (< v_~cur~0_39 (+ c_~next~0 c_~cur~0)) (and (forall ((aux_div_v_~cur~0_35_51 Int) (aux_div_aux_mod_v_~next~0_33_56_89 Int) (aux_mod_aux_mod_v_~next~0_33_56_89 Int)) (let ((.cse16 (+ (* v_~prev~0_37 3) v_~next~0_36)) (.cse15 (* aux_div_aux_mod_v_~next~0_33_56_89 2))) (or (>= aux_mod_aux_mod_v_~next~0_33_56_89 2) (> 0 aux_mod_aux_mod_v_~next~0_33_56_89) (< aux_div_v_~cur~0_35_51 (+ v_~next~0_36 1)) (<= 0 (+ (div (+ (* 2 v_~next~0_36) (* aux_div_aux_mod_v_~next~0_33_56_89 (- 3)) (* (- 1) c_~j~0) (* (- 2) aux_mod_aux_mod_v_~next~0_33_56_89) (* 5 v_~prev~0_37)) 4) aux_div_aux_mod_v_~next~0_33_56_89 (* 2 aux_div_v_~cur~0_35_51))) (<= (+ aux_mod_aux_mod_v_~next~0_33_56_89 14 c_~i~0 .cse15) .cse16) (< .cse16 (+ aux_mod_aux_mod_v_~next~0_33_56_89 c_~i~0 12 .cse15))))) (forall ((aux_div_v_~cur~0_35_51 Int) (aux_mod_aux_mod_v_~next~0_33_56_89 Int) (aux_div_aux_mod_v_~next~0_33_56_89 Int)) (let ((.cse18 (+ (* v_~prev~0_37 3) v_~next~0_36)) (.cse17 (* aux_div_aux_mod_v_~next~0_33_56_89 2))) (or (>= aux_mod_aux_mod_v_~next~0_33_56_89 2) (<= (+ aux_mod_aux_mod_v_~next~0_33_56_89 c_~j~0 14 .cse17) .cse18) (> 0 aux_mod_aux_mod_v_~next~0_33_56_89) (< aux_div_v_~cur~0_35_51 (+ v_~next~0_36 1)) (< .cse18 (+ aux_mod_aux_mod_v_~next~0_33_56_89 c_~j~0 12 .cse17)) (<= 0 (+ aux_div_aux_mod_v_~next~0_33_56_89 (div (+ (* 2 v_~next~0_36) (* aux_div_aux_mod_v_~next~0_33_56_89 (- 3)) (* (- 2) aux_mod_aux_mod_v_~next~0_33_56_89) (* 5 v_~prev~0_37)) 4) (* 2 aux_div_v_~cur~0_35_51))))))) (< v_~prev~0_37 (+ c_~next~0 v_~cur~0_39)))) (<= 1 c_~prev~0) (<= 144 (+ .cse8 (* 21 c_~cur~0))) (<= (div (+ .cse1 c_~next~0 (- 5)) (- 2)) .cse5) (forall ((aux_div_v_~next~0_33_56 Int) (v_~cur~0_35 Int) (aux_mod_v_~next~0_33_56 Int)) (or (>= aux_mod_v_~next~0_33_56 2) (> 0 aux_mod_v_~next~0_33_56) (< (+ aux_mod_v_~next~0_33_56 9 c_~i~0) (+ (* 2 v_~cur~0_35) c_~next~0 (* 2 aux_div_v_~next~0_33_56))) (<= (+ c_~j~0 (* 5 aux_div_v_~next~0_33_56) v_~cur~0_35) (+ 22 (* 2 c_~i~0) (* aux_mod_v_~next~0_33_56 2))) (< v_~cur~0_35 (+ c_~next~0 c_~cur~0)))) (<= 3 c_~next~0) (<= c_~i~0 1) (forall ((v_~cur~0_35 Int)) (or (not (<= c_~next~0 v_~cur~0_35)) (and (forall ((aux_div_v_~next~0_33_56 Int) (aux_mod_v_~next~0_33_56 Int)) (or (>= aux_mod_v_~next~0_33_56 2) (> 0 aux_mod_v_~next~0_33_56) (< (+ aux_mod_v_~next~0_33_56 c_~j~0 9) (+ (* 2 v_~cur~0_35) (* 2 aux_div_v_~next~0_33_56) c_~cur~0)) (<= (+ (* 5 aux_div_v_~next~0_33_56) v_~cur~0_35) (+ 22 (* 2 c_~j~0) (* aux_mod_v_~next~0_33_56 2))))) (forall ((aux_div_v_~next~0_33_56 Int) (aux_mod_v_~next~0_33_56 Int)) (or (< (+ aux_mod_v_~next~0_33_56 9 c_~i~0) (+ (* 2 v_~cur~0_35) (* 2 aux_div_v_~next~0_33_56) c_~cur~0)) (>= aux_mod_v_~next~0_33_56 2) (> 0 aux_mod_v_~next~0_33_56) (<= (+ c_~j~0 (* 5 aux_div_v_~next~0_33_56) v_~cur~0_35) (+ 22 (* 2 c_~i~0) (* aux_mod_v_~next~0_33_56 2)))))))) (< .cse6 .cse14))) is different from false Received shutdown request... [2022-02-16 02:45:26,486 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2022-02-16 02:45:26,486 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2022-02-16 02:45:26,486 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2022-02-16 02:45:27,528 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Forceful destruction successful, exit code 0 [2022-02-16 02:45:27,531 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-02-16 02:45:27,707 WARN L435 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forcibly destroying the process [2022-02-16 02:45:27,731 WARN L452 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-02-16 02:45:27,732 WARN L594 AbstractCegarLoop]: Verification canceled: while executing Executor. [2022-02-16 02:45:27,734 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (2 of 3 remaining) [2022-02-16 02:45:27,734 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATION (1 of 3 remaining) [2022-02-16 02:45:27,734 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1INUSE_VIOLATION (0 of 3 remaining) [2022-02-16 02:45:27,750 INFO L732 BasicCegarLoop]: Path program histogram: [4, 1, 1, 1, 1, 1] [2022-02-16 02:45:27,756 INFO L230 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-02-16 02:45:27,756 INFO L180 ceAbstractionStarter]: Computing trace abstraction results [2022-02-16 02:45:27,758 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.02 02:45:27 BasicIcfg [2022-02-16 02:45:27,758 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-02-16 02:45:27,759 INFO L158 Benchmark]: Toolchain (without parser) took 874266.43ms. Allocated memory was 206.6MB in the beginning and 328.2MB in the end (delta: 121.6MB). Free memory was 153.2MB in the beginning and 122.2MB in the end (delta: 30.9MB). Peak memory consumption was 153.4MB. Max. memory is 8.0GB. [2022-02-16 02:45:27,760 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 206.6MB. Free memory is still 170.9MB. There was no memory consumed. Max. memory is 8.0GB. [2022-02-16 02:45:27,767 INFO L158 Benchmark]: CACSL2BoogieTranslator took 649.94ms. Allocated memory is still 206.6MB. Free memory was 153.0MB in the beginning and 172.3MB in the end (delta: -19.3MB). Peak memory consumption was 8.9MB. Max. memory is 8.0GB. [2022-02-16 02:45:27,769 INFO L158 Benchmark]: Boogie Procedure Inliner took 55.77ms. Allocated memory is still 206.6MB. Free memory was 172.3MB in the beginning and 170.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-02-16 02:45:27,770 INFO L158 Benchmark]: Boogie Preprocessor took 16.55ms. Allocated memory is still 206.6MB. Free memory was 170.2MB in the beginning and 169.1MB in the end (delta: 1.0MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-02-16 02:45:27,773 INFO L158 Benchmark]: RCFGBuilder took 304.85ms. Allocated memory is still 206.6MB. Free memory was 168.6MB in the beginning and 156.0MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2022-02-16 02:45:27,773 INFO L158 Benchmark]: TraceAbstraction took 873232.13ms. Allocated memory was 206.6MB in the beginning and 328.2MB in the end (delta: 121.6MB). Free memory was 155.5MB in the beginning and 122.2MB in the end (delta: 33.3MB). Peak memory consumption was 154.9MB. Max. memory is 8.0GB. [2022-02-16 02:45:27,774 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.12ms. Allocated memory is still 206.6MB. Free memory is still 170.9MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 649.94ms. Allocated memory is still 206.6MB. Free memory was 153.0MB in the beginning and 172.3MB in the end (delta: -19.3MB). Peak memory consumption was 8.9MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 55.77ms. Allocated memory is still 206.6MB. Free memory was 172.3MB in the beginning and 170.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 16.55ms. Allocated memory is still 206.6MB. Free memory was 170.2MB in the beginning and 169.1MB in the end (delta: 1.0MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 304.85ms. Allocated memory is still 206.6MB. Free memory was 168.6MB in the beginning and 156.0MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * TraceAbstraction took 873232.13ms. Allocated memory was 206.6MB in the beginning and 328.2MB in the end (delta: 121.6MB). Free memory was 155.5MB in the beginning and 122.2MB in the end (delta: 33.3MB). Peak memory consumption was 154.9MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Independence relation benchmarks ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1, Independence queries for same thread: 0 - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - TimeoutResultAtElement [Line: 726]: Timeout (TraceAbstraction) Unable to prove that call to reach_error is unreachable Cancelled while executing Executor. - TimeoutResultAtElement [Line: 722]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while executing Executor. - TimeoutResultAtElement [Line: 721]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while executing Executor. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 112 locations, 3 error locations. Started 1 CEGAR loops. OverallTime: 873.1s, OverallIterations: 9, TraceHistogramMax: 0, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, PartialOrderReductionTime: 208.4s, HoareTripleCheckerStatistics: , PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2292occurred in iteration=0, InterpolantAutomatonStates: 154, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 662.2s InterpolantComputationTime, 1597 NumberOfCodeBlocks, 1582 NumberOfCodeBlocksAsserted, 23 NumberOfCheckSat, 2246 ConstructedInterpolants, 148 QuantifiedInterpolants, 29416 SizeOfPredicates, 104 NumberOfNonLiveVariables, 1433 ConjunctsInSsa, 116 ConjunctsInUnsatCore, 21 InterpolantComputations, 3 PerfectInterpolantSequences, 2568/5288 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown