/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-MCRwithoutDepranks-Lazy.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-820ea7a [2022-02-20 04:59:57,911 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 04:59:57,913 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 04:59:57,937 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 04:59:57,937 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 04:59:57,938 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 04:59:57,939 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 04:59:57,940 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 04:59:57,941 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 04:59:57,942 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 04:59:57,943 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 04:59:57,943 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 04:59:57,944 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 04:59:57,944 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 04:59:57,945 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 04:59:57,946 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 04:59:57,946 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 04:59:57,951 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 04:59:57,957 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 04:59:57,964 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 04:59:57,966 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 04:59:57,969 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 04:59:57,969 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 04:59:57,970 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 04:59:57,972 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 04:59:57,972 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 04:59:57,972 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 04:59:57,973 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 04:59:57,973 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 04:59:57,973 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 04:59:57,974 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 04:59:57,974 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 04:59:57,975 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 04:59:57,975 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 04:59:57,976 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 04:59:57,976 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 04:59:57,976 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 04:59:57,976 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 04:59:57,977 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 04:59:57,977 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 04:59:57,978 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 04:59:57,978 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-MCRwithoutDepranks-Lazy.epf [2022-02-20 04:59:57,994 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 04:59:57,995 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 04:59:57,995 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 04:59:57,995 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 04:59:57,996 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 04:59:57,996 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 04:59:57,996 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 04:59:57,996 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 04:59:57,996 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 04:59:57,997 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 04:59:57,997 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 04:59:57,997 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 04:59:57,997 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 04:59:57,997 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 04:59:57,997 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 04:59:57,997 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 04:59:57,997 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 04:59:57,998 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 04:59:57,998 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 04:59:57,998 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 04:59:57,998 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 04:59:57,998 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 04:59:57,998 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 04:59:57,998 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-02-20 04:59:57,998 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 04:59:57,999 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 04:59:57,999 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 04:59:57,999 INFO L138 SettingsManager]: * Construct finite automaton lazily=true [2022-02-20 04:59:58,000 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 04:59:58,000 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 04:59:58,000 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-20 04:59:58,000 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-20 04:59:58,001 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 04:59:58,001 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2022-02-20 04:59:58,001 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 04:59:58,001 INFO L138 SettingsManager]: * Partial Order Reduction in concurrent analysis=MCR_WITHOUT_DEPRANKS [2022-02-20 04:59:58,001 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-20 04:59:58,181 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 04:59:58,202 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 04:59:58,204 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 04:59:58,204 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 04:59:58,205 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 04:59:58,206 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-20 04:59:58,254 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/105c6aa69/97f54c8a7ba74e92a351ff66f7ea857a/FLAGba13c30d8 [2022-02-20 04:59:58,714 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 04:59:58,714 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread/fib_unsafe-5.i [2022-02-20 04:59:58,742 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/105c6aa69/97f54c8a7ba74e92a351ff66f7ea857a/FLAGba13c30d8 [2022-02-20 04:59:59,231 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/105c6aa69/97f54c8a7ba74e92a351ff66f7ea857a [2022-02-20 04:59:59,234 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 04:59:59,235 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-02-20 04:59:59,236 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 04:59:59,236 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 04:59:59,239 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 04:59:59,240 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 04:59:59" (1/1) ... [2022-02-20 04:59:59,241 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6896f0d1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:59:59, skipping insertion in model container [2022-02-20 04:59:59,241 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 04:59:59" (1/1) ... [2022-02-20 04:59:59,263 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 04:59:59,302 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 04:59:59,712 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-20 04:59:59,717 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 04:59:59,725 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 04:59:59,794 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-20 04:59:59,794 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 04:59:59,829 INFO L208 MainTranslator]: Completed translation [2022-02-20 04:59:59,829 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:59:59 WrapperNode [2022-02-20 04:59:59,830 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 04:59:59,831 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 04:59:59,831 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 04:59:59,831 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 04:59:59,838 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:59:59" (1/1) ... [2022-02-20 04:59:59,870 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:59:59" (1/1) ... [2022-02-20 04:59:59,897 INFO L137 Inliner]: procedures = 164, calls = 26, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 71 [2022-02-20 04:59:59,897 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 04:59:59,898 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 04:59:59,898 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 04:59:59,898 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 04:59:59,906 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:59:59" (1/1) ... [2022-02-20 04:59:59,906 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:59:59" (1/1) ... [2022-02-20 04:59:59,911 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:59:59" (1/1) ... [2022-02-20 04:59:59,912 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:59:59" (1/1) ... [2022-02-20 04:59:59,920 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:59:59" (1/1) ... [2022-02-20 04:59:59,924 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:59:59" (1/1) ... [2022-02-20 04:59:59,926 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:59:59" (1/1) ... [2022-02-20 04:59:59,928 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 04:59:59,929 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 04:59:59,929 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 04:59:59,929 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 04:59:59,944 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:59:59" (1/1) ... [2022-02-20 04:59:59,956 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 04:59:59,969 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 04:59:59,984 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-20 05:00:00,002 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-20 05:00:00,034 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2022-02-20 05:00:00,034 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2022-02-20 05:00:00,034 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2022-02-20 05:00:00,035 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2022-02-20 05:00:00,035 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-02-20 05:00:00,035 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-02-20 05:00:00,035 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 05:00:00,035 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-02-20 05:00:00,035 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-02-20 05:00:00,035 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-20 05:00:00,035 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-02-20 05:00:00,036 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 05:00:00,036 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 05:00:00,037 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-02-20 05:00:00,167 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 05:00:00,169 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 05:00:00,307 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 05:00:00,314 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 05:00:00,314 INFO L299 CfgBuilder]: Removed 3 assume(true) statements. [2022-02-20 05:00:00,316 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 05:00:00 BoogieIcfgContainer [2022-02-20 05:00:00,317 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 05:00:00,318 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 05:00:00,318 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 05:00:00,322 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 05:00:00,322 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 04:59:59" (1/3) ... [2022-02-20 05:00:00,323 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7a881372 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 05:00:00, skipping insertion in model container [2022-02-20 05:00:00,323 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:59:59" (2/3) ... [2022-02-20 05:00:00,323 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7a881372 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 05:00:00, skipping insertion in model container [2022-02-20 05:00:00,324 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 05:00:00" (3/3) ... [2022-02-20 05:00:00,325 INFO L111 eAbstractionObserver]: Analyzing ICFG fib_unsafe-5.i [2022-02-20 05:00:00,330 WARN L150 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-02-20 05:00:00,331 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 05:00:00,331 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-02-20 05:00:00,331 INFO L534 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-02-20 05:00:00,363 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 05:00:00,363 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 05:00:00,364 WARN L322 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 05:00:00,364 WARN L322 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 05:00:00,364 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 05:00:00,364 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 05:00:00,364 WARN L322 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 05:00:00,365 WARN L322 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 05:00:00,365 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 05:00:00,366 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 05:00:00,366 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 05:00:00,366 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 05:00:00,366 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~post1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 05:00:00,367 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~post1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 05:00:00,367 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~post1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 05:00:00,367 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~post1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 05:00:00,369 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~post1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 05:00:00,369 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~post1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 05:00:00,370 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 05:00:00,370 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 05:00:00,370 WARN L322 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 05:00:00,371 WARN L322 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 05:00:00,371 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 05:00:00,371 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 05:00:00,371 WARN L322 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 05:00:00,373 WARN L322 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 05:00:00,373 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 05:00:00,374 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 05:00:00,374 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 05:00:00,374 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 05:00:00,375 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~post2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 05:00:00,375 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~post2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 05:00:00,375 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~post2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 05:00:00,376 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~post2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 05:00:00,376 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~post2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 05:00:00,376 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~post2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 05:00:00,379 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~post1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 05:00:00,380 WARN L322 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 05:00:00,380 WARN L322 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 05:00:00,380 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 05:00:00,380 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 05:00:00,383 WARN L322 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 05:00:00,383 WARN L322 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 05:00:00,384 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 05:00:00,384 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~post2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 05:00:00,384 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 05:00:00,384 INFO L148 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-02-20 05:00:00,429 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2022-02-20 05:00:00,429 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 05:00:00,431 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-20 05:00:00,432 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-20 05:00:00,471 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 05:00:00,482 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=true, 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, mMcrOptimizeForkJoin=true, mMcrOverapproximateWrwc=true [2022-02-20 05:00:00,482 INFO L340 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2022-02-20 05:00:00,780 INFO L104 alCausalityReduction]: MaximalCausalityReduction evaluated 91 transitions and produced 92 states. [2022-02-20 05:00:00,782 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-02-20 05:00:00,786 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 05:00:00,786 INFO L85 PathProgramCache]: Analyzing trace with hash -1927097680, now seen corresponding path program 1 times [2022-02-20 05:00:00,795 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 05:00:00,796 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [549193130] [2022-02-20 05:00:00,804 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 05:00:00,804 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 05:00:01,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 05:00:01,138 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-20 05:00:01,139 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 05:00:01,139 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [549193130] [2022-02-20 05:00:01,140 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [549193130] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 05:00:01,140 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 05:00:01,141 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-20 05:00:01,142 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1284268298] [2022-02-20 05:00:01,142 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 05:00:01,145 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-02-20 05:00:01,145 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 05:00:01,165 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-02-20 05:00:01,166 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-02-20 05:00:01,166 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-20 05:00:01,168 INFO L470 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-02-20 05:00:01,169 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-20 05:00:01,169 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-02-20 05:00:01,234 INFO L104 alCausalityReduction]: MaximalCausalityReduction evaluated 91 transitions and produced 92 states. [2022-02-20 05:00:01,235 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-20 05:00:01,235 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-20 05:00:01,236 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-02-20 05:00:01,238 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 05:00:01,238 INFO L85 PathProgramCache]: Analyzing trace with hash 560415153, now seen corresponding path program 1 times [2022-02-20 05:00:01,239 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 05:00:01,239 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1516581530] [2022-02-20 05:00:01,240 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 05:00:01,242 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 05:00:01,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 05:00:01,331 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-20 05:00:01,332 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 05:00:01,332 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1516581530] [2022-02-20 05:00:01,332 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1516581530] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 05:00:01,332 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 05:00:01,332 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 05:00:01,332 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [393024732] [2022-02-20 05:00:01,332 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 05:00:01,333 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 05:00:01,334 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 05:00:01,334 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 05:00:01,335 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 05:00:01,335 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-20 05:00:01,335 INFO L470 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-02-20 05:00:01,335 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-20 05:00:01,335 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-02-20 05:00:01,335 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-02-20 05:00:01,453 INFO L104 alCausalityReduction]: MaximalCausalityReduction evaluated 114 transitions and produced 115 states. [2022-02-20 05:00:01,453 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-20 05:00:01,453 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 05:00:01,453 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-02-20 05:00:01,454 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-02-20 05:00:01,455 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 05:00:01,455 INFO L85 PathProgramCache]: Analyzing trace with hash -951035470, now seen corresponding path program 1 times [2022-02-20 05:00:01,455 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 05:00:01,455 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [499157879] [2022-02-20 05:00:01,455 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 05:00:01,456 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 05:00:01,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 05:00:01,566 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-20 05:00:01,566 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 05:00:01,567 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [499157879] [2022-02-20 05:00:01,567 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [499157879] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 05:00:01,567 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [194013965] [2022-02-20 05:00:01,567 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 05:00:01,567 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 05:00:01,567 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 05:00:01,569 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-20 05:00:01,570 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-20 05:00:01,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 05:00:01,649 INFO L263 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 4 conjunts are in the unsatisfiable core [2022-02-20 05:00:01,653 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 05:00:01,830 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-20 05:00:01,830 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 05:00:01,961 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-20 05:00:01,962 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [194013965] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 05:00:01,962 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-20 05:00:01,962 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2022-02-20 05:00:01,962 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1780513764] [2022-02-20 05:00:01,962 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-20 05:00:01,963 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-02-20 05:00:01,963 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 05:00:01,963 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-02-20 05:00:01,963 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2022-02-20 05:00:01,963 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-20 05:00:01,963 INFO L470 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-02-20 05:00:01,964 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-20 05:00:01,964 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-02-20 05:00:01,964 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-02-20 05:00:01,964 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-02-20 05:00:02,393 INFO L104 alCausalityReduction]: MaximalCausalityReduction evaluated 160 transitions and produced 159 states. [2022-02-20 05:00:02,393 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-20 05:00:02,394 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 05:00:02,395 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-02-20 05:00:02,422 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-02-20 05:00:02,612 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-20 05:00:02,612 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-02-20 05:00:02,613 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 05:00:02,613 INFO L85 PathProgramCache]: Analyzing trace with hash 1666707666, now seen corresponding path program 2 times [2022-02-20 05:00:02,613 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 05:00:02,613 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1981310068] [2022-02-20 05:00:02,613 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 05:00:02,613 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 05:00:02,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 05:00:02,726 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-20 05:00:02,727 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 05:00:02,727 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1981310068] [2022-02-20 05:00:02,728 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1981310068] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 05:00:02,728 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1286785470] [2022-02-20 05:00:02,728 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-02-20 05:00:02,728 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 05:00:02,728 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 05:00:02,732 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-20 05:00:02,733 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-20 05:00:02,870 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-02-20 05:00:02,870 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-20 05:00:02,872 INFO L263 TraceCheckSpWp]: Trace formula consists of 176 conjuncts, 8 conjunts are in the unsatisfiable core [2022-02-20 05:00:02,875 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 05:00:03,027 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-20 05:00:03,027 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 05:00:03,159 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-20 05:00:03,159 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1286785470] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 05:00:03,159 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-20 05:00:03,159 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 18 [2022-02-20 05:00:03,160 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [839500126] [2022-02-20 05:00:03,160 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-20 05:00:03,160 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-02-20 05:00:03,160 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 05:00:03,160 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-02-20 05:00:03,161 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=216, Unknown=0, NotChecked=0, Total=306 [2022-02-20 05:00:03,161 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-20 05:00:03,161 INFO L470 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-02-20 05:00:03,161 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-20 05:00:03,161 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-02-20 05:00:03,161 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-02-20 05:00:03,161 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2022-02-20 05:00:03,161 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-02-20 05:00:03,614 INFO L104 alCausalityReduction]: MaximalCausalityReduction evaluated 252 transitions and produced 244 states. [2022-02-20 05:00:03,614 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-20 05:00:03,614 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 05:00:03,614 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-02-20 05:00:03,614 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-02-20 05:00:03,631 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2022-02-20 05:00:03,827 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-20 05:00:03,827 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-02-20 05:00:03,828 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 05:00:03,828 INFO L85 PathProgramCache]: Analyzing trace with hash -1283180782, now seen corresponding path program 3 times [2022-02-20 05:00:03,828 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 05:00:03,828 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1831369328] [2022-02-20 05:00:03,828 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 05:00:03,828 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 05:00:03,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 05:00:04,050 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-20 05:00:04,050 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 05:00:04,050 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1831369328] [2022-02-20 05:00:04,051 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1831369328] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 05:00:04,051 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [351430349] [2022-02-20 05:00:04,051 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-02-20 05:00:04,051 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 05:00:04,051 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 05:00:04,055 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-20 05:00:04,057 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-20 05:00:04,136 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2022-02-20 05:00:04,136 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-20 05:00:04,137 INFO L263 TraceCheckSpWp]: Trace formula consists of 224 conjuncts, 16 conjunts are in the unsatisfiable core [2022-02-20 05:00:04,139 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 05:00:04,314 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-20 05:00:04,315 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 05:00:04,559 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-20 05:00:04,559 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [351430349] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 05:00:04,560 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-20 05:00:04,560 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 27 [2022-02-20 05:00:04,560 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [863840401] [2022-02-20 05:00:04,560 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-20 05:00:04,560 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-02-20 05:00:04,561 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 05:00:04,561 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-02-20 05:00:04,561 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=195, Invalid=507, Unknown=0, NotChecked=0, Total=702 [2022-02-20 05:00:04,561 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-20 05:00:04,562 INFO L470 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-02-20 05:00:04,562 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-20 05:00:04,562 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-02-20 05:00:04,562 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-02-20 05:00:04,562 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2022-02-20 05:00:04,562 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2022-02-20 05:00:04,562 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-02-20 05:00:05,280 INFO L104 alCausalityReduction]: MaximalCausalityReduction evaluated 367 transitions and produced 350 states. [2022-02-20 05:00:05,280 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-20 05:00:05,280 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 05:00:05,280 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-02-20 05:00:05,280 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-02-20 05:00:05,281 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2022-02-20 05:00:05,314 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-20 05:00:05,513 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-20 05:00:05,514 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-02-20 05:00:05,514 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 05:00:05,515 INFO L85 PathProgramCache]: Analyzing trace with hash 1938020081, now seen corresponding path program 4 times [2022-02-20 05:00:05,515 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 05:00:05,515 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [974025951] [2022-02-20 05:00:05,515 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 05:00:05,515 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 05:00:05,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 05:00:06,687 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-20 05:00:06,688 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 05:00:06,688 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [974025951] [2022-02-20 05:00:06,688 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [974025951] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 05:00:06,688 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1432959284] [2022-02-20 05:00:06,688 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-02-20 05:00:06,688 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 05:00:06,688 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 05:00:06,691 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-20 05:00:06,692 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-20 05:00:06,796 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-02-20 05:00:06,797 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-20 05:00:06,798 INFO L263 TraceCheckSpWp]: Trace formula consists of 267 conjuncts, 41 conjunts are in the unsatisfiable core [2022-02-20 05:00:06,801 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 05:00:09,804 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-20 05:00:09,805 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 05:05:01,300 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-20 05:05:01,301 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1432959284] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 05:05:01,301 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-20 05:05:01,301 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [42, 42, 42] total 121 [2022-02-20 05:05:01,301 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2069636811] [2022-02-20 05:05:01,301 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-20 05:05:01,302 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 121 states [2022-02-20 05:05:01,302 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 05:05:01,303 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 121 interpolants. [2022-02-20 05:05:01,306 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=946, Invalid=13503, Unknown=71, NotChecked=0, Total=14520 [2022-02-20 05:05:01,306 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-20 05:05:01,306 INFO L470 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-02-20 05:05:01,308 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-20 05:05:01,308 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-02-20 05:05:01,308 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-02-20 05:05:01,308 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2022-02-20 05:05:01,308 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2022-02-20 05:05:01,308 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 36 states. [2022-02-20 05:05:01,309 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-02-20 05:05:14,985 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-20 05:05:15,078 INFO L104 alCausalityReduction]: MaximalCausalityReduction evaluated 401 transitions and produced 385 states. [2022-02-20 05:05:15,079 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-20 05:05:15,079 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 05:05:15,079 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-02-20 05:05:15,079 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-02-20 05:05:15,079 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2022-02-20 05:05:15,079 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2022-02-20 05:05:15,095 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-20 05:05:15,291 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-20 05:05:15,292 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-02-20 05:05:15,292 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 05:05:15,292 INFO L85 PathProgramCache]: Analyzing trace with hash -1765864314, now seen corresponding path program 1 times [2022-02-20 05:05:15,292 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 05:05:15,292 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1463618853] [2022-02-20 05:05:15,292 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 05:05:15,293 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 05:05:15,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 05:05:15,327 INFO L134 CoverageAnalysis]: Checked inductivity of 474 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 474 trivial. 0 not checked. [2022-02-20 05:05:15,327 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 05:05:15,327 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1463618853] [2022-02-20 05:05:15,327 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1463618853] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 05:05:15,327 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 05:05:15,327 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 05:05:15,327 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1220790237] [2022-02-20 05:05:15,327 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 05:05:15,328 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 05:05:15,328 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 05:05:15,328 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 05:05:15,328 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 05:05:15,328 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-20 05:05:15,328 INFO L470 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-02-20 05:05:15,328 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 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-20 05:05:15,328 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-02-20 05:05:15,329 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-02-20 05:05:15,329 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2022-02-20 05:05:15,329 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2022-02-20 05:05:15,329 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 36 states. [2022-02-20 05:05:15,329 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 47 states. [2022-02-20 05:05:15,329 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-02-20 05:05:19,479 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-20 05:05:19,585 INFO L104 alCausalityReduction]: MaximalCausalityReduction evaluated 387 transitions and produced 371 states. [2022-02-20 05:05:19,586 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-20 05:05:19,586 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 05:05:19,586 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-02-20 05:05:19,586 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-02-20 05:05:19,586 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2022-02-20 05:05:19,587 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2022-02-20 05:05:19,588 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 05:05:19,588 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-02-20 05:05:19,588 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2022-02-20 05:05:19,588 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 05:05:19,589 INFO L85 PathProgramCache]: Analyzing trace with hash -820200619, now seen corresponding path program 1 times [2022-02-20 05:05:19,589 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 05:05:19,589 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [300043700] [2022-02-20 05:05:19,589 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 05:05:19,589 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 05:05:19,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 05:05:22,337 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-20 05:05:22,337 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 05:05:22,340 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [300043700] [2022-02-20 05:05:22,340 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [300043700] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 05:05:22,341 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2009904411] [2022-02-20 05:05:22,341 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 05:05:22,342 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 05:05:22,342 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 05:05:22,345 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-20 05:05:22,345 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-02-20 05:05:22,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 05:05:22,444 INFO L263 TraceCheckSpWp]: Trace formula consists of 297 conjuncts, 42 conjunts are in the unsatisfiable core [2022-02-20 05:05:22,447 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 05:05:29,373 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-20 05:05:29,373 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 05:08:10,924 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_~cur~0_39 Int) (v_~prev~0_37 Int) (v_~next~0_36 Int)) (or (< v_~prev~0_37 (+ c_~prev~0 v_~cur~0_39 c_~cur~0)) (< v_~cur~0_39 (+ (* 2 c_~cur~0) c_~prev~0)) (< v_~next~0_36 (+ c_~prev~0 (* 2 v_~cur~0_39) c_~cur~0)) (and (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 ((.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) (<= (+ aux_mod_aux_mod_v_~next~0_33_56_89 c_~j~0 14 .cse0) .cse1) (> 0 aux_mod_aux_mod_v_~next~0_33_56_89) (< aux_div_v_~cur~0_35_51 (+ v_~next~0_36 1)) (< .cse1 (+ aux_mod_aux_mod_v_~next~0_33_56_89 c_~j~0 12 .cse0)) (<= 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 ((aux_div_aux_mod_v_~next~0_33_71_104 Int) (aux_mod_aux_mod_v_~next~0_33_71_104 Int) (aux_div_v_~cur~0_35_51 Int)) (let ((.cse3 (* 2 aux_div_aux_mod_v_~next~0_33_71_104)) (.cse2 (+ (* v_~prev~0_37 3) v_~next~0_36))) (or (< aux_div_v_~cur~0_35_51 (+ v_~next~0_36 1)) (< .cse2 (+ c_~j~0 c_~i~0 12 .cse3 aux_mod_aux_mod_v_~next~0_33_71_104)) (<= 0 (+ (div (+ (* 2 v_~next~0_36) (* (- 2) aux_mod_aux_mod_v_~next~0_33_71_104) (* (- 3) aux_div_aux_mod_v_~next~0_33_71_104) (* 5 v_~prev~0_37)) 4) (* 2 aux_div_v_~cur~0_35_51) aux_div_aux_mod_v_~next~0_33_71_104)) (>= aux_mod_aux_mod_v_~next~0_33_71_104 2) (> 0 aux_mod_aux_mod_v_~next~0_33_71_104) (<= (+ c_~j~0 14 c_~i~0 .cse3 aux_mod_aux_mod_v_~next~0_33_71_104) .cse2))))))) is different from false [2022-02-20 05:09:43,344 INFO L134 CoverageAnalysis]: Checked inductivity of 474 backedges. 0 proven. 451 refuted. 0 times theorem prover too weak. 0 trivial. 23 not checked. [2022-02-20 05:09:43,345 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2009904411] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 05:09:43,345 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-20 05:09:43,345 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [43, 43, 43] total 124 [2022-02-20 05:09:43,351 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [415915701] [2022-02-20 05:09:43,352 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-20 05:09:43,353 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 124 states [2022-02-20 05:09:43,353 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 05:09:43,353 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 124 interpolants. [2022-02-20 05:09:43,356 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=933, Invalid=14037, Unknown=40, NotChecked=242, Total=15252 [2022-02-20 05:09:43,356 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-20 05:09:43,356 INFO L470 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-02-20 05:09:43,357 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 124 states, 124 states have (on average 3.225806451612903) internal successors, (400), 124 states have internal predecessors, (400), 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-20 05:09:43,357 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-02-20 05:09:43,357 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-02-20 05:09:43,357 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2022-02-20 05:09:43,357 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2022-02-20 05:09:43,357 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 36 states. [2022-02-20 05:09:43,357 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 49 states. [2022-02-20 05:09:43,357 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-02-20 05:09:43,357 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-02-20 05:09:54,228 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse2 (+ c_~next~0 1)) (.cse4 (+ 2 c_~next~0 c_~cur~0)) (.cse0 (* (- 1) c_~j~0)) (.cse1 (* (- 1) c_~i~0)) (.cse3 (+ (* 2 c_~next~0) 4 c_~cur~0))) (and (= (+ (- 1) c_~i~0) 0) (<= (div (+ (- 3) .cse0 .cse1 c_~cur~0) (- 2)) .cse2) (<= (div (+ (- 9) .cse0 c_~next~0 c_~cur~0) (- 2)) .cse3) (forall ((aux_mod_v_~next~0_33_71 Int) (aux_div_v_~next~0_33_71 Int) (v_~cur~0_35 Int)) (or (>= aux_mod_v_~next~0_33_71 2) (> 0 aux_mod_v_~next~0_33_71) (< (+ aux_mod_v_~next~0_33_71 c_~j~0 9 c_~i~0) (+ (* 2 v_~cur~0_35) c_~next~0 (* 2 aux_div_v_~next~0_33_71))) (<= (+ (* 5 aux_div_v_~next~0_33_71) v_~cur~0_35) (+ 22 (* aux_mod_v_~next~0_33_71 2) (* 2 c_~i~0) (* 2 c_~j~0))) (< v_~cur~0_35 (+ c_~next~0 c_~cur~0)))) (<= (div (+ .cse0 .cse1 c_~next~0 (- 5)) (- 2)) .cse4) (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_mod_aux_mod_v_~next~0_33_56_89 Int) (aux_div_aux_mod_v_~next~0_33_56_89 Int)) (let ((.cse6 (* aux_div_aux_mod_v_~next~0_33_56_89 2)) (.cse5 (+ (* 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) (< .cse5 (+ 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 (+ (* 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 .cse6) .cse5)))) (forall ((aux_div_aux_mod_v_~next~0_33_71_104 Int) (aux_mod_aux_mod_v_~next~0_33_71_104 Int) (aux_div_v_~cur~0_35_51 Int)) (let ((.cse8 (+ (* v_~prev~0_37 3) c_~next~0)) (.cse7 (* 2 aux_div_aux_mod_v_~next~0_33_71_104))) (or (< aux_div_v_~cur~0_35_51 (+ c_~next~0 1)) (<= 0 (+ (div (+ (* (- 2) aux_mod_aux_mod_v_~next~0_33_71_104) (* (- 3) aux_div_aux_mod_v_~next~0_33_71_104) (* 2 c_~next~0) (* 5 v_~prev~0_37)) 4) (* 2 aux_div_v_~cur~0_35_51) aux_div_aux_mod_v_~next~0_33_71_104)) (>= aux_mod_aux_mod_v_~next~0_33_71_104 2) (<= (+ c_~j~0 14 c_~i~0 .cse7 aux_mod_aux_mod_v_~next~0_33_71_104) .cse8) (> 0 aux_mod_aux_mod_v_~next~0_33_71_104) (< .cse8 (+ c_~j~0 c_~i~0 12 .cse7 aux_mod_aux_mod_v_~next~0_33_71_104)))))))) (forall ((v_~prev~0_37 Int) (v_~next~0_36 Int)) (or (< v_~prev~0_37 c_~next~0) (and (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 ((.cse10 (+ (* v_~prev~0_37 3) v_~next~0_36)) (.cse9 (* 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 .cse9) .cse10) (> 0 aux_mod_aux_mod_v_~next~0_33_56_89) (< aux_div_v_~cur~0_35_51 (+ v_~next~0_36 1)) (< .cse10 (+ 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 (+ (* 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 ((aux_div_aux_mod_v_~next~0_33_71_104 Int) (aux_mod_aux_mod_v_~next~0_33_71_104 Int) (aux_div_v_~cur~0_35_51 Int)) (let ((.cse12 (* 2 aux_div_aux_mod_v_~next~0_33_71_104)) (.cse11 (+ (* v_~prev~0_37 3) v_~next~0_36))) (or (< aux_div_v_~cur~0_35_51 (+ v_~next~0_36 1)) (< .cse11 (+ c_~j~0 c_~i~0 12 .cse12 aux_mod_aux_mod_v_~next~0_33_71_104)) (<= 0 (+ (div (+ (* 2 v_~next~0_36) (* (- 2) aux_mod_aux_mod_v_~next~0_33_71_104) (* (- 3) aux_div_aux_mod_v_~next~0_33_71_104) (* 5 v_~prev~0_37)) 4) (* 2 aux_div_v_~cur~0_35_51) aux_div_aux_mod_v_~next~0_33_71_104)) (>= aux_mod_aux_mod_v_~next~0_33_71_104 2) (> 0 aux_mod_aux_mod_v_~next~0_33_71_104) (<= (+ c_~j~0 14 c_~i~0 .cse12 aux_mod_aux_mod_v_~next~0_33_71_104) .cse11))))) (< v_~next~0_36 (+ c_~next~0 c_~cur~0)))) (= (+ (- 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)))) (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)) (< v_~prev~0_37 (+ c_~next~0 v_~cur~0_39)) (and (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 ((.cse14 (+ (* v_~prev~0_37 3) v_~next~0_36)) (.cse13 (* 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 .cse13) .cse14) (> 0 aux_mod_aux_mod_v_~next~0_33_56_89) (< aux_div_v_~cur~0_35_51 (+ v_~next~0_36 1)) (< .cse14 (+ 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 (+ (* 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 ((aux_div_aux_mod_v_~next~0_33_71_104 Int) (aux_mod_aux_mod_v_~next~0_33_71_104 Int) (aux_div_v_~cur~0_35_51 Int)) (let ((.cse16 (* 2 aux_div_aux_mod_v_~next~0_33_71_104)) (.cse15 (+ (* v_~prev~0_37 3) v_~next~0_36))) (or (< aux_div_v_~cur~0_35_51 (+ v_~next~0_36 1)) (< .cse15 (+ c_~j~0 c_~i~0 12 .cse16 aux_mod_aux_mod_v_~next~0_33_71_104)) (<= 0 (+ (div (+ (* 2 v_~next~0_36) (* (- 2) aux_mod_aux_mod_v_~next~0_33_71_104) (* (- 3) aux_div_aux_mod_v_~next~0_33_71_104) (* 5 v_~prev~0_37)) 4) (* 2 aux_div_v_~cur~0_35_51) aux_div_aux_mod_v_~next~0_33_71_104)) (>= aux_mod_aux_mod_v_~next~0_33_71_104 2) (> 0 aux_mod_aux_mod_v_~next~0_33_71_104) (<= (+ c_~j~0 14 c_~i~0 .cse16 aux_mod_aux_mod_v_~next~0_33_71_104) .cse15))))))) (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_mod_v_~next~0_33_71 Int) (aux_div_v_~next~0_33_71 Int)) (or (>= aux_mod_v_~next~0_33_71 2) (> 0 aux_mod_v_~next~0_33_71) (< (+ aux_mod_v_~next~0_33_71 c_~j~0 9 c_~i~0) (+ (* 2 v_~cur~0_35) (* 2 aux_div_v_~next~0_33_71) c_~cur~0)) (<= (+ (* 5 aux_div_v_~next~0_33_71) v_~cur~0_35) (+ 22 (* aux_mod_v_~next~0_33_71 2) (* 2 c_~i~0) (* 2 c_~j~0)))))))) (<= 1 c_~next~0) (<= (div (+ (- 3) .cse0 c_~cur~0) (- 2)) .cse2) (<= (div (+ .cse0 c_~next~0 (- 5)) (- 2)) .cse4) (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_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)))))) (forall ((aux_div_aux_mod_v_~next~0_33_71_104 Int) (aux_mod_aux_mod_v_~next~0_33_71_104 Int) (aux_div_v_~cur~0_35_51 Int)) (let ((.cse20 (* 2 aux_div_aux_mod_v_~next~0_33_71_104)) (.cse19 (+ (* v_~prev~0_37 3) v_~next~0_36))) (or (< aux_div_v_~cur~0_35_51 (+ v_~next~0_36 1)) (< .cse19 (+ c_~j~0 c_~i~0 12 .cse20 aux_mod_aux_mod_v_~next~0_33_71_104)) (<= 0 (+ (div (+ (* 2 v_~next~0_36) (* (- 2) aux_mod_aux_mod_v_~next~0_33_71_104) (* (- 3) aux_div_aux_mod_v_~next~0_33_71_104) (* 5 v_~prev~0_37)) 4) (* 2 aux_div_v_~cur~0_35_51) aux_div_aux_mod_v_~next~0_33_71_104)) (>= aux_mod_aux_mod_v_~next~0_33_71_104 2) (> 0 aux_mod_aux_mod_v_~next~0_33_71_104) (<= (+ c_~j~0 14 c_~i~0 .cse20 aux_mod_aux_mod_v_~next~0_33_71_104) .cse19))))))) (= (+ (- 1) c_~prev~0) 0) (<= 1 c_~cur~0) (<= (div (+ (- 9) .cse0 .cse1 c_~next~0 c_~cur~0) (- 2)) .cse3))) is different from false [2022-02-20 05:14:07,381 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse6 (+ c_~next~0 c_~cur~0)) (.cse13 (* c_~next~0 55)) (.cse3 (* c_~prev~0 34)) (.cse2 (+ c_~next~0 1)) (.cse11 (* c_~next~0 34)) (.cse5 (+ 2 c_~next~0 c_~cur~0)) (.cse12 (* 21 c_~prev~0)) (.cse14 (* 34 c_~cur~0)) (.cse0 (* (- 1) c_~j~0)) (.cse1 (* (- 1) c_~i~0)) (.cse4 (+ (* 2 c_~next~0) 4 c_~cur~0))) (and (= (+ (- 1) c_~i~0) 0) (<= (div (+ (- 3) .cse0 .cse1 c_~cur~0) (- 2)) .cse2) (<= 144 (+ .cse3 (* 55 c_~cur~0))) (<= (div (+ (- 9) .cse0 c_~next~0 c_~cur~0) (- 2)) .cse4) (forall ((aux_mod_v_~next~0_33_71 Int) (aux_div_v_~next~0_33_71 Int) (v_~cur~0_35 Int)) (or (>= aux_mod_v_~next~0_33_71 2) (> 0 aux_mod_v_~next~0_33_71) (< (+ aux_mod_v_~next~0_33_71 c_~j~0 9 c_~i~0) (+ (* 2 v_~cur~0_35) c_~next~0 (* 2 aux_div_v_~next~0_33_71))) (<= (+ (* 5 aux_div_v_~next~0_33_71) v_~cur~0_35) (+ 22 (* aux_mod_v_~next~0_33_71 2) (* 2 c_~i~0) (* 2 c_~j~0))) (< v_~cur~0_35 (+ c_~next~0 c_~cur~0)))) (<= (div (+ .cse0 .cse1 c_~next~0 (- 5)) (- 2)) .cse5) (< (+ c_~j~0 c_~i~0) .cse6) (<= 3 c_~cur~0) (<= 2 c_~prev~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_mod_aux_mod_v_~next~0_33_56_89 Int) (aux_div_aux_mod_v_~next~0_33_56_89 Int)) (let ((.cse8 (* aux_div_aux_mod_v_~next~0_33_56_89 2)) (.cse7 (+ (* 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) (< .cse7 (+ aux_mod_aux_mod_v_~next~0_33_56_89 c_~j~0 12 .cse8)) (<= 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 .cse8) .cse7)))) (forall ((aux_div_aux_mod_v_~next~0_33_71_104 Int) (aux_mod_aux_mod_v_~next~0_33_71_104 Int) (aux_div_v_~cur~0_35_51 Int)) (let ((.cse10 (+ (* v_~prev~0_37 3) c_~next~0)) (.cse9 (* 2 aux_div_aux_mod_v_~next~0_33_71_104))) (or (< aux_div_v_~cur~0_35_51 (+ c_~next~0 1)) (<= 0 (+ (div (+ (* (- 2) aux_mod_aux_mod_v_~next~0_33_71_104) (* (- 3) aux_div_aux_mod_v_~next~0_33_71_104) (* 2 c_~next~0) (* 5 v_~prev~0_37)) 4) (* 2 aux_div_v_~cur~0_35_51) aux_div_aux_mod_v_~next~0_33_71_104)) (>= aux_mod_aux_mod_v_~next~0_33_71_104 2) (<= (+ c_~j~0 14 c_~i~0 .cse9 aux_mod_aux_mod_v_~next~0_33_71_104) .cse10) (> 0 aux_mod_aux_mod_v_~next~0_33_71_104) (< .cse10 (+ c_~j~0 c_~i~0 12 .cse9 aux_mod_aux_mod_v_~next~0_33_71_104)))))))) (<= 144 (+ .cse11 .cse12)) (< c_~j~0 .cse6) (= (+ (- 1) c_~j~0) 0) (<= 144 (+ .cse13 .cse14)) (<= 144 (+ .cse13 .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 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)))) (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)) (< v_~prev~0_37 (+ c_~next~0 v_~cur~0_39)) (and (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 ((.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) (<= (+ aux_mod_aux_mod_v_~next~0_33_56_89 c_~j~0 14 .cse15) .cse16) (> 0 aux_mod_aux_mod_v_~next~0_33_56_89) (< aux_div_v_~cur~0_35_51 (+ v_~next~0_36 1)) (< .cse16 (+ aux_mod_aux_mod_v_~next~0_33_56_89 c_~j~0 12 .cse15)) (<= 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 ((aux_div_aux_mod_v_~next~0_33_71_104 Int) (aux_mod_aux_mod_v_~next~0_33_71_104 Int) (aux_div_v_~cur~0_35_51 Int)) (let ((.cse18 (* 2 aux_div_aux_mod_v_~next~0_33_71_104)) (.cse17 (+ (* v_~prev~0_37 3) v_~next~0_36))) (or (< aux_div_v_~cur~0_35_51 (+ v_~next~0_36 1)) (< .cse17 (+ c_~j~0 c_~i~0 12 .cse18 aux_mod_aux_mod_v_~next~0_33_71_104)) (<= 0 (+ (div (+ (* 2 v_~next~0_36) (* (- 2) aux_mod_aux_mod_v_~next~0_33_71_104) (* (- 3) aux_div_aux_mod_v_~next~0_33_71_104) (* 5 v_~prev~0_37)) 4) (* 2 aux_div_v_~cur~0_35_51) aux_div_aux_mod_v_~next~0_33_71_104)) (>= aux_mod_aux_mod_v_~next~0_33_71_104 2) (> 0 aux_mod_aux_mod_v_~next~0_33_71_104) (<= (+ c_~j~0 14 c_~i~0 .cse18 aux_mod_aux_mod_v_~next~0_33_71_104) .cse17))))))) (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_mod_v_~next~0_33_71 Int) (aux_div_v_~next~0_33_71 Int)) (or (>= aux_mod_v_~next~0_33_71 2) (> 0 aux_mod_v_~next~0_33_71) (< (+ aux_mod_v_~next~0_33_71 c_~j~0 9 c_~i~0) (+ (* 2 v_~cur~0_35) (* 2 aux_div_v_~next~0_33_71) c_~cur~0)) (<= (+ (* 5 aux_div_v_~next~0_33_71) v_~cur~0_35) (+ 22 (* aux_mod_v_~next~0_33_71 2) (* 2 c_~i~0) (* 2 c_~j~0)))))))) (<= c_~j~0 1) (<= (div (+ (- 3) .cse0 c_~cur~0) (- 2)) .cse2) (<= 144 (+ .cse11 (* 21 c_~cur~0))) (<= (div (+ .cse0 c_~next~0 (- 5)) (- 2)) .cse5) (<= 3 c_~next~0) (<= 144 (+ .cse12 .cse14)) (<= c_~i~0 1) (<= (div (+ (- 9) .cse0 .cse1 c_~next~0 c_~cur~0) (- 2)) .cse4))) is different from false [2022-02-20 05:14:10,458 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse5 (* 21 c_~next~0)) (.cse8 (+ c_~next~0 c_~cur~0)) (.cse11 (* c_~next~0 55)) (.cse3 (* c_~prev~0 34)) (.cse2 (+ c_~next~0 1)) (.cse4 (* c_~prev~0 13)) (.cse9 (* c_~next~0 34)) (.cse17 (* 21 c_~cur~0)) (.cse7 (+ 2 c_~next~0 c_~cur~0)) (.cse10 (* 21 c_~prev~0)) (.cse12 (* 34 c_~cur~0)) (.cse0 (* (- 1) c_~j~0)) (.cse1 (* (- 1) c_~i~0)) (.cse6 (+ (* 2 c_~next~0) 4 c_~cur~0))) (and (= (+ (- 1) c_~i~0) 0) (<= (div (+ (- 3) .cse0 .cse1 c_~cur~0) (- 2)) .cse2) (<= 144 (+ .cse3 (* 55 c_~cur~0))) (<= 144 (+ .cse4 .cse5)) (<= (div (+ (- 9) .cse0 c_~next~0 c_~cur~0) (- 2)) .cse6) (<= 3 c_~prev~0) (forall ((aux_mod_v_~next~0_33_71 Int) (aux_div_v_~next~0_33_71 Int) (v_~cur~0_35 Int)) (or (>= aux_mod_v_~next~0_33_71 2) (> 0 aux_mod_v_~next~0_33_71) (< (+ aux_mod_v_~next~0_33_71 c_~j~0 9 c_~i~0) (+ (* 2 v_~cur~0_35) c_~next~0 (* 2 aux_div_v_~next~0_33_71))) (<= (+ (* 5 aux_div_v_~next~0_33_71) v_~cur~0_35) (+ 22 (* aux_mod_v_~next~0_33_71 2) (* 2 c_~i~0) (* 2 c_~j~0))) (< v_~cur~0_35 (+ c_~next~0 c_~cur~0)))) (<= (div (+ .cse0 .cse1 c_~next~0 (- 5)) (- 2)) .cse7) (< (+ c_~j~0 c_~i~0) .cse8) (<= 144 (+ (* 13 c_~cur~0) .cse5)) (<= 144 (+ .cse9 .cse10)) (<= 5 c_~cur~0) (< c_~j~0 .cse8) (= (+ (- 1) c_~j~0) 0) (<= 144 (+ .cse11 .cse12)) (<= 144 (+ .cse11 .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 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)))) (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)) (< v_~prev~0_37 (+ c_~next~0 v_~cur~0_39)) (and (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 ((.cse14 (+ (* v_~prev~0_37 3) v_~next~0_36)) (.cse13 (* 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 .cse13) .cse14) (> 0 aux_mod_aux_mod_v_~next~0_33_56_89) (< aux_div_v_~cur~0_35_51 (+ v_~next~0_36 1)) (< .cse14 (+ 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 (+ (* 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 ((aux_div_aux_mod_v_~next~0_33_71_104 Int) (aux_mod_aux_mod_v_~next~0_33_71_104 Int) (aux_div_v_~cur~0_35_51 Int)) (let ((.cse16 (* 2 aux_div_aux_mod_v_~next~0_33_71_104)) (.cse15 (+ (* v_~prev~0_37 3) v_~next~0_36))) (or (< aux_div_v_~cur~0_35_51 (+ v_~next~0_36 1)) (< .cse15 (+ c_~j~0 c_~i~0 12 .cse16 aux_mod_aux_mod_v_~next~0_33_71_104)) (<= 0 (+ (div (+ (* 2 v_~next~0_36) (* (- 2) aux_mod_aux_mod_v_~next~0_33_71_104) (* (- 3) aux_div_aux_mod_v_~next~0_33_71_104) (* 5 v_~prev~0_37)) 4) (* 2 aux_div_v_~cur~0_35_51) aux_div_aux_mod_v_~next~0_33_71_104)) (>= aux_mod_aux_mod_v_~next~0_33_71_104 2) (> 0 aux_mod_aux_mod_v_~next~0_33_71_104) (<= (+ c_~j~0 14 c_~i~0 .cse16 aux_mod_aux_mod_v_~next~0_33_71_104) .cse15))))))) (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_mod_v_~next~0_33_71 Int) (aux_div_v_~next~0_33_71 Int)) (or (>= aux_mod_v_~next~0_33_71 2) (> 0 aux_mod_v_~next~0_33_71) (< (+ aux_mod_v_~next~0_33_71 c_~j~0 9 c_~i~0) (+ (* 2 v_~cur~0_35) (* 2 aux_div_v_~next~0_33_71) c_~cur~0)) (<= (+ (* 5 aux_div_v_~next~0_33_71) v_~cur~0_35) (+ 22 (* aux_mod_v_~next~0_33_71 2) (* 2 c_~i~0) (* 2 c_~j~0)))))))) (<= c_~j~0 1) (<= (div (+ (- 3) .cse0 c_~cur~0) (- 2)) .cse2) (<= 144 (+ .cse17 .cse4)) (<= 144 (+ .cse9 .cse17)) (<= (div (+ .cse0 c_~next~0 (- 5)) (- 2)) .cse7) (<= 144 (+ .cse10 .cse12)) (<= 5 c_~next~0) (<= c_~i~0 1) (<= (div (+ (- 9) .cse0 .cse1 c_~next~0 c_~cur~0) (- 2)) .cse6))) is different from false Received shutdown request... [2022-02-20 05:14:28,142 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-20 05:14:28,142 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2022-02-20 05:14:28,142 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-20 05:14:29,105 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-20 05:14:29,173 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-20 05:14:29,288 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-20 05:14:29,288 WARN L594 AbstractCegarLoop]: Verification canceled: while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 144 known predicates. [2022-02-20 05:14:29,290 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (2 of 3 remaining) [2022-02-20 05:14:29,290 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATION (1 of 3 remaining) [2022-02-20 05:14:29,290 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1INUSE_VIOLATION (0 of 3 remaining) [2022-02-20 05:14:29,294 INFO L732 BasicCegarLoop]: Path program histogram: [4, 1, 1, 1, 1] [2022-02-20 05:14:29,296 INFO L230 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-02-20 05:14:29,296 INFO L180 ceAbstractionStarter]: Computing trace abstraction results [2022-02-20 05:14:29,297 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.02 05:14:29 BasicIcfg [2022-02-20 05:14:29,297 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-02-20 05:14:29,298 INFO L158 Benchmark]: Toolchain (without parser) took 870062.95ms. Allocated memory was 186.6MB in the beginning and 515.9MB in the end (delta: 329.3MB). Free memory was 156.8MB in the beginning and 380.1MB in the end (delta: -223.3MB). Peak memory consumption was 105.9MB. Max. memory is 8.0GB. [2022-02-20 05:14:29,298 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 186.6MB. Free memory is still 144.4MB. There was no memory consumed. Max. memory is 8.0GB. [2022-02-20 05:14:29,298 INFO L158 Benchmark]: CACSL2BoogieTranslator took 593.68ms. Allocated memory was 186.6MB in the beginning and 287.3MB in the end (delta: 100.7MB). Free memory was 156.6MB in the beginning and 249.6MB in the end (delta: -93.0MB). Peak memory consumption was 12.9MB. Max. memory is 8.0GB. [2022-02-20 05:14:29,298 INFO L158 Benchmark]: Boogie Procedure Inliner took 66.77ms. Allocated memory is still 287.3MB. Free memory was 249.6MB in the beginning and 248.0MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-02-20 05:14:29,299 INFO L158 Benchmark]: Boogie Preprocessor took 29.91ms. Allocated memory is still 287.3MB. Free memory was 248.0MB in the beginning and 246.4MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-02-20 05:14:29,299 INFO L158 Benchmark]: RCFGBuilder took 387.88ms. Allocated memory is still 287.3MB. Free memory was 246.4MB in the beginning and 233.8MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2022-02-20 05:14:29,299 INFO L158 Benchmark]: TraceAbstraction took 868979.28ms. Allocated memory was 287.3MB in the beginning and 515.9MB in the end (delta: 228.6MB). Free memory was 233.3MB in the beginning and 380.1MB in the end (delta: -146.8MB). Peak memory consumption was 82.8MB. Max. memory is 8.0GB. [2022-02-20 05:14:29,300 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.10ms. Allocated memory is still 186.6MB. Free memory is still 144.4MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 593.68ms. Allocated memory was 186.6MB in the beginning and 287.3MB in the end (delta: 100.7MB). Free memory was 156.6MB in the beginning and 249.6MB in the end (delta: -93.0MB). Peak memory consumption was 12.9MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 66.77ms. Allocated memory is still 287.3MB. Free memory was 249.6MB in the beginning and 248.0MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 29.91ms. Allocated memory is still 287.3MB. Free memory was 248.0MB in the beginning and 246.4MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 387.88ms. Allocated memory is still 287.3MB. Free memory was 246.4MB in the beginning and 233.8MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * TraceAbstraction took 868979.28ms. Allocated memory was 287.3MB in the beginning and 515.9MB in the end (delta: 228.6MB). Free memory was 233.3MB in the beginning and 380.1MB in the end (delta: -146.8MB). Peak memory consumption was 82.8MB. 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 PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 144 known predicates. - 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 PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 144 known predicates. - 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 PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 144 known predicates. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 112 locations, 3 error locations. Started 1 CEGAR loops. OverallTime: 868.9s, OverallIterations: 8, TraceHistogramMax: 0, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 305.8s, HoareTripleCheckerStatistics: , PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=0occurred in iteration=0, InterpolantAutomatonStates: 150, 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, 560.7s InterpolantComputationTime, 1286 NumberOfCodeBlocks, 1271 NumberOfCodeBlocksAsserted, 21 NumberOfCheckSat, 1784 ConstructedInterpolants, 148 QuantifiedInterpolants, 28775 SizeOfPredicates, 102 NumberOfNonLiveVariables, 1116 ConjunctsInSsa, 111 ConjunctsInUnsatCore, 18 InterpolantComputations, 3 PerfectInterpolantSequences, 1144/3855 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